A sequence of values formed by striding over a closed interval.

SDK

- Xcode 6.0.1+

Framework

- Swift Standard Library

## Declaration

## Overview

Use the `stride(from:`

function to create `Stride`

instances.

Generic Structure# StrideThrough

A sequence of values formed by striding over a closed interval.

SDK

- Xcode 6.0.1+

Framework

- Swift Standard Library

Use the `stride(from:`

function to create `Stride`

instances.

`typealias Stride`Through.Iterator

A type that provides the sequence’s iteration interface and encapsulates its iteration state.

`var custom`Mirror : Mirror

The custom mirror for this instance.

`var lazy: Lazy`Sequence<StrideThrough<Element>>

A sequence containing the same elements as this sequence, but on which some operations, such as `map`

and `filter`

, are implemented lazily.

`var underestimated`Count : Int

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

`func all`Satisfy ((Element) -> Bool) -> Bool

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

`func compact`Map <ElementOfResult>((Element) -> ElementOfResult?) -> [ElementOfResult]

Returns an array containing the non-`nil`

results of calling the given transformation with each element of this sequence.

`func contains(Element) -> Bool`

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

`func contains(where: (Element) -> Bool) -> Bool`

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

`func drop(while: (Element) -> Bool) -> Drop`WhileSequence<StrideThrough<Element>>

Returns a sequence by skipping the initial, consecutive elements that satisfy the given predicate.

`func drop`First (Int) -> DropFirstSequence<StrideThrough<Element>>

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

`func drop`Last (Int) -> [Element]

Returns a sequence containing all but the given number of final elements.

`func elements`Equal <OtherSequence>(OtherSequence) -> Bool

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

`func elements`Equal <OtherSequence>(OtherSequence, by: (Element, 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() -> Enumerated`Sequence<StrideThrough<Element>>

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((Element) -> Bool) -> [Element]`

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

`func first(where: (Element) -> Bool) -> Element?`

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

`func flat`Map <SegmentOfResult>((Element) -> SegmentOfResult) -> [SegmentOfResult.Element]

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

`func flat`Map <ElementOfResult>((Element) -> ElementOfResult?) -> [ElementOfResult]

Returns an array containing the non-`nil`

results of calling the given transformation with each element of this sequence.

`func for`Each ((Element) -> Void)

Calls the given closure on each element in the sequence in the same order as a `for`

-`in`

loop.

`func joined() -> Flatten`Sequence<StrideThrough<Element>>

Returns the elements of this sequence of sequences, concatenated.

`func joined<Separator>(separator: Separator) -> Joined`Sequence<StrideThrough<Element>>

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

`func joined(separator: String) -> String`

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

`func lexicographically`Precedes <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 lexicographically`Precedes <OtherSequence>(OtherSequence, by: (Element, Element) -> 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 make`Iterator () -> StrideThroughIterator<Element>

Returns an iterator over the elements of this sequence.

`func map<T>((Element) -> T) -> [T]`

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

`func max() -> Element?`

Returns the maximum element in the sequence.

`func max(by: (Element, Element) -> Bool) -> Element?`

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

`func min() -> Element?`

Returns the minimum element in the sequence.

`func min(by: (Element, Element) -> Bool) -> Element?`

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

`func prefix(Int) -> Prefix`Sequence<StrideThrough<Element>>

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

`func prefix(while: (Element) -> Bool) -> [Element]`

Returns a sequence containing the initial, consecutive elements that satisfy the given predicate.

`func reduce<Result>(Result, (Result, Element) -> Result) -> Result`

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

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

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

`func reversed() -> [Element]`

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

`func shuffled() -> [Element]`

Returns the elements of the sequence, shuffled.

`func shuffled<T>(using: inout T) -> [Element]`

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

`func sorted() -> [Element]`

Returns the elements of the sequence, sorted.

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

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

`func split(max`Splits : Int, omittingEmptySubsequences : Bool, whereSeparator : (Element) -> Bool) -> [ArraySlice<Element>]

Returns the longest possible subsequences of the sequence, in order, that don’t contain elements satisfying the given predicate. Elements that are used to split the sequence are not returned as part of any subsequence.

`func split(separator: Element, max`Splits : Int, omittingEmptySubsequences : Bool) -> [ArraySlice<Element>]

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

`func starts<Possible`Prefix>( 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<Possible`Prefix>( with: PossiblePrefix, by: (Element, 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.

`func suffix(Int) -> [Element]`

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

`func with`ContiguousStorageIfAvailable <R>((UnsafeBufferPointer<Element>) -> R) -> R?

Call `body(p)`

, where `p`

is a pointer to the collection’s contiguous storage. If no such storage exists, it is first created. If the collection does not support an internal representation in a form of contiguous storage, `body`

is not called and `nil`

is returned.

`struct Collection`Difference

A collection of insertions and removals that describe the difference between two ordered collection states.

`struct Drop`FirstSequence

A sequence that lazily consumes and drops `n`

elements from an underlying `Base`

iterator before possibly returning the first available element.

`struct Drop`WhileSequence

A sequence that lazily consumes and drops `n`

elements from an underlying `Base`

iterator before possibly returning the first available element.

`struct Enumerated`Sequence

An enumeration of the elements of a sequence or collection.

`struct Flatten`Sequence

A sequence consisting of all the elements contained in each segment contained in some `Base`

sequence.

`struct Joined`Sequence

A sequence that presents the elements of a base sequence of sequences concatenated using a given separator.

`struct Prefix`Sequence

A sequence that only consumes up to `n`

elements from an underlying `Base`

iterator.

`struct Repeated`

A collection whose elements are all identical.

`struct Reversed`Collection

A collection that presents the elements of its base collection in reverse order.

`struct Stride`To

A sequence of values formed by striding over a half-open interval.

`struct Unfold`Sequence

A sequence whose elements are produced via repeated applications of a closure to some mutable state.

`struct Zip2Sequence`

A sequence of pairs built out of two underlying sequences.