载入中...
搜索中...
未找到
phmap::priv::btree< Params >::EmptyNodeType结构体 参考
类 phmap::priv::btree< Params >::EmptyNodeType 继承关系图:
Public 类型 | |
| using | field_type = typename node_type::field_type |
 Public 类型 继承自 phmap::priv::btree_node< Params > | |
| using | params_type = Params |
| using | key_type = typename Params::key_type |
| using | value_type = typename Params::value_type |
| using | pointer = typename Params::pointer |
| using | const_pointer = typename Params::const_pointer |
| using | reference = typename Params::reference |
| using | const_reference = typename Params::const_reference |
| using | key_compare = typename Params::key_compare |
| using | size_type = typename Params::size_type |
| using | difference_type = typename Params::difference_type |
| using | use_linear_search = std::integral_constant< bool, std::is_arithmetic< key_type >::value &&(std::is_same< phmap::Less< key_type >, key_compare >::value||std::is_same< std::less< key_type >, key_compare >::value||std::is_same< std::greater< key_type >, key_compare >::value)> |
Public 成员函数 | |
| constexpr | EmptyNodeType (node_type *p) |
| Public 成员函数 继承自 phmap::priv::btree_node< Params > | |
| ~btree_node ()=default | |
| btree_node (btree_node const &)=delete | |
| btree_node & | operator= (btree_node const &)=delete |
| bool | leaf () const |
| field_type | position () const |
| field_type | start () const |
| field_type | count () const |
| field_type | max_count () const |
| btree_node * | parent () const |
| bool | is_root () const |
| void | make_root () |
| const key_type & | key (size_type i) const |
| reference | value (size_type i) |
| const_reference | value (size_type i) const |
| btree_node * | child (size_type i) const |
| btree_node *& | mutable_child (size_type i) |
| void | clear_child (size_type i) |
| void | set_child (size_type i, btree_node *c) |
| void | init_child (int i, btree_node *c) |
| template<typename K > | |
| SearchResult< int, is_key_compare_to::value > | lower_bound (const K &k, const key_compare &comp) const |
| template<typename K > | |
| int | upper_bound (const K &k, const key_compare &comp) const |
| template<typename K , typename Compare > | |
| SearchResult< int, btree_is_key_compare_to< Compare, key_type >::value > | linear_search (const K &k, const Compare &comp) const |
| template<typename K , typename Compare > | |
| SearchResult< int, btree_is_key_compare_to< Compare, key_type >::value > | binary_search (const K &k, const Compare &comp) const |
| template<typename K , typename Compare > | |
| SearchResult< int, false > | linear_search_impl (const K &k, int s, const int e, const Compare &comp, std::false_type) const |
| template<typename K , typename Compare > | |
| SearchResult< int, true > | linear_search_impl (const K &k, int s, const int e, const Compare &comp, std::true_type) const |
| template<typename K , typename Compare > | |
| SearchResult< int, false > | binary_search_impl (const K &k, int s, int e, const Compare &comp, std::false_type) const |
| template<typename K , typename CompareTo > | |
| SearchResult< int, true > | binary_search_impl (const K &k, int s, int e, const CompareTo &comp, std::true_type) const |
| template<typename... Args> | |
| void | emplace_value (size_type i, allocator_type *alloc, Args &&... args) |
| void | remove_value (int i, allocator_type *alloc) |
| void | remove_values_ignore_children (int i, size_type to_erase, allocator_type *alloc) |
| void | rebalance_right_to_left (int to_move, btree_node *right, allocator_type *alloc) |
| void | rebalance_left_to_right (int to_move, btree_node *right, allocator_type *alloc) |
| void | split (int insert_position, btree_node *dest, allocator_type *alloc) |
| void | merge (btree_node *sibling, allocator_type *alloc) |
| void | swap (btree_node *src, allocator_type *alloc) |
| void | destroy (allocator_type *alloc) |
Public 属性 | |
| node_type * | parent |
| field_type | position = 0 |
| field_type | start = 0 |
| field_type | count = 0 |
| field_type | max_count = node_type::kInternalNodeMaxCount + 1 |
额外继承的成员函数 | |
| 静态 Public 成员函数 继承自 phmap::priv::btree_node< Params > | |
| static constexpr size_type | Alignment () |
| static btree_node * | init_leaf (btree_node *n, btree_node *parent, int max_cnt) |
| static btree_node * | init_internal (btree_node *n, btree_node *parent) |
| static bool | testonly_uses_linear_node_search () |
| Protected 成员函数 继承自 phmap::priv::btree_node< Params > | |
| btree_node ()=default | |
成员类型定义说明
◆ field_type
template<typename Params >
| using phmap::priv::btree< Params >::EmptyNodeType::field_type = typename node_type::field_type |
构造及析构函数说明
◆ EmptyNodeType()
template<typename Params >
|
inlineconstexpr |
类成员变量说明
◆ count
template<typename Params >
| field_type phmap::priv::btree< Params >::EmptyNodeType::count = 0 |
◆ max_count
template<typename Params >
| field_type phmap::priv::btree< Params >::EmptyNodeType::max_count = node_type::kInternalNodeMaxCount + 1 |
◆ parent
template<typename Params >
| node_type* phmap::priv::btree< Params >::EmptyNodeType::parent |
◆ position
template<typename Params >
| field_type phmap::priv::btree< Params >::EmptyNodeType::position = 0 |
◆ start
template<typename Params >
| field_type phmap::priv::btree< Params >::EmptyNodeType::start = 0 |
该结构体的文档由以下文件生成:
- D:/GitLab/builds/7_aFT3sv/0/nim-pc/california/nim-cross-platform-sdk/exports/include/btree.h
