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
|
/****************************************************************************
* Copyright (C) 2009-2015 EPAM Systems
*
* This file is part of Indigo toolkit.
*
* This file may be distributed and/or modified under the terms of the
* GNU General Public License version 3 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
***************************************************************************/
#ifndef __cyclic_array_h__
#define __cyclic_array_h__
#include "base_cpp/array.h"
#include "base_cpp/exception.h"
namespace indigo {
DECL_EXCEPTION(CyclicArrayError);
// Cyclic array
template <typename T> struct CyclicArray
{
public:
DECL_TPL_ERROR(CyclicArrayError);
explicit CyclicArray (void)
{
_offset = 0;
}
void setSize (int max_size)
{
_array.resize(max_size);
}
void zeroFill (void)
{
_array.zerofill();
}
bool isInBound (int index) const
{
return index >= _offset && index < _offset + _array.size();
}
const T & operator [] (int index) const
{
int length = _array.size();
if (length == 0)
throw Error("Zero length");
int offset = index % _array.size();
return index >= 0 ? _array[offset] : _array[length + offset];
}
T & operator [] (int index)
{
int length = _array.size();
if (length == 0)
throw Error("Zero length");
int offset = index % _array.size();
return index >= 0 ? _array[offset] : _array[length + offset];
}
void setOffset (int offset)
{
_offset = offset;
}
protected:
Array<T> _array;
int _offset;
private:
CyclicArray (const CyclicArray &); // no implicit copy
};
}
#endif // __cyclic_array_h__
|
