You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Feb 3, 2018. It is now read-only.
The current algorithm for extracting a ReachMap from a PackageTree is a depth-first traversal that not only eliminates packages with errs from from the PackageTree, but also uses backpropagation to eliminate packages that transitively import those packages. Internally, that backpropagation method is referred to as "poisoning."
This approach is always what the solver needs, but it's not necessarily what gps' dependers need. Implementations are often scanning the current project's code, and want to be more lenient about what gets eliminated. So, we need more params, or another method, that takes that approach to creating a ReachMap.
The text was updated successfully, but these errors were encountered:
The current algorithm for extracting a
ReachMap
from aPackageTree
is a depth-first traversal that not only eliminates packages with errs from from thePackageTree
, but also uses backpropagation to eliminate packages that transitively import those packages. Internally, that backpropagation method is referred to as "poisoning."This approach is always what the solver needs, but it's not necessarily what gps' dependers need. Implementations are often scanning the current project's code, and want to be more lenient about what gets eliminated. So, we need more params, or another method, that takes that approach to creating a
ReachMap
.The text was updated successfully, but these errors were encountered: