public final class SortedArraySet<T>
This class implements most of the Set interface, backed by a
sorted Array. This makes iterators very fast, lookups are log(n), but
adds are fairly expensive.
This class is also threadsafe, but without synchronizations. Lookups
and iterators will iterate over the state of the Set when the iterator
If no data is stored in the Set, it uses very little memory. The backing
array is created on demand.
This class is primarly useful for stuff that will be setup at startup, but
then iterated over MANY times during runtime.