airspeedswift

import QuartzCore

/// Reorder elements in-place into the next permutation, returning false when
/// the collection has been permuted into lexicographical order. To cycle
/// through all permutations, start with a lexicographically-sorted collection
/// and permute until it returns false.
///
/// - Complexity: O(*n*), where *n* is the length of the collection.
public extension MutableCollection where Self: BidirectionalCollection {

airspeedswift

struct MyReversed<Base: BidirectionalCollection> {
    let base: Base
}

extension MyReversed: Collection {
    public enum Index: Comparable {
        case element(Base.Index)
        case end

airspeedswift

func tellJoke(name: String, character: Character) {
    let punchline = name.filter { $0 != character }
    let n = name.count - punchline.count
    
    let joke = """
        Q: Why does \(name) have \(n) \(character)'s in their name?
        A: I don't know, why does \(name) have \(n) \(character)'s in their name?
        Q: Because otherwise they'd be called \(punchline).
        """
    print(joke)

airspeedswift

// Swift 4.0 (and 3.2 as well!)

struct LazySplit<Base: Collection>: Collection
    where Base.Element: Equatable,
          Base.SubSequence: Collection
{
    struct Index: Comparable {
        let start, end: Base.Index
        static func ==(lhs: Index, rhs: Index) -> Bool { return lhs.start == rhs.start }
        static func < (lhs: Index, rhs: Index) -> Bool { return lhs.start < rhs.start }

airspeedswift

// this particular API/implementation for demonstration only,
// not necessarily quite what will be proposed
extension Collection where SubSequence == Self {
    /// Drop n elements from the front of `self` in-place,
    /// returning the dropped prefix.
    mutating func dropPrefix(_ n: IndexDistance) -> SubSequence {
        // nature of error handling/swallowing/trapping/optional
        // returning here TBD...
        let newStart = index(startIndex, offsetBy: n)
        defer { self = self[newStart..<endIndex] }

airspeedswift

protocol NonemptyCollection: Collection {
    var first: Iterator.Element { get }
}

enum NonemptyIndex<Base: Collection>: Comparable {
    case head
    case tail(Base.Index)

    static func ==(lhs: NonemptyIndex, rhs: NonemptyIndex) -> Bool {
        switch (lhs,rhs) {

airspeedswift

extension RangeReplaceableCollection
  where
  // Index: RandomAccessIndexType → Self: RandomAccessCollection
  Self: RandomAccessCollection,
  // still need this, until generics allow constraints to guarantee
  // this is the case for all collections...
  SubSequence.Iterator.Element == Iterator.Element {
    // mutating in-place operations should be imperative verb phrases,
    // so let's rename this stablySort

airspeedswift

private enum ListNode<Element> {
    case End
    indirect case Node(Element, next: ListNode<Element>)
    
    func cons(x: Element) -> ListNode<Element> {
        return .Node(x, next: self)
    }
}

public struct ListIndex<Element> {

airspeedswift

private enum ListNode<Element> {
    case End
    indirect case Node(Element, tag: Int, next: ListNode<Element>)
    
    /// Computed property to fetch the tag. .End has an
    /// implicit tag of zero.
    var tag: Int {
        switch self {
        case .End: return 0
        case let .Node(_, tag: n, _):

airspeedswift

private class MyArrayBuffer<Element>: ManagedBuffer<Int,Element> {
    
    func clone() -> MyArrayBuffer<Element> {
        return self.withUnsafeMutablePointerToElements { elements -> MyArrayBuffer<Element> in
            return MyArrayBuffer<Element>.create(self.allocatedElementCount) { newBuf in
                newBuf.withUnsafeMutablePointerToElements { newElems->Void in
                    newElems.initializeFrom(elements, count: self.value)
                }
                return self.value