| /dports/devel/hyperscan/hyperscan-5.4.0/src/util/ |
| H A D | pqueue.h | 55 u32 max_child; in pq_sift() local
58 max_child = pq_right(j); in pq_sift()
60 max_child = pq_left(j); in pq_sift()
63 if (PQ_COMP_B(items, max_child, j_temp)) { in pq_sift()
64 items[j] = items[max_child]; in pq_sift()
65 j = max_child; in pq_sift()
|
| /dports/www/matomo/piwik/vendor/lox/xhprof/xhprof_lib/utils/ |
| H A D | callgraph_utils.php | 192 $max_child = null;
198 if ($max_child === null ||
202 $max_child)]["wt"])) {
203 $max_child = $child;
206 if ($max_child !== null) {
207 $path[$max_child] = true;
208 $path_edges[xhprof_build_parent_child_key($node, $max_child)] = true;
210 $node = $max_child;
|
| /dports/www/moodle310/moodle/lib/xhprof/xhprof_lib/utils/ |
| H A D | callgraph_utils.php | 196 $max_child = null;
202 if ($max_child === null ||
206 $max_child)]["wt"])) {
207 $max_child = $child;
210 if ($max_child !== null) {
211 $path[$max_child] = true;
212 $path_edges[xhprof_build_parent_child_key($node, $max_child)] = true;
214 $node = $max_child;
|
| /dports/www/moodle311/moodle/lib/xhprof/xhprof_lib/utils/ |
| H A D | callgraph_utils.php | 196 $max_child = null;
202 if ($max_child === null ||
206 $max_child)]["wt"])) {
207 $max_child = $child;
210 if ($max_child !== null) {
211 $path[$max_child] = true;
212 $path_edges[xhprof_build_parent_child_key($node, $max_child)] = true;
214 $node = $max_child;
|
| /dports/www/moodle39/moodle/lib/xhprof/xhprof_lib/utils/ |
| H A D | callgraph_utils.php | 196 $max_child = null;
202 if ($max_child === null ||
206 $max_child)]["wt"])) {
207 $max_child = $child;
210 if ($max_child !== null) {
211 $path[$max_child] = true;
212 $path_edges[xhprof_build_parent_child_key($node, $max_child)] = true;
214 $node = $max_child;
|
| /dports/net/srelay/srelay-0.4.8p3/ |
| H A D | main.c | 70 int max_child; variable
294 if (max_child > 0 && cur_child >= max_child) { in serv_loop()
296 cur_child, max_child); in serv_loop()
459 max_child = MAX_CHILD; in main()
562 max_child = atoi(optarg); in main()
756 msg_out(norm, "Starting: MAX_CH(%d)", max_child); in main()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/heap/ |
| H A D | binomial_heap.hpp | 803 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
805 if (super_t::operator()(max_child->value, n->value)) in siftdown()
808 max_child->remove_from_parent(); in siftdown()
810 n->swap_children(max_child); in siftdown()
812 max_child->update_children(); in siftdown()
817 max_child->add_child(n); in siftdown()
818 parent->add_child(max_child); in siftdown()
821 max_child->add_child(n); in siftdown()
822 trees.insert(position, *max_child); in siftdown()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/heap/ |
| H A D | binomial_heap.hpp | 803 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
805 if (super_t::operator()(max_child->value, n->value)) in siftdown()
808 max_child->remove_from_parent(); in siftdown()
810 n->swap_children(max_child); in siftdown()
812 max_child->update_children(); in siftdown()
817 max_child->add_child(n); in siftdown()
818 parent->add_child(max_child); in siftdown()
821 max_child->add_child(n); in siftdown()
822 trees.insert(position, *max_child); in siftdown()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 797 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
799 if (super_t::operator()(max_child->value, n->value)) in siftdown()
802 max_child->remove_from_parent(); in siftdown()
804 n->swap_children(max_child); in siftdown()
806 max_child->update_children(); in siftdown()
811 max_child->add_child(n); in siftdown()
812 parent->add_child(max_child); in siftdown()
815 max_child->add_child(n); in siftdown()
816 trees.insert(position, *max_child); in siftdown()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/heap/ |
| H A D | binomial_heap.hpp | 803 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
805 if (super_t::operator()(max_child->value, n->value)) in siftdown()
808 max_child->remove_from_parent(); in siftdown()
810 n->swap_children(max_child); in siftdown()
812 max_child->update_children(); in siftdown()
817 max_child->add_child(n); in siftdown()
818 parent->add_child(max_child); in siftdown()
821 max_child->add_child(n); in siftdown()
822 trees.insert(position, *max_child); in siftdown()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 797 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
799 if (super_t::operator()(max_child->value, n->value)) in siftdown()
802 max_child->remove_from_parent(); in siftdown()
804 n->swap_children(max_child); in siftdown()
806 max_child->update_children(); in siftdown()
811 max_child->add_child(n); in siftdown()
812 parent->add_child(max_child); in siftdown()
815 max_child->add_child(n); in siftdown()
816 trees.insert(position, *max_child); in siftdown()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 797 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
799 if (super_t::operator()(max_child->value, n->value)) in siftdown()
802 max_child->remove_from_parent(); in siftdown()
804 n->swap_children(max_child); in siftdown()
806 max_child->update_children(); in siftdown()
811 max_child->add_child(n); in siftdown()
812 parent->add_child(max_child); in siftdown()
815 max_child->add_child(n); in siftdown()
816 trees.insert(position, *max_child); in siftdown()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 797 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
799 if (super_t::operator()(max_child->value, n->value)) in siftdown()
802 max_child->remove_from_parent(); in siftdown()
804 n->swap_children(max_child); in siftdown()
806 max_child->update_children(); in siftdown()
811 max_child->add_child(n); in siftdown()
812 parent->add_child(max_child); in siftdown()
815 max_child->add_child(n); in siftdown()
816 trees.insert(position, *max_child); in siftdown()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/heap/ |
| H A D | binomial_heap.hpp | 800 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
802 if (super_t::operator()(max_child->value, n->value)) in siftdown()
805 max_child->remove_from_parent(); in siftdown()
807 n->swap_children(max_child); in siftdown()
809 max_child->update_children(); in siftdown()
814 max_child->add_child(n); in siftdown()
815 parent->add_child(max_child); in siftdown()
818 max_child->add_child(n); in siftdown()
819 trees.insert(position, *max_child); in siftdown()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 797 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
799 if (super_t::operator()(max_child->value, n->value)) in siftdown()
802 max_child->remove_from_parent(); in siftdown()
804 n->swap_children(max_child); in siftdown()
806 max_child->update_children(); in siftdown()
811 max_child->add_child(n); in siftdown()
812 parent->add_child(max_child); in siftdown()
815 max_child->add_child(n); in siftdown()
816 trees.insert(position, *max_child); in siftdown()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/heap/ |
| H A D | binomial_heap.hpp | 803 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch…
805 if (super_t::operator()(max_child->value, n->value))
808 max_child->remove_from_parent();
810 n->swap_children(max_child);
812 max_child->update_children();
817 max_child->add_child(n);
818 parent->add_child(max_child);
821 max_child->add_child(n);
822 trees.insert(position, *max_child);
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 797 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
799 if (super_t::operator()(max_child->value, n->value)) in siftdown()
802 max_child->remove_from_parent(); in siftdown()
804 n->swap_children(max_child); in siftdown()
806 max_child->update_children(); in siftdown()
811 max_child->add_child(n); in siftdown()
812 parent->add_child(max_child); in siftdown()
815 max_child->add_child(n); in siftdown()
816 trees.insert(position, *max_child); in siftdown()
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/mpi/pmi2/ |
| H A D | ring.c | 284 int max_child = pmix_stepd_rank * pmix_stepd_width + pmix_stepd_width; in pmix_ring_init() local
288 if (max_child >= pmix_stepd_ranks) { in pmix_ring_init()
289 max_child = pmix_stepd_ranks - 1; in pmix_ring_init()
291 pmix_stepd_children = max_child - min_child + 1; in pmix_ring_init()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/heap/ |
| H A D | binomial_heap.hpp | 835 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
837 if (super_t::operator()(max_child->value, n->value)) in siftdown()
840 max_child->remove_from_parent(); in siftdown()
842 n->swap_children(max_child); in siftdown()
844 max_child->update_children(); in siftdown()
849 max_child->add_child(n); in siftdown()
850 parent->add_child(max_child); in siftdown()
853 max_child->add_child(n); in siftdown()
854 trees.insert(position, *max_child); in siftdown()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/heap/ |
| H A D | binomial_heap.hpp | 835 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
837 if (super_t::operator()(max_child->value, n->value)) in siftdown()
840 max_child->remove_from_parent(); in siftdown()
842 n->swap_children(max_child); in siftdown()
844 max_child->update_children(); in siftdown()
849 max_child->add_child(n); in siftdown()
850 parent->add_child(max_child); in siftdown()
853 max_child->add_child(n); in siftdown()
854 trees.insert(position, *max_child); in siftdown()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/heap/ |
| H A D | binomial_heap.hpp | 835 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
837 if (super_t::operator()(max_child->value, n->value)) in siftdown()
840 max_child->remove_from_parent(); in siftdown()
842 n->swap_children(max_child); in siftdown()
844 max_child->update_children(); in siftdown()
849 max_child->add_child(n); in siftdown()
850 parent->add_child(max_child); in siftdown()
853 max_child->add_child(n); in siftdown()
854 trees.insert(position, *max_child); in siftdown()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/heap/ |
| H A D | binomial_heap.hpp | 835 …node_pointer max_child = detail::find_max_child<node_list_type, node_type, internal_compare>(n->ch… in siftdown() local
837 if (super_t::operator()(max_child->value, n->value)) in siftdown()
840 max_child->remove_from_parent(); in siftdown()
842 n->swap_children(max_child); in siftdown()
844 max_child->update_children(); in siftdown()
849 max_child->add_child(n); in siftdown()
850 parent->add_child(max_child); in siftdown()
853 max_child->add_child(n); in siftdown()
854 trees.insert(position, *max_child); in siftdown()
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/mca/coll/sm/ |
| H A D | coll_sm_module.c | 330 int max_child; in ompi_coll_sm_lazy_enable() local
332 max_child = root * num_children + num_children; in ompi_coll_sm_lazy_enable()
333 if (max_child >= size) { in ompi_coll_sm_lazy_enable()
334 max_child = size - 1; in ompi_coll_sm_lazy_enable()
336 num_children = max_child - min_child + 1; in ompi_coll_sm_lazy_enable()
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/mca/coll/sm/ |
| H A D | coll_sm_module.c | 330 int max_child; in ompi_coll_sm_lazy_enable() local
332 max_child = root * num_children + num_children; in ompi_coll_sm_lazy_enable()
333 if (max_child >= size) { in ompi_coll_sm_lazy_enable()
334 max_child = size - 1; in ompi_coll_sm_lazy_enable()
336 num_children = max_child - min_child + 1; in ompi_coll_sm_lazy_enable()
|
| /dports/science/hdf5-18/hdf5-1.8.21/src/ |
| H A D | H5HFiblock.c | 728 max_child_row = iblock->max_child / hdr->man_dtable.cparam.width; in H5HF_man_iblock_root_halve()
1096 iblock->max_child = 0; in H5HF_man_iblock_create()
1344 if(entry > iblock->max_child) in H5HF_man_iblock_attach()
1345 iblock->max_child = entry; in H5HF_man_iblock_attach()
1430 if(entry == iblock->max_child) { in H5HF_man_iblock_detach()
1432 while(!H5F_addr_defined(iblock->ents[iblock->max_child].addr)) in H5HF_man_iblock_detach()
1433 iblock->max_child--; in H5HF_man_iblock_detach()
1435 iblock->max_child = 0; in H5HF_man_iblock_detach()
1450 && entry > iblock->max_child) { in H5HF_man_iblock_detach()
1454 max_child_row = iblock->max_child / iblock->hdr->man_dtable.cparam.width; in H5HF_man_iblock_detach()
|