forked from libgit2/git2go
/
walk.go
90 lines (72 loc) · 1.31 KB
/
walk.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
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
package git
/*
#cgo pkg-config: libgit2
#include <git2.h>
#include <git2/errors.h>
*/
import "C"
import (
"io"
)
// RevWalk
const (
SORT_NONE = C.GIT_SORT_NONE
SORT_TOPOLOGICAL = C.GIT_SORT_TOPOLOGICAL
SORT_TIME = C.GIT_SORT_TIME
SORT_REVERSE = C.GIT_SORT_REVERSE
)
type RevWalk struct {
ptr *C.git_revwalk
repo *Repository
}
func (v *RevWalk) Reset() {
C.git_revwalk_reset(v.ptr)
}
func (v *RevWalk) Push(id *Oid) {
C.git_revwalk_push(v.ptr, id.toC())
}
func (v *RevWalk) PushHead() (err error) {
ecode := C.git_revwalk_push_head(v.ptr)
if ecode < 0 {
err = LastError()
}
return
}
func (v *RevWalk) Next(oid *Oid) (err error) {
ret := C.git_revwalk_next(oid.toC(), v.ptr)
switch {
case ret == ITEROVER:
err = io.EOF
case ret < 0:
err = LastError()
}
return
}
type RevWalkIterator func(commit *Commit) bool
func (v *RevWalk) Iterate(fun RevWalkIterator) (err error) {
oid := new(Oid)
for {
err = v.Next(oid)
if err == io.EOF {
return nil
}
if err != nil {
return err
}
commit, err := v.repo.LookupCommit(oid)
if err != nil {
return err
}
cont := fun(commit)
if !cont {
break
}
}
return nil
}
func (v *RevWalk) Sorting(sm uint) {
C.git_revwalk_sorting(v.ptr, C.uint(sm))
}
func freeRevWalk(walk *RevWalk) {
C.git_revwalk_free(walk.ptr)
}