Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::PersistentTreapMap< Key, T, Compare >::Node Struct Reference
Collaboration diagram for Aleph::PersistentTreapMap< Key, T, Compare >::Node:
[legend]

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
 

Detailed Description

template<typename Key, typename T, class Compare = Aleph::less<Key>>
struct Aleph::PersistentTreapMap< Key, T, Compare >::Node

Definition at line 548 of file tpl_persistent_treap.H.

Member Data Documentation

◆ count

template<typename Key , typename T , class Compare = Aleph::less<Key>>
size_t Aleph::PersistentTreapMap< Key, T, Compare >::Node::count = 1

Definition at line 553 of file tpl_persistent_treap.H.

◆ key

template<typename Key , typename T , class Compare = Aleph::less<Key>>
std::shared_ptr<const Key> Aleph::PersistentTreapMap< Key, T, Compare >::Node::key

◆ left

template<typename Key , typename T , class Compare = Aleph::less<Key>>
std::shared_ptr<const Node> Aleph::PersistentTreapMap< Key, T, Compare >::Node::left

◆ priority

template<typename Key , typename T , class Compare = Aleph::less<Key>>
std::uint64_t Aleph::PersistentTreapMap< Key, T, Compare >::Node::priority = 0

Definition at line 552 of file tpl_persistent_treap.H.

◆ right

template<typename Key , typename T , class Compare = Aleph::less<Key>>
std::shared_ptr<const Node> Aleph::PersistentTreapMap< Key, T, Compare >::Node::right

◆ value

template<typename Key , typename T , class Compare = Aleph::less<Key>>
std::shared_ptr<const T> Aleph::PersistentTreapMap< Key, T, Compare >::Node::value

The documentation for this struct was generated from the following file: