Pure Swift implementations of useful data structures absent from the standard library.
Data structures:
PriorityQueue: a min- or max- priority queueOrderedSet: an ordered setOrderedDictionary: an ordered dictionaryList: doubly-linked listDeque: double-ended queue with O(1) random access
In alignment with Swift's standard library, all data structures are implemented as structs with copy-on-write optimisation.
Lower-level API:
_PriorityQueueImpl: backing class used byPriorityQueue_RBTree: Red-black binary tree