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

Prev:	lower-key ( key tree -- key/f )
Next:	higher-key ( key tree -- key/f )

Vocabulary
trees

Inputs

key	a key
tree	a tree

Outputs

pair/f

a pair or f

Word description
Returns a key-value mapping associated with the greatest key strictly less than the given key, or f if there is no such key.

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

Definition

USING: kernel trees.private ;

IN: trees

: lower-entry ( key tree -- pair/f )
    lower-node dup [ node>entry ] when ;