1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
3 * This file is part of the LibreOffice project.
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/.
9 * This file incorporates work covered by the following license notice:
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 .
22 #include <sal/config.h>
25 #include <boost/unordered_map.hpp>
27 #include <rtl/ustring.hxx>
33 enum Containment
{ CONTAINS_NOT
, CONTAINS_SUBNODES
, CONTAINS_NODE
};
36 css::uno::Sequence
< OUString
> const & includedPaths
,
37 css::uno::Sequence
< OUString
> const & excludedPaths
);
41 Containment
contains(std::vector
<OUString
> const & path
) const;
44 Partial(const Partial
&) = delete;
45 Partial
& operator=(const Partial
&) = delete;
48 typedef boost::unordered_map
< OUString
, Node
, OUStringHash
> Children
;
50 Node(): startInclude(false) {}
51 void clear() { startInclude
=false; children
.clear(); }
62 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */