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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*/
#ifndef COMMON_ALGORITHM_H
#define COMMON_ALGORITHM_H
#include "common/scummsys.h"
namespace Common {
template<class In, class Out>
Out copy(In first, In last, Out dst) {
while (first != last)
*dst++ = *first++;
return dst;
}
template<class In, class Out>
Out copy_backward(In first, In last, Out dst) {
while (first != last)
*--dst = *--last;
return dst;
}
template<class In, class Out, class Op>
Out copy_if(In first, In last, Out dst, Op op) {
while (first != last) {
if (op(*first))
*dst++ = *first;
++first;
}
return dst;
}
// TODO: this is can be slower than memset for most normal data
// maybe specialize the template for char, short, int, long, long long
template<class In, class Value>
In set_to(In first, In last, Value val) {
while (first != last)
*first++ = val;
return first;
}
template<class In, class T>
In find(In first, In last, const T &v) {
while (first != last) {
if (*first == v)
return first;
++first;
}
return last;
}
template<class In, class Pred>
In find_if(In first, In last, Pred p) {
while (first != last) {
if (p(*first))
return first;
++first;
}
return last;
}
template<class In, class Op>
Op for_each(In first, In last, Op f) {
while (first != last) f(*first++);
return f;
}
// Simple sort function, modelled after std::sort.
// Use it like this: sort(container.begin(), container.end()).
// Also work on plain old int arrays etc.
template<class T>
void sort(T first, T last) {
if (first == last)
return;
// Simple selection sort
T i(first);
for (; i != last; ++i) {
T minElem(i);
T j(i);
++j;
for (; j != last; ++j)
if (*j < *minElem)
minElem = j;
if (minElem != i)
SWAP(*minElem, *i);
}
}
} // end of namespace Common
#endif
|
