-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort_by_fileinfo.sort.go
More file actions
60 lines (52 loc) · 1.34 KB
/
Copy pathsort_by_fileinfo.sort.go
File metadata and controls
60 lines (52 loc) · 1.34 KB
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
55
56
57
58
59
60
package ossort
import (
"os"
"sort"
)
// fileInfo 按文件名排序
type fileInfo struct{}
// NewSortByFileInfo .
func NewSortByFileInfo() SortByFileInfo {
return &fileInfo{}
}
// Identifier 排序凭证
func (s *fileInfo) Identifier(fi []os.FileInfo) (newInfoSlice []*SortIdentifier) {
newInfoSlice = make([]*SortIdentifier, len(fi))
for i := range fi {
newInfoSlice[i] = &SortIdentifier{
OriginData: fi[i],
SortKey: GenSortName(fi[i].Name()),
}
}
return newInfoSlice
}
// Asc 文件名升序排序
func (s *fileInfo) Asc(fi []os.FileInfo) {
sortSlice := s.Identifier(fi)
sort.Slice(sortSlice, func(i, j int) bool {
return sortSlice[i].SortKey < sortSlice[j].SortKey
})
for i := range sortSlice {
fi[i] = sortSlice[i].OriginData.(os.FileInfo)
}
return
}
// Desc 文件名倒序排序
func (s *fileInfo) Desc(fi []os.FileInfo) {
sortSlice := s.Identifier(fi)
sort.Slice(sortSlice, func(i, j int) bool {
return sortSlice[i].SortKey > sortSlice[j].SortKey
})
for i := range sortSlice {
fi[i] = sortSlice[i].OriginData.(os.FileInfo)
}
return
}
// Slice 自定义排序 sort.Sort
func (s *fileInfo) Slice(fi []os.FileInfo, less func(i, j int) bool) {
sort.Slice(fi, less)
}
// SliceStable 自定义排序 sort.SliceStable
func (s *fileInfo) SliceStable(fi []os.FileInfo, less func(i, j int) bool) {
sort.SliceStable(fi, less)
}