@manya-os/weave 1.0.0

package/dist/types/errors.d.ts

@@ -0,0 +1,28 @@
+/**
+ * @manya-os/weave — typed error hierarchy.
+ *
+ * Every public Weave API throws a subclass of `WeaveError`. Errors carry a
+ * stable `code` string for programmatic discrimination.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+/** Base class for all @manya-os/weave errors. */
+export declare class WeaveError extends Error {
+    readonly code: string;
+    readonly cause?: unknown;
+    constructor(message: string, code?: string, cause?: unknown);
+}
+/** Raised for invalid graph operations (missing nodes, duplicate ids, cycles in topo sort, etc.). */
+export declare class GraphError extends WeaveError {
+    constructor(message: string, cause?: unknown);
+}
+/** Raised when a layout algorithm fails (e.g. unsupported graph shape, no nodes). */
+export declare class LayoutError extends WeaveError {
+    constructor(message: string, cause?: unknown);
+}
+/** Raised when an export/render target is unsupported or malformed. */
+export declare class ExportError extends WeaveError {
+    constructor(message: string, cause?: unknown);
+}
+//# sourceMappingURL=errors.d.ts.map

package/dist/types/errors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../../src/errors.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,iDAAiD;AACjD,qBAAa,UAAW,SAAQ,KAAK;IACnC,SAAgB,IAAI,EAAE,MAAM,CAAC;IAC7B,SAAyB,KAAK,CAAC,EAAE,OAAO,CAAC;gBAC7B,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;CAO5D;AAED,qGAAqG;AACrG,qBAAa,UAAW,SAAQ,UAAU;gBAC5B,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;CAC7C;AAED,qFAAqF;AACrF,qBAAa,WAAY,SAAQ,UAAU;gBAC7B,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;CAC7C;AAED,uEAAuE;AACvE,qBAAa,WAAY,SAAQ,UAAU;gBAC7B,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;CAC7C"}

package/dist/types/export/exporter.d.ts

@@ -0,0 +1,47 @@
+/**
+ * @manya-os/weave — graph exporters.
+ *
+ * Serialize a graph to multiple formats:
+ *   - `toJSON`   — JSON string of the graph shape.
+ *   - `toDot`    — Graphviz DOT.
+ *   - `toMermaid`— Mermaid flowchart.
+ *   - `toSVG`    — minimal SVG using absolute positions from a layout.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+import type { Layout } from '../types.js';
+import type { Graph } from '../graph/graph.js';
+/**
+ * Serialize the graph to a JSON string.
+ *
+ * The shape is `{ directed, nodes: [...], edges: [...] }`.
+ */
+export declare function toJSON(graph: Graph): string;
+/**
+ * Serialize the graph to Graphviz DOT.
+ *
+ * Uses `digraph` for directed graphs and `graph` for undirected. Edge
+ * operators are `->` and `--` respectively.
+ */
+export declare function toDot(graph: Graph, name?: string): string;
+/**
+ * Serialize the graph to a Mermaid flowchart string.
+ *
+ * Uses `flowchart TD` for directed graphs and `flowchart LR` for undirected
+ * (Mermaid has no first-class undirected flowchart; LR is the closest visual).
+ */
+export declare function toMermaid(graph: Graph): string;
+/**
+ * Render a minimal SVG using absolute positions from a layout.
+ *
+ * This is intentionally simple. For a full-featured renderer with configurable
+ * colors, fonts, and canvas size, use `renderToSVG` from `@manya-os/weave/render`.
+ *
+ * @param graph input graph
+ * @param layout node positions
+ * @param width canvas width (default 800)
+ * @param height canvas height (default 600)
+ */
+export declare function toSVG(graph: Graph, layout: Layout, width?: number, height?: number): string;
+//# sourceMappingURL=exporter.d.ts.map

package/dist/types/export/exporter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"exporter.d.ts","sourceRoot":"","sources":["../../../src/export/exporter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAyB/C;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAM3C;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAE,MAAY,GAAG,MAAM,CAqB9D;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAqB9C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,MAAY,EACnB,MAAM,GAAE,MAAY,GACnB,MAAM,CAoCR"}

package/dist/types/export/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * @manya-os/weave — export module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { toJSON, toDot, toMermaid, toSVG } from './exporter.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/export/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/export/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC"}

package/dist/types/filter/filter.d.ts

@@ -0,0 +1,46 @@
+/**
+ * @manya-os/weave — graph filtering.
+ *
+ * Filtering produces a new `Graph` (subgraph) containing only the nodes/edges
+ * that satisfy the predicate. All filters preserve the `directed` flag.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+import type { Node, Edge, NodeID } from '../types.js';
+import { Graph } from '../graph/graph.js';
+/**
+ * Filter nodes by label.
+ *
+ * @param graph input
+ * @param predicate applied to each node's label; truthy → kept
+ */
+export declare function filterByLabel(graph: Graph, predicate: (label: string) => boolean): Graph;
+/**
+ * Filter nodes by `type`.
+ *
+ * @param graph input
+ * @param type exact type string to match; undefined → nodes with no type
+ */
+export declare function filterByType(graph: Graph, type: string | undefined): Graph;
+/**
+ * Filter edges by `type`, keeping all nodes but only matching edges.
+ */
+export declare function filterByEdgeType(graph: Graph, type: string | undefined): Graph;
+/**
+ * Keep only the connected component containing `nodeId`.
+ */
+export declare function filterByComponent(graph: Graph, nodeId: NodeID): Graph;
+/**
+ * Keep only nodes within `maxDepth` hops of `rootId` (BFS).
+ *
+ * Edges between kept nodes are preserved. The root is always included.
+ */
+export declare function filterByDepth(graph: Graph, rootId: NodeID, maxDepth: number): Graph;
+/** Keep only nodes whose properties match a predicate. */
+export declare function filterByProperty(graph: Graph, predicate: (properties: Record<string, unknown> | undefined) => boolean): Graph;
+/** Convenience: filter nodes by an arbitrary predicate. */
+export declare function filterNodes(graph: Graph, predicate: (node: Node) => boolean): Graph;
+/** Convenience: filter edges by an arbitrary predicate (nodes preserved). */
+export declare function filterEdges(graph: Graph, predicate: (edge: Edge) => boolean): Graph;
+//# sourceMappingURL=filter.d.ts.map

package/dist/types/filter/filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../../src/filter/filter.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAY1C;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,KAAK,CAIxF;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,CAO1E;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,CAQ9E;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,CAGrE;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK,CAInF;AAED,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EACZ,SAAS,EAAE,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,KAAK,OAAO,GACtE,KAAK,CAIP;AAED,2DAA2D;AAC3D,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,GAAG,KAAK,CAInF;AAED,6EAA6E;AAC7E,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,GAAG,KAAK,CAKnF"}

package/dist/types/filter/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * @manya-os/weave — filter module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { filterByLabel, filterByType, filterByEdgeType, filterByComponent, filterByDepth, filterByProperty, filterNodes, filterEdges, } from './filter.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/filter/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/filter/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,aAAa,EAAE,YAAY,EAAE,gBAAgB,EAC7C,iBAAiB,EAAE,aAAa,EAAE,gBAAgB,EAClD,WAAW,EAAE,WAAW,GACzB,MAAM,aAAa,CAAC"}

package/dist/types/graph/graph.d.ts

@@ -0,0 +1,99 @@
+/**
+ * @manya-os/weave — core graph data model.
+ *
+ * The `Graph` class is the central abstraction of @manya-os/weave. It supports
+ * both directed and undirected graphs, exposes adjacency queries, cycle
+ * detection, topological sort, and connected-component detection. All graph
+ * mutations are O(1) amortized; queries are O(degree).
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+import type { Node, Edge, NodeID, EdgeID } from '../types.js';
+/**
+ * A mutable in-memory graph.
+ *
+ * Both directed and undirected graphs are supported. For undirected graphs
+ * adjacency is symmetric: an edge `a -> b` is reachable from both endpoints.
+ */
+export declare class Graph {
+    /** Whether this graph is directed. */
+    readonly directed: boolean;
+    private readonly nodesById;
+    private readonly edgesById;
+    /** Out-adjacency: node id → set of neighbor ids. */
+    private readonly outAdj;
+    /** In-adjacency: node id → set of predecessor ids. */
+    private readonly inAdj;
+    constructor(directed?: boolean);
+    /** Add a node. Throws if a node with the same id already exists. */
+    addNode(node: Node): this;
+    /** Add multiple nodes. */
+    addNodes(nodes: Iterable<Node>): this;
+    /** Remove a node and any incident edges. No-op if the node does not exist. */
+    removeNode(id: NodeID): this;
+    /** Get a node by id, or undefined. */
+    getNode(id: NodeID): Node | undefined;
+    /** True iff a node with this id exists. */
+    hasNode(id: NodeID): boolean;
+    /** Update an existing node's data (label/type/properties). Throws if missing. */
+    updateNode(id: NodeID, patch: Partial<Omit<Node, 'id'>>): this;
+    /** Add an edge. Both endpoints must already exist. */
+    addEdge(edge: Edge): this;
+    /** Add multiple edges. */
+    addEdges(edges: Iterable<Edge>): this;
+    /** Remove an edge. No-op if missing. */
+    removeEdge(id: EdgeID): this;
+    /** Get an edge by id. */
+    getEdge(id: EdgeID): Edge | undefined;
+    /** True iff an edge with this id exists. */
+    hasEdge(id: EdgeID): boolean;
+    /** Snapshot of all nodes (new array). */
+    get nodes(): Node[];
+    /** Snapshot of all edges (new array). */
+    get edges(): Edge[];
+    /** Number of nodes. */
+    size(): number;
+    /** Number of edges. */
+    edgeCount(): number;
+    /** Outgoing neighbors (successors) of a node. */
+    successors(id: NodeID): NodeID[];
+    /** Incoming neighbors (predecessors) of a node. */
+    predecessors(id: NodeID): NodeID[];
+    /** All neighbors. For undirected graphs this equals `successors`. */
+    neighbors(id: NodeID): NodeID[];
+    /** Out-degree (number of outgoing edges). */
+    outDegree(id: NodeID): number;
+    /** In-degree (number of incoming edges). */
+    inDegree(id: NodeID): number;
+    /** Total degree. For undirected graphs this equals 2 × incident edges. */
+    degree(id: NodeID): number;
+    /** True iff the graph contains at least one cycle. */
+    hasCycle(): boolean;
+    private hasCycleDirected;
+    private hasCycleUndirected;
+    /**
+     * Topologically sort the nodes of a directed acyclic graph.
+     * Throws `GraphError` if the graph contains a cycle or is undirected.
+     */
+    topologicalSort(): NodeID[];
+    /** Find all connected components (undirected: connected; directed: weakly connected). */
+    findConnectedComponents(): NodeID[][];
+    /** Return the connected component containing `id`, as a sorted id array. */
+    componentOf(id: NodeID): NodeID[];
+    /**
+     * Breadth-first traversal from `start` up to `maxDepth` (inclusive).
+     * Returns a map of nodeId → depth.
+     */
+    bfsDepths(start: NodeID, maxDepth?: number): Map<NodeID, number>;
+    /** Clone this graph (deep copy). */
+    clone(): Graph;
+}
+/**
+ * Build a `Graph` from a list of nodes and edges.
+ * @param nodes initial nodes
+ * @param edges initial edges
+ * @param directed whether the graph is directed (default false)
+ */
+export declare function createGraph(nodes: Iterable<Node>, edges?: Iterable<Edge>, directed?: boolean): Graph;
+//# sourceMappingURL=graph.d.ts.map

package/dist/types/graph/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/graph/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAG9D;;;;;GAKG;AACH,qBAAa,KAAK;IAChB,sCAAsC;IACtC,SAAgB,QAAQ,EAAE,OAAO,CAAC;IAElC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAgC;IAC1D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAgC;IAE1D,oDAAoD;IACpD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuC;IAC9D,sDAAsD;IACtD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAuC;gBAEjD,QAAQ,GAAE,OAAe;IAMrC,oEAAoE;IACpE,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAWzB,0BAA0B;IAC1B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI;IAKrC,8EAA8E;IAC9E,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAc5B,sCAAsC;IACtC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIrC,2CAA2C;IAC3C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,iFAAiF;IACjF,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI;IAS9D,sDAAsD;IACtD,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAwBzB,0BAA0B;IAC1B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI;IAKrC,wCAAwC;IACxC,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAa5B,yBAAyB;IACzB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIrC,4CAA4C;IAC5C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAM5B,yCAAyC;IACzC,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,yCAAyC;IACzC,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,uBAAuB;IACvB,IAAI,IAAI,MAAM;IAId,uBAAuB;IACvB,SAAS,IAAI,MAAM;IAInB,iDAAiD;IACjD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAKhC,mDAAmD;IACnD,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAKlC,qEAAqE;IACrE,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAM/B,6CAA6C;IAC7C,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAI7B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAI5B,0EAA0E;IAC1E,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAO1B,sDAAsD;IACtD,QAAQ,IAAI,OAAO;IAQnB,OAAO,CAAC,gBAAgB;IA6BxB,OAAO,CAAC,kBAAkB;IAyB1B;;;OAGG;IACH,eAAe,IAAI,MAAM,EAAE;IAoC3B,yFAAyF;IACzF,uBAAuB,IAAI,MAAM,EAAE,EAAE;IA0BrC,4EAA4E;IAC5E,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAgBjC;;;OAGG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAmB1E,oCAAoC;IACpC,KAAK,IAAI,KAAK;CAMf;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EACrB,KAAK,GAAE,QAAQ,CAAC,IAAI,CAAM,EAC1B,QAAQ,GAAE,OAAe,GACxB,KAAK,CAKP"}

package/dist/types/graph/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * @manya-os/weave — graph module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { Graph, createGraph } from './graph.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC"}

package/dist/types/index.d.ts

@@ -0,0 +1,25 @@
+/**
+ * @manya-os/weave — interactive visualization substrate for the MANYA Intelligence OS.
+ *
+ * Public API surface for @manya-os/weave. Everything exported here is part of the
+ * stable, semver-bound public API.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Conceived, directed, and owned by Uviwe Menyiwe (Azura Daemon), founder
+ * of the Manya Hael Foundation.
+ *
+ * Licensed under the Apache License, Version 2.0.
+ */
+export * from './types.js';
+export * from './errors.js';
+export { Logger, LogLevel, ConsoleLogger, SilentLogger, scrubMetadata, shouldScrubField, SCRUBBED_FIELD_NAMES, } from './logging.js';
+export { Graph, createGraph } from './graph/graph.js';
+export { mulberry32, forceDirected, hierarchical, radial, grid, } from './layout/layout.js';
+export type { LayoutOptions, ForceDirectedOptions, HierarchicalOptions, RadialOptions, GridOptions, } from './layout/layout.js';
+export { filterByLabel, filterByType, filterByEdgeType, filterByComponent, filterByDepth, filterByProperty, filterNodes, filterEdges, } from './filter/filter.js';
+export { levenshtein, similarity, search, fuzzySearch, bfsPath, dijkstra, } from './search/search.js';
+export { toJSON, toDot, toMermaid, toSVG } from './export/exporter.js';
+export { renderToSVG, mergeRenderConfig, DEFAULT_RENDER_CONFIG } from './render/renderer.js';
+export { takeSnapshot, diffSnapshots, TopologyTracker } from './topology/topology.js';
+export { SelectionModel, DEFAULT_VIEWPORT, IDENTITY_VIEWPORT, applyViewport, inverseViewport, panTo, zoomAt, } from './interactive/interactive.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAG5B,OAAO,EACL,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAC7C,aAAa,EAAE,gBAAgB,EAAE,oBAAoB,GACtD,MAAM,cAAc,CAAC;AAGtB,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAGtD,OAAO,EACL,UAAU,EACV,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,GAC1C,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,aAAa,EAAE,oBAAoB,EAAE,mBAAmB,EACxD,aAAa,EAAE,WAAW,GAC3B,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,aAAa,EAAE,YAAY,EAAE,gBAAgB,EAC7C,iBAAiB,EAAE,aAAa,EAAE,gBAAgB,EAClD,WAAW,EAAE,WAAW,GACzB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,WAAW,EAAE,UAAU,EACvB,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,QAAQ,GAClB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAGvE,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAG7F,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGtF,OAAO,EACL,cAAc,EACd,gBAAgB,EAAE,iBAAiB,EACnC,aAAa,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAC9C,MAAM,8BAA8B,CAAC"}

package/dist/types/interactive/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * @manya-os/weave — interactive module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { SelectionModel, DEFAULT_VIEWPORT, IDENTITY_VIEWPORT, applyViewport, inverseViewport, panTo, zoomAt, } from './interactive.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/interactive/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/interactive/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,cAAc,EACd,gBAAgB,EAAE,iBAAiB,EACnC,aAAa,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAC9C,MAAM,kBAAkB,CAAC"}

package/dist/types/interactive/interactive.d.ts

@@ -0,0 +1,84 @@
+/**
+ * @manya-os/weave — interactive exploration primitives.
+ *
+ * `SelectionModel` tracks the currently selected nodes/edges.
+ * `Viewport` captures pan/zoom state and `applyViewport` transforms a point
+ * from graph coordinates to viewport (screen) coordinates.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+import type { NodeID, EdgeID, Point, Viewport } from '../types.js';
+/** Default viewport: centered at origin, zoom 1. */
+export declare const DEFAULT_VIEWPORT: Viewport;
+/** A mutable selection of nodes and edges for interactive exploration. */
+export declare class SelectionModel {
+    private readonly selectedNodes;
+    private readonly selectedEdges;
+    /** Select a node by id. */
+    selectNode(id: NodeID): this;
+    /** Select an edge by id. */
+    selectEdge(id: EdgeID): this;
+    /** Deselect a node. */
+    deselectNode(id: NodeID): this;
+    /** Deselect an edge. */
+    deselectEdge(id: EdgeID): this;
+    /** Toggle node selection. Returns the new selection state. */
+    toggleNode(id: NodeID): boolean;
+    /** Toggle edge selection. Returns the new selection state. */
+    toggleEdge(id: EdgeID): boolean;
+    /** True iff the node is currently selected. */
+    isNodeSelected(id: NodeID): boolean;
+    /** True iff the edge is currently selected. */
+    isEdgeSelected(id: EdgeID): boolean;
+    /** All currently selected node ids. */
+    selectedNodeIds(): NodeID[];
+    /** All currently selected edge ids. */
+    selectedEdgeIds(): EdgeID[];
+    /** Number of selected nodes. */
+    nodeCount(): number;
+    /** Number of selected edges. */
+    edgeCount(): number;
+    /** Clear all selections. */
+    clear(): this;
+    /** True iff nothing is selected. */
+    isEmpty(): boolean;
+    /** Replace the selection with the given node/edge ids. */
+    setSelection(nodes: Iterable<NodeID>, edges?: Iterable<EdgeID>): this;
+    /** Snapshot the current selection as plain arrays. */
+    toJSON(): {
+        nodes: NodeID[];
+        edges: EdgeID[];
+    };
+}
+/** Default viewport: centered at origin, zoom 1. Convenience alias. */
+export declare const IDENTITY_VIEWPORT: Viewport;
+/**
+ * Transform a point from graph coordinates to viewport (screen) coordinates.
+ *
+ * The viewport centers on `(centerX, centerY)` in graph coordinates and
+ * applies a uniform `zoom` factor. The transform is:
+ *
+ * ```
+ * screen.x = (graph.x - centerX) * zoom
+ * screen.y = (graph.y - centerY) * zoom
+ * ```
+ *
+ * @param point a point in graph coordinates
+ * @param viewport pan/zoom state
+ */
+export declare function applyViewport(point: Point, viewport: Viewport): Point;
+/** Inverse of `applyViewport`: map a screen-space point back into graph space. */
+export declare function inverseViewport(point: Point, viewport: Viewport): Point;
+/**
+ * Compute a new viewport that pans so that the given graph-space point appears
+ * at the given screen-space point.
+ *
+ * @param graphPoint a point in graph coordinates to anchor
+ * @param screenPoint where it should appear in screen coordinates
+ * @param zoom the zoom factor (preserved)
+ */
+export declare function panTo(graphPoint: Point, screenPoint: Point, zoom: number): Viewport;
+/** Create a viewport that zooms by `factor` while keeping `anchor` (screen point) fixed. */
+export declare function zoomAt(viewport: Viewport, anchor: Point, factor: number): Viewport;
+//# sourceMappingURL=interactive.d.ts.map

package/dist/types/interactive/interactive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interactive.d.ts","sourceRoot":"","sources":["../../../src/interactive/interactive.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEnE,oDAAoD;AACpD,eAAO,MAAM,gBAAgB,EAAE,QAA8C,CAAC;AAE9E,0EAA0E;AAC1E,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA0B;IACxD,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA0B;IAExD,2BAA2B;IAC3B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAK5B,4BAA4B;IAC5B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAK5B,uBAAuB;IACvB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAK9B,wBAAwB;IACxB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAK9B,8DAA8D;IAC9D,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAS/B,8DAA8D;IAC9D,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAS/B,+CAA+C;IAC/C,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAInC,+CAA+C;IAC/C,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAInC,uCAAuC;IACvC,eAAe,IAAI,MAAM,EAAE;IAI3B,uCAAuC;IACvC,eAAe,IAAI,MAAM,EAAE;IAI3B,gCAAgC;IAChC,SAAS,IAAI,MAAM;IAInB,gCAAgC;IAChC,SAAS,IAAI,MAAM;IAInB,4BAA4B;IAC5B,KAAK,IAAI,IAAI;IAMb,oCAAoC;IACpC,OAAO,IAAI,OAAO;IAIlB,0DAA0D;IAC1D,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,GAAE,QAAQ,CAAC,MAAM,CAAM,GAAG,IAAI;IAOzE,sDAAsD;IACtD,MAAM,IAAI;QAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE;CAG/C;AAED,uEAAuE;AACvE,eAAO,MAAM,iBAAiB,EAAE,QAA2B,CAAC;AAe5D;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,GAAG,KAAK,CAMrE;AAED,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,GAAG,KAAK,CAMvE;AAED;;;;;;;GAOG;AACH,wBAAgB,KAAK,CAAC,UAAU,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,CAOnF;AAED,4FAA4F;AAC5F,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,QAAQ,CAMlF"}

package/dist/types/layout/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * @manya-os/weave — layout module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { mulberry32, forceDirected, hierarchical, radial, grid, } from './layout.js';
+export type { LayoutOptions, ForceDirectedOptions, HierarchicalOptions, RadialOptions, GridOptions, } from './layout.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/layout/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,UAAU,EACV,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,GAC1C,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,aAAa,EAAE,oBAAoB,EAAE,mBAAmB,EACxD,aAAa,EAAE,WAAW,GAC3B,MAAM,aAAa,CAAC"}

package/dist/types/layout/layout.d.ts

@@ -0,0 +1,95 @@
+/**
+ * @manya-os/weave — layout algorithms.
+ *
+ * Computes 2-D positions for graph nodes. Four algorithms are provided:
+ *   - `forceDirected` — simple Fruchterman-Reingold force simulation.
+ *   - `hierarchical` — top-down layered layout (Sugiyama-style simplified).
+ *   - `radial` — concentric rings around a root.
+ *   - `grid` — regular rectangular grid.
+ *
+ * Every algorithm is **deterministic** for a given input: the force-directed
+ * layout accepts a numeric `seed` and uses a seeded PRNG (mulberry32).
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+import type { NodeID, Layout } from '../types.js';
+import type { Graph } from '../graph/graph.js';
+/** Common options for layout algorithms. */
+export interface LayoutOptions {
+    /** Canvas width. Default 800. */
+    width?: number;
+    /** Canvas height. Default 600. */
+    height?: number;
+    /** Padding from canvas edges. Default 40. */
+    padding?: number;
+}
+/** Force-directed layout options. */
+export interface ForceDirectedOptions extends LayoutOptions {
+    /** Number of simulation iterations. Default 300. */
+    iterations?: number;
+    /** Numeric RNG seed for deterministic output. Default 1. */
+    seed?: number;
+    /** Ideal edge length. Default computed from canvas. */
+    idealLength?: number;
+    /** Repulsion constant. Default 1.0. */
+    repulsion?: number;
+}
+/** Hierarchical layout options. */
+export interface HierarchicalOptions extends LayoutOptions {
+    /** Vertical gap between layers. Default 80. */
+    layerGap?: number;
+    /** Horizontal gap between nodes in a layer. Default 80. */
+    nodeGap?: number;
+    /** Optional root node id; if absent, nodes with in-degree 0 are used. */
+    root?: NodeID;
+}
+/** Radial layout options. */
+export interface RadialOptions extends LayoutOptions {
+    /** Root node id at the center. If absent, the first node is used. */
+    root?: NodeID;
+    /** Gap between rings. Default 100. */
+    ringGap?: number;
+}
+/** Grid layout options. */
+export interface GridOptions extends LayoutOptions {
+    /** Optional number of columns; if absent, computed as ceil(sqrt(n)). */
+    columns?: number;
+    /** Horizontal gap. Default 80. */
+    cellWidth?: number;
+    /** Vertical gap. Default 80. */
+    cellHeight?: number;
+}
+/**
+ * Seeded PRNG (mulberry32). Returns a function producing floats in [0, 1).
+ */
+export declare function mulberry32(seed: number): () => number;
+/**
+ * Force-directed layout (simplified Fruchterman-Reingold).
+ *
+ * @param graph input graph
+ * @param opts  options
+ * @returns layout map
+ */
+export declare function forceDirected(graph: Graph, opts?: ForceDirectedOptions): Layout;
+/**
+ * Hierarchical top-down layered layout.
+ *
+ * Layers are computed via longest-path layering from a root set. Nodes within
+ * a layer are placed left-to-right in alphabetical id order for determinism.
+ */
+export declare function hierarchical(graph: Graph, opts?: HierarchicalOptions): Layout;
+/**
+ * Radial layout — concentric rings around a root.
+ *
+ * The root is at the canvas center; nodes are placed on rings according to
+ * their BFS depth from the root, evenly spaced on each ring.
+ */
+export declare function radial(graph: Graph, opts?: RadialOptions): Layout;
+/**
+ * Grid layout — regular rectangular grid.
+ *
+ * Nodes are placed in row-major order, sorted by id for determinism.
+ */
+export declare function grid(graph: Graph, opts?: GridOptions): Layout;
+//# sourceMappingURL=layout.d.ts.map

package/dist/types/layout/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../../src/layout/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAS,MAAM,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAG/C,4CAA4C;AAC5C,MAAM,WAAW,aAAa;IAC5B,iCAAiC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,kCAAkC;IAClC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,6CAA6C;IAC7C,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,qCAAqC;AACrC,MAAM,WAAW,oBAAqB,SAAQ,aAAa;IACzD,oDAAoD;IACpD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,4DAA4D;IAC5D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,uDAAuD;IACvD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,uCAAuC;IACvC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,mCAAmC;AACnC,MAAM,WAAW,mBAAoB,SAAQ,aAAa;IACxD,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,yEAAyE;IACzE,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,6BAA6B;AAC7B,MAAM,WAAW,aAAc,SAAQ,aAAa;IAClD,qEAAqE;IACrE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,sCAAsC;IACtC,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,2BAA2B;AAC3B,MAAM,WAAW,WAAY,SAAQ,aAAa;IAChD,wEAAwE;IACxE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,kCAAkC;IAClC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gCAAgC;IAChC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,MAAM,CASrD;AAyBD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAE,oBAAyB,GAAG,MAAM,CA4FnF;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAE,mBAAwB,GAAG,MAAM,CA+EjF;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAE,aAAkB,GAAG,MAAM,CAgErE;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAE,WAAgB,GAAG,MAAM,CAqBjE"}

package/dist/types/logging.d.ts

@@ -0,0 +1,33 @@
+/**
+ * @manya-os/weave — structured logging (mirrors @manya-os/keyring pattern).
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export interface Logger {
+    debug(msg: string, meta?: Record<string, unknown>): void;
+    info(msg: string, meta?: Record<string, unknown>): void;
+    warn(msg: string, meta?: Record<string, unknown>): void;
+    error(msg: string, meta?: Record<string, unknown>): void;
+}
+export type LogLevel = 'debug' | 'info' | 'warn' | 'error' | 'silent';
+export declare const SCRUBBED_FIELD_NAMES: readonly ["token", "secret", "apiKey", "password", "credentials", "cookie"];
+export declare function shouldScrubField(name: string): boolean;
+export declare function scrubMetadata(meta: unknown): unknown;
+export declare class ConsoleLogger implements Logger {
+    private readonly level;
+    private readonly levelRank;
+    constructor(level?: LogLevel);
+    debug(msg: string, meta?: Record<string, unknown>): void;
+    info(msg: string, meta?: Record<string, unknown>): void;
+    warn(msg: string, meta?: Record<string, unknown>): void;
+    error(msg: string, meta?: Record<string, unknown>): void;
+    private emit;
+}
+export declare class SilentLogger implements Logger {
+    debug(): void;
+    info(): void;
+    warn(): void;
+    error(): void;
+}
+//# sourceMappingURL=logging.d.ts.map

package/dist/types/logging.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logging.d.ts","sourceRoot":"","sources":["../../src/logging.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,MAAM;IACrB,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACzD,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACxD,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACxD,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;CAC1D;AAED,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC;AAMtE,eAAO,MAAM,oBAAoB,6EAEvB,CAAC;AAEX,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAQtD;AAED,wBAAgB,aAAa,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAWpD;AAED,qBAAa,aAAc,YAAW,MAAM;IAE9B,OAAO,CAAC,QAAQ,CAAC,KAAK;IADlC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBACN,KAAK,GAAE,QAAiB;IAGrD,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IACxD,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IACvD,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IACvD,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IACxD,OAAO,CAAC,IAAI;CASb;AAED,qBAAa,YAAa,YAAW,MAAM;IACzC,KAAK,IAAI,IAAI;IACb,IAAI,IAAI,IAAI;IACZ,IAAI,IAAI,IAAI;IACZ,KAAK,IAAI,IAAI;CACd"}

package/dist/types/render/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * @manya-os/weave — render module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { renderToSVG, mergeRenderConfig, DEFAULT_RENDER_CONFIG } from './renderer.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/render/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/render/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC"}

package/dist/types/render/renderer.d.ts

@@ -0,0 +1,26 @@
+/**
+ * @manya-os/weave — SVG renderer with full configuration.
+ *
+ * `renderToSVG` produces a complete SVG document with configurable colors,
+ * node radius, font size, and optional label rendering. It is the
+ * feature-complete counterpart to the minimal `toSVG` in `@manya-os/weave/export`.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+import type { RenderConfig, Layout } from '../types.js';
+import type { Graph } from '../graph/graph.js';
+/** Default render configuration. */
+export declare const DEFAULT_RENDER_CONFIG: RenderConfig;
+/** Merge a partial config with defaults. */
+export declare function mergeRenderConfig(partial?: Partial<RenderConfig>): RenderConfig;
+/**
+ * Render a graph to a full SVG document.
+ *
+ * @param graph input graph
+ * @param layout node positions
+ * @param config render configuration (partial OK; merged with defaults)
+ * @returns SVG string
+ */
+export declare function renderToSVG(graph: Graph, layout: Layout, config?: Partial<RenderConfig>): string;
+//# sourceMappingURL=renderer.d.ts.map

package/dist/types/render/renderer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"renderer.d.ts","sourceRoot":"","sources":["../../../src/render/renderer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAG/C,oCAAoC;AACpC,eAAO,MAAM,qBAAqB,EAAE,YASnC,CAAC;AAEF,4CAA4C;AAC5C,wBAAgB,iBAAiB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,YAAY,CAG/E;AAYD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,GAC7B,MAAM,CA6DR"}

package/dist/types/search/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * @manya-os/weave — search module barrel.
+ *
+ * Copyright 2024 Manya Hael Foundation. All rights reserved.
+ * Licensed under the Apache License, Version 2.0.
+ */
+export { levenshtein, similarity, search, fuzzySearch, bfsPath, dijkstra, } from './search.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/search/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/search/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,WAAW,EAAE,UAAU,EACvB,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,QAAQ,GAClB,MAAM,aAAa,CAAC"}