@eagleoutice/flowr 2.6.0 → 2.6.2

package/abstract-interpretation/domains/set-bounded-set-domain.js

@@ -1,164 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SetBoundedSetDomain = void 0;
-const set_1 = require("../../util/collections/set");
-const abstract_domain_1 = require("./abstract-domain");
-const lattice_1 = require("./lattice");
-/**
- * The set bounded set abstract domain as sets capturing possible values of the concrete set bounded by a `limit` for the maximum number of inferred values.
- * The Bottom element is defined as the{@link Bottom} and the Top element is defined as {@link Top} symbol.
- * @template T     - Type of the values in the abstract domain
- * @template Value - Type of the constraint in the abstract domain (Top, Bottom, or an actual value)
- */
-class SetBoundedSetDomain {
-    limit;
-    _value;
-    constructor(value, limit = abstract_domain_1.DEFAULT_INFERENCE_LIMIT) {
-        if (value !== lattice_1.Top && value !== lattice_1.Bottom) {
-            this._value = (value.size > limit ? lattice_1.Top : new Set(value));
-        }
-        else {
-            this._value = value;
-        }
-        this.limit = limit;
-    }
-    get value() {
-        return this._value;
-    }
-    static top(limit) {
-        return new SetBoundedSetDomain(lattice_1.Top, limit);
-    }
-    static bottom(limit) {
-        return new SetBoundedSetDomain(lattice_1.Bottom, limit);
-    }
-    static abstract(concrete, limit) {
-        if (concrete === lattice_1.Top) {
-            return SetBoundedSetDomain.top(limit);
-        }
-        else if (concrete.size === 0) {
-            return SetBoundedSetDomain.bottom(limit);
-        }
-        return new SetBoundedSetDomain(concrete.values().reduce((result, set) => result.union(set)), limit);
-    }
-    top() {
-        return SetBoundedSetDomain.top(this.limit);
-    }
-    bottom() {
-        return SetBoundedSetDomain.bottom(this.limit);
-    }
-    equals(other) {
-        return this.value === other.value || (this.isValue() && other.isValue() && (0, set_1.setEquals)(this.value, other.value));
-    }
-    leq(other) {
-        return this.value === lattice_1.Bottom || other.value === lattice_1.Top || (this.isValue() && other.isValue() && this.value.isSubsetOf(other.value));
-    }
-    join(...values) {
-        const result = new SetBoundedSetDomain(this.value, this.limit);
-        for (const other of values) {
-            if (result.value === lattice_1.Top || other.value === lattice_1.Top) {
-                result._value = lattice_1.Top;
-            }
-            else if (result.value === lattice_1.Bottom) {
-                result._value = other.value;
-            }
-            else if (other.value === lattice_1.Bottom) {
-                result._value = result.value;
-            }
-            else {
-                const join = result.value.union(other.value);
-                result._value = join.size > this.limit ? lattice_1.Top : join;
-            }
-        }
-        return result;
-    }
-    meet(...values) {
-        const result = new SetBoundedSetDomain(this.value, this.limit);
-        for (const other of values) {
-            if (result.value === lattice_1.Bottom || other.value === lattice_1.Bottom) {
-                result._value = lattice_1.Bottom;
-            }
-            else if (result.value === lattice_1.Top) {
-                result._value = other.value;
-            }
-            else if (other.value === lattice_1.Top) {
-                result._value = result.value;
-            }
-            else {
-                result._value = result.value.intersection(other.value);
-            }
-        }
-        return result;
-    }
-    /**
-     * Subtracts another abstract value from the current abstract value by removing all elements of the other abstract value from the current abstract value.
-     */
-    subtract(other) {
-        if (this.value === lattice_1.Top) {
-            return this.top();
-        }
-        else if (this.value === lattice_1.Bottom) {
-            return this.bottom();
-        }
-        else if (other.value === lattice_1.Top || other.value === lattice_1.Bottom) {
-            return new SetBoundedSetDomain(this.value, this.limit);
-        }
-        else {
-            return new SetBoundedSetDomain(this.value.difference(other.value), this.limit);
-        }
-    }
-    widen(other) {
-        if (this.value === lattice_1.Bottom) {
-            return new SetBoundedSetDomain(other.value, this.limit);
-        }
-        else if (other.value === lattice_1.Bottom) {
-            return new SetBoundedSetDomain(this.value, this.limit);
-        }
-        return other.leq(this) ? new SetBoundedSetDomain(this.value, this.limit) : this.top();
-    }
-    narrow(other) {
-        if (this.value === lattice_1.Bottom || other.value === lattice_1.Bottom) {
-            return this.bottom();
-        }
-        return this.isTop() ? other : this;
-    }
-    concretize(limit = abstract_domain_1.DEFAULT_INFERENCE_LIMIT) {
-        if (this.value === lattice_1.Bottom) {
-            return new Set();
-        }
-        else if (this.value === lattice_1.Top || 2 ** (this.value.size) > limit) {
-            return lattice_1.Top;
-        }
-        const subsets = [new Set()];
-        for (const element of this.value.values()) {
-            const newSubsets = subsets.map(subset => new Set([...subset, element]));
-            for (const subset of newSubsets) {
-                subsets.push(subset);
-            }
-        }
-        return new Set(subsets);
-    }
-    abstract(concrete) {
-        return SetBoundedSetDomain.abstract(concrete, this.limit);
-    }
-    toString() {
-        if (this.value === lattice_1.Top) {
-            return '⊤';
-        }
-        else if (this.value === lattice_1.Bottom) {
-            return '⊥';
-        }
-        const string = this.value.values().map(abstract_domain_1.domainElementToString).toArray().join(', ');
-        return `{${string}}`;
-    }
-    isTop() {
-        return this.value === lattice_1.Top;
-    }
-    isBottom() {
-        return this.value == lattice_1.Bottom;
-    }
-    isValue() {
-        return this.value !== lattice_1.Top && this.value !== lattice_1.Bottom;
-    }
-}
-exports.SetBoundedSetDomain = SetBoundedSetDomain;
-//# sourceMappingURL=set-bounded-set-domain.js.map

package/cli/repl/commands/repl-lineage.d.ts

@@ -1,15 +0,0 @@
-import type { ReplCommand } from './repl-main';
-import type { SingleSlicingCriterion } from '../../../slicing/criterion/parse';
-import type { NodeId } from '../../../r-bridge/lang-4.x/ast/model/processing/node-id';
-import type { DataflowGraph } from '../../../dataflow/graph/graph';
-import type { AstIdMap } from '../../../r-bridge/lang-4.x/ast/model/processing/decorate';
-/**
- * Get the lineage of a node in the dataflow graph
- *
- * @param criterion - The criterion to get the lineage of
- * @param graph - The dataflow graph to search in
- * @param idMap - The ID map to use for resolving the criterion (will default to that shipped with the dfgraph)
- * @returns The lineage of the node represented as a set of node ids
- */
-export declare function getLineage(criterion: SingleSlicingCriterion, graph: DataflowGraph, idMap?: AstIdMap): Set<NodeId>;
-export declare const lineageCommand: ReplCommand;

package/cli/repl/commands/repl-lineage.js

@@ -1,67 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.lineageCommand = void 0;
-exports.getLineage = getLineage;
-const default_pipelines_1 = require("../../../core/steps/pipeline/default-pipelines");
-const retriever_1 = require("../../../r-bridge/retriever");
-const parse_1 = require("../../../slicing/criterion/parse");
-const edge_1 = require("../../../dataflow/graph/edge");
-const assert_1 = require("../../../util/assert");
-function splitAt(str, idx) {
-    return [str.slice(0, idx), str.slice(idx)];
-}
-async function getDfg(config, parser, remainingLine) {
-    return await (0, default_pipelines_1.createDataflowPipeline)(parser, {
-        request: (0, retriever_1.requestFromInput)(remainingLine.trim())
-    }, config).allRemainingSteps();
-}
-function filterRelevantEdges(edge) {
-    return (0, edge_1.edgeIncludesType)(edge_1.EdgeType.DefinedBy | edge_1.EdgeType.DefinedByOnCall | edge_1.EdgeType.Returns | edge_1.EdgeType.Reads, edge.types);
-}
-function pushRelevantEdges(queue, outgoingEdges) {
-    queue.push(...[...outgoingEdges].filter(([_, edge]) => filterRelevantEdges(edge)));
-}
-/**
- * Get the lineage of a node in the dataflow graph
- *
- * @param criterion - The criterion to get the lineage of
- * @param graph - The dataflow graph to search in
- * @param idMap - The ID map to use for resolving the criterion (will default to that shipped with the dfgraph)
- * @returns The lineage of the node represented as a set of node ids
- */
-function getLineage(criterion, graph, idMap) {
-    idMap ??= graph.idMap;
-    (0, assert_1.guard)(idMap !== undefined, 'The ID map is required to get the lineage of a node');
-    const src = graph.get((0, parse_1.slicingCriterionToId)(criterion, idMap));
-    (0, assert_1.guard)(src !== undefined, 'The ID pointed to by the criterion does not exist in the dataflow graph');
-    const [vertex, outgoingEdges] = src;
-    const result = new Set([vertex.id]);
-    const edgeQueue = [];
-    pushRelevantEdges(edgeQueue, outgoingEdges);
-    while (edgeQueue.length > 0) {
-        const [target] = edgeQueue.shift();
-        if (result.has(target)) {
-            continue;
-        }
-        result.add(target);
-        const outgoingEdges = graph.outgoingEdges(target);
-        if (outgoingEdges !== undefined) {
-            pushRelevantEdges(edgeQueue, outgoingEdges);
-        }
-    }
-    return result;
-}
-exports.lineageCommand = {
-    description: 'Get the lineage of an R object',
-    usesAnalyzer: false,
-    usageExample: ':lineage',
-    aliases: ['lin'],
-    script: false,
-    fn: async ({ output, parser, remainingLine, config }) => {
-        const [criterion, rest] = splitAt(remainingLine, remainingLine.indexOf(' '));
-        const { dataflow: dfg } = await getDfg(config, parser, rest);
-        const lineageIds = getLineage(criterion, dfg.graph);
-        output.stdout([...lineageIds].join('\n'));
-    }
-};
-//# sourceMappingURL=repl-lineage.js.map

package/cli/repl/server/messages/message-lineage.d.ts

@@ -1,17 +0,0 @@
-import type { SingleSlicingCriterion } from '../../../../slicing/criterion/parse';
-import type { IdMessageBase, MessageDefinition } from './all-messages';
-import type { NodeId } from '../../../../r-bridge/lang-4.x/ast/model/processing/node-id';
-export interface LineageRequestMessage extends IdMessageBase {
-    type: 'request-lineage';
-    /** The {@link FileAnalysisRequestMessage#filetoken} of the file/data */
-    filetoken: string;
-    /** The criterion to start the lineage from */
-    criterion: SingleSlicingCriterion;
-}
-export declare const requestLineageMessage: MessageDefinition<LineageRequestMessage>;
-export interface LineageResponseMessage extends IdMessageBase {
-    type: 'response-lineage';
-    /** The lineage of the given criterion. With this being the representation of a set, there is no guarantee about order. */
-    lineage: NodeId[];
-}
-export declare const responseLineageMessage: MessageDefinition<LineageResponseMessage>;

package/cli/repl/server/messages/message-lineage.js

@@ -1,25 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.responseLineageMessage = exports.requestLineageMessage = void 0;
-const joi_1 = __importDefault(require("joi"));
-exports.requestLineageMessage = {
-    type: 'request-lineage',
-    schema: joi_1.default.object({
-        type: joi_1.default.string().valid('request-lineage').required().description('The type of the message.'),
-        id: joi_1.default.string().optional().description('If you give the id, the response will be sent to the client with the same id.'),
-        filetoken: joi_1.default.string().required().description('The filetoken of the file/data retrieved from the analysis request.'),
-        criterion: joi_1.default.string().required().description('The criterion to start the lineage from.')
-    })
-};
-exports.responseLineageMessage = {
-    type: 'response-lineage',
-    schema: joi_1.default.object({
-        type: joi_1.default.string().valid('response-lineage').required(),
-        id: joi_1.default.string().optional().description('The id of the message, will be the same for the request.'),
-        lineage: joi_1.default.array().items(joi_1.default.string()).required().description('The lineage of the given criterion.')
-    })
-};
-//# sourceMappingURL=message-lineage.js.map

package/queries/catalog/lineage-query/lineage-query-executor.d.ts

@@ -1,3 +0,0 @@
-import type { LineageQuery, LineageQueryResult } from './lineage-query-format';
-import type { BasicQueryData } from '../../base-query-format';
-export declare function executeLineageQuery({ analyzer }: BasicQueryData, queries: readonly LineageQuery[]): Promise<LineageQueryResult>;

package/queries/catalog/lineage-query/lineage-query-executor.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.executeLineageQuery = executeLineageQuery;
-const log_1 = require("../../../util/log");
-const repl_lineage_1 = require("../../../cli/repl/commands/repl-lineage");
-async function executeLineageQuery({ analyzer }, queries) {
-    const start = Date.now();
-    const result = {};
-    for (const { criterion } of queries) {
-        if (result[criterion]) {
-            log_1.log.warn('Duplicate criterion in lineage query:', criterion);
-        }
-        result[criterion] = (0, repl_lineage_1.getLineage)(criterion, (await analyzer.dataflow()).graph, (await analyzer.normalize()).idMap);
-    }
-    return {
-        '.meta': {
-            timing: Date.now() - start
-        },
-        lineages: result
-    };
-}
-//# sourceMappingURL=lineage-query-executor.js.map

package/queries/catalog/lineage-query/lineage-query-format.d.ts

@@ -1,22 +0,0 @@
-import type { BaseQueryFormat, BaseQueryResult } from '../../base-query-format';
-import type { SingleSlicingCriterion } from '../../../slicing/criterion/parse';
-import type { NodeId } from '../../../r-bridge/lang-4.x/ast/model/processing/node-id';
-import Joi from 'joi';
-import { executeLineageQuery } from './lineage-query-executor';
-/**
- * Calculates the lineage of the given criterion.
- */
-export interface LineageQuery extends BaseQueryFormat {
-    readonly type: 'lineage';
-    readonly criterion: SingleSlicingCriterion;
-}
-export interface LineageQueryResult extends BaseQueryResult {
-    /** Maps each criterion to the found lineage, duplicates are ignored. */
-    readonly lineages: Record<SingleSlicingCriterion, Set<NodeId>>;
-}
-export declare const LineageQueryDefinition: {
-    readonly executor: typeof executeLineageQuery;
-    readonly asciiSummarizer: (formatter: import("../../../util/text/ansi").OutputFormatter, _analyzer: import("../../../project/flowr-analyzer").FlowrAnalysisProvider, queryResults: BaseQueryResult, result: string[]) => true;
-    readonly schema: Joi.ObjectSchema<any>;
-    readonly flattenInvolvedNodes: (queryResults: BaseQueryResult) => NodeId[];
-};

package/queries/catalog/lineage-query/lineage-query-format.js

@@ -1,31 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LineageQueryDefinition = void 0;
-const ansi_1 = require("../../../util/text/ansi");
-const time_1 = require("../../../util/text/time");
-const joi_1 = __importDefault(require("joi"));
-const lineage_query_executor_1 = require("./lineage-query-executor");
-const query_print_1 = require("../../query-print");
-exports.LineageQueryDefinition = {
-    executor: lineage_query_executor_1.executeLineageQuery,
-    asciiSummarizer: (formatter, _analyzer, queryResults, result) => {
-        const out = queryResults;
-        result.push(`Query: ${(0, ansi_1.bold)('lineage', formatter)} (${(0, time_1.printAsMs)(out['.meta'].timing, 0)})`);
-        for (const [criteria, lineage] of Object.entries(out.lineages)) {
-            result.push(`   ╰ ${criteria}: {${(0, query_print_1.summarizeIdsIfTooLong)(formatter, [...lineage])}}`);
-        }
-        return true;
-    },
-    schema: joi_1.default.object({
-        type: joi_1.default.string().valid('lineage').required().description('The type of the query.'),
-        criterion: joi_1.default.string().required().description('The slicing criterion of the node to get the lineage of.')
-    }).description('Lineage query used to find the lineage of a node in the dataflow graph'),
-    flattenInvolvedNodes: (queryResults) => {
-        const out = queryResults;
-        return Object.values(out.lineages).flatMap(lineage => [...lineage]);
-    }
-};
-//# sourceMappingURL=lineage-query-format.js.map