aboutsummaryrefslogtreecommitdiffstats
path: root/graphql/connections/gen_bug.go
diff options
context:
space:
mode:
authorMichael Muré <batolettre@gmail.com>2019-04-05 01:13:17 +0200
committerMichael Muré <batolettre@gmail.com>2019-04-05 01:13:17 +0200
commite027d5ee65aad72ca7cface8e609ea0c65f99fbe (patch)
tree3b67170e86c4158dd2dd4f23f3013641505dac35 /graphql/connections/gen_bug.go
parentb9e413c5f95212a0076aae0f473226b32b5fc77a (diff)
downloadgit-bug-e027d5ee65aad72ca7cface8e609ea0c65f99fbe.tar.gz
graphql: make Bug's actors and participants a connection
Diffstat (limited to 'graphql/connections/gen_bug.go')
-rw-r--r--graphql/connections/gen_bug.go110
1 files changed, 0 insertions, 110 deletions
diff --git a/graphql/connections/gen_bug.go b/graphql/connections/gen_bug.go
deleted file mode 100644
index ba0a65fa..00000000
--- a/graphql/connections/gen_bug.go
+++ /dev/null
@@ -1,110 +0,0 @@
-// 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"
-)
-
-// StringEdgeMaker define a function that take a string and an offset and
-// create an Edge.
-type LazyBugEdgeMaker func(value string, offset int) Edge
-
-// LazyBugConMaker define a function that create a models.BugConnection
-type LazyBugConMaker func(
- edges []LazyBugEdge,
- nodes []string,
- info models.PageInfo,
- totalCount int) (models.BugConnection, error)
-
-// LazyBugCon will paginate a source according to the input of a relay connection
-func LazyBugCon(source []string, edgeMaker LazyBugEdgeMaker, conMaker LazyBugConMaker, input models.ConnectionInput) (models.BugConnection, error) {
- var nodes []string
- var edges []LazyBugEdge
- var cursors []string
- var pageInfo models.PageInfo
- var totalCount = len(source)
-
- emptyCon, _ := conMaker(edges, nodes, pageInfo, 0)
-
- offset := 0
-
- if input.After != nil {
- for i, value := range source {
- edge := edgeMaker(value, i)
- if edge.GetCursor() == *input.After {
- // remove all previous element including the "after" one
- source = source[i+1:]
- offset = i + 1
- pageInfo.HasPreviousPage = true
- break
- }
- }
- }
-
- if input.Before != nil {
- for i, value := range source {
- edge := edgeMaker(value, i+offset)
-
- if edge.GetCursor() == *input.Before {
- // remove all after element including the "before" one
- pageInfo.HasNextPage = true
- break
- }
-
- edges = append(edges, edge.(LazyBugEdge))
- cursors = append(cursors, edge.GetCursor())
- nodes = append(nodes, value)
- }
- } else {
- edges = make([]LazyBugEdge, len(source))
- cursors = make([]string, len(source))
- nodes = source
-
- for i, value := range source {
- edge := edgeMaker(value, i+offset)
- edges[i] = edge.(LazyBugEdge)
- cursors[i] = edge.GetCursor()
- }
- }
-
- 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]
- cursors = cursors[:*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:]
- cursors = cursors[len(cursors)-*input.Last:]
- nodes = nodes[len(nodes)-*input.Last:]
- pageInfo.HasPreviousPage = true
- }
- }
-
- // Fill up pageInfo cursors
- if len(cursors) > 0 {
- pageInfo.StartCursor = cursors[0]
- pageInfo.EndCursor = cursors[len(cursors)-1]
- }
-
- return conMaker(edges, nodes, pageInfo, totalCount)
-}