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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
package gitlab
import (
"context"
"sort"
"time"
"github.com/xanzy/go-gitlab"
)
type issueIterator struct {
page int
index int
cache []*gitlab.Issue
}
type noteIterator struct {
page int
index int
cache []*gitlab.Note
}
// Since Gitlab does not return the label events items in the correct order
// we need to sort the list our selfs and stop relying on the pagination model
// #BecauseGitlab
type labelEventIterator struct {
index int
cache []*gitlab.LabelEvent
}
func (l *labelEventIterator) Len() int {
return len(l.cache)
}
func (l *labelEventIterator) Swap(i, j int) {
l.cache[i], l.cache[j] = l.cache[j], l.cache[i]
}
func (l *labelEventIterator) Less(i, j int) bool {
return l.cache[i].ID < l.cache[j].ID
}
type iterator struct {
// gitlab api v4 client
gc *gitlab.Client
// if since is given the iterator will query only the issues
// updated after this date
since time.Time
// project id
project string
// number of issues and notes to query at once
capacity int
// shared context
ctx context.Context
// sticky error
err error
// issues iterator
issue *issueIterator
// notes iterator
note *noteIterator
// labelEvent iterator
labelEvent *labelEventIterator
}
// NewIterator create a new iterator
func NewIterator(ctx context.Context, client *gitlab.Client, capacity int, projectID string, since time.Time) *iterator {
return &iterator{
gc: client,
project: projectID,
since: since,
capacity: capacity,
ctx: ctx,
issue: &issueIterator{
index: -1,
page: 1,
},
note: ¬eIterator{
index: -1,
page: 1,
},
labelEvent: &labelEventIterator{
index: -1,
},
}
}
// Error return last encountered error
func (i *iterator) Error() error {
return i.err
}
func (i *iterator) getNextIssues() bool {
ctx, cancel := context.WithTimeout(i.ctx, defaultTimeout)
defer cancel()
issues, _, err := i.gc.Issues.ListProjectIssues(
i.project,
&gitlab.ListProjectIssuesOptions{
ListOptions: gitlab.ListOptions{
Page: i.issue.page,
PerPage: i.capacity,
},
Scope: gitlab.String("all"),
UpdatedAfter: &i.since,
Sort: gitlab.String("asc"),
},
gitlab.WithContext(ctx),
)
if err != nil {
i.err = err
return false
}
// if repository doesn't have any issues
if len(issues) == 0 {
return false
}
i.issue.cache = issues
i.issue.index = 0
i.issue.page++
i.note.index = -1
i.note.cache = nil
return true
}
func (i *iterator) NextIssue() bool {
if i.err != nil {
return false
}
if i.ctx.Err() != nil {
return false
}
// first query
if i.issue.cache == nil {
return i.getNextIssues()
}
// move cursor index
if i.issue.index < len(i.issue.cache)-1 {
i.issue.index++
return true
}
return i.getNextIssues()
}
func (i *iterator) IssueValue() *gitlab.Issue {
return i.issue.cache[i.issue.index]
}
func (i *iterator) getNextNotes() bool {
ctx, cancel := context.WithTimeout(i.ctx, defaultTimeout)
defer cancel()
notes, _, err := i.gc.Notes.ListIssueNotes(
i.project,
i.IssueValue().IID,
&gitlab.ListIssueNotesOptions{
ListOptions: gitlab.ListOptions{
Page: i.note.page,
PerPage: i.capacity,
},
Sort: gitlab.String("asc"),
OrderBy: gitlab.String("created_at"),
},
gitlab.WithContext(ctx),
)
if err != nil {
i.err = err
return false
}
if len(notes) == 0 {
i.note.index = -1
i.note.page = 1
i.note.cache = nil
return false
}
i.note.cache = notes
i.note.page++
i.note.index = 0
return true
}
func (i *iterator) NextNote() bool {
if i.err != nil {
return false
}
if i.ctx.Err() != nil {
return false
}
if len(i.note.cache) == 0 {
return i.getNextNotes()
}
// move cursor index
if i.note.index < len(i.note.cache)-1 {
i.note.index++
return true
}
return i.getNextNotes()
}
func (i *iterator) NoteValue() *gitlab.Note {
return i.note.cache[i.note.index]
}
func (i *iterator) getLabelEvents() bool {
ctx, cancel := context.WithTimeout(i.ctx, defaultTimeout)
defer cancel()
// since order is not garanteed we should query all label events
// and sort them by ID
page := 1
hasNextPage := true
for hasNextPage {
labelEvents, _, err := i.gc.ResourceLabelEvents.ListIssueLabelEvents(
i.project,
i.IssueValue().IID,
&gitlab.ListLabelEventsOptions{
ListOptions: gitlab.ListOptions{
Page: page,
PerPage: i.capacity,
},
},
gitlab.WithContext(ctx),
)
if err != nil {
i.err = err
return false
}
page++
hasNextPage = len(labelEvents) != 0
i.labelEvent.cache = append(i.labelEvent.cache, labelEvents...)
}
i.labelEvent.index = 0
sort.Sort(i.labelEvent)
// if the label events list is empty return false
return len(i.labelEvent.cache) != 0
}
// because Gitlab
func (i *iterator) NextLabelEvent() bool {
if i.err != nil {
return false
}
if i.ctx.Err() != nil {
return false
}
if len(i.labelEvent.cache) == 0 {
return i.getLabelEvents()
}
// move cursor index
if i.labelEvent.index < len(i.labelEvent.cache)-1 {
i.labelEvent.index++
return true
}
return false
}
func (i *iterator) LabelEventValue() *gitlab.LabelEvent {
return i.labelEvent.cache[i.labelEvent.index]
}
|