mirror of
https://github.com/apple/swift.git
synced 2025-12-21 12:14:44 +01:00
First in a long series of commits to clean up the array implementation and make it maintainable by the stdlib team. Swift SVN r32311
703 lines
22 KiB
Swift
703 lines
22 KiB
Swift
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See http://swift.org/LICENSE.txt for license information
|
|
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
import SwiftShims
|
|
|
|
/// Class used whose sole instance is used as storage for empty
|
|
/// arrays. The instance is defined in the runtime and statically
|
|
/// initialized. See stdlib/runtime/GlobalObjects.cpp for details.
|
|
/// Because it's statically referenced, it requires nonlazy realization
|
|
/// by the Objective-C runtime.
|
|
@objc_non_lazy_realization
|
|
internal final class _EmptyArrayStorage
|
|
: _ContiguousArrayStorageBase {
|
|
|
|
init(_doNotCallMe: ()) {
|
|
_sanityCheckFailure("creating instance of _EmptyArrayStorage")
|
|
}
|
|
|
|
var countAndCapacity: _ArrayBody
|
|
|
|
#if _runtime(_ObjC)
|
|
override func _withVerbatimBridgedUnsafeBuffer<R>(
|
|
@noescape body: (UnsafeBufferPointer<AnyObject>) throws -> R
|
|
) rethrows -> R? {
|
|
return try body(UnsafeBufferPointer(start: nil, count: 0))
|
|
}
|
|
|
|
@warn_unused_result
|
|
override func _getNonVerbatimBridgedCount(dummy: Void) -> Int {
|
|
return 0
|
|
}
|
|
|
|
@warn_unused_result
|
|
override func _getNonVerbatimBridgedHeapBuffer(
|
|
dummy: Void
|
|
) -> _HeapBuffer<Int, AnyObject> {
|
|
return _HeapBuffer<Int, AnyObject>(
|
|
_HeapBufferStorage<Int, AnyObject>.self, 0, 0)
|
|
}
|
|
#endif
|
|
|
|
@warn_unused_result
|
|
override func canStoreElementsOfDynamicType(_: Any.Type) -> Bool {
|
|
return false
|
|
}
|
|
|
|
/// A type that every element in the array is.
|
|
override var staticElementType: Any.Type {
|
|
return Void.self
|
|
}
|
|
}
|
|
|
|
/// The empty array prototype. We use the same object for all empty
|
|
/// `[Native]Array<Element>`s.
|
|
internal var _emptyArrayStorage : _EmptyArrayStorage {
|
|
return Builtin.bridgeFromRawPointer(
|
|
Builtin.addressof(&_swiftEmptyArrayStorage))
|
|
}
|
|
|
|
// FIXME: This whole class is a workaround for
|
|
// <rdar://problem/18560464> Can't override generic method in generic
|
|
// subclass. If it weren't for that bug, we'd override
|
|
// _withVerbatimBridgedUnsafeBuffer directly in
|
|
// _ContiguousArrayStorage<Element>.
|
|
class _ContiguousArrayStorage1 : _ContiguousArrayStorageBase {
|
|
#if _runtime(_ObjC)
|
|
/// If the `Element` is bridged verbatim, invoke `body` on an
|
|
/// `UnsafeBufferPointer` to the elements and return the result.
|
|
/// Otherwise, return `nil`.
|
|
final override func _withVerbatimBridgedUnsafeBuffer<R>(
|
|
@noescape body: (UnsafeBufferPointer<AnyObject>) throws -> R
|
|
) rethrows -> R? {
|
|
var result: R? = nil
|
|
try self._withVerbatimBridgedUnsafeBufferImpl {
|
|
result = try body($0)
|
|
}
|
|
return result
|
|
}
|
|
|
|
/// If `Element` is bridged verbatim, invoke `body` on an
|
|
/// `UnsafeBufferPointer` to the elements.
|
|
internal func _withVerbatimBridgedUnsafeBufferImpl(
|
|
@noescape body: (UnsafeBufferPointer<AnyObject>) throws -> Void
|
|
) rethrows {
|
|
_sanityCheckFailure(
|
|
"Must override _withVerbatimBridgedUnsafeBufferImpl in derived classes")
|
|
}
|
|
#endif
|
|
}
|
|
|
|
// The class that implements the storage for a ContiguousArray<Element>
|
|
final class _ContiguousArrayStorage<Element> : _ContiguousArrayStorage1 {
|
|
|
|
deinit {
|
|
__manager._elementPointer.destroy(__manager._valuePointer.memory.count)
|
|
__manager._valuePointer.destroy()
|
|
_fixLifetime(__manager)
|
|
}
|
|
|
|
#if _runtime(_ObjC)
|
|
/// If `Element` is bridged verbatim, invoke `body` on an
|
|
/// `UnsafeBufferPointer` to the elements.
|
|
internal final override func _withVerbatimBridgedUnsafeBufferImpl(
|
|
@noescape body: (UnsafeBufferPointer<AnyObject>) throws -> Void
|
|
) rethrows {
|
|
if _isBridgedVerbatimToObjectiveC(Element.self) {
|
|
let count = __manager.value.count
|
|
let elements = UnsafePointer<AnyObject>(__manager._elementPointer)
|
|
defer { _fixLifetime(__manager) }
|
|
try body(UnsafeBufferPointer(start: elements, count: count))
|
|
}
|
|
}
|
|
|
|
/// Returns the number of elements in the array.
|
|
///
|
|
/// - Precondition: `Element` is bridged non-verbatim.
|
|
@warn_unused_result
|
|
override internal func _getNonVerbatimBridgedCount(dummy: Void) -> Int {
|
|
_sanityCheck(
|
|
!_isBridgedVerbatimToObjectiveC(Element.self),
|
|
"Verbatim bridging should be handled separately")
|
|
return __manager.value.count
|
|
}
|
|
|
|
/// Bridge array elements and return a new buffer that owns them.
|
|
///
|
|
/// - Precondition: `Element` is bridged non-verbatim.
|
|
@warn_unused_result
|
|
override internal func _getNonVerbatimBridgedHeapBuffer(dummy: Void) ->
|
|
_HeapBuffer<Int, AnyObject> {
|
|
_sanityCheck(
|
|
!_isBridgedVerbatimToObjectiveC(Element.self),
|
|
"Verbatim bridging should be handled separately")
|
|
let count = __manager.value.count
|
|
let result = _HeapBuffer<Int, AnyObject>(
|
|
_HeapBufferStorage<Int, AnyObject>.self, count, count)
|
|
let resultPtr = result.baseAddress
|
|
let p = __manager._elementPointer
|
|
for i in 0..<count {
|
|
(resultPtr + i).initialize(_bridgeToObjectiveCUnconditional(p[i]))
|
|
}
|
|
_fixLifetime(__manager)
|
|
return result
|
|
}
|
|
#endif
|
|
|
|
/// Return true if the `proposedElementType` is `Element` or a subclass of
|
|
/// `Element`. We can't store anything else without violating type
|
|
/// safety; for example, the destructor has static knowledge that
|
|
/// all of the elements can be destroyed as `Element`.
|
|
@warn_unused_result
|
|
override func canStoreElementsOfDynamicType(
|
|
proposedElementType: Any.Type
|
|
) -> Bool {
|
|
#if _runtime(_ObjC)
|
|
return proposedElementType is Element.Type
|
|
#else
|
|
// FIXME: Dynamic casts don't currently work without objc.
|
|
// rdar://problem/18801510
|
|
return false
|
|
#endif
|
|
}
|
|
|
|
/// A type that every element in the array is.
|
|
override var staticElementType: Any.Type {
|
|
return Element.self
|
|
}
|
|
|
|
internal // private
|
|
typealias Manager = ManagedBufferPointer<_ArrayBody, Element>
|
|
|
|
internal // private
|
|
var __manager : Manager {
|
|
return Manager(_uncheckedUnsafeBufferObject: self)
|
|
}
|
|
}
|
|
|
|
public struct _ContiguousArrayBuffer<Element> : _ArrayBufferType {
|
|
|
|
/// Make a buffer with uninitialized elements. After using this
|
|
/// method, you must either initialize the count elements at the
|
|
/// result's .firstElementAddress or set the result's .count to zero.
|
|
public init(count: Int, minimumCapacity: Int) {
|
|
let realMinimumCapacity = max(count, minimumCapacity)
|
|
if realMinimumCapacity == 0 {
|
|
self = _ContiguousArrayBuffer<Element>()
|
|
}
|
|
else {
|
|
__bufferPointer = ManagedBufferPointer(
|
|
_uncheckedBufferClass: _ContiguousArrayStorage<Element>.self,
|
|
minimumCapacity: realMinimumCapacity)
|
|
|
|
#if _runtime(_ObjC)
|
|
let verbatim = _isBridgedVerbatimToObjectiveC(Element.self)
|
|
#else
|
|
let verbatim = false
|
|
#endif
|
|
|
|
__bufferPointer._valuePointer.initialize(
|
|
_ArrayBody(
|
|
count: count,
|
|
capacity: __bufferPointer.allocatedElementCount,
|
|
elementTypeIsBridgedVerbatim: verbatim))
|
|
|
|
_fixLifetime(__bufferPointer)
|
|
}
|
|
}
|
|
|
|
init(_ storage: _ContiguousArrayStorageBase) {
|
|
__bufferPointer = ManagedBufferPointer(
|
|
_uncheckedUnsafeBufferObject: storage)
|
|
}
|
|
|
|
var arrayPropertyIsNative : Bool {
|
|
return true
|
|
}
|
|
|
|
/// True, if the array is native and does not need a deferred type check.
|
|
var arrayPropertyIsNativeTypeChecked : Bool {
|
|
return true
|
|
}
|
|
|
|
/// If the elements are stored contiguously, a pointer to the first
|
|
/// element. Otherwise, nil.
|
|
public var firstElementAddress: UnsafeMutablePointer<Element> {
|
|
return __bufferPointer._elementPointer
|
|
}
|
|
|
|
/// Call `body(p)`, where `p` is an `UnsafeBufferPointer` over the
|
|
/// underlying contiguous storage.
|
|
public func withUnsafeBufferPointer<R>(
|
|
@noescape body: UnsafeBufferPointer<Element> throws -> R
|
|
) rethrows -> R {
|
|
defer { _fixLifetime(self) }
|
|
return try body(UnsafeBufferPointer(start: firstElementAddress,
|
|
count: count))
|
|
}
|
|
|
|
/// Call `body(p)`, where `p` is an `UnsafeMutableBufferPointer`
|
|
/// over the underlying contiguous storage.
|
|
public mutating func withUnsafeMutableBufferPointer<R>(
|
|
@noescape body: UnsafeMutableBufferPointer<Element> throws -> R
|
|
) rethrows -> R {
|
|
defer { _fixLifetime(self) }
|
|
return try body(
|
|
UnsafeMutableBufferPointer(start: firstElementAddress, count: count))
|
|
}
|
|
|
|
//===--- _ArrayBufferType conformance -----------------------------------===//
|
|
/// Create an empty buffer.
|
|
public init() {
|
|
__bufferPointer = ManagedBufferPointer(
|
|
_uncheckedUnsafeBufferObject: _emptyArrayStorage)
|
|
}
|
|
|
|
public init(_ buffer: _ContiguousArrayBuffer, shiftedToStartIndex: Int) {
|
|
_sanityCheck(shiftedToStartIndex == 0, "shiftedToStartIndex must be 0")
|
|
self = buffer
|
|
}
|
|
|
|
@warn_unused_result
|
|
public mutating func requestUniqueMutableBackingBuffer(minimumCapacity: Int)
|
|
-> _ContiguousArrayBuffer<Element>?
|
|
{
|
|
if _fastPath(isUniquelyReferenced() && capacity >= minimumCapacity) {
|
|
return self
|
|
}
|
|
return nil
|
|
}
|
|
|
|
@warn_unused_result
|
|
public mutating func isMutableAndUniquelyReferenced() -> Bool {
|
|
return isUniquelyReferenced()
|
|
}
|
|
|
|
@warn_unused_result
|
|
public mutating func isMutableAndUniquelyReferencedOrPinned() -> Bool {
|
|
return isUniquelyReferencedOrPinned()
|
|
}
|
|
|
|
/// If this buffer is backed by a `_ContiguousArrayBuffer`
|
|
/// containing the same number of elements as `self`, return it.
|
|
/// Otherwise, return `nil`.
|
|
@warn_unused_result
|
|
public func requestNativeBuffer() -> _ContiguousArrayBuffer<Element>? {
|
|
return self
|
|
}
|
|
|
|
@warn_unused_result
|
|
func getElement(i: Int, hoistedIsNativeTypeCheckedBuffer: Bool) -> Element {
|
|
_sanityCheck(
|
|
_isValidSubscript(i,
|
|
hoistedIsNativeBuffer: hoistedIsNativeTypeCheckedBuffer),
|
|
"Array index out of range")
|
|
// If the index is in bounds, we can assume we have storage.
|
|
return firstElementAddress[i]
|
|
}
|
|
|
|
/// Get or set the value of the ith element.
|
|
public subscript(i: Int) -> Element {
|
|
get {
|
|
return getElement(i, hoistedIsNativeTypeCheckedBuffer: true)
|
|
}
|
|
nonmutating set {
|
|
_sanityCheck(i >= 0 && i < count, "Array index out of range")
|
|
// If the index is in bounds, we can assume we have storage.
|
|
|
|
// FIXME: Manually swap because it makes the ARC optimizer happy. See
|
|
// <rdar://problem/16831852> check retain/release order
|
|
// firstElementAddress[i] = newValue
|
|
var nv = newValue
|
|
let tmp = nv
|
|
nv = firstElementAddress[i]
|
|
firstElementAddress[i] = tmp
|
|
}
|
|
}
|
|
|
|
/// The number of elements the buffer stores.
|
|
public var count: Int {
|
|
get {
|
|
return __bufferPointer.value.count
|
|
}
|
|
nonmutating set {
|
|
_sanityCheck(newValue >= 0)
|
|
|
|
_sanityCheck(
|
|
newValue <= capacity,
|
|
"Can't grow an array buffer past its capacity")
|
|
|
|
__bufferPointer._valuePointer.memory.count = newValue
|
|
}
|
|
}
|
|
|
|
/// Returns whether the given `index` is valid for subscripting, i.e. `0
|
|
/// ≤ index < count`.
|
|
@warn_unused_result
|
|
func _isValidSubscript(index : Int, hoistedIsNativeBuffer : Bool) -> Bool {
|
|
/// Instead of returning 0 for no storage, we explicitly check
|
|
/// for the existance of storage.
|
|
/// Note that this is better than folding hasStorage in to
|
|
/// the return from this function, as this implementation generates
|
|
/// no shortcircuiting blocks.
|
|
return (index >= 0) && (index < __bufferPointer.value.count)
|
|
}
|
|
|
|
/// Returns whether the given `index` is valid for subscripting, i.e. `0
|
|
/// ≤ index < count`.
|
|
///
|
|
/// For ContiguousArrayBuffer, this is equivalent to the
|
|
/// `_isValidSubscript(_:hoistedIsNativeBuffer:)` form, but is necessary
|
|
/// for interface parity with `ArrayBuffer`.
|
|
@inline(__always)
|
|
@warn_unused_result
|
|
func _isValidSubscript(index : Int, hoistedIsNativeTypeCheckedBuffer : Bool)
|
|
-> Bool {
|
|
return _isValidSubscript(index,
|
|
hoistedIsNativeTypeCheckedBuffer : hoistedIsNativeTypeCheckedBuffer)
|
|
}
|
|
|
|
/// The number of elements the buffer can store without reallocation.
|
|
public var capacity: Int {
|
|
return __bufferPointer.value.capacity
|
|
}
|
|
|
|
/// Copy the given subRange of this buffer into uninitialized memory
|
|
/// starting at target. Return a pointer past-the-end of the
|
|
/// just-initialized memory.
|
|
public func _uninitializedCopy(
|
|
subRange: Range<Int>, target: UnsafeMutablePointer<Element>
|
|
) -> UnsafeMutablePointer<Element> {
|
|
_sanityCheck(subRange.startIndex >= 0)
|
|
_sanityCheck(subRange.endIndex >= subRange.startIndex)
|
|
_sanityCheck(subRange.endIndex <= count)
|
|
|
|
let c = subRange.endIndex - subRange.startIndex
|
|
target.initializeFrom(firstElementAddress + subRange.startIndex, count: c)
|
|
_fixLifetime(owner)
|
|
return target + c
|
|
}
|
|
|
|
/// Returns a `_SliceBuffer` containing the given `subRange` of values
|
|
/// from this buffer.
|
|
public subscript(subRange: Range<Int>) -> _SliceBuffer<Element> {
|
|
get {
|
|
return _SliceBuffer(
|
|
owner: __bufferPointer.buffer,
|
|
subscriptBaseAddress: subscriptBaseAddress,
|
|
indices: subRange,
|
|
hasNativeBuffer: true)
|
|
}
|
|
set {
|
|
fatalError("not implemented")
|
|
}
|
|
}
|
|
|
|
/// Returns `true` iff this buffer's storage is uniquely-referenced.
|
|
///
|
|
/// - Note: This does not mean the buffer is mutable. Other factors
|
|
/// may need to be considered, such as whether the buffer could be
|
|
/// some immutable Cocoa container.
|
|
@warn_unused_result
|
|
public mutating func isUniquelyReferenced() -> Bool {
|
|
return __bufferPointer.holdsUniqueReference()
|
|
}
|
|
|
|
/// Return true iff this buffer's storage is either
|
|
/// uniquely-referenced or pinned. NOTE: this does not mean
|
|
/// the buffer is mutable; see the comment on isUniquelyReferenced.
|
|
@warn_unused_result
|
|
public mutating func isUniquelyReferencedOrPinned() -> Bool {
|
|
return __bufferPointer.holdsUniqueOrPinnedReference()
|
|
}
|
|
|
|
#if _runtime(_ObjC)
|
|
/// Convert to an NSArray.
|
|
///
|
|
/// - Precondition: `Element` is bridged to Objective-C.
|
|
///
|
|
/// - Complexity: O(1).
|
|
@warn_unused_result
|
|
public func _asCocoaArray() -> _NSArrayCoreType {
|
|
_sanityCheck(
|
|
_isBridgedToObjectiveC(Element.self),
|
|
"Array element type is not bridged to Objective-C")
|
|
if count == 0 {
|
|
return _SwiftDeferredNSArray(
|
|
_nativeStorage: _emptyArrayStorage)
|
|
}
|
|
return _SwiftDeferredNSArray(_nativeStorage: _storage)
|
|
}
|
|
#endif
|
|
|
|
/// An object that keeps the elements stored in this buffer alive.
|
|
public var owner: AnyObject {
|
|
return _storage
|
|
}
|
|
|
|
/// An object that keeps the elements stored in this buffer alive.
|
|
public var nativeOwner: AnyObject {
|
|
return _storage
|
|
}
|
|
|
|
/// A value that identifies the storage used by the buffer.
|
|
///
|
|
/// Two buffers address the same elements when they have the same
|
|
/// identity and count.
|
|
public var identity: UnsafePointer<Void> {
|
|
return withUnsafeBufferPointer { UnsafePointer($0.baseAddress) }
|
|
}
|
|
|
|
/// Return true iff we have storage for elements of the given
|
|
/// `proposedElementType`. If not, we'll be treated as immutable.
|
|
func canStoreElementsOfDynamicType(proposedElementType: Any.Type) -> Bool {
|
|
return _storage.canStoreElementsOfDynamicType(proposedElementType)
|
|
}
|
|
|
|
/// Return true if the buffer stores only elements of type `U`.
|
|
///
|
|
/// - Requires: `U` is a class or `@objc` existential.
|
|
///
|
|
/// - Complexity: O(N).
|
|
@warn_unused_result
|
|
func storesOnlyElementsOfType<U>(
|
|
_: U.Type
|
|
) -> Bool {
|
|
_sanityCheck(_isClassOrObjCExistential(U.self))
|
|
|
|
if _fastPath(_storage.staticElementType is U.Type) {
|
|
// Done in O(1)
|
|
return true
|
|
}
|
|
|
|
// Check the elements
|
|
for x in self {
|
|
if !(x is U) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
internal var _storage: _ContiguousArrayStorageBase {
|
|
return Builtin.castFromNativeObject(__bufferPointer._nativeBuffer)
|
|
}
|
|
|
|
var __bufferPointer: ManagedBufferPointer<_ArrayBody, Element>
|
|
}
|
|
|
|
/// Append the elements of `rhs` to `lhs`.
|
|
public func += <
|
|
Element, C : CollectionType where C.Generator.Element == Element
|
|
> (inout lhs: _ContiguousArrayBuffer<Element>, rhs: C) {
|
|
let oldCount = lhs.count
|
|
let newCount = oldCount + numericCast(rhs.count)
|
|
|
|
if _fastPath(newCount <= lhs.capacity) {
|
|
lhs.count = newCount
|
|
(lhs.firstElementAddress + oldCount).initializeFrom(rhs)
|
|
}
|
|
else {
|
|
var newLHS = _ContiguousArrayBuffer<Element>(
|
|
count: newCount,
|
|
minimumCapacity: _growArrayCapacity(lhs.capacity))
|
|
|
|
newLHS.firstElementAddress.moveInitializeFrom(
|
|
lhs.firstElementAddress, count: oldCount)
|
|
lhs.count = 0
|
|
swap(&lhs, &newLHS)
|
|
(lhs.firstElementAddress + oldCount).initializeFrom(rhs)
|
|
}
|
|
}
|
|
|
|
extension _ContiguousArrayBuffer : CollectionType {
|
|
/// The position of the first element in a non-empty collection.
|
|
///
|
|
/// In an empty collection, `startIndex == endIndex`.
|
|
public var startIndex: Int {
|
|
return 0
|
|
}
|
|
/// 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()`.
|
|
public var endIndex: Int {
|
|
return count
|
|
}
|
|
}
|
|
|
|
extension SequenceType {
|
|
public func _copyToNativeArrayBuffer()
|
|
-> _ContiguousArrayBuffer<Generator.Element> {
|
|
return _copySequenceToNativeArrayBuffer(self)
|
|
}
|
|
}
|
|
|
|
@warn_unused_result
|
|
internal func _copySequenceToNativeArrayBuffer<
|
|
S : SequenceType
|
|
>(source: S) -> _ContiguousArrayBuffer<S.Generator.Element> {
|
|
let initialCapacity = source.underestimateCount()
|
|
var builder =
|
|
_UnsafePartiallyInitializedContiguousArrayBuffer<S.Generator.Element>(
|
|
initialCapacity: initialCapacity)
|
|
|
|
var generator = source.generate()
|
|
|
|
// FIXME(performance): use _initializeTo().
|
|
|
|
// Add elements up to the initial capacity without checking for regrowth.
|
|
for _ in 0..<initialCapacity {
|
|
builder.addWithExistingCapacity(generator.next()!)
|
|
}
|
|
|
|
// Add remaining elements, if any.
|
|
while let element = generator.next() {
|
|
builder.add(element)
|
|
}
|
|
|
|
return builder.finish()
|
|
}
|
|
|
|
extension CollectionType {
|
|
public func _copyToNativeArrayBuffer(
|
|
) -> _ContiguousArrayBuffer<Generator.Element> {
|
|
return _copyCollectionToNativeArrayBuffer(self)
|
|
}
|
|
}
|
|
|
|
extension _ContiguousArrayBuffer {
|
|
public func _copyToNativeArrayBuffer() -> _ContiguousArrayBuffer<Element> {
|
|
return self
|
|
}
|
|
}
|
|
|
|
/// This is a fast implemention of _copyToNativeArrayBuffer() for collections.
|
|
///
|
|
/// It avoids the extra retain, release overhead from storing the
|
|
/// ContiguousArrayBuffer into
|
|
/// _UnsafePartiallyInitializedContiguousArrayBuffer. Since we do not support
|
|
/// ARC loops, the extra retain, release overhead can not be eliminated which
|
|
/// makes assigning ranges very slow. Once this has been implemented, this code
|
|
/// should be changed to use _UnsafePartiallyInitializedContiguousArrayBuffer.
|
|
@warn_unused_result
|
|
internal func _copyCollectionToNativeArrayBuffer<
|
|
C : CollectionType
|
|
>(source: C) -> _ContiguousArrayBuffer<C.Generator.Element>
|
|
{
|
|
let count: Int = numericCast(source.count)
|
|
if count == 0 {
|
|
return _ContiguousArrayBuffer()
|
|
}
|
|
|
|
let result = _ContiguousArrayBuffer<C.Generator.Element>(
|
|
count: numericCast(count),
|
|
minimumCapacity: 0
|
|
)
|
|
|
|
var p = result.firstElementAddress
|
|
var i = source.startIndex
|
|
for _ in 0..<count {
|
|
// FIXME(performance): use _initializeTo().
|
|
(p++).initialize(source[i++])
|
|
}
|
|
_expectEnd(i, source)
|
|
return result;
|
|
}
|
|
|
|
/// A "builder" interface for initializing array buffers.
|
|
///
|
|
/// This presents a "builder" interface for initializing an array buffer
|
|
/// element-by-element. The type is unsafe because it cannot be deinitialized
|
|
/// until the buffer has been finalized by a call to `finish`.
|
|
internal struct _UnsafePartiallyInitializedContiguousArrayBuffer<Element> {
|
|
internal var result: _ContiguousArrayBuffer<Element>
|
|
internal var p: UnsafeMutablePointer<Element>
|
|
internal var remainingCapacity: Int
|
|
|
|
/// Initialize the buffer with an initial size of `initialCapacity`
|
|
/// elements.
|
|
@inline(__always) // For performance reasons.
|
|
init(initialCapacity: Int) {
|
|
if initialCapacity == 0 {
|
|
result = _ContiguousArrayBuffer()
|
|
} else {
|
|
result = _ContiguousArrayBuffer(count: initialCapacity,
|
|
minimumCapacity: 0)
|
|
}
|
|
|
|
p = result.firstElementAddress
|
|
remainingCapacity = result.capacity
|
|
}
|
|
|
|
/// Add an element to the buffer, reallocating if necessary.
|
|
@inline(__always) // For performance reasons.
|
|
mutating func add(element: Element) {
|
|
if remainingCapacity == 0 {
|
|
// Reallocate.
|
|
let newCapacity = max(_growArrayCapacity(result.capacity), 1)
|
|
var newResult = _ContiguousArrayBuffer<Element>(count: newCapacity,
|
|
minimumCapacity: 0)
|
|
p = newResult.firstElementAddress + result.capacity
|
|
remainingCapacity = newResult.capacity - result.capacity
|
|
newResult.firstElementAddress.moveInitializeFrom(
|
|
result.firstElementAddress,
|
|
count: result.capacity)
|
|
result.count = 0
|
|
swap(&result, &newResult)
|
|
}
|
|
addWithExistingCapacity(element)
|
|
}
|
|
|
|
/// Add an element to the buffer, which must have remaining capacity.
|
|
@inline(__always) // For performance reasons.
|
|
mutating func addWithExistingCapacity(element: Element) {
|
|
_sanityCheck(remainingCapacity > 0,
|
|
"_UnsafePartiallyInitializedContiguousArrayBuffer has no more capacity")
|
|
remainingCapacity--
|
|
|
|
(p++).initialize(element)
|
|
}
|
|
|
|
/// Finish initializing the buffer, adjusting its count to the final
|
|
/// number of elements.
|
|
///
|
|
/// Returns the fully-initialized buffer. `self` is reset to contain an
|
|
/// empty buffer and cannot be used afterward.
|
|
@inline(__always) // For performance reasons.
|
|
@warn_unused_result
|
|
mutating func finish() -> _ContiguousArrayBuffer<Element> {
|
|
// Adjust the initialized count of the buffer.
|
|
result.count = result.capacity - remainingCapacity
|
|
|
|
return finishWithOriginalCount()
|
|
}
|
|
|
|
/// Finish initializing the buffer, assuming that the number of elements
|
|
/// exactly matches the `initialCount` for which the initialization was
|
|
/// started.
|
|
///
|
|
/// Returns the fully-initialized buffer. `self` is reset to contain an
|
|
/// empty buffer and cannot be used afterward.
|
|
@inline(__always) // For performance reasons.
|
|
@warn_unused_result
|
|
mutating func finishWithOriginalCount() -> _ContiguousArrayBuffer<Element> {
|
|
_sanityCheck(remainingCapacity == result.capacity - result.count,
|
|
"_UnsafePartiallyInitializedContiguousArrayBuffer has incorrect count")
|
|
var finalResult = _ContiguousArrayBuffer<Element>()
|
|
swap(&finalResult, &result)
|
|
remainingCapacity = 0
|
|
return finalResult
|
|
}
|
|
}
|