| /dports/games/dhewm3/dhewm3-1.5.1/neo/tools/compilers/aas/ |
| H A D | AASFile_optimize.cpp | 54 idList<aasEdge_t> newEdges; in Optimize() local
64 newEdges.Resize( edges.Num() ); in Optimize()
65 newEdges.SetNum( 1, false ); in Optimize()
100 edgeRemap[ abs(edgeNum) ] = -newEdges.Num(); in Optimize()
103 edgeRemap[ abs(edgeNum) ] = newEdges.Num(); in Optimize()
116 newEdges.Append( *edge ); in Optimize()
117 newEdges[ newEdges.Num()-1 ].vertexNum[0] = vertexRemap[ edge->vertexNum[0] ]; in Optimize()
118 newEdges[ newEdges.Num()-1 ].vertexNum[1] = vertexRemap[ edge->vertexNum[1] ]; in Optimize()
147 edges = newEdges; in Optimize()
|
| /dports/cad/sumo/sumo-1.2.0/src/router/ |
| H A D | RORouteDef.cpp | 119 ConstROEdgeVector newEdges; in preComputeCurrentRoute() local
121 if (myAlternatives[0]->getEdgeVector() != newEdges) { in preComputeCurrentRoute()
175 newEdges = oldEdges; in repairCurrentRoute()
221 newEdges.push_back(*(targets.begin())); in repairCurrentRoute()
227 newEdges.push_back(*i); in repairCurrentRoute()
233 const ROEdge* const last = newEdges.back(); in repairCurrentRoute()
234 newEdges.pop_back(); in repairCurrentRoute()
235 if (!router.compute(last, *i, &veh, begin, newEdges)) { in repairCurrentRoute()
242 …if (lastMandatory >= (int)newEdges.size() || last == newEdges[lastMandatory] || !router.compute(ne… in repairCurrentRoute()
249 newEdges.erase(newEdges.begin() + lastMandatory + 1, newEdges.end()); in repairCurrentRoute()
[all …]
|
| /dports/devel/spark/spark-2.1.1/graphx/src/main/scala/org/apache/spark/graphx/impl/ |
| H A D | ReplicatedVertexView.scala | 52 val newEdges = edges.mapEdgePartitions((pid, part) => part.reverse) constant
53 new ReplicatedVertexView(newEdges, hasDstId, hasSrcId)
70 val newEdges = edges.withPartitionsRDD(edges.partitionsRDD.zipPartitions(shippedVerts) { constant
76 edges = newEdges
92 val newEdges = edges.withPartitionsRDD(edges.partitionsRDD.zipPartitions(shippedActives) { constant
98 new ReplicatedVertexView(newEdges, hasSrcId, hasDstId)
112 val newEdges = edges.withPartitionsRDD(edges.partitionsRDD.zipPartitions(shippedVerts) { constant
118 new ReplicatedVertexView(newEdges, hasSrcId, hasDstId)
|
| H A D | GraphImpl.scala | 101 val newEdges = edges.withPartitionsRDD(edges.map { e => constant
115 GraphImpl.fromExistingRDDs(vertices.withEdges(newEdges), newEdges)
142 val newEdges = replicatedVertexView.edges constant
144 new GraphImpl(vertices, replicatedVertexView.withEdges(newEdges))
155 new GraphImpl(vertices, replicatedVertexView.withEdges(newEdges))
167 val newEdges = replicatedVertexView.edges.filter(epred, vpred) constant
168 new GraphImpl(newVerts, replicatedVertexView.withEdges(newEdges))
175 new GraphImpl(newVerts, replicatedVertexView.withEdges(newEdges))
179 val newEdges = replicatedVertexView.edges.mapEdgePartitions( constant
331 val newEdges = edges.asInstanceOf[EdgeRDDImpl[ED, _]] constant
[all …]
|
| /dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | TransClos.hs | 14 tc g = newEdges `insEdges` insNodes ln empty
17 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen (outU g u) g ] function
26 trc g = newEdges `insEdges` insNodes ln empty
29 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen [(u, u)] g ] function
37 rc g = newEdges `insEdges` insNodes ln empty
40 newEdges = [ (u, u, ()) | (u, _) <- ln ] function
|
| /dports/finance/hs-hledger/hledger-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | TransClos.hs | 14 tc g = newEdges `insEdges` insNodes ln empty
17 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen (outU g u) g ] function
26 trc g = newEdges `insEdges` insNodes ln empty
29 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen [(u, u)] g ] function
37 rc g = newEdges `insEdges` insNodes ln empty
40 newEdges = [ (u, u, ()) | (u, _) <- ln ] function
|
| /dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | TransClos.hs | 14 tc g = newEdges `insEdges` insNodes ln empty
17 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen (outU g u) g ] function
26 trc g = newEdges `insEdges` insNodes ln empty
29 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen [(u, u)] g ] function
37 rc g = newEdges `insEdges` insNodes ln empty
40 newEdges = [ (u, u, ()) | (u, _) <- ln ] function
|
| /dports/devel/hs-spago/spago-0.20.3/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | TransClos.hs | 14 tc g = newEdges `insEdges` insNodes ln empty
17 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen (outU g u) g ] function
26 trc g = newEdges `insEdges` insNodes ln empty
29 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen [(u, u)] g ] function
37 rc g = newEdges `insEdges` insNodes ln empty
40 newEdges = [ (u, u, ()) | (u, _) <- ln ] function
|
| /dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | TransClos.hs | 14 tc g = newEdges `insEdges` insNodes ln empty
17 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen (outU g u) g ] function
26 trc g = newEdges `insEdges` insNodes ln empty
29 newEdges = [ (u, v, ()) | (u, _) <- ln, (_, v) <- bfen [(u, u)] g ] function
37 rc g = newEdges `insEdges` insNodes ln empty
40 newEdges = [ (u, u, ()) | (u, _) <- ln ] function
|
| /dports/math/ogdf/OGDF/src/ogdf/basic/ |
| H A D | extended_graph_alg.cpp | 161 List<NodePair>& newEdges) in recursiveConnect() argument
167 recursiveConnect(CG, child, origCluster, oCcluster, origNode, G, newEdges); in recursiveConnect()
216 newEdges.pushBack(np); in recursiveConnect()
325 List<NodePair>& newEdges) in recursiveCConnect() argument
388 newEdges.pushBack(np); in recursiveCConnect()
406 List<NodePair>& newEdges) in cconnect() argument
447 newEdges); // inserted edges in cconnect()
475 List<NodePair> newEdges; //edges to be inserted in makeCConnected() local
480 cconnect(cCopy, origCluster, oCcluster, origNode, G, newEdges); in makeCConnected()
483 origNode, G, newEdges); in makeCConnected()
[all …]
|
| /dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/ |
| H A D | ProperCycle.cpp | 179 void ProperCycle::replaceEdges(KeyEdge * oldEdge, const KeyEdgeList & newEdges) in replaceEdges() argument
190 for(int i=0; i<newEdges.size(); ++i) in replaceEdges()
191 newHalfedges << KeyHalfedge(newEdges[i], he.side); in replaceEdges()
195 for(int i=newEdges.size()-1; i>=0; --i) in replaceEdges()
196 newHalfedges << KeyHalfedge(newEdges[i], he.side); in replaceEdges()
|
| H A D | ProperPath.cpp | 193 void ProperPath::replaceEdges(KeyEdge * oldEdge, const KeyEdgeList & newEdges) in replaceEdges() argument
204 for(int i=0; i<newEdges.size(); ++i) in replaceEdges()
205 newHalfedges << KeyHalfedge(newEdges[i], he.side); in replaceEdges()
209 for(int i=newEdges.size()-1; i>=0; --i) in replaceEdges()
210 newHalfedges << KeyHalfedge(newEdges[i], he.side); in replaceEdges()
|
| /dports/graphics/qvge/qvge-0.6.3/src/commonui/ |
| H A D | CNodeEdgePropertiesUI.h | 99 QList<CItem*> newEdges; in changeEdgesClass() local
106 newEdges << e; in changeEdgesClass()
109 if (newEdges.size()) in changeEdgesClass()
113 m_scene->selectItems(newEdges, false); in changeEdgesClass()
|
| /dports/math/g2o/g2o-20201223_git/g2o/examples/interactive_slam/g2o_interactive/ |
| H A D | graph_optimizer_sparse_online.cpp | 68 slamDimension(3), newEdges(0), batchStep(true), vizWithGnuplot(false), in SparseOptimizerOnline()
129 for (HyperGraph::EdgeSet::iterator it = newEdges->begin(); it != newEdges->end(); ++it) { in optimize()
134 for (HyperGraph::EdgeSet::iterator it = newEdges->begin(); it != newEdges->end(); ++it) { in optimize()
186 newEdges = &eset; in updateInitialization()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/gnu/java/awt/font/autofit/ |
| H A D | AxisHints.java | 80 Edge[] newEdges = new Edge[newMax]; in newEdge() local
81 System.arraycopy(edges, 0, newEdges, 0, numEdges); in newEdge()
82 edges = newEdges; in newEdge()
|
| /dports/lang/gcc48/gcc-4.8.5/libjava/classpath/gnu/java/awt/font/autofit/ |
| H A D | AxisHints.java | 80 Edge[] newEdges = new Edge[newMax]; in newEdge() local
81 System.arraycopy(edges, 0, newEdges, 0, numEdges); in newEdge()
82 edges = newEdges; in newEdge()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/gnu/java/awt/font/autofit/ |
| H A D | AxisHints.java | 80 Edge[] newEdges = new Edge[newMax]; in newEdge() local
81 System.arraycopy(edges, 0, newEdges, 0, numEdges); in newEdge()
82 edges = newEdges; in newEdge()
|
| /dports/lang/gnat_util/gcc-6-20180516/libjava/classpath/gnu/java/awt/font/autofit/ |
| H A D | AxisHints.java | 80 Edge[] newEdges = new Edge[newMax]; in newEdge() local
81 System.arraycopy(edges, 0, newEdges, 0, numEdges); in newEdge()
82 edges = newEdges; in newEdge()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/libjava/classpath/gnu/java/awt/font/autofit/ |
| H A D | AxisHints.java | 80 Edge[] newEdges = new Edge[newMax]; in newEdge() local
81 System.arraycopy(edges, 0, newEdges, 0, numEdges); in newEdge()
82 edges = newEdges; in newEdge()
|
| /dports/math/rocs/rocs-21.12.3/libgraphtheory/editorplugins/transformedges/ |
| H A D | transformedgeswidget.cpp | 95 QList< QPair< NodePtr, NodePtr > > newEdges; in reverseAllEdges() local
98 newEdges << QPair< NodePtr, NodePtr >(e->to(), e->from()); in reverseAllEdges()
102 for (int i = 0; i < newEdges.count(); ++i) { in reverseAllEdges()
103 EdgePtr edge = Edge::create(newEdges[i].first, newEdges[i].second); in reverseAllEdges()
|
| /dports/lang/gcc48/gcc-4.8.5/libjava/classpath/gnu/java/awt/java2d/ |
| H A D | ActiveEdges.java | 92 PolyEdge[] newEdges = new PolyEdge[newSize]; in add() local
93 System.arraycopy(activeEdges, 0, newEdges, 0, oldSize); in add()
94 activeEdges = newEdges; in add()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/gnu/java/awt/java2d/ |
| H A D | ActiveEdges.java | 92 PolyEdge[] newEdges = new PolyEdge[newSize]; in add() local
93 System.arraycopy(activeEdges, 0, newEdges, 0, oldSize); in add()
94 activeEdges = newEdges; in add()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/gnu/java/awt/java2d/ |
| H A D | ActiveEdges.java | 92 PolyEdge[] newEdges = new PolyEdge[newSize]; in add() local
93 System.arraycopy(activeEdges, 0, newEdges, 0, oldSize); in add()
94 activeEdges = newEdges; in add()
|
| /dports/lang/gnat_util/gcc-6-20180516/libjava/classpath/gnu/java/awt/java2d/ |
| H A D | ActiveEdges.java | 92 PolyEdge[] newEdges = new PolyEdge[newSize]; in add() local
93 System.arraycopy(activeEdges, 0, newEdges, 0, oldSize); in add()
94 activeEdges = newEdges; in add()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/libjava/classpath/gnu/java/awt/java2d/ |
| H A D | ActiveEdges.java | 92 PolyEdge[] newEdges = new PolyEdge[newSize]; in add() local
93 System.arraycopy(activeEdges, 0, newEdges, 0, oldSize); in add()
94 activeEdges = newEdges; in add()
|