Generic Structure

AnySequence

No overview available.

Topics

Initializers

init<S>(S)

Creates a new sequence that wraps and forwards operations to base.

init<I>(() -> I)

Creates a sequence whose makeIterator() method forwards to makeUnderlyingIterator.

Instance Properties

var lazy: LazySequence<AnySequence<Element>>

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

var underestimatedCount: Int

Returns a value less than or equal to the number of elements in the sequence, nondestructively.

Beta

Instance Methods

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

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

Beta
func dropFirst()

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

func dropLast()

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

func elementsEqual<OtherSequence>(OtherSequence)

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

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

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

Beta
func enumerated()

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 first(where: ((Element)) -> Bool)

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

Beta
func joined()

Returns the elements of this sequence of sequences, concatenated.

func joined<Separator>(separator: Separator)

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

func joined(separator: String)

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

func lexicographicallyPrecedes<OtherSequence>(OtherSequence)

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: ((Element), (Element)) -> Bool)

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

Beta
func makeIterator()

Returns an iterator over the elements of this sequence.

func map<T>(((Element)) -> T)

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

Beta
func max()

Returns the maximum element in the sequence.

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

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

Beta
func min()

Returns the minimum element in the sequence.

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

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

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

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

Beta
func reversed()

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

func sorted()

Returns the elements of the sequence, sorted.

func sorted(by: ((Element), (Element)) -> Bool)

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

Beta
func split(separator: (Element), maxSplits: Int, omittingEmptySubsequences: Bool)

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

Beta
func starts<PossiblePrefix>(with: PossiblePrefix)

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: ((Element), (Element)) -> 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

Relationships

Conforms To

See Also

Type-Erasing Wrappers

struct AnyCollection

A type-erased wrapper over any collection with indices that support forward traversal.

struct AnyBidirectionalCollection

A type-erased wrapper over any collection with indices that support bidirectional traversal.

struct AnyRandomAccessCollection

A type-erased wrapper over any collection with indices that support random access traversal.

struct AnyIterator

A type-erased iterator of Element.

struct AnyIndex

A wrapper over an underlying index that hides the specific underlying type.

struct AnyHashable

A type-erased hashable 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