@eagleoutice/flowr 2.2.11 → 2.2.12

package/dataflow/environments/overwrite.js

@@ -4,6 +4,7 @@ exports.overwriteIEnvironmentWith = overwriteIEnvironmentWith;
 exports.overwriteEnvironment = overwriteEnvironment;
 const assert_1 = require("../../util/assert");
 const environment_1 = require("./environment");
+const log_1 = require("../../util/log");
 function anyIsMaybeOrEmpty(values) {
     if (values.length === 0) {
         return true;
@@ -19,6 +20,9 @@ function overwriteIEnvironmentWith(base, next, includeParent = true, applyCds) {
     (0, assert_1.guard)(base !== undefined && next !== undefined, 'can not overwrite environments with undefined');
     const map = new Map(base.memory);
     for (const [key, values] of next.memory) {
+        if (values.length > 1_000_000) {
+            log_1.log.warn(`Overwriting environment with ${values.length} definitions for ${key}`);
+        }
         const hasMaybe = applyCds?.length === 0 || applyCds !== undefined ? true : anyIsMaybeOrEmpty(values);
         if (hasMaybe) {
             const old = map.get(key);

package/dataflow/environments/remove.d.ts

@@ -0,0 +1,6 @@
+import type { REnvironmentInformation } from './environment';
+import type { Identifier } from './identifier';
+/**
+ * Removes all definitions of a given name from the environment.
+ */
+export declare function remove(name: Identifier, environment: REnvironmentInformation): REnvironmentInformation;

package/dataflow/environments/remove.js

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.remove = remove;
+const environment_1 = require("./environment");
+const info_1 = require("../info");
+/**
+ * Removes all definitions of a given name from the environment.
+ */
+function remove(name, environment) {
+    let current = environment.current;
+    do {
+        const definition = current.memory.get(name);
+        if (definition !== undefined) {
+            current.memory.delete(name);
+            if (definition.every(d => (0, info_1.happensInEveryBranch)(d.controlDependencies))) {
+                break;
+            }
+        }
+        current = current.parent;
+    } while (current.id !== environment_1.BuiltInEnvironment.id);
+    // we never remove built ins
+    return environment;
+}
+//# sourceMappingURL=remove.js.map

package/dataflow/environments/resolve-by-name.js

@@ -58,7 +58,7 @@ function resolveByName(name, environment, target = identifier_1.ReferenceType.Un
             }
             else if (filtered.length > 0) {
                 definitions ??= [];
-                definitions.push(...filtered);
+                definitions = definitions.concat(filtered);
             }
         }
         current = current.parent;

package/dataflow/graph/dataflowgraph-builder.d.ts

@@ -6,6 +6,9 @@ import type { REnvironmentInformation } from '../environments/environment';
 import type { DataflowGraphVertexUse } from './vertex';
 import type { ControlDependency } from '../info';
 import type { LinkTo } from '../../queries/catalog/call-context-query/call-context-query-format';
+import type { FlowrSearchLike } from '../../search/flowr-search-builder';
+import type { Pipeline } from '../../core/steps/pipeline/pipeline';
+import type { FlowrSearchInput } from '../../search/flowr-search';
 export declare function emptyGraph(idMap?: AstIdMap): DataflowGraphBuilder;
 export type DataflowGraphEdgeTarget = NodeId | (readonly NodeId[]);
 /**
@@ -82,8 +85,9 @@ export declare class DataflowGraphBuilder extends DataflowGraph {
         controlDependencies?: ControlDependency[];
     }, asRoot?: boolean): this;
     private edgeHelper;
+    private queryHelper;
     /**
-     * Adds a **read edge** (E1).
+     * Adds a **read edge**.
      *
      * @param from - NodeId of the source vertex
      * @param to   - Either a single or multiple target ids.
@@ -91,30 +95,62 @@ export declare class DataflowGraphBuilder extends DataflowGraph {
      */
     reads(from: NodeId, to: DataflowGraphEdgeTarget): this;
     /**
-     * Adds a **defined-by edge** (E2), with from as defined variable, and to
+     * Adds a **read edge** with a query for the from and/or to vertices.
+     *
+     * @param from - Either a node id or a query to find the node id.
+     * @param to - Either a node id or a query to find the node id.
+     * @param data - The data to search in i.e. the dataflow graph.
+     */
+    readsQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
+    /**
+     * Adds a **defined-by edge** with from as defined variable, and to
      * as a variable/function contributing to its definition.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     definedBy(from: NodeId, to: DataflowGraphEdgeTarget): this;
     /**
-     * Adds a **call edge** (E5) with from as caller, and to as callee.
+     * Adds a **defined-by edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    definedByQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
+    /**
+     * Adds a **call edge** with from as caller, and to as callee.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     calls(from: NodeId, to: DataflowGraphEdgeTarget): this;
     /**
-     * Adds a **return edge** (E6) with from as function, and to as exit point.
+     * Adds a **call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    callsQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
+    /**
+     * Adds a **return edge** with from as function, and to as exit point.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     returns(from: NodeId, to: DataflowGraphEdgeTarget): this;
     /**
-     * Adds a **defines-on-call edge** (E7) with from as variable, and to as its definition
+     * Adds a **return edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    returnsQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
+    /**
+     * Adds a **defines-on-call edge** with from as variable, and to as its definition
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     definesOnCall(from: NodeId, to: DataflowGraphEdgeTarget): this;
+    /**
+     * Adds a **defines-on-call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    definesOnCallQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
     /**
      * Adds a **defined-by-on-call edge** with from as definition, and to as variable.
      *
@@ -122,23 +158,47 @@ export declare class DataflowGraphBuilder extends DataflowGraph {
      */
     definedByOnCall(from: NodeId, to: DataflowGraphEdgeTarget): this;
     /**
-     * Adds an **argument edge** (E9) with from as function call, and to as argument.
+     * Adds a **defined-by-on-call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    definedByOnCallQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
+    /**
+     * Adds an **argument edge** with from as function call, and to as argument.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     argument(from: NodeId, to: DataflowGraphEdgeTarget): this;
+    /**
+     * Adds a **argument edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    argumentQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
     /**
      * Adds a **non-standard evaluation edge** with from as vertex, and to as vertex.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     nse(from: NodeId, to: DataflowGraphEdgeTarget): this;
+    /**
+     * Adds a **non-standard evaluation edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    nseQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
     /**
      * Adds a **side-effect-on-call edge** with from as vertex, and to as vertex.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     sideEffectOnCall(from: NodeId, to: DataflowGraphEdgeTarget): this;
+    /**
+     * Adds a **side-effect-on-call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    sideEffectOnCallQuery<P extends Pipeline>(from: FromQueryParam, to: ToQueryParam, data: FlowrSearchInput<P>): this;
     /**
      * explicitly overwrite the root ids of the graph,
      * this is just an easier variant in case you working with a lot of functions this saves you a lot of `false` flags.
@@ -146,3 +206,13 @@ export declare class DataflowGraphBuilder extends DataflowGraph {
     overwriteRootIds(ids: readonly NodeId[]): this;
 }
 export declare function getBuiltInSideEffect(name: string): LinkTo<RegExp> | undefined;
+interface Query {
+    query: FlowrSearchLike;
+}
+type FromQueryParam = {
+    nodeId: NodeId;
+} | Query;
+type ToQueryParam = {
+    target: DataflowGraphEdgeTarget;
+} | Query;
+export {};

package/dataflow/graph/dataflowgraph-builder.js

@@ -12,6 +12,8 @@ const r_function_call_1 = require("../../r-bridge/lang-4.x/ast/model/nodes/r-fun
 const built_in_1 = require("../environments/built-in");
 const edge_1 = require("./edge");
 const default_builtin_config_1 = require("../environments/default-builtin-config");
+const flowr_search_executor_1 = require("../../search/flowr-search-executor");
+const assert_1 = require("../../util/assert");
 function emptyGraph(idMap) {
     return new DataflowGraphBuilder(idMap);
 }
@@ -170,8 +172,28 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
         }
         return this.addEdge((0, node_id_1.normalizeIdToNumberIfPossible)(from), (0, node_id_1.normalizeIdToNumberIfPossible)(to), type);
     }
+    queryHelper(from, to, data, type) {
+        let fromId;
+        if ('nodeId' in from) {
+            fromId = from.nodeId;
+        }
+        else {
+            const result = (0, flowr_search_executor_1.runSearch)(from.query, data);
+            (0, assert_1.guard)(result.length === 1, `from query result should yield exactly one node, but yielded ${result.length}`);
+            fromId = result[0].node.info.id;
+        }
+        let toIds;
+        if ('target' in to) {
+            toIds = to.target;
+        }
+        else {
+            const result = (0, flowr_search_executor_1.runSearch)(to.query, data);
+            toIds = result.map(r => r.node.info.id);
+        }
+        return this.edgeHelper(fromId, toIds, type);
+    }
     /**
-     * Adds a **read edge** (E1).
+     * Adds a **read edge**.
      *
      * @param from - NodeId of the source vertex
      * @param to   - Either a single or multiple target ids.
@@ -181,7 +203,17 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
         return this.edgeHelper(from, to, edge_1.EdgeType.Reads);
     }
     /**
-     * Adds a **defined-by edge** (E2), with from as defined variable, and to
+     * Adds a **read edge** with a query for the from and/or to vertices.
+     *
+     * @param from - Either a node id or a query to find the node id.
+     * @param to - Either a node id or a query to find the node id.
+     * @param data - The data to search in i.e. the dataflow graph.
+     */
+    readsQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.Reads);
+    }
+    /**
+     * Adds a **defined-by edge** with from as defined variable, and to
      * as a variable/function contributing to its definition.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
@@ -190,7 +222,15 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
         return this.edgeHelper(from, to, edge_1.EdgeType.DefinedBy);
     }
     /**
-     * Adds a **call edge** (E5) with from as caller, and to as callee.
+     * Adds a **defined-by edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    definedByQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.DefinedBy);
+    }
+    /**
+     * Adds a **call edge** with from as caller, and to as callee.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
@@ -198,7 +238,15 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
         return this.edgeHelper(from, to, edge_1.EdgeType.Calls);
     }
     /**
-     * Adds a **return edge** (E6) with from as function, and to as exit point.
+     * Adds a **call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    callsQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.Calls);
+    }
+    /**
+     * Adds a **return edge** with from as function, and to as exit point.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
@@ -206,13 +254,29 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
         return this.edgeHelper(from, to, edge_1.EdgeType.Returns);
     }
     /**
-     * Adds a **defines-on-call edge** (E7) with from as variable, and to as its definition
+     * Adds a **return edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    returnsQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.Returns);
+    }
+    /**
+     * Adds a **defines-on-call edge** with from as variable, and to as its definition
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     definesOnCall(from, to) {
         return this.edgeHelper(from, to, edge_1.EdgeType.DefinesOnCall);
     }
+    /**
+     * Adds a **defines-on-call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    definesOnCallQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.DefinesOnCall);
+    }
     /**
      * Adds a **defined-by-on-call edge** with from as definition, and to as variable.
      *
@@ -222,13 +286,29 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
         return this.edgeHelper(from, to, edge_1.EdgeType.DefinedByOnCall);
     }
     /**
-     * Adds an **argument edge** (E9) with from as function call, and to as argument.
+     * Adds a **defined-by-on-call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    definedByOnCallQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.DefinedByOnCall);
+    }
+    /**
+     * Adds an **argument edge** with from as function call, and to as argument.
      *
      * @see {@link DataflowGraphBuilder#reads|reads} for parameters.
      */
     argument(from, to) {
         return this.edgeHelper(from, to, edge_1.EdgeType.Argument);
     }
+    /**
+     * Adds a **argument edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    argumentQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.Argument);
+    }
     /**
      * Adds a **non-standard evaluation edge** with from as vertex, and to as vertex.
      *
@@ -237,6 +317,14 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
     nse(from, to) {
         return this.edgeHelper(from, to, edge_1.EdgeType.NonStandardEvaluation);
     }
+    /**
+     * Adds a **non-standard evaluation edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    nseQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.NonStandardEvaluation);
+    }
     /**
      * Adds a **side-effect-on-call edge** with from as vertex, and to as vertex.
      *
@@ -245,6 +333,14 @@ class DataflowGraphBuilder extends graph_1.DataflowGraph {
     sideEffectOnCall(from, to) {
         return this.edgeHelper(from, to, edge_1.EdgeType.SideEffectOnCall);
     }
+    /**
+     * Adds a **side-effect-on-call edge** with a query for the from and/or to vertices.
+     *
+     * @see {@link DataflowGraphBuilder#readsQuery|readsQuery} for parameters.
+     */
+    sideEffectOnCallQuery(from, to, data) {
+        return this.queryHelper(from, to, data, edge_1.EdgeType.SideEffectOnCall);
+    }
     /**
      * explicitly overwrite the root ids of the graph,
      * this is just an easier variant in case you working with a lot of functions this saves you a lot of `false` flags.

package/dataflow/graph/graph.d.ts

@@ -2,7 +2,7 @@ import type { DataflowGraphEdge, EdgeType } from './edge';
 import type { DataflowInformation } from '../info';
 import type { DataflowGraphVertexArgument, DataflowGraphVertexFunctionCall, DataflowGraphVertexInfo } from './vertex';
 import { EmptyArgument } from '../../r-bridge/lang-4.x/ast/model/nodes/r-function-call';
-import type { IdentifierDefinition, IdentifierReference } from '../environments/identifier';
+import type { Identifier, IdentifierDefinition, IdentifierReference } from '../environments/identifier';
 import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
 import type { AstIdMap } from '../../r-bridge/lang-4.x/ast/model/processing/decorate';
 import type { LinkTo } from '../../queries/catalog/call-context-query/call-context-query-format';
@@ -219,4 +219,9 @@ export declare class DataflowGraph<Vertex extends DataflowGraphVertexInfo = Data
      */
     static fromJson(data: DataflowGraphJson): DataflowGraph;
 }
+export interface IEnvironmentJson {
+    readonly id: number;
+    parent: IEnvironmentJson;
+    memory: Record<Identifier, IdentifierDefinition[]>;
+}
 export {};

package/dataflow/graph/graph.js

@@ -335,6 +335,11 @@ class DataflowGraph {
         const graph = new DataflowGraph(undefined);
         graph.rootVertices = new Set(data.rootVertices);
         graph.vertexInformation = new Map(data.vertexInformation);
+        for (const [, vertex] of graph.vertexInformation) {
+            if (vertex.environment) {
+                vertex.environment = renvFromJson(vertex.environment);
+            }
+        }
         graph.edgeInformation = new Map(data.edgeInformation.map(([id, edges]) => [id, new Map(edges)]));
         if (data.sourced) {
             graph._sourced = data.sourced;
@@ -368,4 +373,23 @@ function extractEdgeIds(from, to) {
     const toId = typeof to === 'object' ? to.nodeId : to;
     return [fromId, toId];
 }
+function envFromJson(json) {
+    const parent = json.parent ? envFromJson(json.parent) : undefined;
+    const memory = new Map();
+    for (const [key, value] of Object.entries(json.memory)) {
+        memory.set(key, value);
+    }
+    return {
+        id: json.id,
+        parent: parent,
+        memory
+    };
+}
+function renvFromJson(json) {
+    const current = envFromJson(json.current);
+    return {
+        current,
+        level: json.level
+    };
+}
 //# sourceMappingURL=graph.js.map

package/dataflow/graph/vertex.d.ts

@@ -14,6 +14,36 @@ export declare const ValidVertexTypes: Set<string>;
 export declare const ValidVertexTypeReverse: {
     [k: string]: string;
 };
+/**
+ * Identifier for arguments e.g. for `3` in `c(2, 3, 5)` the identifier would be
+ * ```ts
+ * {
+ *   index: 2
+ * }
+ * ```
+ */
+export interface UnnamedArgumentId {
+    readonly index: number;
+}
+/**
+ * Identifier for named arguments e.g. for `age` in `list(name = 'John', age = 8)`
+ * the indentifier would be
+ * ```ts
+ * {
+ *   index: 2,
+ *   lexeme: 'age'
+ * }
+ * ```
+ */
+export interface NamedArgumentId {
+    /**
+     * Index may be undefined, when no index information is available.
+     */
+    readonly index: number | undefined;
+    readonly lexeme: string;
+}
+export declare function isNamedArgumentId(identifier: IndexIdentifier): identifier is NamedArgumentId;
+export type IndexIdentifier = UnnamedArgumentId | NamedArgumentId;
 /**
  * A single index of a container, which is not a container itself.
  *
@@ -21,9 +51,9 @@ export declare const ValidVertexTypeReverse: {
  */
 export interface ContainerLeafIndex {
     /**
-     * Distinctive lexeme of index e.g. 'name' for `list(name = 'John')`
+     * Distinctive identifier of index, see {@link IndexIdentifier}.
      */
-    readonly lexeme: string;
+    readonly identifier: IndexIdentifier;
     /**
      * NodeId of index in graph.
      */
@@ -48,6 +78,16 @@ export declare function isParentContainerIndex(index: ContainerIndex): index is
  * A single index of a container.
  */
 export type ContainerIndex = ContainerLeafIndex | ContainerParentIndex;
+/**
+ * Checks whether {@link index} is accessed by {@link accessLexeme}.
+ *
+ * @param index - The {@link ContainerIndex}, which is accessed
+ * @param accessLexeme - The access lexeme
+ * @param isIndexBasedAccess - Whether the index of the {@link ContainerIndex} is accessed i.e. the position in the container and not e.g. the name of the index
+ * @returns true, when {@link accessLexeme} accesses the {@link index}, false otherwise
+ */
+export declare function isAccessed(index: ContainerIndex, accessLexeme: string, isIndexBasedAccess: boolean): boolean;
+export declare function isSameIndex(a: ContainerIndex, b: ContainerIndex): boolean;
 /**
  * List of indices of a single statement like `list(a=3, b=2)`
  */

package/dataflow/graph/vertex.js

@@ -1,7 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ValidVertexTypeReverse = exports.ValidVertexTypes = exports.VertexType = void 0;
+exports.isNamedArgumentId = isNamedArgumentId;
 exports.isParentContainerIndex = isParentContainerIndex;
+exports.isAccessed = isAccessed;
+exports.isSameIndex = isSameIndex;
 exports.isValueVertex = isValueVertex;
 exports.isUseVertex = isUseVertex;
 exports.isFunctionCallVertex = isFunctionCallVertex;
@@ -17,9 +20,38 @@ var VertexType;
 })(VertexType || (exports.VertexType = VertexType = {}));
 exports.ValidVertexTypes = new Set(Object.values(VertexType));
 exports.ValidVertexTypeReverse = Object.fromEntries(Object.entries(VertexType).map(([k, v]) => [v, k]));
+function isNamedArgumentId(identifier) {
+    return 'lexeme' in identifier;
+}
 function isParentContainerIndex(index) {
     return 'subIndices' in index;
 }
+/**
+ * Checks whether {@link index} is accessed by {@link accessLexeme}.
+ *
+ * @param index - The {@link ContainerIndex}, which is accessed
+ * @param accessLexeme - The access lexeme
+ * @param isIndexBasedAccess - Whether the index of the {@link ContainerIndex} is accessed i.e. the position in the container and not e.g. the name of the index
+ * @returns true, when {@link accessLexeme} accesses the {@link index}, false otherwise
+ */
+function isAccessed(index, accessLexeme, isIndexBasedAccess) {
+    if (isIndexBasedAccess) {
+        return index.identifier.index === Number(accessLexeme);
+    }
+    if (isNamedArgumentId(index.identifier)) {
+        return index.identifier.lexeme === accessLexeme;
+    }
+    return false;
+}
+function isSameIndex(a, b) {
+    if (isNamedArgumentId(a.identifier) && isNamedArgumentId(b.identifier)) {
+        return a.identifier.lexeme === b.identifier.lexeme;
+    }
+    if (a.identifier.index === undefined || b.identifier.index === undefined) {
+        return false;
+    }
+    return a.identifier.index === b.identifier.index;
+}
 /**
  * Check if the given vertex is a {@link DataflowGraphVertexValue|value vertex}.
  */

package/dataflow/internal/linker.js

@@ -23,6 +23,7 @@ const vertex_1 = require("../graph/vertex");
 const resolve_by_name_1 = require("../environments/resolve-by-name");
 const built_in_1 = require("../environments/built-in");
 const static_slicer_1 = require("../../slicing/static/static-slicer");
+const prefix_1 = require("../../util/prefix");
 function findNonLocalReads(graph, ignore) {
     const ignores = new Set(ignore.map(i => i.nodeId));
     const ids = new Set([...graph.vertices(true)]
@@ -80,7 +81,8 @@ function linkArgumentsOnCall(args, params, graph) {
     const matchedParameters = new Set();
     // first map names
     for (const [name, arg] of nameArgMap) {
-        const param = nameParamMap.get(name);
+        const pmatchName = (0, prefix_1.findByPrefixIfUnique)(name, [...nameParamMap.keys()]) ?? name;
+        const param = nameParamMap.get(pmatchName);
         if (param !== undefined) {
             logger_1.dataflowLogger.trace(`mapping named argument "${name}" to parameter "${param.name.content}"`);
             graph.addEdge(arg.nodeId, param.name.info.id, edge_1.EdgeType.DefinesOnCall);

package/dataflow/internal/process/functions/call/built-in/built-in-access.d.ts

@@ -19,3 +19,4 @@ import type { ForceArguments } from '../common';
 export declare function processAccess<OtherInfo>(name: RSymbol<OtherInfo & ParentInformation>, args: readonly RFunctionArgument<OtherInfo & ParentInformation>[], rootId: NodeId, data: DataflowProcessorInformation<OtherInfo & ParentInformation>, config: {
     treatIndicesAsString: boolean;
 } & ForceArguments): DataflowInformation;
+export declare function symbolArgumentsToStrings<OtherInfo>(args: readonly RFunctionArgument<OtherInfo & ParentInformation>[], firstIndexInclusive?: number, lastIndexInclusive?: number): RFunctionArgument<OtherInfo & ParentInformation>[];