move getQueryComplexity to a separate package
This commit is contained in:
parent
e936b9b0ed
commit
6c28c9798d
|
|
@ -0,0 +1,225 @@
|
|||
// Code generated by github.com/vektah/dataloaden, DO NOT EDIT.
|
||||
|
||||
package dataloader
|
||||
|
||||
import (
|
||||
"sync"
|
||||
"time"
|
||||
|
||||
"github.com/zdam-egzamin-zawodowy/backend/internal/models"
|
||||
)
|
||||
|
||||
// QualificationSliceByProfessionIDLoaderConfig captures the config to create a new QualificationSliceByProfessionIDLoader
|
||||
type QualificationSliceByProfessionIDLoaderConfig struct {
|
||||
// Fetch is a method that provides the data for the loader
|
||||
Fetch func(keys []int) ([][]*models.Qualification, []error)
|
||||
|
||||
// Wait is how long wait before sending a batch
|
||||
Wait time.Duration
|
||||
|
||||
// MaxBatch will limit the maximum number of keys to send in one batch, 0 = not limit
|
||||
MaxBatch int
|
||||
}
|
||||
|
||||
// NewQualificationSliceByProfessionIDLoader creates a new QualificationSliceByProfessionIDLoader given a fetch, wait, and maxBatch
|
||||
func NewQualificationSliceByProfessionIDLoader(config QualificationSliceByProfessionIDLoaderConfig) *QualificationSliceByProfessionIDLoader {
|
||||
return &QualificationSliceByProfessionIDLoader{
|
||||
fetch: config.Fetch,
|
||||
wait: config.Wait,
|
||||
maxBatch: config.MaxBatch,
|
||||
}
|
||||
}
|
||||
|
||||
// QualificationSliceByProfessionIDLoader batches and caches requests
|
||||
type QualificationSliceByProfessionIDLoader struct {
|
||||
// this method provides the data for the loader
|
||||
fetch func(keys []int) ([][]*models.Qualification, []error)
|
||||
|
||||
// how long to done before sending a batch
|
||||
wait time.Duration
|
||||
|
||||
// this will limit the maximum number of keys to send in one batch, 0 = no limit
|
||||
maxBatch int
|
||||
|
||||
// INTERNAL
|
||||
|
||||
// lazily created cache
|
||||
cache map[int][]*models.Qualification
|
||||
|
||||
// the current batch. keys will continue to be collected until timeout is hit,
|
||||
// then everything will be sent to the fetch method and out to the listeners
|
||||
batch *qualificationSliceByProfessionIDLoaderBatch
|
||||
|
||||
// mutex to prevent races
|
||||
mu sync.Mutex
|
||||
}
|
||||
|
||||
type qualificationSliceByProfessionIDLoaderBatch struct {
|
||||
keys []int
|
||||
data [][]*models.Qualification
|
||||
error []error
|
||||
closing bool
|
||||
done chan struct{}
|
||||
}
|
||||
|
||||
// Load a Qualification by key, batching and caching will be applied automatically
|
||||
func (l *QualificationSliceByProfessionIDLoader) Load(key int) ([]*models.Qualification, error) {
|
||||
return l.LoadThunk(key)()
|
||||
}
|
||||
|
||||
// LoadThunk returns a function that when called will block waiting for a Qualification.
|
||||
// This method should be used if you want one goroutine to make requests to many
|
||||
// different data loaders without blocking until the thunk is called.
|
||||
func (l *QualificationSliceByProfessionIDLoader) LoadThunk(key int) func() ([]*models.Qualification, error) {
|
||||
l.mu.Lock()
|
||||
if it, ok := l.cache[key]; ok {
|
||||
l.mu.Unlock()
|
||||
return func() ([]*models.Qualification, error) {
|
||||
return it, nil
|
||||
}
|
||||
}
|
||||
if l.batch == nil {
|
||||
l.batch = &qualificationSliceByProfessionIDLoaderBatch{done: make(chan struct{})}
|
||||
}
|
||||
batch := l.batch
|
||||
pos := batch.keyIndex(l, key)
|
||||
l.mu.Unlock()
|
||||
|
||||
return func() ([]*models.Qualification, error) {
|
||||
<-batch.done
|
||||
|
||||
var data []*models.Qualification
|
||||
if pos < len(batch.data) {
|
||||
data = batch.data[pos]
|
||||
}
|
||||
|
||||
var err error
|
||||
// its convenient to be able to return a single error for everything
|
||||
if len(batch.error) == 1 {
|
||||
err = batch.error[0]
|
||||
} else if batch.error != nil {
|
||||
err = batch.error[pos]
|
||||
}
|
||||
|
||||
if err == nil {
|
||||
l.mu.Lock()
|
||||
l.unsafeSet(key, data)
|
||||
l.mu.Unlock()
|
||||
}
|
||||
|
||||
return data, err
|
||||
}
|
||||
}
|
||||
|
||||
// LoadAll fetches many keys at once. It will be broken into appropriate sized
|
||||
// sub batches depending on how the loader is configured
|
||||
func (l *QualificationSliceByProfessionIDLoader) LoadAll(keys []int) ([][]*models.Qualification, []error) {
|
||||
results := make([]func() ([]*models.Qualification, error), len(keys))
|
||||
|
||||
for i, key := range keys {
|
||||
results[i] = l.LoadThunk(key)
|
||||
}
|
||||
|
||||
qualifications := make([][]*models.Qualification, len(keys))
|
||||
errors := make([]error, len(keys))
|
||||
for i, thunk := range results {
|
||||
qualifications[i], errors[i] = thunk()
|
||||
}
|
||||
return qualifications, errors
|
||||
}
|
||||
|
||||
// LoadAllThunk returns a function that when called will block waiting for a Qualifications.
|
||||
// This method should be used if you want one goroutine to make requests to many
|
||||
// different data loaders without blocking until the thunk is called.
|
||||
func (l *QualificationSliceByProfessionIDLoader) LoadAllThunk(keys []int) func() ([][]*models.Qualification, []error) {
|
||||
results := make([]func() ([]*models.Qualification, error), len(keys))
|
||||
for i, key := range keys {
|
||||
results[i] = l.LoadThunk(key)
|
||||
}
|
||||
return func() ([][]*models.Qualification, []error) {
|
||||
qualifications := make([][]*models.Qualification, len(keys))
|
||||
errors := make([]error, len(keys))
|
||||
for i, thunk := range results {
|
||||
qualifications[i], errors[i] = thunk()
|
||||
}
|
||||
return qualifications, errors
|
||||
}
|
||||
}
|
||||
|
||||
// Prime the cache with the provided key and value. If the key already exists, no change is made
|
||||
// and false is returned.
|
||||
// (To forcefully prime the cache, clear the key first with loader.clear(key).prime(key, value).)
|
||||
func (l *QualificationSliceByProfessionIDLoader) Prime(key int, value []*models.Qualification) bool {
|
||||
l.mu.Lock()
|
||||
var found bool
|
||||
if _, found = l.cache[key]; !found {
|
||||
// make a copy when writing to the cache, its easy to pass a pointer in from a loop var
|
||||
// and end up with the whole cache pointing to the same value.
|
||||
cpy := make([]*models.Qualification, len(value))
|
||||
copy(cpy, value)
|
||||
l.unsafeSet(key, cpy)
|
||||
}
|
||||
l.mu.Unlock()
|
||||
return !found
|
||||
}
|
||||
|
||||
// Clear the value at key from the cache, if it exists
|
||||
func (l *QualificationSliceByProfessionIDLoader) Clear(key int) {
|
||||
l.mu.Lock()
|
||||
delete(l.cache, key)
|
||||
l.mu.Unlock()
|
||||
}
|
||||
|
||||
func (l *QualificationSliceByProfessionIDLoader) unsafeSet(key int, value []*models.Qualification) {
|
||||
if l.cache == nil {
|
||||
l.cache = map[int][]*models.Qualification{}
|
||||
}
|
||||
l.cache[key] = value
|
||||
}
|
||||
|
||||
// keyIndex will return the location of the key in the batch, if its not found
|
||||
// it will add the key to the batch
|
||||
func (b *qualificationSliceByProfessionIDLoaderBatch) keyIndex(l *QualificationSliceByProfessionIDLoader, key int) int {
|
||||
for i, existingKey := range b.keys {
|
||||
if key == existingKey {
|
||||
return i
|
||||
}
|
||||
}
|
||||
|
||||
pos := len(b.keys)
|
||||
b.keys = append(b.keys, key)
|
||||
if pos == 0 {
|
||||
go b.startTimer(l)
|
||||
}
|
||||
|
||||
if l.maxBatch != 0 && pos >= l.maxBatch-1 {
|
||||
if !b.closing {
|
||||
b.closing = true
|
||||
l.batch = nil
|
||||
go b.end(l)
|
||||
}
|
||||
}
|
||||
|
||||
return pos
|
||||
}
|
||||
|
||||
func (b *qualificationSliceByProfessionIDLoaderBatch) startTimer(l *QualificationSliceByProfessionIDLoader) {
|
||||
time.Sleep(l.wait)
|
||||
l.mu.Lock()
|
||||
|
||||
// we must have hit a batch limit and are already finalizing this batch
|
||||
if b.closing {
|
||||
l.mu.Unlock()
|
||||
return
|
||||
}
|
||||
|
||||
l.batch = nil
|
||||
l.mu.Unlock()
|
||||
|
||||
b.end(l)
|
||||
}
|
||||
|
||||
func (b *qualificationSliceByProfessionIDLoaderBatch) end(l *QualificationSliceByProfessionIDLoader) {
|
||||
b.data, b.error = l.fetch(b.keys)
|
||||
close(b.done)
|
||||
}
|
||||
|
|
@ -2,7 +2,7 @@ package httpdelivery
|
|||
|
||||
import (
|
||||
"fmt"
|
||||
"github.com/zdam-egzamin-zawodowy/backend/internal/models"
|
||||
"github.com/zdam-egzamin-zawodowy/backend/internal/graphql/querycomplexity"
|
||||
"time"
|
||||
|
||||
"github.com/99designs/gqlgen/graphql/handler"
|
||||
|
|
@ -55,7 +55,7 @@ func graphqlHandler(cfg generated.Config) gin.HandlerFunc {
|
|||
srv.Use(extension.AutomaticPersistedQuery{
|
||||
Cache: lru.New(100),
|
||||
})
|
||||
srv.SetQueryCache(lru.New(1000))
|
||||
srv.SetQueryCache(lru.New(100))
|
||||
srv.Use(extension.FixedComplexityLimit(complexityLimit))
|
||||
if mode.Get() == mode.DevelopmentMode {
|
||||
srv.Use(extension.Introspection{})
|
||||
|
|
@ -80,122 +80,9 @@ func playgroundHandler() gin.HandlerFunc {
|
|||
func prepareConfig(r *resolvers.Resolver, d *directive.Directive) generated.Config {
|
||||
cfg := generated.Config{
|
||||
Resolvers: r,
|
||||
Complexity: getComplexityRoot(),
|
||||
Complexity: querycomplexity.GetComplexityRoot(),
|
||||
}
|
||||
cfg.Directives.Authenticated = d.Authenticated
|
||||
cfg.Directives.HasRole = d.HasRole
|
||||
return cfg
|
||||
}
|
||||
|
||||
func getComplexityRoot() generated.ComplexityRoot {
|
||||
complexityRoot := generated.ComplexityRoot{}
|
||||
complexityRoot.Query.GenerateTest = func(childComplexity int, qualificationIDs []int, limit *int) int {
|
||||
return 300 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Professions = func(
|
||||
childComplexity int,
|
||||
filter *models.ProfessionFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Qualifications = func(
|
||||
childComplexity int,
|
||||
filter *models.QualificationFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Questions = func(
|
||||
childComplexity int,
|
||||
filter *models.QuestionFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Users = func(
|
||||
childComplexity int,
|
||||
filter *models.UserFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateProfession = func(childComplexity int, input models.ProfessionInput) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateQualification = func(
|
||||
childComplexity int,
|
||||
input models.QualificationInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateQuestion = func(childComplexity int, input models.QuestionInput) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateUser = func(childComplexity int, input models.UserInput) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.SignIn = func(
|
||||
childComplexity int,
|
||||
email string,
|
||||
password string,
|
||||
staySignedIn *bool,
|
||||
) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteProfessions = func(childComplexity int, ids []int) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteQualifications = func(childComplexity int, ids []int) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteQuestions = func(childComplexity int, ids []int) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteUsers = func(childComplexity int, ids []int) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateManyUsers = func(
|
||||
childComplexity int,
|
||||
ids []int,
|
||||
input models.UserInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateProfession = func(
|
||||
childComplexity int,
|
||||
id int,
|
||||
input models.ProfessionInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateQualification = func(
|
||||
childComplexity int,
|
||||
id int,
|
||||
input models.QualificationInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateQuestion = func(
|
||||
childComplexity int,
|
||||
id int,
|
||||
input models.QuestionInput,
|
||||
) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateUser = func(childComplexity int, id int, input models.UserInput) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Profession.Qualifications = func(childComplexity int) int {
|
||||
return 50 + childComplexity
|
||||
}
|
||||
return complexityRoot
|
||||
}
|
||||
|
|
|
|||
|
|
@ -0,0 +1,136 @@
|
|||
package querycomplexity
|
||||
|
||||
import (
|
||||
"github.com/zdam-egzamin-zawodowy/backend/internal/graphql/generated"
|
||||
"github.com/zdam-egzamin-zawodowy/backend/internal/models"
|
||||
)
|
||||
|
||||
const (
|
||||
countComplexity = 1000
|
||||
)
|
||||
|
||||
func GetComplexityRoot() generated.ComplexityRoot {
|
||||
complexityRoot := generated.ComplexityRoot{}
|
||||
complexityRoot.Query.GenerateTest = func(childComplexity int, qualificationIDs []int, limit *int) int {
|
||||
return 300 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Professions = func(
|
||||
childComplexity int,
|
||||
filter *models.ProfessionFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Qualifications = func(
|
||||
childComplexity int,
|
||||
filter *models.QualificationFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Questions = func(
|
||||
childComplexity int,
|
||||
filter *models.QuestionFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Query.Users = func(
|
||||
childComplexity int,
|
||||
filter *models.UserFilter,
|
||||
limit *int,
|
||||
offset *int,
|
||||
sort []string,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateProfession = func(childComplexity int, input models.ProfessionInput) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateQualification = func(
|
||||
childComplexity int,
|
||||
input models.QualificationInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateQuestion = func(childComplexity int, input models.QuestionInput) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.CreateUser = func(childComplexity int, input models.UserInput) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.SignIn = func(
|
||||
childComplexity int,
|
||||
email string,
|
||||
password string,
|
||||
staySignedIn *bool,
|
||||
) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteProfessions = func(childComplexity int, ids []int) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteQualifications = func(childComplexity int, ids []int) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteQuestions = func(childComplexity int, ids []int) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.DeleteUsers = func(childComplexity int, ids []int) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateManyUsers = func(
|
||||
childComplexity int,
|
||||
ids []int,
|
||||
input models.UserInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateProfession = func(
|
||||
childComplexity int,
|
||||
id int,
|
||||
input models.ProfessionInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateQualification = func(
|
||||
childComplexity int,
|
||||
id int,
|
||||
input models.QualificationInput,
|
||||
) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateQuestion = func(
|
||||
childComplexity int,
|
||||
id int,
|
||||
input models.QuestionInput,
|
||||
) int {
|
||||
return 400 + childComplexity
|
||||
}
|
||||
complexityRoot.Mutation.UpdateUser = func(childComplexity int, id int, input models.UserInput) int {
|
||||
return 200 + childComplexity
|
||||
}
|
||||
complexityRoot.Profession.Qualifications = func(childComplexity int) int {
|
||||
return 50 + childComplexity
|
||||
}
|
||||
return complexityRoot
|
||||
}
|
||||
|
||||
func computeComplexity(childComplexity, limit, totalFieldComplexity, multiplyBy int) int {
|
||||
complexity := 0
|
||||
if childComplexity >= countComplexity {
|
||||
childComplexity -= countComplexity
|
||||
complexity += totalFieldComplexity
|
||||
}
|
||||
return limit*childComplexity*multiplyBy + complexity
|
||||
}
|
||||
|
||||
func getCountComplexity(childComplexity int) int {
|
||||
return countComplexity + childComplexity
|
||||
}
|
||||
|
|
@ -15,5 +15,5 @@ func Wrapf(details error, message string, args ...interface{}) error {
|
|||
if mode.Get() != mode.ProductionMode {
|
||||
return errors.Wrapf(details, message, args...)
|
||||
}
|
||||
return fmt.Errorf(message)
|
||||
return fmt.Errorf(message, args...)
|
||||
}
|
||||
|
|
|
|||
Reference in New Issue