BPS
BPS implements a B-tree with a twist pointer set, which approaches the speed of the fastest, hash table based sets, while using several times less memory and still maintaining order. The set introduces a new B-tree variety with superior search and edit qualities. Compared with the GCC distributed tr1::unordered_set, the new set is only 30% slower while using 3 times less memory. Compared with the ordered std::set, it is almost 4 times faster while using 5 times less memory.
| Licenses | GPLv2 |
|---|---|
| Operating Systems | POSIX |
| Implementation | C |
Recent releases
- 28 Jun 2012 01:49
Release Notes: This release adds two delete methods, one deleting the first element and the other the last element.
- 04 Jun 2012 21:13
Release Notes: A bug in the previously introduced data structure clearing routines is fixed.
- 22 May 2012 10:46
Release Notes: Missing data structure clearing routines were added. Two more data retrieval routines were added for fetching the first and the last element.
- 12 Oct 2011 21:42
Release Notes: Support for 64-bit machines was added.
- 30 Mar 2011 15:03
Release Notes: A generic set has been added. Data of any type (not just pointer type) may be recorded with the set. The header file is now installed. Texinfo documentation has been added.
x1f42
30 Sep 2010 03:02
Heartbeat
- Popularity Score
- 95.55
- Vitality Score
- 5.93
- Subscriptions
- 10
