2018-07-29 20:37:06 +03:00
|
|
|
// 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"
|
|
|
|
)
|
|
|
|
|
2018-07-29 21:58:22 +03:00
|
|
|
type StringEdger func(value string, offset int) Edge
|
|
|
|
type StringConMaker func(edges []LazyBugEdge, info models.PageInfo, totalCount int) (models.BugConnection, error)
|
2018-07-29 20:37:06 +03:00
|
|
|
|
2018-07-29 21:58:22 +03:00
|
|
|
func StringCon(source []string, edger StringEdger, conMaker StringConMaker, input models.ConnectionInput) (models.BugConnection, error) {
|
|
|
|
var edges []LazyBugEdge
|
2018-07-29 20:37:06 +03:00
|
|
|
var pageInfo models.PageInfo
|
|
|
|
|
2018-07-29 21:58:22 +03:00
|
|
|
emptyCon, _ := conMaker(edges, pageInfo, 0)
|
2018-07-29 20:37:06 +03:00
|
|
|
|
|
|
|
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
|
|
|
|
}
|
|
|
|
|
2018-07-29 21:58:22 +03:00
|
|
|
edges = append(edges, edge.(LazyBugEdge))
|
2018-07-29 20:37:06 +03:00
|
|
|
}
|
|
|
|
} else {
|
2018-07-29 21:58:22 +03:00
|
|
|
edges = make([]LazyBugEdge, len(source))
|
2018-07-29 20:37:06 +03:00
|
|
|
|
|
|
|
for i, value := range source {
|
2018-07-29 21:58:22 +03:00
|
|
|
edges[i] = edger(value, i+offset).(LazyBugEdge)
|
2018-07-29 20:37:06 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
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]
|
|
|
|
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:]
|
|
|
|
pageInfo.HasPreviousPage = true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-29 21:58:22 +03:00
|
|
|
return conMaker(edges, pageInfo, len(source))
|
2018-07-29 20:37:06 +03:00
|
|
|
}
|