@graphty/cytoscape-extensions 0.0.28 → 0.0.29

package/dist/algorithms.d.ts

@@ -0,0 +1,489 @@
+/**
+ * Every @graphty/algorithms algorithm as a Cytoscape.js 3.x collection and core method, named "graphty<Name>".
+ *
+ * The conventions, which follow Cytoscape's built-in algorithms:
+ * - scope is the calling collection (its nodes, and its edges whose two ends are in it); `cy.graphtyX(o)` is
+ *   `cy.elements().graphtyX(o)`;
+ * - synchronous, one options object;
+ * - `directed` (default false) and `weight` (an edge data field, or a function of the edge) describe the graph;
+ * - nodes are named by a selector or a collection (`root`, `goal`, `source`, `sink`, ...);
+ * - results are keyed by element: accessor functions (`score(node)`, `distanceTo(node)`), collections, and arrays
+ *   of collections, never index arrays;
+ * - `field` writes the per-element value (what `score` or `cluster` returns) into `data(field)`, so a stylesheet
+ *   can map it;
+ * - every other option the method's type lists goes to the @graphty/algorithms function unchanged, and an option it
+ *   does not list throws (src/algorithm-options.ts, generated from those types);
+ * - errors throw, from the adapter (a selection that matches nothing, a weight given to an algorithm that ignores
+ *   weights, an unknown option) and from the algorithm (an undirected graph given to one that needs a directed one),
+ *   each message starting with the method name.
+ */
+import { type AcceleratedAlgorithms, allPairsShortestPath, type ApspOptions, bellmanFord, betweennessCentrality, type BetweennessOptions, type BipartiteOptions, breadthFirstSearch, type CandidateOptions, closenessCentrality, type ClosenessOptions, connectedComponents, type DegreeCentralityOptions, type DeltaPageRankComputeOptions, dijkstra, type DirectionOptimizedBfsOptions, edgeBetweennessCentrality, eigenvectorCentrality, type EigenvectorOptions, type GirvanNewmanOptions, type GrsbmOptions, type HierarchicalOptions, hits, type HitsOptions, type KargerOptions, katzCentrality, type KatzOptions, labelPropagation, type LabelPropagationOptions, labelPropagationSynchronous, type LeidenOptions, type LinkPredictionMetrics, type LinkPredictionOptions, type LouvainOptions, type MarkovOptions, type MaxFlowOptions, type ModularityOptions, pageRank, type PageRankOptions, personalizedPageRank, type SpectralOptions, type SyncClusteringOptions, type TeraHacOptions, triangleCount, weaklyConnectedComponents } from "@graphty/algorithms";
+import { type DerivedGraph, type GraphSnapshot } from "@graphty/graph-format";
+import type { Collection, CollectionReturnValue, Core, EdgeCollection, EdgeSingular, NodeCollection, NodeSingular } from "cytoscape";
+import { type Backend, type GpuMode } from "./gpu.js";
+import { type CytoscapeSnapshot, type NodeSelection, type SnapshotOptions } from "./snapshot.js";
+/** A node or edge as a result accessor takes it: the element, or a selector whose first match is used. */
+export type ElementRef = string | Collection | NodeCollection | EdgeCollection;
+/** Options every "graphty*" algorithm takes. */
+export interface AlgorithmOptions {
+    /** Read the edges as directed (source to target). Default false, except where an algorithm says otherwise. */
+    readonly directed?: boolean;
+    /** Edge data field holding the weight, or a function of the edge. Default: every edge weighs 1. */
+    readonly weight?: SnapshotOptions["weight"];
+    /**
+     * Write each element's value (what `score` or `cluster` returns) into `data(field)`. A method whose result has no
+     * per-element value (a path, a tree, a number, a list of predictions) throws when given it.
+     */
+    readonly field?: string;
+    /**
+     * The `...Async` methods only: "auto" (default) runs on the GPU when the runtime has a usable WebGPU device,
+     * "off" runs on the CPU, "require" throws instead of running on the CPU when no device is available. The synchronous methods always run on the CPU and reject "require". Any other value throws a TypeError.
+     */
+    readonly gpu?: GpuMode;
+}
+/** Per-element values, keyed by element. */
+export interface ScoreResult {
+    /** The value of an element of the collection; undefined for one outside it. */
+    score(ele: ElementRef): number | undefined;
+}
+/** A partition: an array of node collections, one per cluster, plus each node's cluster number. */
+export type Partition<T = object> = NodeCollection[] & T & {
+    /** The cluster number (its position in the array) of a node; undefined for one outside the collection. */
+    cluster(node: ElementRef): number | undefined;
+};
+/** Paths from one root, in the shape of Cytoscape's `dijkstra`. */
+export interface PathsResult {
+    /** Distance from the root; Infinity when unreachable. */
+    distanceTo(node: ElementRef): number;
+    /** The path from the root, alternating node, edge, node; empty when unreachable. */
+    pathTo(node: ElementRef): CollectionReturnValue;
+}
+/** A walk from one root, in the shape of Cytoscape's `bfs` / `dfs`. */
+export interface SearchResult {
+    /** The visited nodes in visit order, each after the tree edge that reached it. */
+    readonly path: CollectionReturnValue;
+    /** The `goal` node when it was reached, else empty. */
+    readonly found: CollectionReturnValue;
+    /**
+     * Edges from the root along the walk's tree (the parent links): the shortest hop count for a breadth-first
+     * search, the tree depth for a depth-first search, which can be larger. Undefined when not visited.
+     */
+    depth(node: ElementRef): number | undefined;
+    /** The node this one was reached from; undefined for the root and unvisited nodes. */
+    parent(node: ElementRef): NodeSingular | undefined;
+}
+/** One path between two nodes, in the shape of Cytoscape's `aStar`. */
+export interface PointPathResult {
+    /** Whether `goal` can be reached from `root`. */
+    readonly found: boolean;
+    /** The length of the path; Infinity when not found. */
+    readonly distance: number;
+    /** Alternating node, edge, node; empty when not found. */
+    readonly path: CollectionReturnValue;
+}
+/**
+ * A cut, like the result of Cytoscape's `kargerStein` with `partition1` and `partition2` named `partitionFirst` and
+ * `partitionSecond`, plus `value` and without `components`.
+ */
+export interface CutResult {
+    /** The total weight (capacity) of the cut edges. */
+    readonly value: number;
+    /** The edges that cross the cut. */
+    readonly cut: EdgeCollection;
+    /** The nodes on one side: the source side for a flow or s-t cut. */
+    readonly partitionFirst: NodeCollection;
+    /** The nodes on the other side. */
+    readonly partitionSecond: NodeCollection;
+}
+/** A predicted link. */
+export interface PredictedLink {
+    /** One end of the proposed edge. */
+    readonly source: NodeSingular;
+    /** The other end. */
+    readonly target: NodeSingular;
+    /** The pair's score; higher is a more likely link. */
+    readonly score: number;
+}
+/** A pair of nodes, each a selector or a collection. */
+export type NodePair = readonly [NodeSelection, NodeSelection];
+/** Held-out edges and non-edges for the link-prediction evaluations. */
+interface EvaluateOptions extends AlgorithmOptions {
+    /** Node pairs that are edges (held out of the graph), which a good score ranks high. */
+    readonly edges: readonly NodePair[];
+    /** Node pairs that are not edges, which a good score ranks low. */
+    readonly nonEdges: readonly NodePair[];
+}
+/** What every algorithm implementation gets. */
+interface Ctx {
+    readonly name: string;
+    readonly cy: Core;
+    readonly cs: CytoscapeSnapshot;
+    readonly s: GraphSnapshot;
+    readonly field: string | undefined;
+    /** `weighted` for the algorithms that read the snapshot's weights only when asked. */
+    readonly weighted: boolean;
+    /** The caller's options without the adapter's own, over this package's pinned defaults (see DEFAULTS). */
+    readonly rest: Record<string, unknown>;
+    /**
+     * Runs one of the algorithms the GPU can answer: synchronously on the CPU for the plain methods, through the
+     * dispatcher of `@graphty/algorithms` (GPU or CPU, a promise) for the `...Async` methods.
+     */
+    call<K extends GpuKey>(key: K, ...args: Parameters<Dispatch[K]>): Out<K> | Promise<Out<K>>;
+}
+/** The @graphty/algorithms dispatcher's methods: the ones an accelerator can answer, by the dispatcher's names. */
+type Dispatch = Omit<AcceleratedAlgorithms, "accelerator">;
+type Out<K extends keyof Dispatch> = Awaited<ReturnType<Dispatch[K]>>;
+/**
+ * The CPU functions behind the dispatcher methods the WebGPU accelerator implements (its `createAccelerator`
+ * list), under the dispatcher's names. The plain methods call these directly, so they stay synchronous.
+ */
+declare const CPU: {
+    breadthFirstSearch: typeof breadthFirstSearch;
+    sssp: typeof dijkstra;
+    bellmanFord: typeof bellmanFord;
+    allPairsShortestPath: typeof allPairsShortestPath;
+    pageRank: typeof pageRank;
+    personalizedPageRank: typeof personalizedPageRank;
+    eigenvectorCentrality: typeof eigenvectorCentrality;
+    katzCentrality: typeof katzCentrality;
+    hits: typeof hits;
+    closenessCentrality: typeof closenessCentrality;
+    betweennessCentrality: typeof betweennessCentrality;
+    edgeBetweennessCentrality: typeof edgeBetweennessCentrality;
+    connectedComponents: typeof connectedComponents;
+    weaklyConnectedComponents: typeof weaklyConnectedComponents;
+    triangleCount: typeof triangleCount;
+    labelPropagation: typeof labelPropagation;
+    labelPropagationSynchronous: typeof labelPropagationSynchronous;
+};
+type GpuKey = keyof typeof CPU;
+export declare const UNWEIGHTED: ReadonlySet<string>;
+export declare const NO_FIELD: ReadonlySet<string>;
+export declare const DEFAULTS: Readonly<Record<string, Readonly<Record<string, unknown>>>>;
+export declare const DIRECTED: ReadonlySet<string>;
+/** The all-pairs result. */
+interface ApspResult {
+    distance(from: ElementRef, to: ElementRef): number;
+    /** The path; throws when the run was made with `paths: false`. */
+    path(from: ElementRef, to: ElementRef): CollectionReturnValue;
+    readonly hasNegativeWeightCycle: boolean;
+}
+/** A PageRank result. */
+type RankResult = ScoreResult & {
+    rank(node: ElementRef): number | undefined;
+    iterations: number;
+    converged: boolean;
+};
+/** What label propagation reports beside the partition; undefined when the GPU ran. */
+interface LpaReport {
+    iterations: number | undefined;
+    converged: boolean | undefined;
+}
+/** A result that is plain from a plain method and a promise from an `...Async` method. */
+type MaybeAsync<T> = T | Promise<T>;
+interface Rooted extends AlgorithmOptions {
+    /** The start node: a selector or a collection (its first node). */
+    readonly root: NodeSelection;
+}
+interface PointToPoint extends Rooted {
+    /** The node to reach. */
+    readonly goal: NodeSelection;
+}
+interface WalkOptions extends Rooted {
+    /** Stop when this node is reached; it is then `found`. */
+    readonly goal?: NodeSelection;
+    /** Stop expanding at this many hops from the root; unbounded when absent. */
+    readonly maxDepth?: number;
+}
+interface FlowOptions extends AlgorithmOptions, Omit<MaxFlowOptions, "weights"> {
+    /** The node the flow leaves. */
+    readonly source: NodeSelection;
+    /** The node the flow arrives at. */
+    readonly sink: NodeSelection;
+}
+interface IsomorphismOptions extends AlgorithmOptions {
+    /**
+     * The graph to compare with, read with the same `directed`: a collection, an array of elements, or a selector
+     * over the whole core (for example ".second", matching that graph's nodes and edges).
+     */
+    readonly other: Collection | readonly (NodeSingular | EdgeSingular)[] | string;
+    /** Two nodes may be paired only when this returns true; by default any two may. */
+    readonly nodeMatch?: (a: NodeSingular, b: NodeSingular) => boolean;
+    /** Two edges may be paired only when this returns true; by default any two may. */
+    readonly edgeMatch?: (a: EdgeSingular, b: EdgeSingular) => boolean;
+}
+interface MatchingOptions extends AlgorithmOptions {
+    /** One side of the bipartite graph; inferred when absent. */
+    readonly left?: NodeSelection;
+    /** The other side; inferred when absent. */
+    readonly right?: NodeSelection;
+    /** With `directed`: "both" (default) ignores direction; "out" joins a left node only to its out-neighbors. */
+    readonly arcs?: "both" | "out";
+}
+/** A cap on path length. */
+interface Cutoff {
+    /** Stop relaxing beyond this distance; a node farther away reads as unreachable. Unbounded when absent. */
+    readonly cutoff?: number;
+}
+/** Sampled centrality. */
+interface Sampled {
+    /** The nodes to run from, a selector or a collection; default every node. */
+    readonly sources?: NodeSelection;
+}
+/** One node pair. */
+interface PairOptions {
+    /** One node of the pair. */
+    readonly source: NodeSelection;
+    /** The other node of the pair. */
+    readonly target: NodeSelection;
+}
+/** Several node pairs. */
+interface PairsOptions {
+    /** The node pairs to score, each `[a, b]` of selectors or collections. */
+    readonly pairs: readonly NodePair[];
+}
+/** The nodes link prediction may propose. */
+interface Candidates {
+    /** The nodes to consider linking to `root`; default every node. */
+    readonly candidates?: NodeSelection;
+}
+interface MatchingResult {
+    readonly size: number;
+    /** The node matched with this one, either side. */
+    mate(node: ElementRef): NodeSingular | undefined;
+}
+type WeightedFlag<T> = AlgorithmOptions & Omit<T, "weighted" | "weights">;
+declare const IMPLS: {
+    breadthFirstSearch: (c: Ctx, o: WalkOptions) => MaybeAsync<SearchResult>;
+    directionOptimizedBfs: (c: Ctx, o: Rooted & DirectionOptimizedBfsOptions) => SearchResult;
+    depthFirstSearch: (c: Ctx, o: Omit<WalkOptions, "maxDepth"> & {
+        /** "pre" (default) lists a node when it is first reached, "post" when everything below it is finished. */
+        readonly order?: "pre" | "post";
+    }) => SearchResult;
+    hasCycle: (c: Ctx, _o?: AlgorithmOptions) => boolean;
+    topologicalSort: (c: Ctx, _o?: AlgorithmOptions) => NodeCollection | null;
+    dijkstra: (c: Ctx, o: Rooted & Cutoff) => PathsResult | Promise<PathsResult>;
+    bellmanFord: (c: Ctx, o: Rooted & Cutoff) => MaybeAsync<PathsResult & {
+        readonly hasNegativeWeightCycle: boolean;
+    }>;
+    bidirectionalDijkstra: (c: Ctx, o: PointToPoint) => PointPathResult;
+    aStar: (c: Ctx, o: PointToPoint & {
+        /** An estimate of the distance left from a node to `goal`, never more than the real one. Default 0. */
+        readonly heuristic?: (node: NodeSingular) => number;
+    }) => PointPathResult;
+    allPairsShortestPath: (c: Ctx, _o?: AlgorithmOptions & Omit<ApspOptions, "weights" | "weighted">) => MaybeAsync<ApspResult>;
+    degreeCentrality: (c: Ctx, _o?: AlgorithmOptions & DegreeCentralityOptions) => ScoreResult & {
+        degree(node: ElementRef): number | undefined;
+    };
+    degrees: (c: Ctx, _o?: AlgorithmOptions) => {
+        indegree(node: ElementRef): number | undefined;
+        outdegree(node: ElementRef): number | undefined;
+    };
+    pageRank: (c: Ctx, o?: WeightedFlag<Omit<PageRankOptions, "initialRanks">> & {
+        /** Starting rank of each node. */
+        readonly initialRanks?: (node: NodeSingular) => number;
+    }) => MaybeAsync<RankResult>;
+    personalizedPageRank: (c: Ctx, o: WeightedFlag<Omit<PageRankOptions, "initialRanks">> & {
+        /** The teleport set: a selection (uniform over it) or a weight per node. */
+        readonly personalization: NodeSelection | ((node: NodeSingular) => number);
+        /** Starting rank of each node. */
+        readonly initialRanks?: (node: NodeSingular) => number;
+    }) => MaybeAsync<RankResult>;
+    deltaPageRank: (c: Ctx, o?: WeightedFlag<Omit<DeltaPageRankComputeOptions, "personalization">> & {
+        /**
+         * Process the largest pending delta first (`PriorityDeltaPageRank`, which ignores `personalization`); its
+         * ranks match `graphtyPageRank({ directed: true })`. Without it the ranks can differ from PageRank's (by up
+         * to 0.07 on the karate club), the run usually goes on until `maxIterations`, and a `maxIterations` in the
+         * thousands overflows and throws.
+         */
+        readonly priority?: boolean;
+        /** The teleport set: a selection (uniform over it) or a weight per node. */
+        readonly personalization?: NodeSelection | ((node: NodeSingular) => number);
+    }) => ScoreResult & {
+        rank(node: ElementRef): number | undefined;
+    };
+    eigenvectorCentrality: (c: Ctx, o?: AlgorithmOptions & Omit<EigenvectorOptions, "startVector"> & {
+        /** Starting value of each node; default uniform. */
+        readonly startVector?: (node: NodeSingular) => number;
+    }) => MaybeAsync<ScoreResult & {
+        iterations: number;
+        converged: boolean;
+    }>;
+    katzCentrality: (c: Ctx, _o?: WeightedFlag<KatzOptions>) => MaybeAsync<ScoreResult & {
+        iterations: number;
+        converged: boolean;
+    }>;
+    hits: (c: Ctx, _o?: WeightedFlag<HitsOptions>) => MaybeAsync<ScoreResult & {
+        hub(node: ElementRef): number | undefined;
+        authority(node: ElementRef): number | undefined;
+        iterations: number;
+        converged: boolean;
+    }>;
+    closenessCentrality: (c: Ctx, o?: WeightedFlag<Omit<ClosenessOptions, "sources">> & Sampled) => MaybeAsync<ScoreResult & {
+        closeness(node: ElementRef): number | undefined;
+    }>;
+    nodeClosenessCentrality: (c: Ctx, o: Rooted & Omit<ClosenessOptions, "sources" | "k" | "weights" | "weighted">) => number;
+    betweennessCentrality: (c: Ctx, o?: AlgorithmOptions & Omit<BetweennessOptions, "sources"> & Sampled) => MaybeAsync<ScoreResult & {
+        betweenness(node: ElementRef): number | undefined;
+        betweennessNormalized(node: ElementRef): number | undefined;
+    }>;
+    edgeBetweennessCentrality: (c: Ctx, o?: AlgorithmOptions & Sampled & {
+        /** Divide by `(n - 1)(n - 2)` on a directed graph, half that on an undirected one. Default false. */
+        readonly normalized?: boolean;
+        /**
+         * Draw this many source nodes instead of using every node; the same count draws the same nodes. Not
+         * rescaled (see `sources`).
+         */
+        readonly k?: number;
+    }) => MaybeAsync<ScoreResult>;
+    connectedComponents: (c: Ctx, _o?: AlgorithmOptions) => MaybeAsync<Partition>;
+    weaklyConnectedComponents: (c: Ctx, _o?: AlgorithmOptions) => MaybeAsync<Partition>;
+    stronglyConnectedComponents: (c: Ctx, _o?: AlgorithmOptions) => Partition;
+    condensation: (c: Ctx, _o?: AlgorithmOptions) => Partition<{
+        condensed: DerivedGraph;
+    }>;
+    kCoreDecomposition: (c: Ctx, _o?: AlgorithmOptions) => ScoreResult & {
+        maxCore: number;
+        core(k: number): NodeCollection;
+    };
+    triangleCount: (c: Ctx, _o?: AlgorithmOptions) => MaybeAsync<ScoreResult & {
+        coefficient(node: ElementRef): number | undefined;
+        total: number;
+        transitivity: number;
+    }>;
+    isBipartite: (c: Ctx, _o?: AlgorithmOptions & BipartiteOptions) => {
+        bipartite: boolean;
+        partitionFirst: NodeCollection;
+        partitionSecond: NodeCollection;
+    };
+    isGraphIsomorphic: (c: Ctx, o: IsomorphismOptions) => {
+        isomorphic: boolean;
+        mapping(node: ElementRef): NodeSingular | undefined;
+    };
+    findAllIsomorphisms: (c: Ctx, o: IsomorphismOptions) => ((node: ElementRef) => NodeSingular | undefined)[];
+    modularity: (c: Ctx, o: AlgorithmOptions & Omit<ModularityOptions, "weights"> & {
+        /** The clusters (a partition result, or selections), or the node data field holding each node's cluster. */
+        readonly clusters: string | readonly NodeSelection[];
+    }) => number;
+    louvain: (c: Ctx, _o?: AlgorithmOptions & LouvainOptions) => Partition<{
+        modularity: number;
+        iterations: number;
+    }>;
+    leiden: (c: Ctx, _o?: AlgorithmOptions & LeidenOptions) => Partition<{
+        modularity: number;
+        iterations: number;
+    }>;
+    labelPropagation: (c: Ctx, _o?: WeightedFlag<LabelPropagationOptions>) => MaybeAsync<Partition<LpaReport>>;
+    labelPropagationSynchronous: (c: Ctx, _o?: AlgorithmOptions & {
+        /** Iteration cap. */
+        readonly maxIterations?: number;
+    }) => MaybeAsync<Partition<LpaReport>>;
+    labelPropagationSemiSupervised: (c: Ctx, o: WeightedFlag<LabelPropagationOptions> & {
+        /**
+         * Seed labels: the node data field holding them (nodes without it are free), or one selection per label.
+         * Free nodes start unlabeled and take a seed label when one reaches them, so every node connected to a seed
+         * ends in a seed's cluster. Each connected group of nodes no seed reaches becomes a cluster of its own.
+         */
+        readonly seeds: string | readonly NodeSelection[];
+    }) => Partition<{
+        iterations: number;
+        converged: boolean;
+    }>;
+    girvanNewman: (c: Ctx, _o?: AlgorithmOptions & GirvanNewmanOptions) => Partition<{
+        modularity: number;
+        levels: number;
+        level(k: number): Partition;
+        modularities: number[];
+    }>;
+    markovClustering: (c: Ctx, _o?: AlgorithmOptions & Omit<MarkovOptions, "weights">) => Partition<{
+        iterations: number;
+        converged: boolean;
+    }>;
+    spectralClustering: (c: Ctx, o: AlgorithmOptions & Omit<SpectralOptions, "weights">) => Partition<{
+        converged: boolean;
+        eigenvalues: Float64Array;
+    }>;
+    hierarchicalClustering: (c: Ctx, _o?: AlgorithmOptions & HierarchicalOptions) => {
+        cut(height: number): Partition;
+        cutAt(by: {
+            readonly clusters: number;
+        } | {
+            readonly distance: number;
+        }): Partition;
+        readonly merges: number;
+    };
+    teraHAC: (c: Ctx, _o?: AlgorithmOptions & TeraHacOptions) => Partition<{
+        merges: number;
+    }>;
+    grsbm: (c: Ctx, _o?: WeightedFlag<GrsbmOptions>) => Partition;
+    syncClustering: (c: Ctx, o: AlgorithmOptions & SyncClusteringOptions) => Partition<{
+        loss: number;
+        iterations: number;
+        converged: boolean;
+    }>;
+    kruskalMST: (c: Ctx, _o?: AlgorithmOptions) => CollectionReturnValue & {
+        totalWeight: number;
+    };
+    primMST: (c: Ctx, o?: AlgorithmOptions & {
+        /** The node the tree grows from; default the first node. */
+        readonly root?: NodeSelection;
+        /** Grow a tree in every component instead of throwing on a disconnected graph. Default false. */
+        readonly forest?: boolean;
+    }) => CollectionReturnValue & {
+        totalWeight: number;
+    };
+    maxFlow: (c: Ctx, o: FlowOptions) => CutResult & {
+        flow(edge: ElementRef): number | undefined;
+    };
+    minSTCut: (c: Ctx, o: FlowOptions) => CutResult;
+    stoerWagner: (c: Ctx, _o?: AlgorithmOptions) => CutResult;
+    kargerMinCut: (c: Ctx, _o?: AlgorithmOptions & Omit<KargerOptions, "weights">) => CutResult;
+    maximumBipartiteMatching: (c: Ctx, o?: MatchingOptions) => MatchingResult;
+    greedyBipartiteMatching: (c: Ctx, o?: MatchingOptions) => MatchingResult;
+    commonNeighborsScore: (c: Ctx, o: AlgorithmOptions & PairOptions) => number;
+    adamicAdarScore: (c: Ctx, o: AlgorithmOptions & PairOptions) => number;
+    commonNeighborsPrediction: (c: Ctx, _o?: AlgorithmOptions & Omit<LinkPredictionOptions, "directed" | "uniquePairs">) => PredictedLink[];
+    adamicAdarPrediction: (c: Ctx, _o?: AlgorithmOptions & Omit<LinkPredictionOptions, "directed" | "uniquePairs">) => PredictedLink[];
+    commonNeighborsForPairs: (c: Ctx, o: AlgorithmOptions & PairsOptions) => number[];
+    adamicAdarForPairs: (c: Ctx, o: AlgorithmOptions & PairsOptions) => number[];
+    topCandidatesForNode: (c: Ctx, o: Rooted & Omit<CandidateOptions, "directed" | "candidates"> & Candidates) => PredictedLink[];
+    topAdamicAdarCandidatesForNode: (c: Ctx, o: Rooted & Omit<CandidateOptions, "directed" | "candidates"> & Candidates) => PredictedLink[];
+    evaluateCommonNeighbors: (c: Ctx, o: EvaluateOptions) => LinkPredictionMetrics;
+    evaluateAdamicAdar: (c: Ctx, o: EvaluateOptions) => LinkPredictionMetrics;
+    compareAdamicAdarWithCommonNeighbors: (c: Ctx, o: EvaluateOptions) => {
+        adamicAdar: LinkPredictionMetrics;
+        commonNeighbors: LinkPredictionMetrics;
+    };
+};
+type Impls = typeof IMPLS;
+type Tail<T extends readonly unknown[]> = T extends readonly [unknown, ...infer R] ? R : never;
+/** The methods `cytoscape.use(graphtyCytoscape)` adds to every collection and to the core. */
+export type GraphtyAlgorithms = {
+    [K in keyof Impls as `graphty${Capitalize<K>}`]: (...options: Tail<Parameters<Impls[K]>>) => Awaited<ReturnType<Impls[K]>>;
+} & {
+    [K in AsyncKey as `graphty${Capitalize<K>}Async`]: (...options: Tail<Parameters<Impls[K]>>) => Promise<Awaited<ReturnType<Impls[K]>> & {
+        readonly backend: Backend;
+    }>;
+};
+declare module "cytoscape" {
+    interface CollectionAlgorithms extends GraphtyAlgorithms {
+    }
+    interface Core extends GraphtyAlgorithms {
+    }
+}
+/** Every synchronous method name `cytoscape.use(graphtyCytoscape)` registers on collections and the core. */
+export declare const ALGORITHM_NAMES: readonly string[];
+declare const ASYNC_KEYS: readonly ["breadthFirstSearch", "dijkstra", "bellmanFord", "allPairsShortestPath", "pageRank", "personalizedPageRank", "eigenvectorCentrality", "katzCentrality", "hits", "closenessCentrality", "betweennessCentrality", "edgeBetweennessCentrality", "connectedComponents", "weaklyConnectedComponents", "triangleCount", "labelPropagation", "labelPropagationSynchronous"];
+/** The algorithms with an `...Async` method: those the WebGPU accelerator can run. */
+type AsyncKey = (typeof ASYNC_KEYS)[number];
+/** Every `...Async` method name: the algorithms the WebGPU accelerator can run. */
+export declare const ASYNC_ALGORITHM_NAMES: readonly string[];
+/** The registration function Cytoscape's `use()` calls. */
+type Register = (type: string, name: string, registrant: unknown) => void;
+/**
+ * Registers every algorithm as a collection method and a core method named "graphty<Name>".
+ * @param cytoscape - the cytoscape function
+ */
+export declare function registerAlgorithms(cytoscape: Register): void;
+export {};
+//# sourceMappingURL=algorithms.d.ts.map

package/dist/algorithms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithms.d.ts","sourceRoot":"","sources":["../src/algorithms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAEH,KAAK,qBAAqB,EAI1B,oBAAoB,EACpB,KAAK,WAAW,EAEhB,WAAW,EACX,qBAAqB,EACrB,KAAK,kBAAkB,EAEvB,KAAK,gBAAgB,EACrB,kBAAkB,EAClB,KAAK,gBAAgB,EACrB,mBAAmB,EACnB,KAAK,gBAAgB,EAKrB,mBAAmB,EAEnB,KAAK,uBAAuB,EAG5B,KAAK,2BAA2B,EAEhC,QAAQ,EAER,KAAK,4BAA4B,EACjC,yBAAyB,EACzB,qBAAqB,EACrB,KAAK,kBAAkB,EAOvB,KAAK,mBAAmB,EAGxB,KAAK,YAAY,EAGjB,KAAK,mBAAmB,EACxB,IAAI,EACJ,KAAK,WAAW,EAIhB,KAAK,aAAa,EAClB,cAAc,EACd,KAAK,WAAW,EAGhB,gBAAgB,EAChB,KAAK,uBAAuB,EAE5B,2BAA2B,EAE3B,KAAK,aAAa,EAClB,KAAK,qBAAqB,EAC1B,KAAK,qBAAqB,EAG1B,KAAK,cAAc,EAEnB,KAAK,aAAa,EAElB,KAAK,cAAc,EAKnB,KAAK,iBAAiB,EAEtB,QAAQ,EACR,KAAK,eAAe,EACpB,oBAAoB,EAIpB,KAAK,eAAe,EAIpB,KAAK,qBAAqB,EAE1B,KAAK,cAAc,EAEnB,aAAa,EACb,yBAAyB,EAC5B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACH,KAAK,YAAY,EAEjB,KAAK,aAAa,EAMrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,KAAK,EACR,UAAU,EAEV,qBAAqB,EACrB,IAAI,EACJ,cAAc,EACd,YAAY,EACZ,cAAc,EACd,YAAY,EACf,MAAM,WAAW,CAAC;AAGnB,OAAO,EACH,KAAK,OAAO,EAKZ,KAAK,OAAO,EAGf,MAAM,UAAU,CAAC;AAClB,OAAO,EAEH,KAAK,iBAAiB,EAItB,KAAK,aAAa,EAClB,KAAK,eAAe,EAGvB,MAAM,eAAe,CAAC;AAEvB,0GAA0G;AAC1G,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,UAAU,GAAG,cAAc,GAAG,cAAc,CAAC;AAE/E,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC7B,8GAA8G;IAC9G,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,mGAAmG;IACnG,QAAQ,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC5C;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED,4CAA4C;AAC5C,MAAM,WAAW,WAAW;IACxB,+EAA+E;IAC/E,KAAK,CAAC,GAAG,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;CAC9C;AAED,mGAAmG;AACnG,MAAM,MAAM,SAAS,CAAC,CAAC,GAAG,MAAM,IAAI,cAAc,EAAE,GAChD,CAAC,GAAG;IACA,0GAA0G;IAC1G,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;CACjD,CAAC;AAEN,mEAAmE;AACnE,MAAM,WAAW,WAAW;IACxB,yDAAyD;IACzD,UAAU,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAAC;IACrC,oFAAoF;IACpF,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,qBAAqB,CAAC;CACnD;AAED,uEAAuE;AACvE,MAAM,WAAW,YAAY;IACzB,kFAAkF;IAClF,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAC;IACrC,uDAAuD;IACvD,QAAQ,CAAC,KAAK,EAAE,qBAAqB,CAAC;IACtC;;;OAGG;IACH,KAAK,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;IAC5C,sFAAsF;IACtF,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,YAAY,GAAG,SAAS,CAAC;CACtD;AAED,uEAAuE;AACvE,MAAM,WAAW,eAAe;IAC5B,iDAAiD;IACjD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,uDAAuD;IACvD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAC;CACxC;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACtB,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,oCAAoC;IACpC,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC;IAC7B,oEAAoE;IACpE,QAAQ,CAAC,cAAc,EAAE,cAAc,CAAC;IACxC,mCAAmC;IACnC,QAAQ,CAAC,eAAe,EAAE,cAAc,CAAC;CAC5C;AAED,wBAAwB;AACxB,MAAM,WAAW,aAAa;IAC1B,oCAAoC;IACpC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,qBAAqB;IACrB,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CAC1B;AAED,wDAAwD;AACxD,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;AAE/D,wEAAwE;AACxE,UAAU,eAAgB,SAAQ,gBAAgB;IAC9C,wFAAwF;IACxF,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IACpC,mEAAmE;IACnE,QAAQ,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,CAAC;CAC1C;AAED,gDAAgD;AAChD,UAAU,GAAG;IACT,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAClB,QAAQ,CAAC,EAAE,EAAE,iBAAiB,CAAC;IAC/B,QAAQ,CAAC,CAAC,EAAE,aAAa,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,sFAAsF;IACtF,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,0GAA0G;IAC1G,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC;;;OAGG;IACH,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;CAC9F;AAED,mHAAmH;AACnH,KAAK,QAAQ,GAAG,IAAI,CAAC,qBAAqB,EAAE,aAAa,CAAC,CAAC;AAC3D,KAAK,GAAG,CAAC,CAAC,SAAS,MAAM,QAAQ,IAAI,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEtE;;;GAGG;AACH,QAAA,MAAM,GAAG;;;;;;;;;;;;;;;;;;CAkBmF,CAAC;AAE7F,KAAK,MAAM,GAAG,MAAM,OAAO,GAAG,CAAC;AA2C/B,eAAO,MAAM,UAAU,EAAE,WAAW,CAAC,MAAM,CAoCzC,CAAC;AAGH,eAAO,MAAM,QAAQ,EAAE,WAAW,CAAC,MAAM,CA2BvC,CAAC;AAOH,eAAO,MAAM,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAahF,CAAC;AAGF,eAAO,MAAM,QAAQ,EAAE,WAAW,CAAC,MAAM,CAKvC,CAAC;AA6dH,4BAA4B;AAC5B,UAAU,UAAU;IAChB,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,GAAG,MAAM,CAAC;IACnD,kEAAkE;IAClE,IAAI,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,GAAG,qBAAqB,CAAC;IAC9D,QAAQ,CAAC,sBAAsB,EAAE,OAAO,CAAC;CAC5C;AAsCD,yBAAyB;AACzB,KAAK,UAAU,GAAG,WAAW,GAAG;IAAE,IAAI,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,CAAC;AA0BvH,uFAAuF;AACvF,UAAU,SAAS;IACf,UAAU,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,SAAS,EAAE,OAAO,GAAG,SAAS,CAAC;CAClC;AAED,0FAA0F;AAC1F,KAAK,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAKpC,UAAU,MAAO,SAAQ,gBAAgB;IACrC,mEAAmE;IACnE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;CAChC;AAED,UAAU,YAAa,SAAQ,MAAM;IACjC,yBAAyB;IACzB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;CAChC;AAED,UAAU,WAAY,SAAQ,MAAM;IAChC,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC;IAC9B,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,UAAU,WAAY,SAAQ,gBAAgB,EAAE,IAAI,CAAC,cAAc,EAAE,SAAS,CAAC;IAC3E,gCAAgC;IAChC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,oCAAoC;IACpC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;CAChC;AAED,UAAU,kBAAmB,SAAQ,gBAAgB;IACjD;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,CAAC,YAAY,GAAG,YAAY,CAAC,EAAE,GAAG,MAAM,CAAC;IAC/E,mFAAmF;IACnF,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,KAAK,OAAO,CAAC;IACnE,mFAAmF;IACnF,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,KAAK,OAAO,CAAC;CACtE;AAED,UAAU,eAAgB,SAAQ,gBAAgB;IAC9C,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC;IAC9B,4CAA4C;IAC5C,QAAQ,CAAC,KAAK,CAAC,EAAE,aAAa,CAAC;IAC/B,8GAA8G;IAC9G,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;CAClC;AAED,4BAA4B;AAC5B,UAAU,MAAM;IACZ,2GAA2G;IAC3G,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,0BAA0B;AAC1B,UAAU,OAAO;IACb,6EAA6E;IAC7E,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,CAAC;CACpC;AAED,qBAAqB;AACrB,UAAU,WAAW;IACjB,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,kCAAkC;IAClC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;CAClC;AAED,0BAA0B;AAC1B,UAAU,YAAY;IAClB,0EAA0E;IAC1E,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;CACvC;AAED,6CAA6C;AAC7C,UAAU,UAAU;IAChB,mEAAmE;IACnE,QAAQ,CAAC,UAAU,CAAC,EAAE,aAAa,CAAC;CACvC;AAaD,UAAU,cAAc;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,IAAI,CAAC,IAAI,EAAE,UAAU,GAAG,YAAY,GAAG,SAAS,CAAC;CACpD;AAED,KAAK,YAAY,CAAC,CAAC,IAAI,gBAAgB,GAAG,IAAI,CAAC,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,CAAC;AA6C1E,QAAA,MAAM,KAAK;4BAEiB,GAAG,KAAK,WAAW,KAAG,UAAU,CAAC,YAAY,CAAC;+BAM3C,GAAG,KAAK,MAAM,GAAG,4BAA4B,KAAG,YAAY;0BAGhF,GAAG,KACH,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,GAAG;QAC/B,0GAA0G;QAC1G,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;KACnC,KACF,YAAY;kBAQD,GAAG,OAAM,gBAAgB,KAAQ,OAAO;yBACjC,GAAG,OAAM,gBAAgB,KAAQ,cAAc,GAAG,IAAI;kBAI7D,GAAG,KAAK,MAAM,GAAG,MAAM,KAAG,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;qBAIzD,GAAG,KAAK,MAAM,GAAG,MAAM,KAAG,UAAU,CAAC,WAAW,GAAG;QAAE,QAAQ,CAAC,sBAAsB,EAAE,OAAO,CAAA;KAAE,CAAC;+BAKtF,GAAG,KAAK,YAAY,KAAG,eAAe;eAM1D,GAAG,KACH,YAAY,GAAG;QACd,uGAAuG;QACvG,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,MAAM,CAAC;KACvD,KACF,eAAe;8BAaX,GAAG,OACF,gBAAgB,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,GAAG,UAAU,CAAC,KACjE,UAAU,CAAC,UAAU,CAAC;0BAIlB,GAAG,OACF,gBAAgB,GAAG,uBAAuB,KAC/C,WAAW,GAAG;QAAE,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAA;KAAE;iBAK1D,GAAG,OACF,gBAAgB,KACrB;QAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;QAAC,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAA;KAAE;kBAW/F,GAAG,MACH,YAAY,CAAC,IAAI,CAAC,eAAe,EAAE,cAAc,CAAC,CAAC,GAAG;QACrD,kCAAkC;QAClC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,MAAM,CAAC;KAC1D,KACF,UAAU,CAAC,UAAU,CAAC;8BAKlB,GAAG,KACH,YAAY,CAAC,IAAI,CAAC,eAAe,EAAE,cAAc,CAAC,CAAC,GAAG;QACrD,4EAA4E;QAC5E,QAAQ,CAAC,eAAe,EAAE,aAAa,GAAG,CAAC,CAAC,IAAI,EAAE,YAAY,KAAK,MAAM,CAAC,CAAC;QAC3E,kCAAkC;QAClC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,MAAM,CAAC;KAC1D,KACF,UAAU,CAAC,UAAU,CAAC;uBAQlB,GAAG,MACH,YAAY,CAAC,IAAI,CAAC,2BAA2B,EAAE,iBAAiB,CAAC,CAAC,GAAG;QACpE;;;;;WAKG;QACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;QAC5B,4EAA4E;QAC5E,QAAQ,CAAC,eAAe,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,IAAI,EAAE,YAAY,KAAK,MAAM,CAAC,CAAC;KAC/E,KACF,WAAW,GAAG;QAAE,IAAI,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAA;KAAE;+BAuBxD,GAAG,MACH,gBAAgB,GACf,IAAI,CAAC,kBAAkB,EAAE,aAAa,CAAC,GAAG;QACtC,oDAAoD;QACpD,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,MAAM,CAAC;KACzD,KACN,UAAU,CAAC,WAAW,GAAG;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAA;KAAE,CAAC;wBAOhE,GAAG,OACF,YAAY,CAAC,WAAW,CAAC,KAC9B,UAAU,CAAC,WAAW,GAAG;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAA;KAAE,CAAC;cAKhE,GAAG,OACF,YAAY,CAAC,WAAW,CAAC,KAC9B,UAAU,CACT,WAAW,GAAG;QACV,GAAG,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;QAC1C,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;QAChD,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,OAAO,CAAC;KACtB,CACJ;6BAUM,GAAG,MACH,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC,GAAG,OAAO,KAC7D,UAAU,CAAC,WAAW,GAAG;QAAE,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAA;KAAE,CAAC;iCAOzE,GAAG,KACH,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,SAAS,GAAG,GAAG,GAAG,SAAS,GAAG,UAAU,CAAC,KAC7E,MAAM;+BAEF,GAAG,MACH,gBAAgB,GAAG,IAAI,CAAC,kBAAkB,EAAE,SAAS,CAAC,GAAG,OAAO,KACpE,UAAU,CACT,WAAW,GAAG;QACV,WAAW,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;QAClD,qBAAqB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;KAC/D,CACJ;mCAsBM,GAAG,MACH,gBAAgB,GACf,OAAO,GAAG;QACN,qGAAqG;QACrG,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;QAC9B;;;WAGG;QACH,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;KACvB,KACN,UAAU,CAAC,WAAW,CAAC;6BAQD,GAAG,OAAM,gBAAgB,KAAQ,UAAU,CAAC,SAAS,CAAC;mCAEhD,GAAG,OAAM,gBAAgB,KAAQ,UAAU,CAAC,SAAS,CAAC;qCAEpD,GAAG,OAAM,gBAAgB,KAAQ,SAAS;sBAEzD,GAAG,OAAM,gBAAgB,KAAQ,SAAS,CAAC;QAAE,SAAS,EAAE,YAAY,CAAA;KAAE,CAAC;4BAKlF,GAAG,OACF,gBAAgB,KACrB,WAAW,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,cAAc,CAAA;KAAE;uBAU9D,GAAG,OACF,gBAAgB,KACrB,UAAU,CACT,WAAW,GAAG;QAAE,WAAW,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAC3G;qBASM,GAAG,OACF,gBAAgB,GAAG,gBAAgB,KACxC;QAAE,SAAS,EAAE,OAAO,CAAC;QAAC,cAAc,EAAE,cAAc,CAAC;QAAC,eAAe,EAAE,cAAc,CAAA;KAAE;2BAUnF,GAAG,KACH,kBAAkB,KACtB;QAAE,UAAU,EAAE,OAAO,CAAC;QAAC,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,YAAY,GAAG,SAAS,CAAA;KAAE;6BAMtD,GAAG,KAAK,kBAAkB,KAAG,CAAC,CAAC,IAAI,EAAE,UAAU,KAAK,YAAY,GAAG,SAAS,CAAC,EAAE;oBAKjG,GAAG,KACH,gBAAgB,GACf,IAAI,CAAC,iBAAiB,EAAE,SAAS,CAAC,GAAG;QACjC,4GAA4G;QAC5G,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,aAAa,EAAE,CAAC;KACxD,KACN,MAAM;iBAIF,GAAG,OACF,gBAAgB,GAAG,cAAc,KACtC,SAAS,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;gBAKjD,GAAG,OACF,gBAAgB,GAAG,aAAa,KACrC,SAAS,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;0BAIlC,GAAG,OAAM,YAAY,CAAC,uBAAuB,CAAC,KAAQ,UAAU,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;qCAGrG,GAAG,OACF,gBAAgB,GAAG;QACnB,qBAAqB;QACrB,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;KACnC,KACF,UAAU,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;wCAG5B,GAAG,KACH,YAAY,CAAC,uBAAuB,CAAC,GAAG;QACvC;;;;WAIG;QACH,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,aAAa,EAAE,CAAC;KACrD,KACF,SAAS,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAA;KAAE,CAAC;sBAQjD,GAAG,OACF,gBAAgB,GAAG,mBAAmB,KAC3C,SAAS,CAAC;QACT,UAAU,EAAE,MAAM,CAAC;QACnB,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;QAC5B,YAAY,EAAE,MAAM,EAAE,CAAC;KAC1B,CAAC;0BAaK,GAAG,OACF,gBAAgB,GAAG,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,KACtD,SAAS,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAA;KAAE,CAAC;4BAKjD,GAAG,KACH,gBAAgB,GAAG,IAAI,CAAC,eAAe,EAAE,SAAS,CAAC,KACvD,SAAS,CAAC;QAAE,SAAS,EAAE,OAAO,CAAC;QAAC,WAAW,EAAE,YAAY,CAAA;KAAE,CAAC;gCASxD,GAAG,OACF,gBAAgB,GAAG,mBAAmB,KAC3C;QACC,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;QAC/B,KAAK,CAAC,EAAE,EAAE;YAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;SAAE,GAAG;YAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;SAAE,GAAG,SAAS,CAAC;QACpF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;KAC3B;iBAgBY,GAAG,OAAM,gBAAgB,GAAG,cAAc,KAAQ,SAAS,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;eAIjF,GAAG,OAAM,YAAY,CAAC,YAAY,CAAC,KAAQ,SAAS;wBAGxD,GAAG,KACH,gBAAgB,GAAG,qBAAqB,KAC5C,SAAS,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAA;KAAE,CAAC;oBAUtD,GAAG,OAAM,gBAAgB,KAAQ,qBAAqB,GAAG;QAAE,WAAW,EAAE,MAAM,CAAA;KAAE;iBAKzF,GAAG,MACH,gBAAgB,GAAG;QAClB,4DAA4D;QAC5D,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC;QAC9B,iGAAiG;QACjG,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;KAC7B,KACF,qBAAqB,GAAG;QAAE,WAAW,EAAE,MAAM,CAAA;KAAE;iBAOrC,GAAG,KAAK,WAAW,KAAG,SAAS,GAAG;QAAE,IAAI,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAAA;KAAE;kBAI/E,GAAG,KAAK,WAAW,KAAG,SAAS;qBAE5B,GAAG,OAAM,gBAAgB,KAAQ,SAAS;sBACzC,GAAG,OAAM,gBAAgB,GAAG,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,KAAQ,SAAS;kCAE/D,GAAG,MAAK,eAAe,KAAQ,cAAc;iCAE9C,GAAG,MAAK,eAAe,KAAQ,cAAc;8BAIhD,GAAG,KAAK,gBAAgB,GAAG,WAAW,KAAG,MAAM;yBAEpD,GAAG,KAAK,gBAAgB,GAAG,WAAW,KAAG,MAAM;mCAG7D,GAAG,OACF,gBAAgB,GAAG,IAAI,CAAC,qBAAqB,EAAE,UAAU,GAAG,aAAa,CAAC,KAC/E,aAAa,EAAE;8BAGX,GAAG,OACF,gBAAgB,GAAG,IAAI,CAAC,qBAAqB,EAAE,UAAU,GAAG,aAAa,CAAC,KAC/E,aAAa,EAAE;iCACW,GAAG,KAAK,gBAAgB,GAAG,YAAY,KAAG,MAAM,EAAE;4BAEvD,GAAG,KAAK,gBAAgB,GAAG,YAAY,KAAG,MAAM,EAAE;8BAGnE,GAAG,KACH,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,UAAU,GAAG,YAAY,CAAC,GAAG,UAAU,KAC3E,aAAa,EAAE;wCAaX,GAAG,KACH,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,UAAU,GAAG,YAAY,CAAC,GAAG,UAAU,KAC3E,aAAa,EAAE;iCAYW,GAAG,KAAK,eAAe,KAAG,qBAAqB;4BAIpD,GAAG,KAAK,eAAe,KAAG,qBAAqB;8CAKhE,GAAG,KACH,eAAe,KACnB;QAAE,UAAU,EAAE,qBAAqB,CAAC;QAAC,eAAe,EAAE,qBAAqB,CAAA;KAAE;CAWnF,CAAC;AAKF,KAAK,KAAK,GAAG,OAAO,KAAK,CAAC;AAC1B,KAAK,IAAI,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,IAAI,CAAC,SAAS,SAAS,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAE/F,8FAA8F;AAC9F,MAAM,MAAM,iBAAiB,GAAG;KAC3B,CAAC,IAAI,MAAM,KAAK,IAAI,UAAU,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAC7C,GAAG,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KACrC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CACrC,GAAG;KACC,CAAC,IAAI,QAAQ,IAAI,UAAU,UAAU,CAAC,CAAC,CAAC,OAAO,GAAG,CAC/C,GAAG,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KACrC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;QAAE,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;KAAE,CAAC;CAC9E,CAAC;AAIF,OAAO,QAAQ,WAAW,CAAC;IAEvB,UAAU,oBAAqB,SAAQ,iBAAiB;KAAG;IAE3D,UAAU,IAAK,SAAQ,iBAAiB;KAAG;CAC9C;AAWD,6GAA6G;AAC7G,eAAO,MAAM,eAAe,EAAE,SAAS,MAAM,EAAuC,CAAC;AAGrF,QAAA,MAAM,UAAU,gXAkB6B,CAAC;AAE9C,sFAAsF;AACtF,KAAK,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAE5C,mFAAmF;AACnF,eAAO,MAAM,qBAAqB,EAAE,SAAS,MAAM,EAAmD,CAAC;AAwJvG,2DAA2D;AAC3D,KAAK,QAAQ,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,KAAK,IAAI,CAAC;AAE1E;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,QAAQ,GAAG,IAAI,CAmB5D"}