Gen

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def <&>[R1 <: R, B](that: Gen[R1, B]): Gen[R1, (A, B)]

   

   A symbolic alias for zip.

4. def <*>[R1 <: R, B](that: Gen[R1, B]): Gen[R1, (A, B)]

   

   A symbolic alias for cross.

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

   

   Definition Classes

   AnyRef → Any

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def cross[R1 <: R, B](that: Gen[R1, B]): Gen[R1, (A, B)]

   

   Composes this generator with the specified generator to create a cartesian product of elements.

9. def crossWith[R1 <: R, B, C](that: Gen[R1, B])(f: (A, B) ⇒ C): Gen[R1, C]

   

   Composes this generator with the specified generator to create a cartesian product of elements with the specified function.

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

    

    Definition Classes

    AnyRef

11. def filter(f: (A) ⇒ Boolean): Gen[R, A]

    

    Filters the values produced by this generator, discarding any values that do not meet the specified predicate.

    Filters the values produced by this generator, discarding any values that do not meet the specified predicate. Using filter can reduce test performance, especially if many values must be discarded. It is recommended to use combinators such as map and flatMap to create generators of the desired values instead.

    val evens: Gen[Random, Int] = Gen.anyInt.map(_ * 2)

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

13. def flatMap[R1 <: R, B](f: (A) ⇒ Gen[R1, B]): Gen[R1, B]

    

14. def flatten[R1 <: R, B](implicit ev: <:<[A, Gen[R1, B]]): Gen[R1, B]

    

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

    

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. def map[B](f: (A) ⇒ B): Gen[R, B]

    

18. def mapM[R1 <: R, B](f: (A) ⇒ ZIO[R1, Nothing, B]): Gen[R1, B]

    

    Maps an effectual function over a generator.

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

    

    Definition Classes

    AnyRef

20. def noShrink: Gen[R, A]

    

    Discards the shrinker for this generator.

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. def reshrink[R1 <: R, B](f: (A) ⇒ Sample[R1, B]): Gen[R1, B]

    

    Discards the shrinker for this generator and applies a new shrinker by mapping each value to a sample using the specified function.

    Discards the shrinker for this generator and applies a new shrinker by mapping each value to a sample using the specified function. This is useful when the process to shrink a value is simpler than the process used to generate it.

24. def runCollect: ZIO[R, Nothing, List[A]]

    

    Runs the generator and collects all of its values in a list.

25. def runCollectN(n: Int): ZIO[R, Nothing, List[A]]

    

    Repeatedly runs the generator and collects the specified number of values in a list.

26. def runHead: ZIO[R, Nothing, Option[A]]

    

    Runs the generator returning the first value of the generator.

27. val sample: ZStream[R, Nothing, Sample[R, A]]

    

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

    

    Definition Classes

    AnyRef

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32. def withFilter(f: (A) ⇒ Boolean): Gen[R, A]

    

33. def zip[R1 <: R, B](that: Gen[R1, B]): Gen[R1, (A, B)]

    

    Zips two generators together pairwise.

    Zips two generators together pairwise. The new generator will generate elements as long as either generator is generating elements, running the other generator multiple times if necessary.

34. def zipWith[R1 <: R, B, C](that: Gen[R1, B])(f: (A, B) ⇒ C): Gen[R1, C]

    

    Zips two generators together pairwise with the specified function.

    Zips two generators together pairwise with the specified function. The new generator will generate elements as long as either generator is generating elements, running the other generator multiple times if necessary.