Messages in this thread | | | Date | Fri, 31 Oct 2008 14:15:24 +0100 | From | Jörn Engel <> | Subject | Re: [RFC] B+Tree library |
| |
On Fri, 31 October 2008 14:07:16 +0100, Johannes Berg wrote: > > OTOH, there is no need to put the SSID in if I put a small list into > each node, effectively using the tree instead of the hash table and then > disambiguating the unlikely case of multiple SSID in a list.
Exactly. In sunny wheather btrees can be a good implementation for hash tables. They can grow and shrink as needed, without taking the latency hit for rehashing every single item. Until lock contention or pingpong shows otherwise. :(
Most likely the answer to bad whether is RCU. Patches are welcome.
Jörn
-- They laughed at Galileo. They laughed at Copernicus. They laughed at Columbus. But remember, they also laughed at Bozo the Clown. -- unknown -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |