graphql-core 3.2.8__tar.gz → 3.2.9__tar.gz

{graphql_core-3.2.8 → graphql_core-3.2.9}/.bumpversion.cfg

@@ -1,5 +1,5 @@
 [bumpversion]
-current_version = 3.2.8
+current_version = 3.2.9
 commit = False
 tag = False
 

{graphql_core-3.2.8 → graphql_core-3.2.9}/.readthedocs.yaml

@@ -5,9 +5,9 @@
 version: 2
 
 build:
-  os: ubuntu-20.04
+  os: ubuntu-24.04
   tools:
-    python: "3.9"
+    python: "3.12"
 
 sphinx:
    configuration: docs/conf.py

{graphql_core-3.2.8 → graphql_core-3.2.9}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: graphql-core
-Version: 3.2.8
+Version: 3.2.9
 Summary: GraphQL implementation for Python, a port of GraphQL.js, the JavaScript reference implementation for GraphQL.
 Home-page: https://github.com/graphql-python/graphql-core
 Author: Christoph Zwerschke
@@ -50,7 +50,7 @@ a query language for APIs created by Facebook.
 ![Lint Status](https://github.com/graphql-python/graphql-core/actions/workflows/lint.yml/badge.svg)
 [![Code Style](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/ambv/black)
 
-The current version 3.2.8 of GraphQL-core is up-to-date with GraphQL.js version 16.9.0.
+The current version 3.2.9 of GraphQL-core is up-to-date with GraphQL.js version 16.10.0.
 
 An extensive test suite with over 2500 unit tests and 100% coverage comprises a
 replication of the complete test suite of GraphQL.js, making sure this port is

{graphql_core-3.2.8 → graphql_core-3.2.9}/README.md

@@ -10,7 +10,7 @@ a query language for APIs created by Facebook.
 ![Lint Status](https://github.com/graphql-python/graphql-core/actions/workflows/lint.yml/badge.svg)
 [![Code Style](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/ambv/black)
 
-The current version 3.2.8 of GraphQL-core is up-to-date with GraphQL.js version 16.9.0.
+The current version 3.2.9 of GraphQL-core is up-to-date with GraphQL.js version 16.10.0.
 
 An extensive test suite with over 2500 unit tests and 100% coverage comprises a
 replication of the complete test suite of GraphQL.js, making sure this port is

{graphql_core-3.2.8 → graphql_core-3.2.9}/docs/conf.py

@@ -61,7 +61,7 @@ author = "Christoph Zwerschke"
 # The short X.Y version.
 # version = '3.2'
 # The full version, including alpha/beta/rc tags.
-version = release = "3.2.8"
+version = release = "3.2.9"
 
 # The language for content autogenerated by Sphinx. Refer to documentation
 # for a list of supported languages.
@@ -148,6 +148,7 @@ EnterLeaveVisitor
 FormattedSourceLocation
 GraphQLAbstractType
 GraphQLErrorExtensions
+GraphQLFormattedErrorExtensions
 GraphQLOutputType
 asyncio.events.AbstractEventLoop
 graphql.execution.map_async_iterator.MapAsyncIterator

graphql_core-3.2.9/docs/requirements.txt

@@ -0,0 +1,2 @@
+sphinx>=9.1,<10
+sphinx_rtd_theme>=3.1,<4

{graphql_core-3.2.8 → graphql_core-3.2.9}/docs/usage/introspection.rst

@@ -28,7 +28,7 @@ The ``data`` attribute of the introspection query result now gives us a dictiona
 which constitutes a third way of describing a GraphQL schema::
 
     {'__schema': {
-        'queryType': {'name': 'Query'},
+        'queryType': {'name': 'Query', 'kind': 'OBJECT'},
         'mutationType': None, 'subscriptionType': None,
         'types': [
             {'kind': 'OBJECT', 'name': 'Query', 'description': None,

{graphql_core-3.2.8 → graphql_core-3.2.9}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "graphql-core"
-version = "3.2.8"
+version = "3.2.9"
 description = """
 GraphQL-core is a Python port of GraphQL.js,\
  the JavaScript reference implementation for GraphQL."""

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/__init__.py

@@ -48,6 +48,7 @@ from .error import (
     GraphQLError,
     GraphQLErrorExtensions,
     GraphQLFormattedError,
+    GraphQLFormattedErrorExtensions,
     GraphQLSyntaxError,
     located_error,
 )
@@ -748,6 +749,7 @@ __all__ = [
     "GraphQLError",
     "GraphQLErrorExtensions",
     "GraphQLFormattedError",
+    "GraphQLFormattedErrorExtensions",
     "GraphQLSyntaxError",
     "located_error",
     "get_introspection_query",

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/error/__init__.py

@@ -4,7 +4,12 @@ The :mod:`graphql.error` package is responsible for creating and formatting Grap
 errors.
 """
 
-from .graphql_error import GraphQLError, GraphQLErrorExtensions, GraphQLFormattedError
+from .graphql_error import (
+    GraphQLError,
+    GraphQLErrorExtensions,
+    GraphQLFormattedError,
+    GraphQLFormattedErrorExtensions,
+)
 
 from .syntax_error import GraphQLSyntaxError
 
@@ -14,6 +19,7 @@ __all__ = [
     "GraphQLError",
     "GraphQLErrorExtensions",
     "GraphQLFormattedError",
+    "GraphQLFormattedErrorExtensions",
     "GraphQLSyntaxError",
     "located_error",
 ]

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/error/graphql_error.py

@@ -14,7 +14,12 @@ if TYPE_CHECKING:
     )  # noqa: F401
     from ..language.source import Source  # noqa: F401
 
-__all__ = ["GraphQLError", "GraphQLErrorExtensions", "GraphQLFormattedError"]
+__all__ = [
+    "GraphQLError",
+    "GraphQLErrorExtensions",
+    "GraphQLFormattedError",
+    "GraphQLFormattedErrorExtensions",
+]
 
 
 # Custom extensions
@@ -25,6 +30,14 @@ GraphQLErrorExtensions = Dict[str, Any]
 # a dictionary which can contain all the values you need.
 
 
+# Custom formatted extensions
+GraphQLFormattedErrorExtensions = Dict[str, Any]
+# Use a unique identifier name for your extension, for example the name of
+# your library or project. Do not use a shortened identifier as this increases
+# the risk of conflicts. We recommend you add at most one extension key,
+# a dictionary which can contain all the values you need.
+
+
 class GraphQLFormattedError(TypedDict, total=False):
     """Formatted GraphQL error"""
 
@@ -41,7 +54,7 @@ class GraphQLFormattedError(TypedDict, total=False):
     path: List[Union[str, int]]
     # Reserved for implementors to extend the protocol however they see fit,
     # and hence there are no additional restrictions on its contents.
-    extensions: GraphQLErrorExtensions
+    extensions: GraphQLFormattedErrorExtensions
 
 
 class GraphQLError(Exception):

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/language/ast.py

@@ -411,6 +411,11 @@ class DocumentNode(Node):
     __slots__ = ("definitions",)
 
     definitions: Tuple["DefinitionNode", ...]
+    # The number of tokens in the parsed document. Set by the parser per instance
+    # and deliberately kept out of ``__slots__`` (and therefore out of ``keys``) so
+    # that it is not treated as a traversable attribute, the equivalent of the
+    # non-enumerable ``tokenCount`` property in graphql-js.
+    token_count: int = 0
 
 
 class DefinitionNode(Node):

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/language/parser.py

@@ -234,13 +234,21 @@ class Parser:
 
     # Implement the parsing rules in the Document section.
 
+    @property
+    def token_count(self) -> int:
+        """Get the number of tokens that have been parsed so far."""
+        return self._token_counter
+
     def parse_document(self) -> DocumentNode:
         """Document: Definition+"""
         start = self._lexer.token
-        return DocumentNode(
+        document = DocumentNode(
             definitions=self.many(TokenKind.SOF, self.parse_definition, TokenKind.EOF),
             loc=self.loc(start),
         )
+        # Expose the token count as a (non-traversable) attribute on the document.
+        document.token_count = self.token_count
+        return document
 
     _parse_type_system_definition_method_names: Dict[str, str] = {
         "schema": "schema_definition",
@@ -1177,12 +1185,12 @@ class Parser:
         return nodes
 
     def advance_lexer(self) -> None:
-        max_tokens = self._max_tokens
         token = self._lexer.advance()
 
-        if max_tokens is not None and token.kind != TokenKind.EOF:
+        if token.kind != TokenKind.EOF:
             self._token_counter += 1
-            if self._token_counter > max_tokens:
+            max_tokens = self._max_tokens
+            if max_tokens is not None and self._token_counter > max_tokens:
                 raise GraphQLSyntaxError(
                     self._lexer.source,
                     token.start,

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/type/validate.py

@@ -589,7 +589,8 @@ class InputObjectCircularRefsValidator:
 
 
 def get_all_implements_interface_nodes(
-    type_: Union[GraphQLObjectType, GraphQLInterfaceType], iface: GraphQLInterfaceType
+    type_: Union[GraphQLObjectType, GraphQLInterfaceType],
+    iface: Union[GraphQLObjectType, GraphQLInterfaceType],
 ) -> List[NamedTypeNode]:
     ast_node = type_.ast_node
     nodes = type_.extension_ast_nodes

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/utilities/get_introspection_query.py

@@ -55,9 +55,9 @@ def get_introspection_query(
         query IntrospectionQuery {{
           __schema {{
             {maybe_schema_description}
-            queryType {{ name }}
-            mutationType {{ name }}
-            subscriptionType {{ name }}
+            queryType {{ name kind }}
+            mutationType {{ name kind }}
+            subscriptionType {{ name kind }}
             types {{
               ...FullType
             }}

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/utilities/lexicographic_sort_schema.py

@@ -92,13 +92,13 @@ def lexicographic_sort_schema(schema: GraphQLSchema) -> GraphQLSchema:
     ) -> Dict[str, GraphQLInputField]:
         return {
             name: GraphQLInputField(
-                cast(
-                    GraphQLInputType, replace_type(cast(GraphQLNamedType, field.type))
-                ),
-                description=field.description,
-                default_value=field.default_value,
-                extensions=field.extensions,
-                ast_node=field.ast_node,
+                **merge_kwargs(
+                    field.to_kwargs(),
+                    type_=cast(
+                        GraphQLInputType,
+                        replace_type(cast(GraphQLNamedType, field.type)),
+                    ),
+                )
             )
             for name, field in sorted(fields_map.items())
         }
@@ -169,20 +169,24 @@ def lexicographic_sort_schema(schema: GraphQLSchema) -> GraphQLSchema:
     }
 
     return GraphQLSchema(
-        types=type_map.values(),
-        directives=[
-            sort_directive(directive)
-            for directive in sorted(schema.directives, key=sort_by_name_key)
-        ],
-        query=cast(Optional[GraphQLObjectType], replace_maybe_type(schema.query_type)),
-        mutation=cast(
-            Optional[GraphQLObjectType], replace_maybe_type(schema.mutation_type)
-        ),
-        subscription=cast(
-            Optional[GraphQLObjectType], replace_maybe_type(schema.subscription_type)
-        ),
-        extensions=schema.extensions,
-        ast_node=schema.ast_node,
+        **merge_kwargs(
+            schema.to_kwargs(),
+            types=type_map.values(),
+            directives=[
+                sort_directive(directive)
+                for directive in sorted(schema.directives, key=sort_by_name_key)
+            ],
+            query=cast(
+                Optional[GraphQLObjectType], replace_maybe_type(schema.query_type)
+            ),
+            mutation=cast(
+                Optional[GraphQLObjectType], replace_maybe_type(schema.mutation_type)
+            ),
+            subscription=cast(
+                Optional[GraphQLObjectType],
+                replace_maybe_type(schema.subscription_type),
+            ),
+        )
     )
 
 

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/validation/rules/overlapping_fields_can_be_merged.py

@@ -56,9 +56,10 @@ class OverlappingFieldsCanBeMergedRule(ValidationRule):
 
     def __init__(self, context: ValidationContext):
         super().__init__(context)
-        # A memoization for when two fragments are compared "between" each other for
-        # conflicts. Two fragments may be compared many times, so memoizing this can
-        # dramatically improve the performance of this validator.
+        # A memoization for when fields and a fragment or two fragments are compared
+        # "between" each other for conflicts. Comparisons may be made many times, so
+        # memoizing this can dramatically improve the performance of this validator.
+        self.compared_fields_and_fragment_pairs = OrderedPairSet()
         self.compared_fragment_pairs = PairSet()
 
         # A cache for the "field map" and list of fragment names found in any given
@@ -70,6 +71,7 @@ class OverlappingFieldsCanBeMergedRule(ValidationRule):
         conflicts = find_conflicts_within_selection_set(
             self.context,
             self.cached_fields_and_fragment_names,
+            self.compared_fields_and_fragment_pairs,
             self.compared_fragment_pairs,
             self.context.get_parent_type(),
             selection_set,
@@ -156,6 +158,7 @@ NodeAndDefCollection = Dict[str, List[NodeAndDef]]
 def find_conflicts_within_selection_set(
     context: ValidationContext,
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     parent_type: Optional[GraphQLNamedType],
     selection_set: SelectionSetNode,
@@ -179,6 +182,7 @@ def find_conflicts_within_selection_set(
         context,
         conflicts,
         cached_fields_and_fragment_names,
+        compared_fields_and_fragment_pairs,
         compared_fragment_pairs,
         field_map,
     )
@@ -191,6 +195,7 @@ def find_conflicts_within_selection_set(
                 context,
                 conflicts,
                 cached_fields_and_fragment_names,
+                compared_fields_and_fragment_pairs,
                 compared_fragment_pairs,
                 False,
                 field_map,
@@ -205,6 +210,7 @@ def find_conflicts_within_selection_set(
                     context,
                     conflicts,
                     cached_fields_and_fragment_names,
+                    compared_fields_and_fragment_pairs,
                     compared_fragment_pairs,
                     False,
                     fragment_name,
@@ -218,6 +224,7 @@ def collect_conflicts_between_fields_and_fragment(
     context: ValidationContext,
     conflicts: List[Conflict],
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     are_mutually_exclusive: bool,
     field_map: NodeAndDefCollection,
@@ -228,6 +235,16 @@ def collect_conflicts_between_fields_and_fragment(
     Collect all conflicts found between a set of fields and a fragment reference
     including via spreading in any nested fragments.
     """
+    # Memoize so the fields and fragments are not compared for conflicts more
+    # than once.
+    if compared_fields_and_fragment_pairs.has(
+        field_map, fragment_name, are_mutually_exclusive
+    ):
+        return
+    compared_fields_and_fragment_pairs.add(
+        field_map, fragment_name, are_mutually_exclusive
+    )
+
     fragment = context.get_fragment(fragment_name)
     if not fragment:
         return None
@@ -246,6 +263,7 @@ def collect_conflicts_between_fields_and_fragment(
         context,
         conflicts,
         cached_fields_and_fragment_names,
+        compared_fields_and_fragment_pairs,
         compared_fragment_pairs,
         are_mutually_exclusive,
         field_map,
@@ -255,19 +273,11 @@ def collect_conflicts_between_fields_and_fragment(
     # (E) Then collect any conflicts between the provided collection of fields and any
     # fragment names found in the given fragment.
     for referenced_fragment_name in referenced_fragment_names:
-        # Memoize so two fragments are not compared for conflicts more than once.
-        if compared_fragment_pairs.has(
-            referenced_fragment_name, fragment_name, are_mutually_exclusive
-        ):
-            continue
-        compared_fragment_pairs.add(
-            referenced_fragment_name, fragment_name, are_mutually_exclusive
-        )
-
         collect_conflicts_between_fields_and_fragment(
             context,
             conflicts,
             cached_fields_and_fragment_names,
+            compared_fields_and_fragment_pairs,
             compared_fragment_pairs,
             are_mutually_exclusive,
             field_map,
@@ -279,6 +289,7 @@ def collect_conflicts_between_fragments(
     context: ValidationContext,
     conflicts: List[Conflict],
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     are_mutually_exclusive: bool,
     fragment_name1: str,
@@ -319,6 +330,7 @@ def collect_conflicts_between_fragments(
         context,
         conflicts,
         cached_fields_and_fragment_names,
+        compared_fields_and_fragment_pairs,
         compared_fragment_pairs,
         are_mutually_exclusive,
         field_map1,
@@ -332,6 +344,7 @@ def collect_conflicts_between_fragments(
             context,
             conflicts,
             cached_fields_and_fragment_names,
+            compared_fields_and_fragment_pairs,
             compared_fragment_pairs,
             are_mutually_exclusive,
             fragment_name1,
@@ -345,6 +358,7 @@ def collect_conflicts_between_fragments(
             context,
             conflicts,
             cached_fields_and_fragment_names,
+            compared_fields_and_fragment_pairs,
             compared_fragment_pairs,
             are_mutually_exclusive,
             referenced_fragment_name1,
@@ -355,6 +369,7 @@ def collect_conflicts_between_fragments(
 def find_conflicts_between_sub_selection_sets(
     context: ValidationContext,
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     are_mutually_exclusive: bool,
     parent_type1: Optional[GraphQLNamedType],
@@ -382,6 +397,7 @@ def find_conflicts_between_sub_selection_sets(
         context,
         conflicts,
         cached_fields_and_fragment_names,
+        compared_fields_and_fragment_pairs,
         compared_fragment_pairs,
         are_mutually_exclusive,
         field_map1,
@@ -396,6 +412,7 @@ def find_conflicts_between_sub_selection_sets(
                 context,
                 conflicts,
                 cached_fields_and_fragment_names,
+                compared_fields_and_fragment_pairs,
                 compared_fragment_pairs,
                 are_mutually_exclusive,
                 field_map1,
@@ -410,6 +427,7 @@ def find_conflicts_between_sub_selection_sets(
                 context,
                 conflicts,
                 cached_fields_and_fragment_names,
+                compared_fields_and_fragment_pairs,
                 compared_fragment_pairs,
                 are_mutually_exclusive,
                 field_map2,
@@ -425,6 +443,7 @@ def find_conflicts_between_sub_selection_sets(
                 context,
                 conflicts,
                 cached_fields_and_fragment_names,
+                compared_fields_and_fragment_pairs,
                 compared_fragment_pairs,
                 are_mutually_exclusive,
                 fragment_name1,
@@ -438,6 +457,7 @@ def collect_conflicts_within(
     context: ValidationContext,
     conflicts: List[Conflict],
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     field_map: NodeAndDefCollection,
 ) -> None:
@@ -456,6 +476,7 @@ def collect_conflicts_within(
                     conflict = find_conflict(
                         context,
                         cached_fields_and_fragment_names,
+                        compared_fields_and_fragment_pairs,
                         compared_fragment_pairs,
                         # within one collection is never mutually exclusive
                         False,
@@ -471,6 +492,7 @@ def collect_conflicts_between(
     context: ValidationContext,
     conflicts: List[Conflict],
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     parent_fields_are_mutually_exclusive: bool,
     field_map1: NodeAndDefCollection,
@@ -496,6 +518,7 @@ def collect_conflicts_between(
                     conflict = find_conflict(
                         context,
                         cached_fields_and_fragment_names,
+                        compared_fields_and_fragment_pairs,
                         compared_fragment_pairs,
                         parent_fields_are_mutually_exclusive,
                         response_name,
@@ -509,6 +532,7 @@ def collect_conflicts_between(
 def find_conflict(
     context: ValidationContext,
     cached_fields_and_fragment_names: Dict,
+    compared_fields_and_fragment_pairs: "OrderedPairSet",
     compared_fragment_pairs: "PairSet",
     parent_fields_are_mutually_exclusive: bool,
     response_name: str,
@@ -570,6 +594,7 @@ def find_conflict(
         conflicts = find_conflicts_between_sub_selection_sets(
             context,
             cached_fields_and_fragment_names,
+            compared_fields_and_fragment_pairs,
             compared_fragment_pairs,
             are_mutually_exclusive,
             get_named_type(type1),
@@ -745,6 +770,43 @@ def subfield_conflicts(
     return None  # no conflict
 
 
+class OrderedPairSet:
+    """Ordered pair set
+
+    A way to keep track of pairs of things where the ordering of the pair matters.
+
+    Provides a third argument for has/add to allow flagging the pair as weakly or
+    strongly present within the collection.
+
+    The first element is matched by object identity (its ``id``), since field maps
+    are unhashable mappings that are kept alive for the duration of the validation.
+    """
+
+    __slots__ = ("_data",)
+
+    _data: Dict[int, Dict[str, bool]]
+
+    def __init__(self) -> None:
+        self._data = {}
+
+    def has(self, a: NodeAndDefCollection, b: str, weakly_present: bool) -> bool:
+        map_ = self._data.get(id(a))
+        if map_ is None:
+            return False
+        result = map_.get(b)
+        if result is None:
+            return False
+
+        return True if weakly_present else weakly_present == result
+
+    def add(self, a: NodeAndDefCollection, b: str, weakly_present: bool) -> None:
+        map_ = self._data.get(id(a))
+        if map_ is None:
+            self._data[id(a)] = {b: weakly_present}
+        else:
+            map_[b] = weakly_present
+
+
 class PairSet:
     """Pair set
 

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/validation/rules/scalar_leafs.py

@@ -39,3 +39,12 @@ class ScalarLeafsRule(ValidationRule):
                         node,
                     )
                 )
+            elif not selection_set.selections:
+                field_name = node.name.value
+                self.report_error(
+                    GraphQLError(
+                        f"Field '{field_name}' of type '{type_}'"
+                        " must have at least one field selected.",
+                        node,
+                    )
+                )

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql/version.py

@@ -4,9 +4,9 @@ from typing import NamedTuple
 __all__ = ["version", "version_info", "version_js", "version_info_js"]
 
 
-version = "3.2.8"
+version = "3.2.9"
 
-version_js = "16.9.0"
+version_js = "16.10.0"
 
 
 _re_version = re.compile(r"(\d+)\.(\d+)\.(\d+)(\D*)(\d*)")

{graphql_core-3.2.8 → graphql_core-3.2.9}/src/graphql_core.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: graphql-core
-Version: 3.2.8
+Version: 3.2.9
 Summary: GraphQL implementation for Python, a port of GraphQL.js, the JavaScript reference implementation for GraphQL.
 Home-page: https://github.com/graphql-python/graphql-core
 Author: Christoph Zwerschke
@@ -50,7 +50,7 @@ a query language for APIs created by Facebook.
 ![Lint Status](https://github.com/graphql-python/graphql-core/actions/workflows/lint.yml/badge.svg)
 [![Code Style](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/ambv/black)
 
-The current version 3.2.8 of GraphQL-core is up-to-date with GraphQL.js version 16.9.0.
+The current version 3.2.9 of GraphQL-core is up-to-date with GraphQL.js version 16.10.0.
 
 An extensive test suite with over 2500 unit tests and 100% coverage comprises a
 replication of the complete test suite of GraphQL.js, making sure this port is

{graphql_core-3.2.8 → graphql_core-3.2.9}/tests/language/test_parser.py

@@ -87,6 +87,10 @@ def describe_parser():
               |      ^
             """)
 
+    def exposes_the_token_count():
+        assert parse("{ foo }").token_count == 3
+        assert parse('{ foo(bar: "baz") }').token_count == 8
+
     def limits_maximum_number_of_tokens():
         assert parse("{ foo }", max_tokens=3)
         with raises(

{graphql_core-3.2.8 → graphql_core-3.2.9}/tests/type/test_introspection.py

@@ -22,7 +22,7 @@ def describe_introspection():
         assert result.errors is None
         assert result.data == {
             "__schema": {
-                "queryType": {"name": "SomeObject"},
+                "queryType": {"name": "SomeObject", "kind": "OBJECT"},
                 "mutationType": None,
                 "subscriptionType": None,
                 "types": [

{graphql_core-3.2.8 → graphql_core-3.2.9}/tests/utilities/test_build_client_schema.py

@@ -687,7 +687,7 @@ def describe_type_system_build_schema_from_introspection():
             with raises(TypeError) as exc_info:
                 build_client_schema(introspection)
 
-            assert str(exc_info.value) == "Unknown type reference: {}."
+            assert str(exc_info.value) == "Unknown type reference: {'kind': 'OBJECT'}."
 
         def throws_when_missing_kind():
             introspection = introspection_from_schema(dummy_schema)