| /dports/games/opencity/opencity-0.0.6.5stable/src/tinyxpath/ |
| H A D | node_set.cpp | 142 unsigned u_node; in S_get_string_value() local
145 for (u_node = 0; u_node < u_nb_node; u_node++) in S_get_string_value()
161 unsigned u_node; in o_exist_in_set() local
163 for (u_node = 0; u_node < u_nb_node; u_node++) in o_exist_in_set()
301 for (u_node = 0; u_node < u_nb_node; u_node++) in v_document_sort()
303 pafp_list [u_node] . vp_ptr = vpp_node_set [u_node]; in v_document_sort()
304 pafp_list [u_node] . o_flag = op_attrib [u_node]; in v_document_sort()
307 for (u_node = 0; u_node < u_nb_node; u_node++) in v_document_sort()
309 vpp_node_set [u_node] = pafp_list [u_node] . vp_ptr; in v_document_sort()
310 op_attrib [u_node] = pafp_list [u_node] . o_flag; in v_document_sort()
[all …]
|
| H A D | xpath_processor.cpp | 1133 for (u_node = 0; u_node < u_nb_node; u_node++) in v_execute_step()
1267 for (u_node = 0; u_node < ns_target .u_get_nb_node_in_set (); u_node++) in v_execute_step()
1686 unsigned u_node; in v_function_sum() local
1701 for (u_node = 0; u_node < nsp_set -> u_get_nb_node_in_set (); u_node++) in v_function_sum()
1703 i_sum += nsp_set -> i_get_value (u_node); in v_function_sum()
1704 d_sum += nsp_set -> d_get_value (u_node); in v_function_sum()
1836 unsigned u_node; in v_function_equal_node_and_other() local
1847 for (u_node = 0; u_node < nsp_ptr -> u_get_nb_node_in_set (); u_node++) in v_function_equal_node_and_other()
1852 for (u_node = 0; u_node < nsp_ptr -> u_get_nb_node_in_set (); u_node++) in v_function_equal_node_and_other()
1874 unsigned u_node; in v_function_union() local
[all …]
|
| /dports/www/domoticz/domoticz-2020.2/tinyxpath/ |
| H A D | node_set.cpp | 153 unsigned u_node; in S_get_string_value() local
156 for (u_node = 0; u_node < u_nb_node; u_node++) in S_get_string_value()
172 unsigned u_node; in o_exist_in_set() local
174 for (u_node = 0; u_node < u_nb_node; u_node++) in o_exist_in_set()
379 for (u_node = 0; u_node < u_nb_node; u_node++) in v_document_sort()
381 p2afp_list [u_node] . vp_node = vpp_node_set [u_node]; in v_document_sort()
382 p2afp_list [u_node] . o_flag = op_attrib [u_node]; in v_document_sort()
386 for (u_node = 0; u_node < u_nb_node; u_node++) in v_document_sort()
388 vpp_node_set [u_node] = p2afp_list [u_node] . vp_node; in v_document_sort()
389 op_attrib [u_node] = p2afp_list [u_node] . o_flag; in v_document_sort()
[all …]
|
| H A D | xpath_processor.cpp | 1135 for (u_node = 0; u_node < u_nb_node; u_node++) in v_execute_step()
1280 for (u_node = 0; u_node < ns_target .u_get_nb_node_in_set (); u_node++) in v_execute_step()
1714 unsigned u_node; in v_function_sum() local
1727 for (u_node = 0; u_node < nsp_set -> u_get_nb_node_in_set (); u_node++) in v_function_sum()
1729 i_sum += nsp_set -> i_get_value (u_node); in v_function_sum()
1730 d_sum += nsp_set -> d_get_value (u_node); in v_function_sum()
1938 unsigned u_node; in v_function_equal_node_and_other() local
1949 for (u_node = 0; u_node < nsp_ptr -> u_get_nb_node_in_set (); u_node++) in v_function_equal_node_and_other()
1954 for (u_node = 0; u_node < nsp_ptr -> u_get_nb_node_in_set (); u_node++) in v_function_equal_node_and_other()
1976 unsigned u_node; in v_function_union() local
[all …]
|
| /dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
| H A D | modulo-sched.c | 724 duplicate_insn_chain (u_node->first_note, u_node->insn); in duplicate_insns_of_cycles()
1553 rtx insn = u_node->insn; in sms_schedule_by_order()
1819 ASAP (u_node) = 0; in calculate_order_params()
1822 ASAP (u_node) = MAX (ASAP (u_node), in calculate_order_params()
1832 HEIGHT (u_node) = 0; in calculate_order_params()
1836 ALAP (u_node) = MIN (ALAP (u_node), in calculate_order_params()
1838 HEIGHT (u_node) = MAX (HEIGHT (u_node), in calculate_order_params()
1883 min_mob = MOB (u_node); in find_max_hv_min_mob()
1889 min_mob = MOB (u_node); in find_max_hv_min_mob()
1912 min_mob = MOB (u_node); in find_max_dv_min_mob()
[all …]
|
| /dports/devel/librest/rest-0.8.1/tests/ |
| H A D | lastfm.c | 38 RestXmlNode *root, *u_node, *node; in main() local
70 u_node = rest_xml_node_find (root, "user"); in main()
71 g_assert (u_node); in main()
73 node = rest_xml_node_find (u_node, "id"); in main()
77 node = rest_xml_node_find (u_node, "name"); in main()
|
| /dports/graphics/vigra/vigra-8acd73a/include/vigra/ |
| H A D | binary_forest.hxx | 179 NodeT & u_node = nodes_[u.id()]; in addArc() local
184 if (u_node.left_child == v.id()) in addArc()
186 if (u_node.right_child == v.id()) in addArc()
190 if (u_node.left_child == -1) in addArc()
192 u_node.left_child = v.id(); in addArc()
194 else if (u_node.right_child == -1) in addArc()
196 u_node.right_child = v.id(); in addArc()
248 NodeT const & u_node = nodes_[arc.id()/2]; in target() local
250 return Node(u_node.left_child); in target()
252 return Node(u_node.right_child); in target()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id);
485 adj_iter nu = adjacent_vertices(u_node, G).first;
487 if (neighbor == u_node) {
517 deg -= supernode_size[u_node];
518 degree[u_node] = deg; //update degree
519 degreelists[deg].push(u_node);
521 degree_lists_marker.unmark(u_node);
557 deg -= supernode_size[u_node];
558 degree[u_node] = deg;
559 degreelists[deg].push(u_node);
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 476 vertex_t u_node = get(index_vertex_map, u_id); in update() local
485 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
487 if (neighbor == u_node) { in update()
517 deg -= supernode_size[u_node]; in update()
518 degree[u_node] = deg; //update degree in update()
519 degreelists[deg].push(u_node); in update()
521 degree_lists_marker.unmark(u_node); in update()
557 deg -= supernode_size[u_node]; in update()
558 degree[u_node] = deg; in update()
559 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/devel/py-taskflow/taskflow-4.6.3/taskflow/engines/action_engine/ |
| H A D | runtime.py | 70 nodes = collections.deque((u_node, atom)
71 for u_node in predecessors_iter(atom))
74 u_node, v_node = nodes.popleft()
75 u_node_kind = graph.nodes[u_node]['kind']
76 u_v_data = graph.adj[u_node][v_node]
82 yield _EdgeDecider(u_node, u_node_kind,
86 if u_node_kind == com.FLOW and u_node not in visited:
89 visited.add(u_node)
94 nodes.extend((u_u_node, u_node)
95 for u_u_node in predecessors_iter(u_node))
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 485 vertex_t u_node = get(index_vertex_map, u_id); in update() local
494 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
496 if (neighbor == u_node) { in update()
526 deg -= supernode_size[u_node]; in update()
527 degree[u_node] = deg; //update degree in update()
528 degreelists[deg].push(u_node); in update()
530 degree_lists_marker.unmark(u_node); in update()
566 deg -= supernode_size[u_node]; in update()
567 degree[u_node] = deg; in update()
568 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 573 if (neighbor == u_node) in update()
593 supernode_size[u_node] in update()
597 i_node, u_node); in update()
615 deg -= supernode_size[u_node]; in update()
616 degree[u_node] = deg; // update degree in update()
617 degreelists[deg].push(u_node); in update()
619 degree_lists_marker.unmark(u_node); in update()
665 deg -= supernode_size[u_node]; in update()
666 degree[u_node] = deg; in update()
667 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 573 if (neighbor == u_node) in update()
593 supernode_size[u_node] in update()
597 i_node, u_node); in update()
615 deg -= supernode_size[u_node]; in update()
616 degree[u_node] = deg; // update degree in update()
617 degreelists[deg].push(u_node); in update()
619 degree_lists_marker.unmark(u_node); in update()
665 deg -= supernode_size[u_node]; in update()
666 degree[u_node] = deg; in update()
667 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 573 if (neighbor == u_node) in update()
593 supernode_size[u_node] in update()
597 i_node, u_node); in update()
615 deg -= supernode_size[u_node]; in update()
616 degree[u_node] = deg; // update degree in update()
617 degreelists[deg].push(u_node); in update()
619 degree_lists_marker.unmark(u_node); in update()
665 deg -= supernode_size[u_node]; in update()
666 degree[u_node] = deg; in update()
667 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 485 vertex_t u_node = get(index_vertex_map, u_id); in update() local
494 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
496 if (neighbor == u_node) { in update()
526 deg -= supernode_size[u_node]; in update()
527 degree[u_node] = deg; //update degree in update()
528 degreelists[deg].push(u_node); in update()
530 degree_lists_marker.unmark(u_node); in update()
566 deg -= supernode_size[u_node]; in update()
567 degree[u_node] = deg; in update()
568 degreelists[deg].push(u_node); in update()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 485 vertex_t u_node = get(index_vertex_map, u_id); in update() local
494 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
496 if (neighbor == u_node) { in update()
526 deg -= supernode_size[u_node]; in update()
527 degree[u_node] = deg; //update degree in update()
528 degreelists[deg].push(u_node); in update()
530 degree_lists_marker.unmark(u_node); in update()
566 deg -= supernode_size[u_node]; in update()
567 degree[u_node] = deg; in update()
568 degreelists[deg].push(u_node); in update()
[all …]
|