1*b1cdbd2cSJim Jagielski /**************************************************************
2*b1cdbd2cSJim Jagielski *
3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one
4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file
5*b1cdbd2cSJim Jagielski * distributed with this work for additional information
6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file
7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the
8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance
9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at
10*b1cdbd2cSJim Jagielski *
11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0
12*b1cdbd2cSJim Jagielski *
13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing,
14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an
15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the
17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations
18*b1cdbd2cSJim Jagielski * under the License.
19*b1cdbd2cSJim Jagielski *
20*b1cdbd2cSJim Jagielski *************************************************************/
21*b1cdbd2cSJim Jagielski
22*b1cdbd2cSJim Jagielski
23*b1cdbd2cSJim Jagielski
24*b1cdbd2cSJim Jagielski #include "precompiled_configmgr.hxx"
25*b1cdbd2cSJim Jagielski #include "sal/config.h"
26*b1cdbd2cSJim Jagielski
27*b1cdbd2cSJim Jagielski #include <map>
28*b1cdbd2cSJim Jagielski #include <set>
29*b1cdbd2cSJim Jagielski
30*b1cdbd2cSJim Jagielski #include "com/sun/star/uno/Reference.hxx"
31*b1cdbd2cSJim Jagielski #include "com/sun/star/uno/RuntimeException.hpp"
32*b1cdbd2cSJim Jagielski #include "com/sun/star/uno/XInterface.hpp"
33*b1cdbd2cSJim Jagielski #include "osl/diagnose.h"
34*b1cdbd2cSJim Jagielski #include "rtl/ustring.h"
35*b1cdbd2cSJim Jagielski #include "rtl/ustring.hxx"
36*b1cdbd2cSJim Jagielski #include "sal/types.h"
37*b1cdbd2cSJim Jagielski
38*b1cdbd2cSJim Jagielski #include "data.hxx"
39*b1cdbd2cSJim Jagielski #include "partial.hxx"
40*b1cdbd2cSJim Jagielski
41*b1cdbd2cSJim Jagielski namespace configmgr {
42*b1cdbd2cSJim Jagielski
43*b1cdbd2cSJim Jagielski namespace {
44*b1cdbd2cSJim Jagielski
45*b1cdbd2cSJim Jagielski namespace css = com::sun::star;
46*b1cdbd2cSJim Jagielski
parseSegment(rtl::OUString const & path,sal_Int32 * index,rtl::OUString * segment)47*b1cdbd2cSJim Jagielski bool parseSegment(
48*b1cdbd2cSJim Jagielski rtl::OUString const & path, sal_Int32 * index, rtl::OUString * segment)
49*b1cdbd2cSJim Jagielski {
50*b1cdbd2cSJim Jagielski OSL_ASSERT(
51*b1cdbd2cSJim Jagielski index != 0 && *index >= 0 && *index <= path.getLength() &&
52*b1cdbd2cSJim Jagielski segment != 0);
53*b1cdbd2cSJim Jagielski if (path[(*index)++] == '/') {
54*b1cdbd2cSJim Jagielski rtl::OUString name;
55*b1cdbd2cSJim Jagielski bool setElement;
56*b1cdbd2cSJim Jagielski rtl::OUString templateName;
57*b1cdbd2cSJim Jagielski *index = Data::parseSegment(
58*b1cdbd2cSJim Jagielski path, *index, &name, &setElement, &templateName);
59*b1cdbd2cSJim Jagielski if (*index != -1) {
60*b1cdbd2cSJim Jagielski *segment = Data::createSegment(templateName, name);
61*b1cdbd2cSJim Jagielski return *index == path.getLength();
62*b1cdbd2cSJim Jagielski }
63*b1cdbd2cSJim Jagielski }
64*b1cdbd2cSJim Jagielski throw css::uno::RuntimeException(
65*b1cdbd2cSJim Jagielski rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) + path,
66*b1cdbd2cSJim Jagielski css::uno::Reference< css::uno::XInterface >());
67*b1cdbd2cSJim Jagielski }
68*b1cdbd2cSJim Jagielski
69*b1cdbd2cSJim Jagielski }
70*b1cdbd2cSJim Jagielski
Partial(std::set<rtl::OUString> const & includedPaths,std::set<rtl::OUString> const & excludedPaths)71*b1cdbd2cSJim Jagielski Partial::Partial(
72*b1cdbd2cSJim Jagielski std::set< rtl::OUString > const & includedPaths,
73*b1cdbd2cSJim Jagielski std::set< rtl::OUString > const & excludedPaths)
74*b1cdbd2cSJim Jagielski {
75*b1cdbd2cSJim Jagielski for (std::set< rtl::OUString >::const_iterator i(includedPaths.begin());
76*b1cdbd2cSJim Jagielski i != includedPaths.end(); ++i)
77*b1cdbd2cSJim Jagielski {
78*b1cdbd2cSJim Jagielski sal_Int32 n = 0;
79*b1cdbd2cSJim Jagielski for (Node * p = &root_;;) {
80*b1cdbd2cSJim Jagielski rtl::OUString seg;
81*b1cdbd2cSJim Jagielski bool end = parseSegment(*i, &n, &seg);
82*b1cdbd2cSJim Jagielski p = &p->children[seg];
83*b1cdbd2cSJim Jagielski if (p->startInclude) {
84*b1cdbd2cSJim Jagielski break;
85*b1cdbd2cSJim Jagielski }
86*b1cdbd2cSJim Jagielski if (end) {
87*b1cdbd2cSJim Jagielski p->children.clear();
88*b1cdbd2cSJim Jagielski p->startInclude = true;
89*b1cdbd2cSJim Jagielski break;
90*b1cdbd2cSJim Jagielski }
91*b1cdbd2cSJim Jagielski }
92*b1cdbd2cSJim Jagielski }
93*b1cdbd2cSJim Jagielski for (std::set< rtl::OUString >::const_iterator i(excludedPaths.begin());
94*b1cdbd2cSJim Jagielski i != excludedPaths.end(); ++i)
95*b1cdbd2cSJim Jagielski {
96*b1cdbd2cSJim Jagielski sal_Int32 n = 0;
97*b1cdbd2cSJim Jagielski for (Node * p = &root_;;) {
98*b1cdbd2cSJim Jagielski rtl::OUString seg;
99*b1cdbd2cSJim Jagielski bool end = parseSegment(*i, &n, &seg);
100*b1cdbd2cSJim Jagielski if (end) {
101*b1cdbd2cSJim Jagielski p->children[seg].clear();
102*b1cdbd2cSJim Jagielski break;
103*b1cdbd2cSJim Jagielski }
104*b1cdbd2cSJim Jagielski Node::Children::iterator j(p->children.find(seg));
105*b1cdbd2cSJim Jagielski if (j == p->children.end()) {
106*b1cdbd2cSJim Jagielski break;
107*b1cdbd2cSJim Jagielski }
108*b1cdbd2cSJim Jagielski p = &j->second;
109*b1cdbd2cSJim Jagielski }
110*b1cdbd2cSJim Jagielski }
111*b1cdbd2cSJim Jagielski }
112*b1cdbd2cSJim Jagielski
~Partial()113*b1cdbd2cSJim Jagielski Partial::~Partial() {}
114*b1cdbd2cSJim Jagielski
contains(Path const & path) const115*b1cdbd2cSJim Jagielski Partial::Containment Partial::contains(Path const & path) const {
116*b1cdbd2cSJim Jagielski //TODO: For set elements, the segment names recorded in the node tree need
117*b1cdbd2cSJim Jagielski // not match the corresponding path segments, so this function can fail.
118*b1cdbd2cSJim Jagielski Node const * p = &root_;
119*b1cdbd2cSJim Jagielski bool includes = false;
120*b1cdbd2cSJim Jagielski for (Path::const_iterator i(path.begin()); i != path.end(); ++i) {
121*b1cdbd2cSJim Jagielski Node::Children::const_iterator j(p->children.find(*i));
122*b1cdbd2cSJim Jagielski if ( j == p->children.end() )
123*b1cdbd2cSJim Jagielski {
124*b1cdbd2cSJim Jagielski break;
125*b1cdbd2cSJim Jagielski }
126*b1cdbd2cSJim Jagielski p = &j->second;
127*b1cdbd2cSJim Jagielski includes |= p->startInclude;
128*b1cdbd2cSJim Jagielski }
129*b1cdbd2cSJim Jagielski return ( ( p->children.empty() || p == &root_ )
130*b1cdbd2cSJim Jagielski && !p->startInclude )
131*b1cdbd2cSJim Jagielski ? CONTAINS_NOT
132*b1cdbd2cSJim Jagielski : ( includes ? CONTAINS_NODE : CONTAINS_SUBNODES );
133*b1cdbd2cSJim Jagielski }
134*b1cdbd2cSJim Jagielski
135*b1cdbd2cSJim Jagielski }
136