HelenOS sources
node_type 146 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using node_type = typename Table::node_type;
node_type 172 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto node = new node_type{move(val)};
node_type 188 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using node_type = typename Table::node_type;
node_type 213 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto node = new node_type{val};
node_type 230 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using node_type = typename Table::node_type;
node_type 255 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto node = new node_type{forward<value_type>(val)};
node_type 409 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using node_type = typename Table::node_type;
node_type 411 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto node = new node_type{forward<Args>(args)...};
node_type 419 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using node_type = typename Table::node_type;
node_type 421 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto node = new node_type{val};
node_type 430 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using node_type = typename Table::node_type;
node_type 432 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto node = new node_type{forward<value_type>(val)};
node_type 438 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, typename Table::node_type* node)
node_type 68 uspace/lib/cpp/include/__bits/adt/map.hpp value_type, reference, pointer, size_type, node_type
node_type 71 uspace/lib/cpp/include/__bits/adt/map.hpp value_type, const_reference, const_pointer, size_type, node_type
node_type 280 uspace/lib/cpp/include/__bits/adt/map.hpp auto node = new node_type{value_type{key, mapped_type{}}};
node_type 292 uspace/lib/cpp/include/__bits/adt/map.hpp auto node = new node_type{value_type{move(key), mapped_type{}}};
node_type 389 uspace/lib/cpp/include/__bits/adt/map.hpp auto node = new node_type{value_type{key, forward<Args>(args)...}};
node_type 404 uspace/lib/cpp/include/__bits/adt/map.hpp auto node = new node_type{value_type{move(key), forward<Args>(args)...}};
node_type 435 uspace/lib/cpp/include/__bits/adt/map.hpp auto node = new node_type{value_type{key, forward<T>(val)}};
node_type 454 uspace/lib/cpp/include/__bits/adt/map.hpp auto node = new node_type{value_type{move(key), forward<T>(val)}};
node_type 647 uspace/lib/cpp/include/__bits/adt/map.hpp aux::rbtree_single_policy, node_type
node_type 753 uspace/lib/cpp/include/__bits/adt/map.hpp value_type, reference, pointer, size_type, node_type
node_type 756 uspace/lib/cpp/include/__bits/adt/map.hpp value_type, const_reference, const_pointer, size_type, node_type
node_type 1166 uspace/lib/cpp/include/__bits/adt/map.hpp aux::rbtree_multi_policy, node_type
node_type 214 uspace/lib/cpp/include/__bits/adt/rbtree.hpp auto node = const_cast<node_type*>(it.node());
node_type 220 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{const_cast<node_type*>(node), false};
node_type 331 uspace/lib/cpp/include/__bits/adt/rbtree.hpp node_type* find_parent_for_insertion(const key_type& key) const
node_type 350 uspace/lib/cpp/include/__bits/adt/rbtree.hpp node_type* delete_node(const node_type* n)
node_type 352 uspace/lib/cpp/include/__bits/adt/rbtree.hpp auto node = const_cast<node_type*>(n);
node_type 424 uspace/lib/cpp/include/__bits/adt/rbtree.hpp void insert_node(node_type* node, node_type* parent)
node_type 430 uspace/lib/cpp/include/__bits/adt/rbtree.hpp node_type* root_;
node_type 435 uspace/lib/cpp/include/__bits/adt/rbtree.hpp node_type* find_(const key_type& key) const
node_type 451 uspace/lib/cpp/include/__bits/adt/rbtree.hpp node_type* find_smallest_() const
node_type 459 uspace/lib/cpp/include/__bits/adt/rbtree.hpp node_type* find_largest_() const
node_type 467 uspace/lib/cpp/include/__bits/adt/rbtree.hpp void update_root_(const node_type* node)
node_type 472 uspace/lib/cpp/include/__bits/adt/rbtree.hpp root_ = const_cast<node_type*>(node);
node_type 477 uspace/lib/cpp/include/__bits/adt/rbtree.hpp void repair_after_insert_(const node_type* node)
node_type 482 uspace/lib/cpp/include/__bits/adt/rbtree.hpp void repair_after_erase_(const node_type* node, const node_type* child)
node_type 61 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp rbtree_iterator(node_type* current = nullptr, bool end = true)
node_type 132 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp const node_type* node() const
node_type 137 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp node_type* node()
node_type 148 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp node_type* current_;
node_type 189 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp rbtree_const_iterator(const node_type* current = nullptr, bool end = true)
node_type 272 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp const node_type* node() const
node_type 283 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp const node_type* current_;
node_type 62 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 66 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return iterator{const_cast<node_type*>(it.node()), it.end()};
node_type 105 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 109 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return iterator{const_cast<node_type*>(it.node()), it.end()};
node_type 167 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 175 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto node = new node_type{move(val)};
node_type 186 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 192 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto node = new node_type{val};
node_type 203 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 209 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto node = new node_type{forward<Value>(val)};
node_type 218 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp Tree& tree, typename Tree::node_type* node,
node_type 219 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::node_type* parent
node_type 294 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp const_cast<typename Tree::node_type*>(it.node()), it.end()
node_type 333 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp const_cast<typename Tree::node_type*>(it.node()), it.end()
node_type 388 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 390 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto node = new node_type{forward<Args>(args)...};
node_type 398 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 400 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto node = new node_type{val};
node_type 408 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using node_type = typename Tree::node_type;
node_type 410 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto node = new node_type{forward<Value>(val)};
node_type 417 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp Tree& tree, typename Tree::node_type* node,
node_type 418 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::node_type* = nullptr
node_type 72 uspace/lib/cpp/include/__bits/adt/set.hpp value_type, const_reference, const_pointer, size_type, node_type
node_type 464 uspace/lib/cpp/include/__bits/adt/set.hpp aux::rbtree_single_policy, node_type
node_type 553 uspace/lib/cpp/include/__bits/adt/set.hpp value_type, const_reference, const_pointer, size_type, node_type
node_type 945 uspace/lib/cpp/include/__bits/adt/set.hpp aux::rbtree_multi_policy, node_type
node_type 338 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto node = new node_type{key, forward<Args>(args)...};
node_type 373 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto node = new node_type{move(key), forward<Args>(args)...};
node_type 421 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto node = new node_type{key, forward<T>(val)};
node_type 457 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto node = new node_type{move(key), forward<T>(val)};
node_type 570 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto node = new node_type{key, mapped_type{}};
node_type 598 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto node = new node_type{move(key), mapped_type{}};
node_type 704 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp using node_type = typename table_type::node_type;
HelenOS homepage, sources at GitHub