Search:

Ok, I have since realized that the LIFO is broken. I do want it to return and remove like an ArrayList.
I forgot to mention, I do need duplicate entries...

Looking into it a tish more, it seems...

Ah bloody hell, I have to stop deleting things. (oh yeah its on git.. oh well) Deleted the profiling code. Lets start from a different spot.

First of all, my requirements:
A collection that will...

Why worry about it.. well.. as much as I want to argue a point, I know that I cannot. :P

Okay, when I say fast.. I dont care about indexes or where elements go... it doesn't matter whatsoever to...

I'm not really noticing issues (yet). I will be adding/removing a LOT. I don't care about indexes or ordering.

I wrote an implementation of exactly what I need which, with a bit of testing, seems...

I need a collection that I can add/remove to. Order doesnt matter at all. The only thing that matters is SPEED. Honestly, push/pop or even add/pop.. doesnt matter. Just different names for the "same"...