Algorithm.h
1 /* Copyright (C) 2010-2016 Marc Boris Duerner
2  Copyright (C) 2006-2010 by Aloysius Indrayanto
3 
4  This library is free software; you can redistribute it and/or
5  modify it under the terms of the GNU Lesser General Public
6  License as published by the Free Software Foundation; either
7  version 2.1 of the License, or (at your option) any later version.
8 
9  As a special exception, you may use this file as part of a free
10  software library without restriction. Specifically, if other files
11  instantiate templates or use macros or inline functions from this
12  file, or you compile this file and link it with other files to
13  produce an executable, this file does not by itself cause the
14  resulting executable to be covered by the GNU General Public
15  License. This exception does not however invalidate any other
16  reasons why the executable file might be covered by the GNU Library
17  General Public License.
18 
19  This library is distributed in the hope that it will be useful,
20  but WITHOUT ANY WARRANTY; without even the implied warranty of
21  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
22  Lesser General Public License for more details.
23 
24  You should have received a copy of the GNU Lesser General Public
25  License along with this library; if not, write to the Free Software
26  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
27  02110-1301 USA
28 */
29 
30 #ifndef PT_GFX_ALGORITHM_H
31 #define PT_GFX_ALGORITHM_H
32 
33 #include <Pt/Gfx/Api.h>
34 
35 namespace Pt {
36 
37 namespace Gfx {
38 
39 template<typename InputIteratorT, typename OutputIteratorT>
40 void copy(InputIteratorT from, InputIteratorT fromEnd, OutputIteratorT to)
41 {
42  for( ; from != fromEnd; ++from, ++to)
43  *to = *from;
44 }
45 
46 
47 template<typename OutputIteratorT, typename T>
48 void fill(OutputIteratorT to, OutputIteratorT toEnd, const T& value)
49 {
50  for (; to != toEnd; ++to)
51  *to = value;
52 }
53 
54 
55 template<typename InputIteratorT, typename OutputIteratorT, typename OperationT>
56 void transform(InputIteratorT from, InputIteratorT fromEnd,
57  OutputIteratorT to, OperationT op)
58 {
59  for( ; from != fromEnd; ++from, ++to)
60  op(*to, *from);
61 }
62 
63 
64 template<typename IteratorT, typename OperationT>
65 void transform(IteratorT begin, IteratorT end, OperationT op)
66 {
67  for( ; begin != end; ++begin)
68  op(*begin);
69 }
70 
71 } // namespace
72 
73 } // namespace
74 
75 #endif