Home
last modified time | relevance | path

Searched refs:leaf_count (Results 1 – 25 of 208) sorted by relevance

123456789

/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/test/octree/
H A Dtest_octree_iterator.cpp433 leaf_count++; in TEST_F()
450 leaf_count = 0; in TEST_F()
462 leaf_count++; in TEST_F()
490 leaf_count++; in TEST_F()
503 leaf_count = 0; in TEST_F()
515 leaf_count++; in TEST_F()
541 leaf_count++; in TEST_F()
558 leaf_count = 0; in TEST_F()
616 leaf_count = 0; in TEST_F()
677 leaf_count = 0; in TEST_F()
[all …]
/dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/utils/imageops/
H A Dquantize.cpp120 (*leaf_count)++; in create_child()
208 *leaf_count -= node->merge(node_pool) - 1; in reduce()
314 unsigned int leaf_count = 0; in read_colors() local
321 while (leaf_count > MAX_LEAVES) in read_colors()
325 return leaf_count; in read_colors()
329 unsigned int leaf_count = 0; in read_colors() local
333 while (leaf_count > MAX_LEAVES) in read_colors()
336 return leaf_count; in read_colors()
340 while (*leaf_count > maximum_colors) in reduce_tree()
364 unsigned int leaf_count = 0; in quantize() local
[all …]
/dports/science/py-DendroPy/DendroPy-4.4.0/src/dendropy/calculate/
H A Dtreemeasure.py190 leaf_count = 0
193 leaf_count += 1
196 return float(nbar) / leaf_count
216 leaf_count = 0
219 leaf_count += 1
223 x = sum(1.0/j for j in range(2, leaf_count+1))
224 s = float(num_anc - (2 * leaf_count * x))/leaf_count
226 s = float(num_anc)/(pow(leaf_count, 3.0/2))
228 s = float(num_anc)/leaf_count
/dports/devel/boost-docs/boost_1_72_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp67 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
68 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
76 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp68 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
71 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
78 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp67 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
68 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
76 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp68 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
71 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
78 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/databases/percona57-server/boost_1_59_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp68 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
71 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
78 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/databases/xtrabackup/boost_1_59_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp68 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
71 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
78 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/databases/percona57-client/boost_1_59_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp68 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
71 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
78 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/devel/boost-libs/boost_1_72_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp67 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
68 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
76 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/devel/boost-python-libs/boost_1_72_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp67 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
68 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
76 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/devel/hyperscan/boost_1_75_0/libs/spirit/classic/test/
H A Dfundamental_tests.cpp67 BOOST_STATIC_ASSERT(1 == leaf_count<plain_t>::value); in leaf_count_tests()
68 BOOST_STATIC_ASSERT(1 == leaf_count<optional_t>::value); in leaf_count_tests()
69 BOOST_STATIC_ASSERT(1 == leaf_count<action_t>::value); in leaf_count_tests()
70 BOOST_STATIC_ASSERT(2 == leaf_count<sequence_t>::value); in leaf_count_tests()
76 BOOST_STATIC_ASSERT(3 == leaf_count<sequence2_t>::value); in leaf_count_tests()
77 BOOST_STATIC_ASSERT(3 == leaf_count<sequence3_t>::value); in leaf_count_tests()
/dports/sysutils/progsreiserfs/progsreiserfs-0.3.1-rc8/demos/
H A Dtraverse.c16 static unsigned long leaf_count, internal_count; variable
24 leaf_count++; in node_func()
60 leaf_count = 0, internal_count = 0; in main()
75 fprintf(stderr, "leaves: %lu\ninternals: %lu\n", leaf_count, internal_count); in main()
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/phy_tree/
H A Dtree_to_dist_mat.cpp106 unsigned int leaf_count = s_CountLeaves(node); in NodeToDistMat() local
108 mat.Resize(leaf_count, leaf_count); in NodeToDistMat()
109 leaf_distances.reserve(leaf_count); in NodeToDistMat()
111 labels.reserve(leaf_count); in NodeToDistMat()
/dports/devel/mdds/mdds-1.7.0/include/mdds/
H A Dnode.hpp397 size_t leaf_count = 1; in count_leaf_nodes() local
400 for (; p != p_end; p = p->next.get(), ++leaf_count) in count_leaf_nodes()
403 return leaf_count; in count_leaf_nodes()
406 inline size_t count_needed_nonleaf_nodes(size_t leaf_count) in count_needed_nonleaf_nodes() argument
411 if (leaf_count == 1) in count_needed_nonleaf_nodes()
414 if ((leaf_count % 2) == 1) in count_needed_nonleaf_nodes()
416 ++leaf_count; in count_needed_nonleaf_nodes()
418 leaf_count /= 2; in count_needed_nonleaf_nodes()
419 nonleaf_count += leaf_count; in count_needed_nonleaf_nodes()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/imesh/tests/
H A Dtest_kd_tree.cxx64 unsigned int leaf_count = 0; in test_kd_tree() local
68 ++leaf_count; in test_kd_tree()
74 ++leaf_count; in test_kd_tree()
80 TEST("Remainder covers all nodes",leaf_count,cube.num_faces()); in test_kd_tree()
/dports/math/py-mathics/Mathics3-2.2.0/mathics/core/
H A Dpattern.py55 leaf_count=None, argument
153 leaf_count=None, argument
184 leaf_count=None, argument
269 leaf_count=len(self.leaves),
331 leaf_count=len(self.leaves),
482 leaf_count=None, argument
635 leaf_count=leaf_count,
651 leaf_count=leaf_count,
/dports/math/dune-pdelab/dune-pdelab-20c7085389d3eb4f8ca99e1bc60f7fa6036536c8/dune/pdelab/gridfunctionspace/
H A Dentityindexcache.hh35 static const size_type leaf_count = TypeTree::TreeInfo<Ordering>::leafCount; member in Dune::PDELab::EntityIndexCache
39 typedef std::array<size_type,leaf_count + 1> Offsets;
77 return _offsets[leaf_count]; in size()
/dports/math/vtk8/VTK-8.2.0/Infovis/Layout/
H A DvtkTreeOrbitLayoutStrategy.cxx63 vtkIntArray* leaf_count = vtkArrayDownCast<vtkIntArray>( in OrbitChildren() local
65 if (!leaf_count) in OrbitChildren()
72 double totalChildren = leaf_count->GetValue(parent); in OrbitChildren()
81 vtkIdType subChildren = leaf_count->GetValue(childID); in OrbitChildren()
/dports/math/vtk9/VTK-9.1.0/Infovis/Layout/
H A DvtkTreeOrbitLayoutStrategy.cxx63 vtkIntArray* leaf_count = in OrbitChildren() local
65 if (!leaf_count) in OrbitChildren()
72 double totalChildren = leaf_count->GetValue(parent); in OrbitChildren()
81 vtkIdType subChildren = leaf_count->GetValue(childID); in OrbitChildren()
/dports/math/vtk6/VTK-6.2.0/Infovis/Layout/
H A DvtkTreeOrbitLayoutStrategy.cxx66 vtkIntArray* leaf_count = vtkIntArray::SafeDownCast( in OrbitChildren() local
68 if (!leaf_count) in OrbitChildren()
75 double totalChildren = leaf_count->GetValue(parent); in OrbitChildren()
84 vtkIdType subChildren = leaf_count->GetValue(childID); in OrbitChildren()
/dports/net-p2p/microdc2/microdc2-0.15.6/src/
H A Dhuffman.c248 uint16_t leaf_count; in huffman_decode() local
265 leaf_count = *(uint16_t *) (data+9); in huffman_decode()
267 if (data_size < 11 + leaf_count*2) in huffman_decode()
270 LeafNode leaves[leaf_count]; in huffman_decode()
274 for (c = 0; c < leaf_count; c++) { in huffman_decode()
286 for (c = 0; c < leaf_count; c++) { in huffman_decode()
/dports/math/mathicsscript/mathicsscript-3.1.0/mathicsscript/
H A Dformat.py199 leaf_count = 0
210 leftmost + leaf_count * leafdx,
220 leaf_count += newleaves
226 leaf_count = 1
230 return rootpos, leafpos, leaf_count
244 rootpos, leafpos, leaf_count = _hierarchy_pos(
/dports/math/mathics-django/Mathics-Django-2.2.0/mathics_django/web/
H A Dformat.py220 leaf_count = 0
231 leftmost + leaf_count * leafdx,
241 leaf_count += newleaves
247 leaf_count = 1
251 return rootpos, leafpos, leaf_count
265 rootpos, leafpos, leaf_count = _hierarchy_pos(

123456789