Module resolve

Module resolve 

Source

StructsΒ§

DiscoveredPackages πŸ”’
PartialDiscovery πŸ”’
PendingDependency πŸ”’

EnumsΒ§

ResolveError

ConstantsΒ§

MAX_BACKTRACK_STATES πŸ”’
MAX_DISCOVERED_PACKAGES πŸ”’
MAX_PENDING_DEPENDENCIES πŸ”’

FunctionsΒ§

candidate_matches_named_query πŸ”’
check_for_duplicate_versions πŸ”’
As a workaround for the lack of β€œproper” dependency merging, we’ll make sure only one copy of each package is in the dependency tree. If the same package is included in the tree multiple times, they all need to use the exact same version otherwise it’s an error.
cycle_error πŸ”’
dependency_candidates πŸ”’
discover_dependencies πŸ”’
discover_dependencies_once πŸ”’
discover_dependencies_with_backtracking πŸ”’
discover_merged_dependencies πŸ”’
discovered_packages_are_unified πŸ”’
log_dependencies πŸ”’
named_dependency_candidates πŸ”’
named_dependency_constraints πŸ”’
named_selection_signature πŸ”’
print_cycle πŸ”’
registry_error_message πŸ”’
resolve
Given the PackageInfo for a root package, resolve its dependency graph and figure out how it could be executed.
resolve_dependency πŸ”’
resolve_dependency_graph
Given the PackageInfo for a root package, discover its dependency graph.
resolve_package πŸ”’
Given some DiscoveredPackages, figure out how the resulting β€œpackage” would look when loaded at runtime.
same_named_selection πŸ”’
select_latest_named_dependency πŸ”’
select_named_dependencies πŸ”’
select_unified_named_dependency πŸ”’
sort_named_candidates_desc πŸ”’
validate_dependency_graph
Validate whether a dependency graph can be unified into a runnable package.