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
|
/*
* Copyright (C) 2001-2006 Jacek Sieka, arnetheduck on gmail point com
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#if !defined(DIRECTORY_LISTING_H)
#define DIRECTORY_LISTING_H
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include "User.h"
#include "FastAlloc.h"
#include "MerkleTree.h"
class ListLoader;
class DirectoryListing
{
public:
class Directory;
class File : public FastAlloc<File> {
public:
typedef File* Ptr;
struct FileSort {
bool operator()(const Ptr& a, const Ptr& b) const {
return Util::stricmp(a->getName().c_str(), b->getName().c_str()) < 0;
}
};
typedef vector<Ptr> List;
typedef List::iterator Iter;
File(Directory* aDir, const string& aName, int64_t aSize, const string& aTTH) throw() :
name(aName), size(aSize), parent(aDir), tthRoot(new TTHValue(aTTH)), adls(false)
{
}
File(Directory* aDir, const string& aName, int64_t aSize) throw() :
name(aName), size(aSize), parent(aDir), tthRoot(NULL), adls(false)
{
}
File(const File& rhs, bool _adls = false) : name(rhs.name), size(rhs.size), parent(rhs.parent), tthRoot(rhs.tthRoot == NULL ? NULL : new TTHValue(*rhs.tthRoot)), adls(_adls)
{
}
File& operator=(const File& rhs) {
name = rhs.name; size = rhs.size; parent = rhs.parent; tthRoot = rhs.tthRoot ? new TTHValue(*rhs.tthRoot) : NULL;
return *this;
}
~File() {
delete tthRoot;
}
GETSET(string, name, Name);
GETSET(int64_t, size, Size);
GETSET(Directory*, parent, Parent);
GETSET(TTHValue*, tthRoot, TTH);
GETSET(bool, adls, Adls);
};
class Directory : public FastAlloc<Directory> {
public:
typedef Directory* Ptr;
struct DirSort {
bool operator()(const Ptr& a, const Ptr& b) const {
return Util::stricmp(a->getName().c_str(), b->getName().c_str()) < 0;
}
};
typedef vector<Ptr> List;
typedef List::iterator Iter;
List directories;
File::List files;
Directory(Directory* aParent, const string& aName, bool _adls, bool aComplete)
: name(aName), parent(aParent), adls(_adls), complete(aComplete) { }
virtual ~Directory() {
for_each(directories.begin(), directories.end(), DeleteFunction());
for_each(files.begin(), files.end(), DeleteFunction());
}
size_t getTotalFileCount(bool adls = false);
int64_t getTotalSize(bool adls = false);
void filterList(DirectoryListing& dirList);
void filterList(HASH_SET_X(TTHValue, TTHValue::Hash, equal_to<TTHValue>, less<TTHValue>)& l);
void getHashList(HASH_SET_X(TTHValue, TTHValue::Hash, equal_to<TTHValue>, less<TTHValue>)& l);
size_t getFileCount() { return files.size(); }
int64_t getSize() {
int64_t x = 0;
for(File::Iter i = files.begin(); i != files.end(); ++i) {
x+=(*i)->getSize();
}
return x;
}
GETSET(string, name, Name);
GETSET(Directory*, parent, Parent);
GETSET(bool, adls, Adls);
GETSET(bool, complete, Complete);
private:
Directory(const Directory&);
Directory& operator=(const Directory&);
};
class AdlDirectory : public Directory {
public:
AdlDirectory(const string& aFullPath, Directory* aParent, const string& aName) : Directory(aParent, aName, true, true), fullPath(aFullPath) { }
GETSET(string, fullPath, FullPath);
};
DirectoryListing(const User::Ptr& aUser) : user(aUser), utf8(false), root(new Directory(NULL, Util::emptyString, false, false)) {
}
~DirectoryListing() {
delete root;
}
void loadFile(const string& name);
void load(const string& i);
string loadXML(const string& xml, bool updating);
void download(const string& aDir, const string& aTarget, bool highPrio);
void download(Directory* aDir, const string& aTarget, bool highPrio);
void download(File* aFile, const string& aTarget, bool view, bool highPrio);
string getPath(const Directory* d) const;
string getPath(const File* f) const { return getPath(f->getParent()); }
int64_t getTotalSize(bool adls = false) { return root->getTotalSize(adls); }
size_t getTotalFileCount(bool adls = false) { return root->getTotalFileCount(adls); }
const Directory* getRoot() const { return root; }
Directory* getRoot() { return root; }
static User::Ptr getUserFromFilename(const string& fileName);
GETSET(User::Ptr, user, User);
GETSET(bool, utf8, Utf8);
private:
friend class ListLoader;
DirectoryListing(const DirectoryListing&);
DirectoryListing& operator=(const DirectoryListing&);
Directory* root;
Directory* find(const string& aName, Directory* current);
};
inline bool operator==(DirectoryListing::Directory::Ptr a, const string& b) { return Util::stricmp(a->getName(), b) == 0; }
inline bool operator==(DirectoryListing::File::Ptr a, const string& b) { return Util::stricmp(a->getName(), b) == 0; }
#endif // !defined(DIRECTORY_LISTING_H)
|
