I added support for better
contains implementations for the ascending and defending
Heap views. This also required adding a search function for
I ended up implementing two versions of the prime search method, iterative and recursive. Those happen to correspond to breadth- and depth-first searching. Hopefully, someone can figure out how to benchmark everything and determine both the time- and space-complexities. And they need to be compared to simply running
contains on the unordered view, which would be linear in time (and constant in space).