// that list came from a previous operation that paged
// in all the requirements, so there's no I/O to overlap now.
+ max := map[string]string{}
+ for _, m := range list {
+ max[m.Path] = m.Version
+ }
+
// Compute postorder, cache requirements.
var postorder []module.Version
reqCache := map[module.Version][]module.Version{}
}
return nil
}
- max := map[string]string{}
- for _, m := range list {
- if v, ok := max[m.Path]; ok {
- max[m.Path] = reqs.Max(m.Version, v)
- } else {
- max[m.Path] = m.Version
- }
- }
// First walk the base modules that must be listed.
var min []module.Version
haveBase := map[string]bool{}