@comunica/actor-optimize-query-operation-filter-pushdown 3.2.0 → 3.2.2

package/README.md

@@ -34,3 +34,12 @@ After installing, this package can be added to your engine's configuration as fo
   ]
 }
 ```
+
+### Config Parameters
+
+* `aggressivePushdown`: If filters should be pushed down as deep as possible. If false, filters will only be pushed down if the source(s) accept them, or if the filter is very selective. _(defaults to `false`)_
+* `maxIterations`: The maximum number of full iterations across the query can be done for attempting to push down filters. _(defaults to `10`)_
+* `splitConjunctive`: If conjunctive filters should be split into nested filters before applying filter pushdown. This can enable pushing down deeper. _(defaults to `true`)_
+* `mergeConjunctive`: If nested filters should be merged into conjunctive filters after applying filter pushdown. _(defaults to `true`)_
+* `pushIntoLeftJoins`: If filters should be pushed into left-joins. _(defaults to `false`)_
+* `pushEqualityIntoPatterns`: If simple equality filters should be pushed into patterns and paths. This only applies to equality filters with terms that are not literals that have no canonical lexical form. _(defaults to `true`)_

package/components/ActorOptimizeQueryOperationFilterPushdown.jsonld

@@ -15,6 +15,42 @@
       ],
       "comment": "A comunica Filter Pushdown Optimize Query Operation Actor.",
       "parameters": [
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_aggressivePushdown",
+          "range": "xsd:boolean",
+          "default": "false",
+          "comment": "If filters should be pushed down as deep as possible. If false, filters will only be pushed down if the source(s) accept them, or if the filter is very selective."
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_maxIterations",
+          "range": "xsd:number",
+          "default": "10",
+          "comment": "The maximum number of full iterations across the query can be done for attempting to push down filters."
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_splitConjunctive",
+          "range": "xsd:boolean",
+          "default": "true",
+          "comment": "If conjunctive filters should be split into nested filters before applying filter pushdown. This can enable pushing down deeper."
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_mergeConjunctive",
+          "range": "xsd:boolean",
+          "default": "true",
+          "comment": "If nested filters should be merged into conjunctive filters after applying filter pushdown."
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushIntoLeftJoins",
+          "range": "xsd:boolean",
+          "default": "true",
+          "comment": "If filters should be pushed into left-joins."
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushEqualityIntoPatterns",
+          "range": "xsd:boolean",
+          "default": "true",
+          "comment": "If simple equality filters should be pushed into patterns and paths. This only applies to equality filters with terms that are not literals that have no canonical lexical form."
+        },
         {
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_name",
           "range": "xsd:string",
@@ -102,6 +138,30 @@
         }
       ],
       "memberFields": [
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_aggressivePushdown",
+          "memberFieldName": "aggressivePushdown"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_maxIterations",
+          "memberFieldName": "maxIterations"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_splitConjunctive",
+          "memberFieldName": "splitConjunctive"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_mergeConjunctive",
+          "memberFieldName": "mergeConjunctive"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_pushIntoLeftJoins",
+          "memberFieldName": "pushIntoLeftJoins"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_pushEqualityIntoPatterns",
+          "memberFieldName": "pushEqualityIntoPatterns"
+        },
         {
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_constructor",
           "memberFieldName": "constructor"
@@ -114,6 +174,14 @@
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_run",
           "memberFieldName": "run"
         },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_shouldAttemptPushDown",
+          "memberFieldName": "shouldAttemptPushDown"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_getSources",
+          "memberFieldName": "getSources"
+        },
         {
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_getExpressionVariables",
           "memberFieldName": "getExpressionVariables"
@@ -126,6 +194,14 @@
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_filterPushdown",
           "memberFieldName": "filterPushdown"
         },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_getEqualityExpressionPushableIntoPattern",
+          "memberFieldName": "getEqualityExpressionPushableIntoPattern"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_isLiteralWithCanonicalLexicalForm",
+          "memberFieldName": "isLiteralWithCanonicalLexicalForm"
+        },
         {
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_variablesIntersect",
           "memberFieldName": "variablesIntersect"
@@ -133,12 +209,56 @@
         {
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_variablesSubSetOf",
           "memberFieldName": "variablesSubSetOf"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_isExpressionFalse",
+          "memberFieldName": "isExpressionFalse"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown__member_getNestedFilterExpressions",
+          "memberFieldName": "getNestedFilterExpressions"
         }
       ],
       "constructorArguments": [
         {
           "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args__constructorArgument",
           "fields": [
+            {
+              "keyRaw": "aggressivePushdown",
+              "value": {
+                "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_aggressivePushdown"
+              }
+            },
+            {
+              "keyRaw": "maxIterations",
+              "value": {
+                "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_maxIterations"
+              }
+            },
+            {
+              "keyRaw": "splitConjunctive",
+              "value": {
+                "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_splitConjunctive"
+              }
+            },
+            {
+              "keyRaw": "mergeConjunctive",
+              "value": {
+                "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_mergeConjunctive"
+              }
+            },
+            {
+              "keyRaw": "pushIntoLeftJoins",
+              "value": {
+                "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushIntoLeftJoins"
+              }
+            },
+            {
+              "keyRaw": "pushEqualityIntoPatterns",
+              "value": {
+                "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushEqualityIntoPatterns"
+              }
+            },
             {
               "keyRaw": "name",
               "value": {
@@ -160,6 +280,39 @@
           ]
         }
       ]
+    },
+    {
+      "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs",
+      "@type": "AbstractClass",
+      "requireElement": "IActorOptimizeQueryOperationFilterPushdownArgs",
+      "parameters": [],
+      "memberFields": [
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs__member_aggressivePushdown",
+          "memberFieldName": "aggressivePushdown"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs__member_maxIterations",
+          "memberFieldName": "maxIterations"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs__member_splitConjunctive",
+          "memberFieldName": "splitConjunctive"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs__member_mergeConjunctive",
+          "memberFieldName": "mergeConjunctive"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs__member_pushIntoLeftJoins",
+          "memberFieldName": "pushIntoLeftJoins"
+        },
+        {
+          "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs__member_pushEqualityIntoPatterns",
+          "memberFieldName": "pushEqualityIntoPatterns"
+        }
+      ],
+      "constructorArguments": []
     }
   ]
 }

package/components/context.jsonld

@@ -8,6 +8,24 @@
         "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown",
         "@prefix": true,
         "@context": {
+          "args_aggressivePushdown": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_aggressivePushdown"
+          },
+          "args_maxIterations": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_maxIterations"
+          },
+          "args_splitConjunctive": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_splitConjunctive"
+          },
+          "args_mergeConjunctive": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_mergeConjunctive"
+          },
+          "args_pushIntoLeftJoins": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushIntoLeftJoins"
+          },
+          "args_pushEqualityIntoPatterns": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushEqualityIntoPatterns"
+          },
           "args_name": {
             "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_name"
           },
@@ -18,6 +36,24 @@
             "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_beforeActors",
             "@container": "@list"
           },
+          "aggressivePushdown": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_aggressivePushdown"
+          },
+          "maxIterations": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_maxIterations"
+          },
+          "splitConjunctive": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_splitConjunctive"
+          },
+          "mergeConjunctive": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_mergeConjunctive"
+          },
+          "pushIntoLeftJoins": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushIntoLeftJoins"
+          },
+          "pushEqualityIntoPatterns": {
+            "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_pushEqualityIntoPatterns"
+          },
           "name": {
             "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#ActorOptimizeQueryOperationFilterPushdown_args_name"
           },
@@ -29,6 +65,11 @@
             "@container": "@list"
           }
         }
+      },
+      "IActorOptimizeQueryOperationFilterPushdownArgs": {
+        "@id": "caoqofp:components/ActorOptimizeQueryOperationFilterPushdown.jsonld#IActorOptimizeQueryOperationFilterPushdownArgs",
+        "@prefix": true,
+        "@context": {}
       }
     }
   ]

package/lib/ActorOptimizeQueryOperationFilterPushdown.d.ts

@@ -1,7 +1,7 @@
-import type { IActionOptimizeQueryOperation, IActorOptimizeQueryOperationOutput, IActorOptimizeQueryOperationArgs } from '@comunica/bus-optimize-query-operation';
+import type { IActionOptimizeQueryOperation, IActorOptimizeQueryOperationArgs, IActorOptimizeQueryOperationOutput } from '@comunica/bus-optimize-query-operation';
 import { ActorOptimizeQueryOperation } from '@comunica/bus-optimize-query-operation';
 import type { IActorTest } from '@comunica/core';
-import type { IActionContext } from '@comunica/types';
+import type { FragmentSelectorShape, IActionContext, IQuerySourceWrapper } from '@comunica/types';
 import type * as RDF from '@rdfjs/types';
 import type { Factory } from 'sparqlalgebrajs';
 import { Algebra } from 'sparqlalgebrajs';
@@ -9,9 +9,30 @@ import { Algebra } from 'sparqlalgebrajs';
  * A comunica Filter Pushdown Optimize Query Operation Actor.
  */
 export declare class ActorOptimizeQueryOperationFilterPushdown extends ActorOptimizeQueryOperation {
-    constructor(args: IActorOptimizeQueryOperationArgs);
+    private readonly aggressivePushdown;
+    private readonly maxIterations;
+    private readonly splitConjunctive;
+    private readonly mergeConjunctive;
+    private readonly pushIntoLeftJoins;
+    private readonly pushEqualityIntoPatterns;
+    constructor(args: IActorOptimizeQueryOperationFilterPushdownArgs);
     test(_action: IActionOptimizeQueryOperation): Promise<IActorTest>;
     run(action: IActionOptimizeQueryOperation): Promise<IActorOptimizeQueryOperationOutput>;
+    /**
+     * Check if the given filter operation must be attempted to push down, based on the following criteria:
+     * - Always push down if aggressive mode is enabled
+     * - Push down if the filter is extremely selective
+     * - Push down if federated and at least one accepts the filter
+     * @param operation The filter operation
+     * @param sources The query sources in the operation
+     * @param sourceShapes A mapping of sources to selector shapes.
+     */
+    shouldAttemptPushDown(operation: Algebra.Filter, sources: IQuerySourceWrapper[], sourceShapes: Map<IQuerySourceWrapper, FragmentSelectorShape>): boolean;
+    /**
+     * Collected all sources that are defined within the given operation of children recursively.
+     * @param operation An operation.
+     */
+    getSources(operation: Algebra.Operation): IQuerySourceWrapper[];
     /**
      * Get all variables inside the given expression.
      * @param expression An expression.
@@ -34,9 +55,28 @@ export declare class ActorOptimizeQueryOperationFilterPushdown extends ActorOpti
      * @param operation The operation to push down into.
      * @param factory An algebra factory.
      * @param context The action context.
-     * @return The modified operation.
+     * @return A tuple indicating if the operation was modified and the modified operation.
+     */
+    filterPushdown(expression: Algebra.Expression, expressionVariables: RDF.Variable[], operation: Algebra.Operation, factory: Factory, context: IActionContext): [boolean, Algebra.Operation];
+    /**
+     * Check if the given expression is a simple equals operation with one variable and one non-literal
+     * (or literal with canonical lexical form) term that can be pushed into a pattern.
+     * @param expression The current expression.
+     * @return The variable and term to fill into the pattern, or undefined.
+     */
+    getEqualityExpressionPushableIntoPattern(expression: Algebra.Expression): {
+        variable: RDF.Variable;
+        term: RDF.Term;
+    } | undefined;
+    /**
+     * Check if the given term is a literal with datatype that where all values
+     * can only have one possible lexical representation.
+     * In other words, no variants of values exist that should be considered equal.
+     * For example: "01"^xsd:number and "1"^xsd:number will return false.
+     * @param term An RDF term.
+     * @protected
      */
-    filterPushdown(expression: Algebra.Expression, expressionVariables: RDF.Variable[], operation: Algebra.Operation, factory: Factory, context: IActionContext): Algebra.Operation;
+    protected isLiteralWithCanonicalLexicalForm(term: RDF.Term): boolean;
     /**
      * Check if there is an overlap between the two given lists of variables.
      * @param varsA A list of variables.
@@ -50,4 +90,59 @@ export declare class ActorOptimizeQueryOperationFilterPushdown extends ActorOpti
      * @param varsHaystack A list of variables to search in.
      */
     variablesSubSetOf(varsNeedles: RDF.Variable[], varsHaystack: RDF.Variable[]): boolean;
+    /**
+     * Check if an expression is simply 'false'.
+     * @param expression An expression.
+     */
+    isExpressionFalse(expression: Algebra.Expression): boolean;
+    /**
+     * Get all directly nested filter expressions.
+     * As soon as a non-filter is found, it is returned as the input field.
+     * @param op A filter expression.
+     */
+    getNestedFilterExpressions(op: Algebra.Filter): {
+        nestedExpressions: Algebra.Expression[];
+        input: Algebra.Operation;
+    };
+}
+export interface IActorOptimizeQueryOperationFilterPushdownArgs extends IActorOptimizeQueryOperationArgs {
+    /**
+     * If filters should be pushed down as deep as possible.
+     * If false, filters will only be pushed down if the source(s) accept them,
+     * or if the filter is very selective.
+     * @range {boolean}
+     * @default {false}
+     */
+    aggressivePushdown: boolean;
+    /**
+     * The maximum number of full iterations across the query can be done for attempting to push down filters.
+     * @default {10}
+     */
+    maxIterations: number;
+    /**
+     * If conjunctive filters should be split into nested filters before applying filter pushdown.
+     * This can enable pushing down deeper.
+     * @range {boolean}
+     * @default {true}
+     */
+    splitConjunctive: boolean;
+    /**
+     * If nested filters should be merged into conjunctive filters after applying filter pushdown.
+     * @range {boolean}
+     * @default {true}
+     */
+    mergeConjunctive: boolean;
+    /**
+     * If filters should be pushed into left-joins.
+     * @range {boolean}
+     * @default {true}
+     */
+    pushIntoLeftJoins: boolean;
+    /**
+     * If simple equality filters should be pushed into patterns and paths.
+     * This only applies to equality filters with terms that are not literals that have no canonical lexical form.
+     * @range {boolean}
+     * @default {true}
+     */
+    pushEqualityIntoPatterns: boolean;
 }

package/lib/ActorOptimizeQueryOperationFilterPushdown.js

@@ -2,6 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ActorOptimizeQueryOperationFilterPushdown = void 0;
 const bus_optimize_query_operation_1 = require("@comunica/bus-optimize-query-operation");
+const bus_query_operation_1 = require("@comunica/bus-query-operation");
 const rdf_terms_1 = require("rdf-terms");
 const sparqlalgebrajs_1 = require("sparqlalgebrajs");
 /**
@@ -15,21 +16,141 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
         return true;
     }
     async run(action) {
+        let operation = action.operation;
         // eslint-disable-next-line ts/no-this-alias
         const self = this;
-        const operation = sparqlalgebrajs_1.Util.mapOperation(action.operation, {
-            filter(op, factory) {
-                // For all filter expressions in the operation,
-                // we attempt to push them down as deep as possible into the algebra.
-                const variables = self.getExpressionVariables(op.expression);
-                return {
-                    recurse: true,
-                    result: self.filterPushdown(op.expression, variables, op.input, factory, action.context),
-                };
-            },
-        });
+        // Split conjunctive filters into nested filters
+        if (this.splitConjunctive) {
+            operation = sparqlalgebrajs_1.Util.mapOperation(operation, {
+                filter(op, factory) {
+                    // Split conjunctive filters into separate filters
+                    if (op.expression.expressionType === sparqlalgebrajs_1.Algebra.expressionTypes.OPERATOR && op.expression.operator === '&&') {
+                        self.logDebug(action.context, `Split conjunctive filter into ${op.expression.args.length} nested filters`);
+                        return {
+                            recurse: true,
+                            result: op.expression.args
+                                .reduce((operation, expression) => factory.createFilter(operation, expression), op.input),
+                        };
+                    }
+                    return {
+                        recurse: true,
+                        result: op,
+                    };
+                },
+            });
+        }
+        // Collect selector shapes of all operations
+        const sources = this.getSources(operation);
+        // eslint-disable-next-line ts/no-unnecessary-type-assertion
+        const sourceShapes = new Map(await Promise.all(sources
+            .map(async (source) => [source, await source.source.getSelectorShape(action.context)])));
+        // Push down all filters
+        // We loop until no more filters can be pushed down.
+        let repeat = true;
+        let iterations = 0;
+        while (repeat && iterations < this.maxIterations) {
+            repeat = false;
+            operation = sparqlalgebrajs_1.Util.mapOperation(operation, {
+                filter(op, factory) {
+                    // Check if the filter must be pushed down
+                    if (!self.shouldAttemptPushDown(op, sources, sourceShapes)) {
+                        return {
+                            recurse: true,
+                            result: op,
+                        };
+                    }
+                    // For all filter expressions in the operation,
+                    // we attempt to push them down as deep as possible into the algebra.
+                    const variables = self.getExpressionVariables(op.expression);
+                    const [isModified, result] = self
+                        .filterPushdown(op.expression, variables, op.input, factory, action.context);
+                    if (isModified) {
+                        repeat = true;
+                    }
+                    return {
+                        recurse: true,
+                        result,
+                    };
+                },
+            });
+            iterations++;
+        }
+        if (iterations > 1) {
+            self.logDebug(action.context, `Pushed down filters in ${iterations} iterations`);
+        }
+        // Merge nested filters into conjunctive filters
+        if (this.mergeConjunctive) {
+            operation = sparqlalgebrajs_1.Util.mapOperation(operation, {
+                filter(op, factory) {
+                    if (op.input.type === sparqlalgebrajs_1.Algebra.types.FILTER) {
+                        const { nestedExpressions, input } = self.getNestedFilterExpressions(op);
+                        self.logDebug(action.context, `Merge ${nestedExpressions.length} nested filters into conjunctive filter`);
+                        return {
+                            recurse: true,
+                            result: factory.createFilter(input, nestedExpressions.slice(1).reduce((previous, current) => factory.createOperatorExpression('&&', [previous, current]), nestedExpressions[0])),
+                        };
+                    }
+                    return {
+                        recurse: true,
+                        result: op,
+                    };
+                },
+            });
+        }
         return { operation, context: action.context };
     }
+    /**
+     * Check if the given filter operation must be attempted to push down, based on the following criteria:
+     * - Always push down if aggressive mode is enabled
+     * - Push down if the filter is extremely selective
+     * - Push down if federated and at least one accepts the filter
+     * @param operation The filter operation
+     * @param sources The query sources in the operation
+     * @param sourceShapes A mapping of sources to selector shapes.
+     */
+    shouldAttemptPushDown(operation, sources, sourceShapes) {
+        // Always push down if aggressive mode is enabled
+        if (this.aggressivePushdown) {
+            return true;
+        }
+        // Push down if the filter is extremely selective
+        const expression = operation.expression;
+        if (expression.expressionType === sparqlalgebrajs_1.Algebra.expressionTypes.OPERATOR &&
+            expression.operator === '=' &&
+            ((expression.args[0].expressionType === 'term' && expression.args[0].term.termType !== 'Variable' &&
+                expression.args[1].expressionType === 'term' && expression.args[1].term.termType === 'Variable') ||
+                (expression.args[0].expressionType === 'term' && expression.args[0].term.termType === 'Variable' &&
+                    expression.args[1].expressionType === 'term' && expression.args[1].term.termType !== 'Variable'))) {
+            return true;
+        }
+        // Push down if federated and at least one accepts the filter
+        if (sources.some(source => bus_query_operation_1.ActorQueryOperation.doesShapeAcceptOperation(sourceShapes.get(source), operation))) {
+            return true;
+        }
+        // Don't push down in all other cases
+        return false;
+    }
+    /**
+     * Collected all sources that are defined within the given operation of children recursively.
+     * @param operation An operation.
+     */
+    getSources(operation) {
+        const sources = new Set();
+        const sourceAdder = (subOperation) => {
+            const src = bus_query_operation_1.ActorQueryOperation.getOperationSource(subOperation);
+            if (src) {
+                sources.add(src);
+            }
+            return false;
+        };
+        sparqlalgebrajs_1.Util.recurseOperation(operation, {
+            [sparqlalgebrajs_1.Algebra.types.PATTERN]: sourceAdder,
+            [sparqlalgebrajs_1.Algebra.types.LINK]: sourceAdder,
+            [sparqlalgebrajs_1.Algebra.types.NPS]: sourceAdder,
+            [sparqlalgebrajs_1.Algebra.types.SERVICE]: sourceAdder,
+        });
+        return [...sources];
+    }
     /**
      * Get all variables inside the given expression.
      * @param expression An expression.
@@ -86,31 +207,44 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
      * @param operation The operation to push down into.
      * @param factory An algebra factory.
      * @param context The action context.
-     * @return The modified operation.
+     * @return A tuple indicating if the operation was modified and the modified operation.
      */
     filterPushdown(expression, expressionVariables, operation, factory, context) {
+        // Void false expressions
+        if (this.isExpressionFalse(expression)) {
+            return [true, factory.createUnion([])];
+        }
+        // Don't push down (NOT) EXISTS
+        if (expression.type === sparqlalgebrajs_1.Algebra.types.EXPRESSION &&
+            expression.expressionType === sparqlalgebrajs_1.Algebra.expressionTypes.EXISTENCE) {
+            return [false, factory.createFilter(operation, expression)];
+        }
         switch (operation.type) {
             case sparqlalgebrajs_1.Algebra.types.EXTEND:
                 // Pass if the variable is not part of the expression
                 if (!this.variablesIntersect([operation.variable], expressionVariables)) {
-                    return factory.createExtend(this.filterPushdown(expression, expressionVariables, operation.input, factory, context), operation.variable, operation.expression);
+                    return [true, factory.createExtend(this.filterPushdown(expression, expressionVariables, operation.input, factory, context)[1], operation.variable, operation.expression)];
                 }
-                return factory.createFilter(operation, expression);
-            case sparqlalgebrajs_1.Algebra.types.FILTER:
+                return [false, factory.createFilter(operation, expression)];
+            case sparqlalgebrajs_1.Algebra.types.FILTER: {
                 // Always pass
-                return factory.createFilter(this.filterPushdown(expression, expressionVariables, operation.input, factory, context), operation.expression);
+                const [isModified, result] = this
+                    .filterPushdown(expression, expressionVariables, operation.input, factory, context);
+                return [isModified, factory.createFilter(result, operation.expression)];
+            }
             case sparqlalgebrajs_1.Algebra.types.JOIN: {
                 // Don't push down for empty join
                 if (operation.input.length === 0) {
-                    return factory.createFilter(operation, expression);
+                    return [false, factory.createFilter(operation, expression)];
                 }
                 // Determine overlapping operations
                 const { fullyOverlapping, partiallyOverlapping, notOverlapping, } = this.getOverlappingOperations(operation, expressionVariables);
                 const joins = [];
-                this.logDebug(context, `Push down filter across join entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);
+                let isModified = false;
                 if (fullyOverlapping.length > 0) {
+                    isModified = true;
                     joins.push(factory.createJoin(fullyOverlapping
-                        .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context))));
+                        .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context)[1])));
                 }
                 if (partiallyOverlapping.length > 0) {
                     joins.push(factory.createFilter(factory.createJoin(partiallyOverlapping, false), expression));
@@ -118,25 +252,32 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
                 if (notOverlapping.length > 0) {
                     joins.push(...notOverlapping);
                 }
-                return joins.length === 1 ? joins[0] : factory.createJoin(joins);
+                if (joins.length > 1) {
+                    isModified = true;
+                }
+                if (isModified) {
+                    this.logDebug(context, `Push down filter across join entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);
+                }
+                return [isModified, joins.length === 1 ? joins[0] : factory.createJoin(joins)];
             }
             case sparqlalgebrajs_1.Algebra.types.NOP:
-                return operation;
+                return [true, operation];
             case sparqlalgebrajs_1.Algebra.types.PROJECT:
                 // Push down if variables overlap
                 if (this.variablesIntersect(operation.variables, expressionVariables)) {
-                    return factory.createProject(this.filterPushdown(expression, expressionVariables, operation.input, factory, context), operation.variables);
+                    return [true, factory.createProject(this.filterPushdown(expression, expressionVariables, operation.input, factory, context)[1], operation.variables)];
                 }
                 // Void expression otherwise
-                return operation;
+                return [true, operation];
             case sparqlalgebrajs_1.Algebra.types.UNION: {
                 // Determine overlapping operations
                 const { fullyOverlapping, partiallyOverlapping, notOverlapping, } = this.getOverlappingOperations(operation, expressionVariables);
                 const unions = [];
-                this.logDebug(context, `Push down filter across union entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);
+                let isModified = false;
                 if (fullyOverlapping.length > 0) {
+                    isModified = true;
                     unions.push(factory.createUnion(fullyOverlapping
-                        .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context))));
+                        .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context)[1])));
                 }
                 if (partiallyOverlapping.length > 0) {
                     unions.push(factory.createFilter(factory.createUnion(partiallyOverlapping, false), expression));
@@ -144,15 +285,73 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
                 if (notOverlapping.length > 0) {
                     unions.push(...notOverlapping);
                 }
-                return unions.length === 1 ? unions[0] : factory.createUnion(unions);
+                if (unions.length > 1) {
+                    isModified = true;
+                }
+                if (isModified) {
+                    this.logDebug(context, `Push down filter across union entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);
+                }
+                return [isModified, unions.length === 1 ? unions[0] : factory.createUnion(unions)];
             }
             case sparqlalgebrajs_1.Algebra.types.VALUES:
                 // Only keep filter if it overlaps with the variables
                 if (this.variablesIntersect(operation.variables, expressionVariables)) {
-                    return factory.createFilter(operation, expression);
+                    return [false, factory.createFilter(operation, expression)];
+                }
+                return [true, operation];
+            case sparqlalgebrajs_1.Algebra.types.LEFT_JOIN: {
+                if (this.pushIntoLeftJoins) {
+                    const rightVariables = sparqlalgebrajs_1.Util.inScopeVariables(operation.input[1]);
+                    if (!this.variablesIntersect(expressionVariables, rightVariables)) {
+                        // If filter *only* applies to left entry of optional, push it down into that.
+                        this.logDebug(context, `Push down filter into left join`);
+                        return [true, factory.createLeftJoin(this.filterPushdown(expression, expressionVariables, operation.input[0], factory, context)[1], operation.input[1], operation.expression)];
+                    }
                 }
-                return operation;
-            case sparqlalgebrajs_1.Algebra.types.LEFT_JOIN:
+                // Don't push down in all other cases
+                return [false, factory.createFilter(operation, expression)];
+            }
+            case sparqlalgebrajs_1.Algebra.types.PATTERN: {
+                if (this.pushEqualityIntoPatterns) {
+                    // Try to push simple FILTER(?s = <iri>) expressions into the pattern
+                    const pushableResult = this.getEqualityExpressionPushableIntoPattern(expression);
+                    if (pushableResult) {
+                        let isModified = false;
+                        const originalMetadata = operation.metadata;
+                        operation = (0, rdf_terms_1.mapTermsNested)(operation, (value) => {
+                            if (value.equals(pushableResult.variable)) {
+                                isModified = true;
+                                return pushableResult.term;
+                            }
+                            return value;
+                        });
+                        operation.type = sparqlalgebrajs_1.Algebra.types.PATTERN;
+                        operation.metadata = originalMetadata;
+                        if (isModified) {
+                            this.logDebug(context, `Push down filter into pattern for ?${pushableResult.variable.value}`);
+                            return [true, operation];
+                        }
+                    }
+                }
+                // Don't push down in all other cases
+                return [false, factory.createFilter(operation, expression)];
+            }
+            case sparqlalgebrajs_1.Algebra.types.PATH: {
+                if (this.pushEqualityIntoPatterns) {
+                    // Try to push simple FILTER(?s = <iri>) expressions into the path
+                    const pushableResult = this.getEqualityExpressionPushableIntoPattern(expression);
+                    if (pushableResult &&
+                        (operation.subject.equals(pushableResult.variable) || operation.object.equals(pushableResult.variable))) {
+                        this.logDebug(context, `Push down filter into path for ?${pushableResult.variable.value}`);
+                        const originalMetadata = operation.metadata;
+                        operation = factory.createPath(operation.subject.equals(pushableResult.variable) ? pushableResult.term : operation.subject, operation.predicate, operation.object.equals(pushableResult.variable) ? pushableResult.term : operation.object);
+                        operation.metadata = originalMetadata;
+                        return [true, operation];
+                    }
+                }
+                // Don't push down in all other cases
+                return [false, factory.createFilter(operation, expression)];
+            }
             case sparqlalgebrajs_1.Algebra.types.MINUS:
             case sparqlalgebrajs_1.Algebra.types.ALT:
             case sparqlalgebrajs_1.Algebra.types.ASK:
@@ -169,12 +368,10 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
             case sparqlalgebrajs_1.Algebra.types.NPS:
             case sparqlalgebrajs_1.Algebra.types.ONE_OR_MORE_PATH:
             case sparqlalgebrajs_1.Algebra.types.ORDER_BY:
-            case sparqlalgebrajs_1.Algebra.types.PATTERN:
             case sparqlalgebrajs_1.Algebra.types.REDUCED:
             case sparqlalgebrajs_1.Algebra.types.SEQ:
             case sparqlalgebrajs_1.Algebra.types.SERVICE:
             case sparqlalgebrajs_1.Algebra.types.SLICE:
-            case sparqlalgebrajs_1.Algebra.types.PATH:
             case sparqlalgebrajs_1.Algebra.types.ZERO_OR_MORE_PATH:
             case sparqlalgebrajs_1.Algebra.types.ZERO_OR_ONE_PATH:
             case sparqlalgebrajs_1.Algebra.types.COMPOSITE_UPDATE:
@@ -188,9 +385,64 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
             case sparqlalgebrajs_1.Algebra.types.COPY:
                 // Operations that do not support pushing down
                 // Left-join and minus might be possible to support in the future.
-                return factory.createFilter(operation, expression);
+                return [false, factory.createFilter(operation, expression)];
+        }
+    }
+    /**
+     * Check if the given expression is a simple equals operation with one variable and one non-literal
+     * (or literal with canonical lexical form) term that can be pushed into a pattern.
+     * @param expression The current expression.
+     * @return The variable and term to fill into the pattern, or undefined.
+     */
+    getEqualityExpressionPushableIntoPattern(expression) {
+        if (expression.expressionType === sparqlalgebrajs_1.Algebra.expressionTypes.OPERATOR && expression.operator === '=') {
+            if (expression.args[0].expressionType === 'term' && expression.args[0].term.termType !== 'Variable' &&
+                (expression.args[0].term.termType !== 'Literal' ||
+                    this.isLiteralWithCanonicalLexicalForm(expression.args[0].term)) &&
+                expression.args[1].expressionType === 'term' && expression.args[1].term.termType === 'Variable') {
+                return {
+                    variable: expression.args[1].term,
+                    term: expression.args[0].term,
+                };
+            }
+            if (expression.args[0].expressionType === 'term' && expression.args[0].term.termType === 'Variable' &&
+                expression.args[1].expressionType === 'term' && expression.args[1].term.termType !== 'Variable' &&
+                (expression.args[1].term.termType !== 'Literal' ||
+                    this.isLiteralWithCanonicalLexicalForm(expression.args[1].term))) {
+                return {
+                    variable: expression.args[0].term,
+                    term: expression.args[1].term,
+                };
+            }
         }
     }
+    /**
+     * Check if the given term is a literal with datatype that where all values
+     * can only have one possible lexical representation.
+     * In other words, no variants of values exist that should be considered equal.
+     * For example: "01"^xsd:number and "1"^xsd:number will return false.
+     * @param term An RDF term.
+     * @protected
+     */
+    isLiteralWithCanonicalLexicalForm(term) {
+        if (term.termType === 'Literal') {
+            switch (term.datatype.value) {
+                case 'http://www.w3.org/2001/XMLSchema#string':
+                case 'http://www.w3.org/1999/02/22-rdf-syntax-ns#langString':
+                case 'http://www.w3.org/2001/XMLSchema#normalizedString':
+                case 'http://www.w3.org/2001/XMLSchema#anyURI':
+                case 'http://www.w3.org/2001/XMLSchema#base64Binary':
+                case 'http://www.w3.org/2001/XMLSchema#language':
+                case 'http://www.w3.org/2001/XMLSchema#Name':
+                case 'http://www.w3.org/2001/XMLSchema#NCName':
+                case 'http://www.w3.org/2001/XMLSchema#NMTOKEN':
+                case 'http://www.w3.org/2001/XMLSchema#token':
+                case 'http://www.w3.org/2001/XMLSchema#hexBinary':
+                    return true;
+            }
+        }
+        return false;
+    }
     /**
      * Check if there is an overlap between the two given lists of variables.
      * @param varsA A list of variables.
@@ -209,6 +461,25 @@ class ActorOptimizeQueryOperationFilterPushdown extends bus_optimize_query_opera
         return varsNeedles.length <= varsHaystack.length &&
             varsNeedles.every(varA => varsHaystack.some(varB => varA.equals(varB)));
     }
+    /**
+     * Check if an expression is simply 'false'.
+     * @param expression An expression.
+     */
+    isExpressionFalse(expression) {
+        return (expression.term && expression.term.termType === 'Literal' && expression.term.value === 'false');
+    }
+    /**
+     * Get all directly nested filter expressions.
+     * As soon as a non-filter is found, it is returned as the input field.
+     * @param op A filter expression.
+     */
+    getNestedFilterExpressions(op) {
+        if (op.input.type === sparqlalgebrajs_1.Algebra.types.FILTER) {
+            const childData = this.getNestedFilterExpressions(op.input);
+            return { nestedExpressions: [op.expression, ...childData.nestedExpressions], input: childData.input };
+        }
+        return { nestedExpressions: [op.expression], input: op.input };
+    }
 }
 exports.ActorOptimizeQueryOperationFilterPushdown = ActorOptimizeQueryOperationFilterPushdown;
 //# sourceMappingURL=ActorOptimizeQueryOperationFilterPushdown.js.map

package/lib/ActorOptimizeQueryOperationFilterPushdown.js.map

@@ -1 +1 @@
-{"version":3,"file":"ActorOptimizeQueryOperationFilterPushdown.js","sourceRoot":"","sources":["ActorOptimizeQueryOperationFilterPushdown.ts"],"names":[],"mappings":";;;AAKA,yFAAqF;AAIrF,yCAAsC;AAEtC,qDAAgD;AAEhD;;GAEG;AACH,MAAa,yCAA0C,SAAQ,0DAA2B;IACxF,YAAmB,IAAsC;QACvD,KAAK,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IAEM,KAAK,CAAC,IAAI,CAAC,OAAsC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,KAAK,CAAC,GAAG,CAAC,MAAqC;QACpD,4CAA4C;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,MAAM,SAAS,GAAG,sBAAI,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,EAAE;YACpD,MAAM,CAAC,EAAkB,EAAE,OAAgB;gBACzC,+CAA+C;gBAC/C,qEAAqE;gBACrE,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;gBAC7D,OAAO;oBACL,OAAO,EAAE,IAAI;oBACb,MAAM,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC;iBACzF,CAAC;YACJ,CAAC;SACF,CAAC,CAAC;QACH,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,sBAAsB,CAAC,UAA8B;QAC1D,QAAQ,UAAU,CAAC,cAAc,EAAE,CAAC;YAClC,KAAK,yBAAO,CAAC,eAAe,CAAC,SAAS,CAAC;YACvC,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ;gBACnC,MAAM,IAAI,KAAK,CAAC,qDAAqD,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;YACpG,KAAK,yBAAO,CAAC,eAAe,CAAC,SAAS;gBACpC,OAAO,sBAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACjD,KAAK,yBAAO,CAAC,eAAe,CAAC,KAAK;gBAChC,OAAO,EAAE,CAAC;YACZ,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ;gBACnC,OAAO,IAAA,qBAAS,EAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrF,KAAK,yBAAO,CAAC,eAAe,CAAC,IAAI;gBAC/B,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBAC5C,OAAO,CAAE,UAAU,CAAC,IAAI,CAAE,CAAC;gBAC7B,CAAC;gBACD,OAAO,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAES,wBAAwB,CAChC,SAA4B,EAC5B,mBAAmC;QAMnC,MAAM,gBAAgB,GAAwB,EAAE,CAAC;QACjD,MAAM,oBAAoB,GAAwB,EAAE,CAAC;QACrD,MAAM,cAAc,GAAwB,EAAE,CAAC;QAC/C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,cAAc,GAAG,sBAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACpD,IAAI,IAAI,CAAC,iBAAiB,CAAC,mBAAmB,EAAE,cAAc,CAAC,EAAE,CAAC;gBAChE,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;iBAAM,IAAI,IAAI,CAAC,kBAAkB,CAAC,mBAAmB,EAAE,cAAc,CAAC,EAAE,CAAC;gBACxE,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO;YACL,gBAAgB;YAChB,oBAAoB;YACpB,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,cAAc,CACnB,UAA8B,EAC9B,mBAAmC,EACnC,SAA4B,EAC5B,OAAgB,EAChB,OAAuB;QAEvB,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM;gBACvB,qDAAqD;gBACrD,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAE,SAAS,CAAC,QAAQ,CAAE,EAAE,mBAAmB,CAAC,EAAE,CAAC;oBAC1E,OAAO,OAAO,CAAC,YAAY,CACzB,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EACvF,SAAS,CAAC,QAAQ,EAClB,SAAS,CAAC,UAAU,CACrB,CAAC;gBACJ,CAAC;gBACD,OAAO,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACrD,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM;gBACvB,cAAc;gBACd,OAAO,OAAO,CAAC,YAAY,CACzB,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EACvF,SAAS,CAAC,UAAU,CACrB,CAAC;YACJ,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxB,iCAAiC;gBACjC,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjC,OAAO,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBACrD,CAAC;gBAED,mCAAmC;gBACnC,MAAM,EACJ,gBAAgB,EAChB,oBAAoB,EACpB,cAAc,GACf,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;gBAElE,MAAM,KAAK,GAAwB,EAAE,CAAC;gBACtC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,6CAA6C,gBAAgB,CAAC,MAAM,uBAAuB,oBAAoB,CAAC,MAAM,+BAA+B,cAAc,CAAC,MAAM,kBAAkB,CAAC,CAAC;gBACrN,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,gBAAgB;yBAC3C,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnG,CAAC;gBACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;gBAChG,CAAC;gBACD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;gBAChC,CAAC;gBAED,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACnE,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG;gBACpB,OAAO,SAAS,CAAC;YACnB,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO;gBACxB,iCAAiC;gBACjC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,SAAS,EAAE,mBAAmB,CAAC,EAAE,CAAC;oBACtE,OAAO,OAAO,CAAC,aAAa,CAC1B,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EACvF,SAAS,CAAC,SAAS,CACpB,CAAC;gBACJ,CAAC;gBACD,4BAA4B;gBAC5B,OAAO,SAAS,CAAC;YACnB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACzB,mCAAmC;gBACnC,MAAM,EACJ,gBAAgB,EAChB,oBAAoB,EACpB,cAAc,GACf,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;gBAElE,MAAM,MAAM,GAAwB,EAAE,CAAC;gBACvC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,8CAA8C,gBAAgB,CAAC,MAAM,uBAAuB,oBAAoB,CAAC,MAAM,+BAA+B,cAAc,CAAC,MAAM,kBAAkB,CAAC,CAAC;gBACtN,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,gBAAgB;yBAC7C,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnG,CAAC;gBACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,WAAW,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClG,CAAC;gBACD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9B,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;gBACjC,CAAC;gBAED,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACvE,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM;gBACvB,qDAAqD;gBACrD,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,SAAS,EAAE,mBAAmB,CAAC,EAAE,CAAC;oBACtE,OAAO,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBACrD,CAAC;gBACD,OAAO,SAAS,CAAC;YACnB,KAAK,yBAAO,CAAC,KAAK,CAAC,SAAS,CAAC;YAC7B,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,SAAS,CAAC;YAC7B,KAAK,yBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC5B,KAAK,yBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC5B,KAAK,yBAAO,CAAC,KAAK,CAAC,UAAU,CAAC;YAC9B,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACpC,KAAK,yBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC5B,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC;YAC3B,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC;YAC3B,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC;YAC3B,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC;YACrC,KAAK,yBAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACpC,KAAK,yBAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACpC,KAAK,yBAAO,CAAC,KAAK,CAAC,aAAa,CAAC;YACjC,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM,CAAC;YAC1B,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI;gBACrB,8CAA8C;gBAC9C,kEAAkE;gBAClE,OAAO,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,KAAqB,EAAE,KAAqB;QACpE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,iBAAiB,CAAC,WAA2B,EAAE,YAA4B;QAChF,OAAO,WAAW,CAAC,MAAM,IAAI,YAAY,CAAC,MAAM;YAC9C,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;CACF;AApPD,8FAoPC","sourcesContent":["import type {\n  IActionOptimizeQueryOperation,\n  IActorOptimizeQueryOperationOutput,\n  IActorOptimizeQueryOperationArgs,\n} from '@comunica/bus-optimize-query-operation';\nimport { ActorOptimizeQueryOperation } from '@comunica/bus-optimize-query-operation';\nimport type { IActorTest } from '@comunica/core';\nimport type { IActionContext } from '@comunica/types';\nimport type * as RDF from '@rdfjs/types';\nimport { uniqTerms } from 'rdf-terms';\nimport type { Factory } from 'sparqlalgebrajs';\nimport { Algebra, Util } from 'sparqlalgebrajs';\n\n/**\n * A comunica Filter Pushdown Optimize Query Operation Actor.\n */\nexport class ActorOptimizeQueryOperationFilterPushdown extends ActorOptimizeQueryOperation {\n  public constructor(args: IActorOptimizeQueryOperationArgs) {\n    super(args);\n  }\n\n  public async test(_action: IActionOptimizeQueryOperation): Promise<IActorTest> {\n    return true;\n  }\n\n  public async run(action: IActionOptimizeQueryOperation): Promise<IActorOptimizeQueryOperationOutput> {\n    // eslint-disable-next-line ts/no-this-alias\n    const self = this;\n    const operation = Util.mapOperation(action.operation, {\n      filter(op: Algebra.Filter, factory: Factory) {\n        // For all filter expressions in the operation,\n        // we attempt to push them down as deep as possible into the algebra.\n        const variables = self.getExpressionVariables(op.expression);\n        return {\n          recurse: true,\n          result: self.filterPushdown(op.expression, variables, op.input, factory, action.context),\n        };\n      },\n    });\n    return { operation, context: action.context };\n  }\n\n  /**\n   * Get all variables inside the given expression.\n   * @param expression An expression.\n   * @return An array of variables, or undefined if the expression is unsupported for pushdown.\n   */\n  public getExpressionVariables(expression: Algebra.Expression): RDF.Variable[] {\n    switch (expression.expressionType) {\n      case Algebra.expressionTypes.AGGREGATE:\n      case Algebra.expressionTypes.WILDCARD:\n        throw new Error(`Getting expression variables is not supported for ${expression.expressionType}`);\n      case Algebra.expressionTypes.EXISTENCE:\n        return Util.inScopeVariables(expression.input);\n      case Algebra.expressionTypes.NAMED:\n        return [];\n      case Algebra.expressionTypes.OPERATOR:\n        return uniqTerms(expression.args.flatMap(arg => this.getExpressionVariables(arg)));\n      case Algebra.expressionTypes.TERM:\n        if (expression.term.termType === 'Variable') {\n          return [ expression.term ];\n        }\n        return [];\n    }\n  }\n\n  protected getOverlappingOperations(\n    operation: Algebra.Operation,\n    expressionVariables: RDF.Variable[],\n  ): {\n      fullyOverlapping: Algebra.Operation[];\n      partiallyOverlapping: Algebra.Operation[];\n      notOverlapping: Algebra.Operation[];\n    } {\n    const fullyOverlapping: Algebra.Operation[] = [];\n    const partiallyOverlapping: Algebra.Operation[] = [];\n    const notOverlapping: Algebra.Operation[] = [];\n    for (const input of operation.input) {\n      const inputVariables = Util.inScopeVariables(input);\n      if (this.variablesSubSetOf(expressionVariables, inputVariables)) {\n        fullyOverlapping.push(input);\n      } else if (this.variablesIntersect(expressionVariables, inputVariables)) {\n        partiallyOverlapping.push(input);\n      } else {\n        notOverlapping.push(input);\n      }\n    }\n\n    return {\n      fullyOverlapping,\n      partiallyOverlapping,\n      notOverlapping,\n    };\n  }\n\n  /**\n   * Recursively push down the given expression into the given operation if possible.\n   * Different operators have different semantics for choosing whether or not to push down,\n   * and how this pushdown is done.\n   * For every passed operator, it is checked whether or not the filter will have any effect on the operation.\n   * If not, the filter is voided.\n   * @param expression An expression to push down.\n   * @param expressionVariables The variables inside the given expression.\n   * @param operation The operation to push down into.\n   * @param factory An algebra factory.\n   * @param context The action context.\n   * @return The modified operation.\n   */\n  public filterPushdown(\n    expression: Algebra.Expression,\n    expressionVariables: RDF.Variable[],\n    operation: Algebra.Operation,\n    factory: Factory,\n    context: IActionContext,\n  ): Algebra.Operation {\n    switch (operation.type) {\n      case Algebra.types.EXTEND:\n        // Pass if the variable is not part of the expression\n        if (!this.variablesIntersect([ operation.variable ], expressionVariables)) {\n          return factory.createExtend(\n            this.filterPushdown(expression, expressionVariables, operation.input, factory, context),\n            operation.variable,\n            operation.expression,\n          );\n        }\n        return factory.createFilter(operation, expression);\n      case Algebra.types.FILTER:\n        // Always pass\n        return factory.createFilter(\n          this.filterPushdown(expression, expressionVariables, operation.input, factory, context),\n          operation.expression,\n        );\n      case Algebra.types.JOIN: {\n        // Don't push down for empty join\n        if (operation.input.length === 0) {\n          return factory.createFilter(operation, expression);\n        }\n\n        // Determine overlapping operations\n        const {\n          fullyOverlapping,\n          partiallyOverlapping,\n          notOverlapping,\n        } = this.getOverlappingOperations(operation, expressionVariables);\n\n        const joins: Algebra.Operation[] = [];\n        this.logDebug(context, `Push down filter across join entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);\n        if (fullyOverlapping.length > 0) {\n          joins.push(factory.createJoin(fullyOverlapping\n            .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context))));\n        }\n        if (partiallyOverlapping.length > 0) {\n          joins.push(factory.createFilter(factory.createJoin(partiallyOverlapping, false), expression));\n        }\n        if (notOverlapping.length > 0) {\n          joins.push(...notOverlapping);\n        }\n\n        return joins.length === 1 ? joins[0] : factory.createJoin(joins);\n      }\n      case Algebra.types.NOP:\n        return operation;\n      case Algebra.types.PROJECT:\n        // Push down if variables overlap\n        if (this.variablesIntersect(operation.variables, expressionVariables)) {\n          return factory.createProject(\n            this.filterPushdown(expression, expressionVariables, operation.input, factory, context),\n            operation.variables,\n          );\n        }\n        // Void expression otherwise\n        return operation;\n      case Algebra.types.UNION: {\n        // Determine overlapping operations\n        const {\n          fullyOverlapping,\n          partiallyOverlapping,\n          notOverlapping,\n        } = this.getOverlappingOperations(operation, expressionVariables);\n\n        const unions: Algebra.Operation[] = [];\n        this.logDebug(context, `Push down filter across union entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);\n        if (fullyOverlapping.length > 0) {\n          unions.push(factory.createUnion(fullyOverlapping\n            .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context))));\n        }\n        if (partiallyOverlapping.length > 0) {\n          unions.push(factory.createFilter(factory.createUnion(partiallyOverlapping, false), expression));\n        }\n        if (notOverlapping.length > 0) {\n          unions.push(...notOverlapping);\n        }\n\n        return unions.length === 1 ? unions[0] : factory.createUnion(unions);\n      }\n      case Algebra.types.VALUES:\n        // Only keep filter if it overlaps with the variables\n        if (this.variablesIntersect(operation.variables, expressionVariables)) {\n          return factory.createFilter(operation, expression);\n        }\n        return operation;\n      case Algebra.types.LEFT_JOIN:\n      case Algebra.types.MINUS:\n      case Algebra.types.ALT:\n      case Algebra.types.ASK:\n      case Algebra.types.BGP:\n      case Algebra.types.CONSTRUCT:\n      case Algebra.types.DESCRIBE:\n      case Algebra.types.DISTINCT:\n      case Algebra.types.EXPRESSION:\n      case Algebra.types.FROM:\n      case Algebra.types.GRAPH:\n      case Algebra.types.GROUP:\n      case Algebra.types.INV:\n      case Algebra.types.LINK:\n      case Algebra.types.NPS:\n      case Algebra.types.ONE_OR_MORE_PATH:\n      case Algebra.types.ORDER_BY:\n      case Algebra.types.PATTERN:\n      case Algebra.types.REDUCED:\n      case Algebra.types.SEQ:\n      case Algebra.types.SERVICE:\n      case Algebra.types.SLICE:\n      case Algebra.types.PATH:\n      case Algebra.types.ZERO_OR_MORE_PATH:\n      case Algebra.types.ZERO_OR_ONE_PATH:\n      case Algebra.types.COMPOSITE_UPDATE:\n      case Algebra.types.DELETE_INSERT:\n      case Algebra.types.LOAD:\n      case Algebra.types.CLEAR:\n      case Algebra.types.CREATE:\n      case Algebra.types.DROP:\n      case Algebra.types.ADD:\n      case Algebra.types.MOVE:\n      case Algebra.types.COPY:\n        // Operations that do not support pushing down\n        // Left-join and minus might be possible to support in the future.\n        return factory.createFilter(operation, expression);\n    }\n  }\n\n  /**\n   * Check if there is an overlap between the two given lists of variables.\n   * @param varsA A list of variables.\n   * @param varsB A list of variables.\n   */\n  public variablesIntersect(varsA: RDF.Variable[], varsB: RDF.Variable[]): boolean {\n    return varsA.some(varA => varsB.some(varB => varA.equals(varB)));\n  }\n\n  /**\n   * Check if all variables from the first list are included in the second list.\n   * The second list may contain other variables as well.\n   * @param varsNeedles A list of variables to search for.\n   * @param varsHaystack A list of variables to search in.\n   */\n  public variablesSubSetOf(varsNeedles: RDF.Variable[], varsHaystack: RDF.Variable[]): boolean {\n    return varsNeedles.length <= varsHaystack.length &&\n      varsNeedles.every(varA => varsHaystack.some(varB => varA.equals(varB)));\n  }\n}\n"]}
+{"version":3,"file":"ActorOptimizeQueryOperationFilterPushdown.js","sourceRoot":"","sources":["ActorOptimizeQueryOperationFilterPushdown.ts"],"names":[],"mappings":";;;AAKA,yFAAqF;AACrF,uEAAoE;AAIpE,yCAAsD;AAEtD,qDAAgD;AAEhD;;GAEG;AACH,MAAa,yCAA0C,SAAQ,0DAA2B;IAQxF,YAAmB,IAAoD;QACrE,KAAK,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IAEM,KAAK,CAAC,IAAI,CAAC,OAAsC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,KAAK,CAAC,GAAG,CAAC,MAAqC;QACpD,IAAI,SAAS,GAAsB,MAAM,CAAC,SAAS,CAAC;QACpD,4CAA4C;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC;QAElB,gDAAgD;QAChD,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,SAAS,GAAG,sBAAI,CAAC,YAAY,CAAC,SAAS,EAAE;gBACvC,MAAM,CAAC,EAAkB,EAAE,OAAgB;oBACzC,kDAAkD;oBAClD,IAAI,EAAE,CAAC,UAAU,CAAC,cAAc,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ,IAAI,EAAE,CAAC,UAAU,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;wBACzG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,iCAAiC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC;wBAC3G,OAAO;4BACL,OAAO,EAAE,IAAI;4BACb,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI;iCACvB,MAAM,CAAC,CAAC,SAAS,EAAE,UAAU,EAAE,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC;yBAC5F,CAAC;oBACJ,CAAC;oBACD,OAAO;wBACL,OAAO,EAAE,IAAI;wBACb,MAAM,EAAE,EAAE;qBACX,CAAC;gBACJ,CAAC;aACF,CAAC,CAAC;QACL,CAAC;QAED,4CAA4C;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC3C,4DAA4D;QAC5D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAkD,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO;aACpG,GAAG,CAAC,KAAK,EAAC,MAAM,EAAC,EAAE,CAAC,CAAE,MAAM,EAAE,MAAM,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;QAE3F,wBAAwB;QACxB,oDAAoD;QACpD,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,OAAO,MAAM,IAAI,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACjD,MAAM,GAAG,KAAK,CAAC;YACf,SAAS,GAAG,sBAAI,CAAC,YAAY,CAAC,SAAS,EAAE;gBACvC,MAAM,CAAC,EAAkB,EAAE,OAAgB;oBACzC,0CAA0C;oBAC1C,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,EAAE,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;wBAC3D,OAAO;4BACL,OAAO,EAAE,IAAI;4BACb,MAAM,EAAE,EAAE;yBACX,CAAC;oBACJ,CAAC;oBAED,+CAA+C;oBAC/C,qEAAqE;oBACrE,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;oBAC7D,MAAM,CAAE,UAAU,EAAE,MAAM,CAAE,GAAG,IAAI;yBAChC,cAAc,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;oBAC/E,IAAI,UAAU,EAAE,CAAC;wBACf,MAAM,GAAG,IAAI,CAAC;oBAChB,CAAC;oBACD,OAAO;wBACL,OAAO,EAAE,IAAI;wBACb,MAAM;qBACP,CAAC;gBACJ,CAAC;aACF,CAAC,CAAC;YACH,UAAU,EAAE,CAAC;QACf,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,0BAA0B,UAAU,aAAa,CAAC,CAAC;QACnF,CAAC;QAED,gDAAgD;QAChD,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,SAAS,GAAG,sBAAI,CAAC,YAAY,CAAC,SAAS,EAAE;gBACvC,MAAM,CAAC,EAAkB,EAAE,OAAgB;oBACzC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;wBAC3C,MAAM,EAAE,iBAAiB,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC;wBACzE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,iBAAiB,CAAC,MAAM,yCAAyC,CAAC,CAAC;wBAC1G,OAAO;4BACL,OAAO,EAAE,IAAI;4BACb,MAAM,EAAE,OAAO,CAAC,YAAY,CAC1B,KAAK,EACL,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,CACtD,OAAO,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAE,QAAQ,EAAE,OAAO,CAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CACvF;yBACF,CAAC;oBACJ,CAAC;oBACD,OAAO;wBACL,OAAO,EAAE,IAAI;wBACb,MAAM,EAAE,EAAE;qBACX,CAAC;gBACJ,CAAC;aACF,CAAC,CAAC;QACL,CAAC;QAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC;IAChD,CAAC;IAED;;;;;;;;OAQG;IACI,qBAAqB,CAC1B,SAAyB,EACzB,OAA8B,EAC9B,YAA6D;QAE7D,iDAAiD;QACjD,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iDAAiD;QACjD,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;QACxC,IAAI,UAAU,CAAC,cAAc,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ;YAChE,UAAU,CAAC,QAAQ,KAAK,GAAG;YAC3B,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU;gBAC7F,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU,CAAC;gBAClG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU;oBAC9F,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC;YACxG,OAAO,IAAI,CAAC;QACd,CAAC;QAED,6DAA6D;QAC7D,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,yCAAmB,CAAC,wBAAwB,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;YAC/G,OAAO,IAAI,CAAC;QACd,CAAC;QAED,qCAAqC;QACrC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,SAA4B;QAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,MAAM,WAAW,GAAG,CAAC,YAA+B,EAAW,EAAE;YAC/D,MAAM,GAAG,GAAG,yCAAmB,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;YACjE,IAAI,GAAG,EAAE,CAAC;gBACR,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,sBAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE;YAC/B,CAAC,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,WAAW;YACpC,CAAC,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,WAAW;YACjC,CAAC,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,WAAW;YAChC,CAAC,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,WAAW;SACrC,CAAC,CAAC;QACH,OAAO,CAAE,GAAG,OAAO,CAAE,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACI,sBAAsB,CAAC,UAA8B;QAC1D,QAAQ,UAAU,CAAC,cAAc,EAAE,CAAC;YAClC,KAAK,yBAAO,CAAC,eAAe,CAAC,SAAS,CAAC;YACvC,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ;gBACnC,MAAM,IAAI,KAAK,CAAC,qDAAqD,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;YACpG,KAAK,yBAAO,CAAC,eAAe,CAAC,SAAS;gBACpC,OAAO,sBAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACjD,KAAK,yBAAO,CAAC,eAAe,CAAC,KAAK;gBAChC,OAAO,EAAE,CAAC;YACZ,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ;gBACnC,OAAO,IAAA,qBAAS,EAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrF,KAAK,yBAAO,CAAC,eAAe,CAAC,IAAI;gBAC/B,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBAC5C,OAAO,CAAE,UAAU,CAAC,IAAI,CAAE,CAAC;gBAC7B,CAAC;gBACD,OAAO,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAES,wBAAwB,CAChC,SAA4B,EAC5B,mBAAmC;QAMnC,MAAM,gBAAgB,GAAwB,EAAE,CAAC;QACjD,MAAM,oBAAoB,GAAwB,EAAE,CAAC;QACrD,MAAM,cAAc,GAAwB,EAAE,CAAC;QAC/C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,cAAc,GAAG,sBAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACpD,IAAI,IAAI,CAAC,iBAAiB,CAAC,mBAAmB,EAAE,cAAc,CAAC,EAAE,CAAC;gBAChE,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;iBAAM,IAAI,IAAI,CAAC,kBAAkB,CAAC,mBAAmB,EAAE,cAAc,CAAC,EAAE,CAAC;gBACxE,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO;YACL,gBAAgB;YAChB,oBAAoB;YACpB,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,cAAc,CACnB,UAA8B,EAC9B,mBAAmC,EACnC,SAA4B,EAC5B,OAAgB,EAChB,OAAuB;QAEvB,yBAAyB;QACzB,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC;YACvC,OAAO,CAAE,IAAI,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAE,CAAC;QAC3C,CAAC;QAED,+BAA+B;QAC/B,IAAI,UAAU,CAAC,IAAI,KAAK,yBAAO,CAAC,KAAK,CAAC,UAAU;YAC9C,UAAU,CAAC,cAAc,KAAK,yBAAO,CAAC,eAAe,CAAC,SAAS,EAAE,CAAC;YAClE,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;QAChE,CAAC;QAED,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM;gBACvB,qDAAqD;gBACrD,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAE,SAAS,CAAC,QAAQ,CAAE,EAAE,mBAAmB,CAAC,EAAE,CAAC;oBAC1E,OAAO,CAAE,IAAI,EAAE,OAAO,CAAC,YAAY,CACjC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,EAC1F,SAAS,CAAC,QAAQ,EAClB,SAAS,CAAC,UAAU,CACrB,CAAE,CAAC;gBACN,CAAC;gBACD,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;YAChE,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC1B,cAAc;gBACd,MAAM,CAAE,UAAU,EAAE,MAAM,CAAE,GAAG,IAAI;qBAChC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtF,OAAO,CAAE,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAE,CAAC;YAC5E,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxB,iCAAiC;gBACjC,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjC,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;gBAChE,CAAC;gBAED,mCAAmC;gBACnC,MAAM,EACJ,gBAAgB,EAChB,oBAAoB,EACpB,cAAc,GACf,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;gBAElE,MAAM,KAAK,GAAwB,EAAE,CAAC;gBACtC,IAAI,UAAU,GAAG,KAAK,CAAC;gBACvB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,UAAU,GAAG,IAAI,CAAC;oBAClB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,gBAAgB;yBAC3C,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtG,CAAC;gBACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;gBAChG,CAAC;gBACD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;gBAChC,CAAC;gBAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrB,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;gBAED,IAAI,UAAU,EAAE,CAAC;oBACf,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,6CAA6C,gBAAgB,CAAC,MAAM,uBAAuB,oBAAoB,CAAC,MAAM,+BAA+B,cAAc,CAAC,MAAM,kBAAkB,CAAC,CAAC;gBACvN,CAAC;gBAED,OAAO,CAAE,UAAU,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAE,CAAC;YACnF,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG;gBACpB,OAAO,CAAE,IAAI,EAAE,SAAS,CAAE,CAAC;YAC7B,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO;gBACxB,iCAAiC;gBACjC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,SAAS,EAAE,mBAAmB,CAAC,EAAE,CAAC;oBACtE,OAAO,CAAE,IAAI,EAAE,OAAO,CAAC,aAAa,CAClC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,EAC1F,SAAS,CAAC,SAAS,CACpB,CAAE,CAAC;gBACN,CAAC;gBACD,4BAA4B;gBAC5B,OAAO,CAAE,IAAI,EAAE,SAAS,CAAE,CAAC;YAC7B,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACzB,mCAAmC;gBACnC,MAAM,EACJ,gBAAgB,EAChB,oBAAoB,EACpB,cAAc,GACf,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;gBAElE,MAAM,MAAM,GAAwB,EAAE,CAAC;gBACvC,IAAI,UAAU,GAAG,KAAK,CAAC;gBACvB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,UAAU,GAAG,IAAI,CAAC;oBAClB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,gBAAgB;yBAC7C,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtG,CAAC;gBACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,WAAW,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClG,CAAC;gBACD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9B,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;gBACjC,CAAC;gBAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;gBAED,IAAI,UAAU,EAAE,CAAC;oBACf,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,8CAA8C,gBAAgB,CAAC,MAAM,uBAAuB,oBAAoB,CAAC,MAAM,+BAA+B,cAAc,CAAC,MAAM,kBAAkB,CAAC,CAAC;gBACxN,CAAC;gBAED,OAAO,CAAE,UAAU,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAE,CAAC;YACvF,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM;gBACvB,qDAAqD;gBACrD,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,SAAS,EAAE,mBAAmB,CAAC,EAAE,CAAC;oBACtE,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;gBAChE,CAAC;gBACD,OAAO,CAAE,IAAI,EAAE,SAAS,CAAE,CAAC;YAC7B,KAAK,yBAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC7B,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBAC3B,MAAM,cAAc,GAAG,sBAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjE,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,mBAAmB,EAAE,cAAc,CAAC,EAAE,CAAC;wBAClE,8EAA8E;wBAC9E,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,iCAAiC,CAAC,CAAC;wBAC1D,OAAO,CAAE,IAAI,EAAE,OAAO,CAAC,cAAc,CACnC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,mBAAmB,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,EAC7F,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAClB,SAAS,CAAC,UAAU,CACrB,CAAE,CAAC;oBACN,CAAC;gBACH,CAAC;gBAED,qCAAqC;gBACrC,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;YAChE,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC3B,IAAI,IAAI,CAAC,wBAAwB,EAAE,CAAC;oBAClC,qEAAqE;oBACrE,MAAM,cAAc,GAAG,IAAI,CAAC,wCAAwC,CAAC,UAAU,CAAC,CAAC;oBACjF,IAAI,cAAc,EAAE,CAAC;wBACnB,IAAI,UAAU,GAAG,KAAK,CAAC;wBACvB,MAAM,gBAAgB,GAAG,SAAS,CAAC,QAAQ,CAAC;wBAC5C,SAAS,GAAG,IAAA,0BAAc,EAAC,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE;4BAC9C,IAAI,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;gCAC1C,UAAU,GAAG,IAAI,CAAC;gCAClB,OAAO,cAAc,CAAC,IAAI,CAAC;4BAC7B,CAAC;4BACD,OAAO,KAAK,CAAC;wBACf,CAAC,CAAC,CAAC;wBACH,SAAS,CAAC,IAAI,GAAG,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC;wBACvC,SAAS,CAAC,QAAQ,GAAG,gBAAgB,CAAC;wBACtC,IAAI,UAAU,EAAE,CAAC;4BACf,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,sCAAsC,cAAc,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;4BAC9F,OAAO,CAAE,IAAI,EAAE,SAAS,CAAE,CAAC;wBAC7B,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,qCAAqC;gBACrC,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;YAChE,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxB,IAAI,IAAI,CAAC,wBAAwB,EAAE,CAAC;oBAClC,kEAAkE;oBAClE,MAAM,cAAc,GAAG,IAAI,CAAC,wCAAwC,CAAC,UAAU,CAAC,CAAC;oBACjF,IAAI,cAAc;wBAChB,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;wBAC1G,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,mCAAmC,cAAc,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;wBAC3F,MAAM,gBAAgB,GAAG,SAAS,CAAC,QAAQ,CAAC;wBAC5C,SAAS,GAAG,OAAO,CAAC,UAAU,CAC5B,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAC3F,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAC1F,CAAC;wBACF,SAAS,CAAC,QAAQ,GAAG,gBAAgB,CAAC;wBACtC,OAAO,CAAE,IAAI,EAAE,SAAS,CAAE,CAAC;oBAC7B,CAAC;gBACH,CAAC;gBAED,qCAAqC;gBACrC,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;YAChE,CAAC;YACD,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,SAAS,CAAC;YAC7B,KAAK,yBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC5B,KAAK,yBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC5B,KAAK,yBAAO,CAAC,KAAK,CAAC,UAAU,CAAC;YAC9B,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACpC,KAAK,yBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC5B,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC;YAC3B,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,OAAO,CAAC;YAC3B,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC;YACrC,KAAK,yBAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACpC,KAAK,yBAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACpC,KAAK,yBAAO,CAAC,KAAK,CAAC,aAAa,CAAC;YACjC,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM,CAAC;YAC1B,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACvB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACxB,KAAK,yBAAO,CAAC,KAAK,CAAC,IAAI;gBACrB,8CAA8C;gBAC9C,kEAAkE;gBAClE,OAAO,CAAE,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAE,CAAC;QAClE,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,wCAAwC,CAC7C,UAA8B;QAE9B,IAAI,UAAU,CAAC,cAAc,KAAK,yBAAO,CAAC,eAAe,CAAC,QAAQ,IAAI,UAAU,CAAC,QAAQ,KAAK,GAAG,EAAE,CAAC;YAClG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU;gBACjG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS;oBAC7C,IAAI,CAAC,iCAAiC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;gBAClG,OAAO;oBACL,QAAQ,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;oBACjC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;iBAC9B,CAAC;YACJ,CAAC;YACD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU;gBACjG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU;gBAC/F,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS;oBAC7C,IAAI,CAAC,iCAAiC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACrE,OAAO;oBACL,QAAQ,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;oBACjC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;iBAC9B,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACO,iCAAiC,CAAC,IAAc;QACxD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC5B,KAAK,yCAAyC,CAAC;gBAC/C,KAAK,uDAAuD,CAAC;gBAC7D,KAAK,mDAAmD,CAAC;gBACzD,KAAK,yCAAyC,CAAC;gBAC/C,KAAK,+CAA+C,CAAC;gBACrD,KAAK,2CAA2C,CAAC;gBACjD,KAAK,uCAAuC,CAAC;gBAC7C,KAAK,yCAAyC,CAAC;gBAC/C,KAAK,0CAA0C,CAAC;gBAChD,KAAK,wCAAwC,CAAC;gBAC9C,KAAK,4CAA4C;oBAC/C,OAAO,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,KAAqB,EAAE,KAAqB;QACpE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,iBAAiB,CAAC,WAA2B,EAAE,YAA4B;QAChF,OAAO,WAAW,CAAC,MAAM,IAAI,YAAY,CAAC,MAAM;YAC9C,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED;;;OAGG;IACI,iBAAiB,CAAC,UAA8B;QACrD,OAAO,CAAC,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC;IAC1G,CAAC;IAED;;;;OAIG;IACI,0BAA0B,CAC/B,EAAkB;QAElB,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,yBAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,0BAA0B,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5D,OAAO,EAAE,iBAAiB,EAAE,CAAE,EAAE,CAAC,UAAU,EAAE,GAAG,SAAS,CAAC,iBAAiB,CAAE,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC;QAC1G,CAAC;QACD,OAAO,EAAE,iBAAiB,EAAE,CAAE,EAAE,CAAC,UAAU,CAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC;IACnE,CAAC;CACF;AAnjBD,8FAmjBC","sourcesContent":["import type {\n  IActionOptimizeQueryOperation,\n  IActorOptimizeQueryOperationArgs,\n  IActorOptimizeQueryOperationOutput,\n} from '@comunica/bus-optimize-query-operation';\nimport { ActorOptimizeQueryOperation } from '@comunica/bus-optimize-query-operation';\nimport { ActorQueryOperation } from '@comunica/bus-query-operation';\nimport type { IActorTest } from '@comunica/core';\nimport type { FragmentSelectorShape, IActionContext, IQuerySourceWrapper } from '@comunica/types';\nimport type * as RDF from '@rdfjs/types';\nimport { mapTermsNested, uniqTerms } from 'rdf-terms';\nimport type { Factory } from 'sparqlalgebrajs';\nimport { Algebra, Util } from 'sparqlalgebrajs';\n\n/**\n * A comunica Filter Pushdown Optimize Query Operation Actor.\n */\nexport class ActorOptimizeQueryOperationFilterPushdown extends ActorOptimizeQueryOperation {\n  private readonly aggressivePushdown: boolean;\n  private readonly maxIterations: number;\n  private readonly splitConjunctive: boolean;\n  private readonly mergeConjunctive: boolean;\n  private readonly pushIntoLeftJoins: boolean;\n  private readonly pushEqualityIntoPatterns: boolean;\n\n  public constructor(args: IActorOptimizeQueryOperationFilterPushdownArgs) {\n    super(args);\n  }\n\n  public async test(_action: IActionOptimizeQueryOperation): Promise<IActorTest> {\n    return true;\n  }\n\n  public async run(action: IActionOptimizeQueryOperation): Promise<IActorOptimizeQueryOperationOutput> {\n    let operation: Algebra.Operation = action.operation;\n    // eslint-disable-next-line ts/no-this-alias\n    const self = this;\n\n    // Split conjunctive filters into nested filters\n    if (this.splitConjunctive) {\n      operation = Util.mapOperation(operation, {\n        filter(op: Algebra.Filter, factory: Factory) {\n          // Split conjunctive filters into separate filters\n          if (op.expression.expressionType === Algebra.expressionTypes.OPERATOR && op.expression.operator === '&&') {\n            self.logDebug(action.context, `Split conjunctive filter into ${op.expression.args.length} nested filters`);\n            return {\n              recurse: true,\n              result: op.expression.args\n                .reduce((operation, expression) => factory.createFilter(operation, expression), op.input),\n            };\n          }\n          return {\n            recurse: true,\n            result: op,\n          };\n        },\n      });\n    }\n\n    // Collect selector shapes of all operations\n    const sources = this.getSources(operation);\n    // eslint-disable-next-line ts/no-unnecessary-type-assertion\n    const sourceShapes = new Map(<[IQuerySourceWrapper, FragmentSelectorShape][]> await Promise.all(sources\n      .map(async source => [ source, await source.source.getSelectorShape(action.context) ])));\n\n    // Push down all filters\n    // We loop until no more filters can be pushed down.\n    let repeat = true;\n    let iterations = 0;\n    while (repeat && iterations < this.maxIterations) {\n      repeat = false;\n      operation = Util.mapOperation(operation, {\n        filter(op: Algebra.Filter, factory: Factory) {\n          // Check if the filter must be pushed down\n          if (!self.shouldAttemptPushDown(op, sources, sourceShapes)) {\n            return {\n              recurse: true,\n              result: op,\n            };\n          }\n\n          // For all filter expressions in the operation,\n          // we attempt to push them down as deep as possible into the algebra.\n          const variables = self.getExpressionVariables(op.expression);\n          const [ isModified, result ] = self\n            .filterPushdown(op.expression, variables, op.input, factory, action.context);\n          if (isModified) {\n            repeat = true;\n          }\n          return {\n            recurse: true,\n            result,\n          };\n        },\n      });\n      iterations++;\n    }\n\n    if (iterations > 1) {\n      self.logDebug(action.context, `Pushed down filters in ${iterations} iterations`);\n    }\n\n    // Merge nested filters into conjunctive filters\n    if (this.mergeConjunctive) {\n      operation = Util.mapOperation(operation, {\n        filter(op: Algebra.Filter, factory: Factory) {\n          if (op.input.type === Algebra.types.FILTER) {\n            const { nestedExpressions, input } = self.getNestedFilterExpressions(op);\n            self.logDebug(action.context, `Merge ${nestedExpressions.length} nested filters into conjunctive filter`);\n            return {\n              recurse: true,\n              result: factory.createFilter(\n                input,\n                nestedExpressions.slice(1).reduce((previous, current) =>\n                  factory.createOperatorExpression('&&', [ previous, current ]), nestedExpressions[0]),\n              ),\n            };\n          }\n          return {\n            recurse: true,\n            result: op,\n          };\n        },\n      });\n    }\n\n    return { operation, context: action.context };\n  }\n\n  /**\n   * Check if the given filter operation must be attempted to push down, based on the following criteria:\n   * - Always push down if aggressive mode is enabled\n   * - Push down if the filter is extremely selective\n   * - Push down if federated and at least one accepts the filter\n   * @param operation The filter operation\n   * @param sources The query sources in the operation\n   * @param sourceShapes A mapping of sources to selector shapes.\n   */\n  public shouldAttemptPushDown(\n    operation: Algebra.Filter,\n    sources: IQuerySourceWrapper[],\n    sourceShapes: Map<IQuerySourceWrapper, FragmentSelectorShape>,\n  ): boolean {\n    // Always push down if aggressive mode is enabled\n    if (this.aggressivePushdown) {\n      return true;\n    }\n\n    // Push down if the filter is extremely selective\n    const expression = operation.expression;\n    if (expression.expressionType === Algebra.expressionTypes.OPERATOR &&\n      expression.operator === '=' &&\n      ((expression.args[0].expressionType === 'term' && expression.args[0].term.termType !== 'Variable' &&\n          expression.args[1].expressionType === 'term' && expression.args[1].term.termType === 'Variable') ||\n        (expression.args[0].expressionType === 'term' && expression.args[0].term.termType === 'Variable' &&\n          expression.args[1].expressionType === 'term' && expression.args[1].term.termType !== 'Variable'))) {\n      return true;\n    }\n\n    // Push down if federated and at least one accepts the filter\n    if (sources.some(source => ActorQueryOperation.doesShapeAcceptOperation(sourceShapes.get(source)!, operation))) {\n      return true;\n    }\n\n    // Don't push down in all other cases\n    return false;\n  }\n\n  /**\n   * Collected all sources that are defined within the given operation of children recursively.\n   * @param operation An operation.\n   */\n  public getSources(operation: Algebra.Operation): IQuerySourceWrapper[] {\n    const sources = new Set<IQuerySourceWrapper>();\n    const sourceAdder = (subOperation: Algebra.Operation): boolean => {\n      const src = ActorQueryOperation.getOperationSource(subOperation);\n      if (src) {\n        sources.add(src);\n      }\n      return false;\n    };\n    Util.recurseOperation(operation, {\n      [Algebra.types.PATTERN]: sourceAdder,\n      [Algebra.types.LINK]: sourceAdder,\n      [Algebra.types.NPS]: sourceAdder,\n      [Algebra.types.SERVICE]: sourceAdder,\n    });\n    return [ ...sources ];\n  }\n\n  /**\n   * Get all variables inside the given expression.\n   * @param expression An expression.\n   * @return An array of variables, or undefined if the expression is unsupported for pushdown.\n   */\n  public getExpressionVariables(expression: Algebra.Expression): RDF.Variable[] {\n    switch (expression.expressionType) {\n      case Algebra.expressionTypes.AGGREGATE:\n      case Algebra.expressionTypes.WILDCARD:\n        throw new Error(`Getting expression variables is not supported for ${expression.expressionType}`);\n      case Algebra.expressionTypes.EXISTENCE:\n        return Util.inScopeVariables(expression.input);\n      case Algebra.expressionTypes.NAMED:\n        return [];\n      case Algebra.expressionTypes.OPERATOR:\n        return uniqTerms(expression.args.flatMap(arg => this.getExpressionVariables(arg)));\n      case Algebra.expressionTypes.TERM:\n        if (expression.term.termType === 'Variable') {\n          return [ expression.term ];\n        }\n        return [];\n    }\n  }\n\n  protected getOverlappingOperations(\n    operation: Algebra.Operation,\n    expressionVariables: RDF.Variable[],\n  ): {\n      fullyOverlapping: Algebra.Operation[];\n      partiallyOverlapping: Algebra.Operation[];\n      notOverlapping: Algebra.Operation[];\n    } {\n    const fullyOverlapping: Algebra.Operation[] = [];\n    const partiallyOverlapping: Algebra.Operation[] = [];\n    const notOverlapping: Algebra.Operation[] = [];\n    for (const input of operation.input) {\n      const inputVariables = Util.inScopeVariables(input);\n      if (this.variablesSubSetOf(expressionVariables, inputVariables)) {\n        fullyOverlapping.push(input);\n      } else if (this.variablesIntersect(expressionVariables, inputVariables)) {\n        partiallyOverlapping.push(input);\n      } else {\n        notOverlapping.push(input);\n      }\n    }\n\n    return {\n      fullyOverlapping,\n      partiallyOverlapping,\n      notOverlapping,\n    };\n  }\n\n  /**\n   * Recursively push down the given expression into the given operation if possible.\n   * Different operators have different semantics for choosing whether or not to push down,\n   * and how this pushdown is done.\n   * For every passed operator, it is checked whether or not the filter will have any effect on the operation.\n   * If not, the filter is voided.\n   * @param expression An expression to push down.\n   * @param expressionVariables The variables inside the given expression.\n   * @param operation The operation to push down into.\n   * @param factory An algebra factory.\n   * @param context The action context.\n   * @return A tuple indicating if the operation was modified and the modified operation.\n   */\n  public filterPushdown(\n    expression: Algebra.Expression,\n    expressionVariables: RDF.Variable[],\n    operation: Algebra.Operation,\n    factory: Factory,\n    context: IActionContext,\n  ): [ boolean, Algebra.Operation ] {\n    // Void false expressions\n    if (this.isExpressionFalse(expression)) {\n      return [ true, factory.createUnion([]) ];\n    }\n\n    // Don't push down (NOT) EXISTS\n    if (expression.type === Algebra.types.EXPRESSION &&\n      expression.expressionType === Algebra.expressionTypes.EXISTENCE) {\n      return [ false, factory.createFilter(operation, expression) ];\n    }\n\n    switch (operation.type) {\n      case Algebra.types.EXTEND:\n        // Pass if the variable is not part of the expression\n        if (!this.variablesIntersect([ operation.variable ], expressionVariables)) {\n          return [ true, factory.createExtend(\n            this.filterPushdown(expression, expressionVariables, operation.input, factory, context)[1],\n            operation.variable,\n            operation.expression,\n          ) ];\n        }\n        return [ false, factory.createFilter(operation, expression) ];\n      case Algebra.types.FILTER: {\n        // Always pass\n        const [ isModified, result ] = this\n          .filterPushdown(expression, expressionVariables, operation.input, factory, context);\n        return [ isModified, factory.createFilter(result, operation.expression) ];\n      }\n      case Algebra.types.JOIN: {\n        // Don't push down for empty join\n        if (operation.input.length === 0) {\n          return [ false, factory.createFilter(operation, expression) ];\n        }\n\n        // Determine overlapping operations\n        const {\n          fullyOverlapping,\n          partiallyOverlapping,\n          notOverlapping,\n        } = this.getOverlappingOperations(operation, expressionVariables);\n\n        const joins: Algebra.Operation[] = [];\n        let isModified = false;\n        if (fullyOverlapping.length > 0) {\n          isModified = true;\n          joins.push(factory.createJoin(fullyOverlapping\n            .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context)[1])));\n        }\n        if (partiallyOverlapping.length > 0) {\n          joins.push(factory.createFilter(factory.createJoin(partiallyOverlapping, false), expression));\n        }\n        if (notOverlapping.length > 0) {\n          joins.push(...notOverlapping);\n        }\n\n        if (joins.length > 1) {\n          isModified = true;\n        }\n\n        if (isModified) {\n          this.logDebug(context, `Push down filter across join entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);\n        }\n\n        return [ isModified, joins.length === 1 ? joins[0] : factory.createJoin(joins) ];\n      }\n      case Algebra.types.NOP:\n        return [ true, operation ];\n      case Algebra.types.PROJECT:\n        // Push down if variables overlap\n        if (this.variablesIntersect(operation.variables, expressionVariables)) {\n          return [ true, factory.createProject(\n            this.filterPushdown(expression, expressionVariables, operation.input, factory, context)[1],\n            operation.variables,\n          ) ];\n        }\n        // Void expression otherwise\n        return [ true, operation ];\n      case Algebra.types.UNION: {\n        // Determine overlapping operations\n        const {\n          fullyOverlapping,\n          partiallyOverlapping,\n          notOverlapping,\n        } = this.getOverlappingOperations(operation, expressionVariables);\n\n        const unions: Algebra.Operation[] = [];\n        let isModified = false;\n        if (fullyOverlapping.length > 0) {\n          isModified = true;\n          unions.push(factory.createUnion(fullyOverlapping\n            .map(input => this.filterPushdown(expression, expressionVariables, input, factory, context)[1])));\n        }\n        if (partiallyOverlapping.length > 0) {\n          unions.push(factory.createFilter(factory.createUnion(partiallyOverlapping, false), expression));\n        }\n        if (notOverlapping.length > 0) {\n          unions.push(...notOverlapping);\n        }\n\n        if (unions.length > 1) {\n          isModified = true;\n        }\n\n        if (isModified) {\n          this.logDebug(context, `Push down filter across union entries with ${fullyOverlapping.length} fully overlapping, ${partiallyOverlapping.length} partially overlapping, and ${notOverlapping.length} not overlapping`);\n        }\n\n        return [ isModified, unions.length === 1 ? unions[0] : factory.createUnion(unions) ];\n      }\n      case Algebra.types.VALUES:\n        // Only keep filter if it overlaps with the variables\n        if (this.variablesIntersect(operation.variables, expressionVariables)) {\n          return [ false, factory.createFilter(operation, expression) ];\n        }\n        return [ true, operation ];\n      case Algebra.types.LEFT_JOIN: {\n        if (this.pushIntoLeftJoins) {\n          const rightVariables = Util.inScopeVariables(operation.input[1]);\n          if (!this.variablesIntersect(expressionVariables, rightVariables)) {\n            // If filter *only* applies to left entry of optional, push it down into that.\n            this.logDebug(context, `Push down filter into left join`);\n            return [ true, factory.createLeftJoin(\n              this.filterPushdown(expression, expressionVariables, operation.input[0], factory, context)[1],\n              operation.input[1],\n              operation.expression,\n            ) ];\n          }\n        }\n\n        // Don't push down in all other cases\n        return [ false, factory.createFilter(operation, expression) ];\n      }\n      case Algebra.types.PATTERN: {\n        if (this.pushEqualityIntoPatterns) {\n          // Try to push simple FILTER(?s = <iri>) expressions into the pattern\n          const pushableResult = this.getEqualityExpressionPushableIntoPattern(expression);\n          if (pushableResult) {\n            let isModified = false;\n            const originalMetadata = operation.metadata;\n            operation = mapTermsNested(operation, (value) => {\n              if (value.equals(pushableResult.variable)) {\n                isModified = true;\n                return pushableResult.term;\n              }\n              return value;\n            });\n            operation.type = Algebra.types.PATTERN;\n            operation.metadata = originalMetadata;\n            if (isModified) {\n              this.logDebug(context, `Push down filter into pattern for ?${pushableResult.variable.value}`);\n              return [ true, operation ];\n            }\n          }\n        }\n\n        // Don't push down in all other cases\n        return [ false, factory.createFilter(operation, expression) ];\n      }\n      case Algebra.types.PATH: {\n        if (this.pushEqualityIntoPatterns) {\n          // Try to push simple FILTER(?s = <iri>) expressions into the path\n          const pushableResult = this.getEqualityExpressionPushableIntoPattern(expression);\n          if (pushableResult &&\n            (operation.subject.equals(pushableResult.variable) || operation.object.equals(pushableResult.variable))) {\n            this.logDebug(context, `Push down filter into path for ?${pushableResult.variable.value}`);\n            const originalMetadata = operation.metadata;\n            operation = factory.createPath(\n              operation.subject.equals(pushableResult.variable) ? pushableResult.term : operation.subject,\n              operation.predicate,\n              operation.object.equals(pushableResult.variable) ? pushableResult.term : operation.object,\n            );\n            operation.metadata = originalMetadata;\n            return [ true, operation ];\n          }\n        }\n\n        // Don't push down in all other cases\n        return [ false, factory.createFilter(operation, expression) ];\n      }\n      case Algebra.types.MINUS:\n      case Algebra.types.ALT:\n      case Algebra.types.ASK:\n      case Algebra.types.BGP:\n      case Algebra.types.CONSTRUCT:\n      case Algebra.types.DESCRIBE:\n      case Algebra.types.DISTINCT:\n      case Algebra.types.EXPRESSION:\n      case Algebra.types.FROM:\n      case Algebra.types.GRAPH:\n      case Algebra.types.GROUP:\n      case Algebra.types.INV:\n      case Algebra.types.LINK:\n      case Algebra.types.NPS:\n      case Algebra.types.ONE_OR_MORE_PATH:\n      case Algebra.types.ORDER_BY:\n      case Algebra.types.REDUCED:\n      case Algebra.types.SEQ:\n      case Algebra.types.SERVICE:\n      case Algebra.types.SLICE:\n      case Algebra.types.ZERO_OR_MORE_PATH:\n      case Algebra.types.ZERO_OR_ONE_PATH:\n      case Algebra.types.COMPOSITE_UPDATE:\n      case Algebra.types.DELETE_INSERT:\n      case Algebra.types.LOAD:\n      case Algebra.types.CLEAR:\n      case Algebra.types.CREATE:\n      case Algebra.types.DROP:\n      case Algebra.types.ADD:\n      case Algebra.types.MOVE:\n      case Algebra.types.COPY:\n        // Operations that do not support pushing down\n        // Left-join and minus might be possible to support in the future.\n        return [ false, factory.createFilter(operation, expression) ];\n    }\n  }\n\n  /**\n   * Check if the given expression is a simple equals operation with one variable and one non-literal\n   * (or literal with canonical lexical form) term that can be pushed into a pattern.\n   * @param expression The current expression.\n   * @return The variable and term to fill into the pattern, or undefined.\n   */\n  public getEqualityExpressionPushableIntoPattern(\n    expression: Algebra.Expression,\n  ): { variable: RDF.Variable; term: RDF.Term } | undefined {\n    if (expression.expressionType === Algebra.expressionTypes.OPERATOR && expression.operator === '=') {\n      if (expression.args[0].expressionType === 'term' && expression.args[0].term.termType !== 'Variable' &&\n        (expression.args[0].term.termType !== 'Literal' ||\n          this.isLiteralWithCanonicalLexicalForm(expression.args[0].term)) &&\n        expression.args[1].expressionType === 'term' && expression.args[1].term.termType === 'Variable') {\n        return {\n          variable: expression.args[1].term,\n          term: expression.args[0].term,\n        };\n      }\n      if (expression.args[0].expressionType === 'term' && expression.args[0].term.termType === 'Variable' &&\n        expression.args[1].expressionType === 'term' && expression.args[1].term.termType !== 'Variable' &&\n        (expression.args[1].term.termType !== 'Literal' ||\n          this.isLiteralWithCanonicalLexicalForm(expression.args[1].term))) {\n        return {\n          variable: expression.args[0].term,\n          term: expression.args[1].term,\n        };\n      }\n    }\n  }\n\n  /**\n   * Check if the given term is a literal with datatype that where all values\n   * can only have one possible lexical representation.\n   * In other words, no variants of values exist that should be considered equal.\n   * For example: \"01\"^xsd:number and \"1\"^xsd:number will return false.\n   * @param term An RDF term.\n   * @protected\n   */\n  protected isLiteralWithCanonicalLexicalForm(term: RDF.Term): boolean {\n    if (term.termType === 'Literal') {\n      switch (term.datatype.value) {\n        case 'http://www.w3.org/2001/XMLSchema#string':\n        case 'http://www.w3.org/1999/02/22-rdf-syntax-ns#langString':\n        case 'http://www.w3.org/2001/XMLSchema#normalizedString':\n        case 'http://www.w3.org/2001/XMLSchema#anyURI':\n        case 'http://www.w3.org/2001/XMLSchema#base64Binary':\n        case 'http://www.w3.org/2001/XMLSchema#language':\n        case 'http://www.w3.org/2001/XMLSchema#Name':\n        case 'http://www.w3.org/2001/XMLSchema#NCName':\n        case 'http://www.w3.org/2001/XMLSchema#NMTOKEN':\n        case 'http://www.w3.org/2001/XMLSchema#token':\n        case 'http://www.w3.org/2001/XMLSchema#hexBinary':\n          return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Check if there is an overlap between the two given lists of variables.\n   * @param varsA A list of variables.\n   * @param varsB A list of variables.\n   */\n  public variablesIntersect(varsA: RDF.Variable[], varsB: RDF.Variable[]): boolean {\n    return varsA.some(varA => varsB.some(varB => varA.equals(varB)));\n  }\n\n  /**\n   * Check if all variables from the first list are included in the second list.\n   * The second list may contain other variables as well.\n   * @param varsNeedles A list of variables to search for.\n   * @param varsHaystack A list of variables to search in.\n   */\n  public variablesSubSetOf(varsNeedles: RDF.Variable[], varsHaystack: RDF.Variable[]): boolean {\n    return varsNeedles.length <= varsHaystack.length &&\n      varsNeedles.every(varA => varsHaystack.some(varB => varA.equals(varB)));\n  }\n\n  /**\n   * Check if an expression is simply 'false'.\n   * @param expression An expression.\n   */\n  public isExpressionFalse(expression: Algebra.Expression): boolean {\n    return (expression.term && expression.term.termType === 'Literal' && expression.term.value === 'false');\n  }\n\n  /**\n   * Get all directly nested filter expressions.\n   * As soon as a non-filter is found, it is returned as the input field.\n   * @param op A filter expression.\n   */\n  public getNestedFilterExpressions(\n    op: Algebra.Filter,\n  ): { nestedExpressions: Algebra.Expression[]; input: Algebra.Operation } {\n    if (op.input.type === Algebra.types.FILTER) {\n      const childData = this.getNestedFilterExpressions(op.input);\n      return { nestedExpressions: [ op.expression, ...childData.nestedExpressions ], input: childData.input };\n    }\n    return { nestedExpressions: [ op.expression ], input: op.input };\n  }\n}\n\nexport interface IActorOptimizeQueryOperationFilterPushdownArgs extends IActorOptimizeQueryOperationArgs {\n  /**\n   * If filters should be pushed down as deep as possible.\n   * If false, filters will only be pushed down if the source(s) accept them,\n   * or if the filter is very selective.\n   * @range {boolean}\n   * @default {false}\n   */\n  aggressivePushdown: boolean;\n  /**\n   * The maximum number of full iterations across the query can be done for attempting to push down filters.\n   * @default {10}\n   */\n  maxIterations: number;\n  /**\n   * If conjunctive filters should be split into nested filters before applying filter pushdown.\n   * This can enable pushing down deeper.\n   * @range {boolean}\n   * @default {true}\n   */\n  splitConjunctive: boolean;\n  /**\n   * If nested filters should be merged into conjunctive filters after applying filter pushdown.\n   * @range {boolean}\n   * @default {true}\n   */\n  mergeConjunctive: boolean;\n  /**\n   * If filters should be pushed into left-joins.\n   * @range {boolean}\n   * @default {true}\n   */\n  pushIntoLeftJoins: boolean;\n  /**\n   * If simple equality filters should be pushed into patterns and paths.\n   * This only applies to equality filters with terms that are not literals that have no canonical lexical form.\n   * @range {boolean}\n   * @default {true}\n   */\n  pushEqualityIntoPatterns: boolean;\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@comunica/actor-optimize-query-operation-filter-pushdown",
-  "version": "3.2.0",
+  "version": "3.2.2",
   "description": "A filter-pushdown optimize-query-operation actor",
   "lsd:module": true,
   "license": "MIT",
@@ -37,12 +37,13 @@
     "build:components": "componentsjs-generator"
   },
   "dependencies": {
-    "@comunica/bus-optimize-query-operation": "^3.2.0",
-    "@comunica/core": "^3.2.0",
-    "@comunica/types": "^3.2.0",
+    "@comunica/bus-optimize-query-operation": "^3.2.1",
+    "@comunica/bus-query-operation": "^3.2.2",
+    "@comunica/core": "^3.2.1",
+    "@comunica/types": "^3.2.1",
     "@rdfjs/types": "*",
     "rdf-terms": "^1.11.0",
-    "sparqlalgebrajs": "^4.3.3"
+    "sparqlalgebrajs": "^4.3.7"
   },
-  "gitHead": "87baf2afed021a254859e64b92f34d9b51c6a7db"
+  "gitHead": "fbcc3a81f87738633ddf69ede5ca504236f7edd9"
 }