forked from KolibriOS/kolibrios
59 lines
1.5 KiB
C
59 lines
1.5 KiB
C
|
|
void Sort_by_Size(int a, b) // äë˙ ďĺđâîăî âűçîâŕ: a = 0, b = <ýëĺěĺíňîâ â ěŕńńčâĺ> - 1
|
|
{
|
|
int j;
|
|
int iss = a;
|
|
int size1, size2;
|
|
if (a >= b) return;
|
|
size2 = items.get(b)*304 + buf+64;
|
|
for (j = a; j <= b; j++) {
|
|
size1 = items.get(j)*304 + buf+64;
|
|
if (ESDWORD[size1] <= ESDWORD[size2]) { items.swap(iss,j); iss++;}
|
|
}
|
|
Sort_by_Size (a, iss-2);
|
|
Sort_by_Size (iss, b);
|
|
}
|
|
|
|
|
|
void Sort_by_Name(int a, b) // äë˙ ďĺđâîăî âűçîâŕ: a = 0, b = <ýëĺěĺíňîâ â ěŕńńčâĺ> - 1
|
|
{
|
|
int j;
|
|
int isn = a;
|
|
dword name2 = items.get(b)*304 + buf+72;
|
|
if (a >= b) return;
|
|
for (j = a; j <= b; j++) {
|
|
if (strcmpi(items.get(j)*304 + buf+72, name2)<=0) { items.swap(isn,j); isn++;}
|
|
}
|
|
Sort_by_Name(a, isn-2);
|
|
Sort_by_Name(isn, b);
|
|
}
|
|
|
|
|
|
void Sort_by_Type(int a, b) // äë˙ ďĺđâîăî âűçîâŕ: a = 0, b = <ýëĺěĺíňîâ â ěŕńńčâĺ> - 1
|
|
{
|
|
int j;
|
|
dword filename1, filename2, ext1, ext2;
|
|
int n, isn = a;
|
|
if (a >= b) return;
|
|
filename2 = items.get(b)*304 + buf+72;
|
|
for (j = a; j <= b; j++)
|
|
{
|
|
filename1 = items.get(j)*304 + buf+72;
|
|
|
|
n=strlen(filename1)-1;
|
|
WHILE (n>0) && (ESBYTE[filename1+n]!='.') n--;
|
|
if (n) ext1 = filename1+n+1; else ext1=0;
|
|
n=strlen(filename2);
|
|
n--;
|
|
WHILE (n>0) && (ESBYTE[filename2+n]!='.') n--;
|
|
if (n) ext2 = filename2+n+1; else ext2=0;
|
|
|
|
n=strcmp(ext1, ext2);
|
|
if (n<0) { items.swap(isn, j); isn++;}
|
|
if (!n) && (strcmp(filename1, filename2) <= 0) { items.swap(isn,j); isn++;}
|
|
}
|
|
Sort_by_Type(a, isn-2);
|
|
Sort_by_Type(isn, b);
|
|
}
|
|
|