Set
A set of unique elements as determined by hashValue
and ==
.
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
In theory, reserve capacity for
n
elements. However, Dictionary does not implement reserveCapacity(), so we just silently ignore it.Declaration
Swift
public func reserveCapacity(n: Set<T>.Index.Distance) {}
-
Inserts each element of
sequence
into the receiver.Declaration
Swift
public mutating func extend<S: SequenceType where S.Generator.Element == T>(sequence: S)
-
Appends
element
onto theSet
.Declaration
Swift
public mutating func append(element: T)
-
Hashes using Bob Jenkins’ one-at-a-time hash. (http://en.wikipedia.org/wiki/Jenkins_hash_function#one-at-a-time) NB: Jenkins’ usage appears to have been string keys; the usage employed here seems similar but may have subtle differences which have yet to be discovered.
Declaration
Swift
public var hashValue: Int
-
Undocumented
-
Undocumented