summaryrefslogtreecommitdiffstats
path: root/Source/cmComputeLinkDepends.cxx
diff options
context:
space:
mode:
authorYury G. Kudryashov <urkud.urkud@gmail.com>2012-02-26 18:44:20 (GMT)
committerBrad King <brad.king@kitware.com>2012-02-29 19:07:50 (GMT)
commit43d60114a57b12766106cd264f358b9bfa098bba (patch)
treebdb3a6158a225ffbdfd7ad29bf0b5700cf75f557 /Source/cmComputeLinkDepends.cxx
parent2437b40933bd8377815a51a8154a81d3a70dc0fc (diff)
downloadCMake-43d60114a57b12766106cd264f358b9bfa098bba.zip
CMake-43d60114a57b12766106cd264f358b9bfa098bba.tar.gz
CMake-43d60114a57b12766106cd264f358b9bfa098bba.tar.bz2
Run vim spellcheck on some files
Diffstat (limited to 'Source/cmComputeLinkDepends.cxx')
-rw-r--r--Source/cmComputeLinkDepends.cxx6
1 files changed, 3 insertions, 3 deletions
diff --git a/Source/cmComputeLinkDepends.cxx b/Source/cmComputeLinkDepends.cxx
index 9a075bd..ddff2d9 100644
--- a/Source/cmComputeLinkDepends.cxx
+++ b/Source/cmComputeLinkDepends.cxx
@@ -27,7 +27,7 @@
This file computes an ordered list of link items to use when linking a
single target in one configuration. Each link item is identified by
the string naming it. A graph of dependencies is created in which
-each node corresponds to one item and directed eges lead from nodes to
+each node corresponds to one item and directed edges lead from nodes to
those which must *follow* them on the link line. For example, the
graph
@@ -42,7 +42,7 @@ search of the link dependencies starting from the main target.
There are two types of items: those with known direct dependencies and
those without known dependencies. We will call the two types "known
-items" and "unknown items", respecitvely. Known items are those whose
+items" and "unknown items", respectively. Known items are those whose
names correspond to targets (built or imported) and those for which an
old-style <item>_LIB_DEPENDS variable is defined. All other items are
unknown and we must infer dependencies for them. For items that look
@@ -150,7 +150,7 @@ times the component needs to be seen (once for trivial components,
twice for non-trivial). If at any time another component finishes and
re-adds an already pending component, the pending component is reset
so that it needs to be seen in its entirety again. This ensures that
-all dependencies of a component are satisified no matter where it
+all dependencies of a component are satisfied no matter where it
appears.
After the original link line has been completed, we append to it the