File tree Expand file tree Collapse file tree 2 files changed +3
-3
lines changed
include/swift/SILOptimizer/Analysis Expand file tree Collapse file tree 2 files changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -37,7 +37,7 @@ namespace {
37
37
void *T1, *T2;
38
38
};
39
39
40
- // / A key used for for the MemoryBehavior Analysis cache.
40
+ // / A key used for the MemoryBehavior Analysis cache.
41
41
// /
42
42
// / The two SILValue pointers are mapped to size_t indices because we need an
43
43
// / efficient way to invalidate them (the mechanism is described below). The
Original file line number Diff line number Diff line change 130
130
// This design constraint needs some extra motivation, because it
131
131
// might not be obvious. Preserving index validity across mutation
132
132
// is important for algorithms that iterate over the tree and mutate
133
- // it in place, for exmaple , removing a subrange of elements between
133
+ // it in place, for example , removing a subrange of elements between
134
134
// two indices, or removing elements that don't satisfy a predicate.
135
135
// When implementing such an algorithm, you would typically have an
136
136
// index that points to the current element. You can copy the
141
141
// deleted.
142
142
//
143
143
// It is not possible to satisfy all of these requirements at the same
144
- // time. Designs that cover some of the requiremens are possible.
144
+ // time. Designs that cover some of the requirements are possible.
145
145
//
146
146
// 1. Persistent trees with O(log n) subscripting and advancing, and
147
147
// strict index invalidation.
You can’t perform that action at this time.
0 commit comments