Home Manual Reference Source

References

summary
public	F empty(M: *)

0-core/_fast

summary
private	F _app3(A: , B: ): *
private	F _append(tree: , list: ): *
private	F _deepL(M: , left: , middle: , right: ): *
private	F _deepR(M: , left: , middle: , right: ): *
private	F _digit(list: Array): Digit Creates a Digit from as small list.
private	F _from_digit(M: , digit: ): *
private	F _from_small_list(M: , list: ): *
private	F _prepend(tree: , list: ): *

0-core/_fast/fast-iterators

summary
private	F _EmptyGenerator()
private	V _EMPTY: *

0-core/concatenate

summary
public	F app3(A: , list: , B: ):
public	F append(tree: , iterable: ): *
public	F from(M: , iterable: ): *
public	F nodes(M: , list: ): *
public	F prepend(tree: , iterable: ): *

0-core/measure

summary
public	F CachedMeasure(M: *)
public	F cache(M: ):

0-core/split

summary
public	F Split(left: , middle: , right: *)
public	F deepL(M: Measure, left: Array, middle: FingerTree, right: Digit): *
public	F deepR(M: Measure, left: Digit, middle: FingerTree, right: Array): *

1-digit

summary
public	F Digit()
public	F One(a: *)
public	F Two(a: , b: )
public	F Three(a: , b: , c: *)
public	F Four(a: , b: , c: , d: )

2-node

summary
public	F Node2(v: , a: , b: *)
public	F Node3(v: , a: , b: , c: )
public	F node2(M: , a: , b: ):
public	F node3(M: , a: , b: , c: ): *

3-tree/base

summary
public	F Tree() Base class for all implementations.

3-tree/implementations

summary
public	F Empty(M: *)
public	F Single(M: , value: )
public	F Deep(M: , left: , middle: , right: )

4-lazy

summary
public	F Lazy(thunk: *)
public	F delay(thunk: Function): Tree Wraps a tree-returning function with a tree proxy that will shallow evaluate as soon as a method is called on it.

Directories

implementations