@eagleoutice/flowr 2.2.11 → 2.2.13

package/util/parallel.js

@@ -56,16 +56,18 @@ class LimitedThreadPool {
     skipped = [];
     currentlyRunning = new Set();
     reportingInterval = undefined;
+    timeLimitInMs;
     /**
    * Create a new parallel helper that runs the given `module` once for each list of {@link Arguments} in the `queue`.
    * The `limit` stops the execution if `<limit>` number of runs exited successfully.
    * The `parallel` parameter limits the number of parallel executions.
    */
-    constructor(module, queue, limit, parallel) {
+    constructor(module, queue, limit, parallel, timeLimitInMs) {
         this.workingQueue = queue;
         this.limit = limit;
         this.module = module;
         this.parallel = parallel;
+        this.timeLimitInMs = timeLimitInMs;
     }
     async run() {
         this.reportingInterval = setInterval(() => {
@@ -93,8 +95,15 @@ class LimitedThreadPool {
         console.log(`[${this.counter}/${this.limit}] Running next, currently running: ${this.currentlyRunning.size}, queue: ${this.workingQueue.length} [args: ${args.join(' ')}]`);
         const child = cp.fork(this.module, args);
         child.on('exit', this.onChildExit(args));
+        let timeout;
+        if (this.timeLimitInMs) {
+            timeout = setTimeout(() => {
+                log_1.log.error(`Killing child process with '${JSON.stringify(args)}' after ${this.timeLimitInMs}ms`);
+                child.kill();
+            }, this.timeLimitInMs);
+        }
         // schedule re-schedule
-        await new Promise(resolve => child.on('exit', resolve)).then(() => this.runNext());
+        await new Promise(resolve => child.on('exit', resolve)).then(() => clearTimeout(timeout)).then(() => this.runNext());
     }
     onChildExit(args) {
         return (code, signal) => {

package/util/prefix.d.ts

@@ -0,0 +1,13 @@
+/**
+ * given a potentially partial prefix like `hell`, this finds the matching name in the map, but only
+ * if it is unique!
+ *
+ * @example
+ * ```typescript
+ * findByPrefixIfUnique('hell', { 'hello', 'bar' }) // => 'hello'
+ * findByPrefixIfUnique('hell', { 'hello', 'hell' }) // => 'hell' (full match)
+ * findByPrefixIfUnique('h', { 'hello', 'hell' }) // => undefined (not unique)
+ * findByPrefixIfUnique('', { 'hello', 'hell' }) // => undefined (empty prefix)
+ * ```
+ */
+export declare function findByPrefixIfUnique(prefix: string, keys: readonly string[]): string | undefined;

package/util/prefix.js

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findByPrefixIfUnique = findByPrefixIfUnique;
+/**
+ * given a potentially partial prefix like `hell`, this finds the matching name in the map, but only
+ * if it is unique!
+ *
+ * @example
+ * ```typescript
+ * findByPrefixIfUnique('hell', { 'hello', 'bar' }) // => 'hello'
+ * findByPrefixIfUnique('hell', { 'hello', 'hell' }) // => 'hell' (full match)
+ * findByPrefixIfUnique('h', { 'hello', 'hell' }) // => undefined (not unique)
+ * findByPrefixIfUnique('', { 'hello', 'hell' }) // => undefined (empty prefix)
+ * ```
+ */
+function findByPrefixIfUnique(prefix, keys) {
+    if (prefix === '') {
+        return undefined;
+    }
+    let found = undefined;
+    for (const key of keys) {
+        if (key === prefix) {
+            return key;
+        }
+        if (key.startsWith(prefix)) {
+            if (found) {
+                return undefined;
+            }
+            found = key;
+        }
+    }
+    return found;
+}
+//# sourceMappingURL=prefix.js.map

package/util/quads.js

@@ -19,7 +19,7 @@ const namedNode = (v) => n3_1.DataFactory.namedNode(v);
 const quad = (s, p, o, g) => n3_1.DataFactory.quad(s, p, o, g);
 const objects_1 = require("./objects");
 const assert_1 = require("./assert");
-const defaultmap_1 = require("./defaultmap");
+const defaultmap_1 = require("./collections/defaultmap");
 const literal = (v, n) => n3_1.DataFactory.literal(v, n);
 const log_1 = require("./log");
 const domain = 'https://uni-ulm.de/r-ast/';

package/util/schema.d.ts

@@ -1,5 +1,5 @@
 import type Joi from 'joi';
-import type { OutputFormatter } from './ansi';
+import type { OutputFormatter } from './text/ansi';
 interface SchemaLine {
     level: number;
     text: string;

package/util/schema.js

@@ -4,7 +4,7 @@ exports.describeSchema = describeSchema;
 exports.genericDescription = genericDescription;
 exports.headerLine = headerLine;
 exports.describeObject = describeObject;
-const ansi_1 = require("./ansi");
+const ansi_1 = require("./text/ansi");
 function describeSchema(schema, f = ansi_1.formatter) {
     const description = schema.describe();
     const lines = genericDescription(1, f, f.format('.', { effect: ansi_1.ColorEffect.Foreground, color: 7 /* Colors.White */ }), description);

package/util/summarizer.js

@@ -4,7 +4,7 @@ exports.Summarizer = void 0;
 exports.summarizedMeasurement2Csv = summarizedMeasurement2Csv;
 exports.summarizedMeasurement2CsvHeader = summarizedMeasurement2CsvHeader;
 exports.summarizeMeasurement = summarizeMeasurement;
-const arrays_1 = require("./arrays");
+const arrays_1 = require("./collections/arrays");
 class Summarizer {
     config;
     log;

package/util/{text.js → text/text.js}

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.nth = nth;
-const assert_1 = require("./assert");
+const assert_1 = require("../assert");
 function nth(n) {
     (0, assert_1.guard)(isFinite(n) && n >= 1, 'n must be a non-negative number');
     const num = String(n);

package/util/{time.js → text/time.js}

@@ -13,7 +13,7 @@ function date2string(date = new Date()) {
 /**
  * Print a number of milliseconds in a human-readable format including correct spacing.
  */
-function printAsMs(ms, precision = 2) {
+function printAsMs(ms, precision = 1) {
     /* eslint-disable-next-line no-irregular-whitespace*/
     return `${ms.toFixed(precision)} ms`;
 }

package/util/version.js

@@ -3,7 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.flowrVersion = flowrVersion;
 const semver_1 = require("semver");
 // this is automatically replaced with the current version by release-it
-const version = '2.2.11';
+const version = '2.2.13';
 function flowrVersion() {
     return new semver_1.SemVer(version);
 }

package/dataflow/graph/diff.d.ts

@@ -1,36 +0,0 @@
-import type { DataflowGraph, FunctionArgument, OutgoingEdges } from './graph';
-import type { GenericDiffConfiguration, GenericDifferenceInformation, WriteableDifferenceReport } from '../../util/diff';
-import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
-interface ProblematicVertex {
-    tag: 'vertex';
-    id: NodeId;
-}
-interface ProblematicEdge {
-    tag: 'edge';
-    from: NodeId;
-    to: NodeId;
-}
-export type ProblematicDiffInfo = ProblematicVertex | ProblematicEdge;
-export declare class DataflowDifferenceReport implements WriteableDifferenceReport {
-    _comments: string[] | undefined;
-    _problematic: ProblematicDiffInfo[] | undefined;
-    addComment(comment: string, ...related: readonly ProblematicDiffInfo[]): void;
-    comments(): readonly string[] | undefined;
-    problematic(): readonly ProblematicDiffInfo[] | undefined;
-    isEqual(): boolean;
-}
-export interface NamedGraph {
-    name: string;
-    graph: DataflowGraph;
-}
-interface DataflowDiffContext extends GenericDifferenceInformation<DataflowDifferenceReport> {
-    left: DataflowGraph;
-    right: DataflowGraph;
-    config: GenericDiffConfiguration;
-}
-export declare function diffOfDataflowGraphs(left: NamedGraph, right: NamedGraph, config?: Partial<GenericDiffConfiguration>): DataflowDifferenceReport;
-export declare function equalFunctionArguments(fn: NodeId, a: false | readonly FunctionArgument[], b: false | readonly FunctionArgument[]): boolean;
-export declare function diffFunctionArguments(fn: NodeId, a: false | readonly FunctionArgument[], b: false | readonly FunctionArgument[], ctx: GenericDifferenceInformation<DataflowDifferenceReport>): void;
-export declare function diffVertices(ctx: DataflowDiffContext): void;
-export declare function diffEdges(ctx: DataflowDiffContext, id: NodeId, lEdges: OutgoingEdges | undefined, rEdges: OutgoingEdges | undefined): void;
-export {};

package/util/cfg/happens-before.d.ts

@@ -1,7 +0,0 @@
-import type { ControlFlowGraph } from './cfg';
-import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
-import { Ternary } from '../logic';
-/**
- * Determines if node `a` happens before node `b` in the control flow graph.
- */
-export declare function happensBefore(cfg: ControlFlowGraph, a: NodeId, b: NodeId): Ternary;

package/util/cfg/visitor.d.ts

@@ -1,9 +0,0 @@
-import type { ControlFlowGraph } from './cfg';
-import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
-/**
- * Visit all nodes reachable from the start node in the control flow graph, traversing the dependencies but ignoring cycles.
- * @param graph     - The control flow graph.
- * @param startNode - The node to start the traversal from.
- * @param visitor   - The visitor function to call for each node, if you return true the traversal from this node will be stopped.
- */
-export declare function visitInReverseOrder(graph: ControlFlowGraph, startNode: NodeId, visitor: (node: NodeId) => boolean | void): void;

package/util/cfg/visitor.js

@@ -1,30 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.visitInReverseOrder = visitInReverseOrder;
-/**
- * Visit all nodes reachable from the start node in the control flow graph, traversing the dependencies but ignoring cycles.
- * @param graph     - The control flow graph.
- * @param startNode - The node to start the traversal from.
- * @param visitor   - The visitor function to call for each node, if you return true the traversal from this node will be stopped.
- */
-function visitInReverseOrder(graph, startNode, 
-// eslint-disable-next-line @typescript-eslint/no-invalid-void-type -- void is used to indicate that the return value is ignored/we never stop
-visitor) {
-    const visited = new Set();
-    const queue = [startNode];
-    while (queue.length > 0) {
-        const current = queue.pop();
-        if (visited.has(current)) {
-            continue;
-        }
-        visited.add(current);
-        if (visitor(current)) {
-            continue;
-        }
-        const incoming = graph.outgoing(current) ?? [];
-        for (const [from] of incoming) {
-            queue.push(from);
-        }
-    }
-}
-//# sourceMappingURL=visitor.js.map

package/util/set.js

@@ -1,31 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.setEquals = setEquals;
-exports.setMinus = setMinus;
-/**
- * Given both sets, this checks if they contain the same elements.
- */
-function setEquals(a, b) {
-    if (a.size !== b.size) {
-        return false;
-    }
-    for (const item of a) {
-        if (!b.has(item)) {
-            return false;
-        }
-    }
-    return true;
-}
-/**
- * Returns `A – B`
- */
-function setMinus(a, b) {
-    const result = new Set();
-    for (const item of a) {
-        if (!b.has(item)) {
-            result.add(item);
-        }
-    }
-    return result;
-}
-//# sourceMappingURL=set.js.map