subtree>alist(] ( from-key to-key tree -- alist )
Binary search trees

Prev:	subtree>alist() ( from-key to-key tree -- alist )
Next:	subtree>alist[) ( from-key to-key tree -- alist )

Vocabulary
trees

Inputs

from-key	a key
to-key	a key
tree	a tree

Outputs

alist

an array of key/value pairs

Word description
Returns an alist of the portion of this map whose keys range from fromKey (exclusive) to toKey (inclusive).

See also
headtree>alist[), headtree>alist[], tailtree>alist(], tailtree>alist[], subtree>alist(), subtree>alist[), subtree>alist[]

Definition

USING: accessors make math.order trees.private ;

IN: trees

: subtree>alist(] ( from-key to-key tree -- alist )
    [ root>> [ after? ] [ before=? ] (node>subalist) ] { } make
    ;