|
14 | 14 |
|
15 | 15 | package sortmerger
|
16 | 16 |
|
17 |
| -import "reflect" |
| 17 | +import ( |
| 18 | + "database/sql/driver" |
| 19 | + "reflect" |
| 20 | + "time" |
| 21 | +) |
18 | 22 |
|
19 | 23 | var compareFuncMapping = map[reflect.Kind]func(any, any, Order) int{
|
20 | 24 | reflect.Int: compare[int],
|
@@ -45,8 +49,14 @@ func (h *Heap) Less(i, j int) bool {
|
45 | 49 | for k := 0; k < h.sortColumns.Len(); k++ {
|
46 | 50 | valueI := h.h[i].sortCols[k]
|
47 | 51 | valueJ := h.h[j].sortCols[k]
|
48 |
| - kind := reflect.TypeOf(valueI).Kind() |
49 |
| - cp := compareFuncMapping[kind] |
| 52 | + _, ok := valueJ.(driver.Valuer) |
| 53 | + var cp func(any, any, Order) int |
| 54 | + if ok { |
| 55 | + cp = compareNullable |
| 56 | + } else { |
| 57 | + kind := reflect.TypeOf(valueI).Kind() |
| 58 | + cp = compareFuncMapping[kind] |
| 59 | + } |
50 | 60 | res := cp(valueI, valueJ, h.sortColumns.Get(k).order)
|
51 | 61 | if res == 0 {
|
52 | 62 | continue
|
@@ -84,11 +94,35 @@ type node struct {
|
84 | 94 |
|
85 | 95 | func compare[T Ordered](ii any, jj any, order Order) int {
|
86 | 96 | i, j := ii.(T), jj.(T)
|
87 |
| - if i < j && order || i > j && !order { |
| 97 | + if i < j && order == ASC || i > j && order == DESC { |
88 | 98 | return -1
|
89 |
| - } else if i > j && order || i < j && !order { |
| 99 | + } else if i > j && order == ASC || i < j && order == DESC { |
90 | 100 | return 1
|
91 | 101 | } else {
|
92 | 102 | return 0
|
93 | 103 | }
|
94 | 104 | }
|
| 105 | + |
| 106 | +func compareNullable(ii, jj any, order Order) int { |
| 107 | + i := ii.(driver.Valuer) |
| 108 | + j := jj.(driver.Valuer) |
| 109 | + iVal, _ := i.Value() |
| 110 | + jVal, _ := j.Value() |
| 111 | + // 如果i,j都为空返回0 |
| 112 | + // 如果val返回为空永远是最小值 |
| 113 | + if iVal == nil && jVal == nil { |
| 114 | + return 0 |
| 115 | + } else if iVal == nil && order == ASC || jVal == nil && order == DESC { |
| 116 | + return -1 |
| 117 | + } else if iVal == nil && order == DESC || jVal == nil && order == ASC { |
| 118 | + return 1 |
| 119 | + } |
| 120 | + |
| 121 | + vali, ok := iVal.(time.Time) |
| 122 | + if ok { |
| 123 | + valj := jVal.(time.Time) |
| 124 | + return compare[int64](vali.UnixMilli(), valj.UnixMilli(), order) |
| 125 | + } |
| 126 | + kind := reflect.TypeOf(iVal).Kind() |
| 127 | + return compareFuncMapping[kind](iVal, jVal, order) |
| 128 | +} |
0 commit comments