@atlaspack/graph 3.5.10-typescript-bc4459c37.0 → 3.5.10

package/lib/Graph.d.ts

@@ -1,91 +0,0 @@
-import AdjacencyList, { SerializedAdjacencyList } from './AdjacencyList';
-import type { Edge, NodeId } from './types';
-import type { TraversalActions, GraphVisitor, GraphTraversalCallback } from '@atlaspack/types';
-import { BitSet } from './BitSet';
-export type NullEdgeType = 1;
-export declare const NULL_EDGE_TYPE: NullEdgeType;
-export type GraphOpts<TNode, TEdgeType extends number = NullEdgeType> = {
-    nodes?: Array<TNode | null>;
-    adjacencyList?: SerializedAdjacencyList<TEdgeType>;
-    rootNodeId?: NodeId | null | undefined;
-    initialCapacity?: number;
-};
-export type SerializedGraph<TNode, TEdgeType extends number = NullEdgeType> = {
-    nodes: Array<TNode | null>;
-    adjacencyList: SerializedAdjacencyList<TEdgeType>;
-    rootNodeId: NodeId | null | undefined;
-};
-export type AllEdgeTypes = -1;
-export declare const ALL_EDGE_TYPES: AllEdgeTypes;
-/**
- * Options for DFS traversal.
- */
-export type DFSParams<TContext> = {
-    visit: GraphVisitor<NodeId, TContext>;
-    /**
-     * Custom function to get next entries to visit.
-     *
-     * This can be a performance bottleneck as arrays are created on every node visit.
-     *
-     * @deprecated This will be replaced by a static `traversalType` set of orders in the future
-     *
-     * Currently, this is only used in 3 ways:
-     *
-     * - Traversing down the tree (normal DFS)
-     * - Traversing up the tree (ancestors)
-     * - Filtered version of traversal; which does not need to exist at the DFS level as the visitor
-     *   can handle filtering
-     * - Sorted traversal of BundleGraph entries, which does not have a clear use-case, but may
-     *   not be safe to remove
-     *
-     * Only due to the latter we aren't replacing this.
-     */
-    getChildren: (nodeId: NodeId) => Array<NodeId>;
-    startNodeId?: NodeId | null | undefined;
-};
-export default class Graph<TNode, TEdgeType extends number = NullEdgeType> {
-    nodes: Array<TNode | null>;
-    adjacencyList: AdjacencyList<TEdgeType>;
-    rootNodeId: NodeId | null | undefined;
-    _visited: BitSet | null | undefined;
-    constructor(opts?: GraphOpts<TNode, TEdgeType> | null);
-    setRootNodeId(id?: NodeId | null): void;
-    static deserialize<TNode, TEdgeType extends number = NullEdgeType>(opts: GraphOpts<TNode, TEdgeType>): Graph<TNode, TEdgeType>;
-    serialize(): SerializedGraph<TNode, TEdgeType>;
-    getAllEdges(): Iterator<Edge<TEdgeType | NullEdgeType>>;
-    addNode(node: TNode): NodeId;
-    hasNode(id: NodeId): boolean;
-    getNode(id: NodeId): TNode | null | undefined;
-    addEdge(from: NodeId, to: NodeId, type?: TEdgeType | NullEdgeType): boolean;
-    hasEdge(from: NodeId, to: NodeId, type?: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType>): boolean;
-    forEachNodeIdConnectedTo(to: NodeId, fn: (nodeId: NodeId) => boolean | undefined, type?: AllEdgeTypes | TEdgeType | NullEdgeType): void;
-    forEachNodeIdConnectedFrom(from: NodeId, fn: (nodeId: NodeId) => void, type?: AllEdgeTypes | TEdgeType | NullEdgeType): void;
-    getNodeIdsConnectedTo(nodeId: NodeId, type?: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType> | AllEdgeTypes): Array<NodeId>;
-    getNodeIdsConnectedFrom(nodeId: NodeId, type?: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType> | AllEdgeTypes): Array<NodeId>;
-    removeNode(nodeId: NodeId, removeOrphans?: boolean): void;
-    removeEdges(nodeId: NodeId, type?: TEdgeType | NullEdgeType): void;
-    removeEdge(from: NodeId, to: NodeId, type?: TEdgeType | NullEdgeType, removeOrphans?: boolean): void;
-    _removeEdge(from: NodeId, to: NodeId, type?: TEdgeType | NullEdgeType, removeOrphans?: boolean): void;
-    isOrphanedNode(nodeId: NodeId): boolean;
-    updateNode(nodeId: NodeId, node: TNode): void;
-    replaceNodeIdsConnectedTo(fromNodeId: NodeId, toNodeIds: ReadonlyArray<NodeId>, replaceFilter?: null | ((arg1: NodeId) => boolean), type?: TEdgeType | NullEdgeType, removeOrphans?: boolean): void;
-    traverse<TContext>(visit: GraphVisitor<NodeId, TContext>, startNodeId?: NodeId | null, type?: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType> | AllEdgeTypes): TContext | null | undefined;
-    filteredTraverse<TValue, TContext>(filter: (arg1: NodeId, arg2: TraversalActions) => TValue | null | undefined, visit: GraphVisitor<TValue, TContext>, startNodeId?: NodeId | null, type?: TEdgeType | Array<TEdgeType | NullEdgeType> | AllEdgeTypes): TContext | null | undefined;
-    traverseAncestors<TContext>(startNodeId: NodeId | null | undefined, visit: GraphVisitor<NodeId, TContext>, type?: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType> | AllEdgeTypes): TContext | null | undefined;
-    dfsFast<TContext>(visit: GraphTraversalCallback<NodeId, TContext>, startNodeId?: NodeId | null): TContext | null | undefined;
-    postOrderDfsFast(visit: GraphTraversalCallback<NodeId, TraversalActions>, startNodeId?: NodeId | null): void;
-    /**
-     * Iterative implementation of DFS that supports all use-cases.
-     *
-     * This replaces `dfs` and will replace `dfsFast`.
-     */
-    dfs<TContext>({ visit, startNodeId, getChildren, }: DFSParams<TContext>): TContext | null | undefined;
-    bfs(visit: (nodeId: NodeId) => boolean | null | undefined): NodeId | null | undefined;
-    topoSort(type?: TEdgeType): Array<NodeId>;
-    findAncestor(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): NodeId | null | undefined;
-    findAncestors(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): Array<NodeId>;
-    findDescendant(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): NodeId | null | undefined;
-    findDescendants(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): Array<NodeId>;
-    _assertHasNodeId(nodeId: NodeId): void;
-}
-export declare function mapVisitor<NodeId, TValue, TContext>(filter: (arg1: NodeId, arg2: TraversalActions) => TValue | null | undefined, visit: GraphVisitor<TValue, TContext>): GraphVisitor<NodeId, TContext>;

package/lib/index.d.ts

@@ -1,7 +0,0 @@
-export type { NodeId, ContentKey, Edge } from './types';
-export type { GraphOpts } from './Graph';
-export type { ContentGraphOpts, SerializedContentGraph } from './ContentGraph';
-export { toNodeId, fromNodeId } from './types';
-export { default as Graph, ALL_EDGE_TYPES, mapVisitor } from './Graph';
-export { default as ContentGraph } from './ContentGraph';
-export { BitSet } from './BitSet';

package/lib/shared-buffer.d.ts

@@ -1,2 +0,0 @@
-export type Class<T> = new (...args: any[]) => T;
-export declare let SharedBuffer: Class<ArrayBuffer> | Class<SharedArrayBuffer>;

package/lib/types.d.ts

@@ -1,9 +0,0 @@
-export type NodeId = number;
-export declare function toNodeId(x: number): NodeId;
-export declare function fromNodeId(x: NodeId): number;
-export type ContentKey = string;
-export type Edge<TEdgeType extends number> = {
-    from: NodeId;
-    to: NodeId;
-    type: TEdgeType;
-};

package/tsconfig.json

@@ -1,4 +0,0 @@
-{
-  "extends": "../../../tsconfig.json",
-  "include": ["src"]
-}