SwiftDoc.org

Construct an empty ArraySlice

Declaration

init()

Initialization from an existing buffer does not have "array.init" semantics because the caller may retain an alias to buffer.

Declaration

init(_ buffer: _SliceBuffer<T>)

Construct from an arbitrary sequence with elements of type T

Declaration

init<S : SequenceType where T == T>(_ s: S)

Create an instance containing elements.

Declaration

init(arrayLiteral elements: T...)

Construct a ArraySlice of count elements, each initialized to repeatedValue.

Declaration

init(count: Int, repeatedValue: T)

How many elements the ArraySlice can store without reallocation

Declaration

var capacity: Int { get }

How many elements the ArraySlice stores

Declaration

var count: Int { get }

A textual representation of self, suitable for debugging.

Declaration

var debugDescription: String { get }

A textual representation of self.

Declaration

var description: String { get }

A "past-the-end" element index; the successor of the last valid subscript argument.

Declaration

var endIndex: Int { get }

The first element, or nil if the array is empty

Declaration

var first: T? { get }

true if and only if the ArraySlice is empty

Declaration

var isEmpty: Bool { get }

The last element, or nil if the array is empty

Declaration

var last: T? { get }

Always zero, which is the index of the first element when non-empty.

Declaration

var startIndex: Int { get }

Declaration

subscript(index: Int) -> T

Declaration

subscript(subRange: Range<Int>) -> ArraySlice<T>

Append newElement to the ArraySlice

Complexity: amortized O(1) unless self's storage is shared with another live array; O(count) otherwise.

Declaration

mutating func append(newElement: T)

Append the elements of newElements to self.

Complexity: O(length of result)

Declaration

mutating func extend<S : SequenceType where T == T>(newElements: S)

Return an ArraySlice containing the elements x of self for which includeElement(x) is true

Declaration

func filter(includeElement: (T) -> Bool) -> ArraySlice<T>

Return an ArraySlice containing the results of calling transform(x) on each element x of self and flattening the result.

Declaration

func flatMap<U>(transform: @noescape (T) -> ArraySlice<U>) -> ArraySlice<U>

Return a generator over the elements.

Complexity: O(1)

Declaration

func generate() -> IndexingGenerator<ArraySlice<T>>

Returns a mirror that reflects self.

Declaration

func getMirror() -> MirrorType

Insert newElement at index i.

Requires: i <= count

Complexity: O(count).

Declaration

mutating func insert(newElement: T, atIndex i: Int)

Interpose self between each consecutive pair of elements, and concatenate the elements of the resulting sequence. For example, [-1, -2].join([[1, 2, 3], [4, 5, 6], [7, 8, 9]]) yields [1, 2, 3, -1, -2, 4, 5, 6, -1, -2, 7, 8, 9]

Declaration

func join<S : SequenceType where ArraySlice<T> == ArraySlice<T>>(elements: S) -> ArraySlice<T>

Return an ArraySlice containing the results of calling transform(x) on each element x of self

Declaration

func map<U>(transform: (T) -> U) -> ArraySlice<U>

Return 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<U>(initial: U, combine: @noescape (U, T) -> U) -> U

Remove all elements.

Postcondition: capacity == 0 iff keepCapacity is false.

Complexity: O(count(self)).

Declaration

mutating func removeAll(keepCapacity: Bool = default)

Remove and return the element at index i

Invalidates all indices with respect to self.

Complexity: O(count).

Declaration

mutating func removeAtIndex(index: Int) -> T

Remove an element from the end of the ArraySlice in O(1). Requires: count > 0

Declaration

mutating func removeLast() -> T

Remove the indicated subRange of elements

Complexity: O(count).

Declaration

mutating func removeRange(subRange: Range<Int>)

Replace the given subRange of elements with newElements.

Complexity: O(count(subRange)) if subRange.endIndex == self.endIndex and isEmpty(newElements), O(N) otherwise.

Declaration

mutating func replaceRange<C : CollectionType where T == T>(subRange: Range<Int>, with newElements: C)

Reserve enough space to store minimumCapacity elements.

PostCondition: capacity >= minimumCapacity and the array has mutable contiguous storage.

Complexity: O(count)

Declaration

mutating func reserveCapacity(minimumCapacity: Int)

A ArraySlice containing the elements of self in reverse order

Declaration

func reverse() -> ArraySlice<T>

Sort self in-place according to isOrderedBefore. Requires: isOrderedBefore induces a strict weak ordering over the elements.

Declaration

mutating func sort(isOrderedBefore: (T, T) -> Bool)

Return a copy of self that has been sorted according to isOrderedBefore. Requires: isOrderedBefore induces a strict weak ordering over the elements.

Declaration

func sorted(isOrderedBefore: (T, T) -> Bool) -> ArraySlice<T>

Insert newElements at index i

Invalidates all indices with respect to self.

Complexity: O(count + count(newElements)).

Declaration

mutating func splice<S : CollectionType where T == T>(newElements: S, atIndex i: Int)

Call body(p), where p is a pointer to the ArraySlice's contiguous storage.

Often, the optimizer can eliminate bounds checks within an array algorithm, but when that fails, invoking the same algorithm on body's argument lets you trade safety for speed.

Declaration

func withUnsafeBufferPointer<R>(body: @noescape (UnsafeBufferPointer<T>) -> R) -> R

Call body(p), where p is a pointer to the ArraySlice's mutable contiguous storage.

Often, the optimizer can eliminate bounds- and uniqueness-checks within an array algorithm, but when that fails, invoking the same algorithm on body's argument lets you trade safety for speed.

Declaration

mutating func withUnsafeMutableBufferPointer<R>(body: @noescape (inout UnsafeMutableBufferPointer<T>) -> R) -> R