Collections

Overview

Additional Resources

• Swift Collections on GitHub

• Swift Collections on the Swift Forums

Bit Collections

• struct BitSet

  A sorted collection of small nonnegative integers, implemented as an uncompressed bitmap of as many bits as the value of the largest member.

• struct BitArray

  An ordered, random-access collection of Bool values, implemented as an uncompressed bitmap of as many bits as the count of the array.

Deque Module

• struct Deque<Element>

  A collection implementing a double-ended queue. Deque (pronounced “deck”) implements an ordered random-access collection that supports efficient insertions and removals from both ends.

Heap Module

• struct Heap<Element>

  A container type implementing a double-ended priority queue. Heap is a container of Comparable elements that provides immediate access to its minimal and maximal members, and supports removing these items or inserting arbitrary new items in (amortized) logarithmic complexity.

Ordered Collections

• struct OrderedSet<Element>

  An ordered collection of unique elements.

• struct OrderedDictionary<Key, Value>

  An ordered collection of key-value pairs.

Persistent Hashed Collections

• struct TreeSet<Element>

  An unordered collection of unique elements, optimized for mutating shared copies and comparing different snapshots of the same collection.

• struct TreeDictionary<Key, Value>

  An unordered collection of unique keys and associated values, optimized for mutating shared copies and comparing different snapshots of the same collection.