i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixed sort_rects(). Rects are sorted by their top value, not by their left as I tought in the first place. I had already fixed or_region_no_x, I just forgot to update sort_rects().

Browse Source 
Fixed a typing bug in PrintToStream().
Added a comment.


git-svn-id: file:///srv/svn/repos/haiku/trunk/current@3689 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Stefano Ceccherini
2003-06-27 06:21:50 +00:00
parent ebb226d544
commit 15cfed465c
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/kits/interface/Region.cpp
+4 -3
View File
@@ -49,6 +49,7 @@ cleanup_region(BRegion *region)
} }
// Sort the given rects by their top value
void void
sort_rects(clipping_rect *rects, long count) sort_rects(clipping_rect *rects, long count)
{ {
@@ -56,7 +57,7 @@ sort_rects(clipping_rect *rects, long count)
bool again; //flag that tells we changed rects positions bool again; //flag that tells we changed rects positions
if (count == 2) { if (count == 2) {
if (rects[0].left > rects[1].left) { if (rects[0].top > rects[1].top) {
clipping_rect tmp = rects[0]; clipping_rect tmp = rects[0];
rects[0] = rects[1]; rects[0] = rects[1];
rects[1] = tmp; rects[1] = tmp;
@@ -65,7 +66,7 @@ sort_rects(clipping_rect *rects, long count)
do { do {
again = false; again = false;
for (int c = 1; c < count; c++) { for (int c = 1; c < count; c++) {
if (rects[c - 1].left > rects[c].left) { if (rects[c - 1].top > rects[c].top) {
clipping_rect tmp = rects[c - 1]; clipping_rect tmp = rects[c - 1];
rects[c - 1] = rects[c]; rects[c - 1] = rects[c];
rects[c] = tmp; rects[c] = tmp;
@@ -557,7 +558,7 @@ BRegion::PrintToStream() const
for (int c = 0; c < count; c++) { for (int c = 0; c < count; c++) {
clipping_rect *rect = &data[c]; clipping_rect *rect = &data[c];
printf("data = BRect(l:%ld, t:%ld.0, r:%ld.0, b:%ld.0)\n", printf("data = BRect(l:%ld.0, t:%ld.0, r:%ld.0, b:%ld.0)\n",
rect->left, rect->top, rect->right, rect->bottom); rect->left, rect->top, rect->right, rect->bottom);
} }
} }