(i, j int)
| 549 | } |
| 550 | |
| 551 | func (s *pairSorter) Less(i, j int) bool { |
| 552 | cmp := strings.Compare(string(s.pairs[i].k), string(s.pairs[j].k)) |
| 553 | if cmp != 0 { |
| 554 | return cmp == -1 |
| 555 | } |
| 556 | s.hasNonUnique = true |
| 557 | // The element with greater order has lower rank when their keys |
| 558 | // are same, since unique algorithm will prefer first element. |
| 559 | return s.orders[i] > s.orders[j] |
| 560 | } |
| 561 | |
| 562 | func (s *pairSorter) Swap(i, j int) { |
| 563 | s.pairs[i], s.orders[i], s.pairs[j], s.orders[j] = s.pairs[j], s.orders[j], s.pairs[i], s.orders[i] |
no test coverage detected