StructsΒ§
- Discovered
Packages π - Partial
Discovery π - Pending
Dependency π
EnumsΒ§
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
PackageInfofor a root package, resolve its dependency graph and figure out how it could be executed. - resolve_
dependency π - resolve_
dependency_ graph - Given the
PackageInfofor 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.