summary refs log tree commit diff
path: root/src/doc/rustc-dev-guide
diff options
context:
space:
mode:
authorEdwinRy <edwinkry@gmail.com>2022-06-27 01:29:25 +0100
committerTshepang Mbambo <tshepang@gmail.com>2022-06-27 02:41:09 +0200
commit9ab4469c652ad55bf55da9e43c215aa68a9513e9 (patch)
tree1cf3891bf511620900d49f8d4015f40ae5991b0d /src/doc/rustc-dev-guide
parentd8e5995983ac0c3320fee2ef1c95ed67e6bfa472 (diff)
downloadrust-9ab4469c652ad55bf55da9e43c215aa68a9513e9.tar.gz
rust-9ab4469c652ad55bf55da9e43c215aa68a9513e9.zip
Few readability fixes
Diffstat (limited to 'src/doc/rustc-dev-guide')
-rw-r--r--src/doc/rustc-dev-guide/src/salsa.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/doc/rustc-dev-guide/src/salsa.md b/src/doc/rustc-dev-guide/src/salsa.md
index d9190f64628..e0303127e45 100644
--- a/src/doc/rustc-dev-guide/src/salsa.md
+++ b/src/doc/rustc-dev-guide/src/salsa.md
@@ -60,7 +60,7 @@ is going to be checked, which could be costly. Salsa only needs to check each
 downstream computation until it finds one that isn't changed. At that point, it
 won't check other derived computations since they wouldn't need to change.
 
-It's is helpful to think about this as a graph with nodes. Each derived value
+It's helpful to think about this as a graph with nodes. Each derived value
 has a dependency on other values, which could themselves be either base or
 derived. Base values don't have a dependency.
 
@@ -71,12 +71,12 @@ J <- B <--+
 ```
 
 When an input `I` changes, the derived value `A` could change. The derived
-value `B` , which does not depend on `I`, `A`, or any value derived from `A` or
+value `B`, which does not depend on `I`, `A`, or any value derived from `A` or
 `I`, is not subject to change.  Therefore, Salsa can reuse the computation done
 for `B` in the past, without having to compute it again.
 
 The computation could also terminate early. Keeping the same graph as before,
-say that input `I` has changed in some way (and input `J` hasn't) but, when
+say that input `I` has changed in some way (and input `J` hasn't), but when
 computing `A` again, it's found that `A` hasn't changed from the previous
 computation. This leads to an "early termination", because there's no need to
 check if `C` needs to change, since both `C` direct inputs, `A` and `B`,