|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Public Member Functions | |
| Node ()=default | |
| Node (Key label) | |
Public Attributes | |
| Key | edge_label |
| std::optional< T > | value |
| Array< std::pair< Char, std::unique_ptr< Node > > > | children |
Definition at line 126 of file tpl_radix_tree.H.
|
inlineexplicit |
Definition at line 137 of file tpl_radix_tree.H.
Definition at line 131 of file tpl_radix_tree.H.
Referenced by Aleph::RadixTree< T, Char >::add_child(), Aleph::RadixTree< T, Char >::collect_keys(), Aleph::RadixTree< T, Char >::erase(), Aleph::RadixTree< T, Char >::insert_impl(), Aleph::RadixTree< T, Char >::remove_child_at(), and Aleph::RadixTree< T, Char >::verify_rec().
Definition at line 128 of file tpl_radix_tree.H.
Referenced by Aleph::RadixTree< T, Char >::erase(), Aleph::RadixTree< T, Char >::find_node(), Aleph::RadixTree< T, Char >::insert_impl(), Aleph::RadixTree< T, Char >::keys_with_prefix(), Aleph::RadixTree< T, Char >::longest_prefix(), and Aleph::RadixTree< T, Char >::verify_rec().
| std::optional<T> Aleph::RadixTree< T, Char >::Node::value |
Definition at line 130 of file tpl_radix_tree.H.
Referenced by Aleph::RadixTree< T, Char >::collect_keys(), Aleph::RadixTree< T, Char >::erase(), Aleph::RadixTree< T, Char >::find(), Aleph::RadixTree< T, Char >::find(), Aleph::RadixTree< T, Char >::insert_impl(), and Aleph::RadixTree< T, Char >::verify_rec().