b+tree implementation in c++
The STX B+ Tree package is a set of C++ template classes
implementing a B+ tree key/data container in main memory.
Designed to be drop-in replacements of the STL containers
set, map, multiset and multimap and follow their interfaces very closely.
By packing multiple value pairs into each node
of the tree the B+ tree reduces heap fragmentation and utilizes cache-line
effects better than the standard red-black binary tree.
The classes contain extensive assertion and verification mechanisms
to ensure the implementation's correctness by testing the tree invariants.
To illustrate the B+ tree's structure a wxWidgets demo program is included
in the stx-btree-demo package.
Notes regarding debian package:
there is no corresponding library package containing object files,
but only a development one (c++ header-only library).
test-suites could serve as examples and could be found in the
source package itself.
*** STX B+ Tree C++ Template Classes v0.8.3 ***
Author: Timo Bingmann (Mail: tb a-with-circle idlebox dot net)
--- Summary ---
The STX B+ Tree package is a set of C++ template classes implementing a B+ tree
key/data container in main memory. The classes are designed as drop-in
replacements of the STL containers set, map, multiset and multimap and follow
stx-btree (0.8.3-2) unstable; urgency=low
* Avoid parallel build (closes: bug#564394)
-- Yury Stankevich <firstname.lastname@example.org> Thu, 14 Jan 2010 18:33:04 +0300
stx-btree (0.8.3-1) unstable; urgency=low
* Initial release (closes: bug#550950).
-- Yury Stankevich <email@example.com> Wed, 14 Oct 2009 14:23:12 +0400
2008-09-07 Timo Bingmann
* speedtest.cc: Modifying speedtest to also test the hash table
Browse inside stx-btree-dev_0.8.3-2_all.deb
Results 1 - 1 of 1Search over 15 billion files
© 1997-2016 FileWatcher.com