Home
last modified time | relevance | path

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

/dports/cad/opencascade/opencascade-7.6.0/inc/
H A DBRepFill_Sweep.hxx126 Standard_EXPORT Standard_Boolean MergeVertex (const TopoDS_Shape& V1, TopoDS_Shape& V2) const;
/dports/cad/opencascade/opencascade-7.6.0/src/BRepFill/
H A DBRepFill_Sweep.hxx126 Standard_EXPORT Standard_Boolean MergeVertex (const TopoDS_Shape& V1, TopoDS_Shape& V2) const;
H A DBRepFill_Sweep.cxx2507 if (MergeVertex(Vertex(1,ipath), Vertex(1,ipath+1))) { in BuildShell()
2530 if (MergeVertex(Vertex(isec,1), Vertex(isec+1,1))) { in BuildShell()
2557 singv = MergeVertex(Vertex(isec,ipath+1), Vertex(isec+1,ipath+1)); in BuildShell()
2558 singu = MergeVertex(Vertex(isec+1,ipath), Vertex(isec+1,ipath+1)); in BuildShell()
3534 Standard_Boolean BRepFill_Sweep::MergeVertex(const TopoDS_Shape& V1, in MergeVertex() function in BRepFill_Sweep
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/
H A DBRepFill_Sweep.hxx131 Standard_EXPORT Standard_Boolean MergeVertex (const TopoDS_Shape& V1, TopoDS_Shape& V2) const;
/dports/databases/qt5-sqldrivers-sqlite2/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sqldrivers-tds/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sqldrivers-sqlite3/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/devel/qt5-testlib/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sqldrivers-ibase/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sqldrivers-mysql/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sqldrivers-odbc/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sql/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/databases/qt5-sqldrivers-pgsql/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/net/qt5-network/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/textproc/qt5-xml/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/x11-toolkits/qt5-widgets/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/x11-toolkits/qt5-gui/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/devel/qt5-qmake/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/devel/qt5-dbus/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/devel/qt5-concurrent/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/devel/qt5-buildtools/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/print/qt5-printsupport/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/graphics/qt5-opengl/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqtriangulator.cpp680 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
1918 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
1923 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2049 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2057 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2069 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2105 case MergeVertex: in monotoneDecomposition()
2108 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2117 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2126 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/opengl/gl2paintengineex/
H A Dqtriangulator.cpp1445 enum VertexType {MergeVertex, EndVertex, RegularVertex, StartVertex, SplitVertex}; enumerator
2683 e2.type = (d < 0 ? MergeVertex : EndVertex); in classifyVertex()
2688 e2.type = (d > 0 ? MergeVertex : EndVertex); in classifyVertex()
2814 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2822 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
2834 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2870 case MergeVertex: in monotoneDecomposition()
2873 if (m_edges.at(m_edges.at(leftEdgeNode->data).helper).type == MergeVertex) in monotoneDecomposition()
2882 if (m_edges.at(m_edges.at(i).helper).type == MergeVertex) in monotoneDecomposition()
2891 if (m_edges.at(m_edges.at(j).helper).type == MergeVertex) in monotoneDecomposition()
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/
H A Dsymbols_mangled_win.dat24457 ?MergeVertex@BRepFill_Sweep@@IEBA_NAEBVTopoDS_Shape@@AEAV2@@Z