|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Persistent key/value map built on top of Aleph::File_BPlus_Tree. More...
#include <array>#include <bit>#include <cstddef>#include <cstring>#include <optional>#include <ostream>#include <string>#include <type_traits>#include <utility>#include <ah-concepts.H>#include <ah-errors.H>#include <tpl_array.H>#include <tpl_file_bplus_tree.H>Go to the source code of this file.
Classes | |
| class | Aleph::Gen_File_BPlus_Map< Key, Value, Compare, MinDegree, KeyCodec, ValueCodec > |
| Persistent ordered map backed by a paged File_BPlus_Tree. More... | |
| struct | Aleph::Gen_File_BPlus_Map< Key, Value, Compare, MinDegree, KeyCodec, ValueCodec >::Record |
| struct | Aleph::Gen_File_BPlus_Map< Key, Value, Compare, MinDegree, KeyCodec, ValueCodec >::Record_Codec |
| struct | Aleph::Gen_File_BPlus_Map< Key, Value, Compare, MinDegree, KeyCodec, ValueCodec >::Record_Compare |
| class | Aleph::Gen_File_BPlus_Map< Key, Value, Compare, MinDegree, KeyCodec, ValueCodec >::Iterator |
| Lazy iterator over ordered key/value pairs. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Typedefs | |
| template<typename Key , typename Value , class Compare = Aleph::less<Key>, size_t MinDegree = 16, typename KeyCodec = detail::Paged_Value_Codec<Key>, typename ValueCodec = detail::Paged_Value_Codec<Value>> | |
| using | Aleph::File_BPlus_Map = Gen_File_BPlus_Map< Key, Value, Compare, MinDegree, KeyCodec, ValueCodec > |
| Convenient alias for a persistent B+ Tree map. | |
Persistent key/value map built on top of Aleph::File_BPlus_Tree.
This header provides Aleph::File_BPlus_Map, a persistent ordered map optimized for range scans by reusing the page-managed Aleph::File_BPlus_Tree storage engine.
Definition in file tpl_file_bplus_map.H.