aboutsummaryrefslogtreecommitdiff
path: root/paludis/partitioning.cc
blob: afb3a0d06d2370c4aca692699ee77bf7b54f3a23 (plain)
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
/* vim: set sw=4 sts=4 et foldmethod=syntax : */

/*
 * Copyright (c) 2013 Saleem Abdulrasool <compnerd@compnerd.org>
 *
 * This file is part of the Paludis package manager. Paludis is free software;
 * you can redistribute it and/or modify it under the terms of the GNU General
 * Public License version 2, as published by the Free Software Foundation.
 *
 * Paludis is distributed in the hope that it will be useful, but WITHOUT ANY
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
 * Place, Suite 330, Boston, MA  02111-1307  USA
 */

#include <paludis/name.hh>
#include <paludis/partitioning.hh>
#include <paludis/util/pimp-impl.hh>

#include <map>
#include <utility>
#include <algorithm>

using namespace paludis;

namespace paludis
{
    template <>
    struct Imp<Partitioning>
    {
        std::vector<std::pair<FSPath, PartName>> parts;
    };
}

Partitioning::Partitioning() :
    _imp()
{
}

Partitioning::~Partitioning() = default;

void
Partitioning::mark(const std::vector<FSPath> & paths, const PartName & name)
{
    for (auto path = paths.begin(), path_end = paths.end();
         path != path_end; ++path)
        _imp->parts.push_back(std::make_pair(*path, name));
}

PartName
Partitioning::classify(const FSPath & path) const
{
    for (auto part = _imp->parts.rbegin(), end = _imp->parts.rend();
         part != end; ++part)
        if (path.starts_with(part->first))
            return part->second;

    return PartName("");
}

bool
Partitioning::is_partitioned(const FSPath & path) const
{
    for (auto part = _imp->parts.rbegin(), end = _imp->parts.rend();
            part != end; ++part)
        if (part->first.starts_with(path) && ! part->second.value().empty())
            return true;
    return false;
}