|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Public Attributes | |
| std::shared_ptr< const Key > | key |
| std::shared_ptr< const T > | value |
| std::uint64_t | priority = 0 |
| size_t | count = 1 |
| std::shared_ptr< const Node > | left |
| std::shared_ptr< const Node > | right |
Definition at line 548 of file tpl_persistent_treap.H.
| size_t Aleph::PersistentTreapMap< Key, T, Compare >::Node::count = 1 |
Definition at line 553 of file tpl_persistent_treap.H.
| std::shared_ptr<const Key> Aleph::PersistentTreapMap< Key, T, Compare >::Node::key |
Definition at line 550 of file tpl_persistent_treap.H.
Referenced by Aleph::PersistentTreapMap< Key, T, Compare >::find().
| std::shared_ptr<const Node> Aleph::PersistentTreapMap< Key, T, Compare >::Node::left |
Definition at line 554 of file tpl_persistent_treap.H.
Referenced by Aleph::PersistentTreapMap< Key, T, Compare >::find().
| std::uint64_t Aleph::PersistentTreapMap< Key, T, Compare >::Node::priority = 0 |
Definition at line 552 of file tpl_persistent_treap.H.
| std::shared_ptr<const Node> Aleph::PersistentTreapMap< Key, T, Compare >::Node::right |
Definition at line 555 of file tpl_persistent_treap.H.
Referenced by Aleph::PersistentTreapMap< Key, T, Compare >::find().
| std::shared_ptr<const T> Aleph::PersistentTreapMap< Key, T, Compare >::Node::value |
Definition at line 551 of file tpl_persistent_treap.H.
Referenced by Aleph::PersistentTreapMap< Key, T, Compare >::find().