-
Notifications
You must be signed in to change notification settings - Fork 2
/
ringbuffer.h
89 lines (74 loc) · 2.34 KB
/
ringbuffer.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
85
86
87
88
89
/*
Copyright 2010 Keywan Tonekaboni, Florian Fusco, Stefanie Schirmer, Alexander Lenhardt, Erik Weitnauer <eweitnauer at gmail.com>
This file is part of Soldering Skaters Nokia Push Project.
Soldering Skaters Nokia Push Project 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 3 of the License, or
(at your option) any later version.
Soldering Skaters Nokia Push Project 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 Soldering Skaters Nokia Push Project. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef RINGBUFFER_H
#define RINGBUFFER_H
#include <QtCore>
class RingBuffer {
public:
RingBuffer(int size=10) : buf(size)
{
tail = 0;
}
void resize(int size)
{
buf.resize(size);
tail = 0;
}
bool isFilled() const { return tail>=buf.size(); }
void add(QList<int> sample)
{
buf[tail%buf.size()] = sample;
tail++;
}
void print() const
{
qDebug() << buf;
}
// Matrix getBuffer() const
// {
// if(!isFilled())
// return Matrix(buf.size()*buf[0].size(),1);
// Matrix m(buf.size()*buf[0].size(),1);
// int c=1;
// for(int i=0; i<buf.size(); i++)
// for(int j=0; j<buf[0].size(); j++) {
//// int bs = buf.size();
// int ls = buf[(i+tail)%buf.size()].size();
// if(ls!=buf[0].size())
// m(c++,1) = 0;
// else
// m(c++,1) = buf[(i+tail)%buf.size()][j];
// }
// return m;
// }
QList<int> getChannel(int ch) {
QList<int> v;
for(int i=0; i<buf.size(); i++) {
int idx = (i+tail)%buf.size();
int t = buf[idx][ch];
if(t>600)
t = buf[idx-1][ch];;
v << t;
}
// for(int i=0; i<buf.size(); i++)
// v << buf[i].at(ch+1);
return v;
}
private:
int tail;
QVector<QList<int> > buf;
bool m_isFilled;
};
#endif // RINGBUFFER_H