Apply the functions f from the first generator to the values from the second generator pairwise, yielding a new generator that generates the results.

Generates a 2D array. The square root of the size is the maximum number of rows and columns.

Generates 2D arrays of the given dimensions.

Generates arrays of random length between zero and size.

Generates arrays of given length, containing values generated by the given generator.

Creates a new generator that generates values from the source generator, applies the function k to them, and generates values from the resulting generator.

Generates ints between l and h, inclusive.

Generates int64 between l and h, inclusive.

Always generate the same given value. See also fresh.

Build a generator that randomly generates one of the values in the given non-empty, finite seq.

Generates a value that satisfies a predicate. Contrary to tryFilter, this function keeps re-trying by increasing the size of the original generator ad infinitum. Make sure there is a high probability that the predicate is satisfied. The `filter` function is an alias for the `where` function. These two functions are identical, but co-exist so that you can choose the word that makes your code most readable in your given context.

Build a generator that generates a 4-tuple of the values generated by the given generator.

Build a generator that generates a value from one of the generators in the given non-empty seq, with given probabilities. The sum of the probabilities must be larger than zero.

Generate fresh instances by calling create every time the generator generates a new value. Useful for generating new instances of mutable objects. See also constant.

Build a generator that takes a non-empty sequence and randomly generates one of the values among an initial segment of that sequence. The size of this initial segment increases with the size parameter. Essentially this generator is Gen.elements but taking also the size into account.

Generates lists of random lengths between zero and size.

Generates lists of given length, containing values generated by the given generator.

Create a new generator by applying f to each value in the given generator.

Create a new generator by applying f to each value in the given generators.

Create a new generator by applying f to each value in the given generators.

Create a new generator by applying f to each value in the given generators.

Create a new generator by applying f to each value in the given generators.

Create a new generator by applying f to each value in the given generators.

Generates non-empty lists of random lengths between one and size.

Build a generator that generates a value from one of the generators in the given non-empty seq, with equal probability.

Generates option values that are 'None' 1/8 of the time.

Applies the given chooser function to successive values generated by the given generator, returning the first result where the function returns Some(x). Contrary to tryPick, this function keeps re-trying by increasing the size of the original generator ad infinitum. Make sure there is a high probability that the chooser function returns Some for some values.

Generates random arrays of given length where the sum of all elements equals the given sum.

Override the current size of the test. resize n g invokes generator g with size parameter n.

Generates a given number of values with a new seed and a size of 50.

Generates n values of the given size and starting with the given seed.

Generates a given number of values with a new seed and a given size.

Modify a size using the given function before passing it to the given Gen.

Sequence the given array of generators into a generator of an array.

Sequence the given enumerable of generators into a generator of a list.

Sequence the given seq of generators into a generator of a seq. Each seq generated by the resulting generator can be infinite, if the source seq is infinite.

Generates random permutations of the given sequence.

Obtain the current size. sized g calls g, passing it the current size as a parameter.

Generates sublists of the given seq. For a given list of length n, each sublist has between 0 and n elements, and the order of the elements is the same as in the given seq.

Build a generator that generates a 3-tuple of the values generated by the given generator.

Tries to generate a value that satisfies a predicate. This function 'gives up' by generating None if the given original generator did not generate any values that satisfied the predicate, after trying to get values by increasing its size. The `tryFilter` function is an alias for the `tryWhere` function. These two functions are identical, but co-exist so that you can choose the word that makes your code most readable in your given context.

Tries to apply the given chooser function to successive values generated by the given generator, returning the first result where the function returns Some(x). This function 'gives up' by generating None if the given original generator did not generate any values for which the chooser function returned Some(x), after trying to get values by increasing its size.

Tries to generate a value that satisfies a predicate. This function 'gives up' by generating None if the given original generator did not generate any values that satisfied the predicate, after trying to get values by increasing its size. The `tryWhere` function is also aliased as `tryFilter`. These two functions are identical, but co-exist so that you can choose the word that makes your code most readable in your given context.

Build a generator that generates a 2-tuple of the values generated by the given generator.

Generates a value that satisfies a predicate. Contrary to tryWhere, this function keeps re-trying by increasing the size of the original generator ad infinitum. Make sure there is a high probability that the predicate is satisfied. The `where` function is also aliased as `filter`. These two functions are identical, but co-exist so that you can choose the word that makes your code most readable in your given context.

Combine two generators into a generator of pairs.

Combine three generators into a generator of 3-tuples.