Structure

Dictionary.Values

A view of a dictionary’s values.

Topics

Instance Properties

var count: Int

The number of values in the dictionary.

Beta
var count: Int

The number of elements in the collection.

Beta
var first: Value?

The first element of the collection.

var indices: DefaultIndices<Dictionary<Key, Value>.Values>

The indices that are valid for subscripting the collection, in ascending order.

var isEmpty: Bool

A Boolean value indicating whether the collection is empty.

Beta
var lazy: LazySequence<Dictionary<Key, Value>.Values>

A sequence containing the same elements as this sequence, but on which some operations, such as map and filter, are implemented lazily.

var lazy: LazyCollection<Dictionary<Key, Value>.Values>

A view onto this collection that provides lazy implementations of normally eager operations, such as map and filter.

var underestimatedCount: Int

A value less than or equal to the number of elements in the sequence, calculated nondestructively.

Beta
var underestimatedCount: Int

A value less than or equal to the number of elements in the collection.

Beta

Instance Methods

func allSatisfy((Value) -> Bool) -> Bool

Returns a Boolean value indicating whether every element of a sequence satisfies a given predicate.

Beta
func compactMap<ElementOfResult>((Value) -> ElementOfResult?) -> [ElementOfResult]

Returns an array containing the non-nil results of calling the given transformation with each element of this sequence.

func contains(Value) -> Bool

Returns a Boolean value indicating whether the sequence contains the given element.

func contains(where: (Value) -> Bool) -> Bool

Returns a Boolean value indicating whether the sequence contains an element that satisfies the given predicate.

func drop(while: (Value) -> Bool) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence by skipping elements while predicate returns true and returning the remaining elements.

func dropFirst() -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence containing all but the first element of the sequence.

func dropFirst(Int) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence containing all but the given number of initial elements.

func dropLast() -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence containing all but the last element of the sequence.

func dropLast(Int) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence containing all but the specified number of final elements.

func elementsEqual<OtherSequence>(OtherSequence) -> Bool

Returns a Boolean value indicating whether this sequence and another sequence contain the same elements in the same order.

func elementsEqual<OtherSequence>(OtherSequence, by: (Value, OtherSequence.Element) -> Bool) -> Bool

Returns a Boolean value indicating whether this sequence and another sequence contain equivalent elements in the same order, using the given predicate as the equivalence test.

func enumerated() -> EnumeratedSequence<Dictionary<Key, Value>.Values>

Returns a sequence of pairs (n, x), where n represents a consecutive integer starting at zero and x represents an element of the sequence.

func filter((Value) -> Bool) -> [Value]

Returns an array containing, in order, the elements of the sequence that satisfy the given predicate.

func first(where: (Value) -> Bool) -> Value?

Returns the first element of the sequence that satisfies the given predicate.

func firstIndex(of: Value) -> Dictionary<Key, Value>.Index?

Returns the first index where the specified value appears in the collection.

Beta
func firstIndex(where: (Value) -> Bool) -> Dictionary<Key, Value>.Index?

Returns the first index in which an element of the collection satisfies the given predicate.

Beta
func forEach((Value) -> Void)

Calls the given closure on each element in the sequence in the same order as a for-in loop.

func formIndex(inout Dictionary<Key, Value>.Index, offsetBy: Int)

Offsets the given index by the specified distance.

func formIndex(inout Dictionary<Key, Value>.Index, offsetBy: Int, limitedBy: Dictionary<Key, Value>.Index) -> Bool

Offsets the given index by the specified distance, or so that it equals the given limiting index.

func formIndex(after: inout Dictionary<Key, Value>.Index)

Replaces the given index with its successor.

func index(Dictionary<Key, Value>.Index, offsetBy: Int) -> Dictionary<Key, Value>.Index

Returns an index that is the specified distance from the given index.

func index(Dictionary<Key, Value>.Index, offsetBy: Int, limitedBy: Dictionary<Key, Value>.Index) -> Dictionary<Key, Value>.Index?

Returns an index that is the specified distance from the given index, unless that distance is beyond a given limiting index.

func joined() -> FlattenCollection<Dictionary<Key, Value>.Values>

Returns the elements of this collection of collections, concatenated.

func joined() -> FlattenSequence<Dictionary<Key, Value>.Values>

Returns the elements of this sequence of sequences, concatenated.

func joined(separator: String) -> String

Returns a new string by concatenating the elements of the sequence, adding the given separator between each element.

func joined<Separator>(separator: Separator) -> JoinedSequence<Dictionary<Key, Value>.Values>

Returns the concatenated elements of this sequence of sequences, inserting the given separator between each element.

func lexicographicallyPrecedes<OtherSequence>(OtherSequence) -> Bool

Returns a Boolean value indicating whether the sequence precedes another sequence in a lexicographical (dictionary) ordering, using the less-than operator (<) to compare elements.

func lexicographicallyPrecedes<OtherSequence>(OtherSequence, by: (Value, Value) -> Bool) -> Bool

Returns a Boolean value indicating whether the sequence precedes another sequence in a lexicographical (dictionary) ordering, using the given predicate to compare elements.

func makeIterator() -> IndexingIterator<Dictionary<Key, Value>.Values>

Returns an iterator over the elements of the collection.

func map<T>((Value) -> T) -> [T]

Returns an array containing the results of mapping the given closure over the sequence’s elements.

Beta
func map<T>((Value) -> T) -> [T]

Returns an array containing the results of mapping the given closure over the sequence’s elements.

Beta
func max() -> Value?

Returns the maximum element in the sequence.

func max(by: (Value, Value) -> Bool) -> Value?

Returns the maximum element in the sequence, using the given predicate as the comparison between elements.

func min() -> Value?

Returns the minimum element in the sequence.

func min(by: (Value, Value) -> Bool) -> Value?

Returns the minimum element in the sequence, using the given predicate as the comparison between elements.

func partition(by: (Value) -> Bool) -> Dictionary<Key, Value>.Index

Reorders the elements of the collection such that all the elements that match the given predicate are after all the elements that don’t match.

func prefix(Int) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence, up to the specified maximum length, containing the initial elements of the collection.

func prefix(through: Dictionary<Key, Value>.Index) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence from the start of the collection through the specified position.

func prefix(upTo: Dictionary<Key, Value>.Index) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence from the start of the collection up to, but not including, the specified position.

func prefix(while: (Value) -> Bool) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence containing the initial elements until predicate returns false and skipping the remaining elements.

func randomElement() -> Value?

Returns a random element of the collection.

Beta
func randomElement<T>(using: inout T) -> Value?

Returns a random element of the collection, using the given generator as a source for randomness.

Beta
func reduce<Result>(Result, (Result, Value) -> Result) -> Result

Returns the result of combining the elements of the sequence using the given closure.

func reduce<Result>(into: Result, (inout Result, Value) -> ()) -> Result

Returns the result of combining the elements of the sequence using the given closure.

func reversed() -> [Value]

Returns an array containing the elements of this sequence in reverse order.

func shuffled() -> [Value]

Returns the elements of the sequence, shuffled.

Beta
func shuffled<T>(using: inout T) -> [Value]

Returns the elements of the sequence, shuffled using the given generator as a source for randomness.

Beta
func sorted() -> [Value]

Returns the elements of the sequence, sorted.

func sorted(by: (Value, Value) -> Bool) -> [Value]

Returns the elements of the sequence, sorted using the given predicate as the comparison between elements.

func split(maxSplits: Int, omittingEmptySubsequences: Bool, whereSeparator: (Value) -> Bool) -> [Slice<Dictionary<Key, Value>.Values>]

Returns the longest possible subsequences of the collection, in order, that don’t contain elements satisfying the given predicate.

func split(separator: Value, maxSplits: Int, omittingEmptySubsequences: Bool) -> [Slice<Dictionary<Key, Value>.Values>]

Returns the longest possible subsequences of the sequence, in order, around elements equal to the given element.

Beta
func split(separator: Value, maxSplits: Int, omittingEmptySubsequences: Bool) -> [Slice<Dictionary<Key, Value>.Values>]

Returns the longest possible subsequences of the collection, in order, around elements equal to the given element.

Beta
func starts<PossiblePrefix>(with: PossiblePrefix) -> Bool

Returns a Boolean value indicating whether the initial elements of the sequence are the same as the elements in another sequence.

func starts<PossiblePrefix>(with: PossiblePrefix, by: (Value, PossiblePrefix.Element) -> Bool) -> Bool

Returns a Boolean value indicating whether the initial elements of the sequence are equivalent to the elements in another sequence, using the given predicate as the equivalence test.

Beta
func suffix(Int) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence, up to the given maximum length, containing the final elements of the collection.

func suffix(from: Dictionary<Key, Value>.Index) -> Slice<Dictionary<Key, Value>.Values>

Returns a subsequence from the specified position to the end of the collection.

func swapAt(Dictionary<Key, Value>.Index, Dictionary<Key, Value>.Index)

Exchanges the values at the specified indices of the collection.

See Also

Supporting Types

struct Dictionary.Keys

A view of a dictionary’s keys.

struct Dictionary.Index

The position of a key-value pair in a dictionary.

struct DictionaryIterator

An iterator over the members of a Dictionary<Key, Value>.

Beta Software

This documentation contains preliminary information about an API or technology in development. This information is subject to change, and software implemented according to this documentation should be tested with final operating system software.

Learn more about using Apple's beta software