Home
last modified time | relevance | path

Searched refs:getEdge (Results 226 – 250 of 1103) sorted by relevance

12345678910>>...45

/dports/lang/erlang-java/otp-OTP-24.1.7/lib/wx/src/gen/
H A DwxSashEvent.erl23 -export([getDragRect/1,getDragStatus/1,getEdge/1]).
42 -spec getEdge(This) -> wx:wx_enum() when
44 getEdge(#wx_ref{type=ThisT}=This) -> function
/dports/lang/erlang/otp-OTP-24.1.7/lib/wx/src/gen/
H A DwxSashEvent.erl23 -export([getDragRect/1,getDragStatus/1,getEdge/1]).
42 -spec getEdge(This) -> wx:wx_enum() when
44 getEdge(#wx_ref{type=ThisT}=This) -> function
/dports/cad/sumo/sumo-1.2.0/tools/route/
H A Droute2poly.py108 lanes.append(net.getEdge(e).getLane(0))
119 edge = lane.getEdge()
121 cons = edge.getConnections(lanes[i + 1].getEdge())
127 cons = lanes[i - 1].getEdge().getConnections(edge)
133 cons2 = via.getEdge().getConnections(edge)
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/docker/docker/moby-20.10.2/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/databases/timescaledb-backup/timescaledb-backup-0.1.1/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/net-mgmt/prometheus2/prometheus-2.30.3/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/docker/docker/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/sysutils/docker/docker-ce-18.09.5/components/engine/vendor/github.com/hashicorp/go-immutable-radix/
H A Dnode.go71 func (n *Node) getEdge(label byte) (int, *Node) { func
107 _, n = n.getEdge(search[0])
147 _, n = n.getEdge(search[0])
226 _, n = n.getEdge(search[0])
263 _, n = n.getEdge(search[0])
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/Analysis/
H A DProfileVerifierPass.cpp102 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB); in printDebugInfo()
117 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi); in printDebugInfo()
248 DI.inWeight += ReadOrAssert(PI->getEdge(0,BB)); in recurseBasicBlock()
253 DI.inWeight += ReadOrAssert(PI->getEdge(*bpi,BB)); in recurseBasicBlock()
264 double w = PI->getEdgeWeight(PI->getEdge(BB,0)); in recurseBasicBlock()
271 DI.outWeight += ReadOrAssert(PI->getEdge(BB,*bbi)); in recurseBasicBlock()
/dports/math/py-apgl/apgl-0.8.1/apgl/graph/
H A DAbstractSingleGraph.py85 def getEdge(self, vertexIndex1, vertexIndex2): member in AbstractSingleGraph
172 edgeVal = self.getEdge(allEdges[i, 0], allEdges[i, 1])
217 return self.getEdge(vertexIndex1, vertexIndex2)
260 newGraph.es[i]["value"] = self.getEdge(allEdges[i, 0], allEdges[i, 1])
/dports/cad/sumo/sumo-1.2.0/tools/tls/
H A Dtls_csv2SUMO.py167 if link[0] != li.getEdge().getID():
176 if link[1] != lo.getEdge().getID():
194 nodes.add(lane[0].getEdge()._to)
249 node1 = link1[0].getEdge()._to
250 node2 = link2[0].getEdge()._to
/dports/graphics/geos/geos-3.9.1/include/geos/operation/buffer/
H A DRightmostEdgeFinder.h80 geomgraph::DirectedEdge* getEdge();
90 RightmostEdgeFinder::getEdge() in getEdge() function
/dports/cad/sumo/sumo-1.2.0/src/microsim/traffic_lights/
H A DMSRailSignal.cpp154 if (forward->getEdge().getBidiEdge() != nullptr) { in init()
208 if (in->getEdge().getBidiEdge() != nullptr in init()
416 const MSEdge& firstBidi = myRouteConflictLanes[index][clIndex].front()->getEdge(); in hasLinkConflict()
425 …<< " closestVeh=" << closest->getID() << " route edge " << cLane->getEdge().getID() << " blocked\n… in hasLinkConflict()
611 if (toLane != nullptr && !foundSwitch && prev->getEdge().getBidiEdge() != nullptr) { in collectBidiBlock()
618 if (link->getViaLaneOrLane()->getEdge().getBidiEdge() != &toLane->getEdge()) { in collectBidiBlock()
718 const MSJunction* cLinkJunction = cLink->getLaneBefore()->getEdge().getToJunction(); in hasAlternativeTrackBetween()
720 if (forwardBlock.back()->getEdge().getToJunction() == cLinkJunction) { in hasAlternativeTrackBetween()
/dports/cad/gmsh/gmsh-4.9.2-source/Geo/
H A DGEdgeLoop.cpp68 if(ge != thisOne->getEdge()) { in nextOne()
90 if(it->getEdge() == ge) count++; in count()
103 for(auto it = begin(); it != end(); ++it) { edges.push_back(it->getEdge()); } in getEdges()
127 if(!ges.getEdge()) { // oops in loopTheLoop()
H A DMLine.h56 virtual MEdge getEdge(int num) const { return MEdge(_v[0], _v[1]); } in getEdge() function
290 return le(l1->getEdge(0), l2->getEdge(0)); in operator()
298 return le(l1->getEdge(0), l2->getEdge(0)); in operator()
/dports/cad/sumo/sumo-1.2.0/src/microsim/
H A DMSStoppingPlace.cpp223 if (edge == &myLane.getEdge()) { in getAccessPos()
227 if (edge == &std::get<0>(access)->getEdge()) { in getAccessPos()
237 if (edge == &myLane.getEdge()) { in getAccessDistance()
242 if (edge == &accLane->getEdge()) { in getAccessDistance()
H A DMSLinkCont.cpp39 if (&link->getLane()->getEdge() == followerAfterInternal) { in getInternalFollowingEdge()
41 return &link->getViaLane()->getEdge(); in getInternalFollowingEdge()
/dports/cad/sumo/sumo-1.2.0/src/router/
H A DRORouteHandler.cpp124 const ROEdge* toTaz = myNet.getEdge(myVehicleParameter->toTaz + "-sink"); in parseFromViaTo()
168 from = myNet.getEdge(fromID); in myStartElement()
183 to = myNet.getEdge(toID); in myStartElement()
680 edge = myNet.getEdge(stop.lane.substr(0, stop.lane.rfind('_'))); in addStop()
691 edge = myNet.getEdge(stop.lane.substr(0, stop.lane.rfind('_'))); in addStop()
702 edge = myNet.getEdge(stop.lane.substr(0, stop.lane.rfind('_'))); in addStop()
710 edge = myNet.getEdge(stop.lane.substr(0, stop.lane.rfind('_'))); in addStop()
774 const ROEdge* edge = myNet.getEdge(id); in parseEdges()
828 const ROEdge* bestEdge = &best->getEdge(); in parseGeoEdges()
854 const ROEdge* to = myNet.getEdge(toID); in addPersonTrip()
[all …]
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/ball/src/source/STRUCTURE/
H A DSESFace.cpp212 if (getEdge(p1,edge2->vertex_[0],edge1)) in normalizeNonSingularToricFace_()
219 getEdge(p1,edge2->vertex_[1],edge1); // | | in normalizeNonSingularToricFace_()
223 getEdge(p0,p3,edge3); // p1 e1 p2 in normalizeNonSingularToricFace_()
237 getEdge(p1,p2,edge1); in normalizeNonSingularToricFace_()
238 getEdge(p0,p3,edge3); in normalizeNonSingularToricFace_()
/dports/cad/sumo/sumo-1.2.0/tools/sumolib/net/
H A D__init__.py70 edges.add(c[0].getEdge())
231 viaEdge = viaLane.getEdge()
250 def getEdge(self, id): member in Net
255 return self.getEdge(edge_id).getLane(int(lane_index))
590 self._currentEdge = self._net.getEdge(attrs['edge'])
599 connected = self._net.getEdge(lid[:lid.rfind('_')])
605 toEdge = self._net.getEdge(lid[:lid.rfind('_')])
613 toEdge = self._net.getEdge(lid[:lid.rfind('_')])
624 fromEdge = self._net.getEdge(fromEdgeID)
625 toEdge = self._net.getEdge(toEdgeID)
[all …]
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/storage/
H A Dgridbase.h128 virtual const CELL& getEdge() const = 0;
149 if (getEdge() != other.getEdge()) {

12345678910>>...45