Module Quickcheck_lib

of_array array selects a random element from array to select an element

map_gens ls ~f maps over ls, building one list generator using each generator * returned from successive applications of f over elements of ls.

replicate_gen g n runs g n times and returns a list of the generated values.

init_gen g n generates a list of n elements by calling g n times and passing the index into the list as a parameter.

Like init_gen, but returns an array.

imperative_fixed_point root ~f creates a fixed point generator which enables imperative * logic (where previously generated values effect future generated values) by generating and * applying a series of nested closures.

Generate a shuffle of an array, uniform distribution. Non-side-effecting.

Like shuffle_arr but for a list.

gen_division n k generates a list of k integers which sum to n

Like gen_division, but generates a list of currency amounts. n must be <= Int.max_value or an exception will be thrown.

gen_imperative_list ~p head_gen elem_gen generates an imperative list * structure generated by elem_gen, starting from an initial element * generated by head_gen. head_gen generates a function that will be called * with a pervious node in order to build the list

gen_imperative_ktree ~p root_gen node_gen generates an imperative ktree structure * as a flat list of nodes, generated by node_gen, starting from a root generated by root_gen. * node_gen generates a function that will be called with the parent node in order to build * the tree. The value p is the geometric distribution (or "radioactive decay") probability * that is determines the number of forks at each node. Sizes of forks in the tree are * distributed uniformly.