cpp-btree

KO | EN

gitlite — search

#python #hacktoberfest #react #ai #llm #golang #deep-learning #linux #macos #java #windows #cli #ios #open-source

(★ 12)

Optimized for systems that read and write large blobs.

cpp-btree 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

C++ B-tree is a template library that implements ordered in-memory containers based on a B-tree data structure.  Similar to the STL map, set, multimap, and multiset templates, this library provides btree\_map, btree\_set, btree\_multimap, and btree\_multiset.

C++ B-tree containers have a few advantages compared with the standard containers, which are typically implemented using Red-Black trees. Nodes in a Red-Black tree require three pointers per entry (plus 1 bit), whereas B-trees on average make use of fewer than one pointer per entry, leading to **significant memory savings**. For example, a `set<int32_t>` has an overhead of 16 bytes for every 4 byte set element (on a 32-bit operating system); the corresponding `btree_set<int32_t>` has an overhead of around 1 byte per set element.

B-trees are widely known as data structures for secondary storage, because they keep disk seeks to a minimum. For an in-memory data structure, the same property yields a performance boost by keeping cache-line misses to a minimum. C++ B-tree containers make better use of the cache by performing multiple key-comparisons per node when searching the tree. Although B-tree algorithms are more complex, compared with the Red-Black tree algorithms, the improvement in cache behavior may account for a **significant speedup** in accessing large containers.

The C++ B-tree containers are not without drawbacks, however. Unlike the standard STL containers, modifying a C++ B-tree container **invalidates all outstanding iterators** on that container. For this reason, the library also contains "safe" variations on the four containers: iterators on safe B-tree containers keep a copy of the current key and automatically reposition the iterator whenever it is used.

cpp-btree

cpp-btree 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

cpp-btree

cpp-btree 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README