/
sort.c
179 lines (167 loc) · 4.81 KB
/
sort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
/* sort.c by lutherus 2013 */
/* includes {{{ */
#include "seoni.h"
#include <ctype.h>
#include "filedata.h"
#include "sort.h"
#include "config.h" /* }}} */
/* change_list {{{ */
void
swap_pointer(Dir_Entry ***dir_entry, int left, int right)
{
Dir_Entry *temp;
temp = (*(*dir_entry+left));
(*(*dir_entry+left)) = (*(*dir_entry+right));
(*(*dir_entry+right)) = temp;
} /* }}} */
/* inverse_list {{{ */
/* good for quick ascending, descending */
void
inverse_sort(Dir_Entry ***dir_entry)
{
int idx = 1, last_dir = 1, nfile_count = 0,
file_count = (*(*dir_entry))->Info->file_count;
while( (*(*dir_entry+idx))->is_directory)
{
last_dir++;
idx++;
if(idx == (file_count)) break;
}
idx = 1;
while(idx <= (last_dir >> 1) &&
(*(*dir_entry+idx))->is_directory != 0)
{
swap_pointer(dir_entry, idx, (last_dir-idx));
idx++;
}
idx = 1;
nfile_count = ( (file_count - last_dir) >> 1);
for(; idx <= nfile_count; idx++, last_dir++)
swap_pointer(dir_entry, last_dir, file_count-idx);
} /* }}} */
/* divide_dirs_and_nfiles {{{ */
int
divide_dirs_and_nfiles(Dir_Entry ***dir_entry)
{
int dir_c = 1, idx = 1;
for(; idx < (*(*dir_entry))->Info->file_count; idx++)
{
if( (*(*dir_entry+idx))->file_t == IS_DIRECTORY)
{
swap_pointer(dir_entry, dir_c, idx);
dir_c++;
}
}
return dir_c;
} /* }}} */
/* sort_files {{{ */
void
sort_files(Dir_Entry ***dir_entry, int so, int sm, char *path)
{
int last_dir = 0;
last_dir = divide_dirs_and_nfiles(dir_entry);
q_sort(dir_entry, so, sm, 1, last_dir-1);
if( (*(*dir_entry))->Info->file_count > last_dir)
q_sort(dir_entry, so, sm, last_dir, (*(*dir_entry))->Info->file_count-1);
} /* }}} */
/* version_sort {{{ */
void
q_sort(Dir_Entry ***dir_entry, int so, int sm, int l, int r)
{
int left = l, right = r;
Dir_Entry *center = (*(*dir_entry+( (left + right) >> 1)));
do
{
switch(so)
{
case NAME_SORT:
if(sm == ASCENDING)
{
while(strcasecmp( (*(*dir_entry+left))->name, center->name)
< 0 && left < r) left++;
while(strcasecmp( (*(*dir_entry+right))->name, center->name)
> 0 && right > l) right--;
}
else // DESCENDING
{
while(strcasecmp( (*(*dir_entry+left))->name, center->name)
> 0 && left < r) left++;
while(strcasecmp( (*(*dir_entry+right))->name, center->name)
< 0 && right > l) right--;
}
break;
case SIZE_SORT:
if(sm == ASCENDING)
{
while((left < r) &&
( (*(*dir_entry+left))->size < center->size)) left++;
while((right > l) &&
( (*(*dir_entry+right))->size > center->size)) right--;
}
else // DESCENDING
{
while((left < r) &&
( (*(*dir_entry+left))->size > center->size)) left++;
while((right > l) &&
( (*(*dir_entry+right))->size < center->size)) right--;
}
break;
case MTIME_SORT:
if(sm == ASCENDING)
{
while((left < r) &&
( (*(*dir_entry+left))->mtime < center->mtime)) left++;
while((right > l) &&
( (*(*dir_entry+right))->mtime > center->mtime)) right--;
}
else // DESCENDING
{
while((left < r) &&
( (*(*dir_entry+left))->mtime > center->mtime)) left++;
while((right > l) &&
( (*(*dir_entry+right))->mtime < center->mtime)) right--;
}
break;
case ATIME_SORT:
if(sm == ASCENDING)
{
while((left < r) &&
( (*(*dir_entry+left))->atime < center->atime)) left++;
while((right > l) &&
( (*(*dir_entry+right))->atime > center->atime)) right--;
}
else // DESCENDING
{
while((left < r) &&
( (*(*dir_entry+left))->atime > center->atime)) left++;
while((right > l) &&
( (*(*dir_entry+right))->atime < center->atime)) right--;
}
break;
case CTIME_SORT:
if(sm == ASCENDING)
{
while((left < r) &&
( (*(*dir_entry+left))->ctime < center->ctime)) left++;
while((right > l) &&
( (*(*dir_entry+right))->ctime > center->ctime)) right--;
}
else // DESCENDING
{
while((left < r) &&
( (*(*dir_entry+left))->ctime > center->ctime)) left++;
while((right > l) &&
( (*(*dir_entry+right))->ctime < center->ctime)) right--;
}
break;
}
if(left <= right)
{
swap_pointer(dir_entry, left, right);
left++, right--;
}
}
while(left <= right);
if(l < right) q_sort(dir_entry, so, sm, l, right);
if(r > left) q_sort(dir_entry, so, sm, left, r);
} /* }}} */