| /dports/biology/p5-BioPerl/BioPerl-1.7.7/t/Tree/ |
| H A D | TreeStatistics.t | 98 $node_i = $tree->find_node(-id => 'N1');
104 $node_i = $tree->find_node(-id => 'N6');
109 $node_i = $tree->find_node(-id => '1');
112 $node_i = $tree->find_node(-id => 'N3');
118 $node_i = $tree->find_node(-id => 'N7');
132 $node_i = $tree->find_node(-id => 'N7');
137 $node_i = $tree->find_node(-id => 'N4');
140 $node_i = $tree->find_node(-id => 'N6');
143 $node_i = $tree->find_node(-id => 'N7');
153 $node_i = $tree->find_node(-id => 'N4');
[all …]
|
| /dports/games/simutrans/simutrans-121.0/tpl/ |
| H A D | hashtable_tpl.h | 63 node_i(node_i) in iterator()
71 if (++node_i == bag_i->end()) {
78 node_i = bag_i->begin();
86 bool operator ==(iterator const& o) const { return bag_i == o.bag_i && node_i == o.node_i; }
103 pos.node_i = old.bag_i->erase( old.node_i ); in erase()
104 if( pos.node_i == pos.bag_i->end() ) { in erase()
111 pos.node_i = pos.bag_i->begin(); in erase()
134 node_i(node_i) in const_iterator()
142 if (++node_i == bag_i->end()) {
149 node_i = bag_i->begin();
[all …]
|
| /dports/science/py-dlib/dlib-19.22/dlib/graph_cuts/ |
| H A D | find_max_factor_graph_potts.h | 701 for (unsigned long node_i = 0; node_i < prob.number_of_nodes(); ++node_i) in find_max_factor_graph_potts() local
705 unsigned long node_j = prob.get_neighbor(node_i,jj); in find_max_factor_graph_potts()
709 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
715 DLIB_ASSERT(prob.get_neighbor_idx(node_i,prob.get_neighbor(node_i,jj)) == jj, in find_max_factor_graph_potts()
718 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
724 DLIB_ASSERT(prob.get_neighbor(node_j,prob.get_neighbor_idx(node_j,node_i))==node_i, in find_max_factor_graph_potts()
727 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
733 DLIB_ASSERT(prob.factor_value_disagreement(node_i,node_j) >= 0, in find_max_factor_graph_potts()
736 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
740 …DLIB_ASSERT(prob.factor_value_disagreement(node_i,node_j) == prob.factor_value_disagreement(node_j… in find_max_factor_graph_potts()
[all …]
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/graph_cuts/ |
| H A D | find_max_factor_graph_potts.h | 701 for (unsigned long node_i = 0; node_i < prob.number_of_nodes(); ++node_i) in find_max_factor_graph_potts() local
705 unsigned long node_j = prob.get_neighbor(node_i,jj); in find_max_factor_graph_potts()
709 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
715 DLIB_ASSERT(prob.get_neighbor_idx(node_i,prob.get_neighbor(node_i,jj)) == jj, in find_max_factor_graph_potts()
718 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
724 DLIB_ASSERT(prob.get_neighbor(node_j,prob.get_neighbor_idx(node_j,node_i))==node_i, in find_max_factor_graph_potts()
727 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
733 DLIB_ASSERT(prob.factor_value_disagreement(node_i,node_j) >= 0, in find_max_factor_graph_potts()
736 << "\n\t node_i: " << node_i in find_max_factor_graph_potts()
740 …DLIB_ASSERT(prob.factor_value_disagreement(node_i,node_j) == prob.factor_value_disagreement(node_j… in find_max_factor_graph_potts()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/interprocess/test/ |
| H A D | node_pool_test.hpp | 97 for(std::size_t node_i = 0; node_i < nodes_per_block; ++node_i){ in deallocate_free_blocks() local
100 pool.deallocate_node(nodes[i*nodes_per_block + node_i]); in deallocate_free_blocks()
104 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
113 if(node_i != (nodes_per_block - 1)){ in deallocate_free_blocks()
114 if(max_blocks*(node_i+1) != pool.num_free_nodes()){ in deallocate_free_blocks()
|
| /dports/devel/aws-c-common/aws-c-common-0.6.15/source/ |
| H A D | task_scheduler.c | 170 struct aws_linked_list_node *node_i; in aws_task_scheduler_schedule_future() local
171 for (node_i = aws_linked_list_begin(&scheduler->timed_list); in aws_task_scheduler_schedule_future()
172 node_i != aws_linked_list_end(&scheduler->timed_list); in aws_task_scheduler_schedule_future()
173 node_i = aws_linked_list_next(node_i)) { in aws_task_scheduler_schedule_future()
175 struct aws_task *task_i = AWS_CONTAINER_OF(node_i, struct aws_task, node); in aws_task_scheduler_schedule_future()
180 aws_linked_list_insert_before(node_i, &task->node); in aws_task_scheduler_schedule_future()
|
| /dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_align/ |
| H A D | graph_algorithm_refine_align.h | 51 TPos1 node_i, in _getOtherSequenceAndProject() argument
60 if(node_i >= (TPos1)toSourcePosition(row(segment, 0), view_clipped_end_pos)) in _getOtherSequenceAndProject()
63 node_j = toSourcePosition(row(segment, 1), toViewPosition(row(segment, 0), node_i)); in _getOtherSequenceAndProject()
69 if(node_i >= (TPos1)toSourcePosition(row(segment, 1), view_clipped_end_pos)) in _getOtherSequenceAndProject()
72 node_j = toSourcePosition(row(segment, 0), toViewPosition(row(segment, 1), node_i)); in _getOtherSequenceAndProject()
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_align/ |
| H A D | graph_algorithm_refine_align.h | 51 TPos1 node_i, in _getOtherSequenceAndProject() argument
60 if(node_i >= (TPos1)toSourcePosition(row(segment, 0), view_clipped_end_pos)) in _getOtherSequenceAndProject()
63 node_j = toSourcePosition(row(segment, 1), toViewPosition(row(segment, 0), node_i)); in _getOtherSequenceAndProject()
69 if(node_i >= (TPos1)toSourcePosition(row(segment, 1), view_clipped_end_pos)) in _getOtherSequenceAndProject()
72 node_j = toSourcePosition(row(segment, 0), toViewPosition(row(segment, 1), node_i)); in _getOtherSequenceAndProject()
|
| /dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_align/ |
| H A D | graph_algorithm_refine_align.h | 51 TPos1 node_i, in _getOtherSequenceAndProject() argument
61 if(node_i >= (TPos1)toSourcePosition(row(segment, 0), view_clipped_end_pos)) in _getOtherSequenceAndProject()
64 node_j = toSourcePosition(row(segment, 1), toViewPosition(row(segment, 0), node_i)); in _getOtherSequenceAndProject()
70 if(node_i >= (TPos1)toSourcePosition(row(segment, 1), view_clipped_end_pos)) in _getOtherSequenceAndProject()
73 node_j = toSourcePosition(row(segment, 0), toViewPosition(row(segment, 1), node_i)); in _getOtherSequenceAndProject()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/MATCH/ |
| H A D | match.c | 159 int node_i; member
822 for (; node_i != node_k; node_i = PNODE(node_i->parent)) {
824 node_i->matched_edge = node_i->parent_edge;
967 for (; node_i != node_k; node_i = PNODE(node_i->parent)) {
968 node_i->blossom_next_edge = node_i->parent_edge;
969 node_i->blossom_next = node_i->parent;
1322 node *node_i;
1434 ary[srk->shrinks.length].node_i = node_i - G->nodelist;
1667 node_i = PNODE(ary[i].node_i);
1686 node_i = PNODE(ary[i].node_i);
[all …]
|
| /dports/games/minilens/minilens-1.2/menu/ |
| H A D | levels.gd | 34 for node_i in range(lsb_state.get_node_count()):
35 if lsb_state.get_node_path(node_i) == ".":
36 for prop_i in range(lsb_state.get_node_property_count(node_i)):
37 if lsb_state.get_node_property_name(node_i, prop_i) == "rect/min_size":
38 level_select_button_size = lsb_state.get_node_property_value(node_i, prop_i)
|
| /dports/databases/timescaledb/timescaledb-2.5.1/tsl/test/src/remote/ |
| H A D | remote_exec.c | 210 unsigned node_i, nodes_tuples, num_dist_res; in ts_remote_exec_get_result_strings() local
246 for (nodes_tuples = 0, node_i = 0; node_i < num_dist_res; in ts_remote_exec_get_result_strings()
247 ++node_i, nodes_tuples += PQntuples(result)) in ts_remote_exec_get_result_strings()
250 result = ts_dist_cmd_get_result_by_index(funcctx->user_fctx, node_i, &node_name); in ts_remote_exec_get_result_strings()
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/select/cons_res/ |
| H A D | job_test.c | 136 uint32_t node_i, uint32_t s_p_n);
158 uint32_t node_i, uint32_t s_p_n) in _gres_sock_job_test() argument
2061 const uint32_t node_i, in can_job_run_on_node() argument
2097 if (node_usage[node_i].gres_list) in can_job_run_on_node()
2120 node_ptr->name, node_i, s_p_n); in can_job_run_on_node()
2130 node_i, &cpu_alloc_size, false, NULL); in can_job_run_on_node()
2134 select_node_record[node_i].vpus; in can_job_run_on_node()
2137 node_i, &cpu_alloc_size, NULL); in can_job_run_on_node()
2142 node_i, &cpu_alloc_size, true, NULL); in can_job_run_on_node()
2235 node_usage[node_i].node_state, in can_job_run_on_node()
[all …]
|
| /dports/math/z3/z3-z3-4.8.13/src/muz/spacer/ |
| H A D | spacer_unsat_core_plugin.cpp | 604 unsigned node_i; in add_edge() local
608 node_i = 0; in add_edge()
615 node_i = tmp; in add_edge()
620 node_i = m_min_cut.new_node(); in add_edge()
623 m_proof_to_node_plus.insert(i, node_i); in add_edge()
625 if (node_i >= m_node_to_formula.size()) in add_edge()
627 m_node_to_formula.resize(node_i + 1); in add_edge()
630 m_node_to_formula[node_i] = m.get_fact(i); in add_edge()
632 m_min_cut.add_edge(node_other, node_i, 1); in add_edge()
669 m_min_cut.add_edge(node_i, node_j, 1); in add_edge()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/muz/spacer/ |
| H A D | spacer_unsat_core_plugin.cpp | 604 unsigned node_i; in add_edge() local
608 node_i = 0; in add_edge()
615 node_i = tmp; in add_edge()
620 node_i = m_min_cut.new_node(); in add_edge()
623 m_proof_to_node_plus.insert(i, node_i); in add_edge()
625 if (node_i >= m_node_to_formula.size()) in add_edge()
627 m_node_to_formula.resize(node_i + 1); in add_edge()
630 m_node_to_formula[node_i] = m.get_fact(i); in add_edge()
632 m_min_cut.add_edge(node_other, node_i, 1); in add_edge()
669 m_min_cut.add_edge(node_i, node_j, 1); in add_edge()
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/select/cons_common/ |
| H A D | cons_common.h | 75 const uint32_t node_i,
173 const uint32_t node_i,
196 const uint32_t node_i,
|
| /dports/biology/seqan1/seqan-1.3.1/seqan/refinement/ |
| H A D | graph_algorithm_refine_align.h | 51 TValue node_i, in _getOtherSequenceAndProject() argument
60 node_j = toSourcePosition(row(segment,1),toViewPosition(row(segment,0),node_i)); in _getOtherSequenceAndProject()
65 node_j = toSourcePosition(row(segment,0),toViewPosition(row(segment,1),node_i)); in _getOtherSequenceAndProject()
|