projects / trees.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 981c7f5) | patch
FIND now returns the NODE-KEY rather than the passed ITEM-KEY.
authorRyan Pavlik <rpavlik@gmail.com>
Mon, 21 May 2012 14:35:34 +0000 (09:35 -0500)
committerRyan Pavlik <rpavlik@gmail.com>
Mon, 21 May 2012 14:35:34 +0000 (09:35 -0500)
commit12ee586a7acb4f0841740a468853d6f73745c19c
tree6bdb421bce810f771be77002afc77d9c11c29c63tree | snapshot
parent981c7f5adec954a094eb52f48fa7fddd7f4168dacommit | diff
FIND now returns the NODE-KEY rather than the passed ITEM-KEY.

This means attached data can be modified without doing an additional
search, if the specified item is not inserted due to an existing key.
Whether the new key or old key is used is already a function of the
second return value.
binary-trees.lisp diff | blob | history
A library for binary trees written in Common Lisp