579             inline int &upper() {return pointingUp ? to : from;}  in upper()
580             inline int &lower() {return pointingUp ? from : to;}  in lower()
581             inline int upper() const {return pointingUp ? to : from;}  in upper()
582             inline int lower() const {return pointingUp ? from : to;}  in lower()
589             bool pointingUp, originallyPointingUp;  member
688             bool pointingUp;  member
689             int upper() const {return (pointingUp ? to : from);}  in upper()
690             int lower() const {return (pointingUp ? from : to);}  in lower()
968         m_edges.at(i).originallyPointingUp = m_edges.at(i).pointingUp =  in initEdges()
1277         Q_ASSERT(m_edges.at(i).pointingUp == m_edges.at(i).originallyPointingUp);  in fillPriorityQueue()
1278 …Q_ASSERT(m_edges.at(i).pointingUp == (m_parent->m_vertices.at(m_edges.at(i).to) < m_parent->m_vert…  in fillPriorityQueue()
1379     if (lowerEdge.pointingUp) {  in splitEdge()
1401         m_edges.at(i).originallyPointingUp = m_edges.at(i).pointingUp =  in splitEdgesAtIntersections()
1521                     m_edges.at(i).pointingUp = !m_edges.at(i).pointingUp;  in removeUnwantedEdgesAndConnect()
1569 …    Q_ASSERT(m_edges.at(orderedEdges[i]).pointingUp || m_edges.at(orderedEdges[i]).previous != -1);  in removeUnwantedEdgesAndConnect()
1570 …Q_ASSERT(!m_edges.at(orderedEdges[i + 1]).pointingUp || m_edges.at(orderedEdges[i + 1]).next != -1…  in removeUnwantedEdgesAndConnect()
1798 …m_edges.at(i).pointingUp = m_parent->m_vertices.at(m_edges.at(i).to) < m_parent->m_vertices.at(m_e…  in setupDataStructures()
1903     bool startOrSplit = (e1.pointingUp && !e2.pointingUp);  in classifyVertex()
1904     bool endOrMerge = (!e1.pointingUp && e2.pointingUp);  in classifyVertex()
2046             if (m_edges.at(i).pointingUp == m_clockwiseOrder) {  in monotoneDecomposition()