summary |
shortlog | log |
commit |
commitdiff |
tree
first ⋅ prev ⋅ next
Nathan Froyd [Wed, 23 May 2012 11:54:51 +0000 (07:54 -0400)]
Merge branch 'master' of github.com:froydnj/trees
Nathan Froyd [Wed, 23 May 2012 11:53:44 +0000 (07:53 -0400)]
speed up the test suite by declaring bitvector appropriately
This change enables recent-ish SBCL, at least, to do something quite
efficient with POSITION.
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.
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.
Nathan Froyd [Sat, 12 May 2012 16:32:49 +0000 (12:32 -0400)]
initial commit