@nshiab/simple-data-analysis-core 2.0.8 → 2.1.0

package/esm/helpers/wrapString.js

@@ -4,13 +4,6 @@
  * will be broken at the character boundary. This function is primarily used
  * for preparing text to be displayed in console tables.
  *
- * @param str - The string to wrap.
- * @param maxWidth - The maximum width of each line.
- * @param wordWrap - If true, attempts to break at word boundaries. If false,
- *   breaks at character boundaries. Defaults to `true`.
- * @returns The wrapped string with newline characters inserted at appropriate
- *   positions.
- *
  * @example
  * ```typescript
  * const text = "This is a very long sentence that needs to be wrapped";
@@ -30,6 +23,16 @@
  * // Output: Thisisaver
  * //         ylongword
  * ```
+ *
+ * @param str - The string to wrap.
+ *
+ * @param maxWidth - The maximum width of each line.
+ *
+ * @param wordWrap - If true, attempts to break at word boundaries. If false,
+ *   breaks at character boundaries. Defaults to `true`.
+ *
+ * @returns The wrapped string with newline characters inserted at appropriate
+ *   positions.
  */
 export default function wrapString(str, maxWidth, wordWrap = true) {
     if (str.length <= maxWidth) {

package/esm/methods/addId.d.ts

@@ -0,0 +1,5 @@
+import type SimpleTable from "../class/SimpleTable.js";
+export default function addId(simpleTable: SimpleTable, newColumn: string, options?: {
+    prefix?: string;
+}): void;
+//# sourceMappingURL=addId.d.ts.map

package/esm/methods/addId.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"addId.d.ts","sourceRoot":"","sources":["../../src/methods/addId.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAEvD,MAAM,CAAC,OAAO,UAAU,KAAK,CAC3B,WAAW,EAAE,WAAW,EACxB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,QAgDlC"}

package/esm/methods/addId.js

@@ -0,0 +1,38 @@
+import assertNewColumns from "../helpers/assertNewColumns.js";
+import foldIdentifier from "../helpers/foldIdentifier.js";
+import mergeOptions from "../helpers/mergeOptions.js";
+import queryDB from "../helpers/queryDB.js";
+import queueOp from "../helpers/queueOp.js";
+import quoteIdentifier from "../helpers/quoteIdentifier.js";
+export default function addId(simpleTable, newColumn, options = {}) {
+    if (typeof newColumn !== "string") {
+        throw new TypeError("addId() newColumn must be a string.");
+    }
+    if (options.prefix !== undefined && typeof options.prefix !== "string") {
+        throw new TypeError("addId() options.prefix must be a string.");
+    }
+    // Materialize preceding operations so IDs follow their resulting row order.
+    options = structuredClone(options);
+    queueOp(simpleTable, {
+        kind: "barrier",
+        method: "addId()",
+        parameters: { newColumn, options },
+        execute: async () => {
+            const types = await simpleTable.getTypes();
+            const existingColumn = Object.keys(types).find((column) => foldIdentifier(column) === foldIdentifier(newColumn));
+            assertNewColumns(types, [existingColumn ?? newColumn], "addId()");
+            // An empty window preserves scan order without referencing rowid, which
+            // may be shadowed by a user column.
+            const rowNumber = "(ROW_NUMBER() OVER () - 1)";
+            const id = options.prefix === undefined
+                ? rowNumber
+                : `CONCAT(?, CAST(${rowNumber} AS VARCHAR))`;
+            await queryDB(simpleTable, `CREATE OR REPLACE TABLE ${quoteIdentifier(simpleTable.name)} AS SELECT *, ${id} AS ${quoteIdentifier(newColumn)} FROM ${quoteIdentifier(simpleTable.name)}`, mergeOptions(simpleTable, {
+                table: simpleTable.name,
+                method: "addId()",
+                parameters: { newColumn, options },
+                values: options.prefix === undefined ? undefined : [options.prefix],
+            }));
+        },
+    });
+}

package/esm/methods/cache.js

@@ -7,7 +7,7 @@ import serializeCacheInputs, { getCacheInputLabel, } from "../helpers/serializeC
 import { createTableGenerationId, peekTableGeneration, restoreTableGeneration, } from "../helpers/tableGeneration.js";
 import { loadCacheDatabase, writeCacheDatabase, } from "../helpers/cacheDatabase.js";
 import { assertCacheTableMutation, cacheTableDependenciesMatch, captureCacheTableDependencies, changedCacheTableDependenciesMessage, recordCacheTableAccess, unchangedCacheTableDependenciesMessage, } from "../helpers/cacheTableDependencies.js";
-const CACHE_FORMAT_VERSION = "duckdb-v4";
+const CACHE_FORMAT_VERSION = "duckdb-v5";
 export default async function cache(table, compute, options = {}) {
     // If cache() is itself called from another cache computation, the outer
     // computation depends on the table produced here.

package/esm/methods/commonNeighbors.d.ts

@@ -0,0 +1,10 @@
+import type SimpleTable from "../class/SimpleTable.js";
+import { type GraphId } from "../helpers/prepareGraphStarts.js";
+import { type GraphDirection } from "../helpers/prepareGraphTraversal.js";
+type CommonNeighborsOptions = {
+    direction?: GraphDirection;
+    outputTable?: string | boolean;
+};
+export default function commonNeighbors(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, nodeA: GraphId, nodeB: GraphId, options?: CommonNeighborsOptions): SimpleTable;
+export {};
+//# sourceMappingURL=commonNeighbors.d.ts.map

package/esm/methods/commonNeighbors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"commonNeighbors.d.ts","sourceRoot":"","sources":["../../src/methods/commonNeighbors.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAEvD,OAA2B,EACzB,KAAK,OAAO,EAEb,MAAM,kCAAkC,CAAC;AAC1C,OAA8B,EAC5B,KAAK,cAAc,EAEpB,MAAM,qCAAqC,CAAC;AAI7C,KAAK,sBAAsB,GAAG;IAC5B,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CAChC,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,eAAe,CACrC,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,OAAO,EACd,KAAK,EAAE,OAAO,EACd,OAAO,GAAE,sBAA2B,GACnC,WAAW,CAwDb"}

package/esm/methods/commonNeighbors.js

@@ -0,0 +1,101 @@
+import prepareGraphStarts from "../helpers/prepareGraphStarts.js";
+import prepareGraphTraversal, { validateGraphStarts, } from "../helpers/prepareGraphTraversal.js";
+import queueGraphResult from "../helpers/queueGraphResult.js";
+import quoteIdentifier from "../helpers/quoteIdentifier.js";
+export default function commonNeighbors(simpleTable, sourceColumn, targetColumn, nodeA, nodeB, options = {}) {
+    if (typeof sourceColumn !== "string") {
+        throw new TypeError("commonNeighbors() sourceColumn must be a string.");
+    }
+    if (typeof targetColumn !== "string") {
+        throw new TypeError("commonNeighbors() targetColumn must be a string.");
+    }
+    if (options === null || typeof options !== "object" || Array.isArray(options)) {
+        throw new TypeError("commonNeighbors() options must be an object.");
+    }
+    if (options.direction !== undefined &&
+        !["outgoing", "incoming", "both"].includes(options.direction)) {
+        throw new TypeError('commonNeighbors() options.direction must be "outgoing", "incoming", or "both".');
+    }
+    if (options.outputTable !== undefined &&
+        typeof options.outputTable !== "string" &&
+        typeof options.outputTable !== "boolean") {
+        throw new TypeError("commonNeighbors() options.outputTable must be a string or boolean.");
+    }
+    const nodes = prepareNodes(nodeA, nodeB);
+    options = structuredClone(options);
+    const direction = options.direction ?? "outgoing";
+    const parameters = { sourceColumn, targetColumn, nodeA, nodeB, options };
+    return queueGraphResult(simpleTable, {
+        method: "commonNeighbors()",
+        parameters,
+        outputTable: options.outputTable,
+        values: (schema) => {
+            validateNodes(schema, sourceColumn, targetColumn, nodes);
+            return nodes.values;
+        },
+        buildSelect: (input, schema) => commonNeighborsSelect(input, schema, sourceColumn, targetColumn, nodes, direction),
+        outputSchema: (schema) => ({
+            node: validateNodes(schema, sourceColumn, targetColumn, nodes).idType,
+        }),
+    });
+}
+function prepareNodes(nodeA, nodeB) {
+    if (Array.isArray(nodeA)) {
+        throw new TypeError("commonNeighbors() nodeA must be one node ID.");
+    }
+    if (Array.isArray(nodeB)) {
+        throw new TypeError("commonNeighbors() nodeB must be one node ID.");
+    }
+    const first = prepareGraphStarts(nodeA, "commonNeighbors()", "nodeA", true);
+    const second = prepareGraphStarts(nodeB, "commonNeighbors()", "nodeB", true);
+    if (first.family !== second.family) {
+        throw new TypeError("commonNeighbors() nodeA and nodeB must both be string IDs or both be numeric IDs.");
+    }
+    if (first.values[0] === second.values[0]) {
+        throw new TypeError("commonNeighbors() nodeA and nodeB must be different.");
+    }
+    return {
+        family: first.family,
+        numericValues: [...first.numericValues, ...second.numericValues],
+        values: [first.values[0], second.values[0]],
+    };
+}
+function validateNodes(schema, source, target, nodes) {
+    return validateGraphStarts(schema, source, target, nodes, "commonNeighbors()", "nodeA and nodeB");
+}
+function commonNeighborsSelect(input, schema, source, target, nodes, direction) {
+    const prepared = prepareGraphTraversal(input, schema, source, target, nodes, "commonNeighbors()", "nodeA and nodeB");
+    const relations = prepared.relationNames([
+        "graph_requested_nodes",
+        "graph_edges",
+        "graph_neighbor_memberships",
+        "graph_common_neighbors",
+    ]);
+    const requested = relations.graph_requested_nodes;
+    const edges = relations.graph_edges;
+    const memberships = relations.graph_neighbor_memberships;
+    const common = relations.graph_common_neighbors;
+    const q = quoteIdentifier;
+    return `WITH ${requested}(${q("node")}) AS (
+      VALUES ${prepared.startValues}
+    ), ${edges} AS (
+      ${prepared.edges(direction)}
+    ), ${memberships} AS (
+      SELECT ${q("requested")}.${q("node")} AS ${q("requested_node")},
+        ${q("edges")}.${q("__from_key")} AS ${q("__requested_key")},
+        ${q("edges")}.${q("__to")} AS ${q("node")},
+        ${q("edges")}.${q("__to_key")} AS ${q("__node_key")}
+      FROM ${edges} AS ${q("edges")}
+      INNER JOIN ${requested} AS ${q("requested")}
+        ON ${q("edges")}.${q("__from_key")} =
+          ${prepared.key(`${q("requested")}.${q("node")}`)}
+    ), ${common} AS (
+      SELECT MIN(${q("node")}) AS ${q("node")}, ${q("__node_key")}
+      FROM ${memberships}
+      GROUP BY ${q("__node_key")}
+      HAVING COUNT(DISTINCT ${q("__requested_key")}) = 2
+    )
+    SELECT ${q("node")}
+    FROM ${common}
+    ORDER BY ${q("__node_key")}`;
+}

package/esm/methods/connectedComponents.d.ts

@@ -0,0 +1,9 @@
+import type SimpleTable from "../class/SimpleTable.js";
+import { type GraphTemporalOptions } from "../helpers/prepareGraphTemporalSql.js";
+type ConnectedComponentsOptions = GraphTemporalOptions & {
+    mode?: "weak" | "strong";
+    outputTable?: string | boolean;
+};
+export default function connectedComponents(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, options?: ConnectedComponentsOptions): SimpleTable;
+export {};
+//# sourceMappingURL=connectedComponents.d.ts.map

package/esm/methods/connectedComponents.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connectedComponents.d.ts","sourceRoot":"","sources":["../../src/methods/connectedComponents.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAGvD,OAAgC,EAC9B,KAAK,oBAAoB,EAG1B,MAAM,uCAAuC,CAAC;AAM/C,KAAK,0BAA0B,GAAG,oBAAoB,GAAG;IACvD,IAAI,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC;IACzB,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CAChC,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,mBAAmB,CACzC,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,OAAO,GAAE,0BAA+B,GACvC,WAAW,CAqFb"}

package/esm/methods/connectedComponents.js

@@ -0,0 +1,147 @@
+import buildChronologicalGraphComponentsSql from "../helpers/buildChronologicalGraphComponentsSql.js";
+import buildWeakGraphComponentsSql from "../helpers/buildWeakGraphComponentsSql.js";
+import getGraphEndpointColumns from "../helpers/getGraphEndpointColumns.js";
+import prepareGraphTemporalSql, { prepareGraphTemporalOptions, } from "../helpers/prepareGraphTemporalSql.js";
+import { prepareGraphSql } from "../helpers/prepareGraphTraversal.js";
+import queueGraphResult from "../helpers/queueGraphResult.js";
+import quoteIdentifier from "../helpers/quoteIdentifier.js";
+import validateGraphTemporalEvents from "../helpers/validateGraphTemporalEvents.js";
+export default function connectedComponents(simpleTable, sourceColumn, targetColumn, options = {}) {
+    if (typeof sourceColumn !== "string") {
+        throw new TypeError("connectedComponents() sourceColumn must be a string.");
+    }
+    if (typeof targetColumn !== "string") {
+        throw new TypeError("connectedComponents() targetColumn must be a string.");
+    }
+    if (options === null || typeof options !== "object" || Array.isArray(options)) {
+        throw new TypeError("connectedComponents() options must be an object.");
+    }
+    if (options.mode !== undefined &&
+        !["weak", "strong"].includes(options.mode)) {
+        throw new TypeError('connectedComponents() options.mode must be "weak" or "strong".');
+    }
+    if (options.outputTable !== undefined &&
+        typeof options.outputTable !== "string" &&
+        typeof options.outputTable !== "boolean") {
+        throw new TypeError("connectedComponents() options.outputTable must be a string or boolean.");
+    }
+    const temporalOptions = prepareGraphTemporalOptions(options, undefined, "connectedComponents()");
+    if (temporalOptions !== undefined && options.mode !== "strong") {
+        throw new TypeError('connectedComponents() chronological options require options.mode to be explicitly set to "strong".');
+    }
+    options = structuredClone(options);
+    const mode = options.mode ?? "weak";
+    const parameters = { sourceColumn, targetColumn, options };
+    return queueGraphResult(simpleTable, {
+        method: "connectedComponents()",
+        parameters,
+        outputTable: options.outputTable,
+        preflight: temporalOptions === undefined
+            ? undefined
+            : (input) => validateGraphTemporalEvents(input, temporalOptions, "connectedComponents()", parameters),
+        values: (schema) => {
+            const temporal = validateInputs(schema, sourceColumn, targetColumn, temporalOptions).temporal;
+            return temporal === undefined ? [] : [temporal.gapParameter];
+        },
+        buildSelect: (input, schema) => connectedComponentsSelect(input, schema, sourceColumn, targetColumn, mode, temporalOptions),
+        outputSchema: (schema) => ({
+            componentId: "BIGINT",
+            node: validateInputs(schema, sourceColumn, targetColumn, temporalOptions).endpoints.idType,
+        }),
+    });
+}
+function validateEndpoints(schema, source, target) {
+    return getGraphEndpointColumns(schema, source, target, "connectedComponents()");
+}
+function validateInputs(schema, source, target, temporalOptions) {
+    const endpoints = validateEndpoints(schema, source, target);
+    const temporal = temporalOptions === undefined
+        ? undefined
+        : prepareGraphTemporalSql(schema, temporalOptions, "connectedComponents()");
+    return { endpoints, temporal };
+}
+function connectedComponentsSelect(input, schema, source, target, mode, temporalOptions) {
+    const prepared = prepareGraphSql(input, schema, source, target, "connectedComponents()");
+    if (temporalOptions !== undefined) {
+        return buildChronologicalGraphComponentsSql(prepared, prepareGraphTemporalSql(schema, temporalOptions, "connectedComponents()"));
+    }
+    const relationNames = mode === "weak"
+        ? [
+            "graph_edges",
+            "graph_nodes",
+            "graph_component_labels",
+            "graph_component_roots",
+        ]
+        : [
+            "graph_edges",
+            "graph_nodes",
+            "graph_reachable",
+            "graph_component_members",
+            "graph_component_roots",
+        ];
+    const relations = prepared.relationNames(relationNames);
+    const edges = relations.graph_edges;
+    const nodes = relations.graph_nodes;
+    const roots = relations.graph_component_roots;
+    const q = quoteIdentifier;
+    const common = `${edges} AS (
+      ${prepared.edges(mode === "weak" ? "both" : "outgoing")}
+    ), ${nodes} AS (
+      SELECT ${q("__from")} AS ${q("node")},
+        ${q("__from_key")} AS ${q("__key")}
+      FROM ${edges}
+      UNION
+      SELECT ${q("__to")} AS ${q("node")},
+        ${q("__to_key")} AS ${q("__key")}
+      FROM ${edges}
+    )`;
+    if (mode === "weak") {
+        const labels = relations.graph_component_labels;
+        return `WITH RECURSIVE ${common}, ${buildWeakGraphComponentsSql(edges, nodes, labels, roots)}
+    SELECT ${q("roots")}.${q("componentId")}, ${q("labels")}.${q("node")}
+    FROM ${labels} AS ${q("labels")}
+    INNER JOIN ${roots} AS ${q("roots")}
+      ON ${q("labels")}.${q("__root_key")} =
+        ${q("roots")}.${q("__root_key")}
+    ORDER BY ${q("labels")}.${q("__node_key")}`;
+    }
+    const reachable = relations.graph_reachable;
+    const members = relations.graph_component_members;
+    return `WITH RECURSIVE ${common}, ${reachable}(
+      ${q("__start_key")}, ${q("__node_key")}
+    ) AS (
+      SELECT ${q("__key")}, ${q("__key")} FROM ${nodes}
+      UNION
+      SELECT ${q("reached")}.${q("__start_key")},
+        ${q("edges")}.${q("__to_key")}
+      FROM ${reachable} AS ${q("reached")}
+      INNER JOIN ${edges} AS ${q("edges")}
+        ON ${q("reached")}.${q("__node_key")} =
+          ${q("edges")}.${q("__from_key")}
+    ), ${members} AS (
+      SELECT ${q("nodes")}.${q("node")}, ${q("nodes")}.${q("__key")},
+        MIN(${q("forward")}.${q("__start_key")}) AS ${q("__root_key")}
+      FROM ${nodes} AS ${q("nodes")}
+      INNER JOIN ${reachable} AS ${q("forward")}
+        ON ${q("nodes")}.${q("__key")} =
+          ${q("forward")}.${q("__node_key")}
+      INNER JOIN ${reachable} AS ${q("reverse")}
+        ON ${q("forward")}.${q("__start_key")} =
+          ${q("reverse")}.${q("__node_key")}
+        AND ${q("nodes")}.${q("__key")} =
+          ${q("reverse")}.${q("__start_key")}
+      GROUP BY ${q("nodes")}.${q("node")}, ${q("nodes")}.${q("__key")}
+    ), ${roots} AS (
+      SELECT ${q("__root_key")},
+        CAST(row_number() OVER (ORDER BY ${q("__root_key")}) - 1 AS BIGINT)
+          AS ${q("componentId")}
+      FROM (SELECT DISTINCT ${q("__root_key")} FROM ${members})
+        AS ${q("distinct_roots")}
+    )
+    SELECT ${q("roots")}.${q("componentId")}, ${q("members")}.${q("node")}
+    FROM ${members} AS ${q("members")}
+    INNER JOIN ${roots} AS ${q("roots")}
+      ON ${q("members")}.${q("__root_key")} =
+        ${q("roots")}.${q("__root_key")}
+    ORDER BY ${q("members")}.${q("__key")}`;
+}

package/esm/methods/degree.d.ts

@@ -0,0 +1,9 @@
+import type SimpleTable from "../class/SimpleTable.js";
+type DegreeOptions = {
+    count?: "edges" | "neighbors";
+    weight?: string;
+    outputTable?: string | boolean;
+};
+export default function degree(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, options?: DegreeOptions): SimpleTable;
+export {};
+//# sourceMappingURL=degree.d.ts.map

package/esm/methods/degree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"degree.d.ts","sourceRoot":"","sources":["../../src/methods/degree.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAQvD,KAAK,aAAa,GAAG;IACnB,KAAK,CAAC,EAAE,OAAO,GAAG,WAAW,CAAC;IAC9B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CAChC,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,MAAM,CAC5B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,OAAO,GAAE,aAAkB,GAC1B,WAAW,CAoEb"}

package/esm/methods/degree.js

@@ -0,0 +1,135 @@
+import getGraphEndpointColumns from "../helpers/getGraphEndpointColumns.js";
+import getGraphWeightColumn from "../helpers/getGraphWeightColumn.js";
+import { prepareGraphSql } from "../helpers/prepareGraphTraversal.js";
+import queueGraphResult from "../helpers/queueGraphResult.js";
+import quoteIdentifier from "../helpers/quoteIdentifier.js";
+export default function degree(simpleTable, sourceColumn, targetColumn, options = {}) {
+    if (typeof sourceColumn !== "string") {
+        throw new TypeError("degree() sourceColumn must be a string.");
+    }
+    if (typeof targetColumn !== "string") {
+        throw new TypeError("degree() targetColumn must be a string.");
+    }
+    if (options === null || typeof options !== "object" || Array.isArray(options)) {
+        throw new TypeError("degree() options must be an object.");
+    }
+    if (options.count !== undefined &&
+        !["edges", "neighbors"].includes(options.count)) {
+        throw new TypeError('degree() options.count must be "edges" or "neighbors".');
+    }
+    if (options.weight !== undefined && typeof options.weight !== "string") {
+        throw new TypeError("degree() options.weight must be a string.");
+    }
+    if (options.outputTable !== undefined &&
+        typeof options.outputTable !== "string" &&
+        typeof options.outputTable !== "boolean") {
+        throw new TypeError("degree() options.outputTable must be a string or boolean.");
+    }
+    if (options.weight !== undefined && options.count === "neighbors") {
+        throw new TypeError('degree() options.weight cannot be combined with count: "neighbors" because weighted sums operate on edges, not distinct neighbors.');
+    }
+    options = structuredClone(options);
+    const count = options.count ?? "edges";
+    const weight = options.weight;
+    const parameters = { sourceColumn, targetColumn, options };
+    return queueGraphResult(simpleTable, {
+        method: "degree()",
+        parameters,
+        outputTable: options.outputTable,
+        values: (schema) => {
+            validateInputs(schema, sourceColumn, targetColumn, weight);
+            return [];
+        },
+        buildSelect: (input, schema) => degreeSelect(input, schema, sourceColumn, targetColumn, count, weight),
+        outputSchema: (schema) => {
+            const validated = validateInputs(schema, sourceColumn, targetColumn, weight);
+            return {
+                node: validated.idType,
+                incoming: validated.degreeType,
+                outgoing: validated.degreeType,
+                total: validated.degreeType,
+            };
+        },
+    });
+}
+function validateInputs(schema, source, target, weight) {
+    const endpoints = getGraphEndpointColumns(schema, source, target, "degree()");
+    const degreeType = weight === undefined
+        ? "BIGINT"
+        : sumType(getGraphWeightColumn(schema, weight, "degree()").distanceType);
+    return { idType: endpoints.idType, degreeType };
+}
+function sumType(type) {
+    // DuckDB SUM widens FLOAT to DOUBLE; retain that aggregate precision.
+    return type === "FLOAT" ? "DOUBLE" : type;
+}
+function degreeSelect(input, schema, source, target, count, weight) {
+    const prepared = prepareGraphSql(input, schema, source, target, "degree()");
+    const weightColumn = weight === undefined
+        ? undefined
+        : getGraphWeightColumn(schema, weight, "degree()");
+    const degreeType = sumType(weightColumn?.distanceType ?? "BIGINT");
+    const relations = prepared.relationNames([
+        "graph_edges",
+        "graph_node_candidates",
+        "graph_nodes",
+        "graph_incoming",
+        "graph_outgoing",
+    ]);
+    const edges = relations.graph_edges;
+    const candidates = relations.graph_node_candidates;
+    const nodes = relations.graph_nodes;
+    const incoming = relations.graph_incoming;
+    const outgoing = relations.graph_outgoing;
+    const q = quoteIdentifier;
+    const edgeWeight = weightColumn === undefined
+        ? undefined
+        : `CAST(${q("edges")}.${q(weightColumn.column)} AS ${degreeType}) AS ${q("__weight")}`;
+    const aggregate = (direction) => {
+        const neighborKey = direction === "incoming" ? "__from_key" : "__to_key";
+        if (edgeWeight !== undefined) {
+            return `CAST(SUM(${q("__weight")}) AS ${degreeType})`;
+        }
+        return count === "neighbors"
+            ? `COUNT(DISTINCT ${q(neighborKey)})`
+            : "COUNT(*)";
+    };
+    const zero = `CAST(0 AS ${degreeType})`;
+    const incomingDegree = `COALESCE(${q("incoming")}.${q("incoming")}, ${zero})`;
+    const outgoingDegree = `COALESCE(${q("outgoing")}.${q("outgoing")}, ${zero})`;
+    return `WITH ${edges} AS (
+      ${prepared.edges("outgoing", edgeWeight === undefined ? [] : [edgeWeight])}
+    ), ${candidates} AS (
+      SELECT ${q("__from")} AS ${q("node")},
+        ${q("__from_key")} AS ${q("__key")}
+      FROM ${edges}
+      UNION ALL
+      SELECT ${q("__to")} AS ${q("node")},
+        ${q("__to_key")} AS ${q("__key")}
+      FROM ${edges}
+    ), ${nodes} AS (
+      SELECT MIN(${q("node")}) AS ${q("node")}, ${q("__key")}
+      FROM ${candidates}
+      GROUP BY ${q("__key")}
+    ), ${incoming} AS (
+      SELECT ${q("__to_key")} AS ${q("__key")},
+        ${aggregate("incoming")} AS ${q("incoming")}
+      FROM ${edges}
+      GROUP BY ${q("__to_key")}
+    ), ${outgoing} AS (
+      SELECT ${q("__from_key")} AS ${q("__key")},
+        ${aggregate("outgoing")} AS ${q("outgoing")}
+      FROM ${edges}
+      GROUP BY ${q("__from_key")}
+    )
+    SELECT ${q("nodes")}.${q("node")},
+      ${incomingDegree} AS ${q("incoming")},
+      ${outgoingDegree} AS ${q("outgoing")},
+      CAST(${incomingDegree} + ${outgoingDegree} AS ${degreeType}) AS ${q("total")}
+    FROM ${nodes} AS ${q("nodes")}
+    LEFT JOIN ${incoming} AS ${q("incoming")}
+      ON ${q("nodes")}.${q("__key")} = ${q("incoming")}.${q("__key")}
+    LEFT JOIN ${outgoing} AS ${q("outgoing")}
+      ON ${q("nodes")}.${q("__key")} = ${q("outgoing")}.${q("__key")}
+    ORDER BY ${q("total")} DESC, ${q("nodes")}.${q("__key")}`;
+}

package/esm/methods/distances.d.ts

@@ -0,0 +1,12 @@
+import type SimpleTable from "../class/SimpleTable.js";
+import { type GraphTemporalOptions } from "../helpers/prepareGraphTemporalSql.js";
+import { type GraphId } from "../helpers/prepareGraphStarts.js";
+import { type GraphDirection } from "../helpers/prepareGraphTraversal.js";
+type DistancesOptions = GraphTemporalOptions & {
+    direction?: GraphDirection;
+    outputTable?: string | boolean;
+    weight?: string;
+};
+export default function distances(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, startNodes: GraphId | GraphId[], options?: DistancesOptions): SimpleTable;
+export {};
+//# sourceMappingURL=distances.d.ts.map

package/esm/methods/distances.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"distances.d.ts","sourceRoot":"","sources":["../../src/methods/distances.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAIvD,OAAgC,EAC9B,KAAK,oBAAoB,EAG1B,MAAM,uCAAuC,CAAC;AAC/C,OAA2B,EACzB,KAAK,OAAO,EAEb,MAAM,kCAAkC,CAAC;AAC1C,OAA8B,EAC5B,KAAK,cAAc,EAEpB,MAAM,qCAAqC,CAAC;AAK7C,KAAK,gBAAgB,GAAG,oBAAoB,GAAG;IAC7C,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC/B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,SAAS,CAC/B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,OAAO,GAAG,OAAO,EAAE,EAC/B,OAAO,GAAE,gBAAqB,GAC7B,WAAW,CAyGb"}