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
|
inline int cmp(const char *a, bool a_isdir, const char *b, bool b_isdir)
{
// oh... directory sort doesn't matter since we write out dir- and filenames seperately
//if (a_isdir && !b_isdir) return -1;
//if (b_isdir && !a_isdir) return +1;
return strcmp(a, b);
}
struct TreeNode
{
unsigned int dir_id; // directory ID in case of directory entry
const char *name; // file or directory name
TreeNode *directory; // nonzero indicates directory. first directory node is a dummy
TreeNode *prev, *next; // linked list
TreeNode()
{
dir_id = 0;
name = "";
directory = 0;
prev = next = 0;
}
// new entry in same directory
TreeNode *New(const char *name, bool isdir)
{
TreeNode *newNode = new TreeNode();
newNode->name = strdup(name);
TreeNode *node = this;
if (cmp(name, isdir, node->name, node->dir_id) < 0) // prev
{
while (cmp(name, isdir, node->name, node->dir_id) < 0)
{
if (node->prev)
node = node->prev;
else
break; // insert after dummy node
}
}
else
{
while (node->next && (cmp(name, isdir, node->next->name, node->next->dir_id) >= 0))
{
node = node->next;
}
}
// insert after current node
newNode->prev = node;
newNode->next = node->next;
if (node->next) node->next->prev = newNode;
node->next = newNode;
return newNode;
}
};
TreeNode *ReadDirectory(TreeNode *node, char *path);
|
