Line data    Source code

       1             : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
       2             : /*
       3             :  * This file is part of the LibreOffice project.
       4             :  *
       5             :  * This Source Code Form is subject to the terms of the Mozilla Public
       6             :  * License, v. 2.0. If a copy of the MPL was not distributed with this
       7             :  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
       8             :  *
       9             :  * This file incorporates work covered by the following license notice:
      10             :  *
      11             :  *   Licensed to the Apache Software Foundation (ASF) under one or more
      12             :  *   contributor license agreements. See the NOTICE file distributed
      13             :  *   with this work for additional information regarding copyright
      14             :  *   ownership. The ASF licenses this file to you under the Apache
      15             :  *   License, Version 2.0 (the "License"); you may not use this file
      16             :  *   except in compliance with the License. You may obtain a copy of
      17             :  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
      18             :  */
      19             : 
      20             : #include <sal/config.h>
      21             : 
      22             : #include <cassert>
      23             : #include <map>
      24             : #include <set>
      25             : 
      26             : #include <com/sun/star/uno/Reference.hxx>
      27             : #include <com/sun/star/uno/RuntimeException.hpp>
      28             : #include <com/sun/star/uno/XInterface.hpp>
      29             : #include <rtl/ustring.h>
      30             : #include <rtl/ustring.hxx>
      31             : #include <sal/types.h>
      32             : 
      33             : #include "data.hxx"
      34             : #include "partial.hxx"
      35             : 
      36             : namespace configmgr {
      37             : 
      38             : namespace {
      39             : 
      40           0 : bool parseSegment(
      41             :     OUString const & path, sal_Int32 * index, OUString * segment)
      42             : {
      43             :     assert(
      44             :         index != 0 && *index >= 0 && *index <= path.getLength() &&
      45             :         segment != 0);
      46           0 :     if (path[(*index)++] == '/') {
      47           0 :         OUString name;
      48             :         bool setElement;
      49           0 :         OUString templateName;
      50             :         *index = Data::parseSegment(
      51           0 :             path, *index, &name, &setElement, &templateName);
      52           0 :         if (*index != -1) {
      53           0 :             *segment = Data::createSegment(templateName, name);
      54           0 :             return *index == path.getLength();
      55           0 :         }
      56             :     }
      57           0 :     throw css::uno::RuntimeException("bad path " + path);
      58             : }
      59             : 
      60             : }
      61             : 
      62           0 : Partial::Partial(
      63             :     std::set< OUString > const & includedPaths,
      64           0 :     std::set< OUString > const & excludedPaths)
      65             : {
      66             :     // The Partial::Node tree built up here encodes the following information:
      67             :     // * Inner node, startInclude: an include starts here that contains excluded
      68             :     //   sub-trees
      69             :     // * Inner node, !startInclude: contains in-/excluded sub-trees
      70             :     // * Leaf node, startInclude: an include starts here
      71             :     // * Leaf node, !startInclude: an exclude starts here
      72           0 :     for (std::set< OUString >::const_iterator i(includedPaths.begin());
      73           0 :          i != includedPaths.end(); ++i)
      74             :     {
      75           0 :         sal_Int32 n = 0;
      76           0 :         for (Node * p = &root_;;) {
      77           0 :             OUString seg;
      78           0 :             bool end = parseSegment(*i, &n, &seg);
      79           0 :             p = &p->children[seg];
      80           0 :             if (p->startInclude) {
      81           0 :                 break;
      82             :             }
      83           0 :             if (end) {
      84           0 :                 p->children.clear();
      85           0 :                 p->startInclude = true;
      86           0 :                 break;
      87             :             }
      88           0 :         }
      89             :     }
      90           0 :     for (std::set< OUString >::const_iterator i(excludedPaths.begin());
      91           0 :          i != excludedPaths.end(); ++i)
      92             :     {
      93           0 :         sal_Int32 n = 0;
      94           0 :         for (Node * p = &root_;;) {
      95           0 :             OUString seg;
      96           0 :             bool end = parseSegment(*i, &n, &seg);
      97           0 :             if (end) {
      98           0 :                 p->children[seg].clear();
      99           0 :                 break;
     100             :             }
     101           0 :             Node::Children::iterator j(p->children.find(seg));
     102           0 :             if (j == p->children.end()) {
     103           0 :                 break;
     104             :             }
     105           0 :             p = &j->second;
     106           0 :         }
     107             :     }
     108           0 : }
     109             : 
     110           0 : Partial::~Partial() {}
     111             : 
     112           0 : Partial::Containment Partial::contains(Path const & path) const {
     113             :     //TODO: For set elements, the segment names recorded in the node tree need
     114             :     // not match the corresponding path segments, so this function can fail.
     115             : 
     116             :     // * If path ends at a leaf node or goes past a leaf node:
     117             :     // ** If that leaf node is startInclude: => CONTAINS_NODE
     118             :     // ** If that leaf node is !startInclude: => CONTAINS_NOT
     119             :     // * If path ends at inner node:
     120             :     // ** If there is some startInclude along its trace: => CONTAINS_NODE
     121             :     // ** If there is no startInclude along its trace: => CONTAINS_SUBNODES
     122           0 :     Node const * p = &root_;
     123           0 :     bool includes = false;
     124           0 :     for (Path::const_iterator i(path.begin()); i != path.end(); ++i) {
     125           0 :         Node::Children::const_iterator j(p->children.find(*i));
     126           0 :         if (j == p->children.end()) {
     127           0 :             return p->startInclude ? CONTAINS_NODE : CONTAINS_NOT;
     128             :         }
     129           0 :         p = &j->second;
     130           0 :         includes |= p->startInclude;
     131             :     }
     132           0 :     return p->children.empty() && !p->startInclude
     133             :         ? CONTAINS_NOT
     134           0 :         : includes ? CONTAINS_NODE : CONTAINS_SUBNODES;
     135             : }
     136             : 
     137             : }
     138             : 
     139             : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */