New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Resolving lower compat bounds #5

Open

adrhill opened this issue Oct 22, 2024 · 0 comments

adrhill commented Oct 22, 2024

I stumbled upon Resolver in your recent Discourse comment, in which you mention:

Unlike the current algorithm (or SAT solvers), which only finds one solution, it finds all Pareto-optimal solutions.

This reminded me of recent discussions on testing of lower-bound compat entries in JuliaLang/Pkg.jl#3802, where Pareto optimality also popped up.

Resolving lower compat bounds currently requires manual bisection. Could this package help here?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment