/dports/cad/opencascade/opencascade-7.6.0/src/BRepMesh/ |
H A D | BRepMesh_ShapeTool.cxx | 107 if (!theEdge->GetSameParam () && in CheckAndUpdateFlags() 108 !theEdge->GetSameRange () && in CheckAndUpdateFlags() 109 theEdge->GetDegenerated ()) in CheckAndUpdateFlags() 128 if (theEdge->GetSameParam () || theEdge->GetSameRange ()) in CheckAndUpdateFlags() 130 if (theEdge->GetSameRange ()) in CheckAndUpdateFlags() 134 theEdge->SetSameRange ( in CheckAndUpdateFlags() 138 if (!theEdge->GetSameRange()) in CheckAndUpdateFlags() 252 const TopoDS_Edge& theEdge, in NullifyEdge() argument 322 const TopoDS_Edge& theEdge, in UVPoints() argument 346 const TopoDS_Edge& theEdge, in Range() argument [all …]
|
H A D | BRepMesh_ShapeTool.hxx | 58 const IMeshData::IEdgeHandle& theEdge, 77 const TopoDS_Edge& theEdge, 85 const TopoDS_Edge& theEdge, 94 const TopoDS_Edge& theEdge, 103 const TopoDS_Edge& theEdge, 115 const TopoDS_Edge& theEdge, 130 const TopoDS_Edge& theEdge, 138 const TopoDS_Edge& theEdge, 147 const TopoDS_Edge& theEdge,
|
/dports/math/dune-uggrid/dune-uggrid-bc2d1229420367563410ce9e519f5ff82b45266f/dune/uggrid/parallel/dddif/ |
H A D | identify.cc | 151 EDGE *theEdge; in ResetIdentFlags() local 531 EDGE *theEdge; in IdentifyNode() local 564 ASSERT(theEdge!=NULL); in IdentifyNode() 766 SETEDIDENT(theEdge,IDENT); in IdentifySideEdge() 802 EDGE *theEdge; in IdentifyEdge() local 835 ASSERT(theEdge!=NULL); in IdentifyEdge() 945 SETEDIDENT(theEdge,IDENT); in IdentifyEdge() 1023 EDGE *theEdge; in IdentifyObjectsOfElementSide() local 1431 if (NEW_EDIDENT(theEdge)) assert(GetFatherEdge(theEdge) != NULL); in Gather_TestEdgeInfo() 1446 NEW_EDIDENT(theEdge),nprop,ID_PRTX(theEdge),LEVEL(theEdge),proc,prio); in Scatter_TestEdgeInfo() [all …]
|
H A D | pgmcheck.cc | 334 EDGE *theEdge; in CheckElementPrio() local 439 ASSERT(theEdge != NULL); in CheckElementPrio() 482 assert(theEdge!=NULL); in Gather_ElemObjectGids() 514 assert(theEdge!=NULL); in Scatter_ElemObjectGids() 533 EDGE *theEdge = (EDGE *)obj; in Gather_EdgeObjectGids() local 540 MidNode = MIDNODE(theEdge); in Gather_EdgeObjectGids() 557 EDGE *theEdge = (EDGE *)obj; in Scatter_EdgeObjectGids() local 574 MidNode = MIDNODE(theEdge); in Scatter_EdgeObjectGids() 690 EDGE *theEdge; in CheckInterfaces() local 726 ASSERT(theEdge != NULL); in CheckInterfaces() [all …]
|
H A D | priority.cc | 273 EDGE *theEdge; in SetGhostObjectPriorities() local 290 ASSERT(theEdge != NULL); in SetGhostObjectPriorities() 291 SETUSED(theEdge,0); SETTHEFLAG(theEdge,0); in SetGhostObjectPriorities() 359 ASSERT(theEdge != NULL); in SetGhostObjectPriorities() 360 if (vghost) SETTHEFLAG(theEdge,1); in SetGhostObjectPriorities() 361 if (hghost) SETUSED(theEdge,1); in SetGhostObjectPriorities() 393 ASSERT(theEdge != NULL); in SetGhostObjectPriorities() 394 SETUSED(theEdge,0); SETTHEFLAG(theEdge,0); in SetGhostObjectPriorities() 435 ASSERT(theEdge != NULL); in SetGhostObjectPriorities() 437 if (USED(theEdge) || THEFLAG(theEdge)) in SetGhostObjectPriorities() [all …]
|
H A D | gridcons.cc | 111 EDGE *theEdge; in ConstructConsistentGridLevel() local 208 theEdge = GetEdge(CORNER(theFather,CORNER_OF_EDGE(theFather,j,0)), in ConstructConsistentGridLevel() 210 if (MIDNODE(theEdge) == theNode) break; in ConstructConsistentGridLevel() 220 theEdge = GetEdge(CORNER(theFather,CORNER_OF_EDGE(theFather,j,0)), in ConstructConsistentGridLevel() 223 if (theEdge->midnode != NULL) in ConstructConsistentGridLevel() 228 ID_PRTX(NBNODE(LINK0(theEdge))), in ConstructConsistentGridLevel() 229 ID_PRTX(NBNODE(LINK1(theEdge))), in ConstructConsistentGridLevel() 230 ID_PRTX(theEdge->midnode))) in ConstructConsistentGridLevel() 241 ID_PRTX(NBNODE(LINK0(theEdge))), in ConstructConsistentGridLevel()
|
/dports/cad/opencascade/opencascade-7.6.0/src/BRepLib/ |
H A D | BRepLib_CheckCurveOnSurface.cxx | 33 ( const TopoDS_Edge& theEdge, in BRepLib_CheckCurveOnSurface() argument 36 Init(theEdge, theFace); in BRepLib_CheckCurveOnSurface() 43 void BRepLib_CheckCurveOnSurface::Init(const TopoDS_Edge& theEdge, const TopoDS_Face& theFace) in Init() argument 47 if (theEdge.IsNull() || theFace.IsNull()) in Init() 52 if (BRep_Tool::Degenerated(theEdge) || in Init() 53 !BRep_Tool::IsGeometric(theEdge)) in Init() 59 const Handle(Adaptor3d_Curve) anAdaptor3dCurve = new BRepAdaptor_Curve(theEdge); in Init() 66 …Handle(Geom2d_Curve) aGeom2dCurve = BRep_Tool::CurveOnSurface(theEdge, theFace, aFirstParam, aLast… in Init() 76 if(BRep_Tool::IsClosed(theEdge, theFace)) in Init() 79 BRep_Tool::CurveOnSurface(TopoDS::Edge(theEdge.Reversed()), theFace, aFirstParam, aLastParam); in Init()
|
/dports/math/ogdf/OGDF/src/ogdf/upward/ |
H A D | FixedEmbeddingUpwardEdgeInserter.cpp | 343 locked[adjTmp->theEdge()] = true; in getPath() 345 locked[adjTmp->theEdge()] = true; in getPath() 370 edge ee = adjInit->theEdge(); in getPath() 527 run = predAdj[run->theEdge()]; in isConstraintFeasible() 542 edge e_M = M.copy(a->theEdge()); in isConstraintFeasible() 654 locked[run->theEdge()] = true; in feasibleEdges() 680 locked[run->theEdge()] = true; in feasibleEdges() 697 …if (run->theEdge()->source() == run->faceCycleSucc()->theEdge()->source()) //reach source-switch o… in feasibleEdges() 709 locked[run->theEdge()] = true; in feasibleEdges() 723 …if (run->theEdge()->source() == run->faceCyclePred()->theEdge()->source()) //reach source-switch o… in feasibleEdges() [all …]
|
H A D | DominanceLayout.cpp | 86 lastout[s] = adjRun->theEdge(); in layout() 93 firstin[v] = adj->theEdge(); in layout() 100 lastin[v] = adjRightIn->theEdge(); in layout() 190 node w = adj->theEdge()->target(); in labelX() 191 if (adj->theEdge() == lastin[w]) in labelX() 208 node w = adj->theEdge()->target(); in labelY() 209 if (adj->theEdge() == firstin[w]) in labelY() 276 node src = adj->theEdge()->source(); in findTransitiveEdges() 277 node tgt = adj->theEdge()->target(); in findTransitiveEdges() 278 …if ( (adj->faceCycleSucc()->theEdge()->source() == src && adj->faceCyclePred()->theEdge()->target(… in findTransitiveEdges() [all …]
|
H A D | LayerBasedUPRLayout.cpp | 89 if (outLeft->theEdge() == e1UPR) in left() 91 if (outLeft->theEdge() == e2UPR) in left() 99 if (inLeft->theEdge() == e1UPR) in left() 101 if (inLeft->theEdge() == e2UPR) in left() 121 visitedNode[run->theEdge()->source()] = visitedNode[run->theEdge()->target()] = true; in left() 122 visitedEdge[run->theEdge()] = true; in left() 156 return left(adj_v1->theEdge(), adj_v2->theEdge()); in left() 314 if (adj_pred->theEdge()->target() == v && adj->theEdge()->source() == v) { in dfs_LR() 660 if (adj->theEdge()->target()==u && markedNodes[adj->theEdge()->source()]) in postProcessing_reduceLED() 1012 edge e = adj->theEdge(); in callSimple() [all …]
|
H A D | UpwardPlanRep.cpp | 95 m_isSourceArc[adj->theEdge()] = true; in UpwardPlanRep() 203 m_isSourceArc[adj->theEdge()] = true; in augment() 294 if (m_isSinkArc[adj->theEdge()]) { in removeSinkArcs() 295 m_Gamma.joinFaces(adj->theEdge()); in removeSinkArcs() 331 if (m_isSinkArc[adj->theEdge()]) in insertEdgePathEmbedded() 333 if (m_isSourceArc[adj->theEdge()]) in insertEdgePathEmbedded() 337 if (original(adj->theEdge()) != nullptr) in insertEdgePathEmbedded() 338 c = costOrig[original(adj->theEdge())]; in insertEdgePathEmbedded() 342 if (!m_isSinkArc[adj->theEdge()] && !m_isSourceArc[adj->theEdge()]) in insertEdgePathEmbedded() 355 e_split = adjSrcNext->theEdge(); in insertEdgePathEmbedded() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/ShapeFix/ |
H A D | ShapeFix_EdgeConnect.cxx | 128 TopoDS_Edge theFirst = theEdge; in Add() 133 Add( theEdge, theNext ); in Add() 134 theEdge = theNext; in Add() 176 theEdge.Orientation(TopAbs_FORWARD); in Build() 177 TopExp::Vertices( theEdge, theStart, theEnd ); in Build() 251 theEdge.Orientation(TopAbs_FORWARD); in Build() 274 Standard_Boolean freeflag = theEdge.Free(); in Build() 275 theEdge.Free(Standard_True); //smh in Build() 276 theBuilder.Remove( theEdge, theOldVertex ); in Build() 277 theBuilder.Add( theEdge, theNewVertex ); in Build() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/inc/ |
H A D | BRepMesh_ShapeTool.hxx | 58 const IMeshData::IEdgeHandle& theEdge, 77 const TopoDS_Edge& theEdge, 85 const TopoDS_Edge& theEdge, 94 const TopoDS_Edge& theEdge, 103 const TopoDS_Edge& theEdge, 115 const TopoDS_Edge& theEdge, 130 const TopoDS_Edge& theEdge, 138 const TopoDS_Edge& theEdge, 147 const TopoDS_Edge& theEdge,
|
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/ |
H A D | BRepMesh_ShapeTool.hxx | 58 const IMeshData::IEdgeHandle& theEdge, 77 const TopoDS_Edge& theEdge, 85 const TopoDS_Edge& theEdge, 94 const TopoDS_Edge& theEdge, 103 const TopoDS_Edge& theEdge, 115 const TopoDS_Edge& theEdge, 130 const TopoDS_Edge& theEdge, 138 const TopoDS_Edge& theEdge, 147 const TopoDS_Edge& theEdge,
|
/dports/math/ogdf/OGDF/src/ogdf/orthogonal/ |
H A D | OrthoShaper.cpp | 727 e = ae->theEdge(); in call() 780 e = ae->theEdge(); in call() 1158 edge e = adj->theEdge(); in call() 1362 edge te = adj->theEdge(); in call() 1377 edge te = adj->theEdge(); in call() 1966 e = ae->theEdge(); in call() 2019 e = ae->theEdge(); in call() 2294 edge e = adj->theEdge(); in call() 2462 edge te = adj->theEdge(); in call() 2499 edge te = adj->theEdge(); in call() [all …]
|
H A D | CompactionConstraintGraph.cpp | 140 m_pathToEdge[pathVertex] = m_pPR->original(adj->theEdge()); in dfsInsertPathVertex() 145 node w = adj->theEdge()->opposite(v); in dfsInsertPathVertex() 170 edge e = newEdge(start, m_pathNode[adj->theEdge()->opposite(v)]); in insertBasicArcs() 173 m_cost[e] = m_edgeCost[static_cast<int>(PG.typeOf(adj->theEdge()))]; in insertBasicArcs() 176 if ( (PG.typeOf(adj->theEdge()) == Graph::EdgeType::generalization) && in insertBasicArcs() 177 (PG.typeOf(adj->theEdge()->target()) == Graph::NodeType::generalizationExpander) && in insertBasicArcs() 178 !(PG.isExpansionEdge(adj->theEdge())) in insertBasicArcs() 192 if (verticalGen(adj->theEdge())) m_verticalArc[e] = true; in insertBasicArcs() 194 if (PG.isDegreeExpansionEdge(adj->theEdge())) in insertBasicArcs() 196 edge borderE = adj->theEdge(); in insertBasicArcs()
|
/dports/math/ogdf/OGDF/src/ogdf/planarity/ |
H A D | EmbedderOptimalFlexDraw.cpp | 92 if (adj->theEdge() == skeleton.referenceEdge()) { in createNetwork() 121 edge e = N.newEdge(edgeNode[adj->theEdge()], faceNode[f]); in createNetwork() 129 if (skeleton.isVirtual(adj->theEdge())) { in createNetwork() 130 node twinNode = skeleton.twinTreeNode(adj->theEdge()); in createNetwork() 131 edge e0 = N.newEdge(faceNode[f], edgeNode[adj->theEdge()]); in createNetwork() 134 edge e1 = N.newEdge(faceNode[f], edgeNode[adj->theEdge()]); in createNetwork() 154 perUnitCost[e0] = m_cost[0][adj->theEdge()]; in createNetwork() 157 perUnitCost[e1] = m_cost[1][adj->theEdge()] - m_cost[0][adj->theEdge()]; in createNetwork() 160 perUnitCost[e2] = m_cost[2][adj->theEdge()] - m_cost[1][adj->theEdge()]; in createNetwork() 163 perUnitCost[e3] = m_cost[3][adj->theEdge()] - m_cost[2][adj->theEdge()]; in createNetwork() [all …]
|
H A D | EmbedderMinDepth.cpp | 70 edge e = adj->theEdge(); in doCall() 76 edge e2 = adjCT->theEdge(); in doCall() 129 edge e = adj->theEdge(); in computeBlockGraphs() 135 edge e2 = adjCT->theEdge(); in computeBlockGraphs() 167 edge e = adj->theEdge(); in bottomUpTraversal() 235 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 285 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 456 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 476 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 502 edge e_bT_cT = adj->theEdge(); in topDownTraversal() [all …]
|
H A D | EmbedderMinDepthMaxFace.cpp | 69 edge e = adj->theEdge(); in doCall() 75 edge e2 = adjCT->theEdge(); in doCall() 104 edge e = adj->theEdge(); in doCall() 111 edge e2 = adjCT->theEdge(); in doCall() 173 edge e = adj->theEdge(); in bottomUpTraversal() 181 edge e_cT_bT2 = adjCT->theEdge(); in bottomUpTraversal() 243 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 305 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 476 edge e_bT_cT = adj->theEdge(); in topDownTraversal() 496 edge e_bT_cT = adj->theEdge(); in topDownTraversal() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/basic/ |
H A D | GraphCopy.cpp | 249 edge e = adj->theEdge(); in initByNodes() 277 edge e = adj->theEdge(); in initByActiveNodes() 600 OGDF_ASSERT(original(v->firstAdj()->theEdge()) == original(v->lastAdj()->pred()->theEdge())); in removeEdgePathEmbedded() 601 OGDF_ASSERT(original(v->lastAdj()->theEdge()) == original(v->firstAdj()->succ()->theEdge())); in removeEdgePathEmbedded() 621 edge eIn = u->firstAdj()->theEdge(); in removeEdgePathEmbedded() 682 if(adjA1->theEdge()->source() == v) in removeUnnecessaryCrossing() 687 if(adjB1->theEdge()->source() == v) in removeUnnecessaryCrossing() 700 Graph::delEdge(adjB2->theEdge()); in removeUnnecessaryCrossing() 701 Graph::delEdge(adjA2->theEdge()); in removeUnnecessaryCrossing() 732 if(original(adj1->theEdge()) == original(adj2->theEdge())) in removePseudoCrossings() [all …]
|
H A D | STNumbering.cpp | 51 edge e = adj->theEdge(); in stSearch() 81 e = adj->theEdge(); in stPath() 164 st = adj->theEdge(); in computeSTNumbering() 174 st = s->firstAdj()->theEdge(); in computeSTNumbering() 179 st = t->firstAdj()->theEdge(); in computeSTNumbering() 197 st = s->firstAdj()->theEdge(); in computeSTNumbering() 262 if (st_no[adj->theEdge()->opposite(v)] == max) in isSTNumbering() 271 if (st_no[adj->theEdge()->opposite(v)] == 1) in isSTNumbering() 280 if (st_no[adj->theEdge()->opposite(v)] < st_no[v]) in isSTNumbering() 282 else if (st_no[adj->theEdge()->opposite(v)] > st_no[v]) in isSTNumbering()
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/embedder/ |
H A D | EmbedderMaxFaceBiconnectedGraphsLayers.h | 444 if (S.isVirtual(ae->theEdge())) in adjEntryForNode() 1064 if (aeExtFace->theEdge() == succ_virtualEdge_leftNode->theEdge()) in expandEdgeRNode() 1120 edge vE = (ae->theEdge() == referenceEdge) ? referenceEdge : ae->theEdge(); in expandEdgeRNode() 1121 node nu = (ae->theEdge() == referenceEdge) ? mu : S.twinTreeNode(ae->theEdge()); in expandEdgeRNode() 1165 if (S.isVirtual(aeN->theEdge()) && aeN->theEdge() != referenceEdge) in expandEdgeRNode() 1178 if (aeExtFace->theEdge() == aeNSucc->theEdge()) in expandEdgeRNode() 1184 if (aeExtFace->theEdge() == aeN->theEdge()) in expandEdgeRNode() 1261 if (S.isVirtual(ae->theEdge())) in expandEdgeRNode() 1336 edge e = f1->theEdge(); in expandEdgeRNode() 1338 if (f2->theEdge() == e in expandEdgeRNode() [all …]
|
H A D | EmbedderMaxFaceBiconnectedGraphs.h | 538 if (S.isVirtual(ae->theEdge())) in adjEntryForNode() 1065 if (aeExtFace->theEdge() == succ_virtualEdge_leftNode->theEdge()) in expandEdgeRNode() 1122 edge vE = (ae->theEdge() == referenceEdge) ? referenceEdge : ae->theEdge(); in expandEdgeRNode() 1123 node nu = (ae->theEdge() == referenceEdge) ? mu : S.twinTreeNode(ae->theEdge()); in expandEdgeRNode() 1151 if (S.isVirtual(aeN->theEdge()) && aeN->theEdge() != referenceEdge) in expandEdgeRNode() 1164 if (aeExtFace->theEdge() == aeNSucc->theEdge()) in expandEdgeRNode() 1170 if (aeExtFace->theEdge() == aeN->theEdge()) in expandEdgeRNode() 1481 edge ed = adj->theEdge(); in bottomUpTraversal() 1542 if (ae->theEdge() == er) in bottomUpTraversal() 1572 edge ed = adj->theEdge(); in topDownTraversal() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/graphalg/steiner_tree/goemans/ |
H A D | BlowupGraph.h | 236 y_v += getCapacity(adj->theEdge()); in initPseudotarget() 288 m_graph.delEdge(adj->theEdge()); in updateSourceAndTargetArcCapacities() 301 delta -= getCapacity(adj->theEdge()); in updateSourceAndTargetArcCapacities() 302 m_graph.delEdge(adj->theEdge()); in updateSourceAndTargetArcCapacities() 311 capTarget += getCapacity(adj->theEdge()); in updateSourceAndTargetArcCapacities() 399 const edge e = adj->theEdge(); in initCoreWitness() 570 T val = getCost(v->firstAdj()->theEdge()); in getCoreCost() 572 val = getCost(v->lastAdj()->theEdge()); in getCoreCost() 686 if (w->firstAdj()->theEdge() == e) { in removeBasis() 712 edge e = (*it)->theEdge(); in findRootEdge() [all …]
|
/dports/math/dune-uggrid/dune-uggrid-bc2d1229420367563410ce9e519f5ff82b45266f/dune/uggrid/gm/ |
H A D | gmcheck.cc | 120 EDGE *theEdge; in CheckVertex() local 255 if (theEdge==NULL || theNode!=MIDNODE(theEdge)) in CheckVertex() 529 SETUSED(theEdge,1); in CheckEdge() 545 l0 = LINK0(theEdge); in CheckEdge() 546 l1 = LINK1(theEdge); in CheckEdge() 689 EDGE *theEdge; in CheckElement() local 971 if (theEdge != NULL) in CheckElement() 1243 if (USED(theEdge)) in CheckElementSubdomains() 1412 EDGE *theEdge; in CheckSubdomains() local 1458 EDGE *theEdge; in CheckGeometry() local [all …]
|