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:
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
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:
return k>=0 and stack[k] and stack[k][0] == "||"
def last_any_of_operator_level(k):
- #Returns the level of the last || operator if it is ineffect for
+ #Returns the level of the last || operator if it is in effect for
#the current level. It is not in effect, if there is a level, that
#ends in a non-operator. This is almost equivalent to stack[level][-1]=="||",
#expect that it skips empty levels.
self.cpv, self.eapi = cpv, eapi
def __str__(self):
msg = _("Unable to do any operations on '%(cpv)s', since "
- "it's EAPI is higher than this portage version's. Please upgrade"
+ "its EAPI is higher than this portage version's. Please upgrade"
" to a portage version that supports EAPI '%(eapi)s'.") % \
{"cpv": self.cpv, "eapi": str(self.eapi).lstrip("-")}
return msg
if previous_features:
# The package from the previous setcpv call had package.env
# settings which modified FEATURES. Therefore, trigger a
- # regenerate() call in order ensure that self.features
+ # regenerate() call in order to ensure that self.features
# is accurate.
has_changed = True