projects / trees.git / log
? search:
summary | shortlog | log | commit | commitdiff | tree
first ⋅ prev ⋅ next
trees.git
12 years agoMerge pull request #2 from rpav/key-return-fix
commit | commitdiff | tree
Nathan Froyd [Mon, 21 May 2012 14:47:21 +0000 (07:47 -0700)]
Merge pull request #2 from rpav/key-return-fix

FIND now returns the NODE-KEY rather than the passed ITEM-KEY.

12 years agoFIND now returns the NODE-KEY rather than the passed ITEM-KEY.
commit | commitdiff | tree
Ryan Pavlik [Mon, 21 May 2012 14:35:34 +0000 (09:35 -0500)]
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.

12 years agoinitial commit
commit | commitdiff | tree
Nathan Froyd [Sat, 12 May 2012 16:32:49 +0000 (12:32 -0400)]
initial commit

A library for binary trees written in Common Lisp