elasticgraph-graphql 1.0.1 → 1.0.3.rc1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: bc665f641870a1f2cc3c76587de1ab30de92150f4e4f0992dbb62677becdf7cb
-  data.tar.gz: ce6326b9bf846cdafa2f86b61149f820da3be2f19e84e5d2366db93f0d334570
+  metadata.gz: 491f97b51a739a57f7fd24238518fc02c0642ba2536da338d287694025f1cc9a
+  data.tar.gz: ed33c16391844f8b3321ec5849dba8a7acbe502ace6286aaabc401122d085aee
 SHA512:
-  metadata.gz: 72fb2fd0bacc529b2befe78f503da293c9279a33bc7605905c1bf6ba12e332bd7f94fccafedd07a55092ed3069f0e690965f3a0471896aeeb7e464d993a92a7c
-  data.tar.gz: 8cf3ca4740cfca36b66ba59a8fcd7c4b254cd4895b3765b9204c25a94bd45f70fa9f8ee38b5fbe8475a366c9077800876b5c03d45571017d070999f402269ef2
+  metadata.gz: 4608f68a96a8f3f55af27ca0102552888f391243c2d71961a0e395f3b9c66ea0d4fde3b68933e04d974243c4ef10c8282ff377f5888e5c1de799f4660a6b15d8
+  data.tar.gz: 9c3e3ea42f82d421c5319c373f60f23666bee9237ed7df0e84ea2a51f0d7228af49bbc8e3cce9856eaac532b5ea0b0110e7afb9204abd9e737e055743425bb9e

data/LICENSE.txt

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2024 - 2025 Block, Inc.
+Copyright (c) 2024 - 2026 Block, Inc.
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

data/lib/elastic_graph/graphql/aggregation/composite_grouping_adapter.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/computation.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/date_histogram_grouping.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -53,6 +53,10 @@ module ElasticGraph
           INNER_META
         end
 
+        def handles_missing_values?
+          false
+        end
+
         INNER_META = {
           # On a date histogram aggregation, the `key` is formatted as a number (milliseconds since epoch). We
           # need it formatted as a string, which `key_as_string` provides.

data/lib/elastic_graph/graphql/aggregation/field_path_encoder.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/field_term_grouping.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -11,10 +11,30 @@ require "elastic_graph/graphql/aggregation/term_grouping"
 module ElasticGraph
   class GraphQL
     module Aggregation
-      class FieldTermGrouping < Support::MemoizableData.define(:field_path)
+      class FieldTermGrouping < Support::MemoizableData.define(:field_path, :missing_value_placeholder)
         # @dynamic field_path
         include TermGrouping
 
+        # Returns true if this grouping handles missing values using a placeholder value
+        # instead of a separate missing aggregation.
+        #
+        # @return [Boolean] true if missing values are handled via placeholder
+        def handles_missing_values?
+          !missing_value_placeholder.nil?
+        end
+
+        def non_composite_clause_for(query)
+          return super unless handles_missing_values?
+
+          Support::HashUtil.deep_merge(super, {"terms" => {"missing" => missing_value_placeholder}})
+        end
+
+        def inner_meta
+          return super unless handles_missing_values?
+
+          super.merge({"missing_values" => [missing_value_placeholder]})
+        end
+
         private
 
         def terms_subclause

data/lib/elastic_graph/graphql/aggregation/key.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/nested_sub_aggregation.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/non_composite_grouping_adapter.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -65,29 +65,38 @@ module ElasticGraph
           def format_buckets(sub_agg, buckets_path, parent_key_fields: {}, parent_key_values: [])
             agg_with_buckets = sub_agg.dig(*buckets_path)
 
-            missing_bucket = {
-              # Doc counts in missing value buckets are always perfectly accurate.
-              "doc_count_error_upper_bound" => 0
-            }.merge(sub_agg.dig(*missing_bucket_path_from(buckets_path))) # : ::Hash[::String, untyped]
-
             meta = agg_with_buckets.fetch("meta")
 
             grouping_field_names = meta.fetch("grouping_fields") # provides the names of the fields being grouped on
             key_path = meta.fetch("key_path") # indicates whether we want to get the key values from `key` or `key_as_string`.
             sub_buckets_path = meta["buckets_path"] # buckets_path is optional, so we don't use fetch.
+            missing_values = meta["missing_values"] # missing_values is optional, so we don't use fetch.
             merge_into_bucket = meta.fetch("merge_into_bucket")
 
             raw_buckets = agg_with_buckets.fetch("buckets") # : ::Array[::Hash[::String, untyped]]
 
             # If the missing bucket is non-empty, include it. This matches the behavior of composite aggregations
             # when the `missing_bucket` option is used.
-            raw_buckets += [missing_bucket] if missing_bucket.fetch("doc_count") > 0
+            missing_bucket = sub_agg.dig(*missing_bucket_path_from(buckets_path)) || {}
+            if missing_bucket.fetch("doc_count", 0) > 0
+              # Doc counts in missing value buckets are always perfectly accurate.
+              raw_buckets += [{"doc_count_error_upper_bound" => 0}.merge(missing_bucket)]
+            end
 
             raw_buckets.flat_map do |raw_bucket|
+              key_values = Array(raw_bucket.dig(*key_path))
+              if missing_values
+                # if missing_values are present, then for each element in key_values, replace with nil if it matches the placeholder value from missing_values
+                key_values = key_values.each_with_index.map do |value, index|
+                  # @type var value: untyped
+                  # @type var index: Integer
+                  (value == missing_values[index]) ? nil : value
+                end
+              end
+
               # The key will either be a single value (e.g. `47`) if we used a `terms`/`date_histogram` aggregation,
               # or a tuple of values (e.g. `[47, "abc"]`) if we used a `multi_terms` aggregation. Here we convert it
               # to the form needed for resolving `grouped_by` fields: a hash like `{"size" => 47, "tag" => "abc"}`.
-              key_values = Array(raw_bucket.dig(*key_path))
               key_fields_hash = grouping_field_names.zip(key_values).to_h
 
               # If we have multiple levels of aggregations, we need to merge the key fields hash with the key fields from the parent levels.

data/lib/elastic_graph/graphql/aggregation/path_segment.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/query.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -154,27 +154,30 @@ module ElasticGraph
             "meta" => meta.merge(extra_inner_meta)
           }.compact
 
-          missing_bucket_inner_agg_hash = inner_agg_hash.key?("aggs") ? inner_agg_hash : {} # : ::Hash[::String, untyped]
-
-          AggregationDetail.new(
-            {
-              agg_key => grouping.non_composite_clause_for(query).merge(inner_agg_hash),
-
-              # Here we include a `missing` aggregation as a sibling to the main grouping aggregation. We do this
-              # so that we get a bucket of documents that have `null` values for the field we are grouping on, in
-              # order to provide the same behavior as the `CompositeGroupingAdapter` (which uses the built-in
-              # `missing_bucket` option).
-              #
-              # To work correctly, we need to include this `missing` aggregation as a sibling at _every_ level of
-              # the aggregation structure, and the `missing` aggregation needs the same child aggregations as the
-              # main grouping aggregation has. Given the recursive nature of how this is applied, this results in
-              # a fairly complex structure, even though conceptually the idea behind this isn't _too_ bad.
-              Key.missing_value_bucket_key(agg_key) => {
-                "missing" => {"field" => grouping.encoded_index_field_path}
-              }.merge(missing_bucket_inner_agg_hash)
-            },
-            {"buckets_path" => [agg_key]}
-          )
+          wrapped_clauses = {
+            agg_key => grouping.non_composite_clause_for(query).merge(inner_agg_hash)
+          }
+
+          unless grouping.handles_missing_values?
+            # Here we include a `missing` aggregation as a sibling to the main grouping aggregation. We do this
+            # so that we get a bucket of documents that have `null` values for the field we are grouping on, in
+            # order to provide the same behavior as the `CompositeGroupingAdapter` (which uses the built-in
+            # `missing_bucket` option).
+            #
+            # To work correctly, we need to include this `missing` aggregation as a sibling at _every_ level of
+            # the aggregation structure, and the `missing` aggregation needs the same child aggregations as the
+            # main grouping aggregation has. Given the recursive nature of how this is applied, this results in
+            # a fairly complex structure, even though conceptually the idea behind this isn't _too_ bad.
+            missing_bucket_inner_agg_hash = inner_agg_hash.key?("aggs") ? inner_agg_hash : {} # : ::Hash[::String, untyped]
+            missing_bucket_inner_agg_hash = missing_bucket_inner_agg_hash.merge({
+              "missing" => {"field" => grouping.encoded_index_field_path}
+            })
+            wrapped_clauses = wrapped_clauses.merge({
+              Key.missing_value_bucket_key(agg_key) => missing_bucket_inner_agg_hash
+            })
+          end
+
+          AggregationDetail.new(wrapped_clauses, {"buckets_path" => [agg_key]})
         end
       end
     end

data/lib/elastic_graph/graphql/aggregation/query_adapter.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -211,7 +211,8 @@ module ElasticGraph
               date_time_groupings_from(field_path: field_path, node: node)
             elsif !field.type.object?
               # Non-date/time grouping
-              [FieldTermGrouping.new(field_path: field_path)]
+              missing_value_placeholder = field.type.unwrap_fully.grouping_missing_value_placeholder
+              [FieldTermGrouping.new(field_path: field_path, missing_value_placeholder: missing_value_placeholder)]
             end
           end
         end

data/lib/elastic_graph/graphql/aggregation/query_optimizer.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/resolvers/aggregated_values.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/resolvers/count_detail.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/resolvers/grouped_by.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/resolvers/node.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/resolvers/relay_connection_builder.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/resolvers/sub_aggregations.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/aggregation/script_term_grouping.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -16,6 +16,10 @@ module ElasticGraph
         # @dynamic field_path
         include TermGrouping
 
+        def handles_missing_values?
+          false
+        end
+
         private
 
         def terms_subclause

data/lib/elastic_graph/graphql/aggregation/term_grouping.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/client.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/config.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_query/document_paginator.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_query/index_expression_builder.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_query/paginator.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_query/routing_picker.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_query.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_response/document.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -19,6 +19,7 @@ module ElasticGraph
       Document = Support::MemoizableData.define(:raw_data, :payload, :decoded_cursor_factory) do
         # @implements Document
         extend Forwardable
+
         def_delegators :payload, :[], :fetch
 
         def self.build(raw_data, decoded_cursor_factory: DecodedCursor::Factory::Null)

data/lib/elastic_graph/graphql/datastore_response/search_response.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/datastore_search_router.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/decoded_cursor.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -55,7 +55,7 @@ module ElasticGraph
       # Encodes the cursor to a string using JSON and Base64 encoding.
       def encode
         @encode ||= begin
-          json = ::JSON.fast_generate(sort_values)
+          json = ::JSON.generate(sort_values)
           ::Base64.urlsafe_encode64(json, padding: false)
         end
       end

data/lib/elastic_graph/graphql/filtering/boolean_query.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/filtering/field_path.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/filtering/filter_args_translator.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/filtering/filter_interpreter.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/filtering/filter_node_interpreter.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -107,6 +107,16 @@ module ElasticGraph
                 query: value.fetch(schema_names.phrase)
               }}})
             },
+            schema_names.matches_query_with_prefix => ->(field_name, value) do
+              allowed_edits_per_term = value.fetch(schema_names.allowed_edits_per_term).runtime_metadata.datastore_abbreviation
+
+              BooleanQuery.filter({match_bool_prefix: {field_name => {
+                query: value.fetch(schema_names.query_with_prefix),
+                # This is always a string field, even though the value is often an integer
+                fuzziness: allowed_edits_per_term.to_s,
+                operator: value[schema_names.require_all_terms] ? "AND" : "OR"
+              }}})
+            end,
 
             schema_names.contains => ->(field_name, value) {
               case_insensitive = value[schema_names.ignore_case] || false

data/lib/elastic_graph/graphql/filtering/filter_value_set_extractor.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/filtering/range_query.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -39,15 +39,49 @@ module ElasticGraph
       # a value > 10 and a value < 100 (even though no single value satisfies both parts!). When we combine
       # the clauses into a single `range` query then the filtering works like we expect.
       class RangeQuery < ::Data.define(:field_name, :operator, :value)
+        SAME_TYPE_OPS = {
+          gt: [:gt, :gte],
+          gte: [:gt, :gte],
+          lt: [:lt, :lte],
+          lte: [:lt, :lte]
+        }.freeze
+
         def merge_into(bool_node)
           existing_range_index = bool_node[:filter].find_index { |clause| clause.dig(:range, field_name) }
-          new_range_clause = {range: {field_name => {operator => value}}}
 
           if existing_range_index
-            existing_range_clause = bool_node[:filter][existing_range_index]
-            bool_node[:filter][existing_range_index] = Support::HashUtil.deep_merge(existing_range_clause, new_range_clause)
+            existing_range_hash = bool_node[:filter][existing_range_index].dig(:range, field_name)
+            merged_range_hash = merge_operators(existing_range_hash)
+            bool_node[:filter][existing_range_index] = {range: {field_name => merged_range_hash}}
+          else
+            bool_node[:filter] << {range: {field_name => {operator => value}}}
+          end
+        end
+
+        private
+
+        # Merges the new operator with existing operators.
+        # Keeps the stricter one (gt vs gte or lt vs lte) when there are conflicts.
+        def merge_operators(existing_range_hash)
+          conflicting_op = SAME_TYPE_OPS.fetch(operator).find { |op| existing_range_hash.key?(op) }
+
+          if conflicting_op
+            existing_val = existing_range_hash[conflicting_op]
+            stricter_op, stricter_val = stricter_operator(operator, value, conflicting_op, existing_val)
+            existing_range_hash.except(conflicting_op).merge(stricter_op => stricter_val)
+          else
+            existing_range_hash.merge(operator => value)
+          end
+        end
+
+        # Returns the stricter of two operators/values in the same direction.
+        def stricter_operator(op1, val1, op2, val2)
+          if [:gt, :gte].include?(op1)
+            # lower bound: higher is stricter, gt wins ties
+            (val1 > val2 || (val1 == val2 && op1 == :gt)) ? [op1, val1] : [op2, val2]
           else
-            bool_node[:filter] << new_range_clause
+            # upper bound: lower is stricter; lt wins ties
+            (val1 < val2 || (val1 == val2 && op1 == :lt)) ? [op1, val1] : [op2, val2]
           end
         end
       end

data/lib/elastic_graph/graphql/http_endpoint.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/query_adapter/filters.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/query_adapter/pagination.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/query_adapter/requested_fields.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/query_adapter/sort.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at

data/lib/elastic_graph/graphql/query_details_tracker.rb

@@ -1,4 +1,4 @@
-# Copyright 2024 - 2025 Block, Inc.
+# Copyright 2024 - 2026 Block, Inc.
 #
 # Use of this source code is governed by an MIT-style
 # license that can be found in the LICENSE file or at
@@ -17,6 +17,7 @@ module ElasticGraph
       :datastore_query_server_duration_ms,
       :datastore_query_client_duration_ms,
       :queried_shard_count,
+      :extension_data,
       :mutex
     )
       def self.empty
@@ -27,6 +28,7 @@ module ElasticGraph
           datastore_query_server_duration_ms: 0,
           datastore_query_client_duration_ms: 0,
           queried_shard_count: 0,
+          extension_data: {},
           mutex: ::Thread::Mutex.new
         )
       end
@@ -52,6 +54,13 @@ module ElasticGraph
       def datastore_request_transport_duration_ms
         datastore_query_client_duration_ms - datastore_query_server_duration_ms
       end
+
+      # Allows extensions to set custom data that will be included in the query duration log.
+      def []=(key, value)
+        mutex.synchronize do
+          extension_data[key] = value
+        end
+      end
     end
   end
 end