33 lines
942 B
Ruby
33 lines
942 B
Ruby
# frozen_string_literal: true
|
|
|
|
module Resolvers
|
|
class BaseResolver < GraphQL::Schema::Resolver
|
|
def self.single
|
|
@single ||= Class.new(self) do
|
|
def resolve(**args)
|
|
super.first
|
|
end
|
|
end
|
|
end
|
|
|
|
def self.resolver_complexity(args)
|
|
complexity = 1
|
|
complexity += 1 if args[:sort]
|
|
complexity += 5 if args[:search]
|
|
|
|
complexity
|
|
end
|
|
|
|
def self.complexity_multiplier(args)
|
|
# When fetching many items, additional complexity is added to the field
|
|
# depending on how many items is fetched. For each item we add 1% of the
|
|
# original complexity - this means that loading 100 items (our default
|
|
# maxp_age_size limit) doubles the original complexity.
|
|
#
|
|
# Complexity is not increased when searching by specific ID(s), because
|
|
# complexity difference is minimal in this case.
|
|
[args[:iid], args[:iids]].any? ? 0 : 0.01
|
|
end
|
|
end
|
|
end
|