Home
last modified time | relevance | path

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

12345678910>>...21

/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/include/pcl/surface/impl/
H A Dmarching_cubes.hpp125 interpolateEdge (p[0], p[1], leaf_node[0], leaf_node[1], vertex_list[0]); in createSurface()
127 interpolateEdge (p[1], p[2], leaf_node[1], leaf_node[2], vertex_list[1]); in createSurface()
129 interpolateEdge (p[2], p[3], leaf_node[2], leaf_node[3], vertex_list[2]); in createSurface()
131 interpolateEdge (p[3], p[0], leaf_node[3], leaf_node[0], vertex_list[3]); in createSurface()
133 interpolateEdge (p[4], p[5], leaf_node[4], leaf_node[5], vertex_list[4]); in createSurface()
135 interpolateEdge (p[5], p[6], leaf_node[5], leaf_node[6], vertex_list[5]); in createSurface()
137 interpolateEdge (p[6], p[7], leaf_node[6], leaf_node[7], vertex_list[6]); in createSurface()
139 interpolateEdge (p[7], p[4], leaf_node[7], leaf_node[4], vertex_list[7]); in createSurface()
141 interpolateEdge (p[0], p[4], leaf_node[0], leaf_node[4], vertex_list[8]); in createSurface()
143 interpolateEdge (p[1], p[5], leaf_node[1], leaf_node[5], vertex_list[9]); in createSurface()
[all …]
/dports/math/pspp/pspp-1.4.1/src/libpspp/
H A Dsparse-array.c67 struct leaf_node *leaf;
101 struct leaf_node struct
118 static inline bool any_in_use (const struct leaf_node *);
233 static struct leaf_node *
280 struct leaf_node *leaf; in sparse_array_insert()
298 struct leaf_node *leaf = find_leaf_node (spar, key); in sparse_array_get()
316 struct leaf_node *leaf; in sparse_array_remove()
428 any_in_use (const struct leaf_node *leaf) in any_in_use()
439 set_in_use (struct leaf_node *leaf, unsigned int key) in set_in_use()
447 unset_in_use (struct leaf_node *leaf, unsigned int key) in unset_in_use()
[all …]
/dports/games/fs2open/fs2open.github.com-release_21_4_1/lib/libRocket/Source/Core/
H A DStyleSheetParser.cpp190 StyleSheetNode* leaf_node = node; in ImportProperties() local
250 leaf_node = leaf_node->GetChildNode(tag, StyleSheetNode::TAG); in ImportProperties()
251 tag_node = leaf_node; in ImportProperties()
254 leaf_node = leaf_node->GetChildNode(id, StyleSheetNode::ID); in ImportProperties()
257 leaf_node = leaf_node->GetChildNode(classes[j], StyleSheetNode::CLASS); in ImportProperties()
260leaf_node = leaf_node->GetChildNode(structural_pseudo_classes[j], StyleSheetNode::STRUCTURAL_PSEUD… in ImportProperties()
263 leaf_node = leaf_node->GetChildNode(pseudo_classes[j], StyleSheetNode::PSEUDO_CLASS); in ImportProperties()
267 leaf_node->ImportProperties(properties, rule_specificity); in ImportProperties()
/dports/print/lyx/lyx-2.3.4.2/src/support/
H A Dweighted_btree.h958 leaf_node* n = new leaf_node;
1325 leaf_node *leaf = static_cast<leaf_node*>(n);
1378 leaf_node *leaf = static_cast<leaf_node*>(n);
1406 leaf_node *leaf = static_cast<leaf_node*>(n);
1458 leaf_node *leaf = static_cast<leaf_node*>(n);
1516 leaf_node *leaf = static_cast<leaf_node*>(n);
1539 leaf_node *leaf = static_cast<leaf_node*>(n);
1588 leaf_node *leaf = static_cast<leaf_node*>(n);
1613 leaf_node *leaf = static_cast<leaf_node*>(n);
1658 leaf_node *leaf = static_cast<leaf_node*>(n);
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/include/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()
/dports/lang/gcc48/gcc-4.8.5/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/include/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()
/dports/devel/kyua/kyua-0.13/utils/config/
H A Dtree.cpp146 const leaf_node& child = dynamic_cast< const leaf_node& >( in is_set()
171 const leaf_node& child = dynamic_cast< const leaf_node& >(*raw_node); in push_lua()
196 leaf_node& child = dynamic_cast< leaf_node& >(*raw_node); in set_lua()
223 const leaf_node& child = dynamic_cast< const leaf_node& >(*raw_node); in lookup_string()
251 leaf_node& child = dynamic_cast< leaf_node& >(*raw_node); in set_string()
/dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/include/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()
/dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/include/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()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/include/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()
/dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/lang/gcc9-aux/bootstrap/include/c++/9.1.0/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/lang/gcc6-aux/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/devel/riscv64-gcc/gcc-8.3.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/include/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()
/dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp49 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
74 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
106 while (p_nd->m_type != leaf_node) in find_imp()
138 if (p_nd->m_type == leaf_node) in lower_bound_imp()
211 if (p_nd->m_type == leaf_node) in pref_begin()
223 if (p_nd->m_type == leaf_node) in pref_end()
235 if (p_nd->m_type == leaf_node) in leftmost_descendant()
245 if (p_nd->m_type == leaf_node) in leftmost_descendant()
255 if (p_nd->m_type == leaf_node) in rightmost_descendant()
265 if (p_nd->m_type == leaf_node) in rightmost_descendant()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/include/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()

12345678910>>...21