Skip to content

Fix typos #222

New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

Merged
merged 1 commit into from
Feb 7, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Guides/Keyed.md
Original file line number Diff line number Diff line change
Expand Up @@ -71,7 +71,7 @@ Calling `keyed(by:)` is an O(_n_) operation.

#### Alternative names

Kotlin's `associatedBy` naming is a good alterative, and matches the past tense of [Swift's API Design Guidelines](https://www.swift.org/documentation/api-design-guidelines/), though perhaps we'd spell it `associated(by:)`.
Kotlin's `associatedBy` naming is a good alternative, and matches the past tense of [Swift's API Design Guidelines](https://www.swift.org/documentation/api-design-guidelines/), though perhaps we'd spell it `associated(by:)`.

#### Customization points

Expand Down
2 changes: 1 addition & 1 deletion Sources/Algorithms/Documentation.docc/MinAndMax.md
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ or a specific number of elements at the minimum and maximum.
- ``Swift/Sequence/max(count:sortedBy:)``
- ``Swift/Collection/max(count:sortedBy:)``

### Finding the Minimum and Maximum Elements Simulataneously
### Finding the Minimum and Maximum Elements Simultaneously

- ``Swift/Sequence/minAndMax()``
- ``Swift/Sequence/minAndMax(by:)``
Expand Down
2 changes: 1 addition & 1 deletion Sources/Algorithms/Split.swift
Original file line number Diff line number Diff line change
Expand Up @@ -512,7 +512,7 @@ extension SplitCollection: Collection {
var subsequenceStart = i.baseRange.upperBound
if subsequenceStart < base.endIndex {
// If we're not already at the end of the base collection, the previous
// susequence ended with a separator. Start searching for the next
// subsequence ended with a separator. Start searching for the next
// subsequence at the following element.
subsequenceStart = base.index(after: i.baseRange.upperBound)
}
Expand Down