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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
package git
import (
"bufio"
"bytes"
"fmt"
"io"
"sort"
"gopkg.in/src-d/go-git.v2/core"
)
type Hash core.Hash
// Commit points to a single tree, marking it as what the project looked like
// at a certain point in time. It contains meta-information about that point
// in time, such as a timestamp, the author of the changes since the last
// commit, a pointer to the previous commit(s), etc.
// http://schacon.github.io/gitbook/1_the_git_object_model.html
type Commit struct {
Hash core.Hash
Author Signature
Committer Signature
Message string
tree core.Hash
parents []core.Hash
r *Repository
}
func (c *Commit) Tree() *Tree {
tree, _ := c.r.Tree(c.tree)
return tree
}
func (c *Commit) Parents() *CommitIter {
return NewCommitIter(c.r, core.NewObjectLookupIter(c.r.Storage, c.parents))
}
// NumParents returns the number of parents in a commit.
func (c *Commit) NumParents() int {
return len(c.parents)
}
// File returns the file with the specified "path" in the commit and a
// nil error if the file exists. If the file does not exists, it returns
// a nil file and the ErrFileNotFound error.
func (c *Commit) File(path string) (file *File, err error) {
return c.Tree().File(path)
}
// Decode transform an core.Object into a Blob struct
func (c *Commit) Decode(o core.Object) error {
c.Hash = o.Hash()
r := bufio.NewReader(o.Reader())
var message bool
for {
line, err := r.ReadSlice('\n')
if err != nil && err != io.EOF {
return err
}
line = bytes.TrimSpace(line)
if !message {
if len(line) == 0 {
message = true
continue
}
split := bytes.SplitN(line, []byte{' '}, 2)
switch string(split[0]) {
case "tree":
c.tree = core.NewHash(string(split[1]))
case "parent":
c.parents = append(c.parents, core.NewHash(string(split[1])))
case "author":
c.Author.Decode(split[1])
case "committer":
c.Committer.Decode(split[1])
}
} else {
c.Message += string(line) + "\n"
}
if err == io.EOF {
return nil
}
}
}
func (c *Commit) String() string {
return fmt.Sprintf(
"%s %s\nAuthor: %s\nDate: %s\n",
core.CommitObject, c.Hash, c.Author.String(), c.Author.When,
)
}
type CommitIter struct {
core.ObjectIter
r *Repository
}
func NewCommitIter(r *Repository, iter core.ObjectIter) *CommitIter {
return &CommitIter{iter, r}
}
func (iter *CommitIter) Next() (*Commit, error) {
obj, err := iter.ObjectIter.Next()
if err != nil {
return nil, err
}
commit := &Commit{r: iter.r}
return commit, commit.Decode(obj)
}
type commitSorterer struct {
l []*Commit
}
func (s commitSorterer) Len() int {
return len(s.l)
}
func (s commitSorterer) Less(i, j int) bool {
return s.l[i].Committer.When.Before(s.l[j].Committer.When)
}
func (s commitSorterer) Swap(i, j int) {
s.l[i], s.l[j] = s.l[j], s.l[i]
}
// SortCommits sort a commit list by commit date, from older to newer.
func SortCommits(l []*Commit) {
s := &commitSorterer{l}
sort.Sort(s)
}
|
