| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/PRM/gspan/ |
| H A D | pattern.cpp | 127 if (node_map.second(u) < node_map.second(v)) { in _rec_()
130 } else if ((p.existsArc(node_map.second(u), node_map.second(v))) in _rec_()
131 || (p.existsArc(node_map.second(v), node_map.second(u)))) { in _rec_()
148 p.addArc(node_map.second(u), node_map.second(v), *data); in _rec_()
151 if (node_map.second(u) < node_map.second(v)) { in _rec_()
170 if (_rec_(p, node_map, node_map.first(node), nei)) return true; in _rec_()
173 if (_rec_(p, node_map, node_map.first(node), nei)) return true; in _rec_()
203 if (node_map.second(u) < node_map.second(v)) { in _not_rec_()
206 } else if ((p.existsArc(node_map.second(u), node_map.second(v))) in _not_rec_()
225 p.addArc(node_map.second(u), node_map.second(v), *data); in _not_rec_()
[all …]
|
| /dports/math/octomap/octomap-1.9.7/octomap/include/octomap/ |
| H A D | MapNode.hxx | 37 MapNode<TREETYPE>::MapNode(): node_map(0) { in MapNode()
42 this->node_map = in_node_map; in MapNode()
70 node_map->getOccupied(occs); in generatePointcloud()
79 if(node_map != 0){ in clear()
80 delete node_map; in clear()
81 node_map = 0; in clear()
89 if(node_map != 0) in readMap()
90 delete node_map; in readMap()
92 node_map = new TREETYPE(0.05); in readMap()
93 return node_map->readBinary(filename); in readMap()
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/ |
| H A D | lgf_reader_writer_test.cc | 293 node_map[n1] = 11; in checkDigraphReaderWriter()
294 node_map[n2] = 12; in checkDigraphReaderWriter()
295 node_map[n3] = 13; in checkDigraphReaderWriter()
363 node_map[n1] = 11; in checkGraphReaderWriter()
364 node_map[n2] = 12; in checkGraphReaderWriter()
365 node_map[n3] = 13; in checkGraphReaderWriter()
454 node_map[rn1] = 11; in checkBpGraphReaderWriter()
455 node_map[rn2] = 12; in checkBpGraphReaderWriter()
456 node_map[rn3] = 13; in checkBpGraphReaderWriter()
457 node_map[bn1] = 14; in checkBpGraphReaderWriter()
[all …]
|
| /dports/math/lemon/lemon-1.3.1/test/ |
| H A D | lgf_reader_writer_test.cc | 293 node_map[n1] = 11; in checkDigraphReaderWriter()
294 node_map[n2] = 12; in checkDigraphReaderWriter()
295 node_map[n3] = 13; in checkDigraphReaderWriter()
363 node_map[n1] = 11; in checkGraphReaderWriter()
364 node_map[n2] = 12; in checkGraphReaderWriter()
365 node_map[n3] = 13; in checkGraphReaderWriter()
454 node_map[rn1] = 11; in checkBpGraphReaderWriter()
455 node_map[rn2] = 12; in checkBpGraphReaderWriter()
456 node_map[rn3] = 13; in checkBpGraphReaderWriter()
457 node_map[bn1] = 14; in checkBpGraphReaderWriter()
[all …]
|
| /dports/science/gramps/gramps-5.1.4/gramps/gui/views/treemodels/ |
| H A D | flatbasemodel.py | 481 self.node_map = FlatNodeMap()
497 if self.node_map:
498 self.node_map.destroy()
499 self.node_map = None
539 return self.node_map.max_rows()
545 return len(self.node_map)
552 self.node_map.reverse_order()
600 self.node_map.clear_map()
632 self.node_map.clear_map()
830 return len(self.node_map) > 0
[all …]
|
| /dports/devel/monotone/monotone-1.1/src/ |
| H A D | restrictions.cc | 46 for (node_status_iterator i = node_map.begin(); i != node_map.end(); ++i) in add_parents()
63 node_status_iterator n = node_map.find(*i); in add_parents()
64 if (n == node_map.end()) in add_parents()
100 if (n != node_map.end()) in map_nodes()
104 node_map[nid] = status; in map_nodes()
260 add_parents(node_map, roster); in node_restriction()
280 add_parents(node_map, roster1); in node_restriction()
281 add_parents(node_map, roster2); in node_restriction()
299 map_nodes(node_map, parent_roster(i), in node_restriction()
308 add_parents(node_map, roster2); in node_restriction()
[all …]
|
| /dports/devel/godot2/godot-2.1.6-stable/scene/resources/ |
| H A D | shader_graph.cpp | 69 shader[t].node_map.clear(); in _set_data()
93 shader[t].node_map[n.id] = n; in _set_data()
106 int ec = shader[i].node_map.size(); in _get_data()
619 shader[p_type].node_map[p_id] = node; in node_add()
660 shader[p_type].node_map.erase(p_id); in node_remove()
724 …if (shader[p_type].node_map.has(p_dst_id) && shader[p_type].node_map[p_dst_id].connections.has(p_d… in disconnect_node()
762 shader[p_type].node_map.clear(); in clear()
908 shader[p_which].node_map[nn.id] = nn; in duplicate_nodes()
1345 shader[i].node_map.insert(0, output); in ShaderGraph()
1346 shader[i].node_map.insert(1, input); in ShaderGraph()
[all …]
|
| /dports/devel/godot2-tools/godot-2.1.6-stable/scene/resources/ |
| H A D | shader_graph.cpp | 69 shader[t].node_map.clear(); in _set_data()
93 shader[t].node_map[n.id] = n; in _set_data()
106 int ec = shader[i].node_map.size(); in _get_data()
619 shader[p_type].node_map[p_id] = node; in node_add()
660 shader[p_type].node_map.erase(p_id); in node_remove()
724 …if (shader[p_type].node_map.has(p_dst_id) && shader[p_type].node_map[p_dst_id].connections.has(p_d… in disconnect_node()
762 shader[p_type].node_map.clear(); in clear()
908 shader[p_which].node_map[nn.id] = nn; in duplicate_nodes()
1345 shader[i].node_map.insert(0, output); in ShaderGraph()
1346 shader[i].node_map.insert(1, input); in ShaderGraph()
[all …]
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/select/cons_res/ |
| H A D | job_test.c | 297 xassert(node_map); in _eval_nodes()
409 bit_clear(node_map, i); in _eval_nodes()
547 bit_set(node_map, i); in _eval_nodes()
583 bit_set(node_map, i); in _eval_nodes()
663 bit_set(node_map, i); in _eval_nodes()
718 bit_clear(node_map, i); in _eval_nodes_spread()
750 bit_set(node_map, i); in _eval_nodes_spread()
797 bit_clear(node_map, i); in _eval_nodes_busy()
833 bit_set(node_map, i); in _eval_nodes_busy()
852 bit_set(node_map, i); in _eval_nodes_busy()
[all …]
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/exodusii/5.22b/exodus/forbind/test/ |
| H A D | testrd1.dmp | 152 node_map( 1) = 3
153 node_map( 2) = 6
154 node_map( 3) = 9
155 node_map( 4) = 12
156 node_map( 5) = 15
157 node_map( 6) = 18
158 node_map( 7) = 21
159 node_map( 8) = 24
160 node_map( 9) = 27
161 node_map( 10) = 30
[all …]
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/exodusii/5.22b/exodus/cbind/test/ |
| H A D | testrd1.dmp | 153 node_map(0) = 3
154 node_map(1) = 6
155 node_map(2) = 9
156 node_map(3) = 12
157 node_map(4) = 15
158 node_map(5) = 18
159 node_map(6) = 21
160 node_map(7) = 24
161 node_map(8) = 27
162 node_map(9) = 30
[all …]
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/select/cons_tres/ |
| H A D | job_test.c | 406 xassert(node_map); in _eval_nodes()
826 bit_set(node_map, i); in _eval_nodes()
874 bit_set(node_map, i); in _eval_nodes()
972 bit_set(node_map, i); in _eval_nodes()
1163 bit_set(node_map, i); in _eval_nodes_spread()
1360 bit_set(node_map, i); in _eval_nodes_busy()
1514 node_map)) { in _eval_nodes_dfly()
2147 node_map)) { in _eval_nodes_topo()
2600 bit_set(node_map, i); in _eval_nodes_topo()
2838 bit_set(node_map, i); in _eval_nodes_lln()
[all …]
|
| /dports/math/libmesh/libmesh-1.6.2/src/mesh/ |
| H A D | abaqus_io.C | 84 const unsigned * node_map, in add_eletype_entry() argument
97 (node_map, node_map+node_map_size).swap in add_eletype_entry()
119 const unsigned int node_map[] = {0}; // identity in init_eletypes() local
126 const unsigned int node_map[] = {0,1}; // identity in init_eletypes() local
128 add_eletype_entry(EDGE2, node_map, 2, side_map, 2); in init_eletypes()
135 add_eletype_entry(TRI3, node_map, 3, side_map, 3); in init_eletypes()
142 add_eletype_entry(QUAD4, node_map, 4, side_map, 4); in init_eletypes()
149 add_eletype_entry(TET4, node_map, 4, side_map, 4); in init_eletypes()
156 add_eletype_entry(TET10, node_map, 10, side_map, 4); in init_eletypes()
163 add_eletype_entry(HEX8, node_map, 8, side_map, 6); in init_eletypes()
[all …]
|
| /dports/net-im/py-matrix-synapse/synapse-1.50.2/contrib/graph/ |
| H A D | graph.py | 30 node_map = {}
82 node_map[name] = node
90 if end_name not in node_map:
94 edge = pydot.Edge(node_map[start_name], node_map[end_name])
103 if prev_state_name in node_map:
105 node_map[start_name], node_map[prev_state_name], style="dotted"
|
| H A D | graph2.py | 50 node_map = {}
95 node_map[event.event_id] = node
101 end_node = node_map[prev_id]
105 node_map[prev_id] = end_node
108 edge = pydot.Edge(node_map[event.event_id], end_node)
118 cluster.add_node(node_map[event_id])
|
| /dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/tests/ |
| H A D | test_merge_graphs.py | 16 node_map, edge_map = merge_graphs(main_graph, addition_graph)
19 self.assertEqual({}, node_map)
33 node_map, edge_map = merge_graphs(main_graph, addition_graph)
36 self.assertEqual({}, node_map)
71 node_map, edge_map = merge_graphs(main_graph, addition_graph)
76 self.assertEqual(expected_node_map, node_map)
124 node_map, edge_map = merge_graphs(main_graph, addition_graph)
154 new_node = main_graph.get_node(node_map[node_id])
169 mapped_new_vertices = (node_map[original_vertex_a], node_map[original_vertex_b])
|
| /dports/biology/stacks/stacks-2.4/src/ |
| H A D | cmb.cc | 150 this->node_map[n->id] = cnt; in catalog_tree()
170 n_1 = this->node_map[n->id]; in catalog_tree()
171 n_2 = this->node_map[n->min_adj_list[i]->id]; in catalog_tree()
221 this->edges[this->node_map[n_1]][this->node_map[n_2]] = 0; in partition_tree()
222 this->edges[this->node_map[n_2]][this->node_map[n_1]] = 0; in partition_tree()
247 n_1 = this->node_map[n->id]; in partition_tree()
248 n_2 = this->node_map[n->min_adj_list[j]->id]; in partition_tree()
277 this->edges[this->node_map[n_1]][this->node_map[n_2]] = 1; in partition_tree()
278 this->edges[this->node_map[n_2]][this->node_map[n_1]] = 1; in partition_tree()
|
| /dports/textproc/libxml++26/libxml++-2.40.1/libxml++/ |
| H A D | document.cc | 31 void find_wrappers(xmlNode* node, NodeMap& node_map) in find_wrappers() argument
45 find_wrappers(child, node_map); in find_wrappers()
78 find_wrappers(reinterpret_cast<xmlNode*>(attr), node_map); in find_wrappers()
83 void remove_found_wrappers(xmlNode* node, NodeMap& node_map) in remove_found_wrappers() argument
92 remove_found_wrappers(child, node_map); in remove_found_wrappers()
115 node_map.find(static_cast<xmlpp::Node*>(node->_private)); in remove_found_wrappers()
116 if (iter != node_map.end()) in remove_found_wrappers()
119 node_map.erase(iter); in remove_found_wrappers()
424 NodeMap node_map; in process_xinclude() local
428 find_wrappers(root, node_map); in process_xinclude()
[all …]
|
| /dports/net/samba412/samba-4.12.15/ctdb/common/ |
| H A D | ctdb_util.c | 462 struct ctdb_node_map_old **node_map) in node_map_add() argument
474 num = (*node_map)->num + 1; in node_map_add()
477 *node_map = talloc_realloc_size(mem_ctx, *node_map, s); in node_map_add()
478 if (*node_map == NULL) { in node_map_add()
483 n = &(*node_map)->nodes[(*node_map)->num]; in node_map_add()
485 n->pnn = (*node_map)->num; in node_map_add()
488 (*node_map)->num++; in node_map_add()
569 struct ctdb_node_map_old *node_map; in ctdb_node_list_to_map() local
574 if (node_map == NULL) { in ctdb_node_list_to_map()
580 node_map->num = num_nodes; in ctdb_node_list_to_map()
[all …]
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/select/cons_common/ |
| H A D | node_data.c | 95 node_use_record_t *orig_ptr, bitstr_t *node_map) in node_data_dup_use() argument
107 if (node_map) { in node_data_dup_use()
108 i_first = bit_ffs(node_map); in node_data_dup_use()
110 i_last = bit_fls(node_map) + 1; in node_data_dup_use()
119 if (node_map && !bit_test(node_map, i)) in node_data_dup_use()
|
| /dports/devel/godot-tools/godot-3.2.3-stable/scene/animation/ |
| H A D | animation_tree_player.cpp | 479 NodeBase *nb = node_map[p_node]; in _process_node()
976 node_map[p_node] = n; in add_node()
1192 node_map[p_node]->pos = p_pos; in node_set_position()
1198 return node_map[p_node]->type; in node_get_type()
1203 return node_map[p_node]->pos; in node_get_position()
1375 node_map.erase(p_node); in remove_node()
1690 return (node_map.has(p_name)); in node_exists()
1714 node_map[p_new_name] = node_map[p_node]; in node_rename()
1715 node_map.erase(p_node); in node_rename()
1862 while (node_map.size()) { in ~AnimationTreePlayer()
[all …]
|
| /dports/devel/godot2-tools/godot-2.1.6-stable/scene/animation/ |
| H A D | animation_tree_player.cpp | 474 NodeBase *nb = node_map[p_node]; in _process_node()
968 node_map[p_node] = n; in add_node()
1181 node_map[p_node]->pos = p_pos; in node_set_pos()
1187 return node_map[p_node]->type; in node_get_type()
1192 return node_map[p_node]->pos; in node_get_pos()
1360 node_map.erase(p_node); in remove_node()
1671 return (node_map.has(p_name)); in node_exists()
1695 node_map[p_new_name] = node_map[p_node]; in node_rename()
1696 node_map.erase(p_node); in node_rename()
1829 while (node_map.size()) { in ~AnimationTreePlayer()
[all …]
|
| /dports/devel/godot2/godot-2.1.6-stable/scene/animation/ |
| H A D | animation_tree_player.cpp | 474 NodeBase *nb = node_map[p_node]; in _process_node()
968 node_map[p_node] = n; in add_node()
1181 node_map[p_node]->pos = p_pos; in node_set_pos()
1187 return node_map[p_node]->type; in node_get_type()
1192 return node_map[p_node]->pos; in node_get_pos()
1360 node_map.erase(p_node); in remove_node()
1671 return (node_map.has(p_name)); in node_exists()
1695 node_map[p_new_name] = node_map[p_node]; in node_rename()
1696 node_map.erase(p_node); in node_rename()
1829 while (node_map.size()) { in ~AnimationTreePlayer()
[all …]
|
| /dports/devel/godot/godot-3.2.3-stable/scene/animation/ |
| H A D | animation_tree_player.cpp | 479 NodeBase *nb = node_map[p_node]; in _process_node()
976 node_map[p_node] = n; in add_node()
1192 node_map[p_node]->pos = p_pos; in node_set_position()
1198 return node_map[p_node]->type; in node_get_type()
1203 return node_map[p_node]->pos; in node_get_position()
1375 node_map.erase(p_node); in remove_node()
1690 return (node_map.has(p_name)); in node_exists()
1714 node_map[p_new_name] = node_map[p_node]; in node_rename()
1715 node_map.erase(p_node); in node_rename()
1862 while (node_map.size()) { in ~AnimationTreePlayer()
[all …]
|
| /dports/shells/fish/fish-3.3.1/src/ |
| H A D | lru.h | 54 std::unordered_map<wcstring, lru_node_t> node_map; variable
81 auto iter = this->node_map.find(*node->key); in evict_node()
82 assert(iter != this->node_map.end()); in evict_node()
94 node_map.erase(iter); in evict_node()
185 auto where = this->node_map.find(key); in get()
186 if (where == this->node_map.end()) { in get()
196 auto where = this->node_map.find(key); in evict_node()
197 if (where == this->node_map.end()) return false; in evict_node()
209 while (this->node_map.size() > max_node_count) { in insert()
219 auto iter_inserted = this->node_map.emplace(std::move(key), lru_node_t(std::move(value))); in insert_no_eviction()
[all …]
|