tailtree>alist[] ( from-key tree -- alist )
Binary search trees

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

Vocabulary
trees

Inputs

from-key	a key
tree	a tree

Outputs

alist

an array of key/value pairs

Word description
Returns an alist of the portion of this tree whose keys are greater than or equal to to-key.

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

Definition

USING: accessors make math.order trees.private ;

IN: trees

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