Files
Tim Vermeulen c5ea9e3e36 Prepare for Swift Algorithms 1.0 (#167)
* Rename types to include a Sequence or Collection suffix, and clean up some guides

* Various refactors

* Replace `validateIndexTraversals` test method with `IndexValidator` type

* Add LazySequenceProtocol to StridingSequence, StridingCollection

* Update the Numerics dependency to 1.0

* Set `IndexedCollection.Indices` to `Base.Indices`

* Remove deprecations

* Update the changelog/README for the 1.0.0 release

* Fix compiler error on Linux

* Rename `WindowsCollection` to `WindowsOfCountCollection`
2021-09-09 01:01:36 +02:00

960 B

Indexed

[Source | Tests]

The enumerated method, but pairing each element with its index instead of an incrementing integer counter.

This is essentially equivalent to zip(x.indices, x):

let numbers = [10, 20, 30, 40, 50]
var matchingIndices: Set<Int> = []
for (i, n) in numbers.indexed() {
    if n.isMultiple(of: 20) { 
        matchingIndices.insert(i) 
    }
}
// matchingIndices == [1, 3]

Detailed Design

The indexed method returns an IndexedCollection type:

extension Collection {
    func indexed() -> IndexedCollection<Self>
}

IndexedCollection scales from a collection up to a random-access collection, depending on its base type. Indexed also conforms to LazySequenceProtocol when the base type conforms.