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
|
/* This file is part of Strigi Desktop Search
*
* Copyright (C) 2006,2009 Jos van den Oever <jos@vandenoever.info>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "archiveentrycache.h"
#include <iostream>
using namespace std;
ArchiveEntryCache::SubEntry::~SubEntry() {
SubEntryMap::iterator i;
for (i=entries.begin(); i!=entries.end(); ++i) {
delete i->second;
}
}
map<string, ArchiveEntryCache::RootSubEntry*>::const_iterator
ArchiveEntryCache::findRootEntry(const string& url) const {
string n(url);
size_t p = n.size();
do {
map<string, RootSubEntry*>::const_iterator i = cache.find(n);
if (i != cache.end()) {
// the root entry is in the cache - we're done
return i;
}
// remove the last element in the path, and look for that
p = n.rfind('/');
if (p != string::npos) {
n.resize(p);
}
} while (p != string::npos);
// couldn't find it
return cache.end();
}
/**
* Find the entry corresponding to @p url.
**/
const ArchiveEntryCache::SubEntry*
ArchiveEntryCache::findEntry(const string& url) const {
// find the root entry that should contain the wanted entry
map<string, RootSubEntry*>::const_iterator ei = findRootEntry(url);
if (ei == cache.end()) return 0; // no root could be find
if (ei->first == url) {
// the requested entry is a root entry: we are done
return ei->second;
}
return ei->second->findEntry(ei->first, url);
}
const ArchiveEntryCache::SubEntry*
ArchiveEntryCache::RootSubEntry::findEntry(const std::string& rootpath,
const std::string& url) const {
// use the path components as keys to find the entry
const SubEntry* e = this;
size_t p = rootpath.length();
string name;
do {
size_t np = url.find('/', p+1);
if (np == string::npos) {
name.assign(url, p+1, url.size());
} else {
name.assign(url, p+1, np-p-1);
}
SubEntryMap::const_iterator i = e->entries.find(name);
if (i == e->entries.end()) {
e = 0;
} else {
e = i->second;
p = np;
}
if (p == url.length()) {
return e;
}
} while(e && p != string::npos);
return e;
}
|
