diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-03-01 13:22:57 -0600 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-03-01 13:22:57 -0600 |
| commit | 9b9d4ea191b72a4742c67bbcdb12528dbe848dfd (patch) | |
| tree | f85ada91374abeb209235c716912d15c9751ad06 /src/svnfrontend/graphtree/graphtreelabel.cpp | |
| parent | c1ece33d3c587246439e1392a25d19e0c7117fee (diff) | |
| download | tdesvn-9b9d4ea191b72a4742c67bbcdb12528dbe848dfd.tar.gz tdesvn-9b9d4ea191b72a4742c67bbcdb12528dbe848dfd.zip | |
Rename additional global TQt functions
Diffstat (limited to 'src/svnfrontend/graphtree/graphtreelabel.cpp')
| -rw-r--r-- | src/svnfrontend/graphtree/graphtreelabel.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/svnfrontend/graphtree/graphtreelabel.cpp b/src/svnfrontend/graphtree/graphtreelabel.cpp index 56bfa04..4d29e6d 100644 --- a/src/svnfrontend/graphtree/graphtreelabel.cpp +++ b/src/svnfrontend/graphtree/graphtreelabel.cpp @@ -100,14 +100,14 @@ TQPointArray GraphEdge::areaPoints() const int maxX = minX, maxY = minY; int i; - if (0) qDebug("GraphEdge::areaPoints\n P 0: %d/%d", minX, minY); + if (0) tqDebug("GraphEdge::areaPoints\n P 0: %d/%d", minX, minY); int len = poly.count(); for (i=1;i<len;i++) { if (poly[i].x() < minX) minX = poly[i].x(); if (poly[i].y() < minY) minY = poly[i].y(); if (poly[i].x() > maxX) maxX = poly[i].x(); if (poly[i].y() > maxY) maxY = poly[i].y(); - if (0) qDebug(" P %d: %d/%d", i, poly[i].x(), poly[i].y()); + if (0) tqDebug(" P %d: %d/%d", i, poly[i].x(), poly[i].y()); } TQPointArray a = poly.copy(), b = poly.copy(); if (minX == maxX) { @@ -123,9 +123,9 @@ TQPointArray GraphEdge::areaPoints() const a[2 * len - 1 -i] = b[i]; if (0) { - qDebug(" Result:"); + tqDebug(" Result:"); for (i=0;i<2*len;i++) - qDebug(" P %d: %d/%d", i, a[i].x(), a[i].y()); + tqDebug(" P %d: %d/%d", i, a[i].x(), a[i].y()); } return a; |