@grepr/cli 1.1.4 → 1.2.0

package/build/dist/lib/job-graph-transformer.js

@@ -0,0 +1,497 @@
+/**
+ * Job graph transformation utilities for converting production jobs to test configurations.
+ *
+ * This module provides functions to transform a production job definition into a test job
+ * by replacing sources, sinks, and adding test-specific tagging. The transformations are
+ * purely functional - they do not make any API calls or create resources.
+ *
+ * Key transformations:
+ * - Source replacement: Replace vendor sources with dataset queries or keep originals with limits
+ * - Sink replacement: Replace vendor sinks with synchronous test sinks or test dataset sinks
+ * - Test tagging: Add test run ID and sink name tags to track test data
+ *
+ * The transformed job can then be executed using the standard job:create command.
+ */
+import { DEFAULT_INPUT, DEFAULT_OUTPUT, JobExecution, JobProcessing, Vertex, DEFAULT_LIMIT } from '../types.js';
+import { LogsIcebergTableSourceType, LogsSynchronousSinkType, LogsIcebergTableSinkType, LogTransformActionType, DatadogQueryPredicateType, TagActionModification, TagActionType, LogsValuesSourceType } from '../openapi/openApiTypes.js';
+import { canLimit, parseEdge, generateUUID } from './job-graph-utils.js';
+import * as fs from 'fs-extra';
+/**
+ * Transforms a production job configuration into a test job configuration.
+ *
+ * This is the main entry point for job transformation. It applies the following changes:
+ * 1. Renames the job (appends "_test" or uses custom name)
+ * 2. Updates execution and processing types if specified
+ * 3. Adds test run ID tag to job tags
+ * 4. Transforms sources (replace with dataset query, sample data, or add limits)
+ * 5. Transforms sinks (replace with sync sink or test dataset sinks)
+ * 6. Adds test tagging operations before sinks
+ *
+ * The transformation is purely functional and does not make any API calls.
+ *
+ * @param originalJob - The production job to transform
+ * @param options - Transformation options
+ * @returns A new job configuration suitable for testing
+ * @throws Error if job graph is missing or invalid
+ *
+ * @example
+ * const testJob = transformJobToTest(prodJob, {
+ *   execution: 'SYNCHRONOUS',
+ *   processing: 'BATCH',
+ *   datasetId: 'my_dataset',
+ *   start: '2025-01-01T00:00:00Z',
+ *   end: '2025-01-01T01:00:00Z',
+ *   limitRecords: 100
+ * });
+ */
+export function transformJobToTest(originalJob, options) {
+    const job = { ...originalJob };
+    // Determine target execution and processing types (use options or keep original)
+    const targetExecution = options.execution || job.execution;
+    const targetProcessing = options.processing || job.processing;
+    // Create base transformed job with updated metadata
+    const transformedJob = {
+        ...job,
+        name: options.testName || `${job.name}_test`,
+        execution: targetExecution,
+        processing: targetProcessing,
+        tags: {
+            ...(job.tags || {}),
+            'grepr.test_run_id': options.testTag || generateUUID()
+        }
+    };
+    if (!transformedJob.jobGraph) {
+        throw new Error('Job graph is required');
+    }
+    const parsedGraph = parseGraph(transformedJob.jobGraph);
+    // Step 1: Add test tagging operations on all edges BEFORE transforming sources/sinks
+    // This captures the original source/sink names in the edge tags
+    addTestTagging(parsedGraph, transformedJob.tags?.['grepr.test_run_id'] || generateUUID());
+    // Step 2: Transform sources (replace with dataset, sample data, or add limits)
+    transformSources(parsedGraph, targetProcessing, options);
+    // Step 3: Transform sinks (replace with sync sink or test dataset sinks)
+    transformSinks(parsedGraph, targetExecution, options);
+    // Convert the parsed/modified graph back to SchemaGreprJobGraph format
+    const transformedVertices = [];
+    const transformedEdges = [];
+    for (const vertex of parsedGraph.values()) {
+        transformedVertices.push(vertex.operation);
+        for (const [outputPort, nextIos] of vertex.next) {
+            for (const nextIo of nextIos) {
+                const edgeStr = `${vertex.name}:${outputPort} -> ${nextIo.vertex.name}:${nextIo.name}`;
+                transformedEdges.push(edgeStr);
+            }
+        }
+    }
+    transformedJob.jobGraph = {
+        vertices: transformedVertices,
+        edges: transformedEdges
+    };
+    return transformedJob;
+}
+/**
+ * Parses the job graph into a vertex-based representation, returning all vertices.
+ */
+function parseGraph(jobGraph) {
+    const verticesMap = new Map();
+    // Create Vertex objects for each operation
+    for (const operation of jobGraph.vertices) {
+        verticesMap.set(operation.name, new Vertex(operation));
+    }
+    // Link vertices based on edges
+    for (const edge of jobGraph.edges) {
+        const { sourceVertex: sourceVertexName, targetVertex: targetVertexName, sourcePort, targetPort } = parseEdge(edge);
+        const sourceVertex = verticesMap.get(sourceVertexName);
+        const targetVertex = verticesMap.get(targetVertexName);
+        if (sourceVertex && targetVertex) {
+            sourceVertex.addNext(sourcePort, { name: targetPort, vertex: targetVertex });
+        }
+    }
+    return verticesMap;
+}
+/**
+ * Transforms job graph sources based on the specified options.
+ *
+ * Three transformation strategies are supported:
+ * 1. Sample data file: Replace all sources with a LogsValuesSource (not yet implemented)
+ * 2. Dataset query: Replace all sources with a single IcebergTableSource
+ * 3. In-place: Keep original sources but add record limits for batch processing
+ *
+ * @param jobGraph - The job graph to transform
+ * @param processing - Target processing type
+ * @param options - Source transformation options
+ * @returns Transformed job graph with updated sources
+ */
+function transformSources(jobGraph, processing, options) {
+    if (options.sampleDataFile) {
+        transformSourcesToSampleData(jobGraph, options.sampleDataFile);
+    }
+    else if (options.datasetId) {
+        transformSourcesToDatasetQuery(jobGraph, options.datasetId, options.query, options.start, options.end, processing, options.limitRecords);
+    }
+    else {
+        transformSourcesInPlace(jobGraph, processing, options.limitRecords);
+    }
+}
+/**
+ * Transforms sources to use sample data from a file.
+ *
+ * This replaces all existing sources with a single LogsValuesSource that
+ * emits the log events from the sample data file. The file should contain
+ * a JSON array of log events matching the LogEvent schema.
+ *
+ * All edges from the old sources are rewired to connect from the new source
+ * to the first downstream operation in the pipeline.
+ *
+ * @param jobGraph - The job graph to transform
+ * @param sampleDataFile - Path to sample data file (JSON array of log events)
+ * @throws Error if the file cannot be read or parsed
+ */
+function transformSourcesToSampleData(jobGraph, sampleDataFile) {
+    // Read and parse the sample data file
+    if (!fs.existsSync(sampleDataFile)) {
+        throw new Error(`Sample data file not found: ${sampleDataFile}`);
+    }
+    let sampleLogs;
+    try {
+        const fileContent = fs.readFileSync(sampleDataFile, 'utf-8');
+        sampleLogs = JSON.parse(fileContent);
+        if (!Array.isArray(sampleLogs)) {
+            throw new Error('Sample data must be a JSON array of log events');
+        }
+    }
+    catch (error) {
+        if (error.message.includes('Sample data')) {
+            throw error;
+        }
+        throw new Error(`Failed to parse sample data file: ${error.message}`);
+    }
+    // Create a new LogsValuesSource with the sample data
+    const newSource = {
+        type: LogsValuesSourceType.logs_values_source,
+        name: 'test_sample_source',
+        values: sampleLogs,
+        indefinite: false
+    };
+    const newSourceVertex = new Vertex(newSource);
+    // Remove all old sources and connect them to the new source
+    for (const vertex of Array.from(jobGraph.values())) {
+        if (isSource(vertex)) {
+            // Rewire edges from old source's next vertices to new source
+            for (const [port, nextIos] of vertex.next) {
+                for (const nextIo of nextIos) {
+                    vertex.removeNext(port, nextIo);
+                    newSourceVertex.addNext(DEFAULT_OUTPUT, nextIo);
+                }
+            }
+            jobGraph.delete(vertex.name);
+        }
+    }
+    // Add the new source vertex to the graph
+    jobGraph.set(newSourceVertex.name, newSourceVertex);
+}
+/**
+ * Transforms sources to use an Iceberg dataset as the data source.
+ *
+ * This replaces all existing sources with a single IcebergTableSource that:
+ * - Reads from the specified dataset
+ * - Optionally filters data using a query
+ * - Reads data within the specified time range
+ * - Limits records for batch processing if specified
+ *
+ * All edges from the old sources are rewired to connect from the new source
+ * to the first downstream operation in the pipeline.
+ *
+ * @param jobGraph - The job graph to transform
+ * @param datasetId - ID of the dataset to read from
+ * @param query - Optional query to filter dataset data
+ * @param start - Start time for data query
+ * @param end - End time for data query
+ * @param processing - Processing type (BATCH or STREAMING)
+ * @param limitRecords - Optional record limit for batch processing
+ * @returns Transformed job graph with dataset source
+ */
+function transformSourcesToDatasetQuery(jobGraph, datasetId, query, start, end, processing, limitRecords) {
+    // Create a new Iceberg table source with the specified configuration
+    const newSource = {
+        type: LogsIcebergTableSourceType.logs_iceberg_table_source,
+        name: 'test_dataset_source',
+        datasetId,
+        query: {
+            type: DatadogQueryPredicateType.datadog_query,
+            query: query || ''
+        },
+        start: start || '',
+        end: end || '',
+        limit: limitRecords ?? DEFAULT_LIMIT
+    };
+    const newSourceVertex = new Vertex(newSource);
+    // Remove all old sources and connect them to the new source
+    for (const vertex of Array.from(jobGraph.values())) {
+        if (isSource(vertex)) {
+            // This is a source vertex since it has no inputs.
+            // Rewire edges from old source's next vertices to new source
+            for (const [port, nextIos] of vertex.next) {
+                for (const nextIo of nextIos) {
+                    vertex.removeNext(port, nextIo);
+                    newSourceVertex.addNext(DEFAULT_OUTPUT, nextIo);
+                }
+            }
+            jobGraph.delete(vertex.name);
+        }
+    }
+    // Add the new source vertex to the graph
+    jobGraph.set(newSourceVertex.name, newSourceVertex);
+}
+/**
+ * Transforms sources in place by adding record limits for batch processing.
+ *
+ * This keeps the original sources but adds a 'limit' parameter to sources
+ * that support it (e.g., IcebergTableSource). This is useful when you want
+ * to test with the same data sources but limit the amount of data processed.
+ *
+ * @param jobGraph - The job graph to transform
+ * @param processing - Processing type
+ * @param limitRecords - Optional record limit to apply
+ * @returns Transformed job graph with limited sources
+ */
+function transformSourcesInPlace(jobGraph, processing, limitRecords) {
+    for (const vertex of jobGraph.values()) {
+        if (!isSource(vertex)) {
+            // Not a source vertex
+            continue;
+        }
+        if (processing === JobProcessing.BATCH && limitRecords && canLimit(vertex.operation)) {
+            vertex.operation = {
+                ...vertex.operation,
+                limit: limitRecords
+            };
+        }
+    }
+}
+/**
+ * Transforms job graph sinks based on the target execution type.
+ *
+ * Two transformation strategies:
+ * 1. SYNCHRONOUS: Replace all sinks with a single synchronous sink that returns results
+ * 2. ASYNCHRONOUS: Replace vendor sinks with test dataset sinks (if testDataset provided)
+ *
+ * @param jobGraph - The job graph to transform
+ * @param execution - Target execution type
+ * @param options - Sink transformation options
+ * @returns Transformed job graph with updated sinks
+ */
+function transformSinks(jobGraph, execution, options) {
+    if (execution === JobExecution.SYNCHRONOUS) {
+        return transformSinksToSynchronous(jobGraph);
+    }
+    else {
+        if (!options.testDataset) {
+            throw new Error('Test dataset ID is required for ASYNCHRONOUS test job');
+        }
+        return transformSinksToAsynchronous(jobGraph, options.testDataset);
+    }
+}
+/**
+ * Transforms all sinks to a single synchronous sink.
+ *
+ * For synchronous testing, we replace all sink operations with a single
+ * LogsSyncSink that returns the processed data in the API response.
+ * This allows immediate verification of results.
+ *
+ * All operations that were feeding into the original sinks are rewired
+ * to feed into the new synchronous sink.
+ *
+ * @param jobGraph - The job graph to transform
+ */
+function transformSinksToSynchronous(jobGraph) {
+    // Create a single synchronous sink to replace them all
+    const syncSink = {
+        type: LogsSynchronousSinkType.logs_sync_sink,
+        name: 'test_synchronous_sink'
+    };
+    const sinkVertex = new Vertex(syncSink);
+    wireNewSink(jobGraph, sinkVertex);
+}
+/**
+ * Transforms sinks for asynchronous testing with a test dataset.
+ *
+ * If a test dataset ID is provided, this replaces vendor sinks, raw data sinks,
+ * and event dedup sinks with Iceberg table sinks that write to the test dataset.
+ *
+ * The original sink names are preserved to maintain the graph structure.
+ * Test tagging (added separately) allows distinguishing which sink the data came from.
+ *
+ * @param jobGraph - The job graph to transform
+ * @param testDatasetId - Optional test dataset ID for output
+ */
+function transformSinksToAsynchronous(jobGraph, testDatasetId) {
+    // For each sink (no outputs), replace with test dataset sink.
+    const sinkOp = {
+        type: LogsIcebergTableSinkType.logs_iceberg_table_sink,
+        name: 'test_async_sink',
+        datasetId: testDatasetId
+    };
+    const sinkVertex = new Vertex(sinkOp);
+    wireNewSink(jobGraph, sinkVertex);
+}
+function wireNewSink(jobGraph, sinkVertex) {
+    // Find all vertices that feed into sinks and rewire them to the new sync sink
+    for (const vertex of Array.from(jobGraph.values())) {
+        if (isSink(vertex)) {
+            // This is a sink vertex since it has no outputs.
+            // Rewire edges from old sink's prev vertices to new sync sink
+            for (const [port, prevIos] of vertex.prev) {
+                for (const prevIo of prevIos) {
+                    vertex.removePrev(port, prevIo);
+                    prevIo.vertex.addNext(prevIo.name, { name: DEFAULT_INPUT, vertex: sinkVertex });
+                }
+            }
+            jobGraph.delete(vertex.name);
+        }
+    }
+    // Add the new sink vertex to the graph
+    jobGraph.set(sinkVertex.name, sinkVertex);
+}
+/**
+ * Adds test tagging operations on all edges, with the id of the
+ * original edge and the test run ID.
+ *
+ * @param jobGraph - The job graph to transform
+ * @param testRunId - Unique test run identifier
+ */
+function addTestTagging(jobGraph, testRunId) {
+    for (const vertex of Array.from(jobGraph.values())) {
+        for (const [output, nextIos] of Array.from(vertex.next)) {
+            for (const nextIo of nextIos) {
+                // insert a tagging operation before this io
+                const edge = `${vertex.name}_${output}_${nextIo.vertex.name}_${nextIo.name}`;
+                const tagOpName = `${edge}_test_tag`;
+                const tagOp = createTestTagOperation(tagOpName, testRunId, edge);
+                const tagVertex = new Vertex(tagOp);
+                // Rewire edges: vertex -> tagOp -> nextIo.vertex
+                vertex.removeNext(output, nextIo);
+                vertex.addNext(output, { name: DEFAULT_INPUT, vertex: tagVertex });
+                tagVertex.addNext(DEFAULT_OUTPUT, nextIo);
+                // Add the new tagging vertex to the graph
+                jobGraph.set(tagVertex.name, tagVertex);
+            }
+        }
+    }
+}
+/**
+ * Creates a log transform operation that adds test tags.
+ *
+ * The operation adds two tags:
+ * - grepr.test_run_id: Identifies which test run this data belongs to
+ * - grepr.edge: Identifies edge this data was going through
+ *
+ * These tags are added using the ADD modification, which appends to existing tag arrays.
+ *
+ * @param name - Name for the tagging operation
+ * @param testRunId - Unique test run identifier
+ * @param edge - Name of the edge
+ * @returns A LogTransformAction operation that adds the tags
+ */
+function createTestTagOperation(name, testRunId, edge) {
+    return {
+        type: LogTransformActionType.log_transform,
+        name,
+        transforms: [
+            {
+                order: 0,
+                type: TagActionType.tag_action,
+                modification: TagActionModification.ADD,
+                tagKey: 'grepr.test_run_id',
+                values: [testRunId]
+            },
+            {
+                order: 1,
+                type: TagActionType.tag_action,
+                modification: TagActionModification.ADD,
+                tagKey: 'grepr.edge',
+                values: [edge]
+            }
+        ]
+    };
+}
+const isSource = (vertex) => vertex.prev.size === 0;
+const isSink = (vertex) => vertex.next.size === 0;
+/**
+ * Displays a summary of the transformations applied to a job.
+ *
+ * This shows a before/after comparison including:
+ * - Job name changes
+ * - Execution type changes
+ * - Processing type changes
+ * - operation and edge changes
+ * - Test run ID
+ *
+ * The output is formatted for console display.
+ *
+ * @param originalJob - The original production job
+ * @param transformedJob - The transformed test job
+ */
+export function showDiff(originalJob, transformedJob) {
+    console.log('\n=== TRANSFORMATION SUMMARY ===\n');
+    console.log(`Name: ${originalJob.name} → ${transformedJob.name}`);
+    console.log(`Execution: ${originalJob.execution} → ${transformedJob.execution}`);
+    console.log(`Processing: ${originalJob.processing} → ${transformedJob.processing}`);
+    if (originalJob.jobGraph && transformedJob.jobGraph) {
+        // Show added/removed operations and added/removed edges
+        // For each operation in original, check if in transformed, and if changed
+        const originalOps = new Set(originalJob.jobGraph.vertices.map(v => v.name));
+        const transformedOps = new Set(transformedJob.jobGraph.vertices.map(v => v.name));
+        const originalOpsMap = new Map(originalJob.jobGraph.vertices.map(v => [v.name, v]));
+        const transformedOpsMap = new Map(transformedJob.jobGraph.vertices.map(v => [v.name, v]));
+        const addedOps = Array.from(transformedOps).filter(op => !originalOps.has(op));
+        const removedOps = Array.from(originalOps).filter(op => !transformedOps.has(op));
+        const changedOps = Array.from(originalOps).filter(op => transformedOps.has(op) &&
+            JSON.stringify(originalOpsMap.get(op)) !== JSON.stringify(transformedOpsMap.get(op)));
+        if (addedOps.length > 0) {
+            console.log(`Added Operations:`);
+            for (const opName of addedOps) {
+                const op = transformedOpsMap.get(opName);
+                console.log(`${JSON.stringify(op, null, 2)}`);
+            }
+        }
+        if (removedOps.length > 0) {
+            console.log(`Removed Operations:`);
+            for (const opName of removedOps) {
+                const op = originalOpsMap.get(opName);
+                console.log(`${JSON.stringify(op, null, 2)}`);
+            }
+        }
+        if (changedOps.length > 0) {
+            console.log(`  Changed Operations:`);
+            for (const opName of changedOps) {
+                const originalOp = originalOpsMap.get(opName);
+                const transformedOp = transformedOpsMap.get(opName);
+                console.log(`- Original: ${JSON.stringify(originalOp, null, 2)}`);
+                console.log(`+ Transformed: ${JSON.stringify(transformedOp, null, 2)}`);
+            }
+        }
+        // Show edge changes
+        const originalEdges = new Set(originalJob.jobGraph.edges);
+        const transformedEdges = new Set(transformedJob.jobGraph.edges);
+        const addedEdges = Array.from(transformedEdges).filter(edge => !originalEdges.has(edge));
+        const removedEdges = Array.from(originalEdges).filter(edge => !transformedEdges.has(edge));
+        if (addedEdges.length > 0) {
+            console.log(`\n  Added Edges:`);
+            for (const edge of addedEdges) {
+                console.log(`+ ${edge}`);
+            }
+        }
+        if (removedEdges.length > 0) {
+            console.log(`\n  Removed Edges:`);
+            for (const edge of removedEdges) {
+                console.log(`- ${edge}`);
+            }
+        }
+        console.log('\nOperations:');
+    }
+    console.log('\nTest Tag:');
+    console.log(`  ${transformedJob.tags?.['grepr.test_run_id']}`);
+    console.log('\n=== TRANSFORMED JOB JSON ===\n');
+}
+//# sourceMappingURL=job-graph-transformer.js.map

package/build/dist/lib/job-graph-transformer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"job-graph-transformer.js","sourceRoot":"","sources":["../../../src/main/typescript/lib/job-graph-transformer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAChH,OAAO,EAIL,0BAA0B,EAC1B,uBAAuB,EACvB,wBAAwB,EACxB,sBAAsB,EACtB,yBAAyB,EACzB,qBAAqB,EACrB,aAAa,EAEb,oBAAoB,EAErB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,QAAQ,EACR,SAAS,EACT,YAAY,EACb,MAAM,sBAAsB,CAAC;AAC9B,OAAO,KAAK,EAAE,MAAM,UAAU,CAAC;AAwC/B;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,UAAU,kBAAkB,CAChC,WAA4B,EAC5B,OAAyB;IAEzB,MAAM,GAAG,GAAG,EAAE,GAAG,WAAW,EAAE,CAAC;IAE/B,iFAAiF;IACjF,MAAM,eAAe,GAAG,OAAO,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,CAAC;IAC3D,MAAM,gBAAgB,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC,UAAU,CAAC;IAE9D,oDAAoD;IACpD,MAAM,cAAc,GAAoB;QACtC,GAAG,GAAG;QACN,IAAI,EAAE,OAAO,CAAC,QAAQ,IAAI,GAAG,GAAG,CAAC,IAAI,OAAO;QAC5C,SAAS,EAAE,eAAe;QAC1B,UAAU,EAAE,gBAAgB;QAC5B,IAAI,EAAE;YACJ,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,mBAAmB,EAAE,OAAO,CAAC,OAAO,IAAI,YAAY,EAAE;SACvD;KACF,CAAC;IAEF,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,WAAW,GAAG,UAAU,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;IAExD,qFAAqF;IACrF,gEAAgE;IAChE,cAAc,CAAC,WAAW,EAAE,cAAc,CAAC,IAAI,EAAE,CAAC,mBAAmB,CAAC,IAAI,YAAY,EAAE,CAAC,CAAC;IAE1F,+EAA+E;IAC/E,gBAAgB,CAAC,WAAW,EAAE,gBAAgB,EAAE,OAAO,CAAC,CAAC;IAEzD,yEAAyE;IACzE,cAAc,CAAC,WAAW,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;IAEtD,uEAAuE;IACvE,MAAM,mBAAmB,GAAsB,EAAE,CAAC;IAClD,MAAM,gBAAgB,GAAa,EAAE,CAAC;IAEtC,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,mBAAmB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE3C,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YAChD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,GAAG,MAAM,CAAC,IAAI,IAAI,UAAU,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBACvF,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,cAAc,CAAC,QAAQ,GAAG;QACxB,QAAQ,EAAE,mBAAmB;QAC7B,KAAK,EAAE,gBAAgB;KACxB,CAAC;IAEF,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,QAA6B;IAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,2CAA2C;IAC3C,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;QAC1C,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,MAAM,EACJ,YAAY,EAAE,gBAAgB,EAC9B,YAAY,EAAE,gBAAgB,EAC9B,UAAU,EACV,UAAU,EACX,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAEpB,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAEvD,IAAI,YAAY,IAAI,YAAY,EAAE,CAAC;YACjC,YAAY,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAGD;;;;;;;;;;;;GAYG;AACH,SAAS,gBAAgB,CACvB,QAA6B,EAC7B,UAAyB,EACzB,OAAyB;IAEzB,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;QAC3B,4BAA4B,CAAC,QAAQ,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IACjE,CAAC;SAAM,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7B,8BAA8B,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;IAC3I,CAAC;SAAM,CAAC;QACN,uBAAuB,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;IACtE,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,4BAA4B,CACnC,QAA6B,EAC7B,cAAsB;IAEtB,sCAAsC;IACtC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CAAC,+BAA+B,cAAc,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,UAA4B,CAAC;IACjC,IAAI,CAAC;QACH,MAAM,WAAW,GAAG,EAAE,CAAC,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC7D,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAqB,CAAC;QAEzD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAK,KAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YACrD,MAAM,KAAK,CAAC;QACd,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qCAAsC,KAAe,CAAC,OAAO,EAAE,CAAC,CAAC;IACnF,CAAC;IAED,qDAAqD;IACrD,MAAM,SAAS,GAAoB;QACjC,IAAI,EAAE,oBAAoB,CAAC,kBAAkB;QAC7C,IAAI,EAAE,oBAAoB;QAC1B,MAAM,EAAE,UAAU;QAClB,UAAU,EAAE,KAAK;KACC,CAAC;IAErB,MAAM,eAAe,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC;IAE9C,4DAA4D;IAC5D,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QACnD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACrB,6DAA6D;YAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;oBAChC,eAAe,CAAC,OAAO,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,SAAS,8BAA8B,CACrC,QAA6B,EAC7B,SAAiB,EACjB,KAAyB,EACzB,KAAyB,EACzB,GAAuB,EACvB,UAAyB,EACzB,YAAqB;IAErB,qEAAqE;IACrE,MAAM,SAAS,GAAoB;QACjC,IAAI,EAAE,0BAA0B,CAAC,yBAAyB;QAC1D,IAAI,EAAE,qBAAqB;QAC3B,SAAS;QACT,KAAK,EAAE;YACL,IAAI,EAAE,yBAAyB,CAAC,aAAa;YAC7C,KAAK,EAAE,KAAK,IAAI,EAAE;SACnB;QACD,KAAK,EAAE,KAAK,IAAI,EAAE;QAClB,GAAG,EAAE,GAAG,IAAI,EAAE;QACd,KAAK,EAAE,YAAY,IAAI,aAAa;KACrC,CAAC;IAEF,MAAM,eAAe,GAAW,IAAI,MAAM,CAAC,SAAS,CAAC,CAAA;IAErD,4DAA4D;IAC5D,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QACnD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACrB,kDAAkD;YAClD,6DAA6D;YAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;oBAChC,eAAe,CAAC,OAAO,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,uBAAuB,CAC9B,QAA6B,EAC7B,UAAyB,EACzB,YAAqB;IAGrB,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACtB,sBAAsB;YACtB,SAAS;QACX,CAAC;QAED,IAAI,UAAU,KAAK,aAAa,CAAC,KAAK,IAAI,YAAY,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YACrF,MAAM,CAAC,SAAS,GAAG;gBACjB,GAAG,MAAM,CAAC,SAAS;gBACnB,KAAK,EAAE,YAAY;aACD,CAAC;QACvB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,cAAc,CACrB,QAA6B,EAC7B,SAAuB,EACvB,OAAyB;IAEzB,IAAI,SAAS,KAAK,YAAY,CAAC,WAAW,EAAE,CAAC;QAC3C,OAAO,2BAA2B,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QAC3E,CAAC;QACD,OAAO,4BAA4B,CAAC,QAAQ,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;IACrE,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,2BAA2B,CAClC,QAA6B;IAE7B,uDAAuD;IACvD,MAAM,QAAQ,GAAoB;QAChC,IAAI,EAAE,uBAAuB,CAAC,cAAc;QAC5C,IAAI,EAAE,uBAAuB;KACX,CAAC;IAErB,MAAM,UAAU,GAAW,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC;IAEhD,WAAW,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,4BAA4B,CACnC,QAA6B,EAC7B,aAAqB;IAGrB,8DAA8D;IAC9D,MAAM,MAAM,GAA+B;QACzC,IAAI,EAAE,wBAAwB,CAAC,uBAAuB;QACtD,IAAI,EAAE,iBAAiB;QACvB,SAAS,EAAE,aAAa;KACzB,CAAA;IAED,MAAM,UAAU,GAAW,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC;IAE9C,WAAW,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,WAAW,CAAC,QAA6B,EAAE,UAAkB;IACpE,8EAA8E;IAC9E,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QACnD,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACnB,iDAAiD;YACjD,8DAA8D;YAC9D,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;oBAChC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;gBAClF,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CACrB,QAA6B,EAC7B,SAAiB;IAEjB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QACnD,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACxD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,4CAA4C;gBAC5C,MAAM,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC7E,MAAM,SAAS,GAAG,GAAG,IAAI,WAAW,CAAC;gBACrC,MAAM,KAAK,GAAG,sBAAsB,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;gBACjE,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;gBAEpC,iDAAiD;gBACjD,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAClC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;gBACnE,SAAS,CAAC,OAAO,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBAE1C,0CAA0C;gBAC1C,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,sBAAsB,CAAC,IAAY,EAAE,SAAiB,EAAE,IAAY;IAC3E,OAAO;QACL,IAAI,EAAE,sBAAsB,CAAC,aAAa;QAC1C,IAAI;QACJ,UAAU,EAAE;YACV;gBACE,KAAK,EAAE,CAAC;gBACR,IAAI,EAAE,aAAa,CAAC,UAAU;gBAC9B,YAAY,EAAE,qBAAqB,CAAC,GAAG;gBACvC,MAAM,EAAE,mBAAmB;gBAC3B,MAAM,EAAE,CAAC,SAAS,CAAC;aACpB;YACD;gBACE,KAAK,EAAE,CAAC;gBACR,IAAI,EAAE,aAAa,CAAC,UAAU;gBAC9B,YAAY,EAAE,qBAAqB,CAAC,GAAG;gBACvC,MAAM,EAAE,YAAY;gBACpB,MAAM,EAAE,CAAC,IAAI,CAAC;aACf;SACF;KACF,CAAC;AACJ,CAAC;AAED,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;AACrE,MAAM,MAAM,GAAG,CAAC,MAAc,EAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;AAEnE;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,QAAQ,CACtB,WAA4B,EAC5B,cAA+B;IAE/B,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;IAElD,OAAO,CAAC,GAAG,CAAC,SAAS,WAAW,CAAC,IAAI,MAAM,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC;IAClE,OAAO,CAAC,GAAG,CAAC,cAAc,WAAW,CAAC,SAAS,MAAM,cAAc,CAAC,SAAS,EAAE,CAAC,CAAC;IACjF,OAAO,CAAC,GAAG,CAAC,eAAe,WAAW,CAAC,UAAU,MAAM,cAAc,CAAC,UAAU,EAAE,CAAC,CAAC;IAEpF,IAAI,WAAW,CAAC,QAAQ,IAAI,cAAc,CAAC,QAAQ,EAAE,CAAC;QACpD,wDAAwD;QACxD,0EAA0E;QAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAElF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1F,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5E,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CACrF,CAAC;QAEF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;YACjC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,EAAE,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACzC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;YACnC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACtC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;YACrC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9C,MAAM,aAAa,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpD,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAClE,OAAO,CAAC,GAAG,CAAC,kBAAkB,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC1D,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEhE,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACzF,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAE3F,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;YAClC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,cAAc,CAAC,IAAI,EAAE,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAE/D,OAAO,CAAC,GAAG,CAAC,kCAAkC,CAAC,CAAC;AAClD,CAAC"}

package/build/dist/lib/job-graph-utils.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Utility functions for working with Grepr job graphs.
+ *
+ * This module provides helper functions for:
+ * - Identifying different types of operations (sources, sinks, etc.)
+ * - Parsing and manipulating job graph edges
+ * - Traversing the job graph to find related vertices
+ * - Generating test identifiers
+ *
+ * All functions work with the OpenAPI-generated types to ensure type safety.
+ */
+import { SchemaOperation } from '../openapi/openApiTypes.js';
+/**
+ * Checks if a source vertex supports record limiting.
+ *
+ * Some source operations (like Iceberg table sources and Grepr internal sources)
+ * support a 'limit' parameter to restrict the number of records read, which is
+ * useful for batch testing.
+ *
+ * @param vertex - The operation to check
+ * @returns true if the vertex supports limiting
+ */
+export declare function canLimit(vertex: SchemaOperation): boolean;
+/**
+ * Parses a job graph edge string into source and target vertex names.
+ *
+ * Edges are represented as strings in the format "source -> target".
+ * Or "source:out -> target:in".
+ * This function splits the edge and validates the format.
+ *
+ * @param edge - The edge string to parse (e.g., "source -> target")
+ * @returns A tuple of [source, target] vertex/port names
+ * @throws Error if the edge format is invalid
+ */
+export declare function parseEdge(edge: string): {
+    sourceVertex: string;
+    sourcePort: string;
+    targetVertex: string;
+    targetPort: string;
+};
+/**
+ * Generates a unique test identifier.
+ *
+ * Creates a unique ID for test runs using a combination of timestamp and random string.
+ * Format: test_{timestamp}_{random}
+ *
+ * @returns A unique test identifier string
+ */
+export declare function generateUUID(): string;
+//# sourceMappingURL=job-graph-utils.d.ts.map

package/build/dist/lib/job-graph-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"job-graph-utils.d.ts","sourceRoot":"","sources":["../../../src/main/typescript/lib/job-graph-utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EACL,eAAe,EAGhB,MAAM,wBAAwB,CAAC;AAGhC;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,CAazD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG;IACvC,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAA;CACnB,CA6BA;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,IAAI,MAAM,CAErC"}

package/build/dist/lib/job-graph-utils.js

@@ -0,0 +1,84 @@
+/**
+ * Utility functions for working with Grepr job graphs.
+ *
+ * This module provides helper functions for:
+ * - Identifying different types of operations (sources, sinks, etc.)
+ * - Parsing and manipulating job graph edges
+ * - Traversing the job graph to find related vertices
+ * - Generating test identifiers
+ *
+ * All functions work with the OpenAPI-generated types to ensure type safety.
+ */
+import { LogsIcebergTableSourceType, MetricsIcebergTableSourceType, TracesIcebergTableSourceType, LogsBackfillFlinkSourceType, ReducerLogsQuerySourceType, GreprRawLogsSourceType, GreprReducerLogSourceType, } from '../openapi/openApiTypes.js';
+import { DEFAULT_INPUT, DEFAULT_OUTPUT } from '../types.js';
+/**
+ * Checks if a source vertex supports record limiting.
+ *
+ * Some source operations (like Iceberg table sources and Grepr internal sources)
+ * support a 'limit' parameter to restrict the number of records read, which is
+ * useful for batch testing.
+ *
+ * @param vertex - The operation to check
+ * @returns true if the vertex supports limiting
+ */
+export function canLimit(vertex) {
+    // Iceberg table sources and Grepr internal sources support limiting
+    const limitableSources = new Set([
+        LogsIcebergTableSourceType.logs_iceberg_table_source,
+        MetricsIcebergTableSourceType.metrics_iceberg_table_source,
+        TracesIcebergTableSourceType.traces_iceberg_table_source,
+        LogsBackfillFlinkSourceType.logs_backfill_iceberg_table_source,
+        ReducerLogsQuerySourceType.reducer_logs_iceberg_table_source,
+        GreprRawLogsSourceType.grepr_raw_log_source,
+        GreprReducerLogSourceType.grepr_reducer_log_source,
+    ]);
+    return limitableSources.has(vertex.type);
+}
+/**
+ * Parses a job graph edge string into source and target vertex names.
+ *
+ * Edges are represented as strings in the format "source -> target".
+ * Or "source:out -> target:in".
+ * This function splits the edge and validates the format.
+ *
+ * @param edge - The edge string to parse (e.g., "source -> target")
+ * @returns A tuple of [source, target] vertex/port names
+ * @throws Error if the edge format is invalid
+ */
+export function parseEdge(edge) {
+    const parts = edge.split('->').map(p => p.trim());
+    if (parts.length !== 2 || !parts[0] || !parts[1]) {
+        throw new Error(`Invalid edge format: ${edge}`);
+    }
+    // split source and target to extract vertex names with ports
+    const source = parts[0];
+    const target = parts[1];
+    const sourceParts = source.split(":").map(p => p.trim());
+    const targetParts = target.split(":").map(p => p.trim());
+    if (sourceParts.length > 2 || targetParts.length > 2) {
+        throw new Error(`Invalid edge format with ports: ${edge}`);
+    }
+    // These are guaranteed to exist by the split operation
+    const sourceVertex = sourceParts[0];
+    const targetVertex = targetParts[0];
+    const sourcePort = sourceParts.length === 2 ? sourceParts[1] : DEFAULT_OUTPUT;
+    const targetPort = targetParts.length === 2 ? targetParts[1] : DEFAULT_INPUT;
+    return {
+        sourceVertex,
+        sourcePort,
+        targetVertex,
+        targetPort
+    };
+}
+/**
+ * Generates a unique test identifier.
+ *
+ * Creates a unique ID for test runs using a combination of timestamp and random string.
+ * Format: test_{timestamp}_{random}
+ *
+ * @returns A unique test identifier string
+ */
+export function generateUUID() {
+    return `test_${Date.now()}_${Math.random().toString(36).substring(2, 11)}`;
+}
+//# sourceMappingURL=job-graph-utils.js.map

package/build/dist/lib/job-graph-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"job-graph-utils.js","sourceRoot":"","sources":["../../../src/main/typescript/lib/job-graph-utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAEL,0BAA0B,EAAE,6BAA6B,EAAE,4BAA4B,EAAE,2BAA2B,EACpH,0BAA0B,EAAE,sBAAsB,EAAE,yBAAyB,GAC9E,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AAEvD;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAuB;IAC9C,oEAAoE;IACpE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;QAC/B,0BAA0B,CAAC,yBAAyB;QACpD,6BAA6B,CAAC,4BAA4B;QAC1D,4BAA4B,CAAC,2BAA2B;QACxD,2BAA2B,CAAC,kCAAkC;QAC9D,0BAA0B,CAAC,iCAAiC;QAC5D,sBAAsB,CAAC,oBAAoB;QAC3C,yBAAyB,CAAC,wBAAwB;KACnD,CAAgB,CAAC;IAElB,OAAO,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY;IAMpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,6DAA6D;IAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAExB,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAEzD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED,uDAAuD;IACvD,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAW,CAAC;IAC9C,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAW,CAAC;IAC9C,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,WAAW,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,cAAc,CAAC;IAC1F,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,WAAW,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,aAAa,CAAC;IAEzF,OAAO;QACL,YAAY;QACZ,UAAU;QACV,YAAY;QACZ,UAAU;KACX,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY;IAC1B,OAAO,QAAQ,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC"}

package/build/dist/lib/json-formatter.d.ts

@@ -5,6 +5,7 @@ export interface JsonFormatterOptions {
     sortBy?: string;
     timezone?: string;
     maxDepth?: number;
+    maxLines?: number;
 }
 export interface ProcessStats {
     recordsProcessed: number;