@eagleoutice/flowr - v2.15.8
    Preparing search index...
    interface DataflowTestConfiguration {
        addFiles: FlowrFileProvider<{ toString(): string }>[];
        assumeLoaded?: readonly string[];
        context: "dataflow" | "call-graph";
        expectedOutput: string | RegExp;
        expectedSliceOutput: string | RegExp;
        expectIsSubgraph: boolean;
        minRVersion: string | undefined;
        modifyAnalyzer: (
            analyzer: FlowrAnalyzer,
        ) => void | FlowrAnalyzer<KnownParser> | undefined;
        mustNotHaveEdges: [NodeId, NodeId][];
        mustNotHaveVertices: Set<NodeId>;
        needsNetworkConnection: boolean;
        resolveIdsAsCriterion: boolean;
        trimOutput: boolean;
        [key: string]: unknown;
    }

    Hierarchy (View Summary)

    Indexable

    • [key: string]: unknown
    Index
    addFiles: FlowrFileProvider<{ toString(): string }>[]

    Which files to add to the project context

    assumeLoaded?: readonly string[]

    Packages this test's code may use without writing the library() call itself, as solver.assumeAttachedPackages states them.

    context: "dataflow" | "call-graph"

    Whether to test the call graph instead of the dataflow graph

    expectedOutput: string | RegExp

    HANDLE WITH UTTER CARE! Will run in an R-Shell on the host system!

    expectedSliceOutput: string | RegExp

    What the reconstructed slice has to print when it runs. HANDLE WITH UTTER CARE! Will run in an R-Shell on the host system!

    expectIsSubgraph: boolean

    Specify just a subset of what the dataflow graph will actually be.

    minRVersion: string | undefined

    the (inclusive) minimum version of R required to run this test, e.g., MIN_VERSION_PIPE

    modifyAnalyzer: (
        analyzer: FlowrAnalyzer,
    ) => void | FlowrAnalyzer<KnownParser> | undefined

    Allows you to modify the analyzer before running the test (assumes side-effects and reuses the same object if you return undefined).

    mustNotHaveEdges: [NodeId, NodeId][]

    The collection of edges that should not exist, if criterias are enabled, these can be slicing criteria

    mustNotHaveVertices: Set<NodeId>

    The collection of vertex ids that should not exist

    needsNetworkConnection: boolean
    resolveIdsAsCriterion: boolean

    Before comparing, resolve every NodeId in the expected graph as if it were a slicing criterion (e.g. 12@a). Still a work in progress.

    trimOutput: boolean