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

Prev:	ceiling-key ( key tree -- key/f )
Next:	pop-tree-left ( tree -- node/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 least key greater than or equal to the given key, or f if there is no such key.

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

Definition

USING: kernel trees.private ;

IN: trees

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