(minMaxes map[string]minMax)
| 244 | } |
| 245 | |
| 246 | func minMaxKeysSortAbs(minMaxes map[string]minMax) []string { |
| 247 | keys := slices.Sorted(maps.Keys(minMaxes)) |
| 248 | slices.SortStableFunc(keys, func(a, b string) int { |
| 249 | absMinA := minMaxes[a].min |
| 250 | if absMinA < 0 { |
| 251 | absMinA = -absMinA |
| 252 | } |
| 253 | absMaxA := minMaxes[a].max |
| 254 | if absMaxA < 0 { |
| 255 | absMaxA = -absMaxA |
| 256 | } |
| 257 | absA := absMinA + absMaxA |
| 258 | |
| 259 | absMinB := minMaxes[b].min |
| 260 | if absMinB < 0 { |
| 261 | absMinB = -absMinB |
| 262 | } |
| 263 | absMaxB := minMaxes[b].max |
| 264 | if absMaxB < 0 { |
| 265 | absMaxB = -absMaxB |
| 266 | } |
| 267 | absB := absMinB + absMaxB |
| 268 | |
| 269 | return absB - absA |
| 270 | }) |
| 271 | return keys |
| 272 | } |
| 273 | |
| 274 | func calcDiffRecords(oldRecords, newRecords map[string]verifierComplexityRecord, onlyChange bool) []verifierComplexityRecord { |
| 275 | diffRecords := make([]verifierComplexityRecord, 0) |
no test coverage detected
searching dependent graphs…