summaryrefslogtreecommitdiffstats
path: root/pym/_emerge
diff options
context:
space:
mode:
Diffstat (limited to 'pym/_emerge')
-rw-r--r--pym/_emerge/actions.py2
-rw-r--r--pym/_emerge/depgraph.py4
2 files changed, 3 insertions, 3 deletions
diff --git a/pym/_emerge/actions.py b/pym/_emerge/actions.py
index 708ff0ff5..4f1243c23 100644
--- a/pym/_emerge/actions.py
+++ b/pym/_emerge/actions.py
@@ -1181,7 +1181,7 @@ def calc_depclean(settings, trees, ldpath_mtimes,
raise AssertionError("no root nodes")
if ignore_priority is not None:
# Some deps have been dropped due to circular dependencies,
- # so only pop one node in order do minimize the number that
+ # so only pop one node in order to minimize the number that
# are dropped.
del nodes[1:]
for node in nodes:
diff --git a/pym/_emerge/depgraph.py b/pym/_emerge/depgraph.py
index 38d2d4029..365efe6dc 100644
--- a/pym/_emerge/depgraph.py
+++ b/pym/_emerge/depgraph.py
@@ -4255,7 +4255,7 @@ class depgraph(object):
if min_parent_deps is not None and \
len(parent_deps) >= min_parent_deps:
# This task is no better than a previously selected
- # task, so abort search now in order avoid wasting
+ # task, so abort search now in order to avoid wasting
# any more cpu time on this task. This increases
# performance dramatically in cases when there are
# hundreds of blockers to solve, like when
@@ -4277,7 +4277,7 @@ class depgraph(object):
if uninst_task is not None and min_parent_deps == 1:
# This is the best possible result, so so abort search
- # now in order avoid wasting any more cpu time.
+ # now in order to avoid wasting any more cpu time.
break
if uninst_task is not None: