Handbook
Glossary
floor-key ( key tree -- key/f )
Binary search trees
Prev:
higher-entry ( key tree -- pair/f )
Next:
floor-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 less 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-entry
,
ceiling-key
,
ceiling-entry
Definition
USING:
accessors
kernel
trees.private
;
IN:
trees
:
floor-key
( key tree -- key/f )
floor-node
[
key>>
]
?call
;