MutableSlice

struct MutableSlice<Base : MutableIndexable>

A view into a sub-sequence of elements of another collection.

A MutableSlice instance stores the base collection, the start and end indices of the view. It does not copy the elements from the collection into separate storage. Thus, creating a slice has O(1) complexity.

A MutableSlice instance inherits the value or reference semantics of the base collection. That is, if a MutableSlice instance is wrapped around a mutable collection that has value semantics (for example, Array), mutating the original collection would not affect the copy stored inside of the slice.

An element of a slice is located under the same index in the slice and in the base collection, as long as neither the collection or the slice were mutated. Thus, indices of a slice can be used interchangeably with indices of the base collection.

Warning: Long-term storage of MutableSlice instances is discouraged.

Because a MutableSlice presents a view onto the storage of some larger collection even after the original collection goes out of scope, storing the slice may prolong the lifetime of elements that are no longer accessible, which can manifest as apparent memory and object leakage. To prevent this effect, use slices only for transient computation.

Warning: MutableSlice requires the setter of Base.subscript(_: Index) to not invalidate indices. If you are writing a collection and mutations need to invalidate indices, don't use MutableSlice, use Slice or define your own Base.SubSequence type that takes that into account.

Inheritance CollectionType, Indexable, MutableCollectionType, MutableIndexable, SequenceType View Protocol Hierarchy →
Associated Types
Index = Base.Index
Generator = IndexingGenerator<MutableSlice<Base>>

Type alias inferred.

Element = Base._Element

Type alias inferred.

Index = Base.Index

Type alias inferred.

SubSequence = MutableSlice<Base>

Type alias inferred.
Import import Swift

Initializers

init(base:bounds:)

Deprecated: it will be removed in Swift 3. Use the slicing syntax..

Declaration

init(base: Base, bounds: Range<Base.Index>)

Instance Variables

var count: Base.Index.Distance

Returns the number of elements.

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

Declaration

var count: Base.Index.Distance { get }

Declared In

MutableCollectionType , CollectionType
var endIndex: Base.Index

Declaration

var endIndex: Base.Index { get }
var first: Base._Element?

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

Complexity: O(1)

Declaration

var first: Base._Element? { get }

Declared In

MutableCollectionType , CollectionType
var indices: Range<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<Base.Index> { get }

Declared In

MutableCollectionType , CollectionType
var isEmpty: Bool

Returns true iff self is empty.

Complexity: O(1)

Declaration

var isEmpty: Bool { get }

Declared In

MutableCollectionType , CollectionType
var lazy: LazyCollection<MutableSlice<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<MutableSlice<Base>> { get }

Declared In

MutableCollectionType , CollectionType
var startIndex: Base.Index

Declaration

var startIndex: Base.Index { get }

Subscripts

subscript(_: Base.Index)

Declaration

subscript(index: Base.Index) -> Base._Element
subscript(_: Range<Base.Index>)

Declaration

subscript(bounds: Range<Base.Index>) -> MutableSlice<Base>

Declared In

MutableSlice, MutableCollectionType

Instance Methods

func contains(_:)

Returns true iff an element in self satisfies predicate.

Declaration

func contains(@noescape predicate: (Base._Element) throws -> Bool) rethrows -> Bool

Declared In

MutableCollectionType, CollectionType, SequenceType
func dropFirst()

Returns a subsequence containing all but the first element.

Complexity: O(1)

Declaration

func dropFirst() -> MutableSlice<Base>

Declared In

MutableCollectionType, 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) -> MutableSlice<Base>

Declared In

MutableCollectionType, 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() -> MutableSlice<Base>

Declared In

MutableCollectionType, 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) -> MutableSlice<Base>

Declared In

MutableCollectionType, 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: (Base._Element, Base._Element) throws -> Bool) rethrows -> Bool

Declared In

MutableCollectionType, 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<MutableSlice<Base>>

Declared In

MutableCollectionType, CollectionType, SequenceType
func filter(_:)

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

Declaration

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

Declared In

MutableCollectionType, CollectionType, SequenceType
func flatMap<T>(_: (Base._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: (Base._Element) throws -> T?) rethrows -> [T]

Declared In

MutableCollectionType, CollectionType, SequenceType
func flatMap<S : SequenceType>(_: (Base._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: (Base._Element) throws -> S) rethrows -> [S.Generator.Element]

Declared In

MutableCollectionType, 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: (Base._Element) throws -> Void) rethrows

Declared In

MutableCollectionType, CollectionType, SequenceType
func generate()

Declaration

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

Declared In

MutableCollectionType, 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: (Base._Element) throws -> Bool) rethrows -> Base.Index?

Declared In

MutableCollectionType, 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: (Base._Element, Base._Element) throws -> Bool) rethrows -> Bool

Declared In

MutableCollectionType, CollectionType, SequenceType
func map(_:)

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

Complexity: O(N).

Declaration

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

Declared In

MutableCollectionType, 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: (Base._Element, Base._Element) throws -> Bool) rethrows -> Base._Element?

Declared In

MutableCollectionType, 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: (Base._Element, Base._Element) throws -> Bool) rethrows -> Base._Element?

Declared In

MutableCollectionType, CollectionType, SequenceType
mutating func popFirst()

If !self.isEmpty, remove the first element and return it, otherwise return nil.

Complexity: O(1)

Declaration

mutating func popFirst() -> Base._Element?

Declared In

MutableCollectionType, CollectionType
mutating func popLast()

If !self.isEmpty, remove the last element and return it, otherwise return nil.

Complexity: O(self.count)

Deprecated: it will be removed in Swift 3.

Declaration

mutating func popLast() -> Base._Element?

Declared In

MutableCollectionType, CollectionType
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) -> MutableSlice<Base>

Declared In

MutableCollectionType, CollectionType, SequenceType
func prefixThrough(_:)

Returns prefixUpTo(position.successor())

Complexity: O(1)

Declaration

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

Declared In

MutableCollectionType, CollectionType
func prefixUpTo(_:)

Returns self[startIndex..<end]

Complexity: O(1)

Declaration

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

Declared In

MutableCollectionType, 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, Base._Element) throws -> T) rethrows -> T

Declared In

MutableCollectionType, CollectionType, SequenceType
mutating func removeFirst()

Remove the element at startIndex and return it.

Complexity: O(1) Requires: !self.isEmpty.

Declaration

mutating func removeFirst() -> Base._Element

Declared In

MutableCollectionType, CollectionType
mutating func removeFirst(_:)

Remove the first n elements.

Complexity: - O(1) if Index conforms to RandomAccessIndexType - O(n) otherwise Requires: n >= 0 && self.count >= n.

Declaration

mutating func removeFirst(n: Int)

Declared In

MutableCollectionType, CollectionType
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() -> [Base._Element]

Declared In

MutableCollectionType, 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: (Base._Element, Base._Element) -> Bool) -> [Base._Element]

Declared In

MutableCollectionType, 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: (Base._Element) throws -> Bool) rethrows -> [MutableSlice<Base>]

Declared In

MutableCollectionType, 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: (Base._Element, Base._Element) throws -> Bool) rethrows -> Bool

Declared In

MutableCollectionType, 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) -> MutableSlice<Base>

Declared In

MutableCollectionType, CollectionType, SequenceType
func suffixFrom(_:)

Returns self[start..<endIndex]

Complexity: O(1)

Declaration

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

Declared In

MutableCollectionType, 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

MutableCollectionType, 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<MutableSlice<Base>>

Declared In

MutableCollectionType, CollectionType

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

func flatten()

A concatenation of the elements of self.

Declaration

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

Declared In

MutableCollectionType, 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

MutableCollectionType, CollectionType, SequenceType
func maxElement()

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

Complexity: O(elements.count).

Declaration

func maxElement() -> Base._Element?

Declared In

MutableCollectionType, CollectionType, SequenceType
func minElement()

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

Complexity: O(elements.count).

Declaration

func minElement() -> Base._Element?

Declared In

MutableCollectionType, 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() -> [Base._Element]

Declared In

MutableCollectionType, CollectionType, SequenceType

Where Generator.Element : Equatable

func contains(_:)

Returns true iff element is in self.

Declaration

func contains(element: Base._Element) -> Bool

Declared In

MutableCollectionType, 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

MutableCollectionType, 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: Base._Element) -> Base.Index?

Declared In

MutableCollectionType, 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: Base._Element, maxSplit: Int = default, allowEmptySlices: Bool = default) -> [MutableSlice<Base>]

Declared In

MutableCollectionType, 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

MutableCollectionType, CollectionType, SequenceType

Where Generator.Element : SequenceType

func flatten()

A concatenation of the elements of self.

Declaration

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

Declared In

MutableCollectionType, 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<MutableSlice<Base>>

Declared In

MutableCollectionType, 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

MutableCollectionType, CollectionType, SequenceType

Where Index : BidirectionalIndexType

var last: Base._Element?

Declaration

var last: Base._Element? { get }

Declared In

MutableCollectionType , CollectionType
func dropLast(_:)

Returns a subsequence containing all but the last n elements.

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

Declaration

func dropLast(n: Int) -> MutableSlice<Base>

Declared In

MutableCollectionType, CollectionType
func reverse()

Returns the elements of self in reverse order.

Complexity: O(1)

Declaration

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

Declared In

MutableCollectionType, 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) -> MutableSlice<Base>

Declared In

MutableCollectionType, CollectionType

Where Index : RandomAccessIndexType

mutating func partition(_:isOrderedBefore:)

Re-order the given range of elements in self and return a pivot index p.

Postcondition: For all i in range.startIndex..<p, and j in p..<range.endIndex, less(self[i], self[j]) && !less(self[j], self[p]). Only returns range.endIndex when self is empty.

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

Declaration

mutating func partition(range: Range<Base.Index>, isOrderedBefore: (Base._Element, Base._Element) -> Bool) -> Base.Index

Declared In

MutableCollectionType
func reverse()

Returns the elements of self in reverse order.

Complexity: O(1)

Declaration

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

Declared In

MutableCollectionType, CollectionType
mutating func sortInPlace(_:)

Sort self in-place 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

mutating func sortInPlace(@noescape isOrderedBefore: (Base._Element, Base._Element) -> Bool)

Declared In

MutableCollectionType

Where Index : RandomAccessIndexType, Generator.Element : Comparable

mutating func partition(_:)

Re-order the given range of elements in self and return a pivot index p.

Postcondition: For all i in range.startIndex..<p, and j in p..<range.endIndex, less(self[i], self[j]) && !less(self[j], self[p]). Only returns range.endIndex when self is empty.

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

Declaration

mutating func partition(range: Range<Base.Index>) -> Base.Index

Declared In

MutableCollectionType
mutating func sortInPlace()

Sort self in-place.

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

mutating func sortInPlace()

Declared In

MutableCollectionType

Where SubSequence == Self, Index : BidirectionalIndexType

mutating func popLast()

If !self.isEmpty, remove the last element and return it, otherwise return nil.

Complexity: O(1)

Declaration

mutating func popLast() -> Base._Element?

Declared In

MutableCollectionType, CollectionType
mutating func removeLast()

Remove an element from the end.

Complexity: O(1) Requires: !self.isEmpty

Declaration

mutating func removeLast() -> Base._Element

Declared In

MutableCollectionType, CollectionType
mutating func removeLast(_:)

Remove the last n elements.

Complexity: - O(1) if Index conforms to RandomAccessIndexType - O(n) otherwise Requires: n >= 0 && self.count >= n.

Declaration

mutating func removeLast(n: Int)

Declared In

MutableCollectionType, CollectionType