Home
last modified time | relevance | path

Searched refs:is_leaf (Results 1 – 25 of 2615) sorted by relevance

12345678910>>...105

/dports/graphics/blender/blender-2.91.0/intern/cycles/bvh/
H A Dbvh_node.cpp38 cnt = is_leaf() ? 1 : 0; in getSubtreeSize()
41 cnt = is_leaf() ? 0 : 1; in getSubtreeSize()
60 if (!is_leaf()) { in getSubtreeSize()
69 if (!is_leaf()) { in getSubtreeSize()
78 cnt = (is_leaf() && !is_unaligned) ? 1 : 0; in getSubtreeSize()
81 cnt = (is_leaf() && is_unaligned) ? 1 : 0; in getSubtreeSize()
84 if (is_leaf()) { in getSubtreeSize()
98 if (!is_leaf()) in getSubtreeSize()
129 if (!is_leaf() && visibility == 0) { in update_visibility()
142 if (!is_leaf()) { in update_time()
[all …]
/dports/devel/tla/tla-1.3.5/src/hackerlab/arrays/
H A Dpow2-array-compact.c45 int is_leaf; in item_eq() local
57 size = (is_leaf in item_eq()
61 if (!is_leaf || !k1->compare_elts) in item_eq()
87 int is_leaf; in compact() local
96 is_leaf = !array->rules->levels[depth].addr_shift; in compact()
98 size = (is_leaf in compact()
105 if (!is_leaf) in compact()
117 equals_default = ((is_leaf && compare_elts) in compact()
122 if (is_leaf && free_elts) in compact()
136 if (!is_leaf) in compact()
[all …]
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/sanakirja-core-1.2.13/src/btree/page_unsized/
H A Dcursor.rs7 pub is_leaf: bool, field
19 is_leaf: hdr.is_leaf(), in new()
29 is_leaf: hdr.is_leaf(), in after()
39 is_leaf: hdr.is_leaf(), in last()
/dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/cranelift/codegen/src/
H A Dstack_layout.rs21 is_leaf: bool, in layout_stack()
50 let mut must_align = !is_leaf; in layout_stack()
148 let is_leaf = false; in layout() localVariable
151 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
152 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
158 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
159 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
167 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(12)); in layout()
183 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(16)); in layout()
200 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(20)); in layout()
[all …]
/dports/www/firefox/firefox-99.0/third_party/rust/cranelift-codegen/src/
H A Dstack_layout.rs21 is_leaf: bool, in layout_stack()
50 let mut must_align = !is_leaf; in layout_stack()
148 let is_leaf = false; in layout() localVariable
151 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
152 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
158 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
159 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
167 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(12)); in layout()
183 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(16)); in layout()
200 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(20)); in layout()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/cranelift-codegen/src/
H A Dstack_layout.rs21 is_leaf: bool, in layout_stack()
50 let mut must_align = !is_leaf; in layout_stack()
148 let is_leaf = false; in layout() localVariable
151 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
152 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
158 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
159 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
167 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(12)); in layout()
183 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(16)); in layout()
200 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(20)); in layout()
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/cranelift-codegen/src/
H A Dstack_layout.rs21 is_leaf: bool, in layout_stack()
50 let mut must_align = !is_leaf; in layout_stack()
148 let is_leaf = false; in layout() localVariable
151 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
152 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
158 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
159 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
167 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(12)); in layout()
183 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(16)); in layout()
200 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(20)); in layout()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/cranelift-codegen/src/
H A Dstack_layout.rs21 is_leaf: bool, in layout_stack()
50 let mut must_align = !is_leaf; in layout_stack()
148 let is_leaf = false; in layout() localVariable
151 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
152 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
158 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
159 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
167 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(12)); in layout()
183 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(16)); in layout()
200 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(20)); in layout()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/cranelift-codegen/src/
H A Dstack_layout.rs21 is_leaf: bool, in layout_stack()
50 let mut must_align = !is_leaf; in layout_stack()
148 let is_leaf = false; in layout() localVariable
151 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
152 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
158 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(0)); in layout()
159 assert_eq!(layout_stack(sss, is_leaf, 16), Ok(0)); in layout()
167 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(12)); in layout()
183 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(16)); in layout()
200 assert_eq!(layout_stack(sss, is_leaf, 1), Ok(20)); in layout()
[all …]
/dports/devel/binutils/binutils-2.37/gold/
H A Darm-reloc-property.cc168 if (!node->is_leaf() in Arm_reloc_property()
169 && node->child(0)->is_leaf() in Arm_reloc_property()
205 if (!node->is_leaf() in Arm_reloc_property()
206 && node->child(0)->is_leaf() in Arm_reloc_property()
210 && node->child(2)->is_leaf() in Arm_reloc_property()
217 if (!node->is_leaf() in Arm_reloc_property()
218 && node->child(0)->is_leaf() in Arm_reloc_property()
222 && node->child(2)->is_leaf() in Arm_reloc_property()
229 if (!node->is_leaf() && node->child(0)->is_leaf()) in Arm_reloc_property()
232 && node->child(1)->is_leaf() in Arm_reloc_property()
[all …]
/dports/lang/gnatdroid-binutils-x86/binutils-2.27/gold/
H A Darm-reloc-property.cc168 if (!node->is_leaf() in Arm_reloc_property()
169 && node->child(0)->is_leaf() in Arm_reloc_property()
205 if (!node->is_leaf() in Arm_reloc_property()
206 && node->child(0)->is_leaf() in Arm_reloc_property()
210 && node->child(2)->is_leaf() in Arm_reloc_property()
217 if (!node->is_leaf() in Arm_reloc_property()
218 && node->child(0)->is_leaf() in Arm_reloc_property()
222 && node->child(2)->is_leaf() in Arm_reloc_property()
229 if (!node->is_leaf() && node->child(0)->is_leaf()) in Arm_reloc_property()
232 && node->child(1)->is_leaf() in Arm_reloc_property()
[all …]
/dports/devel/arm-elf-binutils/binutils-2.37/gold/
H A Darm-reloc-property.cc168 if (!node->is_leaf() in Arm_reloc_property()
169 && node->child(0)->is_leaf() in Arm_reloc_property()
205 if (!node->is_leaf() in Arm_reloc_property()
206 && node->child(0)->is_leaf() in Arm_reloc_property()
210 && node->child(2)->is_leaf() in Arm_reloc_property()
217 if (!node->is_leaf() in Arm_reloc_property()
218 && node->child(0)->is_leaf() in Arm_reloc_property()
222 && node->child(2)->is_leaf() in Arm_reloc_property()
229 if (!node->is_leaf() && node->child(0)->is_leaf()) in Arm_reloc_property()
232 && node->child(1)->is_leaf() in Arm_reloc_property()
[all …]
/dports/devel/gnulibiberty/binutils-2.37/gold/
H A Darm-reloc-property.cc168 if (!node->is_leaf() in Arm_reloc_property()
169 && node->child(0)->is_leaf() in Arm_reloc_property()
205 if (!node->is_leaf() in Arm_reloc_property()
206 && node->child(0)->is_leaf() in Arm_reloc_property()
210 && node->child(2)->is_leaf() in Arm_reloc_property()
217 if (!node->is_leaf() in Arm_reloc_property()
218 && node->child(0)->is_leaf() in Arm_reloc_property()
222 && node->child(2)->is_leaf() in Arm_reloc_property()
229 if (!node->is_leaf() && node->child(0)->is_leaf()) in Arm_reloc_property()
232 && node->child(1)->is_leaf() in Arm_reloc_property()
[all …]
/dports/lang/gnatdroid-binutils/binutils-2.27/gold/
H A Darm-reloc-property.cc168 if (!node->is_leaf() in Arm_reloc_property()
169 && node->child(0)->is_leaf() in Arm_reloc_property()
205 if (!node->is_leaf() in Arm_reloc_property()
206 && node->child(0)->is_leaf() in Arm_reloc_property()
210 && node->child(2)->is_leaf() in Arm_reloc_property()
217 if (!node->is_leaf() in Arm_reloc_property()
218 && node->child(0)->is_leaf() in Arm_reloc_property()
222 && node->child(2)->is_leaf() in Arm_reloc_property()
229 if (!node->is_leaf() && node->child(0)->is_leaf()) in Arm_reloc_property()
232 && node->child(1)->is_leaf() in Arm_reloc_property()
[all …]
/dports/devel/p5-Forest/Forest-0.10/t/
H A D010_Tree.t17 ok($t->is_leaf, '... this is the leaf');
32 ok($child_1->is_leaf, '... this is a leaf');
40 ok(!$t->is_leaf, '... this is no longer leaf');
48 ok($child_1->is_leaf, '... but this is still a leaf');
61 ok($child_1_1->is_leaf, '... this is a leaf');
71 ok(!$child_1->is_leaf, '... this is no longer a leaf');
75 ok($child_1_1->is_leaf, '... but this is still a leaf');
100 ok($child_4->is_leaf, '... but this is still a leaf');
109 ok($child_2->is_leaf, '... but this is still a leaf');
118 ok($child_3->is_leaf, '... but this is still a leaf');
H A D014_Pure.t16 ok($t->is_leaf, '... this is the leaf');
26 ok($child_1->is_leaf, '... this is a leaf');
32 ok($t->is_leaf, '... original unmodified');
40 ok(!$clone->is_leaf, '... this is no longer leaf');
45 ok($child_1->is_leaf, '... child is still a leaf');
50 ok($child_1_1->is_leaf, '... this is a leaf');
61 ok(!$child_1->is_leaf, '... this is no longer a leaf');
63 ok($child_1_1->is_leaf, '... but this is still a leaf');
/dports/math/cgal/CGAL-5.3/include/CGAL/Classification/ETHZ/internal/random-forest/
H A Dnode.hpp48 bool is_leaf; member in CGAL::internal::liblearning::RandomForest::Node
59 Node() : is_leaf(true), n_samples(0), depth(-1), params(0) {} in Node()
126 if (!is_leaf) { in get_all_childs()
207 is_leaf = false; in train()
244 ar & BOOST_SERIALIZATION_NVP(is_leaf); in serialize()
250 if (!is_leaf) in serialize()
260 I_Binary_write_bool (os, is_leaf); in write()
268 if (!is_leaf) in write()
277 I_Binary_read_bool (is, is_leaf); in read()
286 if (!is_leaf) in read()
[all …]
H A Dtree.hpp66 while (node && !node->is_leaf) { in evaluate()
84 while (!node_1->is_leaf) {
87 while (!node_2->is_leaf) {
104 if (node_1->is_leaf) {
111 while (!node_1->is_leaf) {
115 while (!node_2->is_leaf) {
/dports/devel/sord/sord-0.16.8/src/zix/
H A Dbtree.c45 uint16_t is_leaf; member
170 if (n->is_leaf) { in zix_btree_free_rec()
259 if (lhs->is_leaf) { in zix_btree_split_child()
442 assert(lhs->is_leaf == rhs->is_leaf); in zix_btree_rotate_left()
444 if (lhs->is_leaf) { in zix_btree_rotate_left()
476 assert(lhs->is_leaf == rhs->is_leaf); in zix_btree_rotate_right()
478 if (lhs->is_leaf) { in zix_btree_rotate_right()
514 assert(lhs->is_leaf == rhs->is_leaf); in zix_btree_merge()
519 if (lhs->is_leaf) { in zix_btree_merge()
628 if (n->is_leaf) { in zix_btree_remove()
[all …]
/dports/math/cvc4/CVC4-1.7/test/regress/regress1/rewriterules/
H A Ddatatypes_clark_quantification.smt2216 (declare-fun is_leaf (tree) Bool)
218 (! (=> true (= (is_leaf (leaf ?x1)) true)) :pattern ((leaf ?x1)) ) ))
221 … (! (=> (is_leaf ?x1) (= ?x1 (leaf (data ?x1)))) :pattern ((is_leaf ?x1)(data ?x1)) ) ))
223 … (! (=> (is_leaf ?x1) (= (children ?x1) null)) :pattern ((is_leaf ?x1)(children ?x1)) ) ))
229 (! (= (is_leaf (node ?x1)) false) :pattern ((is_leaf (node ?x1))) ) ))
231 (! (= (is_leaf (leaf ?x1)) true) :pattern (is_leaf (leaf ?x1)) ) ))
239 (! (=> (is_node ?x1) (not (is_leaf ?x1)) ) :pattern ((is_node ?x1)) ) ))
241 (! (=> (is_leaf ?x1) (not (is_node ?x1)) ) :pattern ((is_leaf ?x1)) ) ))
245 (! (=> (not (is_leaf ?x1)) (is_node ?x1) ) :pattern ((is_leaf ?x1)) ) ))
250 (! (or (is_node ?x1) (is_leaf ?x1)) :pattern ((children ?x1)) ) ))
[all …]
/dports/devel/py-durus/Durus-3.9/
H A Dbtree.py21 def is_leaf(self): member in BNode
25 if self.is_leaf():
37 if self.is_leaf():
50 if self.is_leaf():
63 if self.is_leaf():
90 elif self.is_leaf():
104 elif self.is_leaf():
146 if self.is_leaf():
155 if self.is_leaf():
171 if self.is_leaf():
[all …]
/dports/math/primecount/primecount-7.2/test/
H A Dfactor_table_d.cpp71 std::cout << "prime_factor_larger_y(" << n << ") = " << (factorTable.is_leaf(i) == 0); in main()
72 check(factorTable.is_leaf(i) == 0); in main()
93 check(factorTable.is_leaf(i) == uint16_max - 1); in main()
95 check(factorTable.is_leaf(i) == uint16_max); in main()
97 check(factorTable.is_leaf(i) == 0); in main()
99 check(lpf[n] == factorTable.is_leaf(i) + (factorTable.mu(i) == 1)); in main()
/dports/editors/calligra/calligra-3.2.1/sheets/3rdparty/mdds/
H A Dnode.hpp59 bool is_leaf; member
63 is_leaf(_is_leaf) in node_base()
76 is_leaf(r.is_leaf) in node_base()
92 is_leaf = r.is_leaf; in operator =()
167 if (node->is_leaf) in clear_tree()
273 bool isLeaf = node_list.front()->is_leaf; in dump_tree_layer()
289 if (p->is_leaf) in dump_tree_layer()
/dports/science/py-libpysal/libpysal-4.5.1/libpysal/cg/tests/
H A Dtest_rtree.py31 res = [r.leaf_obj() for r in t.query_rect(qr) if r.is_leaf()]
37 res = [r.leaf_obj() for r in t.query_point((20.0, 20.0)) if r.is_leaf()]
40 res = [r.leaf_obj() for r in t.query_point((21, 20)) if r.is_leaf()]
44 res = [r.leaf_obj() for r in t.query_point((21, 21)) if r.is_leaf()]
48 res = [r.leaf_obj() for r in t.query_point((-12, 21)) if r.is_leaf()]
53 res = [r.leaf_obj() for r in t.query_rect((qr)) if r.is_leaf()]
/dports/www/py-graphite-web/graphite-web-1.1.8/webapp/graphite/metrics/
H A Dviews.py203 node_info = dict(path=node.path, name=node.name, is_leaf=str(int(node.is_leaf)))
204 if not node.is_leaf:
239 if node.is_leaf or not leaves_only:
330 if any(not n.is_leaf for n in nodes):
351 if node.is_leaf:
377 info = dict(path=node.path, is_leaf=node.is_leaf)
378 if node.is_leaf:
393 text_type('is_leaf'): node.is_leaf,
395 if node.is_leaf:
407 info = dict(path=node.path, is_leaf=node.is_leaf)
[all …]

12345678910>>...105