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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
package command
import (
"strings"
"unicode"
log "github.com/sirupsen/logrus"
)
// File represents the status of a file in an index or work tree
type File struct {
Name string
AbsPath string
X FileStatus
Y FileStatus
}
// FileStatus is the short representation of state of a file
type FileStatus byte
var (
// StatusNotupdated says file not updated
StatusNotupdated FileStatus = ' '
// StatusModified says file is modifed
StatusModified FileStatus = 'M'
// StatusAdded says file is added to index
StatusAdded FileStatus = 'A'
// StatusDeleted says file is deleted
StatusDeleted FileStatus = 'D'
// StatusRenamed says file is renamed
StatusRenamed FileStatus = 'R'
// StatusCopied says file is copied
StatusCopied FileStatus = 'C'
// StatusUpdated says file is updated
StatusUpdated FileStatus = 'U'
// StatusUntracked says file is untraced
StatusUntracked FileStatus = '?'
// StatusIgnored says file is ignored
StatusIgnored FileStatus = '!'
)
// Diff is a wrapper of "git diff" command for a file to compare with HEAD rev
func (f *File) Diff() (output string, err error) {
args := make([]string, 0)
args = append(args, "diff")
args = append(args, "HEAD")
args = append(args, f.Name)
output, err = GenericGitCommandWithErrorOutput(strings.TrimSuffix(f.AbsPath, f.Name), args)
if err != nil {
log.Warn(err)
}
return output, err
}
// filesAlphabetical slice is the re-ordered *File slice that sorted according
// to alphabetical order (A-Z)
type filesAlphabetical []*File
// Len is the interface implementation for Alphabetical sorting function
func (s filesAlphabetical) Len() int { return len(s) }
// Swap is the interface implementation for Alphabetical sorting function
func (s filesAlphabetical) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
// Less is the interface implementation for Alphabetical sorting function
func (s filesAlphabetical) Less(i, j int) bool {
iRunes := []rune(s[i].Name)
jRunes := []rune(s[j].Name)
max := len(iRunes)
if max > len(jRunes) {
max = len(jRunes)
}
for idx := 0; idx < max; idx++ {
ir := iRunes[idx]
jr := jRunes[idx]
lir := unicode.ToLower(ir)
ljr := unicode.ToLower(jr)
if lir != ljr {
return lir < ljr
}
// the lowercase runes are the same, so compare the original
if ir != jr {
return ir < jr
}
}
return false
}
|
