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
|
// This file was automatically generated by genny.
// Any changes will be lost if this file is regenerated.
// see https://github.com/cheekybits/genny
package connections
import (
"fmt"
"github.com/MichaelMure/git-bug/graphql/models"
)
// StringEdger define a function that take a string and an offset and
// create an Edge.
type StringEdger func(value string, offset int) Edge
// StringConMaker define a function that create a models.BugConnection
type StringConMaker func(
edges []LazyBugEdge,
nodes []string,
info models.PageInfo,
totalCount int) (models.BugConnection, error)
// StringCon will paginate a source according to the input of a relay connection
func StringCon(source []string, edger StringEdger, conMaker StringConMaker, input models.ConnectionInput) (models.BugConnection, error) {
var nodes []string
var edges []LazyBugEdge
var pageInfo models.PageInfo
emptyCon, _ := conMaker(edges, nodes, pageInfo, 0)
offset := 0
if input.After != nil {
for i, value := range source {
edge := edger(value, i)
if edge.GetCursor() == *input.After {
// remove all previous element including the "after" one
source = source[i+1:]
offset = i + 1
break
}
}
}
if input.Before != nil {
for i, value := range source {
edge := edger(value, i+offset)
if edge.GetCursor() == *input.Before {
// remove all after element including the "before" one
break
}
edges = append(edges, edge.(LazyBugEdge))
nodes = append(nodes, value)
}
} else {
edges = make([]LazyBugEdge, len(source))
nodes = source
for i, value := range source {
edges[i] = edger(value, i+offset).(LazyBugEdge)
}
}
if input.First != nil {
if *input.First < 0 {
return emptyCon, fmt.Errorf("first less than zero")
}
if len(edges) > *input.First {
// Slice result to be of length first by removing edges from the end
edges = edges[:*input.First]
nodes = nodes[:*input.First]
pageInfo.HasNextPage = true
}
}
if input.Last != nil {
if *input.Last < 0 {
return emptyCon, fmt.Errorf("last less than zero")
}
if len(edges) > *input.Last {
// Slice result to be of length last by removing edges from the start
edges = edges[len(edges)-*input.Last:]
nodes = nodes[len(nodes)-*input.Last:]
pageInfo.HasPreviousPage = true
}
}
return conMaker(edges, nodes, pageInfo, len(source))
}
|
