@apollo/query-planner - npm Package Compare versions

Comparing version 2.7.1 to 2.7.2

dist/config.d.ts

@@ -10,2 +10,3 @@ import { Concrete } from "@apollo/federation-internals";
     reuseQueryFragments?: boolean;
+    generateQueryFragments?: boolean;
     incrementalDelivery?: {
@@ -12,0 +13,0 @@ enableDefer?: boolean;

dist/config.js

@@ -9,2 +9,3 @@ "use strict";
         reuseQueryFragments: true,
+        generateQueryFragments: false,
         cache: new utils_keyvaluecache_1.InMemoryLRUCache({ maxSize: Math.pow(2, 20) * 50 }),
@@ -11,0 +12,0 @@ ...config,

package.json

 {
   "name": "@apollo/query-planner",
-  "version": "2.7.1",
+  "version": "2.7.2",
   "description": "Apollo Query Planner",
@@ -28,4 +28,4 @@ "author": "Apollo <[e-mail]>",
   "dependencies": {
-    "@apollo/federation-internals": "2.7.1",
-    "@apollo/query-graphs": "2.7.1",
+    "@apollo/federation-internals": "2.7.2",
+    "@apollo/query-graphs": "2.7.2",
     "@apollo/utils.keyvaluecache": "^2.1.0",
@@ -32,0 +32,0 @@ "chalk": "^4.1.0",

src/config.ts

@@ -37,2 +37,10 @@ import { Concrete } from "@apollo/federation-internals";
 
+  /**
+   * If enabled, the query planner will extract inline fragments into fragment
+   * definitions before sending queries to subgraphs. This can significantly
+   * reduce the size of the query sent to subgraphs, but may increase the time
+   * it takes to plan the query.
+   */
+  generateQueryFragments?: boolean,
+
   // Side-note: implemented as an object instead of single boolean because we expect to add more to this soon
@@ -64,3 +72,3 @@ // enough. In particular, once defer-passthrough to subgraphs is implemented, the idea would be to add a
      * If used and the supergraph is built from a single subgraph, then user queries do not go through the
-     * normal query planning and instead a fetch to the one subgraph is built directly from the input query. 
+     * normal query planning and instead a fetch to the one subgraph is built directly from the input query.
      */
@@ -73,3 +81,3 @@ bypassPlannerForSingleSubgraph?: boolean,
      * for a given query, and at a high level, the query planner generates those possible choices,
-     * evaluate them, and return the best one. In some complex cases however, the number of 
+     * evaluate them, and return the best one. In some complex cases however, the number of
      * theoretically possible plans can be very large, and to keep query planning time acceptable,
@@ -98,3 +106,3 @@ * the query planner cap the maximum number of plans it evaluates. This config allows to configure
      * planning.
-     * 
+     *
      * This config allows specifying a per-path limit to the number of options considered. If any
@@ -115,2 +123,3 @@ * path's options exceeds this limit, query planning will abort and the operation will fail.
     reuseQueryFragments: true,
+    generateQueryFragments: false,
     cache: new InMemoryLRUCache<QueryPlan>({maxSize: Math.pow(2, 20) * 50 }),
@@ -117,0 +126,0 @@ ...config,

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

587639

increased by0.4%

Lines of code

9365

increased by0.45%

Dependency changes

• + Added@apollo/federation-internals@2.7.2(transitive)

• + Added@apollo/query-graphs@2.7.2(transitive)

• - Removed@apollo/federation-internals@2.7.1(transitive)

• - Removed@apollo/query-graphs@2.7.1(transitive)

• Updated@apollo/federation-internals@2.7.2

• Updated@apollo/query-graphs@2.7.2