active.tree — de.active-group/active-quickcheck 0.8.0

apply-tree clj

(apply-tree ftree tree)

approx-valid-tree? clj

(approx-valid-tree? n tree)

checks if tree-shrink contains only trees until depth and width n (trees get to big)

expand clj

(expand unfolding-f tree)

Apply an additional unfolding function to an existing tree.

The root outcome remains intact, only the shrinks are affected, this applies recursively, so shrinks can only ever be added using this function.

If you want to replace the shrinks altogether, try:

unfold-tree f (outcome old-tree)

filter-tree clj

(filter-tree predicate tree)

remove all elements wich doesn't statisfy the predicate. Retrurns a list of trees

go clj

(go tree)

lazy-cat' clj

(lazy-cat' colls)

lazy-tree clj

(lazy-tree strict-outcome strict-shrinks)

make-Tree clj

(make-Tree outcome shrinks)

Construct a Tree record.

outcome: access via active.tree/tree-outcome shrinks: access via active.tree/tree-shrinks

map-outcome clj

(map-outcome f tree)

map-tree clj

(map-tree f tree)

pure clj

(pure x)

to-list clj

(to-list tree)

turns a tree into list containing all the elments fo the tree

Tree clj

tree-outcome clj

(tree-outcome Tree)

Lens for the outcome field from a Tree record. See active.tree/make-Tree.

tree-shrinks clj

(tree-shrinks Tree)

Lens for the shrinks field from a Tree record. See active.tree/make-Tree.

tree? clj

(tree? thing)

Is object a Tree record? See active.tree/make-Tree.

unfold clj

(unfold unfolding-f seed)

Build a 'Tree' from an unfolding function and a seed value.

unfold-forest clj

(unfold-forest unfolding-f seed)

Build a list of trees from an unfolding function and a seed value.

valid-tree? clj

(valid-tree? tree)

checks if tree-shrink contains only trees until (don't use this on big trees)