Skip to content

[gardening] Fix recently introduced typos: "for for" → "for", "exmaple" → "example", "requiremens" → "requirements" #1269

New issue

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

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

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Feb 11, 2016
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 include/swift/SILOptimizer/Analysis/AliasAnalysis.h
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ namespace {
void *T1, *T2;
};

/// A key used for for the MemoryBehavior Analysis cache.
/// A key used for the MemoryBehavior Analysis cache.
///
/// The two SILValue pointers are mapped to size_t indices because we need an
/// efficient way to invalidate them (the mechanism is described below). The
Expand Down
4 changes: 2 additions & 2 deletions test/Prototypes/CollectionsMoveIndices.swift
Original file line number Diff line number Diff line change
Expand Up @@ -130,7 +130,7 @@
// This design constraint needs some extra motivation, because it
// might not be obvious. Preserving index validity across mutation
// is important for algorithms that iterate over the tree and mutate
// it in place, for exmaple, removing a subrange of elements between
// it in place, for example, removing a subrange of elements between
// two indices, or removing elements that don't satisfy a predicate.
// When implementing such an algorithm, you would typically have an
// index that points to the current element. You can copy the
Expand All @@ -141,7 +141,7 @@
// deleted.
//
// It is not possible to satisfy all of these requirements at the same
// time. Designs that cover some of the requiremens are possible.
// time. Designs that cover some of the requirements are possible.
//
// 1. Persistent trees with O(log n) subscripting and advancing, and
// strict index invalidation.
Expand Down