blob: 49bfe9d2a33ff173aaee9432bea443cbc1fbdd08 [file] [log] [blame]
//===--- Join.swift - Protocol and Algorithm for concatenation ------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2016 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
//
//===----------------------------------------------------------------------===//
internal enum _JoinIteratorState {
case start
case generatingElements
case generatingSeparator
case end
}
/// An iterator that presents the elements of the sequences traversed
/// by a base iterator, concatenated using a given separator.
public struct JoinedIterator<Base : IteratorProtocol> : IteratorProtocol
where Base.Element : Sequence {
/// Creates an iterator that presents the elements of the sequences
/// traversed by `base`, concatenated using `separator`.
///
/// - Complexity: O(`separator.count`).
public init<Separator : Sequence>(base: Base, separator: Separator)
where Separator.Iterator.Element == Base.Element.Iterator.Element {
self._base = base
self._separatorData = ContiguousArray(separator)
}
/// Advances to the next element and returns it, or `nil` if no next element
/// exists.
///
/// Once `nil` has been returned, all subsequent calls return `nil`.
public mutating func next() -> Base.Element.Iterator.Element? {
while true {
switch _state {
case .start:
if let nextSubSequence = _base.next() {
_inner = nextSubSequence.makeIterator()
_state = .generatingElements
} else {
_state = .end
return nil
}
case .generatingElements:
let result = _inner!.next()
if _fastPath(result != nil) {
return result
}
_inner = _base.next()?.makeIterator()
if _inner == nil {
_state = .end
return nil
}
if !_separatorData.isEmpty {
_separator = _separatorData.makeIterator()
_state = .generatingSeparator
}
case .generatingSeparator:
let result = _separator!.next()
if _fastPath(result != nil) {
return result
}
_state = .generatingElements
case .end:
return nil
}
}
}
internal var _base: Base
internal var _inner: Base.Element.Iterator?
internal var _separatorData: ContiguousArray<Base.Element.Iterator.Element>
internal var _separator:
ContiguousArray<Base.Element.Iterator.Element>.Iterator?
internal var _state: _JoinIteratorState = .start
}
/// A sequence that presents the elements of a base sequence of sequences
/// concatenated using a given separator.
public struct JoinedSequence<Base : Sequence> : Sequence
where Base.Iterator.Element : Sequence {
/// Creates a sequence that presents the elements of `base` sequences
/// concatenated using `separator`.
///
/// - Complexity: O(`separator.count`).
public init<Separator : Sequence>(base: Base, separator: Separator)
where Separator.Iterator.Element == Base.Iterator.Element.Iterator.Element {
self._base = base
self._separator = ContiguousArray(separator)
}
/// Return an iterator over the elements of this sequence.
///
/// - Complexity: O(1).
public func makeIterator() -> JoinedIterator<Base.Iterator> {
return JoinedIterator(
base: _base.makeIterator(),
separator: _separator)
}
public func _copyToContiguousArray()
-> ContiguousArray<Base.Iterator.Element.Iterator.Element> {
var result = ContiguousArray<Iterator.Element>()
let separatorSize: Int = numericCast(_separator.count)
let reservation = _base._preprocessingPass {
() -> Int in
var r = 0
for chunk in _base {
r += separatorSize + chunk.underestimatedCount
}
return r - separatorSize
}
if let n = reservation {
result.reserveCapacity(numericCast(n))
}
if separatorSize == 0 {
for x in _base {
result.append(contentsOf: x)
}
return result
}
var iter = _base.makeIterator()
if let first = iter.next() {
result.append(contentsOf: first)
while let next = iter.next() {
result.append(contentsOf: _separator)
result.append(contentsOf: next)
}
}
return result
}
internal var _base: Base
internal var _separator:
ContiguousArray<Base.Iterator.Element.Iterator.Element>
}
extension Sequence where Iterator.Element : Sequence {
/// Returns the concatenated elements of this sequence of sequences,
/// inserting the given separator between each element.
///
/// This example shows how an array of `[Int]` instances can be joined, using
/// another `[Int]` instance as the separator:
///
/// let nestedNumbers = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
/// let joined = nestedNumbers.joined(separator: [-1, -2])
/// print(Array(joined))
/// // Prints "[1, 2, 3, -1, -2, 4, 5, 6, -1, -2, 7, 8, 9]"
///
/// - Parameter separator: A sequence to insert between each of this
/// sequence's elements.
/// - Returns: The joined sequence of elements.
///
/// - SeeAlso: `joined()`
public func joined<Separator : Sequence>(
separator: Separator
) -> JoinedSequence<Self>
where Separator.Iterator.Element == Iterator.Element.Iterator.Element {
return JoinedSequence(base: self, separator: separator)
}
}
@available(*, unavailable, renamed: "JoinedIterator")
public struct JoinGenerator<Base : IteratorProtocol>
where Base.Element : Sequence {}
extension JoinedSequence {
@available(*, unavailable, renamed: "makeIterator()")
public func generate() -> JoinedIterator<Base.Iterator> {
Builtin.unreachable()
}
}
extension Sequence where Iterator.Element : Sequence {
@available(*, unavailable, renamed: "joined(separator:)")
public func joinWithSeparator<Separator : Sequence>(
_ separator: Separator
) -> JoinedSequence<Self>
where Separator.Iterator.Element == Iterator.Element.Iterator.Element {
Builtin.unreachable()
}
}