| /dports/math/dune-istl/dune-istl-fffb544a61d2c65a0d2fc7c751f36909f06be8f5/dune/istl/paamg/ |
| H A D | aggregates.hh | 1529 void Aggregate<G,S>::reconstruct(const Vertex& vertex) in reconstruct()
1545 inline void Aggregate<G,S>::seed(const Vertex& vertex) in seed()
1558 inline void Aggregate<G,S>::add(const Vertex& vertex) in add()
1770 for(EdgeIterator edge = graph.beginEdges(*current); in breadthFirstSearch() local
1866 for(auto edge = vertex.begin(); edge!= eEnd; ++edge, ++col) { in buildDependency() local
2151 Aggregator<G>::nonisoNeighbourAggregate(const Vertex& vertex, in nonisoNeighbourAggregate()
2159 for(Iterator edge=graph_->beginEdges(vertex); edge!=end; ++edge) in nonisoNeighbourAggregate() local
2204 inline bool Aggregator<G>::connected(const Vertex& vertex, in connected()
2210 for(iterator edge = graph_->beginEdges(vertex); edge != end; ++edge) in connected() local
2216 inline bool Aggregator<G>::connected(const Vertex& vertex, in connected()
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/domhex/ |
| H A D | mwis.hpp | 104 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef in mwis::lagrangian_bound
425 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef
499 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef in mwis::clique_assignment
584 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef in mwis::state_change
678 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef
703 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef in mwis::successor
768 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef in mwis::evaluator
798 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef
825 typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex; typedef
856 void pop() { _queue.pop(); } in pop() function in mwis::limited_queue
[all …]
|
| /dports/databases/qt5-sqldrivers-sqlite2/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sqldrivers-tds/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sqldrivers-sqlite3/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/devel/qt5-testlib/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sqldrivers-ibase/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sqldrivers-mysql/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sqldrivers-odbc/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sql/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/databases/qt5-sqldrivers-pgsql/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/net/qt5-network/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/textproc/qt5-xml/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/x11-toolkits/qt5-widgets/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/x11-toolkits/qt5-gui/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/devel/qt5-qmake/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/devel/qt5-dbus/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/devel/qt5-concurrent/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/devel/qt5-buildtools/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/print/qt5-printsupport/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/graphics/qt5-opengl/kde-qtbase-5.15.2p263/src/gui/painting/ |
| H A D | qtriangulator.cpp | 414 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
597 int vertex; member
604 int vertex; member
605 int edge; member
616 int edge; member
961 …Edge edge = {nullptr, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, … in initEdges() local
1230 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1244 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
1309 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
1947 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/java/java3d/java3d-1.5.2/j3d-core-utils/src/classes/share/com/sun/j3d/utils/geometry/ |
| H A D | Stripifier.java | 385 Edge edge; in buildAdjacencies() local
2183 boolean equals(Edge edge) { in equals()
2194 boolean lessThan(Edge edge) { in lessThan()
2234 int getNeighbor(int edge) { in getNeighbor()
2249 int getEdgeIndex(Edge edge) { in getEdgeIndex()
2255 void counterEdgeDel(Edge edge) { in counterEdgeDel()
2429 Node pop() { in pop() method in Stripifier.SortedList
2462 void append(Vertex vertex) { in append()
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/src/opengl/gl2paintengineex/ |
| H A D | qtriangulator.cpp | 565 T QMaxHeap<T>::pop() in pop() function in QMaxHeap
1362 int vertex; member
1369 int vertex; member
1370 int edge; member
1381 int edge; member
1713 …Edge edge = {0, int(m_parent->m_indices.at(i)), int(m_parent->m_indices.at(i + 1)), -1, -1, 0, tru… in initEdges() local
1982 const Edge &edge = m_edges.at(previous->data); in sortEdgeList() local
1996 const Edge &edge = m_edges.at(next->data); in sortEdgeList() local
2061 …int vertex = (event.type == Event::Upper ? m_edges.at(event.edge).upper() : m_edges.at(event.edge)… in calculateIntersections() local
2712 bool QTriangulator<T>::SimpleToMonotone::pointIsInSector(int vertex, int sector) in pointIsInSector()
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/third_party/xatlas/ |
| H A D | xatlas.cpp | 2643 const uint32_t edge = i * 3 + j; in createBoundaries() local
2833 uint32_t edge = boundaryLoops[i]; in writeObjLinkedBoundaries() local
3072 uint32_t edge() const in edge() function in xatlas::internal::Mesh::BoundaryLoopEdgeIterator
3106 uint32_t vertex() const in vertex() function in xatlas::internal::Mesh::ColocalVertexIterator
3147 uint32_t edge() const in edge() function in xatlas::internal::Mesh::ColocalEdgeIterator
3507 uint32_t edge; member
3509 uint32_t vertex; member
4029 void append(uint32_t edge) in append()
4123 const uint32_t edge = m_edges[i]; in createGrid() local
4850 uint32_t pop() in pop() function
[all …]
|
| /dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/xatlas/ |
| H A D | xatlas.cpp | 2565 const uint32_t edge = i * 3 + j; in createBoundaries() local
2764 uint32_t edge = boundaryLoops[i]; in writeObjLinkedBoundaries() local
2990 uint32_t edge() const in edge() function in xatlas::internal::Mesh::BoundaryLoopEdgeIterator
3024 uint32_t vertex() const in vertex() function in xatlas::internal::Mesh::ColocalVertexIterator
3065 uint32_t edge() const in edge() function in xatlas::internal::Mesh::ColocalEdgeIterator
3548 uint32_t edge; member
3550 uint32_t vertex; member
4065 void append(uint32_t edge) in append()
4200 const uint32_t edge = m_edges[i]; in createGrid() local
5467 uint32_t pop() in pop() function
[all …]
|