-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTree.cpp
More file actions
216 lines (175 loc) · 5.01 KB
/
Copy pathTree.cpp
File metadata and controls
216 lines (175 loc) · 5.01 KB
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
#include "Tree.h"
namespace kukdh1 {
bool TreeCompare(Tree *a, Tree *b) {
if (a->GetName().compare(b->GetName()) <= 0) {
return true;
}
return false;
}
Tree::Tree(TREE_TYPE type) {
pParent = NULL;
ttType = type;
hThis = NULL;
liCapacity.QuadPart = 0;
bAdded = FALSE;
}
Tree::~Tree() {
for (auto iter = vChildFiles.begin(); iter != vChildFiles.end(); iter++) {
delete (*iter);
}
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
delete (*iter);
}
}
void Tree::AddToTree(HWND hTree) {
if (bAdded) {
return;
}
if (ttType == TREE_TYPE_ROOT) {
hThis = AddTreeItem(hTree, NULL, TVI_ROOT, L"/", (LPARAM)this);
}
else if (pParent != NULL) {
std::wstring temp;
ConvertWidechar(sName, temp);
hThis = AddTreeItem(hTree, pParent->GetHandle(), TVI_LAST, (WCHAR *)temp.c_str(), (LPARAM)this);
}
bAdded = TRUE;
}
void Tree::AddChildsToTree(HWND hTree) {
if (ttType != TREE_TYPE_FILE) {
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
(*iter)->AddToTree(hTree);
}
for (auto iter = vChildFiles.begin(); iter != vChildFiles.end(); iter++) {
(*iter)->AddToTree(hTree);
}
}
}
void Tree::AddGrandchildsToTree(HWND hTree, LPVOID arg, std::function<void(LPVOID, size_t, size_t)> callback) {
if (ttType != TREE_TYPE_FILE) {
size_t stAll = 0;
size_t i = 0;
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
stAll += (*iter)->GetFileCount() + (*iter)->GetFolderCount();
}
callback(arg, i, stAll);
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
(*iter)->AddChildsToTree(hTree);
i += (*iter)->GetFileCount() + (*iter)->GetFolderCount();
callback(arg, i, stAll);
}
}
}
void Tree::SetFileInfo(Tree* pParent, std::string &name, FileInfo &fiFile) {
this->pParent = pParent;
fiFileInfo = fiFile;
sName = name;
ttType = TREE_TYPE_FILE;
}
void Tree::SetFolderInfo(Tree* pParent, std::string &name) {
this->pParent = pParent;
sName = name;
ttType = TREE_TYPE_FOLDER;
}
void Tree::AddChild(Tree *pChild) {
std::string insertString = pChild->GetName();
bool bInserted = false;
if (pChild->GetType() == TREE_TYPE_FILE) {
vChildFiles.push_back(pChild);
}
else {
vChildFolders.push_back(pChild);
}
}
void Tree::SortChild() {
// Can be parallelize
if (ttType != TREE_TYPE_FILE) {
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
(*iter)->SortChild();
}
std::sort(vChildFolders.begin(), vChildFolders.end(), TreeCompare);
std::sort(vChildFiles.begin(), vChildFiles.end(), TreeCompare);
}
}
LARGE_INTEGER Tree::UpdateCapacity() {
liCapacity.QuadPart = 0;
if (ttType == TREE_TYPE_FILE) {
liCapacity.QuadPart = fiFileInfo.uiOriginalSize;
}
else {
for (auto iter = vChildFiles.begin(); iter != vChildFiles.end(); iter++) {
liCapacity.QuadPart += (*iter)->UpdateCapacity().QuadPart;
}
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
liCapacity.QuadPart += (*iter)->UpdateCapacity().QuadPart;
}
}
return liCapacity;
}
Tree* Tree::GetChildFolderWithName(std::string name) {
Tree *ptr = NULL;
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
if ((*iter)->GetName().compare(name) == 0) {
ptr = (*iter);
break;
}
}
return ptr;
}
Tree::TREE_TYPE Tree::GetType() {
return ttType;
}
FileInfo Tree::GetFileInfo() {
return fiFileInfo;
}
HTREEITEM Tree::GetHandle() {
return hThis;
}
BOOL Tree::IsAdded() {
return bAdded;
}
BOOL Tree::IsChildAdded() {
if (ttType != TREE_TYPE_FILE) {
if (vChildFiles.size() > 0) {
return vChildFiles.at(0)->IsAdded();
}
else if (vChildFolders.size() > 0) {
return vChildFolders.at(0)->IsAdded();
}
}
return TRUE;
}
BOOL Tree::IsGrandchildAdded() {
if (ttType != TREE_TYPE_FILE) {
if (vChildFolders.size() > 0) {
return vChildFolders.at(0)->IsChildAdded();
}
}
return TRUE;
}
std::string Tree::GetName() {
return sName;
}
LARGE_INTEGER Tree::GetCapacity() {
return liCapacity;
}
size_t Tree::GetFileCount() {
return vChildFiles.size();
}
size_t Tree::GetFolderCount() {
return vChildFolders.size();
}
void Tree::GetFileList(std::vector<kukdh1::FileInfo> &vList) {
if (ttType == TREE_TYPE_FILE) {
vList.push_back(fiFileInfo);
}
else {
for (auto iter = vChildFolders.begin(); iter != vChildFolders.end(); iter++) {
(*iter)->GetFileList(vList);
}
for (auto iter = vChildFiles.begin(); iter != vChildFiles.end(); iter++) {
(*iter)->GetFileList(vList);
}
}
}
}