A type that provides the sequence’s iteration interface and encapsulates its iteration state.
SDK
- Xcode 9.0+
Framework
- Swift Standard Library
Declaration
Overview
Note
This documentation comment was inherited from Sequence
.
A type that provides the sequence’s iteration interface and encapsulates its iteration state.
SDK
Framework
Note
This documentation comment was inherited from Sequence
.
typealias Reversed Collection .Iterator .Element
The type of element traversed by the iterator.
typealias Reversed Collection .Iterator .Iterator
A type that provides the sequence’s iteration interface and encapsulates its iteration state.
var lazy: Lazy Sequence<Reversed Collection<Base>.Iterator>
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((Base .Element) -> Bool) -> Bool
Returns a Boolean value indicating whether every element of a sequence satisfies a given predicate.
func compact Map<Element Of Result>((Base .Element) -> Element Of Result?) -> [Element Of Result]
Returns an array containing the non-nil
results of calling the given transformation with each element of this sequence.
func contains(Base .Element) -> Bool
Returns a Boolean value indicating whether the sequence contains the given element.
func contains(where: (Base .Element) -> Bool) -> Bool
Returns a Boolean value indicating whether the sequence contains an element that satisfies the given predicate.
func drop(while: (Base .Element) -> Bool) -> Drop While Sequence<Reversed Collection<Base>.Iterator>
Returns a sequence by skipping the initial, consecutive elements that satisfy the given predicate.
func drop First(Int) -> Drop First Sequence<Reversed Collection<Base>.Iterator>
Returns a sequence containing all but the given number of initial elements.
func drop Last(Int) -> [Base .Element]
Returns a sequence containing all but the given number of final elements.
func elements Equal<Other Sequence>(Other Sequence) -> Bool
Returns a Boolean value indicating whether this sequence and another sequence contain the same elements in the same order.
func elements Equal<Other Sequence>(Other Sequence, by: (Base .Element, Other Sequence .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<Reversed Collection<Base>.Iterator>
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((Base .Element) -> Bool) -> [Base .Element]
Returns an array containing, in order, the elements of the sequence that satisfy the given predicate.
func first(where: (Base .Element) -> Bool) -> Base .Element?
Returns the first element of the sequence that satisfies the given predicate.
func flat Map<Segment Of Result>((Base .Element) -> Segment Of Result) -> [Segment Of Result .Element]
Returns an array containing the concatenated results of calling the given transformation with each element of this sequence.
func flat Map<Element Of Result>((Base .Element) -> Element Of Result?) -> [Element Of Result]
Returns an array containing the non-nil
results of calling the given transformation with each element of this sequence.
func for Each((Base .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<Reversed Collection<Base>.Iterator>
Returns the elements of this sequence of sequences, concatenated.
func joined<Separator>(separator: Separator) -> Joined Sequence<Reversed Collection<Base>.Iterator>
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<Other Sequence>(Other Sequence) -> 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<Other Sequence>(Other Sequence, by: (Base .Element, Base .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() -> Reversed Collection<Base>.Iterator
Returns an iterator over the elements of this sequence.
func map<T>((Base .Element) -> T) -> [T]
Returns an array containing the results of mapping the given closure over the sequence’s elements.
func max() -> Base .Element?
Returns the maximum element in the sequence.
func max(by: (Base .Element, Base .Element) -> Bool) -> Base .Element?
Returns the maximum element in the sequence, using the given predicate as the comparison between elements.
func min() -> Base .Element?
Returns the minimum element in the sequence.
func min(by: (Base .Element, Base .Element) -> Bool) -> Base .Element?
Returns the minimum element in the sequence, using the given predicate as the comparison between elements.
func next() -> Reversed Collection<Base>.Iterator .Element?
Advances to the next element and returns it, or nil
if no next element exists.
func prefix(Int) -> Prefix Sequence<Reversed Collection<Base>.Iterator>
Returns a sequence, up to the specified maximum length, containing the initial elements of the sequence.
func prefix(while: (Base .Element) -> Bool) -> [Base .Element]
Returns a sequence containing the initial, consecutive elements that satisfy the given predicate.
func reduce<Result>(Result, (Result, Base .Element) -> Result) -> Result
Returns the result of combining the elements of the sequence using the given closure.
func reduce<Result>(into: Result, (inout Result, Base .Element) -> ()) -> Result
Returns the result of combining the elements of the sequence using the given closure.
func reversed() -> [Base .Element]
Returns an array containing the elements of this sequence in reverse order.
func shuffled() -> [Base .Element]
Returns the elements of the sequence, shuffled.
func shuffled<T>(using: inout T) -> [Base .Element]
Returns the elements of the sequence, shuffled using the given generator as a source for randomness.
func sorted() -> [Base .Element]
Returns the elements of the sequence, sorted.
func sorted(by: (Base .Element, Base .Element) -> Bool) -> [Base .Element]
Returns the elements of the sequence, sorted using the given predicate as the comparison between elements.
func split(max Splits: Int, omitting Empty Subsequences: Bool, where Separator: (Base .Element) -> Bool) -> [Array Slice<Base .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: Base .Element, max Splits: Int, omitting Empty Subsequences: Bool) -> [Array Slice<Base .Element>]
Returns the longest possible subsequences of the sequence, in order, around elements equal to the given element.
func starts<Possible Prefix>(with: Possible Prefix) -> 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: Possible Prefix, by: (Base .Element, Possible Prefix .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) -> [Base .Element]
Returns a subsequence, up to the given maximum length, containing the final elements of the sequence.
func with Contiguous Storage If Available<R>((Unsafe Buffer Pointer<Base .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.