| import Foundation | |
| extension Collection { | |
| /// Returns the index range for the earliest subsequence of this collection | |
| /// that is equivalent to the given sequence, using the given predicate to | |
| /// compare elements. | |
| /// | |
| /// The predicate must be an equivalence relation over the elements. |
| extension Collection { | |
| /// If the collection does not have the given sequence as a prefix when | |
| /// using the given predicate to compare elements, returns the collection | |
| /// as-is; otherwise, returns the part of the collection after that prefix. | |
| /// | |
| /// The predicate must be an equivalence relation over the elements. | |
| /// | |
| /// Whether a prefix was actually dropped can be tested by checking if the | |
| /// returned sub-sequence's `startIndex` is greater than the collection's |
This manifesto outlines a plan to add compound types corresponding to fixed-size scoped-storage homogenous containers.
Array. Possibly other members too.
| //===--- ChunkedCollection.swift ------------------------------*- swift -*-===// | |
| // | |
| // Created by Daryle Walker on 2020-Feb-29 | |
| // | |
| // Copyright © 2020 Daryle Walker | |
| // | |
| // A generic type that models a Collection that wraps another, vending fixed- | |
| // sized sub-sequences (i.e. chunks) of the inner collection as the elements of | |
| // the outer collection. There is an option whether or not to vend the last | |
| // chunks if they occur late enough that they are shorter than expected. |
| //===--- AdjacentPermutation.swift ----------------------------*- swift -*-===// | |
| // | |
| // Created by Daryle Walker on 2019-Nov-27 | |
| // | |
| // Copyright © 2019 Daryle Walker | |
| // | |
| // Methods to rearrange a collection to its next or previous permutation. | |
| // Methods to return a sequence of all permutations of a collection, both lazy | |
| // and eager. | |
| // |
| // MARK: Per-Element Sharing in Merged Sorted Sequences | |
| /// Primary source categories when merging two sets together. | |
| public enum MergedSetElementSource<Element> { | |
| /// The given element is only in the first set. | |
| case exclusivelyFirst(Element) | |
| /// The element is in both sets. Both versions are given. | |
| case shared(Element, Element) | |
| /// The given element is only in the second set. |
| extension Collection { | |
| /// Computes the binary-tree children indices for the given starting index, | |
| /// if the collection is long enough. | |
| /// | |
| /// Child elements of a flattened tree are consecutive, so if two indices | |
| /// are returned, `distance(from: left!, to: right!) == 1`. | |
| /// | |
| /// - Parameter source: The index of the parent element. | |
| /// - Returns: A tuple with the indices of the left and right binary-tree |
| // | |
| // IntegerNull.swift | |
| // ZeroInteger | |
| // | |
| // Created by Daryle Walker on 8/27/19. | |
| // Copyright © 2019 Daryle Walker. All rights reserved. | |
| // | |
| // MARK: Zero-bit Integer Primary Definitions |
| // | |
| // BinarySearch.swift | |
| // SortedSet | |
| // | |
| // Created by Daryle Walker on 8/22/19. | |
| // Copyright © 2019 Daryle Walker. All rights reserved. | |
| // | |
| extension Collection { |
This manifesto is for collecting the ideas needed to introduce the classic fixed-size array family of types to Swift.