aboutsummaryrefslogtreecommitdiffhomepage
path: root/site/versions/master/docs/skylark/depsets.md
diff options
context:
space:
mode:
Diffstat (limited to 'site/versions/master/docs/skylark/depsets.md')
-rw-r--r--site/versions/master/docs/skylark/depsets.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/site/versions/master/docs/skylark/depsets.md b/site/versions/master/docs/skylark/depsets.md
index 6c56a3454f..24114b3200 100644
--- a/site/versions/master/docs/skylark/depsets.md
+++ b/site/versions/master/docs/skylark/depsets.md
@@ -353,8 +353,8 @@ This gets rid of the duplicates, but it makes the order of the command line
arguments (and therefore the contents of the files) unspecified, although still
deterministic.
-Moreover, both this approach and the list-based are asymptotically worse than
-the depset-based approach. Consider the case where there is a long chain of
+Moreover, both this approach and the list-based one are asymptotically worse
+than the depset-based approach. Consider the case where there is a long chain of
dependencies on Foo libraries. Processing every rule requires copying all of the
transitive sources that came before it into a new data structure. This means
that the time and space cost for analyzing an individual library or binary