@based/db 0.0.66 → 0.0.67

package/dist/lib/darwin_aarch64/include/selva/history.h

@@ -1,64 +0,0 @@
-/*
- * Copyright (c) 2025 SAULX
- * SPDX-License-Identifier: MIT
- */
-#pragma once
-
-#include <stddef.h>
-#include <stdint.h>
-#include "selva/types.h"
-#include "selva/_export.h"
-
-struct selva_history;
-
-struct selva_history_event {
-    int64_t ts;
-    node_id_t node_id;
-    uint32_t crc;
-} __packed __attribute__((aligned(4)));
-
-static_assert(alignof(struct selva_history_event) == alignof(uint32_t));
-
-/**
- * Create a new history object.
- */
-SELVA_EXPORT
-int selva_history_create(const char *pathname, size_t bsize, struct selva_history **hist_out);
-
-/**
- * Destroy a history object.
- */
-SELVA_EXPORT
-void selva_history_destroy(struct selva_history *hist);
-
-/**
- * Append a block of size `bsize` to a history object.
- */
-SELVA_EXPORT
-void selva_history_append(struct selva_history *hist, int64_t ts, node_id_t node_id, void *buf);
-
-/**
- * Ensure that the history file is fully written to the disk.
- */
-SELVA_EXPORT
-void selva_history_fsync(struct selva_history *hist);
-
-/**
- * Find a range.
- * The returned buffer must be freed with selva_history_free_range().
- */
-SELVA_EXPORT
-uint32_t *selva_history_find_range(struct selva_history *hist, int64_t from, int64_t to, size_t *size_out);
-
-/**
- * Find a range.
- * The returned buffer must be freed with selva_history_free_range().
- */
-SELVA_EXPORT
-uint32_t *selva_history_find_range_node(struct selva_history *hist, int64_t from, int64_t to, node_id_t node_id, size_t *size_out);
-
-/**
- * Free a range returned by selva_history_find_range() or selva_history_find_range_node().
- */
-SELVA_EXPORT
-void selva_history_free_range(uint32_t *range);

package/dist/lib/linux_aarch64/include/selva/history.h

@@ -1,64 +0,0 @@
-/*
- * Copyright (c) 2025 SAULX
- * SPDX-License-Identifier: MIT
- */
-#pragma once
-
-#include <stddef.h>
-#include <stdint.h>
-#include "selva/types.h"
-#include "selva/_export.h"
-
-struct selva_history;
-
-struct selva_history_event {
-    int64_t ts;
-    node_id_t node_id;
-    uint32_t crc;
-} __packed __attribute__((aligned(4)));
-
-static_assert(alignof(struct selva_history_event) == alignof(uint32_t));
-
-/**
- * Create a new history object.
- */
-SELVA_EXPORT
-int selva_history_create(const char *pathname, size_t bsize, struct selva_history **hist_out);
-
-/**
- * Destroy a history object.
- */
-SELVA_EXPORT
-void selva_history_destroy(struct selva_history *hist);
-
-/**
- * Append a block of size `bsize` to a history object.
- */
-SELVA_EXPORT
-void selva_history_append(struct selva_history *hist, int64_t ts, node_id_t node_id, void *buf);
-
-/**
- * Ensure that the history file is fully written to the disk.
- */
-SELVA_EXPORT
-void selva_history_fsync(struct selva_history *hist);
-
-/**
- * Find a range.
- * The returned buffer must be freed with selva_history_free_range().
- */
-SELVA_EXPORT
-uint32_t *selva_history_find_range(struct selva_history *hist, int64_t from, int64_t to, size_t *size_out);
-
-/**
- * Find a range.
- * The returned buffer must be freed with selva_history_free_range().
- */
-SELVA_EXPORT
-uint32_t *selva_history_find_range_node(struct selva_history *hist, int64_t from, int64_t to, node_id_t node_id, size_t *size_out);
-
-/**
- * Free a range returned by selva_history_find_range() or selva_history_find_range_node().
- */
-SELVA_EXPORT
-void selva_history_free_range(uint32_t *range);

package/dist/lib/linux_x86_64/include/selva/history.h

@@ -1,64 +0,0 @@
-/*
- * Copyright (c) 2025 SAULX
- * SPDX-License-Identifier: MIT
- */
-#pragma once
-
-#include <stddef.h>
-#include <stdint.h>
-#include "selva/types.h"
-#include "selva/_export.h"
-
-struct selva_history;
-
-struct selva_history_event {
-    int64_t ts;
-    node_id_t node_id;
-    uint32_t crc;
-} __packed __attribute__((aligned(4)));
-
-static_assert(alignof(struct selva_history_event) == alignof(uint32_t));
-
-/**
- * Create a new history object.
- */
-SELVA_EXPORT
-int selva_history_create(const char *pathname, size_t bsize, struct selva_history **hist_out);
-
-/**
- * Destroy a history object.
- */
-SELVA_EXPORT
-void selva_history_destroy(struct selva_history *hist);
-
-/**
- * Append a block of size `bsize` to a history object.
- */
-SELVA_EXPORT
-void selva_history_append(struct selva_history *hist, int64_t ts, node_id_t node_id, void *buf);
-
-/**
- * Ensure that the history file is fully written to the disk.
- */
-SELVA_EXPORT
-void selva_history_fsync(struct selva_history *hist);
-
-/**
- * Find a range.
- * The returned buffer must be freed with selva_history_free_range().
- */
-SELVA_EXPORT
-uint32_t *selva_history_find_range(struct selva_history *hist, int64_t from, int64_t to, size_t *size_out);
-
-/**
- * Find a range.
- * The returned buffer must be freed with selva_history_free_range().
- */
-SELVA_EXPORT
-uint32_t *selva_history_find_range_node(struct selva_history *hist, int64_t from, int64_t to, node_id_t node_id, size_t *size_out);
-
-/**
- * Free a range returned by selva_history_find_range() or selva_history_find_range_node().
- */
-SELVA_EXPORT
-void selva_history_free_range(uint32_t *range);

package/dist/src/client/query/serialize.d.ts

@@ -1,4 +0,0 @@
-import { QueryDef } from './types.js';
-import { SchemaTypesParsed } from '@based/schema/def';
-export declare const serialize: (q: QueryDef) => string;
-export declare const parse: (str: string, parsedSchema: SchemaTypesParsed) => void;

package/dist/src/client/query/serialize.js

@@ -1,26 +0,0 @@
-const walk = (q) => {
-    const obj = {};
-    for (const key in q) {
-        if (key === 'schema') {
-            obj[key] = q[key].type;
-        }
-        else {
-            // if PROPDEF
-            if (typeof q[key] === 'object') {
-                obj[key] = walk(q[key]);
-            }
-            else {
-                obj[key] = q[key];
-            }
-        }
-    }
-    return obj;
-};
-export const serialize = (q) => {
-    const obj = walk(q);
-    return JSON.stringify(obj);
-};
-export const parse = (str, parsedSchema) => {
-    //
-};
-//# sourceMappingURL=serialize.js.map

package/dist/src/server/DbWorker.d.ts

@@ -1,13 +0,0 @@
-import { Worker, MessagePort } from 'node:worker_threads';
-import { DbServer } from './index.js';
-export declare class DbWorker {
-    constructor(address: BigInt, db: DbServer, workerIndex: number);
-    db: DbServer;
-    channel: MessagePort;
-    worker: Worker;
-    resolvers: ((x: any) => any)[];
-    readyPromise: Promise<true>;
-    callback: (resolve: (x: any) => any) => void;
-    updateCtx(address: BigInt): Promise<void>;
-    getQueryBuf(buf: Uint8Array): Promise<Uint8Array>;
-}

package/dist/src/server/csmt/draw-dot.d.ts

@@ -1,4 +0,0 @@
-import { Csmt } from './index.js';
-type DataFormatter<T> = (data: T) => string;
-export default function draw<T = any>(csmt: Csmt<T>, dataFormatter?: DataFormatter<T>): string;
-export {};

package/dist/src/server/csmt/draw-dot.js

@@ -1,38 +0,0 @@
-import { encodeBase64 } from '@saulx/utils';
-function makeLabel(node) {
-    return `${node.key}\n${encodeBase64(node.hash).substring(0, 5)}`;
-}
-function wrapFormatter(dataFormatter, node) {
-    return `\n${dataFormatter(node.data).replace('"', '\\"')}`;
-}
-// This can be visualized with Graphviz dot.
-// Online: https://dreampuf.github.io/GraphvizOnline/?engine=dot
-export default function draw(csmt, dataFormatter) {
-    const root = csmt.getRoot();
-    const lines = [];
-    const nodes = [];
-    let i = 0;
-    const walk = (node, prev) => {
-        const cur = i;
-        const left = node.left;
-        const right = node.right;
-        const isLeaf = !left && !right;
-        nodes.push(`n${cur} [label="${makeLabel(node) + ((dataFormatter && node.data) ? wrapFormatter(dataFormatter, node) : '')}"${isLeaf ? ' shape=box' : ''}];`);
-        if (cur > 0) {
-            lines.push(`n${prev} -- n${cur}`);
-        }
-        if (left) {
-            i++;
-            walk(left, cur);
-        }
-        if (right) {
-            i++;
-            walk(right, cur);
-        }
-    };
-    if (root) {
-        walk(root, i);
-    }
-    return `graph ethane {\n${nodes.join('\n')}\n${lines.join('\n')}\n}`;
-}
-//# sourceMappingURL=draw-dot.js.map

package/dist/src/server/csmt/index.d.ts

@@ -1,4 +0,0 @@
-import drawDot from './draw-dot.js';
-export * from './types.js';
-export * from './tree.js';
-export { drawDot };

package/dist/src/server/csmt/index.js

@@ -1,5 +0,0 @@
-import drawDot from './draw-dot.js';
-export * from './types.js';
-export * from './tree.js';
-export { drawDot };
-//# sourceMappingURL=index.js.map

package/dist/src/server/csmt/match.d.ts

@@ -1,7 +0,0 @@
-type Predicate = (x: any) => boolean;
-type Func = (x: any) => any;
-declare const match: (x: any) => {
-    on: (pred: Predicate, fn: Func) => any;
-    otherwise: (fn: Func) => any;
-};
-export default match;

package/dist/src/server/csmt/match.js

@@ -1,10 +0,0 @@
-const matched = (x) => ({
-    on: () => matched(x),
-    otherwise: () => x,
-});
-const match = (x) => ({
-    on: (pred, fn) => (pred(x) ? matched(fn(x)) : match(x)),
-    otherwise: (fn) => fn(x),
-});
-export default match;
-//# sourceMappingURL=match.js.map

package/dist/src/server/csmt/memebership-proof.d.ts

@@ -1,7 +0,0 @@
-import { TreeKey, TreeNode } from './types.js';
-export declare enum Direction {
-    Left = "L",
-    Right = "R"
-}
-export type Proof = [TreeKey | null, TreeKey | null] | [TreeKey | Uint8Array, TreeKey | Direction][];
-export default function membershipProof<T = any>(root: TreeNode<T> | null, k: TreeKey): Proof;

package/dist/src/server/csmt/memebership-proof.js

@@ -1,122 +0,0 @@
-import { minInSubtree, maxInSubtree } from './tree-utils.js';
-import match from './match.js';
-export var Direction;
-(function (Direction) {
-    Direction["Left"] = "L";
-    Direction["Right"] = "R";
-})(Direction || (Direction = {}));
-function reverse(direction) {
-    switch (direction) {
-        case Direction.Left:
-            return Direction.Right;
-        case Direction.Right:
-            return Direction.Left;
-        default:
-            throw new TypeError('"direction" is not type of Direction');
-    }
-}
-function aeq(arr) {
-    return (x) => x.every((y, i) => y === arr[i]);
-}
-function isList(x) {
-    return Array.isArray(x) && x.length > 0 && Array.isArray(x[0]);
-}
-function nonMembershipProof(k, key, direction, sibling) {
-    return match([k > key, direction])
-        .on(aeq([true, Direction.Left]), () => [key, minInSubtree(sibling)])
-        .on(aeq([true, Direction.Right]), () => [key, null])
-        .on(aeq([false, Direction.Left]), () => [null, key])
-        .on(aeq([false, Direction.Right]), () => [maxInSubtree(sibling), key])
-        .otherwise(() => {
-        throw new TypeError('"direction" is not type of Direction');
-    });
-}
-function membershipProofR(sibling, direction, node, k) {
-    const left = node.left;
-    const right = node.right;
-    if (k === undefined || k === null) {
-        throw new TypeError('k is not a TreeKey');
-    }
-    // && would be more accurate here but there is never a case where only one
-    // would be set and thus this way we save on error handling later on.
-    if (!left || !right) {
-        if (!direction) {
-            throw new Error('"direction" must be set');
-        }
-        if (!sibling) {
-            throw new Error('"sibling" must be set');
-        }
-        // This is a leaf node
-        if (node.key === k) {
-            return [
-                [sibling.hash, reverse(direction)],
-                [node.hash, node.key],
-            ];
-        }
-        else {
-            // Find the non-membership proof otherwise
-            return nonMembershipProof(k, node.key, direction, sibling);
-        }
-    }
-    let result;
-    if (k <= left.key) {
-        // Going towards left child
-        result = membershipProofR(right, Direction.Left, left, k);
-    }
-    else if (k <= right.key) {
-        // Going towards right child
-        result = membershipProofR(left, Direction.Right, right, k);
-    }
-    else {
-        if (k > right.key) {
-            // The given key `k` is greater than any key in this tree.
-            // Trigger a proof for the largest key
-            return [right.key, null];
-        }
-        if (!direction) {
-            // TODO How should we set direction?
-            throw new TypeError('"Direction" must be set');
-        }
-        if (!sibling) {
-            throw new Error('"sibling" must be set');
-        }
-        // Find the non-membership proof otherwise
-        return nonMembershipProof(k, node.key, direction, sibling);
-    }
-    if (sibling) {
-        if (isList(result) && direction) {
-            // @ts-ignore the array thing is confusing for TS
-            return [[sibling.hash, reverse(direction)], ...result];
-        }
-        else if (result[1] === null && direction === Direction.Left) {
-            return [node.key, minInSubtree(sibling)];
-        }
-        else if (result[0] === null && direction === Direction.Right) {
-            return [maxInSubtree(sibling), node.key];
-        }
-    }
-    return result;
-}
-export default function membershipProof(root, k) {
-    if (!root) {
-        return [];
-    }
-    // Root has no sibling or direction so null is used
-    return (match(membershipProofR(null, null, root, k))
-        // The key is present in the tree
-        // Provide the proof in reverse order
-        .on((x) => isList(x), (r) => r.reverse())
-        // The key is greater than the largest element in the tree
-        // Provide a proof for the largest key
-        .on(([_, y]) => y === null, ([x, _]) => [...membershipProof(root, x), null])
-        // The key is smaller than the smallest element in the tree
-        // Provide a proof for the smallest key
-        .on(([x, _]) => x === null, ([_, y]) => [null, ...membershipProof(root, y)])
-        // The key is bounded by by two keys in the case of non-membership proff
-        // provide a proof for the bounding keys to exist
-        .otherwise(([x, y]) => [
-        membershipProof(root, x),
-        membershipProof(root, y),
-    ]));
-}
-//# sourceMappingURL=memebership-proof.js.map

package/dist/src/server/csmt/tree-utils.d.ts

@@ -1,6 +0,0 @@
-import { TreeKey, TreeNode } from './types.js';
-export declare function distance(x: TreeKey, y: TreeKey): TreeKey;
-export declare function min(x: TreeNode<any> | null, y: TreeNode<any> | null): TreeKey;
-export declare function max(x: TreeNode<any> | null, y: TreeNode<any> | null): TreeKey;
-export declare function minInSubtree(node: TreeNode<any>): TreeKey;
-export declare function maxInSubtree(node: TreeNode<any>): TreeKey;

package/dist/src/server/csmt/tree-utils.js

@@ -1,33 +0,0 @@
-import { TreeKeyNil } from './types.js';
-export function distance(x, y) {
-    let v = x ^ y;
-    let r = TreeKeyNil;
-    while ((v >>= 1)) {
-        r++;
-    }
-    return r;
-}
-export function min(x, y) {
-    const a = (x && x.key) || TreeKeyNil;
-    const b = (y && y.key) || TreeKeyNil;
-    return a < b ? a : b;
-}
-export function max(x, y) {
-    const a = (x && x.key) || TreeKeyNil;
-    const b = (y && y.key) || TreeKeyNil;
-    return a > b ? a : b;
-}
-// Find min key in a subtree.
-export function minInSubtree(node) {
-    if (!node.left) {
-        // We assume that the tree is always full and the last left node we can
-        // find is the min.
-        return node.key;
-    }
-    return minInSubtree(node.left);
-}
-// Find max key in a subtree.
-export function maxInSubtree(node) {
-    return node.key;
-}
-//# sourceMappingURL=tree-utils.js.map

package/dist/src/server/csmt/tree.d.ts

@@ -1,3 +0,0 @@
-import { Hash, Csmt } from './types.js';
-export declare function hashEq(a: Hash, b: Hash): boolean;
-export declare function createTree<T>(createHash: () => any): Csmt<T>;