forked from KolibriOS/kolibrios
52 lines
1.5 KiB
C
52 lines
1.5 KiB
C
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>. Leency 2008.
|
|||
|
|
|
|||
|
|
void Sort_by_Size(int a, b) // <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: a = 0, b = <<3C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>> - 1
|
|||
|
|
{
|
|||
|
|
int iss = a;
|
|||
|
|
IF (a >= b) return;
|
|||
|
|
FOR (j = a; j <= b; j++)
|
|||
|
|
IF (ESDWORD[file_mas[j]*304 + buf+64] <= ESDWORD[file_mas[b]*304 + buf+64]) { file_mas[iss] >< file_mas[j]; iss++;}
|
|||
|
|
Sort_by_Size (a, iss-2);
|
|||
|
|
Sort_by_Size (iss, b);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
void Sort_by_Name(int a, b) // <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: a = 0, b = <<3C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>> - 1
|
|||
|
|
{
|
|||
|
|
int isn = a;
|
|||
|
|
IF (a >= b) return;
|
|||
|
|
FOR (j = a; j <= b; j++)
|
|||
|
|
IF (strcmp(file_mas[j]*304 + buf+72, file_mas[b]*304 + buf+72)<=0) { file_mas[isn] >< file_mas[j]; isn++;}
|
|||
|
|
Sort_by_Name(a, isn-2);
|
|||
|
|
Sort_by_Name(isn, b);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
void Sort_by_Type(int a, b) // <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: a = 0, b = <<3C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>> - 1
|
|||
|
|
{
|
|||
|
|
dword filename1, filename2, ext1, ext2;
|
|||
|
|
int n, isn = a;
|
|||
|
|
IF (a >= b) return;
|
|||
|
|
for (j = a; j <= b; j++)
|
|||
|
|
{
|
|||
|
|
filename1 = file_mas[j]*304 + buf+72;
|
|||
|
|
filename2 = file_mas[b]*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)-1;
|
|||
|
|
WHILE (n>0) && (ESBYTE[filename2+n]<>'.') n--;
|
|||
|
|
IF (n) ext2 = filename2+n+1; else ext2=0;
|
|||
|
|
|
|||
|
|
n=strcmp(ext1, ext2);
|
|||
|
|
IF (n<0) { file_mas[isn] >< file_mas[j]; isn++;}
|
|||
|
|
IF (n==0) && (strcmp(filename1, filename2)<=0) { file_mas[isn] >< file_mas[j]; isn++;}
|
|||
|
|
}
|
|||
|
|
Sort_by_Type(a, isn-2);
|
|||
|
|
Sort_by_Type(isn, b);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
|