Home
last modified time | relevance | path

Searched refs:getEdge (Results 1 – 25 of 1103) sorted by relevance

12345678910>>...45

/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/livarot/
H A DShape.cpp1284 if (getEdge(getEdge(a).prevS).st == getEdge(a).st) in SwapEdges()
1295 if (getEdge(getEdge(a).nextS).st == getEdge(a).st) in SwapEdges()
1306 if (getEdge(getEdge(a).prevE).st == getEdge(a).en) in SwapEdges()
1317 if (getEdge(getEdge(a).nextE).st == getEdge(a).en) in SwapEdges()
1344 if (getEdge(getEdge(b).prevS).st == getEdge(b).st) in SwapEdges()
1355 if (getEdge(getEdge(b).nextS).st == getEdge(b).st) in SwapEdges()
1366 if (getEdge(getEdge(b).prevE).st == getEdge(b).en) in SwapEdges()
1377 if (getEdge(getEdge(b).nextE).st == getEdge(b).en) in SwapEdges()
1923 if (getEdge(getEdge(b).prevS).st == getEdge(b).st) in DisconnectStart()
1934 if (getEdge(getEdge(b).nextS).st == getEdge(b).st) in DisconnectStart()
[all …]
H A Dsweep-tree.cpp54 if (src->getEdge(bord).st < src->getEdge(bord).en) { in ConvertTo()
94 bOrig = src->pData[src->getEdge(bord).st].rx; in Find()
96 if (src->getEdge(bord).st > src->getEdge(bord).en) { in Find()
180 bOrig = src->pData[src->getEdge(bord).st].rx; in Find()
182 if (src->getEdge(bord).st > src->getEdge(bord).en) in Find()
337 nNorm = src->getEdge(bord).dx; in InsertAt()
338 if (src->getEdge(bord).st > src->getEdge(bord).en) in InsertAt()
349 if (insNode->src->getEdge(insNode->bord).st > in InsertAt()
350 insNode->src->getEdge(insNode->bord).en) in InsertAt()
392 insertL->src->getEdge(insertL->bord).en) in InsertAt()
[all …]
H A DShapeMisc.cpp61 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx; in ConvertToForme()
118 int cPt = getEdge(curBord).en; in ConvertToForme()
211 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx; in ConvertToForme()
259 int cPt = getEdge(curBord).en; in ConvertToForme()
306 curStartPt=getEdge(nb).st; in ConvertToForme()
364 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx; in ConvertToFormeNested()
430 int cPt = getEdge(curBord).en; in ConvertToFormeNested()
495 curStartPt=getEdge(nb).st; in ConvertToFormeNested()
604 Geom::Point seD = a->getEdge(i).dx; in MakeTweak()
796 Geom::Point seD = a->getEdge(i).dx; in MakeOffset()
[all …]
H A DShapeSweep.cpp366 || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en in ConvertToShape()
374 || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en in ConvertToShape()
399 if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en in ConvertToShape()
533 if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en in ConvertToShape()
1172 || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en in Booleen()
1180 || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en in Booleen()
1480 if ( getEdge(i).en >= getEdge(i).st ) { in Booleen()
2017 if (getEdge(askTo).st < getEdge(askTo).en) in Winding()
2191 if ((getEdge(cb).st == getEdge(cc).st && getEdge(cb).en == getEdge(cc).en) in AssembleAretes()
2192 || (getEdge(cb).st == getEdge(cc).en && getEdge(cb).en == getEdge(cc).en)) doublon=true; in AssembleAretes()
[all …]
H A DShape.h160 if (getEdge(b).st == p) { in Other()
161 return getEdge(b).en; in Other()
163 return getEdge(b).st; in Other()
169 if (p == getEdge(b).st) { in NextAt()
170 return getEdge(b).nextS; in NextAt()
173 return getEdge(b).nextE; in NextAt()
182 if (p == getEdge(b).st) { in PrevAt()
183 return getEdge(b).prevS; in PrevAt()
186 return getEdge(b).prevE; in PrevAt()
195 if (p == getEdge(b).st) { in CycleNextAt()
[all …]
/dports/graphics/krita/krita-4.4.8/plugins/flake/textshape/textlayout/
H A DKoTextLayoutCellHelper.cpp154 QPen pen = m_cellStyle.getEdge(KoBorder::TopBorder).innerPen; in paintBorders()
166 QPen pen = m_cellStyle.getEdge(KoBorder::LeftBorder).innerPen; in paintBorders()
217 QPen pen = m_cellStyle.getEdge(KoBorder::TopBorder).outerPen; in drawTopHorizontalBorder()
234 QPen pen = m_cellStyle.getEdge(KoBorder::TopBorder).innerPen; in drawTopHorizontalBorder()
259 …= m_cellStyle.getEdge(KoBorder::BottomBorder).outerPen.widthF() + m_cellStyle.getEdge(KoBorder::Bo… in drawSharedHorizontalBorder()
260 …qreal thatWidth = styleBelow.getEdge(KoBorder::TopBorder).outerPen.widthF() + styleBelow.getEdge(K… in drawSharedHorizontalBorder()
266 …order::BorderData &edge = paintThis ? m_cellStyle.getEdge(KoBorder::BottomBorder) : styleBelow.get… in drawSharedHorizontalBorder()
331 …h = m_cellStyle.getEdge(KoBorder::LeftBorder).outerPen.widthF() + m_cellStyle.getEdge(KoBorder::Le… in drawLeftmostVerticalBorder()
367 … = m_cellStyle.getEdge(KoBorder::RightBorder).outerPen.widthF() + m_cellStyle.getEdge(KoBorder::Ri… in drawSharedVerticalBorder()
368 …qreal thatWidth = styleRight.getEdge(KoBorder::LeftBorder).outerPen.widthF() + styleRight.getEdge(… in drawSharedVerticalBorder()
[all …]
/dports/editors/calligra/calligra-3.2.1/libs/textlayout/
H A DKoTextLayoutCellHelper.cpp154 QPen pen = m_cellStyle.getEdge(KoBorder::TopBorder).innerPen; in paintBorders()
166 QPen pen = m_cellStyle.getEdge(KoBorder::LeftBorder).innerPen; in paintBorders()
217 QPen pen = m_cellStyle.getEdge(KoBorder::TopBorder).outerPen; in drawTopHorizontalBorder()
234 QPen pen = m_cellStyle.getEdge(KoBorder::TopBorder).innerPen; in drawTopHorizontalBorder()
259 …= m_cellStyle.getEdge(KoBorder::BottomBorder).outerPen.widthF() + m_cellStyle.getEdge(KoBorder::Bo… in drawSharedHorizontalBorder()
260 …qreal thatWidth = styleBelow.getEdge(KoBorder::TopBorder).outerPen.widthF() + styleBelow.getEdge(K… in drawSharedHorizontalBorder()
266 …order::BorderData &edge = paintThis ? m_cellStyle.getEdge(KoBorder::BottomBorder) : styleBelow.get… in drawSharedHorizontalBorder()
331 …h = m_cellStyle.getEdge(KoBorder::LeftBorder).outerPen.widthF() + m_cellStyle.getEdge(KoBorder::Le… in drawLeftmostVerticalBorder()
367 … = m_cellStyle.getEdge(KoBorder::RightBorder).outerPen.widthF() + m_cellStyle.getEdge(KoBorder::Ri… in drawSharedVerticalBorder()
368 …qreal thatWidth = styleRight.getEdge(KoBorder::LeftBorder).outerPen.widthF() + styleRight.getEdge(… in drawSharedVerticalBorder()
[all …]
/dports/cad/sumo/sumo-1.2.0/src/utils/router/
H A DCarEdge.h63 …> classedCarFollowers = std::set<const E*>(this->getEdge()->getSuccessors(vClass).begin(), this->g…
65 …if (!e->includeInRoute(false) || e->getEdge() == this->getEdge() || classedCarFollowers.count(e->g…
86 …std::set<std::pair<const E*, const E*> >(this->getEdge()->getViaSuccessors(vClass).begin(), this->…
88 …const auto viaPair = std::make_pair(e.first->getEdge(), e.second == nullptr ? nullptr : e.second->…
89 …if (!e.first->includeInRoute(false) || e.first->getEdge() == this->getEdge() || classedCarFollower…
98 return trip->vehicle == 0 || this->getEdge()->prohibits(trip->vehicle); in prohibits()
102 const double travelTime = E::getTravelTimeStatic(this->getEdge(), trip->vehicle, time); in getTravelTime()
105 if (this->getEdge() == trip->to) { in getTravelTime()
108 if (this->getEdge() == trip->from) { in getTravelTime()
111 return travelTime * distTravelled / this->getEdge()->getLength(); in getTravelTime()
H A DPedestrianEdge.h47 …return allEdges || (!this->getEdge()->isCrossing() && !this->getEdge()->isWalkingArea() && !this->… in includeInRoute()
56 return (this->getEdge()->getFromJunction() != trip->node in prohibits()
57 && this->getEdge()->getToJunction() != trip->node); in prohibits()
63 if (this->getEdge() == trip->from && !myForward && trip->departPos < myStartPos) { in getTravelTime()
66 …if (this->getEdge() == trip->to && myForward && trip->arrivalPos < myStartPos + this->getLength())… in getTravelTime()
69 if (this->getEdge() == trip->from && myForward && trip->departPos > myStartPos) { in getTravelTime()
72 …if (this->getEdge() == trip->to && !myForward && trip->arrivalPos > myStartPos - this->getLength()… in getTravelTime()
79 if (this->getEdge()->isCrossing() && myLane->getIncomingLinkState() == LINKSTATE_TL_RED) { in getTravelTime()
/dports/cad/sumo/sumo-1.2.0/src/libsumo/
H A DEdge.cpp57 const MSEdge* e = getEdge(id); in getAdaptedTraveltime()
68 const MSEdge* e = getEdge(id); in getEffort()
79 return getEdge(id)->getCurrentTravelTime(); in getTraveltime()
84 Edge::getEdge(const std::string& id) { in getEdge() function in libsumo::Edge
96 for (MSLane* lane : getEdge(id)->getLanes()) { in getWaitingTime()
224 return getEdge(id)->getMeanSpeed(); in getLastStepMeanSpeed()
276 return (int)getEdge(id)->getLanes().size(); in getLaneNumber()
282 return getEdge(id)->getStreetName(); in getStreetName()
308 MSEdge* e = getEdge(id); in setAllowedSVCPermissions()
341 getEdge(id)->setParameter(name, value); in setParameter()
[all …]
/dports/math/py-apgl/apgl-0.8.1/apgl/graph/test/
H A DDictGraphTest.py411 self.assertEquals(graph.getEdge(1, 2), 1)
412 self.assertEquals(graph.getEdge(5, 2), 1)
413 self.assertEquals(graph.getEdge(2, 1), 1)
414 self.assertEquals(graph.getEdge(8, 8), 1)
418 self.assertEquals(graph.getEdge(1, 2), 2)
419 self.assertEquals(graph.getEdge(5, 2), 3)
420 self.assertEquals(graph.getEdge(2, 1), 2)
421 self.assertEquals(graph.getEdge(8, 8), 4)
427 self.assertEquals(graph.getEdge(1, 2), 1)
428 self.assertEquals(graph.getEdge(5, 2), 1)
[all …]
H A DMatrixGraphTest.py59 self.assertEquals(graph.getEdge(1, 2), 1)
60 self.assertEquals(graph.getEdge(3, 2), 1)
61 self.assertEquals(graph.getEdge(2, 3), 1)
62 self.assertEquals(graph.getEdge(2, 1), 1)
69 self.assertEquals(graph.getEdge(1, 2), 1)
70 self.assertEquals(graph.getEdge(2, 3), 1)
74 self.assertEquals(graph.getEdge(1, 2), 0.1)
75 self.assertEquals(graph.getEdge(2, 3), 0.2)
79 self.assertEquals(graph.getEdge(1, 2), 0.1)
1519 self.assertEquals(graph.getEdge(i, j), graph2.getEdge(i, j))
[all …]
H A DSparseMultiGraphTest.py33 self.assertEquals(self.sMultiGraph.getEdge(0, 1, 0), 5)
34 self.assertEquals(self.sMultiGraph.getEdge(0, 1, 1), 2)
35 self.assertEquals(self.sMultiGraph.getEdge(5, 3, 2), 12)
36 self.assertEquals(self.sMultiGraph.getEdge(5, 3, 1), None)
37 self.assertEquals(self.sMultiGraph.getEdge(8, 2, 1), None)
51 self.assertEquals(self.sMultiGraph.getEdge(2, 1, 0), 5)
52 self.assertEquals(self.sMultiGraph.getEdge(2, 1, 1), 2)
53 self.assertEquals(self.sMultiGraph.getEdge(6, 1, 1), 21)
58 self.assertEquals(self.sMultiGraph.getEdge(2, 1, 0), None)
59 self.assertEquals(self.sMultiGraph.getEdge(2, 1, 1), None)
[all …]
/dports/devel/simgear/simgear-2020.3.11/simgear/math/
H A DSGIntersect.hxx552 T a = dot(tri.getEdge(0), tri.getEdge(0)); in closestPoint()
553 T b = dot(tri.getEdge(0), tri.getEdge(1)); in closestPoint()
554 T c = dot(tri.getEdge(1), tri.getEdge(1)); in closestPoint()
555 T d = dot(tri.getEdge(0), off); in closestPoint()
643 return tri.getBaseVertex() + u*tri.getEdge(0) + v*tri.getEdge(1); in closestPoint()
661 return tri.getBaseVertex() + u*tri.getEdge(0) + v*tri.getEdge(1); in closestPoint()
692 return tri.getBaseVertex() + u*tri.getEdge(0) + v*tri.getEdge(1); in closestPoint()
725 return tri.getBaseVertex() + u*tri.getEdge(0) + v*tri.getEdge(1); in closestPoint()
748 T a = dot(tri.getEdge(0), tri.getEdge(0)); in intersects()
749 T b = dot(tri.getEdge(0), tri.getEdge(1)); in intersects()
[all …]
/dports/science/devisor/devisor2.1/devisor2/foundation/elements/
H A DCell2D.java133 Node a1 = getEdge(0).getNode(0); in updateCellNodes()
134 Node a2 = getEdge(0).getNode(1); in updateCellNodes()
136 Node b1 = getEdge(1).getNode(0); in updateCellNodes()
137 Node b2 = getEdge(1).getNode(1); in updateCellNodes()
151 Node a1 = getEdge(0).getNode(0); in updateCellNodes()
152 Node a2 = getEdge(0).getNode(1); in updateCellNodes()
154 Node b1 = getEdge(3).getNode(0); in updateCellNodes()
155 Node b2 = getEdge(3).getNode(1); in updateCellNodes()
184 Node c1 = getEdge(1).getNode(0); in updateCellNodes()
185 Node c2 = getEdge(1).getNode(1); in updateCellNodes()
[all …]
/dports/graphics/opencv/opencv-4.5.3/modules/imgproc/src/
H A Dsubdivision2d.cpp191 splice(edge, getEdge(edgeA, NEXT_AROUND_LEFT)); in connectEdges()
201 int a = getEdge(edge, PREV_AROUND_ORG); in swapEdges()
202 int b = getEdge(sedge, PREV_AROUND_ORG); in swapEdges()
209 splice(edge, getEdge(a, NEXT_AROUND_LEFT)); in swapEdges()
210 splice(sedge, getEdge(b, NEXT_AROUND_LEFT)); in swapEdges()
244 splice( edge, getEdge(edge, PREV_AROUND_ORG) ); in deleteEdge()
748 edge = getEdge(edge, NEXT_AROUND_LEFT); in getLeadingEdgeList()
750 edge = getEdge(edge, NEXT_AROUND_LEFT); in getLeadingEdgeList()
816 t = getEdge( t, NEXT_AROUND_LEFT ); in getVoronoiFacetList()
855 … CV_Assert( getEdge(getEdge(getEdge(e,NEXT_AROUND_LEFT),NEXT_AROUND_LEFT),NEXT_AROUND_LEFT) == e ); in checkSubdiv()
[all …]
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/Analysis/
H A DProfileInfo.cpp74 Edge e = getEdge(0, BB); in getExecutionCount()
101 Edge e = getEdge(BB,0); in getExecutionCount()
259 Edge e = getEdge(BB,*Succ); in GetPath()
299 Edge e = getEdge(Parent,BB); in divertFlow()
515 Edge e = getEdge(0,BB); in CalculateMissingEdge()
520 Edge e = getEdge(*bbi,BB); in CalculateMissingEdge()
529 Edge e = getEdge(BB,0); in CalculateMissingEdge()
541 Edge e = getEdge(BB,*sbbi); in CalculateMissingEdge()
682 Edge e = getEdge(BB,0); in repair()
866 Edge e = getEdge(BB,BB); in repair()
[all …]
H A DProfileEstimatorPass.cpp130 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock()
201 Edge edge = getEdge(Latch,0); in recurseBasicBlock()
204 edge = getEdge(Latch, BB); in recurseBasicBlock()
263 Edge edge = getEdge(BB,0); in recurseBasicBlock()
269 Edge edge = getEdge(BB,*bbi); in recurseBasicBlock()
336 Edge edge = getEdge(0,entry); in runOnFunction()
367 Edge e = getEdge(*bbi,BB); in runOnFunction()
401 Edge e = getEdge(0,BB); in runOnFunction()
405 Edge e = getEdge(*predi,BB); in runOnFunction()
410 Edge e = getEdge(BB,0); in runOnFunction()
[all …]
/dports/cad/sumo/sumo-1.2.0/src/microsim/
H A DMSRightOfWayJunction.cpp68 if ((*j)->getLane()->getEdge().isWalkingArea() || in postloadInit()
69 ((*i)->getEdge().isWalkingArea() && !(*j)->getLane()->getEdge().isCrossing())) { in postloadInit()
83 if ((*j)->getLane()->getEdge().isWalkingArea()) { in postloadInit()
89 … } else if (((*i)->getEdge().isWalkingArea() && !(*j)->getLane()->getEdge().isCrossing())) { in postloadInit()
143 if (l.size() == 1 && l[0].lane->getEdge().isInternal()) { in postloadInit()
160 if (ili.lane->getEdge().isWalkingArea()) { in postloadInit()
167 if (MSGlobals::gUsingInternalLanes && (*j)->getLane()->getEdge().isCrossing()) { in postloadInit()
180 if (!(*j)->getLane()->getEdge().isWalkingArea()) { in postloadInit()
/dports/graphics/blender/blender-2.91.0/extern/mantaflow/preprocessed/
H A Dvortexsheet.cpp52 Vec3 e0 = getEdge(tri, 0), e1 = getEdge(tri, 1), e2 = getEdge(tri, 2); in calcVorticity()
70 Vec3 e0 = getEdge(tri, 0), e1 = getEdge(tri, 1), e2 = getEdge(tri, 2); in calcCirculation()
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/ball/src/source/STRUCTURE/
H A Dtriangle.cpp153 << (triangle.getEdge(0) == NULL in operator <<()
155 : triangle.getEdge(0)->getIndex()) << ' ' in operator <<()
156 << (triangle.getEdge(1) == NULL in operator <<()
158 : triangle.getEdge(1)->getIndex()) << ' ' in operator <<()
159 << (triangle.getEdge(2) == NULL in operator <<()
161 : triangle.getEdge(2)->getIndex()) in operator <<()
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/
H A DGraph.h115 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; } in getEdge() function
116 const EdgeEntry& getEdge(ConstEdgeItr eItr) const { return *eItr; } in getEdge() function
128 EdgeEntry &ne = getEdge(edgeItr); in addConstructedEdge()
220 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); } in getEdgeCosts()
226 return getEdge(eItr).getCosts(); in getEdgeCosts()
234 void setEdgeData(EdgeItr eItr, void *data) { getEdge(eItr).setData(data); } in setEdgeData()
239 void* getEdgeData(EdgeItr eItr) { return getEdge(eItr).getData(); } in getEdgeData()
284 return getEdge(eItr).getNode1(); in getEdgeNode1()
291 return getEdge(eItr).getNode2(); in getEdgeNode2()
299 EdgeEntry &e = getEdge(eItr); in getEdgeOtherNode()
[all …]
/dports/cad/sumo/sumo-1.2.0/src/mesosim/
H A DMETriggeredCalibrator.cpp101 mySegment->getEdge().setMaxSpeed(myDefaultSpeed); in execute()
102 MESegment* first = MSGlobals::gMesoNet->getSegmentForEdge(mySegment->getEdge()); in execute()
117 …yCurrentStateInterval->v >= 0 && myCurrentStateInterval->v != mySegment->getEdge().getSpeedLimit()… in execute()
118 mySegment->getEdge().setMaxSpeed(myCurrentStateInterval->v); in execute()
119 MESegment* first = MSGlobals::gMesoNet->getSegmentForEdge(mySegment->getEdge()); in execute()
202 const MSEdge* myedge = &mySegment->getEdge(); in execute()
204 while (vehicle->getEdge() != myedge) { in execute()
244 const bool toSlow = mySegment->getMeanSpeed() < 0.8 * mySegment->getEdge().getSpeedLimit(); in invalidJam()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h218 EdgeEntry &NE = getEdge(EId); in addConstructedEdge()
524 return getEdge(EId).Costs; in getEdgeCostsPtr()
531 return *getEdge(EId).Costs; in getEdgeCosts()
535 return getEdge(EId).Metadata; in getEdgeMetadata()
539 return getEdge(EId).Metadata; in getEdgeMetadata()
546 return getEdge(EId).getN1Id(); in getEdgeNode1Id()
553 return getEdge(EId).getN2Id(); in getEdgeNode2Id()
561 EdgeEntry &E = getEdge(EId); in getEdgeOtherNodeId()
629 EdgeEntry &E = getEdge(EId); in disconnectEdge()
645 EdgeEntry &E = getEdge(EId); in reconnectEdge()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h218 EdgeEntry &NE = getEdge(EId); in addConstructedEdge()
524 return getEdge(EId).Costs; in getEdgeCostsPtr()
531 return *getEdge(EId).Costs; in getEdgeCosts()
535 return getEdge(EId).Metadata; in getEdgeMetadata()
539 return getEdge(EId).Metadata; in getEdgeMetadata()
546 return getEdge(EId).getN1Id(); in getEdgeNode1Id()
553 return getEdge(EId).getN2Id(); in getEdgeNode2Id()
561 EdgeEntry &E = getEdge(EId); in getEdgeOtherNodeId()
629 EdgeEntry &E = getEdge(EId); in disconnectEdge()
645 EdgeEntry &E = getEdge(EId); in reconnectEdge()
[all …]

12345678910>>...45