lower-key ( key tree -- key/f )
Binary search trees

Prev:	subtree>alist[] ( from-key to-key tree -- alist )
Next:	lower-entry ( key tree -- pair/f )

Vocabulary
trees

Inputs

key	a key
tree	a tree

Outputs

key/f

a key or f

Word description
Returns the greatest key strictly less than the given key, or f if there is no such key.

See also
lower-entry, higher-key, higher-entry, floor-key, floor-entry, ceiling-key, ceiling-entry

Definition

USING: accessors kernel trees.private ;

IN: trees

: lower-key ( key tree -- key/f ) lower-node [ key>> ] ?call ;