Flux.Collections is a set of functional data structures.
HamtMap and HamtSet are both based on the same idea of using a trie and the keys' hash to store the key-value pairs. Clojure's map is a well known implementation of a Hamt.
Both have a O(log32) or O(log64) (depending on the prefix size used at compile time) time complexity for insert, find and delete operations.
SkewBinaryRandomAccessList1
This is a random access list that supports the list operations const, head, tail, but allows O(log2) access to any element by its index.
Queues1
Queue and RealTimeQueue are just queues. Queue has a O(1) amortized time for inserting and popping items, while RealTimeQueue has a O(1) time for the same operations. However in a long sequence of operations, Queue should have a better overall performance than it's real time counterpart.
SkewBinomialHeap1
It's a heap (priority queue) using an idea similar to that of the SkewBinaryRandomAccessList
Stream1
Stream is a lazy list implementation.