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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* 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 "sal/config.h"
#include <cassert>
#include <map>
#include <set>
#include "com/sun/star/uno/Reference.hxx"
#include "com/sun/star/uno/RuntimeException.hpp"
#include "com/sun/star/uno/XInterface.hpp"
#include "rtl/ustring.h"
#include "rtl/ustring.hxx"
#include "sal/types.h"
#include "data.hxx"
#include "partial.hxx"
namespace configmgr {
namespace {
namespace css = com::sun::star;
bool parseSegment(
rtl::OUString const & path, sal_Int32 * index, rtl::OUString * segment)
{
assert(
index != 0 && *index >= 0 && *index <= path.getLength() &&
segment != 0);
if (path[(*index)++] == '/') {
rtl::OUString name;
bool setElement;
rtl::OUString templateName;
*index = Data::parseSegment(
path, *index, &name, &setElement, &templateName);
if (*index != -1) {
*segment = Data::createSegment(templateName, name);
return *index == path.getLength();
}
}
throw css::uno::RuntimeException(
rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) + path,
css::uno::Reference< css::uno::XInterface >());
}
}
Partial::Partial(
std::set< rtl::OUString > const & includedPaths,
std::set< rtl::OUString > const & excludedPaths)
{
// The Partial::Node tree built up here encodes the following information:
// * Inner node, startInclude: an include starts here that contains excluded
// sub-trees
// * Inner node, !startInclude: contains in-/excluded sub-trees
// * Leaf node, startInclude: an include starts here
// * Leaf node, !startInclude: an exclude starts here
for (std::set< rtl::OUString >::const_iterator i(includedPaths.begin());
i != includedPaths.end(); ++i)
{
sal_Int32 n = 0;
for (Node * p = &root_;;) {
rtl::OUString seg;
bool end = parseSegment(*i, &n, &seg);
p = &p->children[seg];
if (p->startInclude) {
break;
}
if (end) {
p->children.clear();
p->startInclude = true;
break;
}
}
}
for (std::set< rtl::OUString >::const_iterator i(excludedPaths.begin());
i != excludedPaths.end(); ++i)
{
sal_Int32 n = 0;
for (Node * p = &root_;;) {
rtl::OUString seg;
bool end = parseSegment(*i, &n, &seg);
if (end) {
p->children[seg] = Node();
break;
}
Node::Children::iterator j(p->children.find(seg));
if (j == p->children.end()) {
break;
}
p = &j->second;
}
}
}
Partial::~Partial() {}
Partial::Containment Partial::contains(Path const & path) const {
//TODO: For set elements, the segment names recorded in the node tree need
// not match the corresponding path segments, so this function can fail.
// * If path ends at a leaf node or goes past a leaf node:
// ** If that leaf node is startInclude: => CONTAINS_NODE
// ** If that leaf node is !startInclude: => CONTAINS_NOT
// * If path ends at inner node:
// ** If there is some startInclude along its trace: => CONTAINS_NODE
// ** If there is no startInclude along its trace: => CONTAINS_SUBNODES
Node const * p = &root_;
bool includes = false;
for (Path::const_iterator i(path.begin()); i != path.end(); ++i) {
Node::Children::const_iterator j(p->children.find(*i));
if (j == p->children.end()) {
return p->startInclude ? CONTAINS_NODE : CONTAINS_NOT;
}
p = &j->second;
includes |= p->startInclude;
}
return p->children.empty() && !p->startInclude
? CONTAINS_NOT
: includes ? CONTAINS_NODE : CONTAINS_SUBNODES;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
