Fixed generator map sorting
This commit is contained in:
parent
a22b6137d5
commit
7600bc28d9
|
@ -124,12 +124,7 @@ func (keys keySlice) Less (lefti, righti int) bool {
|
||||||
left := keys[lefti]
|
left := keys[lefti]
|
||||||
right := keys[righti]
|
right := keys[righti]
|
||||||
|
|
||||||
for index, leftByte := range left.Unit {
|
return left.String() < right.String()
|
||||||
if right.Unit[index] <= leftByte {
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return left.Name < right.Name && left.Method < right.Method
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func (keys keySlice) Swap (lefti, righti int) {
|
func (keys keySlice) Swap (lefti, righti int) {
|
||||||
|
|
Loading…
Reference in New Issue