File: cyclic_array.h

package info (click to toggle)
indigo 1.4.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 48,936 kB
  • sloc: ansic: 332,816; cpp: 169,470; python: 20,033; java: 13,701; cs: 9,979; asm: 8,475; sql: 6,743; xml: 6,354; javascript: 1,245; sh: 555; php: 506; makefile: 54
file content (87 lines) | stat: -rw-r--r-- 2,364 bytes parent folder | download
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
/****************************************************************************
 * Copyright (C) from 2009 to Present EPAM Systems.
 *
 * This file is part of Indigo toolkit.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 ***************************************************************************/

#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
    };

} // namespace indigo

#endif // __cyclic_array_h__