| /dports/finance/odoo/odoo-19d77c2a03335eb95a686bd69a1b56b38e87d609/odoo/addons/hr_holidays/tests/ |
| H A D | test_company_leave.py | 70 self.assertEqual(len(all_leaves), 4)
76 self.assertEqual(all_leaves[1].number_of_days, 1)
77 self.assertEqual(all_leaves[1].state, 'confirm')
81 self.assertEqual(all_leaves[2].number_of_days, 1)
82 self.assertEqual(all_leaves[2].state, 'confirm')
86 self.assertEqual(all_leaves[3].number_of_days, 1)
124 self.assertEqual(len(all_leaves), 4)
131 self.assertEqual(all_leaves[1].state, 'confirm')
178 self.assertEqual(len(all_leaves), 2)
220 self.assertEqual(len(all_leaves), 2)
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Surface_sweep_2/ |
| H A D | Default_subcurve.h | 126 OutputIterator all_leaves(OutputIterator oi) in all_leaves() function
133 oi = m_orig_subcurve1->all_leaves(oi); in all_leaves()
134 oi = m_orig_subcurve2->all_leaves(oi); in all_leaves()
165 other->all_leaves(std::back_inserter(leaves_of_other)); in are_all_leaves_contained()
182 all_leaves(std::back_inserter(my_leaves)); in has_same_leaves()
183 s->all_leaves(std::back_inserter(other_leaves)); in has_same_leaves()
209 all_leaves(std::back_inserter(my_leaves)); in has_same_leaves()
210 s1->all_leaves(std::back_inserter(other_leaves)); in has_same_leaves()
211 s2->all_leaves(std::back_inserter(other_leaves)); in has_same_leaves()
235 all_leaves(std::back_inserter(my_leaves)); in has_common_leaf()
[all …]
|
| H A D | Surface_sweep_2_impl.h | 541 first_parent->all_leaves(std::back_inserter(all_leaves_first)); in _intersect()
542 second_parent->all_leaves(std::back_inserter(all_leaves_second)); in _intersect()
|
| /dports/math/py-jax/jax-0.2.9/jax/ |
| H A D | tree_util.py | 107 def all_leaves(iterable): function
124 return pytree.all_leaves(iterable)
203 all_leaves = [leaves] + [treedef.flatten_up_to(r) for r in rest]
204 return treedef.unflatten(f(*xs) for xs in zip(*all_leaves))
|
| /dports/math/polymake/polymake-4.5/bundled/atint/apps/tropical/src/ |
| H A D | moduli_rational_local.cc | 121 const auto all_leaves = sequence(1,n_leaves); in local_m0n() local
131 if (cu_set.contains(n_leaves)) cu_set = all_leaves - cu_set; in local_m0n()
184 adjacent_edges |= all_leaves - set_list.row(sets[s]); in local_m0n()
197 ray_partition = all_leaves - ray_partition; in local_m0n()
|
| H A D | rational_curve.cc | 706 const auto all_leaves = sequence(1, n);
711 newsets[ns] = all_leaves - newsets[ns];
717 oldsets[os] = all_leaves - oldsets[os];
|
| /dports/misc/orange3/orange3-3.29.1/Orange/widgets/visualize/utils/tree/ |
| H A D | skltreeadapter.py | 267 all_leaves = self.leaves(self.root)
269 indices = np.searchsorted(all_leaves, node_leaves)
289 all_leaves = self.leaves(self.root)
291 return np.searchsorted(all_leaves, node_leaves)
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boct/ |
| H A D | boct_tree.h | 184 std::vector<boct_tree_cell<T_loc,T_data>*> all_leaves; in change_leaves_in_global_region_leaves_global() local
185 root->leaf_children(all_leaves); in change_leaves_in_global_region_leaves_global()
191 typename std::vector<boct_tree_cell<T_loc,T_data>*>::iterator it = all_leaves.begin(); in change_leaves_in_global_region_leaves_global()
192 for (; it!=all_leaves.end(); ++it) in change_leaves_in_global_region_leaves_global()
|
| H A D | boct_tree.hxx | 418 std::vector<boct_tree_cell<T_loc,T_data>*> all_leaves; in locate_region_leaves_global() local
419 root->leaf_children(all_leaves); in locate_region_leaves_global()
422 typename std::vector<boct_tree_cell<T_loc,T_data>*>::iterator it = all_leaves.begin(); in locate_region_leaves_global()
423 for (; it!=all_leaves.end(); ++it) in locate_region_leaves_global()
473 std::vector<boct_tree_cell<T_loc,T_data>*> all_leaves; in locate_leaves_in_hollow_region_global() local
474 root->leaf_children(all_leaves); in locate_leaves_in_hollow_region_global()
477 typename std::vector<boct_tree_cell<T_loc,T_data>*>::iterator it = all_leaves.begin(); in locate_leaves_in_hollow_region_global()
478 for (; it!=all_leaves.end(); ++it) in locate_leaves_in_hollow_region_global()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/rpl/rgtl/ |
| H A D | rgtl_octree_dual_visit.h | 49 bool all_leaves() const { return flags_ == ((1<<derived::num_primal)-1); } in all_leaves() function
127 if(in.all_leaves()) in invoke()
|
| /dports/astro/tkgeomap/tkgeomap-2.11.6/library/ |
| H A D | wdgeomap.tcl | 1205 set all_leaves {}
1207 set all_leaves [concat $all_leaves $leaves($sibling)]
1209 set start [lsearch $layers [lindex $all_leaves 0]]
1210 set len [llength $all_leaves]
1215 set all_leaves {}
1217 set all_leaves [concat $all_leaves $leaves($sibling)]
1219 set layers [eval linsert \$layers $start $all_leaves]
|
| H A D | tkgeomap_procs.tcl | 1441 set all_leaves {}
1443 eval lappend all_leaves $leaves($sibling)
1445 set start [lsearch $layers [lindex $all_leaves 0]]
1446 set len [llength $all_leaves]
1450 set all_leaves {}
1452 eval lappend all_leaves $leaves($sibling)
1454 set layers [eval linsert \$layers $start $all_leaves]
|
| /dports/math/polymake/polymake-4.5/bundled/atint/apps/tropical/include/ |
| H A D | pruefer.h | 71 Set<Int> all_leaves = sequence(0,n); in complex_from_prueferSequences() local
|
| /dports/science/py-dlib/dlib-19.22/dlib/random_forest/ |
| H A D | random_forest_regression.h | 377 std::vector<std::vector<float>> all_leaves(num_trees); in do_train()
407 auto& leaves = all_leaves[i]; in do_train()
590 … return trained_function_type(std::move(fe), std::move(all_trees), std::move(all_leaves)); in do_train()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/random_forest/ |
| H A D | random_forest_regression.h | 377 std::vector<std::vector<float>> all_leaves(num_trees); in do_train()
407 auto& leaves = all_leaves[i]; in do_train()
590 … return trained_function_type(std::move(fe), std::move(all_trees), std::move(all_leaves)); in do_train()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/rstar-0.7.1/src/algorithm/ |
| H A D | rstar.rs | 139 let all_leaves = match node.children.first() { in choose_subtree() localVariable
173 let overlap_increase = if all_leaves { in choose_subtree()
|
| /dports/math/py-jax/jax-0.2.9/jax/experimental/ |
| H A D | maps.py | 29 from ..tree_util import tree_flatten, tree_unflatten, all_leaves
172 if isinstance(entry, dict) and all_leaves(entry.values()):
175 if isinstance(entry, (tuple, list)) and all_leaves(v for v in entry if v is not None):
|
| /dports/biology/py-ete3/ete3-3.1.2/ete3/coretype/ |
| H A D | tree.py | 1999 all_leaves = cached_content[self]
2001 yield (side1, all_leaves-side1)
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/tree/tests/ |
| H A D | test_tree.py | 1708 all_leaves = est.tree_.children_left == TREE_LEAF
1710 np.dot(node_indicator, all_leaves), np.ones(shape=n_samples)
|