-
Couldn't load subscription status.
- Fork 61
Open
Description
If only a lower bound is specified along with "lowest" resolution strategy, the latest version is picked:
See:
The new test fails:
The problem is that the optimisation to pick the latest version if only a minimum bound is specified (from #598 ) is always applied, regardless of resolution strategy.
A separate issue, but a nice optimisation, would be to have a similar fast-path attempted for the lowest resolution strategy. Namely, if there is only a >= lower bound & resolution strategy is lowest, then:
- if the bound itself exists, use that
- otherwise resort to the slower checking of all available versions
Metadata
Metadata
Assignees
Labels
No labels