aboutsummaryrefslogtreecommitdiff
path: root/paludis/use_requirements.cc
blob: fe36355247d17c556c74054b9a974c219a361f4d (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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
/* vim: set sw=4 sts=4 et foldmethod=syntax : */

/*
 * Copyright (c) 2007 Ciaran McCreesh
 *
 * 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/use_requirements.hh>
#include <paludis/environment.hh>
#include <paludis/util/private_implementation_pattern-impl.hh>
#include <paludis/util/tr1_memory.hh>
#include <paludis/util/wrapped_forward_iterator-impl.hh>
#include <paludis/util/visitor-impl.hh>
#include <functional>
#include <list>

using namespace paludis;

template class ConstVisitor<UseRequirementVisitorTypes>;
template class ConstAcceptInterface<UseRequirementVisitorTypes>;

template class ConstAcceptInterfaceVisitsThis<UseRequirementVisitorTypes, EnabledUseRequirement>;
template class ConstAcceptInterfaceVisitsThis<UseRequirementVisitorTypes, DisabledUseRequirement>;
template class ConstAcceptInterfaceVisitsThis<UseRequirementVisitorTypes, EqualUseRequirement>;
template class ConstAcceptInterfaceVisitsThis<UseRequirementVisitorTypes, NotEqualUseRequirement>;

template class Visits<const EnabledUseRequirement>;
template class Visits<const DisabledUseRequirement>;
template class Visits<const EqualUseRequirement>;
template class Visits<const NotEqualUseRequirement>;

template class WrappedForwardIterator<UseRequirements::ConstIteratorTag, const tr1::shared_ptr<const UseRequirement> >;

namespace paludis
{
    template <>
    struct Implementation<UseRequirements>
    {
        std::list<tr1::shared_ptr<const UseRequirement> > reqs;
    };
}

UseRequirements::UseRequirements() :
    PrivateImplementationPattern<UseRequirements>(new Implementation<UseRequirements>)
{
}

UseRequirements::UseRequirements(const UseRequirements & other) :
    PrivateImplementationPattern<UseRequirements>(new Implementation<UseRequirements>(*other._imp.operator-> ()))
{
}

UseRequirements::~UseRequirements()
{
}

UseRequirements::ConstIterator
UseRequirements::begin() const
{
    return ConstIterator(_imp->reqs.begin());
}

UseRequirements::ConstIterator
UseRequirements::end() const
{
    return ConstIterator(_imp->reqs.end());
}

UseRequirements::ConstIterator
UseRequirements::find(const UseFlagName & u) const
{
    using namespace tr1::placeholders;
    return ConstIterator(std::find_if(_imp->reqs.begin(), _imp->reqs.end(),
                tr1::bind(std::equal_to<UseFlagName>(), u, tr1::bind(tr1::mem_fn(&UseRequirement::flag), _1))));
}

void
UseRequirements::insert(const tr1::shared_ptr<const UseRequirement> & req)
{
    _imp->reqs.push_back(req);
}

bool
UseRequirements::empty() const
{
    return _imp->reqs.empty();
}

UseRequirement::UseRequirement(const UseFlagName & n) :
    _name(n)
{
}

UseRequirement::~UseRequirement()
{
}

EnabledUseRequirement::EnabledUseRequirement(const UseFlagName & n) :
    UseRequirement(n)
{
}

EnabledUseRequirement::~EnabledUseRequirement()
{
}

bool
EnabledUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return env->query_use(flag(), pkg);
}

DisabledUseRequirement::DisabledUseRequirement(const UseFlagName & n) :
    UseRequirement(n)
{
}

DisabledUseRequirement::~DisabledUseRequirement()
{
}

bool
DisabledUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return ! env->query_use(flag(), pkg);
}

ConditionalUseRequirement::ConditionalUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    UseRequirement(n),
    _id(i)
{
}

ConditionalUseRequirement::~ConditionalUseRequirement()
{
}

IfMineThenUseRequirement::IfMineThenUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    ConditionalUseRequirement(n, i)
{
}

IfMineThenUseRequirement::~IfMineThenUseRequirement()
{
}

bool
IfMineThenUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return ! env->query_use(flag(), *package_id()) || env->query_use(flag(), pkg);
}

IfNotMineThenUseRequirement::IfNotMineThenUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    ConditionalUseRequirement(n, i)
{
}

IfNotMineThenUseRequirement::~IfNotMineThenUseRequirement()
{
}

bool
IfNotMineThenUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return env->query_use(flag(), *package_id()) || env->query_use(flag(), pkg);
}

IfMineThenNotUseRequirement::IfMineThenNotUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    ConditionalUseRequirement(n, i)
{
}

IfMineThenNotUseRequirement::~IfMineThenNotUseRequirement()
{
}

bool
IfMineThenNotUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return ! env->query_use(flag(), *package_id()) || ! env->query_use(flag(), pkg);
}

IfNotMineThenNotUseRequirement::IfNotMineThenNotUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    ConditionalUseRequirement(n, i)
{
}

IfNotMineThenNotUseRequirement::~IfNotMineThenNotUseRequirement()
{
}

bool
IfNotMineThenNotUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return env->query_use(flag(), *package_id()) || ! env->query_use(flag(), pkg);
}

EqualUseRequirement::EqualUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    ConditionalUseRequirement(n, i)
{
}

EqualUseRequirement::~EqualUseRequirement()
{
}

bool
EqualUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return env->query_use(flag(), pkg) == env->query_use(flag(), *package_id());
}

NotEqualUseRequirement::NotEqualUseRequirement(const UseFlagName & n, const tr1::shared_ptr<const PackageID> & i) :
    ConditionalUseRequirement(n, i)
{
}

NotEqualUseRequirement::~NotEqualUseRequirement()
{
}

bool
NotEqualUseRequirement::satisfied_by(const Environment * const env, const PackageID & pkg) const
{
    return env->query_use(flag(), pkg) != env->query_use(flag(), *package_id());
}