aboutsummaryrefslogtreecommitdiff
path: root/paludis/util/collection_concrete.hh
blob: c5d560ea392c208c727f13c62f397b92a98974ca (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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
/* vim: set sw=4 sts=4 et foldmethod=syntax : */

/*
 * Copyright (c) 2005, 2006, 2007 Ciaran McCreesh <ciaranm@ciaranm.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
 */

#ifndef PALUDIS_GUARD_PALUDIS_UTIL_COLLECTION_CONCRETE_HH
#define PALUDIS_GUARD_PALUDIS_UTIL_COLLECTION_CONCRETE_HH 1

#include <paludis/util/collection.hh>
#include <list>
#include <set>
#include <map>
#include <algorithm>

/** \file
 * Concrete implementations for the collection classes.
 *
 * Do not include this file in other headers if possible. It pulls in big
 * STL things, slowing down compilation.
 *
 * \ingroup grpcollections
 */

namespace paludis
{
    /**
     * Concrete implementation for a SequentialCollection.
     *
     * \see SequentialCollection
     * \ingroup grpcollections
     * \nosubgrouping
     */
    template <typename T_>
    class PALUDIS_VISIBLE SequentialCollection<T_>::Concrete :
        public SequentialCollection<T_>
    {
        private:
            std::list<T_> _items;

        public:
            ///\name Basic operations
            ///\{

            Concrete() :
                SequentialCollection()
            {
            }

            virtual ~Concrete()
            {
            }

            ///\}

            virtual Iterator begin() const
            {
                return Iterator(_items.begin());
            }

            virtual Iterator end() const
            {
                return Iterator(_items.end());
            }

            virtual Iterator last() const
            {
                return Iterator(_items.begin() == _items.end() ? _items.end() : --(_items.end()));
            }

            virtual Iterator find(const T_ & v) const
            {
                return Iterator(std::find(_items.begin(), _items.end(), v));
            }

            virtual ReverseIterator rbegin() const
            {
                return ReverseIterator(_items.rbegin());
            }

            virtual ReverseIterator rend() const
            {
                return ReverseIterator(_items.rend());
            }

            virtual bool append(T_ v)
            {
                if (end() != find(v))
                    return false;

                _items.push_back(v);
                return true;
            }

            void push_back(const T_ & v)
            {
                if (end() == find(v))
                    _items.push_back(v);
            }

            virtual bool empty() const
            {
                return _items.empty();
            }

            ///\name Extra functions
            ///\{

            template <typename C_>
            void sort(const C_ & t)
            {
                _items.sort(t);
            }

            //\}

            ///\name Pointer types
            ///\{

            typedef CountedPtr<Concrete, count_policy::InternalCountTag> ConstPointer;
            typedef CountedPtr<Concrete, count_policy::InternalCountTag> Pointer;

            ///\}
    };

    /**
     * Concrete implementation for a SortedCollection.
     *
     * \see SortedCollection
     * \ingroup grpcollections
     * \nosubgrouping
     */
    template <typename T_, typename C_>
    class PALUDIS_VISIBLE SortedCollection<T_, C_>::Concrete :
        public SortedCollection<T_, C_>
    {
        private:
            std::set<T_, C_> _items;

        public:
            ///\name Basic operations
            ///\{

            Concrete()
            {
            }

            virtual ~Concrete()
            {
            }

            ///\}

            virtual Iterator begin() const
            {
                return Iterator(_items.begin());
            }

            virtual Iterator end() const
            {
                return Iterator(_items.end());
            }

            virtual ReverseIterator rbegin() const
            {
                return ReverseIterator(_items.rbegin());
            }

            virtual ReverseIterator rend() const
            {
                return ReverseIterator(_items.rend());
            }

            virtual Iterator last() const
            {
                typename std::set<T_, C_>::const_iterator result(_items.end());
                if (result != _items.begin())
                    --result;
                return Iterator(result);
            }

            virtual Iterator find(const T_ & v) const
            {
                return Iterator(_items.find(v));
            }

            virtual int count(const T_ & v) const
            {
                return _items.count(v);
            }

            virtual bool insert(const T_ & v)
            {
                return _items.insert(v).second;
            }

            virtual bool erase(const T_ & v)
            {
                return 0 != _items.erase(v);
            }

            virtual bool merge(typename SortedCollection<T_, C_>::ConstPointer o)
            {
                bool result(true);
                Iterator o_begin(o->begin()), o_end(o->end());
                for ( ; o_begin != o_end ; ++o_begin)
                    result &= insert(*o_begin);
                return result;
            }

            virtual Inserter inserter()
            {
                return Inserter(std::inserter(_items, _items.begin()));
            }

            virtual bool empty() const
            {
                return _items.empty();
            }

            virtual unsigned size() const
            {
                return _items.size();
            }
    };

    /**
     * Concrete implementation for an AssociativeCollection.
     *
     * \see AssociativeCollection
     * \ingroup grpcollections
     * \nosubgrouping
     */
    template <typename K_, typename V_>
    class PALUDIS_VISIBLE AssociativeCollection<K_, V_>::Concrete :
        public AssociativeCollection<K_, V_>
    {
        private:
            std::map<K_, V_> _items;

        public:
            ///\name Basic operations
            ///\{

            Concrete()
            {
            }

            template <typename I_>
            Concrete(const I_ & b, const I_ & b_end) :
                _items(b, b_end)
            {
            }

            virtual ~Concrete()
            {
            }

            ///\}

            virtual Iterator begin() const
            {
                return Iterator(_items.begin());
            }

            virtual Iterator end() const
            {
                return Iterator(_items.end());
            }

            virtual Iterator find(const K_ & v) const
            {
                return Iterator(_items.find(v));
            }

            virtual bool insert(const K_ & k, const V_ & v)
            {
                return _items.insert(std::make_pair(k, v)).second;
            }

            virtual bool erase(const K_ & k)
            {
                return 0 != _items.erase(k);
            }

            virtual bool erase(const Iterator & i)
            {
                _items.erase(i->first);
                return true;
            }

            virtual bool empty() const
            {
                return _items.empty();
            }
    };
}

#endif