Generator

no.vedaadata.generator.Generator
See theGenerator companion trait
object Generator

Attributes

Companion
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Generator.type

Members list

Value members

Concrete methods

def apply[A](using generator: Generator[A]): Generator[A]
def apply[A](xs: Seq[A]): Generator[A]
def from[A](x: A, xs: A*): Generator[A]
def generate[A](n: Int)(using generator: Generator[A]): List[A]
def generateOne[A]()(using generator: Generator[A]): Option[A]
def of[A](x: A): Generator[A]
def pick[A](n: Int)(xs: Iterable[A]): Generator[List[A]]
def recursive[A](init: A, f: A => A): Generator[A]

Givens

Givens

inline given derived[P <: Product](using m: ProductOf[P]): Generator[P]
given given_Generator_BigDecimal(using doubleGenerator: Generator[Double]): Generator[BigDecimal]
given given_Generator_BigInt(using longGenerator: Generator[Long]): Generator[BigInt]
given given_Generator_Byte(using intGenerator: Generator[Int]): Generator[Byte]
given given_Generator_Option[A](using inner: Generator[A]): Generator[Option[A]]
given given_Generator_Short(using intGenerator: Generator[Int]): Generator[Short]
given given_Generator_Try[A](using inner: Generator[A]): Generator[Try[A]]

Extensions

Extensions

extension [A](generator: Generator[A])
def andThen[F[_]](using f: (Generator[A]) => ComposedGenerator[F, A]): Generator[F[A]]
def as[B](using f: A => B): Generator[B]
def generate(n: Int): List[A]
def map[B](f: A => B): Generator[B]
extension [Tup <: Tuple](tup: Tup)
def mapN[A](f: (InverseMap[Tup, Generator]) => A): Generator[A]