nant's projects / dragonfly.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 4a8b9e7) | patch
We have a few generation sets for Red-Black trees that implement RLOOKUP
authorMatthew Dillon <dillon@dragonflybsd.org>
Thu, 19 Apr 2007 19:06:01 +0000 (19:06 +0000)
committerMatthew Dillon <dillon@dragonflybsd.org>
Thu, 19 Apr 2007 19:06:01 +0000 (19:06 +0000)
commit49220e5a0b4f72714b39977684aad280974777b7
treec01c8b58c94be6126de1b3457f961f913005c62ctree | snapshot
parent4a8b9e7cca0be0b6119f437ae76397bd3db3c4b3commit | diff
We have a few generation sets for Red-Black trees that implement RLOOKUP
(ranged-lookup) for fixed numeric fields.  Add another one implementing
a generic RLOOKUP where the comparison function is passed to the generator.
sys/sys/tree.h diff | blob | blame | history
Nuno's DragonFly repo.