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
|
/*
* Aethyra
* Copyright (C) 2004 The Mana World Development Team
*
* This file is part of Aethyra based on original code
* from The Mana World.
*
* 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
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef LOCKEDARRAY_H
#define LOCKEDARRAY_H
#include <algorithm>
/**
* A _very_ basic array class that allows simple iteration and jumps, keeping
* its currently selected entry and providing a mechanism to lock this
* position. Anyone can unlock it though, so its your job to use it the right
* way ;)
*/
template<class T>
class LockedArray
{
public:
LockedArray(unsigned int size);
~LockedArray();
void lock() { mLocked = true; };
void unlock() { mLocked = false; };
bool isLocked() const { return mLocked; };
T getEntry() const { return mData[mCurEntry]; };
void setEntry(T entry) { mData[mCurEntry] = entry; };
void next();
void prev();
void select(unsigned int pos);
unsigned int getPos() const { return mCurEntry; }
unsigned int getSize() const { return mSize; };
protected:
unsigned int mSize;
T* mData;
unsigned int mCurEntry;
bool mLocked;
};
template<class T>
LockedArray<T>::LockedArray(unsigned int size):
mSize(size), mData(new T[size]), mCurEntry(0), mLocked(false)
{
std::fill_n(mData, mSize, (T)0);
}
template<class T>
LockedArray<T>::~LockedArray()
{
delete [] mData;
}
template<class T>
void LockedArray<T>::next()
{
if (mLocked)
return;
if (++mCurEntry == mSize)
mCurEntry = 0;
}
template<class T>
void LockedArray<T>::prev()
{
if (mLocked)
return;
mCurEntry = mCurEntry ? (--mCurEntry) : (mSize - 1);
}
template<class T>
void LockedArray<T>::select(unsigned int pos)
{
if (mLocked)
return;
mCurEntry = pos;
if (mCurEntry >= mSize)
mCurEntry = 0;
}
#endif
|
