openlore 2.0.0

package/dist/core/analyzer/cpp-header-resolver.d.ts

@@ -0,0 +1,30 @@
+/**
+ * CppHeaderResolver — maps C++ #include directives to implementation files.
+ *
+ * In C++ a caller in main.cpp that does `#include "engine.h"` effectively
+ * has access to all symbols defined in engine.cpp (the paired implementation).
+ * This module builds that header→impl mapping so that the call graph resolver
+ * can prefer the correct .cpp file when resolving cross-file calls.
+ */
+export interface CppInclude {
+    headerPath: string;
+    isRelative: boolean;
+    isSystem: boolean;
+}
+/** Parse #include directives from a C++ source file. */
+export declare function parseCppIncludes(filePath: string, content: string, _allFilePaths: string[]): CppInclude[];
+/**
+ * Build a map from header path → implementation file path.
+ * Convention: foo.h and foo.cpp (or .cc) in the same directory are paired.
+ */
+export declare function buildHeaderToImplMap(allFilePaths: string[]): Map<string, string>;
+/**
+ * Build a map from C++ source file → Set of implementation files reachable
+ * via its #include directives.  Used during call resolution to prefer the
+ * implementation file that matches an #include in the caller.
+ */
+export declare function buildCppImportMap(files: Array<{
+    path: string;
+    content: string;
+}>, allFilePaths: string[]): Map<string, Set<string>>;
+//# sourceMappingURL=cpp-header-resolver.d.ts.map

package/dist/core/analyzer/cpp-header-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cpp-header-resolver.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/cpp-header-resolver.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAUH,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,OAAO,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,wDAAwD;AACxD,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,MAAM,EAAE,GACtB,UAAU,EAAE,CAgBd;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAUhF;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,EAC/C,YAAY,EAAE,MAAM,EAAE,GACrB,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAiB1B"}

package/dist/core/analyzer/cpp-header-resolver.js

@@ -0,0 +1,71 @@
+/**
+ * CppHeaderResolver — maps C++ #include directives to implementation files.
+ *
+ * In C++ a caller in main.cpp that does `#include "engine.h"` effectively
+ * has access to all symbols defined in engine.cpp (the paired implementation).
+ * This module builds that header→impl mapping so that the call graph resolver
+ * can prefer the correct .cpp file when resolving cross-file calls.
+ */
+import { dirname, resolve } from 'node:path';
+const SYSTEM_HEADERS = new Set([
+    'iostream', 'vector', 'string', 'map', 'set', 'unordered_map',
+    'memory', 'algorithm', 'functional', 'utility', 'stdexcept',
+    'cassert', 'cmath', 'cstdlib', 'cstring', 'thread', 'mutex',
+]);
+/** Parse #include directives from a C++ source file. */
+export function parseCppIncludes(filePath, content, _allFilePaths) {
+    const result = [];
+    const dir = dirname(filePath);
+    // #include "relative/path.h"
+    for (const m of content.matchAll(/#include\s+"([^"]+)"/g)) {
+        result.push({ headerPath: resolve(dir, m[1]), isRelative: true, isSystem: false });
+    }
+    // #include <system_header>
+    for (const m of content.matchAll(/#include\s+<([^>]+)>/g)) {
+        const name = m[1].split('/')[0];
+        result.push({ headerPath: m[1], isRelative: false, isSystem: SYSTEM_HEADERS.has(name) });
+    }
+    return result;
+}
+/**
+ * Build a map from header path → implementation file path.
+ * Convention: foo.h and foo.cpp (or .cc) in the same directory are paired.
+ */
+export function buildHeaderToImplMap(allFilePaths) {
+    const map = new Map();
+    for (const cpp of allFilePaths.filter(f => /\.(cpp|cc|cxx)$/.test(f))) {
+        const base = cpp.replace(/\.(cpp|cc|cxx)$/, '');
+        for (const ext of ['.h', '.hpp']) {
+            const header = base + ext;
+            if (allFilePaths.includes(header))
+                map.set(header, cpp);
+        }
+    }
+    return map;
+}
+/**
+ * Build a map from C++ source file → Set of implementation files reachable
+ * via its #include directives.  Used during call resolution to prefer the
+ * implementation file that matches an #include in the caller.
+ */
+export function buildCppImportMap(files, allFilePaths) {
+    const headerToImpl = buildHeaderToImplMap(allFilePaths);
+    const result = new Map();
+    for (const file of files) {
+        if (!/\.(cpp|cc|cxx|h|hpp)$/.test(file.path))
+            continue;
+        const includes = parseCppIncludes(file.path, file.content, allFilePaths);
+        const accessible = new Set();
+        for (const inc of includes) {
+            if (inc.isSystem)
+                continue;
+            const impl = headerToImpl.get(inc.headerPath);
+            if (impl)
+                accessible.add(impl);
+        }
+        if (accessible.size > 0)
+            result.set(file.path, accessible);
+    }
+    return result;
+}
+//# sourceMappingURL=cpp-header-resolver.js.map

package/dist/core/analyzer/cpp-header-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cpp-header-resolver.js","sourceRoot":"","sources":["../../../src/core/analyzer/cpp-header-resolver.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC;IAC7B,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,eAAe;IAC7D,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW;IAC3D,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO;CAC5D,CAAC,CAAC;AAQH,wDAAwD;AACxD,MAAM,UAAU,gBAAgB,CAC9B,QAAgB,EAChB,OAAe,EACf,aAAuB;IAEvB,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAE9B,6BAA6B;IAC7B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC;QAC1D,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACrF,CAAC;IAED,2BAA2B;IAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3F,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,YAAsB;IACzD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC;YAC1B,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA+C,EAC/C,YAAsB;IAEtB,MAAM,YAAY,GAAG,oBAAoB,CAAC,YAAY,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACvD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QACzE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,GAAG,CAAC,QAAQ;gBAAE,SAAS;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,IAAI;gBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/core/analyzer/dependency-graph.d.ts

@@ -0,0 +1,230 @@
+/**
+ * Dependency Graph Service
+ *
+ * Builds a complete graph of how files relate to each other through imports.
+ * Provides metrics like in-degree, out-degree, betweenness centrality, and PageRank.
+ * Detects clusters, cycles, and special nodes (centers, leaves, bridges, orphans).
+ */
+import { type ExportInfo } from './import-parser.js';
+import { type HttpEdge } from './http-route-parser.js';
+import type { ScoredFile } from '../../types/index.js';
+/**
+ * Node in the dependency graph
+ */
+export interface DependencyNode {
+    id: string;
+    file: ScoredFile;
+    exports: ExportInfo[];
+    metrics: {
+        inDegree: number;
+        outDegree: number;
+        betweenness: number;
+        pageRank: number;
+    };
+    cluster?: {
+        id: string;
+        name: string;
+        color: string;
+    };
+}
+/**
+ * Edge in the dependency graph
+ */
+export interface DependencyEdge {
+    source: string;
+    target: string;
+    importedNames: string[];
+    isTypeOnly: boolean;
+    weight: number;
+    /** Present when this edge was derived from an HTTP call rather than a static import */
+    httpEdge?: HttpEdge;
+    /** True when this edge was synthesized from a call-graph cross-file call (implicit import) */
+    isCallEdge?: boolean;
+}
+/**
+ * Cluster of related files
+ */
+export interface FileCluster {
+    id: string;
+    name: string;
+    files: string[];
+    internalEdges: number;
+    externalEdges: number;
+    cohesion: number;
+    coupling: number;
+    suggestedDomain: string;
+    color: string;
+    /**
+     * True when the cluster has at least one internal edge (files actually
+     * import each other). False clusters are pure directory groups with no
+     * connectivity — useful for rendering at a lower visual prominence.
+     */
+    isStructural: boolean;
+}
+/**
+ * Complete dependency graph result
+ */
+export interface DependencyGraphResult {
+    nodes: DependencyNode[];
+    edges: DependencyEdge[];
+    /** All clusters (structural + directory groups). Use the `isStructural` flag to filter. */
+    clusters: FileCluster[];
+    /** Only clusters with internalEdges > 0 — worth highlighting visually */
+    structuralClusters: FileCluster[];
+    rankings: {
+        byImportance: string[];
+        byConnectivity: string[];
+        clusterCenters: string[];
+        leafNodes: string[];
+        bridgeNodes: string[];
+        orphanNodes: string[];
+    };
+    cycles: string[][];
+    statistics: {
+        nodeCount: number;
+        edgeCount: number;
+        /** Edges derived from static imports */
+        importEdgeCount: number;
+        /** Edges derived from HTTP call→route matching */
+        httpEdgeCount: number;
+        avgDegree: number;
+        density: number;
+        /** Total clusters including directory-only groups */
+        clusterCount: number;
+        /** Clusters with at least one internal edge */
+        structuralClusterCount: number;
+        cycleCount: number;
+    };
+}
+/**
+ * Options for building the dependency graph
+ */
+export interface DependencyGraphOptions {
+    /** Root directory of the project */
+    rootDir: string;
+    /** File extensions to consider for import resolution */
+    extensions?: string[];
+    /** Minimum cluster size to report */
+    minClusterSize?: number;
+    /** PageRank damping factor */
+    dampingFactor?: number;
+    /** Maximum PageRank iterations */
+    maxIterations?: number;
+}
+/**
+ * Builds and analyzes a dependency graph from scored files
+ */
+export declare class DependencyGraphBuilder {
+    private nodes;
+    private edges;
+    private adjacencyList;
+    private reverseAdjacencyList;
+    private httpEdgeCount;
+    private parser;
+    private options;
+    constructor(options: DependencyGraphOptions);
+    /**
+     * Build the dependency graph from scored files
+     */
+    build(files: ScoredFile[]): Promise<DependencyGraphResult>;
+    /**
+     * Parse all files to extract imports/exports
+     */
+    private parseFiles;
+    /**
+     * Build cross-language edges by matching HTTP calls in JS/TS files to
+     * FastAPI/Flask/Django route definitions in Python files.
+     * Only creates edges between files that are already nodes in the graph.
+     */
+    private buildHttpCrossEdges;
+    /**
+     * Build edges from import relationships
+     */
+    private buildEdges;
+    /**
+     * Calculate in-degree and out-degree for each node
+     */
+    private calculateDegrees;
+    /**
+     * Calculate betweenness centrality using Brandes' algorithm
+     */
+    private calculateBetweenness;
+    /**
+     * Calculate PageRank-style importance scores
+     */
+    private calculatePageRank;
+    /**
+     * Detect clusters using a simple community detection approach
+     * Groups files by their common directory prefix and connectivity
+     */
+    private detectClusters;
+    /**
+     * Suggest a domain name based on directory and file contents
+     */
+    private suggestDomainName;
+    /**
+     * Detect cycles in the dependency graph using DFS
+     */
+    private detectCycles;
+    /**
+     * Check if a cycle is a duplicate or rotation of an existing cycle
+     */
+    private isDuplicateCycle;
+    /**
+     * Normalize a cycle for comparison (smallest element first, then compare)
+     */
+    private normalizeCycle;
+    /**
+     * Generate various rankings of nodes
+     */
+    private generateRankings;
+    /**
+     * Calculate overall statistics
+     */
+    private calculateStatistics;
+}
+/**
+ * Build a dependency graph from scored files
+ */
+export declare function buildDependencyGraph(files: ScoredFile[], options: DependencyGraphOptions): Promise<DependencyGraphResult>;
+/**
+ * Languages that share a module-level namespace without explicit intra-file imports.
+ * For these, dependency edges must be derived from the call graph rather than imports.
+ */
+declare const IMPLICIT_IMPORT_LANGS: Set<string>;
+/**
+ * Synthesize dependency edges from cross-file call edges and inject them into
+ * an existing DependencyGraphResult in-place.
+ *
+ * Use this for languages like Swift or C++ that don't have explicit intra-module
+ * imports, resulting in an empty dep graph when only import-based edges are built.
+ */
+export declare function injectCallGraphEdges(depGraph: DependencyGraphResult, callEdges: Array<{
+    callerId: string;
+    calleeId: string;
+}>, nodeFilePath: (id: string) => string | undefined): void;
+export { IMPLICIT_IMPORT_LANGS };
+/**
+ * Convert graph to D3.js force graph format
+ */
+export declare function toD3Format(result: DependencyGraphResult): {
+    nodes: Array<{
+        id: string;
+        group: number;
+        score: number;
+    }>;
+    links: Array<{
+        source: string;
+        target: string;
+        value: number;
+    }>;
+};
+/**
+ * Convert graph to Mermaid diagram syntax
+ */
+export declare function toMermaidFormat(result: DependencyGraphResult, maxNodes?: number): string;
+/**
+ * Convert graph to DOT format (Graphviz)
+ */
+export declare function toDotFormat(result: DependencyGraphResult): string;
+//# sourceMappingURL=dependency-graph.d.ts.map

package/dist/core/analyzer/dependency-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAqC,KAAK,UAAU,EAAqB,MAAM,oBAAoB,CAAC;AAC3G,OAAO,EAAuB,KAAK,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAC5E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AA0BvD;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,UAAU,CAAC;IACjB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,OAAO,EAAE;QACP,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,MAAM,CAAC;QACpB,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC;IACF,OAAO,CAAC,EAAE;QACR,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,UAAU,EAAE,OAAO,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,uFAAuF;IACvF,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,8FAA8F;IAC9F,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,YAAY,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,2FAA2F;IAC3F,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,yEAAyE;IACzE,kBAAkB,EAAE,WAAW,EAAE,CAAC;IAClC,QAAQ,EAAE;QACR,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,SAAS,EAAE,MAAM,EAAE,CAAC;QACpB,WAAW,EAAE,MAAM,EAAE,CAAC;QACtB,WAAW,EAAE,MAAM,EAAE,CAAC;KACvB,CAAC;IACF,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,UAAU,EAAE;QACV,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,wCAAwC;QACxC,eAAe,EAAE,MAAM,CAAC;QACxB,kDAAkD;QAClD,aAAa,EAAE,MAAM,CAAC;QACtB,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,qDAAqD;QACrD,YAAY,EAAE,MAAM,CAAC;QACrB,+CAA+C;QAC/C,sBAAsB,EAAE,MAAM,CAAC;QAC/B,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,oCAAoC;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,wDAAwD;IACxD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,qCAAqC;IACrC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,8BAA8B;IAC9B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,kCAAkC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAMD;;GAEG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,KAAK,CAA0C;IACvD,OAAO,CAAC,KAAK,CAAwB;IACrC,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,oBAAoB,CAAuC;IACnE,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,MAAM,CAAqB;IACnC,OAAO,CAAC,OAAO,CAAmC;gBAEtC,OAAO,EAAE,sBAAsB;IAW3C;;OAEG;IACG,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,qBAAqB,CAAC;IA4EhE;;OAEG;YACW,UAAU;IAkBxB;;;;OAIG;YACW,mBAAmB;IA6CjC;;OAEG;YACW,UAAU;IAoDxB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAOxB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAuE5B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IA8CzB;;;OAGG;IACH,OAAO,CAAC,cAAc;IAiEtB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IA8CzB;;OAEG;IACH,OAAO,CAAC,YAAY;IAyCpB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAaxB;;OAEG;IACH,OAAO,CAAC,cAAc;IAetB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IA4DxB;;OAEG;IACH,OAAO,CAAC,mBAAmB;CA8B5B;AAMD;;GAEG;AACH,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,EAAE,sBAAsB,GAC9B,OAAO,CAAC,qBAAqB,CAAC,CAGhC;AAMD;;;GAGG;AACH,QAAA,MAAM,qBAAqB,aAAiC,CAAC;AAE7D;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,qBAAqB,EAC/B,SAAS,EAAE,KAAK,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,EACxD,YAAY,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,GAC/C,IAAI,CA4DN;AAED,OAAO,EAAE,qBAAqB,EAAE,CAAC;AAMjC;;GAEG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,qBAAqB,GAAG;IACzD,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3D,KAAK,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACjE,CAsBA;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,qBAAqB,EAAE,QAAQ,SAAK,GAAG,MAAM,CA6BpF;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,qBAAqB,GAAG,MAAM,CAoBjE"}