configmgr/source/modifications.cxx

   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
  24 #include <rtl/ustring.hxx>
  25
  26 #include "modifications.hxx"
  27
  28 namespace configmgr {
  29
  30 Modifications::Modifications() {}
  31
  32 Modifications::~Modifications() {}
  33
  34 void Modifications::add(std::vector<OUString> const & path) {
  35     Node * p = &root_;
  36     bool wasPresent = false;
  37     for (auto const& pathItem : path) {
  38         Node::Children::iterator j(p->children.find(pathItem));
  39         if (j == p->children.end()) {
  40             if (wasPresent && p->children.empty()) {
  41                 return;
  42             }
  43             j = p->children.emplace(pathItem, Node()).first;
  44             wasPresent = false;
  45         } else {
  46             wasPresent = true;
  47         }
  48         p = &j->second;
  49     }
  50     p->children.clear();
  51 }
  52
  53 void Modifications::remove(std::vector<OUString> const & path) {
  54     assert(!path.empty());
  55     Node * p = &root_;
  56     for (auto i(path.begin());;) {
  57         Node::Children::iterator j(p->children.find(*i));
  58         if (j == p->children.end()) {
  59             break;
  60         }
  61         if (++i == path.end()) {
  62             p->children.erase(j);
  63             if (p->children.empty()) {
  64                 std::vector<OUString> parent(path);
  65                 parent.pop_back();
  66                 remove(parent);
  67             }
  68             break;
  69         }
  70         p = &j->second;
  71     }
  72 }
  73
  74
  75 }
  76
  77 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */