Subversion Repositories programming

This is a MIT Licensed implementation of a Ring Buffer in C++.

This code should run pretty much anywhere. I was safe to use "sized ints"
everywhere that I could.

Def. Ring Buffer -
    A Ring Buffer is a data structure that holds a set amount of data. This
    data should have the most important data being the newest data that has
    been added. Old data becomes irrelevant (and therefore can be overwritten)
    as soon as new data comes in.

    In short, a Ring Buffer is a wraparound buffer which "never fills up."

If you are using any operating system with the GCC compiler and automake, you
should be able to compile this by cd'ing into the directory, and then running
the "make" command. NOTE: This tunes for i686 by default, but will run on an
i386. If you're using a different arch, this code should work, but has not
been tested.

If you use the code, I would appreciate an email at devel@irasnyder.com
telling me how you're using it. NOTE: This is NOT a requirement, it is a
request only!

If you have any patches, or would like something explained, feel free to email
me also. I will get to the requests as they come in.

Thank you.