blob: add18ceaa1eabd6f159e1e03ee2b73f0cb506423 (
plain)
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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include "precompiled_configmgr.hxx"
#include "sal/config.h"
#include "rtl/ustring.hxx"
#include "modifications.hxx"
#include "path.hxx"
namespace configmgr {
Modifications::Modifications() {}
Modifications::~Modifications() {}
void Modifications::add(Path const & path) {
Node * p = &root_;
bool wasPresent = false;
for (Path::const_iterator i(path.begin()); i != path.end(); ++i) {
Node::Children::iterator j(p->children.find(*i));
if (j == p->children.end()) {
if (wasPresent && p->children.empty()) {
return;
}
j = p->children.insert(Node::Children::value_type(*i, Node())).
first;
wasPresent = false;
} else {
wasPresent = true;
}
p = &j->second;
}
p->children.clear();
}
void Modifications::remove(Path const & path) {
OSL_ASSERT(!path.empty());
Node * p = &root_;
for (Path::const_iterator i(path.begin());;) {
Node::Children::iterator j(p->children.find(*i));
if (j == p->children.end()) {
break;
}
if (++i == path.end()) {
p->children.erase(j);
if (p->children.empty()) {
Path parent(path);
parent.pop_back();
remove(parent);
}
break;
}
p = &j->second;
}
}
Modifications::Node const & Modifications::getRoot() const {
return root_;
}
}
|
