5
5
"strings"
6
6
)
7
7
8
- type ReferenceFilter func (Reference ) bool
8
+ type ReferenceFilter func (refname string ) bool
9
9
10
- func AllReferencesFilter (_ Reference ) bool {
10
+ func AllReferencesFilter (_ string ) bool {
11
11
return true
12
12
}
13
13
@@ -43,10 +43,10 @@ func (ief *IncludeExcludeFilter) Exclude(f ReferenceFilter) {
43
43
ief .filters = append (ief .filters , polarizedFilter {Exclude , f })
44
44
}
45
45
46
- func (ief * IncludeExcludeFilter ) Filter (r Reference ) bool {
46
+ func (ief * IncludeExcludeFilter ) Filter (refname string ) bool {
47
47
for i := len (ief .filters ); i > 0 ; i -- {
48
48
f := ief .filters [i - 1 ]
49
- if ! f .filter (r ) {
49
+ if ! f .filter (refname ) {
50
50
continue
51
51
}
52
52
return f .polarity == Include
@@ -66,14 +66,14 @@ func (ief *IncludeExcludeFilter) Filter(r Reference) bool {
66
66
// "refs/foobar".
67
67
func PrefixFilter (prefix string ) ReferenceFilter {
68
68
if strings .HasSuffix (prefix , "/" ) {
69
- return func (r Reference ) bool {
70
- return strings .HasPrefix (r . Refname , prefix )
69
+ return func (refname string ) bool {
70
+ return strings .HasPrefix (refname , prefix )
71
71
}
72
72
}
73
73
74
- return func (r Reference ) bool {
75
- return strings .HasPrefix (r . Refname , prefix ) &&
76
- (len (r . Refname ) == len (prefix ) || r . Refname [len (prefix )] == '/' )
74
+ return func (refname string ) bool {
75
+ return strings .HasPrefix (refname , prefix ) &&
76
+ (len (refname ) == len (prefix ) || refname [len (prefix )] == '/' )
77
77
}
78
78
}
79
79
@@ -87,7 +87,7 @@ func RegexpFilter(pattern string) (ReferenceFilter, error) {
87
87
return nil , err
88
88
}
89
89
90
- return func (r Reference ) bool {
91
- return re .MatchString (r . Refname )
90
+ return func (refname string ) bool {
91
+ return re .MatchString (refname )
92
92
}, nil
93
93
}
0 commit comments