blob: bd711f77a9cbe3771c0a1fa44eb85b45383c10e2 (
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <sal/config.h>
#include <cassert>
#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) {
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_;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
