From 2d5b1ff053073c9953f695da20dcffdf0e1496e5 Mon Sep 17 00:00:00 2001 From: Jannik Clausen Date: Thu, 16 Jan 2025 16:44:08 +0100 Subject: [PATCH] no need to use gen.IncrementStarts --- entgql/internal/todoglobalid/ent/gql_node.go | 5 ++--- entgql/template/node.tmpl | 4 ++-- 2 files changed, 4 insertions(+), 5 deletions(-) diff --git a/entgql/internal/todoglobalid/ent/gql_node.go b/entgql/internal/todoglobalid/ent/gql_node.go index b6d765b1b..d81924f92 100644 --- a/entgql/internal/todoglobalid/ent/gql_node.go +++ b/entgql/internal/todoglobalid/ent/gql_node.go @@ -32,7 +32,6 @@ import ( "entgo.io/contrib/entgql/internal/todoglobalid/ent/todo" "entgo.io/contrib/entgql/internal/todoglobalid/ent/user" "entgo.io/contrib/entgql/internal/todoglobalid/ent/workspace" - "entgo.io/ent/entc/gen" "github.com/99designs/gqlgen/graphql" "github.com/hashicorp/go-multierror" ) @@ -119,14 +118,14 @@ type nodeOptions struct { // Each node has a range of 1<<32 ids. Pre-computing a map of node starting // value to node type ensures node type resolution happens in O(1) complexity. var nodeTypes = func() map[int]string { - var is gen.IncrementStarts + var is map[string]int if err := json.Unmarshal([]byte(internal.IncrementStarts), &is); err != nil { panic(err) } // Get a map of range starting value to node type. m := make(map[int]string, len(is)) for k, v := range is { - m[int(v)] = k // ent ensures there are no duplicate starting values + m[v] = k // ent ensures there are no duplicate starting values } return m }() diff --git a/entgql/template/node.tmpl b/entgql/template/node.tmpl index 8ea52cb0b..0f7d59e1f 100644 --- a/entgql/template/node.tmpl +++ b/entgql/template/node.tmpl @@ -102,14 +102,14 @@ type nodeOptions struct { // Each node has a range of 1<<32 ids. Pre-computing a map of node starting // value to node type ensures node type resolution happens in O(1) complexity. var nodeTypes = func () map[int]string { - var is gen.IncrementStarts + var is map[string]int if err := json.Unmarshal([]byte(internal.IncrementStarts), &is); err != nil { panic(err) } // Get a map of range starting value to node type. m := make(map[int]string, len(is)) for k, v := range is { - m[int(v)] = k // ent ensures there are no duplicate starting values + m[v] = k // ent ensures there are no duplicate starting values } return m }()