@@ -60,7 +60,7 @@ is going to be checked, which could be costly. Salsa only needs to check each
60
60
downstream computation until it finds one that isn't changed. At that point, it
61
61
won't check other derived computations since they wouldn't need to change.
62
62
63
- It's is helpful to think about this as a graph with nodes. Each derived value
63
+ It's helpful to think about this as a graph with nodes. Each derived value
64
64
has a dependency on other values, which could themselves be either base or
65
65
derived. Base values don't have a dependency.
66
66
@@ -71,12 +71,12 @@ J <- B <--+
71
71
```
72
72
73
73
When an input ` I ` changes, the derived value ` A ` could change. The derived
74
- value ` B ` , which does not depend on ` I ` , ` A ` , or any value derived from ` A ` or
74
+ value ` B ` , which does not depend on ` I ` , ` A ` , or any value derived from ` A ` or
75
75
` I ` , is not subject to change. Therefore, Salsa can reuse the computation done
76
76
for ` B ` in the past, without having to compute it again.
77
77
78
78
The computation could also terminate early. Keeping the same graph as before,
79
- say that input ` I ` has changed in some way (and input ` J ` hasn't) but, when
79
+ say that input ` I ` has changed in some way (and input ` J ` hasn't), but when
80
80
computing ` A ` again, it's found that ` A ` hasn't changed from the previous
81
81
computation. This leads to an "early termination", because there's no need to
82
82
check if ` C ` needs to change, since both ` C ` direct inputs, ` A ` and ` B ` ,
0 commit comments