Home
last modified time | relevance | path

Searched refs:nodeOrder (Results 1 – 25 of 30) sorted by relevance

12

/dports/science/chrono/chrono-7.0.1/src/chrono/fea/
H A DChMeshExporter.cpp55 int nodeOrder[] = {0, 1}; in writeMesh() local
56 mynodes[0] = elementC->GetNodeN(nodeOrder[0])->GetIndex(); in writeMesh()
57 mynodes[1] = elementC->GetNodeN(nodeOrder[1])->GetIndex(); in writeMesh()
60 auto nodeA = (elementC->GetNodeN(nodeOrder[myNodeN])); in writeMesh()
74 int nodeOrder[] = {0, 1, 2, 3}; in writeMesh() local
75 mynodes[0] = elementS->GetNodeN(nodeOrder[0])->GetIndex(); in writeMesh()
76 mynodes[1] = elementS->GetNodeN(nodeOrder[1])->GetIndex(); in writeMesh()
77 mynodes[2] = elementS->GetNodeN(nodeOrder[2])->GetIndex(); in writeMesh()
78 mynodes[3] = elementS->GetNodeN(nodeOrder[3])->GetIndex(); in writeMesh()
81 auto nodeA = (elementS->GetNodeN(nodeOrder[myNodeN])); in writeMesh()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java210 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
211 int nodeCount = nodeOrder.nextOrderId; in encode()
240 writeOrderId(merge, nodeOrder); in encode()
249 writeOrderId(phi, nodeOrder); in encode()
254 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
258 writeOrderId(proxy, nodeOrder); in encode()
266 writeOrderId(invoke.callTarget(), nodeOrder); in encode() local
268 writeOrderId(invoke.next(), nodeOrder); in encode() local
286 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
403 writeOrderId(edge, nodeOrder);
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java222 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
223 int nodeCount = nodeOrder.nextOrderId; in encode()
252 writeOrderId(merge, nodeOrder); in encode()
261 writeOrderId(phi, nodeOrder); in encode()
266 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
270 writeOrderId(proxy, nodeOrder); in encode()
278 writeOrderId(invoke.callTarget(), nodeOrder); in encode() local
280 writeOrderId(invoke.next(), nodeOrder); in encode() local
298 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
416 writeOrderId(edge, nodeOrder);
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java210 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
211 int nodeCount = nodeOrder.nextOrderId; in encode()
240 writeOrderId(merge, nodeOrder); in encode()
249 writeOrderId(phi, nodeOrder); in encode()
254 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
258 writeOrderId(proxy, nodeOrder); in encode()
266 writeOrderId(invoke.callTarget(), nodeOrder); in encode() local
268 writeOrderId(invoke.next(), nodeOrder); in encode() local
286 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
403 writeOrderId(edge, nodeOrder);
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java210 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
211 int nodeCount = nodeOrder.nextOrderId; in encode()
240 writeOrderId(merge, nodeOrder); in encode()
249 writeOrderId(phi, nodeOrder); in encode()
254 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
258 writeOrderId(proxy, nodeOrder); in encode()
266 writeOrderId(invoke.callTarget(), nodeOrder); in encode() local
268 writeOrderId(invoke.next(), nodeOrder); in encode() local
286 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
403 writeOrderId(edge, nodeOrder);
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java222 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
223 int nodeCount = nodeOrder.nextOrderId; in encode()
252 writeOrderId(merge, nodeOrder); in encode()
261 writeOrderId(phi, nodeOrder); in encode()
266 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
270 writeOrderId(proxy, nodeOrder); in encode()
278 writeOrderId(invoke.callTarget(), nodeOrder); in encode() local
280 writeOrderId(invoke.next(), nodeOrder); in encode() local
298 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
416 writeOrderId(edge, nodeOrder);
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java230 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
231 int nodeCount = nodeOrder.nextOrderId; in encode()
260 writeOrderId(merge, nodeOrder); in encode()
269 writeOrderId(phi, nodeOrder); in encode()
274 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
278 writeOrderId(proxy, nodeOrder); in encode()
288 writeOrderId(invoke.next(), nodeOrder); in encode() local
306 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
424 writeOrderId(edge, nodeOrder);
437 writeOrderId(edge, nodeOrder);
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DGraphEncoder.java230 NodeOrder nodeOrder = new NodeOrder(graph); in encode() local
231 int nodeCount = nodeOrder.nextOrderId; in encode()
260 writeOrderId(merge, nodeOrder); in encode()
269 writeOrderId(phi, nodeOrder); in encode()
274 writeOrderId(exit.stateAfter(), nodeOrder); in encode() local
278 writeOrderId(proxy, nodeOrder); in encode()
288 writeOrderId(invoke.next(), nodeOrder); in encode() local
306 writer.putUV(nodeOrder.maxFixedNodeOrderId); in encode()
424 writeOrderId(edge, nodeOrder);
437 writeOrderId(edge, nodeOrder);
[all …]
/dports/math/ogdf/OGDF/include/ogdf/upward/internal/
H A DUpSAT.h73 bool testUpwardPlanarity(NodeArray<int> *nodeOrder = nullptr);
74 bool embedUpwardPlanar(adjEntry& externalToItsRight,NodeArray<int> *nodeOrder = nullptr);
91 bool OE(bool embed, adjEntry& externalToItsRight, NodeArray<int> *nodeOrder);
92 bool FPSS(NodeArray<int> *nodeOrder); // cannot embed
93 bool HL(bool embed, adjEntry& externalToItsRight, NodeArray<int> *nodeOrder);
94 void writeNodeOrder(const Minisat::Model &model, NodeArray<int> *nodeOrder);
/dports/math/ogdf/OGDF/src/ogdf/upward/
H A DMaximalFUPS.cpp82 NodeArray<int>* nodeOrder = nullptr; in doCall() local
83 if(!singleSource) nodeOrder = new NodeArray<int>(GC); in doCall()
84 if (!embedder.embedUpwardPlanar(externalToItsRight,nodeOrder)) in doCall()
89 if(n->indeg() == 0 && (*nodeOrder)[n]>0) { in doCall()
93 } while( (*nodeOrder)[adj->theNode()] >= (*nodeOrder)[n] ); in doCall()
97 delete nodeOrder; in doCall()
/dports/graphics/qgis-ltr/qgis-3.16.16/tests/src/python/
H A Dtest_qgslayertreeview.py58 def nodeOrder(self, group): member in TestQgsLayerTreeView
65 for child in self.nodeOrder(node.children()):
121 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
133 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
162 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
175 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
193 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
205 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
223 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
240 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/fdbserver/workloads/
H A DWatches.actor.cpp36 std::vector<int> nodeOrder; member
47 nodeOrder.push_back(i); in WatchesWorkload()
49 tempRand.randomShuffle( nodeOrder ); in WatchesWorkload()
95 …ack( self->watcherInit( cx, self->keyForIndex(self->nodeOrder[i]), self->keyForIndex(self->nodeOrd… in _setup()
101 …sh_back( self->watcher( cx, self->keyForIndex(self->nodeOrder[i]), self->keyForIndex(self->nodeOrd… in _setup()
170 state Key startKey = self->keyForIndex(self->nodeOrder[0]); in watchesWorker()
171 state Key endKey = self->keyForIndex(self->nodeOrder[self->nodes]); in watchesWorker()
/dports/graphics/qgis/qgis-3.22.3/tests/src/python/
H A Dtest_qgslayertreeview.py73 def nodeOrder(self, group): member in TestQgsLayerTreeView
80 for child in self.nodeOrder(node.children()):
150 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
162 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
199 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
212 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
233 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
245 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
266 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
283 self.assertEqual(self.nodeOrder(self.project.layerTreeRoot().children()), [
[all …]
/dports/math/ogdf/OGDF/src/ogdf/upward/internal/
H A DUpSAT.cpp394 bool UpSAT::HL(bool embed, adjEntry& externalToItsRight, NodeArray<int> *nodeOrder) in HL() argument
434 if (nodeOrder) { in HL()
435 writeNodeOrder(embModel,nodeOrder); in HL()
441 bool UpSAT::FPSS(NodeArray<int> *nodeOrder) in FPSS() argument
454 if(nodeOrder) writeNodeOrder(model,nodeOrder); in FPSS()
476 if (nodeOrder) { in OE()
477 writeNodeOrder(model, nodeOrder); in OE()
575 bool UpSAT::testUpwardPlanarity(NodeArray<int> *nodeOrder/* = NULL*/) { return FPSS(nodeOrder); } in testUpwardPlanarity() argument
576 …try& externalToItsRight, NodeArray<int> *nodeOrder/* = NULL*/) { return HL(true, externalToItsRi… in embedUpwardPlanar() argument
596 void UpSAT::writeNodeOrder(const Model &model, NodeArray<int> *nodeOrder) in writeNodeOrder() argument
[all …]
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/dpm/src/
H A Ddpm_model.cpp189 FileNode nodeOrder = fs["PartOrder"]; in deserialize() local
190 partOrder.resize(nodeOrder.size()); in deserialize()
191 for (unsigned int i = 0; i < nodeOrder.size(); i++) in deserialize()
192 nodeOrder[i] >> partOrder[i]; in deserialize()
/dports/science/chrono/chrono-7.0.1/src/chrono_vehicle/cosim/tire/
H A DChVehicleCosimTireNodeFlexible.cpp91 int nodeOrder[] = {0, 1, 2, 3}; in InitializeTire() local
95 auto node = element->GetNodeN(nodeOrder[in]); in InitializeTire()
/dports/multimedia/kodi/xbmc-19.3-Matrix/xbmc/playlists/
H A DSmartPlayList.cpp1434 TiXmlElement nodeOrder("order"); in Save() local
1435 …nodeOrder.SetAttribute("direction", m_orderDirection == SortOrderDescending ? "descending" : "asce… in Save()
1437 nodeOrder.SetAttribute("ignorefolders", "true"); in Save()
1438 nodeOrder.InsertEndChild(order); in Save()
1439 pRoot->InsertEndChild(nodeOrder); in Save()
/dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/src/FColladaPlugins/FArchiveXML/
H A DFArchiveXML.cpp545 enum nodeOrder { ANIMATION=0, ANIMATION_CLIP, IMAGE, EFFECT, MATERIAL, GEOMETRY, CONTROLLER, CAMERA… enum
546 struct xmlOrderedNode { xmlNode* node; nodeOrder order; };
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp14365 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
14366 const Uint32 noOfReplicas = extractNodeInfo(fragPtr.p, nodeOrder); in execDUMP_STATE_ORD()
14371 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp17400 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
17401 const Uint32 noOfReplicas = extractNodeInfo(fragPtr.p, nodeOrder); in execDUMP_STATE_ORD()
17406 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp17400 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
17401 const Uint32 noOfReplicas = extractNodeInfo(fragPtr.p, nodeOrder); in execDUMP_STATE_ORD()
17406 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp17400 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
17401 const Uint32 noOfReplicas = extractNodeInfo(fragPtr.p, nodeOrder); in execDUMP_STATE_ORD()
17406 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp17400 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
17401 const Uint32 noOfReplicas = extractNodeInfo(fragPtr.p, nodeOrder); in execDUMP_STATE_ORD()
17406 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()
/dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp17400 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
17401 const Uint32 noOfReplicas = extractNodeInfo(fragPtr.p, nodeOrder); in execDUMP_STATE_ORD()
17406 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/dbdih/
H A DDbdihMain.cpp23299 Uint32 nodeOrder[MAX_REPLICAS]; in execDUMP_STATE_ORD() local
23302 nodeOrder); in execDUMP_STATE_ORD()
23312 BaseString::snprintf(tmp, sizeof(tmp), "%d ", nodeOrder[k]); in execDUMP_STATE_ORD()

12