Home
last modified time | relevance | path

Searched refs:leaf_node (Results 1 – 15 of 15) sorted by relevance

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp51 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
76 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
108 while (p_nd->m_type != leaf_node) in find_imp()
140 if (p_nd->m_type == leaf_node) in lower_bound_imp()
213 if (p_nd->m_type == leaf_node) in pref_begin()
225 if (p_nd->m_type == leaf_node) in pref_end()
237 if (p_nd->m_type == leaf_node) in leftmost_descendant()
247 if (p_nd->m_type == leaf_node) in leftmost_descendant()
257 if (p_nd->m_type == leaf_node) in rightmost_descendant()
267 if (p_nd->m_type == leaf_node) in rightmost_descendant()
H A Derase_fn_imps.hpp55 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in erase()
162 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in clear_imp()
179 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
197 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
216 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
235 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
H A Dpat_trie_base.hpp61 leaf_node, enumerator
178 : base_type(leaf_node), m_value(other) { } in _Leaf()
196 PB_DS_DEBUG_VERIFY(base_type::m_type == leaf_node); in assert_valid_imp()
537 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator ->()
544 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator *()
691 if (p_nd->m_type == leaf_node) in leftmost_descendant()
699 if (p_nd->m_type == leaf_node) in rightmost_descendant()
750 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator ->()
757 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator *()
828 if (m_p_nd->m_type == leaf_node) in pref_begin()
[all …]
H A Ddebug_fn_imps.hpp62 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node); in assert_valid()
63 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node); in assert_valid()
106 if (p_nd->m_type == leaf_node) in recursive_count_leafs()
H A Dinsert_join_fn_imps.hpp108 if (p_l->m_type == leaf_node) in rec_join_prep()
110 if (p_r->m_type == leaf_node) in rec_join_prep()
124 if (p_r->m_type == leaf_node) in rec_join_prep()
211 if (p_l->m_type == leaf_node) in rec_join()
213 if (p_r->m_type == leaf_node) in rec_join()
230 if (p_r->m_type == leaf_node) in rec_join()
387 if (p_lf != 0 && p_lf->m_type == leaf_node && in insert()
H A Dsplit_fn_imps.hpp119 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in split_prep()
137 if (p_nd->m_type == leaf_node) in rec_split()
H A Dconstructors_destructor_fn_imps.hpp170 if (p_ncp->m_type == leaf_node) in recursive_copy_node()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp51 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
76 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
108 while (p_nd->m_type != leaf_node) in find_imp()
140 if (p_nd->m_type == leaf_node) in lower_bound_imp()
213 if (p_nd->m_type == leaf_node) in pref_begin()
225 if (p_nd->m_type == leaf_node) in pref_end()
237 if (p_nd->m_type == leaf_node) in leftmost_descendant()
247 if (p_nd->m_type == leaf_node) in leftmost_descendant()
257 if (p_nd->m_type == leaf_node) in rightmost_descendant()
267 if (p_nd->m_type == leaf_node) in rightmost_descendant()
H A Derase_fn_imps.hpp55 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in erase()
162 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in clear_imp()
179 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
197 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
216 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
235 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
H A Dpat_trie_base.hpp61 leaf_node, enumerator
178 : base_type(leaf_node), m_value(other) { } in _Leaf()
196 PB_DS_DEBUG_VERIFY(base_type::m_type == leaf_node); in assert_valid_imp()
537 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator ->()
544 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator *()
691 if (p_nd->m_type == leaf_node) in leftmost_descendant()
699 if (p_nd->m_type == leaf_node) in rightmost_descendant()
750 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator ->()
757 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator *()
828 if (m_p_nd->m_type == leaf_node) in pref_begin()
[all …]
H A Ddebug_fn_imps.hpp62 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node); in assert_valid()
63 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node); in assert_valid()
106 if (p_nd->m_type == leaf_node) in recursive_count_leafs()
H A Dinsert_join_fn_imps.hpp108 if (p_l->m_type == leaf_node) in rec_join_prep()
110 if (p_r->m_type == leaf_node) in rec_join_prep()
124 if (p_r->m_type == leaf_node) in rec_join_prep()
211 if (p_l->m_type == leaf_node) in rec_join()
213 if (p_r->m_type == leaf_node) in rec_join()
230 if (p_r->m_type == leaf_node) in rec_join()
387 if (p_lf != 0 && p_lf->m_type == leaf_node && in insert()
H A Dsplit_fn_imps.hpp119 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in split_prep()
137 if (p_nd->m_type == leaf_node) in rec_split()
H A Dconstructors_destructor_fn_imps.hpp170 if (p_ncp->m_type == leaf_node) in recursive_copy_node()
/OK3568_Linux_fs/kernel/drivers/md/persistent-data/
H A Ddm-btree.c1015 static bool leaf_node(struct dm_btree_cursor *c) in leaf_node() function
1040 if (c->prefetch_leaves || !leaf_node(c)) in push_node()