| 351 | } |
| 352 | |
| 353 | func (s *pairSorter) Less(i, j int) bool { |
| 354 | cmp := strings.Compare(string(s.pairs[i].k), string(s.pairs[j].k)) |
| 355 | if cmp != 0 { |
| 356 | return cmp == -1 |
| 357 | } |
| 358 | s.hasNonUnique = true |
| 359 | // The element with greater order has lower rank when their keys |
| 360 | // are same, since unique algorithm will prefer first element. |
| 361 | return s.orders[i] > s.orders[j] |
| 362 | } |
| 363 | |
| 364 | func (s *pairSorter) Swap(i, j int) { |
| 365 | s.pairs[i], s.orders[i], s.pairs[j], s.orders[j] = s.pairs[j], s.orders[j], s.pairs[i], s.orders[i] |