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
|
/* -*- 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 <set>
#include <com/sun/star/uno/RuntimeException.hpp>
#include <com/sun/star/uno/Sequence.hxx>
#include <rtl/ustring.hxx>
#include <sal/types.h>
#include "data.hxx"
#include "partial.hxx"
namespace configmgr {
namespace {
bool parseSegment(
OUString const & path, sal_Int32 * index, OUString * segment)
{
assert(
index != nullptr && *index >= 0 && *index <= path.getLength() &&
segment != nullptr);
if (path[(*index)++] == '/') {
OUString name;
bool setElement;
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("bad path " + path);
}
}
Partial::Partial(
css::uno::Sequence< OUString > const & includedPaths,
css::uno::Sequence< 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 (auto const& includedPath : includedPaths)
{
sal_Int32 n = 0;
for (Node * p = &root_;;) {
OUString seg;
bool end = parseSegment(includedPath, &n, &seg);
p = !seg.isEmpty() ? &p->children[seg] : p;
if (p->startInclude) {
break;
}
if (end) {
p->children.clear();
p->startInclude = true;
break;
}
}
}
for (auto const& excludedPath : excludedPaths)
{
sal_Int32 n = 0;
for (Node * p = &root_;;) {
OUString seg;
bool end = parseSegment(excludedPath, &n, &seg);
if (end) {
p->children[seg].clear();
break;
}
Node::Children::iterator j(p->children.find(seg));
if (j == p->children.end()) {
break;
}
p = &j->second;
}
}
}
Partial::~Partial() {}
Partial::Containment Partial::contains(std::vector<OUString> 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 bIncludes = false;
for (auto const& elemPath : path)
{
Node::Children::const_iterator j(p->children.find(elemPath));
if (j == p->children.end()) {
return p->startInclude ? CONTAINS_NODE : CONTAINS_NOT;
}
p = &j->second;
bIncludes |= p->startInclude;
}
return p->children.empty() && !p->startInclude
? CONTAINS_NOT
: bIncludes ? CONTAINS_NODE : CONTAINS_SUBNODES;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
