ReverseRandomAccessCollection

struct ReverseRandomAccessCollection<Base : CollectionType where Base.Index : RandomAccessIndexType>

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

Note: This type is the result of x.reverse() where x is a collection having random access indices. See Also: ReverseCollection

Inheritance CollectionType, Indexable, SequenceType, _ReverseCollectionType View Protocol Hierarchy →
Associated Types
Index = ReverseRandomAccessIndex<Base.Index>

A type that represents a valid position in the collection.

Valid indices consist of the position of every element and a "past the end" position that's not valid for use as a subscript.

Generator = IndexingGenerator<ReverseRandomAccessCollection<Base>>

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

Element = Generator.Element

Type alias inferred.

SubSequence = Slice<ReverseRandomAccessCollection<Base>>

Type alias inferred.
Import import Swift

Initializers

init(_:)

Creates an instance that presents the elements of base in reverse order.

Complexity: O(1)

Deprecated: it will be removed in Swift 3. Use the 'reverse()' method on the collection..

Declaration

init(_ base: Base)

Instance Variables

var count: ReverseRandomAccessCollection<Base>.Index.Distance

Returns the number of elements.

Complexity: O(1) if Index conforms to RandomAccessIndexType; O(N) otherwise.

Declaration

var count: ReverseRandomAccessCollection<Base>.Index.Distance { get }

Declared In

CollectionType
var first: Generator.Element?

Returns the first element of self, or nil if self is empty.

Complexity: O(1)

Declaration

var first: Generator.Element? { get }

Declared In

CollectionType
var indices: Range<ReverseRandomAccessCollection<Base>.Index>

Returns the range of valid index values.

The result's endIndex is the same as that of self. Because Range is half-open, iterating the values of the result produces all valid subscript arguments for self, omitting its endIndex.

Declaration

var indices: Range<ReverseRandomAccessCollection<Base>.Index> { get }

Declared In

CollectionType
var isEmpty: Bool

Returns true iff self is empty.

Complexity: O(1)

Declaration

var isEmpty: Bool { get }

Declared In

CollectionType
var lazy: LazyCollection<ReverseRandomAccessCollection<Base>>

A collection with contents identical to self, but on which normally-eager operations such as map and filter are implemented lazily.

See Also: LazySequenceType, LazyCollectionType.

Declaration

var lazy: LazyCollection<ReverseRandomAccessCollection<Base>> { get }

Declared In

CollectionType

Subscripts

subscript(_: Range<ReverseRandomAccessCollection<Base>.Index>)

Returns a collection representing a contiguous sub-range of self's elements.

Complexity: O(1)

Declaration

subscript(bounds: Range<ReverseRandomAccessCollection<Base>.Index>) -> Slice<ReverseRandomAccessCollection<Base>> { get }

Declared In

CollectionType

Instance Methods

func contains(_:)

Returns true iff an element in self satisfies predicate.

Declaration

func contains(@noescape predicate: (Generator.Element) throws -> Bool) rethrows -> Bool

Declared In

CollectionType, SequenceType
func dropFirst()

Returns a subsequence containing all but the first element.

Complexity: O(1)

Declaration

func dropFirst() -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func dropFirst(_:)

Returns a subsequence containing all but the first n elements.

Requires: n >= 0 Complexity: O(n)

Declaration

func dropFirst(n: Int) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func dropLast()

Returns a subsequence containing all but the last element.

Requires: self is a finite sequence. Complexity: O(self.count)

Declaration

func dropLast() -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func dropLast(_:)

Returns a subsequence containing all but the last n elements.

Requires: n >= 0 Complexity: O(self.count)

Declaration

func dropLast(n: Int) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func elementsEqual(_:isEquivalent:)

Returns true iff self and other contain equivalent elements, using isEquivalent as the equivalence test.

Requires: isEquivalent is an equivalence relation.

Declaration

func elementsEqual<OtherSequence : SequenceType where OtherSequence.Generator.Element == Generator.Element>(other: OtherSequence, @noescape isEquivalent: (Generator.Element, Generator.Element) throws -> Bool) rethrows -> Bool

Declared In

CollectionType, SequenceType
func enumerate()

Returns a lazy SequenceType containing pairs (n, x), where ns are consecutive Ints starting at zero, and xs are the elements of base:

> for (n, c) in "Swift".characters.enumerate() {
    print("\(n): '\(c)'")
  }
0: 'S'
1: 'w'
2: 'i'
3: 'f'
4: 't'

Declaration

func enumerate() -> EnumerateSequence<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func filter(_:)

Returns an Array containing the elements of self, in order, that satisfy the predicate includeElement.

Declaration

func filter(@noescape includeElement: (Generator.Element) throws -> Bool) rethrows -> [Generator.Element]

Declared In

CollectionType, SequenceType
func flatMap<T>(_: (Generator.Element) throws -> T?)

Returns an Array containing the non-nil results of mapping transform over self.

Complexity: O(M + N), where M is the length of self and N is the length of the result.

Declaration

func flatMap<T>(@noescape transform: (Generator.Element) throws -> T?) rethrows -> [T]

Declared In

CollectionType, SequenceType
func flatMap<S : SequenceType>(_: (Generator.Element) throws -> S)

Returns an Array containing the concatenated results of mapping transform over self.

s.flatMap(transform)

is equivalent to

Array(s.map(transform).flatten())

Complexity: O(M + N), where M is the length of self and N is the length of the result.

Declaration

func flatMap<S : SequenceType>(transform: (Generator.Element) throws -> S) rethrows -> [S.Generator.Element]

Declared In

CollectionType, SequenceType
func forEach(_:)

Call body on each element in self in the same order as a for-in loop.

sequence.forEach {
  // body code
}

is similar to:

for element in sequence {
  // body code
}

Note: You cannot use the break or continue statement to exit the current call of the body closure or skip subsequent calls. Note: Using the return statement in the body closure will only exit from the current call to body, not any outer scope, and won't skip subsequent calls.

Complexity: O(self.count)

Declaration

func forEach(@noescape body: (Generator.Element) throws -> Void) rethrows

Declared In

CollectionType, SequenceType
func generate()

Declaration

func generate() -> IndexingGenerator<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType
func indexOf(_:)

Returns the first index where predicate returns true for the corresponding value, or nil if such value is not found.

Complexity: O(self.count).

Declaration

func indexOf(@noescape predicate: (Generator.Element) throws -> Bool) rethrows -> ReverseRandomAccessCollection<Base>.Index?

Declared In

CollectionType
func lexicographicalCompare(_:isOrderedBefore:)

Returns true iff self precedes other in a lexicographical ("dictionary") ordering, using isOrderedBefore as the comparison between elements.

Note: This method implements the mathematical notion of lexicographical ordering, which has no connection to Unicode. If you are sorting strings to present to the end-user, you should use String APIs that perform localized comparison.

Requires: isOrderedBefore is a strict weak ordering over the elements of self and other.

Declaration

func lexicographicalCompare<OtherSequence : SequenceType where OtherSequence.Generator.Element == Generator.Element>(other: OtherSequence, @noescape isOrderedBefore: (Generator.Element, Generator.Element) throws -> Bool) rethrows -> Bool

Declared In

CollectionType, SequenceType
func map(_:)

Returns an Array containing the results of mapping transform over self.

Complexity: O(N).

Declaration

func map<T>(@noescape transform: (Generator.Element) throws -> T) rethrows -> [T]

Declared In

CollectionType, SequenceType
func maxElement(_:)

Returns the maximum element in self or nil if the sequence is empty.

Complexity: O(elements.count).

Requires: isOrderedBefore is a strict weak ordering over self.

Declaration

func maxElement(@noescape isOrderedBefore: (Generator.Element, Generator.Element) throws -> Bool) rethrows -> Generator.Element?

Declared In

CollectionType, SequenceType
func minElement(_:)

Returns the minimum element in self or nil if the sequence is empty.

Complexity: O(elements.count).

Requires: isOrderedBefore is a strict weak ordering over self.

Declaration

func minElement(@noescape isOrderedBefore: (Generator.Element, Generator.Element) throws -> Bool) rethrows -> Generator.Element?

Declared In

CollectionType, SequenceType
func prefix(_:)

Returns a subsequence, up to maxLength in length, containing the initial elements.

If maxLength exceeds self.count, the result contains all the elements of self.

Requires: maxLength >= 0 Complexity: O(maxLength)

Declaration

func prefix(maxLength: Int) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func prefixThrough(_:)

Returns prefixUpTo(position.successor())

Complexity: O(1)

Declaration

func prefixThrough(position: ReverseRandomAccessCollection<Base>.Index) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType
func prefixUpTo(_:)

Returns self[startIndex..<end]

Complexity: O(1)

Declaration

func prefixUpTo(end: ReverseRandomAccessCollection<Base>.Index) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType
func reduce(_:combine:)

Returns the result of repeatedly calling combine with an accumulated value initialized to initial and each element of self, in turn, i.e. return combine(combine(...combine(combine(initial, self[0]), self[1]),...self[count-2]), self[count-1]).

Declaration

func reduce<T>(initial: T, @noescape combine: (T, Generator.Element) throws -> T) rethrows -> T

Declared In

CollectionType, SequenceType
func reverse()

Returns an Array containing the elements of self in reverse order.

Complexity: O(N), where N is the length of self.

Declaration

func reverse() -> [Generator.Element]

Declared In

CollectionType, SequenceType
func sort(_:)

Returns an Array containing the sorted elements of source according to isOrderedBefore.

The sorting algorithm is not stable (can change the relative order of elements for which isOrderedBefore does not establish an order).

Requires: isOrderedBefore is a strict weak ordering over the elements in self.

Declaration

func sort(@noescape isOrderedBefore: (Generator.Element, Generator.Element) -> Bool) -> [Generator.Element]

Declared In

CollectionType, SequenceType
func split(_:allowEmptySlices:isSeparator:)

Returns the maximal SubSequences of self, in order, that don't contain elements satisfying the predicate isSeparator.

maxSplit: The maximum number of SubSequences to return, minus 1. If maxSplit + 1 SubSequences are returned, the last one is a suffix of self containing the remaining elements. The default value is Int.max.

allowEmptySubsequences: If true, an empty SubSequence is produced in the result for each pair of consecutive elements satisfying isSeparator. The default value is false.

Requires: maxSplit >= 0

Declaration

func split(maxSplit: Int = default, allowEmptySlices: Bool = default, @noescape isSeparator: (Generator.Element) throws -> Bool) rethrows -> [Slice<ReverseRandomAccessCollection<Base>>]

Declared In

CollectionType, SequenceType
func startsWith(_:isEquivalent:)

Returns true iff self begins with elements equivalent to those of other, using isEquivalent as the equivalence test. Returns true if other is empty.

Requires: isEquivalent is an equivalence relation.

Declaration

func startsWith<OtherSequence : SequenceType where OtherSequence.Generator.Element == Generator.Element>(other: OtherSequence, @noescape isEquivalent: (Generator.Element, Generator.Element) throws -> Bool) rethrows -> Bool

Declared In

CollectionType, SequenceType
func suffix(_:)

Returns a slice, up to maxLength in length, containing the final elements of s.

If maxLength exceeds s.count, the result contains all the elements of s.

Requires: maxLength >= 0 Complexity: O(self.count)

Declaration

func suffix(maxLength: Int) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func suffixFrom(_:)

Returns self[start..<endIndex]

Complexity: O(1)

Declaration

func suffixFrom(start: ReverseRandomAccessCollection<Base>.Index) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType
func underestimateCount()

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

Complexity: O(N).

Declaration

func underestimateCount() -> Int

Declared In

CollectionType, SequenceType

Conditionally Inherited Items

The initializers, methods, and properties listed below may be available on this type under certain conditions (such as methods that are available on Array when its elements are Equatable) or may not ever be available if that determination is beyond SwiftDoc.org's capabilities. Please open an issue on GitHub if you see something out of place!

Where Generator.Element : CollectionType

func flatten()

A concatenation of the elements of self.

Declaration

func flatten() -> FlattenCollection<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType

Where Generator.Element : CollectionType, Index : BidirectionalIndexType, Generator.Element.Index : BidirectionalIndexType

func flatten()

A concatenation of the elements of self.

Declaration

func flatten() -> FlattenBidirectionalCollection<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType

Where Generator.Element : Comparable

func lexicographicalCompare(_:)

Returns true iff self precedes other in a lexicographical ("dictionary") ordering, using "<" as the comparison between elements.

Note: This method implements the mathematical notion of lexicographical ordering, which has no connection to Unicode. If you are sorting strings to present to the end-user, you should use String APIs that perform localized comparison.

Declaration

func lexicographicalCompare<OtherSequence : SequenceType where OtherSequence.Generator.Element == Generator.Element>(other: OtherSequence) -> Bool

Declared In

CollectionType, SequenceType
func maxElement()

Returns the maximum element in self or nil if the sequence is empty.

Complexity: O(elements.count).

Declaration

func maxElement() -> Generator.Element?

Declared In

CollectionType, SequenceType
func minElement()

Returns the minimum element in self or nil if the sequence is empty.

Complexity: O(elements.count).

Declaration

func minElement() -> Generator.Element?

Declared In

CollectionType, SequenceType
func sort()

Returns an Array containing the sorted elements of source.

The sorting algorithm is not stable (can change the relative order of elements that compare equal).

Requires: The less-than operator (func <) defined in the Comparable conformance is a strict weak ordering over the elements in self.

Declaration

func sort() -> [Generator.Element]

Declared In

CollectionType, SequenceType

Where Generator.Element : Equatable

func contains(_:)

Returns true iff element is in self.

Declaration

func contains(element: Generator.Element) -> Bool

Declared In

CollectionType, SequenceType
func elementsEqual(_:)

Returns true iff self and other contain the same elements in the same order.

Declaration

func elementsEqual<OtherSequence : SequenceType where OtherSequence.Generator.Element == Generator.Element>(other: OtherSequence) -> Bool

Declared In

CollectionType, SequenceType
func indexOf(_:)

Returns the first index where value appears in self or nil if value is not found.

Complexity: O(self.count).

Declaration

func indexOf(element: Generator.Element) -> ReverseRandomAccessCollection<Base>.Index?

Declared In

CollectionType
func split(_:maxSplit:allowEmptySlices:)

Returns the maximal SubSequences of self, in order, around a separator element.

maxSplit: The maximum number of SubSequences to return, minus 1. If maxSplit + 1 SubSequences are returned, the last one is a suffix of self containing the remaining elements. The default value is Int.max.

allowEmptySubsequences: If true, an empty SubSequence is produced in the result for each pair of consecutive elements satisfying isSeparator. The default value is false.

Requires: maxSplit >= 0

Declaration

func split(separator: Generator.Element, maxSplit: Int = default, allowEmptySlices: Bool = default) -> [Slice<ReverseRandomAccessCollection<Base>>]

Declared In

CollectionType, SequenceType
func startsWith(_:)

Returns true iff the initial elements of self are equal to prefix. Returns true if other is empty.

Declaration

func startsWith<OtherSequence : SequenceType where OtherSequence.Generator.Element == Generator.Element>(other: OtherSequence) -> Bool

Declared In

CollectionType, SequenceType

Where Generator.Element : SequenceType

func flatten()

A concatenation of the elements of self.

Declaration

func flatten() -> FlattenSequence<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType
func joinWithSeparator(_:)

Returns a view, whose elements are the result of interposing a given separator between the elements of the sequence self.

For example, [[1, 2, 3], [4, 5, 6], [7, 8, 9]].joinWithSeparator([-1, -2]) yields [1, 2, 3, -1, -2, 4, 5, 6, -1, -2, 7, 8, 9].

Declaration

func joinWithSeparator<Separator : SequenceType where Separator.Generator.Element == Generator.Element.Generator.Element>(separator: Separator) -> JoinSequence<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType, SequenceType

Where Generator.Element == String

func joinWithSeparator(_:)

Interpose the separator between elements of self, then concatenate the result. For example:

["foo", "bar", "baz"].joinWithSeparator("-|-") // "foo-|-bar-|-baz"

Declaration

func joinWithSeparator(separator: String) -> String

Declared In

CollectionType, SequenceType

Where Index : BidirectionalIndexType

var last: Generator.Element?

Declaration

var last: Generator.Element? { get }

Declared In

CollectionType
func dropLast(_:)

Returns a subsequence containing all but the last n elements.

Requires: n >= 0 Complexity: O(n)

Declaration

func dropLast(n: Int) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType
func reverse()

Returns the elements of self in reverse order.

Complexity: O(1)

Declaration

func reverse() -> ReverseCollection<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType
func suffix(_:)

Returns a slice, up to maxLength in length, containing the final elements of s.

If maxLength exceeds s.count, the result contains all the elements of s.

Requires: maxLength >= 0 Complexity: O(maxLength)

Declaration

func suffix(maxLength: Int) -> Slice<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType

Where Index : RandomAccessIndexType

func reverse()

Returns the elements of self in reverse order.

Complexity: O(1)

Declaration

func reverse() -> ReverseRandomAccessCollection<ReverseRandomAccessCollection<Base>>

Declared In

CollectionType

Where Self : CollectionType, Index.Base == Base.Index

var endIndex: ReverseRandomAccessCollection<Base>.Index

The collection's "past the end" position.

endIndex is not a valid argument to subscript, and is always reachable from startIndex by zero or more applications of successor().

Complexity: O(1)

Declaration

var endIndex: ReverseRandomAccessCollection<Base>.Index { get }

Declared In

_ReverseCollectionType
var startIndex: ReverseRandomAccessCollection<Base>.Index

The position of the first element in a non-empty collection.

In an empty collection, startIndex == endIndex.

Complexity: O(1)

Declaration

var startIndex: ReverseRandomAccessCollection<Base>.Index { get }

Declared In

_ReverseCollectionType
subscript(_: ReverseRandomAccessCollection<Base>.Index)

Returns the element at the given position.

Declaration

subscript(position: ReverseRandomAccessCollection<Base>.Index) -> ReverseRandomAccessCollection<Base>.Base.Generator.Element { get }

Declared In

_ReverseCollectionType

Where Self : _ReverseCollectionType, Base.Index : RandomAccessIndexType

var startIndex: ReverseRandomAccessIndex<ReverseRandomAccessCollection<Base>.Base.Index>

The position of the first element in a non-empty collection.

In an empty collection, startIndex == endIndex.

Complexity: O(1)

Declaration

var startIndex: ReverseRandomAccessIndex<ReverseRandomAccessCollection<Base>.Base.Index> { get }

Declared In

CollectionType