/dports/devel/tbb/oneTBB-2020.3/examples/task/tree_sum/ |
H A D | TreeMaker.h | 39 my_root->node_count = number_of_nodes; in SubTreeCreationTask() 40 my_root->value = Value(Pi*number_of_nodes); in SubTreeCreationTask() 71 if( number_of_nodes==0 ) { in do_in_one_thread() 75 n->node_count = number_of_nodes; in do_in_one_thread() 76 n->value = Value(Pi*number_of_nodes); in do_in_one_thread() 77 --number_of_nodes; in do_in_one_thread() 79 n->right = do_in_one_thread( number_of_nodes - number_of_nodes/2 ); in do_in_one_thread() 94 root->node_count = number_of_nodes; 95 root->value = Value(Pi*number_of_nodes); 96 --number_of_nodes; [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/examples/task/tree_sum/ |
H A D | TreeMaker.h | 39 my_root->node_count = number_of_nodes; in SubTreeCreationTask() 40 my_root->value = Value(Pi*number_of_nodes); in SubTreeCreationTask() 71 if( number_of_nodes==0 ) { in do_in_one_thread() 75 n->node_count = number_of_nodes; in do_in_one_thread() 76 n->value = Value(Pi*number_of_nodes); in do_in_one_thread() 77 --number_of_nodes; in do_in_one_thread() 79 n->right = do_in_one_thread( number_of_nodes - number_of_nodes/2 ); in do_in_one_thread() 94 root->node_count = number_of_nodes; 95 root->value = Value(Pi*number_of_nodes); 96 --number_of_nodes; [all …]
|
/dports/math/py-or-tools/or-tools-9.2/ortools/graph/ |
H A D | one_tree_lower_bound.h | 162 number_of_nodes_(number_of_nodes) {} in VolgenantJonkerEvaluator() 189 static int MaxIterations(int number_of_nodes) { in MaxIterations() argument 218 number_of_nodes, cost); in HeldWolfeCrowderEvaluator() 268 for (int i = 0; i < number_of_nodes; ++i) { in NearestNeighbors() 270 neighbors.reserve(number_of_nodes - 1); in NearestNeighbors() 271 for (int j = 0; j < number_of_nodes; ++j) { in NearestNeighbors() 383 if (number_of_nodes < 2) return 0; in ComputeOneTreeLowerBoundWithAlgorithm() 406 for (int j = 0; j < number_of_nodes; ++j) { in ComputeOneTreeLowerBoundWithAlgorithm() 415 for (int j = 0; j < number_of_nodes; ++j) { in ComputeOneTreeLowerBoundWithAlgorithm() 430 for (int j = 0; j < number_of_nodes; ++j) { in ComputeOneTreeLowerBoundWithAlgorithm() [all …]
|
/dports/www/osrm-backend/osrm-backend-5.26.0/src/engine/ |
H A D | search_engine_data.cpp | 26 forward_heap_1.reset(new QueryHeap(number_of_nodes)); in InitializeOrClearFirstThreadLocalStorage() 35 reverse_heap_1.reset(new QueryHeap(number_of_nodes)); in InitializeOrClearFirstThreadLocalStorage() 47 forward_heap_2.reset(new QueryHeap(number_of_nodes)); in InitializeOrClearSecondThreadLocalStorage() 56 reverse_heap_2.reset(new QueryHeap(number_of_nodes)); in InitializeOrClearSecondThreadLocalStorage() 68 forward_heap_3.reset(new QueryHeap(number_of_nodes)); in InitializeOrClearThirdThreadLocalStorage() 77 reverse_heap_3.reset(new QueryHeap(number_of_nodes)); in InitializeOrClearThirdThreadLocalStorage() 89 many_to_many_heap.reset(new ManyToManyQueryHeap(number_of_nodes)); in InitializeOrClearManyToManyThreadLocalStorage() 100 unsigned number_of_nodes, unsigned number_of_boundary_nodes) in InitializeOrClearFirstThreadLocalStorage() argument 108 forward_heap_1.reset(new QueryHeap(number_of_nodes, number_of_boundary_nodes)); in InitializeOrClearFirstThreadLocalStorage() 117 reverse_heap_1.reset(new QueryHeap(number_of_nodes, number_of_boundary_nodes)); in InitializeOrClearFirstThreadLocalStorage() [all …]
|
/dports/cad/tochnog/Sources/Tochnog-Latest-jan-2014/ |
H A D | new_mesh.cc | 183 if ( number_of_nodes[idim]%2!=0 ) number_of_nodes[idim]++; in new_mesh_version() 184 if ( number_of_nodes[idim]<4 ) number_of_nodes[idim] = 4; in new_mesh_version() 191 (1+number_of_nodes[1])*(1+number_of_nodes[2]); in new_mesh_version() 349 el[1] = (kn+0)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() 351 el[2] = (kn+0)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() 353 el[3] = (kn+0)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() 355 el[4] = (kn+0)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() 357 el[5] = (kn+1)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() 359 el[6] = (kn+1)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() 361 el[7] = (kn+1)*number_of_nodes[1]*number_of_nodes[0]+ in new_mesh_version() [all …]
|
/dports/science/py-dlib/dlib-19.22/dlib/graph_cuts/ |
H A D | find_max_factor_graph_potts.h | 42 flows.resize(p.number_of_nodes()); in setup() 220 unsigned long number_of_nodes ( in number_of_nodes() function 235 if (it >= g.number_of_nodes()) in out_end() 245 if (it >= g.number_of_nodes()) in in_end() 280 if (it1 >= g.number_of_nodes()) in get_flow() 352 if (it1 >= g.number_of_nodes()) in adjust_flow() 393 if (it < g.number_of_nodes()) in set_label() 405 if (it < g.number_of_nodes()) in get_label() 407 if (it == g.number_of_nodes()) in get_label() 444 unsigned long number_of_nodes ( in number_of_nodes() function [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/graph_cuts/ |
H A D | find_max_factor_graph_potts.h | 42 flows.resize(p.number_of_nodes()); in setup() 220 unsigned long number_of_nodes ( in number_of_nodes() function 235 if (it >= g.number_of_nodes()) in out_end() 245 if (it >= g.number_of_nodes()) in in_end() 280 if (it1 >= g.number_of_nodes()) in get_flow() 352 if (it1 >= g.number_of_nodes()) in adjust_flow() 393 if (it < g.number_of_nodes()) in set_label() 405 if (it < g.number_of_nodes()) in get_label() 407 if (it == g.number_of_nodes()) in get_label() 444 unsigned long number_of_nodes ( in number_of_nodes() function [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/generators/tests/ |
H A D | test_small.py | 47 assert G.number_of_nodes() == 5 54 assert G.number_of_nodes() == 12 61 assert G.number_of_nodes() == 8 68 assert G.number_of_nodes() == 20 73 assert G.number_of_nodes() == 4 79 assert G.number_of_nodes() == 20 86 assert G.number_of_nodes() == 12 93 assert G.number_of_nodes() == 14 107 assert G.number_of_nodes() == 5 114 assert G.number_of_nodes() == 5 [all …]
|
/dports/net-p2p/bitcoin-utils/bitcoin-22.0/src/test/ |
H A D | net_peer_eviction_tests.cpp | 466 for (int number_of_nodes = 0; number_of_nodes < 200; ++number_of_nodes) { in BOOST_AUTO_TEST_CASE() local 470 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 478 number_of_nodes, [](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 486 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 487 candidate.nLastTXTime = number_of_nodes - candidate.id; in BOOST_AUTO_TEST_CASE() 494 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 506 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 513 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 524 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 535 if (number_of_nodes >= 29) { in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/bitcoin/bitcoin-22.0/src/test/ |
H A D | net_peer_eviction_tests.cpp | 466 for (int number_of_nodes = 0; number_of_nodes < 200; ++number_of_nodes) { in BOOST_AUTO_TEST_CASE() local 470 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 478 number_of_nodes, [](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 486 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 487 candidate.nLastTXTime = number_of_nodes - candidate.id; in BOOST_AUTO_TEST_CASE() 494 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 506 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 513 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 524 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { in BOOST_AUTO_TEST_CASE() 535 if (number_of_nodes >= 29) { in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/bitcoin-daemon/bitcoin-22.0/src/test/ |
H A D | net_peer_eviction_tests.cpp | 466 for (int number_of_nodes = 0; number_of_nodes < 200; ++number_of_nodes) { 470 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { 478 number_of_nodes, [](NodeEvictionCandidate& candidate) { 486 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { 487 candidate.nLastTXTime = number_of_nodes - candidate.id; 494 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { 506 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { 513 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { 524 number_of_nodes, [number_of_nodes](NodeEvictionCandidate& candidate) { 535 if (number_of_nodes >= 29) { [all …]
|
/dports/www/osrm-backend/osrm-backend-5.26.0/include/util/ |
H A D | dynamic_graph.hpp | 90 node_array.resize(number_of_nodes); in DynamicGraph() 93 edge_list.resize(number_of_nodes); in DynamicGraph() 105 number_of_nodes = nodes; in DynamicGraph() 107 node_array.resize(number_of_nodes); in DynamicGraph() 144 number_of_nodes = other.number_of_nodes; in DynamicGraph() 161 number_of_nodes = other.number_of_nodes; in DynamicGraph() 171 number_of_nodes = other.number_of_nodes; in operator =() 188 other.number_of_nodes = number_of_nodes; in Filter() 263 number_of_nodes += 1; in InsertNode() 265 return number_of_nodes; in InsertNode() [all …]
|
/dports/science/py-dlib/dlib-19.22/dlib/test/ |
H A D | graph.cpp | 53 DLIB_TEST(a.number_of_nodes() == 0); in graph_test() 58 DLIB_TEST(a.number_of_nodes() == 5); in graph_test() 69 DLIB_TEST(a.number_of_nodes() == 4); in graph_test() 121 DLIB_TEST(a.number_of_nodes() == 0); in graph_test() 122 DLIB_TEST(b.number_of_nodes() == 4); in graph_test() 125 DLIB_TEST(b.number_of_nodes() == 4); in graph_test() 139 DLIB_TEST(a.number_of_nodes() == 0); in graph_test() 186 DLIB_TEST(a.number_of_nodes() == 4); in graph_test() 205 DLIB_TEST(a.number_of_nodes() == 3); in graph_test() 248 DLIB_TEST(b.number_of_nodes() == 4); in graph_test() [all …]
|
H A D | graph_cuts.cpp | 51 unsigned long number_of_nodes ( in number_of_nodes() function in __anon7734a6000111::dense_potts_problem 56 ) const { return number_of_nodes()-1; } in number_of_neighbors() 74 DLIB_TEST(node_id < number_of_nodes()); in get_neighbor() 100 DLIB_TEST(idx < number_of_nodes()); in factor_value() 108 DLIB_TEST(idx1 < number_of_nodes()); in factor_value_disagreement() 109 DLIB_TEST(idx2 < number_of_nodes()); in factor_value_disagreement() 163 unsigned long number_of_nodes ( in number_of_nodes() function in __anon7734a6000111::image_potts_problem 353 labels.resize(g.number_of_nodes()); in brute_force_potts_model_on_graph() 720 source = g.number_of_nodes()-1; in make_random_grid_graph() 721 sink = g.number_of_nodes()-2; in make_random_grid_graph() [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
H A D | graph.cpp | 53 DLIB_TEST(a.number_of_nodes() == 0); in graph_test() 58 DLIB_TEST(a.number_of_nodes() == 5); in graph_test() 69 DLIB_TEST(a.number_of_nodes() == 4); in graph_test() 121 DLIB_TEST(a.number_of_nodes() == 0); in graph_test() 122 DLIB_TEST(b.number_of_nodes() == 4); in graph_test() 125 DLIB_TEST(b.number_of_nodes() == 4); in graph_test() 139 DLIB_TEST(a.number_of_nodes() == 0); in graph_test() 186 DLIB_TEST(a.number_of_nodes() == 4); in graph_test() 205 DLIB_TEST(a.number_of_nodes() == 3); in graph_test() 248 DLIB_TEST(b.number_of_nodes() == 4); in graph_test() [all …]
|
H A D | graph_cuts.cpp | 51 unsigned long number_of_nodes ( in number_of_nodes() function in __anon25b08cba0111::dense_potts_problem 56 ) const { return number_of_nodes()-1; } in number_of_neighbors() 74 DLIB_TEST(node_id < number_of_nodes()); in get_neighbor() 100 DLIB_TEST(idx < number_of_nodes()); in factor_value() 108 DLIB_TEST(idx1 < number_of_nodes()); in factor_value_disagreement() 109 DLIB_TEST(idx2 < number_of_nodes()); in factor_value_disagreement() 163 unsigned long number_of_nodes ( in number_of_nodes() function in __anon25b08cba0111::image_potts_problem 353 labels.resize(g.number_of_nodes()); in brute_force_potts_model_on_graph() 720 source = g.number_of_nodes()-1; in make_random_grid_graph() 721 sink = g.number_of_nodes()-2; in make_random_grid_graph() [all …]
|
/dports/science/py-dlib/dlib-19.22/dlib/graph/ |
H A D | graph_kernel_1.h | 64 DLIB_CASSERT(index < self.number_of_nodes(), in check_node() 80 DLIB_CASSERT(node_index1 < self.number_of_nodes() && in check_has_edge() 81 node_index2 < self.number_of_nodes(), in check_has_edge() 97 DLIB_CASSERT(node_index1 < self.number_of_nodes() && in check_add_edge() 98 node_index2 < self.number_of_nodes(), in check_add_edge() 124 DLIB_CASSERT(node_index1 < self.number_of_nodes() && in check_remove_edge() 125 node_index2 < self.number_of_nodes(), in check_remove_edge() 151 DLIB_CASSERT(index < self.number_of_nodes(), in check_remove_node() 226 unsigned long number_of_nodes ( 349 serialize(item.number_of_nodes(), out); [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/graph/ |
H A D | graph_kernel_1.h | 64 DLIB_CASSERT(index < self.number_of_nodes(), in check_node() 80 DLIB_CASSERT(node_index1 < self.number_of_nodes() && in check_has_edge() 81 node_index2 < self.number_of_nodes(), in check_has_edge() 97 DLIB_CASSERT(node_index1 < self.number_of_nodes() && in check_add_edge() 98 node_index2 < self.number_of_nodes(), in check_add_edge() 124 DLIB_CASSERT(node_index1 < self.number_of_nodes() && in check_remove_edge() 125 node_index2 < self.number_of_nodes(), in check_remove_edge() 151 DLIB_CASSERT(index < self.number_of_nodes(), in check_remove_node() 226 unsigned long number_of_nodes ( 349 serialize(item.number_of_nodes(), out); [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/operators/tests/ |
H A D | test_product.py | 50 assert nx.number_of_nodes(G) == 5 * 3 52 assert nx.number_of_nodes(G) == 3 * 5 60 assert nx.number_of_nodes(G) == 5 * 3 62 assert nx.number_of_nodes(G) == 5 * 3 64 assert nx.number_of_nodes(G) == 5 * 3 66 assert nx.number_of_nodes(G) == 5 * 3 69 assert nx.number_of_nodes(G) == 5 * 3 168 assert nx.number_of_nodes(G) == 5 * 3 173 assert nx.number_of_nodes(G) == 3 * 5 251 assert nx.number_of_nodes(G) == 5 * 3 [all …]
|
/dports/science/py-dlib/dlib-19.22/dlib/bayes_utils/ |
H A D | bayes_utils.h | 729 DLIB_ASSERT( n < bn.number_of_nodes(), in node_num_values() 769 DLIB_ASSERT( n < bn.number_of_nodes(), in node_value() 787 DLIB_ASSERT( n < bn.number_of_nodes(), in node_is_evidence() 806 DLIB_ASSERT( n < bn.number_of_nodes(), in set_node_as_evidence() 824 DLIB_ASSERT( n < bn.number_of_nodes(), in set_node_as_nonevidence() 844 DLIB_ASSERT( n < bn.number_of_nodes(), in set_node_num_values() 979 DLIB_ASSERT( n < bn.number_of_nodes(), in node_first_parent_assignment() 1004 DLIB_ASSERT( n < bn.number_of_nodes(), in node_next_parent_assignment() 1386 … std::vector<unsigned long> node_assigned_to(bn.number_of_nodes(),join_tree.number_of_nodes()); in create_bayesian_network_join_tree() 1631 num_nodes = bn.number_of_nodes(); in bayesian_network_join_tree() [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/bayes_utils/ |
H A D | bayes_utils.h | 729 DLIB_ASSERT( n < bn.number_of_nodes(), in node_num_values() 769 DLIB_ASSERT( n < bn.number_of_nodes(), in node_value() 787 DLIB_ASSERT( n < bn.number_of_nodes(), in node_is_evidence() 806 DLIB_ASSERT( n < bn.number_of_nodes(), in set_node_as_evidence() 824 DLIB_ASSERT( n < bn.number_of_nodes(), in set_node_as_nonevidence() 844 DLIB_ASSERT( n < bn.number_of_nodes(), in set_node_num_values() 979 DLIB_ASSERT( n < bn.number_of_nodes(), in node_first_parent_assignment() 1004 DLIB_ASSERT( n < bn.number_of_nodes(), in node_next_parent_assignment() 1386 … std::vector<unsigned long> node_assigned_to(bn.number_of_nodes(),join_tree.number_of_nodes()); in create_bayesian_network_join_tree() 1631 num_nodes = bn.number_of_nodes(); in bayesian_network_join_tree() [all …]
|
/dports/science/elmerfem/elmerfem-release-9.0/post/src/sico2elmer/ |
H A D | sico2elmerc.c | 64 printf("| %d\n", number_of_nodes[1] + number_of_nodes[0]); in FC_FUNC() 87 if (auxiliary!=number_of_nodes[0]){ in FC_FUNC() 165 printf("| %d\n",number_of_nodes[0]+number_of_nodes[1]); in FC_FUNC() 186 fprintf(ptFile, "%d %d 1 1\n", number_of_nodes[0]+number_of_nodes[1], number_of_elements); in FC_FUNC() 231 if (n!=number_of_nodes[0]+number_of_nodes[1]){ in FC_FUNC() 933 printf("| %d\n", number_of_nodes[1] + number_of_nodes[0]); in FC_FUNC() 1019 number_of_nodes[1] = 0; in FC_FUNC() 1040 printf("| %d\n",number_of_nodes[0]+number_of_nodes[1]); in FC_FUNC() 1162 if (n!=number_of_nodes[0]+number_of_nodes[1]){ in FC_FUNC() 2024 int number_of_nodes, in make_float_from_integer_scalar_field() argument [all …]
|
/dports/science/py-dlib/dlib-19.22/dlib/directed_graph/ |
H A D | directed_graph_kernel_1.h | 94 DLIB_CASSERT(index < self.number_of_nodes(), in check_node() 110 DLIB_CASSERT(parent_node_index < self.number_of_nodes() && in check_has_edge() 111 child_node_index < self.number_of_nodes(), in check_has_edge() 127 DLIB_CASSERT(parent_node_index < self.number_of_nodes() && in check_add_edge() 128 child_node_index < self.number_of_nodes(), in check_add_edge() 154 DLIB_CASSERT(parent_node_index < self.number_of_nodes() && in check_remove_edge() 155 child_node_index < self.number_of_nodes(), in check_remove_edge() 181 DLIB_CASSERT(index < self.number_of_nodes(), in check_remove_node() 270 unsigned long number_of_nodes ( 417 serialize(item.number_of_nodes(), out); [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/directed_graph/ |
H A D | directed_graph_kernel_1.h | 94 DLIB_CASSERT(index < self.number_of_nodes(), in check_node() 110 DLIB_CASSERT(parent_node_index < self.number_of_nodes() && in check_has_edge() 111 child_node_index < self.number_of_nodes(), in check_has_edge() 127 DLIB_CASSERT(parent_node_index < self.number_of_nodes() && in check_add_edge() 128 child_node_index < self.number_of_nodes(), in check_add_edge() 154 DLIB_CASSERT(parent_node_index < self.number_of_nodes() && in check_remove_edge() 155 child_node_index < self.number_of_nodes(), in check_remove_edge() 181 DLIB_CASSERT(index < self.number_of_nodes(), in check_remove_node() 270 unsigned long number_of_nodes ( 417 serialize(item.number_of_nodes(), out); [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/utils/converters/stl_to_cartesian/ |
H A D | mesh.c | 14 msh->node_start = calloc(msh->stats.number_of_nodes, sizeof(msh_node)); in MshAllocate() 16 msh->stats.nodes_malloced = msh->stats.number_of_nodes; in MshAllocate() 34 msh->node_start = realloc(msh->node_start, (msh->stats.number_of_nodes + 1) * sizeof(msh_node)); in MshReallocate() 36 msh->stats.nodes_malloced = msh->stats.number_of_nodes; in MshReallocate() 53 msh->stats.number_of_nodes = 0; in MshClose() 92 fprintf(fp, "%d\n", msh->stats.number_of_nodes); in MshWriteMSH() 94 for (i = 0; i < msh->stats.number_of_nodes; i++) in MshWriteMSH()
|