def get(self):
"""
- Returns a backtrack paramater. The backtrack graph is explored with depth first.
+ Returns a backtrack parameter. The backtrack graph is explored with depth first.
"""
if self._unexplored_nodes:
node = self._unexplored_nodes.pop()
def feedback(self, infos):
"""
- Takes infomration from the depgraph and computes new backtrack parameters to try.
+ Takes information from the depgraph and computes new backtrack parameters to try.
"""
assert self._current_node is not None, "call feedback() only after get() was called"
def backtracked(self):
"""
- If we dind't backtrack, there is only the root.
+ If we didn't backtrack, there is only the root.
"""
return len(self._nodes) > 1
def get_best_run(self):
"""
Like, get() but returns the backtrack parameter that has as many config changes as possible,
- but has no masks. This maskes --autounmask effective, but prevents confusing error messages
+ but has no masks. This makes --autounmask effective, but prevents confusing error messages
with "masked by backtracking".
"""
best_node = self._root
"dev-libs/A-2::repo1": { },
"dev-libs/A-1::repo2": { },
- #Packges in exactly one repo
+ #Packages in exactly one repo
"dev-libs/B-1": { },
"dev-libs/C-1::repo1": { },
check_repo_names = True,
mergelist = ["dev-libs/A-1"]),
- #Packges in exactly one repo
+ #Packages in exactly one repo
ResolverPlaygroundTestCase(
["dev-libs/B"],
success = True,