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
|
/* vim: set sw=4 sts=4 et foldmethod=syntax : */
/*
* Copyright (c) 2007, 2008, 2009 Ciaran McCreesh
* Copyright (c) 2007 David Leverton
*
* 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_ITERATOR_FUNCS_HH
#define PALUDIS_GUARD_PALUDIS_UTIL_ITERATOR_FUNCS_HH 1
#include <iterator>
namespace paludis
{
using std::next;
/**
* Return a new iterator pointing to the item before i.
*
* \ingroup g_iterator
*/
template <typename T_>
T_ previous(const T_ & i)
{
T_ result(i);
return --result;
}
/**
* Return the distance from a to b, except if it is greater than n,
* in which case return n instead.
*
* \ingroup g_iterator
*/
template <typename T_>
std::size_t capped_distance(T_ a, const T_ & b, unsigned n)
{
std::size_t x(0);
while ((x < n) && (a != b))
{
++x;
++a;
}
return x;
}
}
#endif
|
