/
utlis.go
54 lines (45 loc) · 1.31 KB
/
utlis.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
// Copyright (c) 2021 Terminus, Inc.
//
// This program is free software: you can use, redistribute, and/or modify
// it under the terms of the GNU Affero General Public License, version 3
// or later ("AGPL"), as published by the Free Software Foundation.
//
// This program is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
package dao
import (
"math"
"sort"
)
// Round 保留小数点计算
func Round(f float64, n int) float64 {
shift := math.Pow(10, float64(n))
fv := 0.0000000001 + f //对浮点数产生.xxx999999999 计算不准进行处理
return math.Floor(fv*shift+.5) / shift
}
// Int64Slice 自定义 interface{},用于实现 []int64 的排序
type Int64Slice []int64
func (c Int64Slice) Len() int {
return len(c)
}
func (c Int64Slice) Swap(i, j int) {
c[i], c[j] = c[j], c[i]
}
func (c Int64Slice) Less(i, j int) bool {
return c[i] < c[j]
}
func SortInt64Map(m map[int64]int64) Int64Slice {
// 对 succMap key 进行排序
keys := make(Int64Slice, len(m))
i := 0
for k := range m {
keys[i] = k
i++
}
sort.Sort(keys)
return keys
}