-
Notifications
You must be signed in to change notification settings - Fork 0
/
rollingqueue.h
84 lines (68 loc) · 1.21 KB
/
rollingqueue.h
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
#ifndef ROLLINGQUEUE_H
#define ROLLINGQUEUE_H
#include <vector>
using namespace std;
template <class E>
class RollingQueue
{
public:
RollingQueue();
RollingQueue(int max);
int Count;
void Add(E add);
E* Get(int index);
//E* Get(int index);
E* PeekNewest();
E* PeekOldest();
private:
int maxSize;
int offset;
vector<E> items;
};
// Definitions
template<class E>
RollingQueue<E>::RollingQueue()
{
maxSize = 10;
offset = 0;
Count = 0;
}
template<class E>
RollingQueue<E>::RollingQueue(int max)
{
maxSize = max;
offset = 0;
Count = 0;
}
template<class E>
void RollingQueue<E>::Add(E item)
{
if (items.size() < maxSize)
{
items.push_back(item);
Count = items.size();
}
else
{
items[offset] = item;
offset = (offset + 1) % Count;
}
}
template<class E>
E* RollingQueue<E>::Get(int index)
{
return &items[(index + offset) % Count];
}
template<class E>
E* RollingQueue<E>::PeekNewest()
{
if (Count < maxSize)
return &items[Count-1];
return &items[(offset + Count - 1) % Count];
}
template<class E>
E* RollingQueue<E>::PeekOldest()
{
return &items[offset];
}
#endif // ROLLINGQUEUE_H