Home
last modified time | relevance | path

Searched refs:nodeMap (Results 1 – 25 of 705) sorted by relevance

12345678910>>...29

/dports/science/dftbplus/dftbplus-19.1/external/xmlf90/
H A Ddom_namednodemap.f9081 subroutine append_nnm(nodeMap,node) argument
85 if (.not. associated(nodeMap)) then
86 allocate(nodeMap)
87 nodeMap%length = 1
88 allocate(nodeMap%head)
90 nodeMap%head%node => node
91 nodeMap%tail => nodeMap%head
93 allocate(nodeMap%tail%next)
94 nodeMap%tail%next%node => node
96 nodeMap%tail => nodeMap%tail%next
[all …]
/dports/textproc/xmlf90/xmlf90-1.5.5/src/dom/
H A Dm_dom_namednodemap.f9079 subroutine append_nnm(nodeMap,node) argument
83 if (.not. associated(nodeMap)) then
84 allocate(nodeMap)
85 nodeMap%length = 1
86 allocate(nodeMap%head)
88 nodeMap%head%node => node
89 nodeMap%tail => nodeMap%head
91 allocate(nodeMap%tail%next)
92 nodeMap%tail%next%node => node
94 nodeMap%tail => nodeMap%tail%next
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Private.Xml/tests/XmlDocument/XmlNamedNodeMapTests/
H A DRemoveNamedItemTests.cs84 var nodeMap = xmlDocument.DocumentElement.Attributes; in ExistingNameWrongNamespace()
85 var count = nodeMap.Count; in ExistingNameWrongNamespace()
86 var node = nodeMap.RemoveNamedItem("att2", "ns6"); in ExistingNameWrongNamespace()
89 Assert.Equal(count, nodeMap.Count); in ExistingNameWrongNamespace()
99 var nodeMap = xmlDocument.DocumentElement.Attributes; in WrongNameExistingNamespace()
100 var count = nodeMap.Count; in WrongNameExistingNamespace()
101 var node = nodeMap.GetNamedItem("atte", "ns3"); in WrongNameExistingNamespace()
104 Assert.Equal(count, nodeMap.Count); in WrongNameExistingNamespace()
115 var count = nodeMap.Count; in WrongNameWrongNamespace()
116 var node = nodeMap.GetNamedItem("atte", "nsa"); in WrongNameWrongNamespace()
[all …]
H A DGetNamedItemTests.cs18 var nodeMap = xmlDocument.DocumentElement.Attributes; in NormalWork()
19 var node = nodeMap.GetNamedItem("att2", "ns3"); in NormalWork()
32 var nodeMap = xmlDocument.DocumentElement.Attributes; in ExistingNameWrongNamespace()
33 var node = nodeMap.GetNamedItem("att2", "ns6"); in ExistingNameWrongNamespace()
45 var nodeMap = xmlDocument.DocumentElement.Attributes; in WrongNameExistingNamespace()
46 var node = nodeMap.GetNamedItem("atte", "ns3"); in WrongNameExistingNamespace()
58 var nodeMap = xmlDocument.DocumentElement.Attributes; in WrongNameWrongNamespace()
59 var node = nodeMap.GetNamedItem("atte", "nsa"); in WrongNameWrongNamespace()
/dports/deskutils/fbreader/FBReader-0.99.6-freebsdport/fbreader/src/libraryTree/
H A DLibraryByTagView.cpp31 …tTagNodes(const ZLBlockTreeNode &root, std::map<shared_ptr<Tag>,TagNode*,TagComparator> &nodeMap) { in collectTagNodes() argument
36 nodeMap[tagNode->tag()] = tagNode; in collectTagNodes()
37 collectTagNodes(*tagNode, nodeMap); in collectTagNodes()
74 std::map<shared_ptr<Tag>,TagNode*,TagComparator> nodeMap; in makeUpToDate() local
75 collectTagNodes(rootNode(), nodeMap); in makeUpToDate()
79 TagNode *tagNode = nodeMap[tag]; in makeUpToDate()
84 new TagNode(nodeMap[tag->parent()], tag); in makeUpToDate()
85 nodeMap[tag] = tagNode; in makeUpToDate()
91 nodeMap.erase(nodeMap.find(*it)); in makeUpToDate()
94 …ared_ptr<Tag>,TagNode*,TagComparator>::reverse_iterator it = nodeMap.rbegin(); it != nodeMap.rend(… in makeUpToDate()
/dports/graphics/geos/geos-3.9.1/include/geos/geomgraph/
H A DEdgeIntersectionList.h69 mutable container nodeMap;
89 std::sort(nodeMap.begin(), nodeMap.end()); in begin()
90 nodeMap.erase(std::unique(nodeMap.begin(), nodeMap.end()), nodeMap.end()); in begin()
94 return nodeMap.begin(); in begin()
99 return nodeMap.end(); in end()
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/edit_align/
H A Dmeshtree.h72 std::map<int,MeshNode *> nodeMap; variable
80 MeshModel *MM(unsigned int i) {return nodeMap[i]->m;} in MM()
84 for(auto ni=nodeMap.begin();ni!=nodeMap.end();++ni) in clear()
86 nodeMap.clear(); in clear()
115 MeshNode *mp = nodeMap[id]; in find()
127 for(auto ni=nodeMap.begin();ni!=nodeMap.end();++ni) in find()
143 for(auto ni=nodeMap.begin();ni!=nodeMap.end();++ni) in bbox()
150 for(auto ni=nodeMap.begin();ni!=nodeMap.end();++ni) in gluedBBox()
/dports/graphics/geos/geos-3.9.1/src/geomgraph/
H A DEdgeIntersectionList.cpp58 if (nodeMap.empty()) { in add()
59 nodeMap.emplace_back(coord, segmentIndex, dist); in add()
63 if (nodeMap.back().segmentIndex == segmentIndex && nodeMap.back().dist == dist) { in add()
67 nodeMap.emplace_back(coord, segmentIndex, dist); in add()
70 if (sorted && (!(nodeMap[nodeMap.size() - 2] < nodeMap[nodeMap.size() - 1]))) { in add()
78 return nodeMap.empty(); in isEmpty()
84 for(const EdgeIntersection& ei : nodeMap) { in isIntersection()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/hxt/reparam/src/
H A Dhxt_linear_system_petsc.c21 uint32_t *nodeMap; member
84 uint32_t nk = system->nodeMap[el[k]]; in linearSystemPreAllocateMatrix()
146 uint32_t n = system->nodeMap[e0[i]]; in hxtLinearSystemPETScAddToRhs()
213 if (system->nodeMap[node0] == -1 || system->nodeMap[node1] == -1) in hxtLinearSystemPETScAddMatrixEntry()
227 if (system->nodeMap[node] == -1) in hxtLinearSystemPETScAddRhsEntry()
277 uint32_t *nodeMap; in hxtLinearSystemPETScCreate() local
280 nodeMap[i] = -1; in hxtLinearSystemPETScCreate()
284 if (nodeMap[elements[i]] == -1) in hxtLinearSystemPETScCreate()
287 system->nodeMap = nodeMap; in hxtLinearSystemPETScCreate()
365 uint32_t n= system->nodeMap[i]; in hxtLinearSystemPETScMapToVec()
[all …]
/dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/linkeddata/gojsonld/
H A DflatteningApi.go11 nodeMap := make(map[string]interface{}, 0)
12 nodeMap["@default"] = make(map[string]interface{}, 0)
18 err := generateNodeMap(element, nodeMap, &defaultArg, nil,
24 defaultGraph := nodeMap["@default"].(map[string]interface{})
26 for graphName := range nodeMap {
30 graph := nodeMap[graphName].(map[string]interface{})
118 if _, hasGraph := nodeMap[*activeGraph]; !hasGraph {
119 nodeMap[*activeGraph] = make(map[string]interface{}, 0)
121 graph := nodeMap[*activeGraph].(map[string]interface{})
254 err := generateNodeMap(value, nodeMap, activeGraph,
[all …]
H A DserializationApi.go16 nodeMap := make(map[string]interface{}, 0)
29 keys := sortedKeys(nodeMap)
31 graph := nodeMap[graphName]
266 nodeMap[subject] = tmpMap
271 _, hasObject := nodeMap[object]
275 nodeMap[object] = tmpMap
295 nodeMap[object] = nodeObjectMap
407 nodeMap := node.(map[string]interface{})
409 for key := range nodeMap {
426 if first, hasKey := nodeMap[RDF_FIRST]; hasKey {
[all …]
/dports/graphics/geos/geos-3.9.1/src/planargraph/
H A DNodeMap.cpp36 return nodeMap; in getNodeMap()
46 nodeMap.insert(pair<geom::Coordinate, Node*>(n->getCoordinate(), n)); in add()
58 nodeMap.erase(pt); in remove()
66 NodeMap::container::iterator it = nodeMap.begin(), itE = nodeMap.end(); in getNodes()
79 container::iterator found = nodeMap.find(coord); in find()
80 if(found == nodeMap.end()) { in find()
/dports/graphics/geos/geos-3.9.1/include/geos/planargraph/
H A DPlanarGraph.h66 NodeMap nodeMap; variable
79 nodeMap.add(node); in add()
129 return nodeMap.find(pt); in findNode()
139 return nodeMap.begin(); in nodeIterator()
145 return nodeMap.begin(); in nodeBegin()
151 return nodeMap.begin(); in nodeBegin()
157 return nodeMap.end(); in nodeEnd()
163 return nodeMap.end(); in nodeEnd()
175 nodeMap.getNodes(nodes); in getNodes()
H A DNodeMap.h52 container nodeMap;
94 return nodeMap.begin(); in iterator()
100 return nodeMap.begin(); in begin()
105 return nodeMap.begin(); in begin()
111 return nodeMap.end(); in end()
116 return nodeMap.end(); in end()
/dports/biology/bbmap/bbmap/current/jasper/
H A DDenseTree.java57 nodeMap.put(data[0], orgNode); in DenseTree()
72 addChild(nodeMap, lines); in DenseTree()
126 for(Entry<String, TreeNode> e : nodeMap.entrySet()) { in toString()
141 return nodeMap.keySet(); in keySet()
149 TreeNode firstNode = nodeMap.get(nodeName); in beginTraverse()
159 return nodeMap.get(nodeName); in getNode()
173 TreeNode earliestNode = nodeMap.get(nodeName); in beginAddDescendants()
176 earliestNode.nodeAddDescendantNames(nodeMap.get(nodeName).descendentNames); in beginAddDescendants()
185 return nodeMap.containsKey(orgName); in containsName()
190 for(String node : nodeMap.keySet()) { in getOrgCount()
[all …]
H A DSparseTree.java57 nodeMap.put(data[0], orgNode); in SparseTree()
72 addChild(nodeMap, lines); in SparseTree()
126 for(Entry<String, TreeNode> e : nodeMap.entrySet()) { in toString()
141 return nodeMap.keySet(); in keySet()
149 TreeNode firstNode = nodeMap.get(nodeName); in beginTraverse()
159 return nodeMap.get(nodeName); in getNode()
179 TreeNode earliestNode = nodeMap.get(nodeName); in beginAddDescendants()
182 earliestNode.nodeAddDescendantNames(nodeMap.get(nodeName).descendentNames); in beginAddDescendants()
196 return nodeMap.containsKey(orgName); in containsName()
218 return nodeMap.keySet().size(); in getOrgCount()
[all …]
H A DNCBISparseTree.java64 nodeMap.put(taxID, orgNode); in NCBISparseTree()
81 addChild(nodeMap, lines); in NCBISparseTree()
138 for(Entry<Integer, NCBITreeNode> e : nodeMap.entrySet()) { in toString()
153 return nodeMap.keySet(); in keySet()
161 NCBITreeNode firstNode = nodeMap.get(nodeID_); in beginTraverse()
171 return nodeMap.get(TaxonID); in getNodeByTaxID()
191 NCBITreeNode earliestNode = nodeMap.get(taxID_); in beginAddDescendants()
194 earliestNode.nodeAddDescendantNames(nodeMap.get(taxID_).descendentIDs); in beginAddDescendants()
208 return nodeMap.containsKey(orgTaxID); in containsTaxID()
281 HashMap<Integer, NCBITreeNode> nodeMap = new HashMap<Integer, NCBITreeNode>(); field in NCBISparseTree
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/geomgraph/
H A DNodeMap.java36 Map nodeMap = new TreeMap(); field in NodeMap
57 Node node = (Node) nodeMap.get(coord); in addNode()
60 nodeMap.put(coord, node); in addNode()
67 Node node = (Node) nodeMap.get(n.getCoordinate()); in addNode()
69 nodeMap.put(n.getCoordinate(), n); in addNode()
90 public Node find(Coordinate coord) { return (Node) nodeMap.get(coord); } in find()
94 return nodeMap.values().iterator(); in iterator()
98 return nodeMap.values(); in values()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/planargraph/
H A DNodeMap.java33 private Map nodeMap = new TreeMap(); field in NodeMap
47 nodeMap.put(n.getCoordinate(), n); in add()
56 return (Node) nodeMap.remove(pt); in remove()
62 public Node find(Coordinate coord) { return (Node) nodeMap.get(coord); } in find()
70 return nodeMap.values().iterator(); in iterator()
78 return nodeMap.values(); in values()
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/topology-read/model/
H A Dorbis-topology-reader.cc67 std::map<std::string, Ptr<Node> > nodeMap; in Read() local
98 if ( nodeMap[from] == 0 ) in Read()
101 nodeMap[from] = tmpNode; in Read()
106 if (nodeMap[to] == 0) in Read()
109 nodeMap[to] = tmpNode; in Read()
114 Link link ( nodeMap[from], from, nodeMap[to], to ); in Read()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/
H A Dlgf_reader_writer_test.cc54 reader.nodeMap("node_map", node_map); in checkDigraphReaderCompile()
90 writer.nodeMap("node_map", node_map); in checkDigraphWriterCompile()
122 reader.nodeMap("node_map", node_map); in checkGraphReaderCompile()
162 writer.nodeMap("node_map", node_map); in checkGraphWriterCompile()
203 reader.nodeMap("node_map", node_map); in checkBpGraphReaderCompile()
253 writer.nodeMap("node_map", node_map); in checkBpGraphWriterCompile()
306 writer.nodeMap("node_map1", node_map); in checkDigraphReaderWriter()
331 reader.nodeMap("node_map1", exp_node_map1); in checkDigraphReaderWriter()
382 writer.nodeMap("node_map1", node_map); in checkGraphReaderWriter()
413 reader.nodeMap("node_map1", exp_node_map1); in checkGraphReaderWriter()
[all …]
/dports/math/lemon/lemon-1.3.1/test/
H A Dlgf_reader_writer_test.cc54 reader.nodeMap("node_map", node_map); in checkDigraphReaderCompile()
90 writer.nodeMap("node_map", node_map); in checkDigraphWriterCompile()
122 reader.nodeMap("node_map", node_map); in checkGraphReaderCompile()
162 writer.nodeMap("node_map", node_map); in checkGraphWriterCompile()
203 reader.nodeMap("node_map", node_map); in checkBpGraphReaderCompile()
253 writer.nodeMap("node_map", node_map); in checkBpGraphWriterCompile()
306 writer.nodeMap("node_map1", node_map); in checkDigraphReaderWriter()
331 reader.nodeMap("node_map1", exp_node_map1); in checkDigraphReaderWriter()
382 writer.nodeMap("node_map1", node_map); in checkGraphReaderWriter()
413 reader.nodeMap("node_map1", exp_node_map1); in checkGraphReaderWriter()
[all …]
/dports/graphics/qvge/qvge-0.6.3/src/commonui/ogdf/
H A DCOGDFLayout.cpp83 QMap<CNode*, ogdf::node> nodeMap; in doLayout() local
93 nodeMap[node] = n; in doLayout()
99 ogdf::node n2 = nodeMap[edge->lastNode()]; in doLayout()
109 for (auto it = nodeMap.begin(); it != nodeMap.end(); ++it) in doLayout()
133 QMap<ogdf::node, CNode*> nodeMap; in graphTopologyToScene() local
140 nodeMap[n] = node; in graphTopologyToScene()
153 edge->setFirstNode(nodeMap[e->source()]); in graphTopologyToScene()
154 edge->setLastNode(nodeMap[e->target()]); in graphTopologyToScene()
167 QMap<ogdf::node, CNode*> nodeMap; in graphToScene() local
174 nodeMap[n] = node; in graphToScene()
[all …]
/dports/lang/v8/v8-9.6.180.12/tools/turbolizer/src/
H A Dgraph.ts5 nodeMap: Array<GNode>; property in Graph
16 this.nodeMap = [];
26 this.nodeMap[jsonNode.id] = new GNode(jsonNode.nodeLabel);
30 const t = this.nodeMap[e.target];
31 const s = this.nodeMap[e.source];
44 for (const node of this.nodeMap) {
59 for (const node of this.nodeMap) {
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/tools/turbolizer/src/
H A Dgraph.ts5 nodeMap: Array<GNode>; property in Graph
16 this.nodeMap = [];
26 this.nodeMap[jsonNode.id] = new GNode(jsonNode.nodeLabel);
30 const t = this.nodeMap[e.target];
31 const s = this.nodeMap[e.source];
44 for (const node of this.nodeMap) {
59 for (const node of this.nodeMap) {

12345678910>>...29