The FIFO and LIFO collections available in the Java standard library are un-bounded in size. Due to the potentially large number of events that I will be processing, I needed something that was bounded.
starting get at wherever the array happens to start seems like a weird choice. what’s this for
This is for cases where ordering is not-important, it should be slightly more performant than using the ordered mode of operation.
@sknebel Apologies if I have done something wrong here, it certainly was not my intention. This post was not meant to be a mechanism for self-promotion. I released this code under an Open Source license on GitHub and published it as a reusable library to Maven Central, as I thought it might be a useful tool for others to use in their own projects.
if you didn’t care about order, why not just use a FIFO anyway? or a LIFO so you only need one pointer and theoretically get better cache behaviour?
starting
getat wherever the array happens to start seems like a weird choice. what’s this for?The FIFO and LIFO collections available in the Java standard library are un-bounded in size. Due to the potentially large number of events that I will be processing, I needed something that was bounded.
This is for cases where ordering is not-important, it should be slightly more performant than using the ordered mode of operation.
Please read and follow the rules on self-promotion: https://lobste.rs/about
@sknebel Apologies if I have done something wrong here, it certainly was not my intention. This post was not meant to be a mechanism for self-promotion. I released this code under an Open Source license on GitHub and published it as a reusable library to Maven Central, as I thought it might be a useful tool for others to use in their own projects.