mirror of
https://github.com/reactos/reactos.git
synced 2025-08-07 14:33:10 +00:00
Fix inverse sort for rects.
svn path=/trunk/; revision=31601
This commit is contained in:
parent
21fd38fc61
commit
3a4e403d40
1 changed files with 28 additions and 17 deletions
|
@ -6,13 +6,20 @@ VOID
|
||||||
FASTCALL
|
FASTCALL
|
||||||
SortRects(PRECT pRect, INT nCount)
|
SortRects(PRECT pRect, INT nCount)
|
||||||
{
|
{
|
||||||
INT i = 0, a = 0, b = 0;
|
INT i = 0, a = 0, b = 0, c, s;
|
||||||
RECT sRect;
|
RECT sRect;
|
||||||
|
|
||||||
if (nCount > 0)
|
if (nCount > 0)
|
||||||
{
|
{
|
||||||
for(;;)
|
i = 1; // set index point
|
||||||
|
c = nCount; // set inverse count
|
||||||
|
do
|
||||||
{
|
{
|
||||||
|
s = i; // set sort count
|
||||||
|
if ( i < nCount )
|
||||||
|
{
|
||||||
|
a = i - 1;
|
||||||
|
b = i;
|
||||||
do
|
do
|
||||||
{
|
{
|
||||||
if(pRect[b].top != pRect[i].bottom) break;
|
if(pRect[b].top != pRect[i].bottom) break;
|
||||||
|
@ -22,8 +29,12 @@ SortRects(PRECT pRect, INT nCount)
|
||||||
pRect[a] = pRect[b];
|
pRect[a] = pRect[b];
|
||||||
pRect[b] = sRect;
|
pRect[b] = sRect;
|
||||||
}
|
}
|
||||||
} while(0);
|
++s;
|
||||||
|
++b;
|
||||||
|
} while ( s < nCount );
|
||||||
}
|
}
|
||||||
|
++i;
|
||||||
|
} while ( c-- != 1 );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue