| 115 |
ira |
1 |
This is a MIT Licensed implementation of a Ring Buffer in C++.
|
|
|
2 |
|
|
|
3 |
This code should run pretty much anywhere. I was safe to use "sized ints"
|
|
|
4 |
everywhere that I could.
|
|
|
5 |
|
|
|
6 |
Def. Ring Buffer -
|
|
|
7 |
A Ring Buffer is a data structure that holds a set amount of data. This
|
|
|
8 |
data should have the most important data being the newest data that has
|
|
|
9 |
been added. Old data becomes irrelevant (and therefore can be overwritten)
|
|
|
10 |
as soon as new data comes in.
|
|
|
11 |
|
|
|
12 |
In short, a Ring Buffer is a wraparound buffer which "never fills up."
|
|
|
13 |
|
|
|
14 |
If you are using any operating system with the GCC compiler and automake, you
|
|
|
15 |
should be able to compile this by cd'ing into the directory, and then running
|
|
|
16 |
the "make" command. NOTE: This tunes for i686 by default, but will run on an
|
|
|
17 |
i386. If you're using a different arch, this code should work, but has not
|
|
|
18 |
been tested.
|
|
|
19 |
|
|
|
20 |
If you use the code, I would appreciate an email at devel@irasnyder.com
|
|
|
21 |
telling me how you're using it. NOTE: This is NOT a requirement, it is a
|
|
|
22 |
request only!
|
|
|
23 |
|
|
|
24 |
If you have any patches, or would like something explained, feel free to email
|
|
|
25 |
me also. I will get to the requests as they come in.
|
|
|
26 |
|
|
|
27 |
Thank you.
|
|
|
28 |
|