Gen

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final val alphaNumericChar: Gen[Random, Char]

   

   A generator of alphanumeric characters.

   A generator of alphanumeric characters. Shrinks toward '0'.

5. final val anyByte: Gen[Random, Byte]

   

   A generator of bytes.

   A generator of bytes. Shrinks toward '0'.

6. final val anyChar: Gen[Random, Char]

   

   A generator of characters.

   A generator of characters. Shrinks toward '0'.

7. final val anyFloat: Gen[Random, Float]

   

   A generator of integers.

   A generator of integers. Shrinks toward '0'.

8. final val anyInt: Gen[Random, Int]

   

   A generator of integers.

   A generator of integers. Shrinks toward '0'.

9. final val anyLong: Gen[Random, Long]

   

   A generator of longs.

   A generator of longs. Shrinks toward '0'.

10. final val anyShort: Gen[Random, Short]

    

    A generator of shorts.

    A generator of shorts. Shrinks toward '0'.

11. final def anyString: Gen[Random with Sized, String]

    

    A generator of strings.

    A generator of strings. Shrinks towards the empty string.

12. final val anyUnicodeChar: Gen[Random, Char]

    

    A generator of Unicode characters.

    A generator of Unicode characters. Shrinks toward '0'.

13. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

14. final val boolean: Gen[Random, Boolean]

    

    A generator of booleans.

    A generator of booleans. Shrinks toward 'false'.

15. final def byte(min: Byte, max: Byte): Gen[Random, Byte]

    

    A generator of byte values inside the specified range: [start, end].

    A generator of byte values inside the specified range: [start, end]. The shrinker will shrink toward the lower end of the range ("smallest").

16. final def causes[R <: Random with Sized, E](e: Gen[R, E], t: Gen[R, Throwable]): Gen[R, Cause[E]]

    

    A generator of Cause values

    A generator of Cause values

    Definition Classes

    GenZIO

17. final def chained[R <: Random with Sized, Env, E, A](gen: Gen[R, ZIO[Env, E, A]]): Gen[R, ZIO[Env, E, A]]

    

    A generator of effects that are the result of chaining the specified effect with itself a random number of times.

    A generator of effects that are the result of chaining the specified effect with itself a random number of times.

    Definition Classes

    GenZIO

18. final def chainedN[R <: Random, Env, E, A](n: Int)(zio: Gen[R, ZIO[Env, E, A]]): Gen[R, ZIO[Env, E, A]]

    

    A generator of effects that are the result of chaining the specified effect with itself a given number of times.

    A generator of effects that are the result of chaining the specified effect with itself a given number of times.

    Definition Classes

    GenZIO

19. final def char(min: Char, max: Char): Gen[Random, Char]

    

    A generator of character values inside the specified range: [start, end].

    A generator of character values inside the specified range: [start, end]. The shrinker will shrink toward the lower end of the range ("smallest").

20. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

21. final def concurrent[R, E, A](zio: ZIO[R, E, A]): Gen[Any, ZIO[R, E, A]]

    

    A generator of effects that are the result of applying concurrency combinators to the specified effect that are guaranteed not to change its value.

    A generator of effects that are the result of applying concurrency combinators to the specified effect that are guaranteed not to change its value.

    Definition Classes

    GenZIO

22. final def const[A](a: ⇒ A): Gen[Any, A]

    

    A constant generator of the specified value.

23. final def constSample[R, A](sample: ⇒ Sample[R, A]): Gen[R, A]

    

    A constant generator of the specified sample.

24. final def died[R](gen: Gen[R, Throwable]): Gen[R, ZIO[Any, Nothing, Nothing]]

    

    A generator of effects that have died with a Throwable.

    A generator of effects that have died with a Throwable.

    Definition Classes

    GenZIO

25. final def double(min: Double, max: Double): Gen[Random, Double]

    

    A generator of double values inside the specified range: [start, end].

    A generator of double values inside the specified range: [start, end]. The shrinker will shrink toward the lower end of the range ("smallest").

26. final def either[R <: Random, A, B](left: Gen[R, A], right: Gen[R, B]): Gen[R, Either[A, B]]

    

27. final def elements[A](as: A*): Gen[Random, A]

    

28. final val empty: Gen[Any, Nothing]

    

29. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

30. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

31. final val exponential: Gen[Random, Double]

    

    A generator of exponentially distributed doubles with mean 1.

    A generator of exponentially distributed doubles with mean 1. The shrinker will shrink toward 0.

32. final def failures[R, E](gen: Gen[R, E]): Gen[R, ZIO[Any, E, Nothing]]

    

    A generator of effects that have failed with an error.

    A generator of effects that have failed with an error.

    Definition Classes

    GenZIO

33. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

34. final def fromEffect[R, A](effect: ZIO[R, Nothing, A]): Gen[R, A]

    

    Constructs a generator from an effect that constructs a value.

35. final def fromEffectSample[R, A](effect: ZIO[R, Nothing, Sample[R, A]]): Gen[R, A]

    

    Constructs a generator from an effect that constructs a sample.

36. final def fromIterable[R, A](as: Iterable[A], shrinker: (A) ⇒ ZStream[R, Nothing, A] = defaultShrinker): Gen[R, A]

    

    Constructs a deterministic generator that only generates the specified fixed values.

37. final def fromRandom[A](f: (Service[Any]) ⇒ UIO[A]): Gen[Random, A]

    

    Constructs a generator from a function that uses randomness.

    Constructs a generator from a function that uses randomness. The returned generator will not have any shrinking.

38. final def fromRandomSample[R <: Random, A](f: (Service[Any]) ⇒ UIO[Sample[R, A]]): Gen[R, A]

    

    Constructs a generator from a function that uses randomness to produce a sample.

39. final def function[R, A, B](gen: Gen[R, B]): Gen[R, (A) ⇒ B]

    

    Constructs a generator of functions from A to B given a generator of B values.

    Constructs a generator of functions from A to B given a generator of B values. Two A values will be considered to be equal, and thus will be guaranteed to generate the same B value, if they have the same hashCode.

    Definition Classes

    FunctionVariants

40. final def function2[R, A, B, C](gen: Gen[R, C]): Gen[R, (A, B) ⇒ C]

    

    A version of function that generates functions that accept two parameters.

    A version of function that generates functions that accept two parameters.

    Definition Classes

    FunctionVariants

41. final def function3[R, A, B, C, D](gen: Gen[R, D]): Gen[R, (A, B, C) ⇒ D]

    

    A version of function that generates functions that accept three parameters.

    A version of function that generates functions that accept three parameters.

    Definition Classes

    FunctionVariants

42. final def function4[R, A, B, C, D, E](gen: Gen[R, E]): Gen[R, (A, B, C, D) ⇒ E]

    

    A version of function that generates functions that accept four parameters.

    A version of function that generates functions that accept four parameters.

    Definition Classes

    FunctionVariants

43. final def functionWith[R, A, B](gen: Gen[R, B])(hash: (A) ⇒ Int): Gen[R, (A) ⇒ B]

    

    Constructs a generator of functions from A to B given a generator of B values and a hashing function for A values.

    Constructs a generator of functions from A to B given a generator of B values and a hashing function for A values. Two A values will be considered to be equal, and thus will be guaranteed to generate the same B value, if they have have the same hash. This is useful when A does not implement hashCode in a way that is constent with equality.

    Definition Classes

    FunctionVariants

44. final def functionWith2[R, A, B, C](gen: Gen[R, C])(hash: (A, B) ⇒ Int): Gen[R, (A, B) ⇒ C]

    

    A version of functionWith that generates functions that accept two parameters.

    A version of functionWith that generates functions that accept two parameters.

    Definition Classes

    FunctionVariants

45. final def functionWith3[R, A, B, C, D](gen: Gen[R, D])(hash: (A, B, C) ⇒ Int): Gen[R, (A, B, C) ⇒ D]

    

    A version of functionWith that generates functions that accept three parameters.

    A version of functionWith that generates functions that accept three parameters.

    Definition Classes

    FunctionVariants

46. final def functionWith4[R, A, B, C, D, E](gen: Gen[R, E])(hash: (A, B, C, D) ⇒ Int): Gen[R, (A, B, C, D) ⇒ E]

    

    A version of functionWith that generates functions that accept four parameters.

    A version of functionWith that generates functions that accept four parameters.

    Definition Classes

    FunctionVariants

47. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

48. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

49. final def int(min: Int, max: Int): Gen[Random, Int]

    

    A generator of integers inside the specified range: [start, end].

    A generator of integers inside the specified range: [start, end]. The shrinker will shrink toward the lower end of the range ("smallest").

50. final def integral[A](min: A, max: A)(implicit I: Integral[A]): Gen[Random, A]

    

    A generator of integral values inside the specified range: [start, end].

    A generator of integral values inside the specified range: [start, end]. The shrinker will shrink toward the lower end of the range ("smallest").

51. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

52. final def large[R <: Random with Sized, A](f: (Int) ⇒ Gen[R, A], min: Int = 0): Gen[R, A]

    

    A sized generator that uses a uniform distribution of size values.

    A sized generator that uses a uniform distribution of size values. A large number of larger sizes will be generated.

53. final def listOf[R <: Random with Sized, A](g: Gen[R, A]): Gen[R, List[A]]

    

54. final def listOf1[R <: Random with Sized, A](g: Gen[R, A]): Gen[R, List[A]]

    

55. final def listOfN[R <: Random, A](n: Int)(g: Gen[R, A]): Gen[R, List[A]]

    

56. final def medium[R <: Random with Sized, A](f: (Int) ⇒ Gen[R, A], min: Int = 0): Gen[R, A]

    

    A sized generator that uses an exponential distribution of size values.

    A sized generator that uses an exponential distribution of size values. The majority of sizes will be towards the lower end of the range but some larger sizes will be generated as well.

57. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

58. final val none: Gen[Any, Option[Nothing]]

    

    A constant generator of the empty value.

59. final def notify(): Unit

    

    Definition Classes

    AnyRef

60. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

61. final def oneOf[R <: Random, A](as: Gen[R, A]*): Gen[R, A]

    

62. final def option[R <: Random, A](gen: Gen[R, A]): Gen[R, Option[A]]

    

    A generator of optional values.

    A generator of optional values. Shrinks toward None.

63. final def parallel[R, E, A](zio: ZIO[R, E, A]): Gen[Any, ZIO[R, E, A]]

    

    A generator of effects that are the result of applying parallelism combinators to the specified effect that are guaranteed not to change its value.

    A generator of effects that are the result of applying parallelism combinators to the specified effect that are guaranteed not to change its value.

    Definition Classes

    GenZIO

64. final def partialFunction[R <: Random, A, B](gen: Gen[R, B]): Gen[R, PartialFunction[A, B]]

    

    Constructs a generator of partial functions from A to B given a generator of B values.

    Constructs a generator of partial functions from A to B given a generator of B values. Two A values will be considered to be equal, and thus will be guaranteed to generate the same B value or both be outside the partial functon's domain, if they have the same hashCode.

65. final def partialFunctionWith[R <: Random, A, B](gen: Gen[R, B])(hash: (A) ⇒ Int): Gen[R, PartialFunction[A, B]]

    

    Constructs a generator of partial functions from A to B given a generator of B values and a hashing function for A values.

    Constructs a generator of partial functions from A to B given a generator of B values and a hashing function for A values. Two A values will be considered to be equal, and thus will be guaranteed to generate the same B value or both be outside the partial function's domain, if they have have the same hash. This is useful when A does not implement hashCode in a way that is constent with equality.

66. final val printableChar: Gen[Random, Char]

    

    A generator of printable characters.

    A generator of printable characters. Shrinks toward '!'.

67. final def short(min: Short, max: Short): Gen[Random, Short]

    

    A generator of short values inside the specified range: [start, end].

    A generator of short values inside the specified range: [start, end]. The shrinker will shrink toward the lower end of the range ("smallest").

68. final def size: Gen[Sized, Int]

    

69. final def sized[R <: Sized, A](f: (Int) ⇒ Gen[R, A]): Gen[R, A]

    

    A sized generator, whose size falls within the specified bounds.

70. final def small[R <: Random with Sized, A](f: (Int) ⇒ Gen[R, A], min: Int = 0): Gen[R, A]

    

    A sized generator that uses an exponential distribution of size values.

    A sized generator that uses an exponential distribution of size values. The values generated will be strongly concentrated towards the lower end of the range but a few larger values will still be generated.

71. final def some[R, A](gen: Gen[R, A]): Gen[R, Option[A]]

    

72. final def string[R <: Random with Sized](char: Gen[R, Char]): Gen[R, String]

    

73. final def string1[R <: Random with Sized](char: Gen[R, Char]): Gen[R, String]

    

74. final def stringN[R <: Random](n: Int)(char: Gen[R, Char]): Gen[R, String]

    

75. final def successes[R, A](gen: Gen[R, A]): Gen[R, ZIO[Any, Nothing, A]]

    

    A generator of successful effects.

    A generator of successful effects.

    Definition Classes

    GenZIO

76. final def suspend[R, A](gen: ⇒ Gen[R, A]): Gen[R, A]

    

    Lazily constructs a generator.

    Lazily constructs a generator. This is useful to avoid infinite recursion when creating generators that refer to themselves.

77. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

78. final val throwable: Gen[Random, Throwable]

    

    A generator of throwables.

79. def toString(): String

    

    Definition Classes

    AnyRef → Any

80. final def uniform: Gen[Random, Double]

    

    A generator of uniformly distributed doubles between [0, 1].

    A generator of uniformly distributed doubles between [0, 1]. The shrinker will shrink toward 0.

81. final val unit: Gen[Any, Unit]

    

    A constant generator of the unit value.

82. final def vectorOf[R <: Random with Sized, A](g: Gen[R, A]): Gen[R, Vector[A]]

    

83. final def vectorOf1[R <: Random with Sized, A](g: Gen[R, A]): Gen[R, Vector[A]]

    

84. final def vectorOfN[R <: Random, A](n: Int)(g: Gen[R, A]): Gen[R, Vector[A]]

    

85. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

86. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

87. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

88. final def weighted[R <: Random, A](gs: (Gen[R, A], Double)*): Gen[R, A]