Adds a few collections:
- structure
ParFuncArray: an implementation of parallel functional arrays (based on Kumar et al.). Essentially, lock-free (actually wait-free) mutable arrays with pure functional semantics, even in the presence of concurrency+parallelism. Under the hood, arrays are automatic shared and rebuilt on-demand to ensure determinism. - structure
HashsetandHashtable: simple implementations of lock-free hash tables, based on linear probing and open addressing. - functor
ChunkedTreap: an implementation of purely functional treaps with chunked leaves, an approach which is more space-efficient than basic trees. The functor is parameterized, to allow for a variety of different pure sequence types to be used as leaf chunks.