| Function | Condition % | eLOC - Effective Lines of Code | McCabe - Cyclomatic Complexityâ–¾ |
removeUnwantedEdgesAndConnect| Name: | QTriangulator::ComplexToSimple::removeUnwantedEdgesAndConnect | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::removeUnwantedEdgesAndConnect() | | Coverage: | 0.000% (0/61) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1456-1593 |
| | 80 | 17 |
sortEdgeList| Name: | QTriangulator::ComplexToSimple::sortEdgeList | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::sortEdgeList(const QPodPoint eventPoint) | | Coverage: | 0.000% (0/25) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1230-1284 |
| | 28 | 9 |
outerBounds| Name: | QTriangulator::ComplexToSimple::outerBounds | | Prototype: | template <typename T> QPair<QRBTree<int>::Node *, QRBTree<int>::Node *> QTriangulator<T>::ComplexToSimple::outerBounds(const QPodPoint &point) const | | Coverage: | 0.000% (0/25) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1126-1181 |
| | 31 | 9 |
calculateIntersections| Name: | QTriangulator::ComplexToSimple::calculateIntersections | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::calculateIntersections() | | Coverage: | 0.000% (0/35) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1310-1370 |
| | 37 | 9 |
bounds| Name: | QTriangulator::ComplexToSimple::bounds | | Prototype: | template <typename T> QPair<QRBTree<int>::Node *, QRBTree<int>::Node *> QTriangulator<T>::ComplexToSimple::bounds(const QPodPoint &point) const | | Coverage: | 0.000% (0/24) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1077-1124 |
| | 27 | 8 |
removeUnusedPoints| Name: | QTriangulator::ComplexToSimple::removeUnusedPoints | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::removeUnusedPoints() | | Coverage: | 0.000% (0/16) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1595-1618 |
| | 17 | 6 |
initEdges| Name: | QTriangulator::ComplexToSimple::initEdges | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::initEdges() | | Coverage: | 0.000% (0/16) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 964-988 |
| | 14 | 6 |
reorderEdgeListRange| Name: | QTriangulator::ComplexToSimple::reorderEdgeListRange | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::reorderEdgeListRange(QRBTree<int>::Node *leftmost, QRBTree<int>::Node *rightmost) | | Coverage: | 0.000% (0/13) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1202-1228 |
| | 18 | 5 |
insertEdgeIntoVectorIfWanted| Name: | QTriangulator::ComplexToSimple::insertEdgeIntoVectorIfWanted | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::insertEdgeIntoVectorIfWanted(ShortArray &orderedEdges, int i) | | Coverage: | 0.000% (0/23) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1425-1454 |
| | 15 | 5 |
decompose| Name: | QTriangulator::ComplexToSimple::decompose | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::decompose() | | Coverage: | 0.000% (0/15) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 933-962 |
| | 19 | 5 |
splitEdgesAtIntersections| Name: | QTriangulator::ComplexToSimple::splitEdgesAtIntersections | | Prototype: | template <typename T> bool QTriangulator<T>::ComplexToSimple::splitEdgesAtIntersections() | | Coverage: | 0.000% (0/10) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1407-1423 |
| | 11 | 4 |
splitEdgeListRange| Name: | QTriangulator::ComplexToSimple::splitEdgeListRange | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::splitEdgeListRange(QRBTree<int>::Node *leftmost, QRBTree<int>::Node *rightmost, int vertex, const QIntersectionPoint &intersectionPoint) | | Coverage: | 0.000% (0/14) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1183-1200 |
| | 8 | 4 |
splitEdge| Name: | QTriangulator::ComplexToSimple::splitEdge | | Prototype: | template <typename T> int QTriangulator<T>::ComplexToSimple::splitEdge(int splitIndex) | | Coverage: | 0.000% (0/10) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1376-1405 |
| | 17 | 4 |
searchEdgeLeftOf| Name: | QTriangulator::ComplexToSimple::searchEdgeLeftOf | | Prototype: | template <typename T> QRBTree<int>::Node *QTriangulator<T>::ComplexToSimple::searchEdgeLeftOf(int edgeIndex, QRBTree<int>::Node *after) const | | Coverage: | 0.000% (0/12) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1061-1075 |
| | 10 | 4 |
edgeIsLeftOfEdge| Name: | QTriangulator::ComplexToSimple::edgeIsLeftOfEdge | | Prototype: | template <typename T> bool QTriangulator<T>::ComplexToSimple::edgeIsLeftOfEdge(int leftEdgeIndex, int rightEdgeIndex) const | | Coverage: | 0.000% (0/10) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1026-1043 |
| | 8 | 4 |
calculateIntersection| Name: | QTriangulator::ComplexToSimple::calculateIntersection | | Prototype: | template <typename T> bool QTriangulator<T>::ComplexToSimple::calculateIntersection(int left, int right) | | Coverage: | 0.000% (0/12) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 991-1024 |
| | 18 | 4 |
Edge| Name: | QTriangulator::ComplexToSimple::Edge | | Coverage: | 0.000% (0/4) |
| | 4 | 4 |
searchEdgeLeftOf| Name: | QTriangulator::ComplexToSimple::searchEdgeLeftOf | | Prototype: | template <typename T> QRBTree<int>::Node *QTriangulator<T>::ComplexToSimple::searchEdgeLeftOf(int edgeIndex) const | | Coverage: | 0.000% (0/7) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1045-1059 |
| | 8 | 3 |
fillPriorityQueue| Name: | QTriangulator::ComplexToSimple::fillPriorityQueue | | Prototype: | template <typename T> void QTriangulator<T>::ComplexToSimple::fillPriorityQueue() | | Coverage: | 0.000% (0/7) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 1286-1308 |
| | 15 | 3 |
Event| Name: | QTriangulator::ComplexToSimple::Event | | Coverage: | 0.000% (0/4) |
| | 3 | 2 |
Intersection| Name: | QTriangulator::ComplexToSimple::Intersection | | Coverage: | 0.000% (0/1) |
| | 1 | 1 |
ComplexToSimple| Name: | QTriangulator::ComplexToSimple::ComplexToSimple | | Prototype: | inline ComplexToSimple(QTriangulator<T> *parent) | | Coverage: | 0.000% (0/1) | | Absolute File Name: | /home/qt/qt5_coco/qt5/qtbase/src/gui/opengl/qtriangulator.cpp | | Lines: | 590-591 |
| | 1 | 1 |