Rev 2568 | Go to most recent revision | Show entire file | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2568 | Rev 3043 | ||
---|---|---|---|
Line 1... | Line 1... | ||
1 | //Áûñòðàÿ ñîðòèðîâêà. Leency 2008. |
1 | //Áûñòðàÿ ñîðòèðîâêà. Leency 2008. |
Line 2... | Line 2... | ||
2 | 2 | ||
3 | void Sort_by_Size(int a, b) // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1 |
3 | void Sort_by_Size(int a, b) // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1 |
4 | { |
4 | { |
5 | int i = a; |
5 | int iss = a; |
6 | IF (a >= b) return; |
6 | IF (a >= b) return; |
7 | FOR (j = a; j <= b; j++) |
7 | FOR (j = a; j <= b; j++) |
8 | IF (ESDWORD[file_mas[j]*304 + buf+64] <= ESDWORD[file_mas[b]*304 + buf+64]) |
- | |
9 | { file_mas[i] >< file_mas[j]; i++;} |
8 | IF (ESDWORD[file_mas[j]*304 + buf+64] <= ESDWORD[file_mas[b]*304 + buf+64]) { file_mas[iss] >< file_mas[j]; iss++;} |
10 | Sort_by_Size (a, i-2); |
9 | Sort_by_Size (a, iss-2); |
11 | Sort_by_Size (i, b); |
10 | Sort_by_Size (iss, b); |
Line 12... | Line 11... | ||
12 | } |
11 | } |
13 | 12 | ||
14 | 13 | ||
15 | void Sort_by_Name(int a, b) // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1 |
14 | void Sort_by_Name(int a, b) // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1 |
16 | { |
15 | { |
17 | int i = a; |
16 | int isn = a; |
18 | IF (a >= b) return; |
17 | IF (a >= b) return; |
19 | FOR (j = a; j <= b; j++) |
18 | FOR (j = a; j <= b; j++) |
20 | IF (strcmp(file_mas[j]*304 + buf+72, file_mas[b]*304 + buf+72)<=0) { file_mas[i] >< file_mas[j]; i++;} |
19 | IF (strcmp(file_mas[j]*304 + buf+72, file_mas[b]*304 + buf+72)<=0) { file_mas[isn] >< file_mas[j]; isn++;} |
Line 21... | Line 20... | ||
21 | Sort_by_Name(a, i-2); |
20 | Sort_by_Name(a, isn-2); |
22 | Sort_by_Name(i, b); |
21 | Sort_by_Name(isn, b); |
23 | } |
22 | } |
24 | 23 | ||
25 | 24 | ||
26 | void Sort_by_Type(int a, b) // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1 |
25 | void Sort_by_Type(int a, b) // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1 |
Line 27... | Line 26... | ||
27 | { |
26 | { |
28 | int i=a; |
27 | int jst, ist=a; |
29 | int n; |
28 | int n; |
30 | dword offset=buf+72; |
- | |
- | 29 | unsigned char filename1[256], filename2[256]; |
|
31 | byte filename1[256], filename2[256]; |
30 | unsigned char ext1[256], ext2[256]; |
32 | 31 | ||
33 | IF (a >= b) return; |
32 | IF (a >= b) return; |
34 | for (j = a; j <= b; j++) |
33 | for (jst = a; jst <= b; jst++) |
35 | { |
34 | { |
36 | // |
35 | ext1[0]=ext2[0]=filename1[0]=filename2[0]=NULL; |
37 | copystr(file_mas[j]*304 + offset, #filename1); |
36 | copystr(file_mas[jst]*304 + buf+72, #filename1); |
38 | copystr(file_mas[b]*304 + offset, #filename2); |
37 | copystr(file_mas[b]*304 + buf+72, #filename2); |
39 | n=strlen(#filename1)-1; |
38 | n=strlen(#filename1)-1; |
40 | WHILE (filename1[n]<>'.') && (n>0) n--; |
39 | WHILE (filename1[n]<>'.') && (n>0) n--; |
41 | IF (n) copystr(#filename1+n+1, #filename1); |
40 | IF (n) copystr(#filename1+n+1, #ext1); |
42 | n=strlen(#filename2)-1; |
41 | n=strlen(#filename2)-1; |
43 | WHILE (filename2[n]<>'.') && (n>0) n--; |
42 | WHILE (filename2[n]<>'.') && (n>0) n--; |
44 | IF (n) copystr(#filename2+n+1, #filename2); |
43 | IF (n) copystr(#filename2+n+1, #ext2); |
45 | // |
44 | |
46 | n=strcmp(#filename1, #filename2); |
45 | n=strcmp(#ext1, #ext2); |