For this to be guaranteed to work, underlying storage has to be resizable (clearly not using linked list like semantics since it's named 'array').

So that means some small amount of the time, a linear search (a supposed read-only op) results in a possibly massive allocation or I need to allocate one extra space each time? Search is now not multi-reader thread-safe either. I mean, I can see the value, but surely a modern filter findAny is superior to this.

EDIT: can't post in response but I thought you meant that this trick carried over.