bbs/deb-goldedplus
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

One more fix to the sorting algorithm

Browse Source
This commit is contained in:
Alexander S. Aganichev 2001-12-25 23:54:27 +00:00
parent cb06e20b46
commit a9ea323ca4
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
golded3/gealst.cpp
View File

@ -136,7 +136,8 @@ extern "C" int AreaListCmp(const Area** __a, const Area** __b) {
if((cmp = compare_groups(ga ? ga : INT_MAX, gb ? gb : INT_MAX)) != 0) if((cmp = compare_groups(ga ? ga : INT_MAX, gb ? gb : INT_MAX)) != 0)
return cmp; return cmp;
if(strpbrk(ptr+1, "tT") != NULL)
break;
if((cmp = compare_two(b->isseparator(), a->isseparator())) != 0) if((cmp = compare_two(b->isseparator(), a->isseparator())) != 0)
return cmp; return cmp;
} }
@ -158,6 +159,8 @@ extern "C" int AreaListCmp(const Area** __a, const Area** __b) {
case 'T': case 'T':
if((cmp = compare_two(CFG->areatypeorder[A->type()&0xFF], CFG->areatypeorder[B->type()&0xFF])) != 0) if((cmp = compare_two(CFG->areatypeorder[A->type()&0xFF], CFG->areatypeorder[B->type()&0xFF])) != 0)
return cmp; return cmp;
if(strpbrk(ptr+1, "gG") != NULL)
break;
if((cmp = compare_two(b->isseparator(), a->isseparator())) != 0) if((cmp = compare_two(b->isseparator(), a->isseparator())) != 0)
return cmp; return cmp;
break; break;