diff options
author | 2017-03-07 15:50:31 +0000 | |
---|---|---|
committer | 2017-03-07 17:14:15 +0000 | |
commit | 49fc3055f107c9d1990991139af24daade987571 (patch) | |
tree | 040e55e6b48fc8db58e057b3c4d7e0a05fd5c8b8 /site/versions | |
parent | 9dfbed1ca5228086387cfbdf385fdfe1dc9242e7 (diff) |
Typo fix
--
PiperOrigin-RevId: 149418254
MOS_MIGRATED_REVID=149418254
Diffstat (limited to 'site/versions')
-rw-r--r-- | site/versions/master/docs/skylark/depsets.md | 4 |
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 |