@based/db 0.0.27 → 0.0.29

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

@@ -40,8 +40,13 @@ enum SelvaSortOrder {
     SELVA_SORT_ORDER_TEXT_DESC,
 };
 
+struct SelvaSortItem;
 struct SelvaSortCtx;
 
+struct SelvaSortIterator {
+    struct SelvaSortItem *next;
+};
+
 SELVA_EXPORT
 struct SelvaSortCtx *selva_sort_init(enum SelvaSortOrder order);
 
@@ -91,43 +96,45 @@ SELVA_EXPORT
 void selva_sort_remove_text(struct SelvaSortCtx *ctx, const char *str, size_t len, const void *p);
 
 SELVA_EXPORT
-void selva_sort_foreach_begin(struct SelvaSortCtx *ctx);
+void selva_sort_foreach_begin(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void selva_sort_foreach_begin_reverse(struct SelvaSortCtx *ctx);
+void selva_sort_foreach_begin_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void *selva_sort_foreach(struct SelvaSortCtx *ctx);
+void *selva_sort_foreach(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void *selva_sort_foreach_reverse(struct SelvaSortCtx *ctx);
+void *selva_sort_foreach_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void *selva_sort_foreach_i64(struct SelvaSortCtx *ctx, int64_t *v);
+void *selva_sort_foreach_i64(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, int64_t *v);
 
 SELVA_EXPORT
-void *selva_sort_foreach_i64_reverse(struct SelvaSortCtx *ctx, int64_t *v);
+void *selva_sort_foreach_i64_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, int64_t *v);
 
 SELVA_EXPORT
-void *selva_sort_foreach_float(struct SelvaSortCtx *ctx, float *f);
+void *selva_sort_foreach_float(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, float *f);
 
 SELVA_EXPORT
-void *selva_sort_foreach_float_reverse(struct SelvaSortCtx *ctx, float *f);
+void *selva_sort_foreach_float_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, float *f);
 
 SELVA_EXPORT
-void *selva_sort_foreach_double(struct SelvaSortCtx *ctx, double *d);
+void *selva_sort_foreach_double(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, double *d);
 
 SELVA_EXPORT
-void *selva_sort_foreach_double_reverse(struct SelvaSortCtx *ctx, double *d);
+void *selva_sort_foreach_double_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, double *d);
 
 SELVA_EXPORT
-void *selva_sort_foreach_buffer(struct SelvaSortCtx *ctx, void **buf, size_t *len);
+void *selva_sort_foreach_buffer(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, void **buf, size_t *len);
 
 SELVA_EXPORT
-void *selva_sort_foreach_buffer_reverse(struct SelvaSortCtx *ctx, void **buf, size_t *len);
+void *selva_sort_foreach_buffer_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, void **buf, size_t *len);
 
-SELVA_EXPORT
-bool selva_sort_foreach_done(const struct SelvaSortCtx *ctx);
+static inline bool selva_sort_foreach_done(struct SelvaSortIterator *it)
+{
+    return !it->next;
+}
 
 SELVA_EXPORT
 int selva_sort_defrag(struct SelvaSortCtx *ctx);

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

@@ -4,6 +4,7 @@
  */
 #pragma once
 
+#include <assert.h>
 #include <sys/types.h>
 #include "selva/_export.h"
 #include "selva/types.h"
@@ -179,13 +180,16 @@ inline enum SelvaFieldType selva_get_fs_type(const struct SelvaFieldSchema *fs)
  * struct SelvaFieldSchema *dst_fs = selva_get_fs_by_node(db, dst, efc->inverse_field);
  */
 SELVA_EXPORT
+__attribute__((returns_nonnull))
 __attribute__((nonnull))
 inline const struct EdgeFieldConstraint *selva_get_edge_field_constraint(const struct SelvaFieldSchema *fs)
 #ifndef __zig
 {
-    return (fs->type == SELVA_FIELD_TYPE_REFERENCE || fs->type == SELVA_FIELD_TYPE_REFERENCES)
-        ? &fs->edge_constraint
-        : nullptr;
+    assert(fs->type == SELVA_FIELD_TYPE_REFERENCE ||
+           fs->type == SELVA_FIELD_TYPE_REFERENCES ||
+           fs->type == SELVA_FIELD_TYPE_WEAK_REFERENCE ||
+           fs->type == SELVA_FIELD_TYPE_WEAK_REFERENCES);
+    return &fs->edge_constraint;
 }
 #else
 ;
@@ -349,7 +353,7 @@ SELVA_EXPORT
 selva_hash128_t selva_node_hash(struct SelvaDb *db, struct SelvaTypeEntry *type, struct SelvaNode *node);
 
 SELVA_EXPORT
-selva_hash128_t selva_node_hash_range(struct SelvaDb *db, struct SelvaTypeEntry *type, node_id_t start, node_id_t end) __attribute__((nonnull));
+int selva_node_hash_range(struct SelvaDb *db, struct SelvaTypeEntry *type, node_id_t start, node_id_t end, selva_hash128_t *hash_out) __attribute__((nonnull, warn_unused_result));
 
 /**
  * @}

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

@@ -1,25 +1,33 @@
 /*
- * Copyright (c) 2024 SAULX
+ * Copyright (c) 2024-2025 SAULX
  * SPDX-License-Identifier: MIT
  */
 #pragma once
 #include "xxhash.h"
+#include "jemalloc_selva.h"
 #include "selva/types.h"
 
 typedef struct XXH3_state_s selva_hash_state_t;
 
-#define selva_hash_create_state XXH3_createState
 #define selva_hash_reset XXH3_128bits_reset
-#define selva_hash_free_state XXH3_freeState
 #define selva_hash_update XXH3_128bits_update
 
 SELVA_EXPORT
-selva_hash128_t selva_hash_digest_zig(selva_hash_state_t *hash_state);
+selva_hash_state_t *selva_hash_create_state(void);
 
-#ifdef __zig
-#define selva_hash_digest selva_hash_digest_zig
+SELVA_EXPORT
+inline void selva_hash_free_state(selva_hash_state_t *state)
+#ifndef __zig
+{
+    selva_free(state);
+}
 #else
-static inline selva_hash128_t selva_hash_digest(selva_hash_state_t *hash_state)
+;
+#endif
+
+SELVA_EXPORT
+inline selva_hash128_t selva_hash_digest(selva_hash_state_t *hash_state)
+#ifndef __zig
 {
     XXH128_hash_t res;
 
@@ -36,4 +44,6 @@ retry:
 
     return (selva_hash128_t)res.low64 | (selva_hash128_t)res.high64 << 64;
 }
+#else
+;
 #endif

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

@@ -40,8 +40,13 @@ enum SelvaSortOrder {
     SELVA_SORT_ORDER_TEXT_DESC,
 };
 
+struct SelvaSortItem;
 struct SelvaSortCtx;
 
+struct SelvaSortIterator {
+    struct SelvaSortItem *next;
+};
+
 SELVA_EXPORT
 struct SelvaSortCtx *selva_sort_init(enum SelvaSortOrder order);
 
@@ -91,43 +96,45 @@ SELVA_EXPORT
 void selva_sort_remove_text(struct SelvaSortCtx *ctx, const char *str, size_t len, const void *p);
 
 SELVA_EXPORT
-void selva_sort_foreach_begin(struct SelvaSortCtx *ctx);
+void selva_sort_foreach_begin(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void selva_sort_foreach_begin_reverse(struct SelvaSortCtx *ctx);
+void selva_sort_foreach_begin_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void *selva_sort_foreach(struct SelvaSortCtx *ctx);
+void *selva_sort_foreach(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void *selva_sort_foreach_reverse(struct SelvaSortCtx *ctx);
+void *selva_sort_foreach_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it);
 
 SELVA_EXPORT
-void *selva_sort_foreach_i64(struct SelvaSortCtx *ctx, int64_t *v);
+void *selva_sort_foreach_i64(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, int64_t *v);
 
 SELVA_EXPORT
-void *selva_sort_foreach_i64_reverse(struct SelvaSortCtx *ctx, int64_t *v);
+void *selva_sort_foreach_i64_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, int64_t *v);
 
 SELVA_EXPORT
-void *selva_sort_foreach_float(struct SelvaSortCtx *ctx, float *f);
+void *selva_sort_foreach_float(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, float *f);
 
 SELVA_EXPORT
-void *selva_sort_foreach_float_reverse(struct SelvaSortCtx *ctx, float *f);
+void *selva_sort_foreach_float_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, float *f);
 
 SELVA_EXPORT
-void *selva_sort_foreach_double(struct SelvaSortCtx *ctx, double *d);
+void *selva_sort_foreach_double(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, double *d);
 
 SELVA_EXPORT
-void *selva_sort_foreach_double_reverse(struct SelvaSortCtx *ctx, double *d);
+void *selva_sort_foreach_double_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, double *d);
 
 SELVA_EXPORT
-void *selva_sort_foreach_buffer(struct SelvaSortCtx *ctx, void **buf, size_t *len);
+void *selva_sort_foreach_buffer(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, void **buf, size_t *len);
 
 SELVA_EXPORT
-void *selva_sort_foreach_buffer_reverse(struct SelvaSortCtx *ctx, void **buf, size_t *len);
+void *selva_sort_foreach_buffer_reverse(struct SelvaSortCtx *ctx, struct SelvaSortIterator *it, void **buf, size_t *len);
 
-SELVA_EXPORT
-bool selva_sort_foreach_done(const struct SelvaSortCtx *ctx);
+static inline bool selva_sort_foreach_done(struct SelvaSortIterator *it)
+{
+    return !it->next;
+}
 
 SELVA_EXPORT
 int selva_sort_defrag(struct SelvaSortCtx *ctx);

package/dist/src/client/flushModify.d.ts

@@ -7,8 +7,8 @@ export declare class ModifyCtx {
     id: number;
     hasSortField: number;
     hasSortText: number;
-    queue: Map<(payload: any) => void, ModifyState>;
     ctx: {
+        queue?: Map<(payload: any) => void, ModifyState>;
         offsets?: Record<number, number>;
     };
     payload: Uint8Array;

package/dist/src/client/flushModify.js

@@ -14,8 +14,7 @@ export class ModifyCtx {
     id = -1;
     hasSortField = -1;
     hasSortText = -1;
-    queue = new Map();
-    ctx = {}; // maybe make this different?
+    ctx = {};
     payload;
     max;
     buf;
@@ -95,7 +94,6 @@ export const flushBuffer = (db) => {
         const lastIds = {};
         const data = ctx.getData(lastIds);
         const resCtx = ctx.ctx;
-        const queue = ctx.queue;
         flushPromise = db.hooks.flushModify(data).then(({ offsets }) => {
             resCtx.offsets = offsets;
             for (const typeId in lastIds) {
@@ -112,15 +110,15 @@ export const flushBuffer = (db) => {
                     console.warn('no offset returned, very wrong');
                 }
             }
-            db.writeTime += Date.now() - d;
-            if (queue.size) {
-                flushPromise.then(() => {
-                    for (const [resolve, res] of queue) {
-                        resolve(res.getId());
-                    }
-                });
+            if (resCtx.queue?.size) {
+                const queue = resCtx.queue;
+                resCtx.queue = null;
+                for (const [resolve, res] of queue) {
+                    resolve(res.getId());
+                }
             }
-            db.hooks.flushReady();
+            db.writeTime += Date.now() - d;
+            db.flushReady();
         });
         ctx.dirtyTypes.clear();
         ctx.dirtyRanges.clear();
@@ -131,17 +129,14 @@ export const flushBuffer = (db) => {
         ctx.ctx = {};
     }
     else {
-        db.hooks.flushReady();
+        db.flushReady();
     }
     db.isDraining = false;
     return flushPromise;
 };
 export const startDrain = (db) => {
-    db.hooks.flushIsReady = new Promise((resolve) => {
-        db.hooks.flushReady = resolve;
-    });
     db.isDraining = true;
-    if (db.hooks.flushTime === 0) {
+    if (db.flushTime === 0) {
         process.nextTick(() => {
             flushBuffer(db);
         });
@@ -149,7 +144,7 @@ export const startDrain = (db) => {
     else {
         setTimeout(() => {
             flushBuffer(db);
-        }, db.hooks.flushTime);
+        }, db.flushTime);
     }
 };
 //# sourceMappingURL=flushModify.js.map

package/dist/src/client/index.d.ts

@@ -13,20 +13,22 @@ export type DbClientHooks = {
     flushModify(buf: Uint8Array): Promise<{
         offsets: Record<number, number>;
     }>;
-    flushIsReady: Promise<any>;
-    flushReady: (v?: any) => void;
     getQueryBuf(buf: Uint8Array): Promise<Uint8Array>;
-    flushTime: number;
 };
 type DbClientOpts = {
     hooks: DbClientHooks;
     maxModifySize?: number;
+    flushTime?: number;
+    debug?: boolean;
 };
 type DbClientSchema = StrictSchema & {
     lastId: number;
 };
 export declare class DbClient {
-    constructor({ hooks, maxModifySize }: DbClientOpts);
+    constructor({ hooks, maxModifySize, flushTime, debug, }: DbClientOpts);
+    flushTime: number;
+    flushReady: () => void;
+    flushIsReady: Promise<void>;
     hooks: DbClientHooks;
     schema: DbClientSchema;
     schemaIsSetValue: boolean;

package/dist/src/client/index.js

@@ -10,12 +10,29 @@ import { deleteFn } from './modify/delete.js';
 import { deepEqual } from '@saulx/utils';
 import { hash } from '@saulx/hash';
 import { expire } from './modify/expire.js';
+import { debugMode } from '../utils.js';
+const makeFlushIsReady = (dbClient) => {
+    dbClient.flushIsReady = new Promise((resolve) => {
+        dbClient.flushReady = () => {
+            resolve();
+            makeFlushIsReady(dbClient);
+        };
+    });
+};
 export class DbClient {
-    constructor({ hooks, maxModifySize = 100 * 1e3 * 1e3 }) {
+    constructor({ hooks, maxModifySize = 100 * 1e3 * 1e3, flushTime = 0, debug, }) {
         this.hooks = hooks;
         this.maxModifySize = maxModifySize;
         this.modifyCtx = new ModifyCtx(this);
+        this.flushTime = flushTime;
+        makeFlushIsReady(this);
+        if (debug) {
+            debugMode(this);
+        }
     }
+    flushTime;
+    flushReady;
+    flushIsReady;
     hooks;
     schema = {
         lastId: 1, // we reserve one for root props
@@ -185,7 +202,7 @@ export class DbClient {
         if (!this.isDraining) {
             startDrain(this);
         }
-        await this.hooks.flushIsReady;
+        await this.flushIsReady;
         return;
     }
     schemaIsSet() {

package/dist/src/client/modify/ModifyRes.d.ts

@@ -20,6 +20,6 @@ export declare class ModifyState {
     error?: ModifyError;
     promises?: Promise<any>[];
     getId(): number;
-    then(resolve: any, reject: any): Promise<unknown>;
+    then(resolve: any, reject: any): Promise<any>;
     catch(handler: any): this | Promise<unknown>;
 }

package/dist/src/client/modify/ModifyRes.js

@@ -45,7 +45,6 @@ export class ModifyState {
     constructor(typeId, tmpId, db, subMarkers, opts, update = false) {
         this.tmpId = tmpId;
         this.#typeId = typeId;
-        this.#buf = db.modifyCtx;
         this.#ctx = db.modifyCtx.ctx;
         this.subMarkers = subMarkers;
         this.update = update;
@@ -56,7 +55,6 @@ export class ModifyState {
     subMarkers;
     update;
     locale;
-    #buf;
     #ctx;
     #typeId;
     tmpId;
@@ -71,26 +69,24 @@ export class ModifyState {
             return this.tmpId + offset;
         }
     }
-    then(resolve, reject) {
-        const promise = new Promise((resolve) => {
-            if (this.error) {
-                reject(new Error(this.error.toString()));
-            }
-            else if ('offsets' in this.#ctx) {
-                resolve(this.getId());
-            }
-            else {
-                this.#buf.queue.set(resolve, this);
-            }
-        });
+    async then(resolve, reject) {
         if (this.promises?.length) {
-            return Promise.allSettled(this.promises)
-                .then(() => promise)
-                .then(resolve, reject);
+            await Promise.allSettled(this.promises);
+        }
+        let promise;
+        if (this.error) {
+            promise = Promise.reject(new Error(this.error.toString()));
+        }
+        else if ('offsets' in this.#ctx) {
+            promise = Promise.resolve(this.getId());
         }
         else {
-            return promise.then(resolve, reject);
+            promise = new Promise((resolve) => {
+                this.#ctx.queue ??= new Map();
+                this.#ctx.queue.set(resolve, this);
+            });
         }
+        return promise.then(resolve, reject);
     }
     catch(handler) {
         if (this.error) {

package/dist/src/client/modify/fixed.js

@@ -1,6 +1,6 @@
 import { ENCODER } from '../../index.js';
 import { BINARY, BOOLEAN, ENUM, INT16, INT32, INT8, NUMBER, STRING, TIMESTAMP, UINT16, UINT32, UINT8, } from '@based/schema/def';
-import { convertToTimestamp } from '../timestamp.js';
+import { convertToTimestamp } from '@saulx/utils';
 import { getBuffer } from './binary.js';
 import { ModifyError } from './ModifyRes.js';
 import { RANGE_ERR } from './types.js';
@@ -10,6 +10,9 @@ map[BINARY] = (ctx, val, def) => {
     if (buf === undefined) {
         return new ModifyError(def, val);
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     const size = buf.byteLength;
     if (ctx.len + size + 1 > ctx.max) {
         return RANGE_ERR;
@@ -24,17 +27,27 @@ map[STRING] = (ctx, val, def) => {
     if (size + 1 > def.len) {
         return new ModifyError(def, val, `max length of ${def.len - 1},`);
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     if (ctx.len + size + 1 > ctx.max) {
         return RANGE_ERR;
     }
     ctx.buf[ctx.len++] = size;
     ctx.buf.set(valBuf, ctx.len);
-    ctx.len += size;
+    const fullSize = def.len - 1;
+    ctx.len += fullSize;
+    if (fullSize !== size) {
+        ctx.buf.fill(0, ctx.len - (fullSize - size), ctx.len);
+    }
 };
 map[BOOLEAN] = (ctx, val, def) => {
     if (ctx.len + 1 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     if (val === null) {
         ctx.buf[ctx.len++] = 0;
     }
@@ -49,6 +62,9 @@ map[ENUM] = (ctx, val, def) => {
     if (ctx.len + 1 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     if (val === null) {
         ctx.buf[ctx.len++] = 0;
     }
@@ -63,6 +79,9 @@ map[NUMBER] = (ctx, val, def) => {
     if (ctx.len + 8 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     const view = new DataView(ctx.buf.buffer, ctx.buf.byteOffset + ctx.len, 8);
     ctx.len += 8;
     view.setFloat64(0, val, true);
@@ -72,14 +91,21 @@ map[TIMESTAMP] = (ctx, val, def) => {
     if (ctx.len + 8 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(parsedValue, def)) {
+        return new ModifyError(def, val);
+    }
     const view = new DataView(ctx.buf.buffer, ctx.buf.byteOffset + ctx.len, 8);
     ctx.len += 8;
     view.setFloat64(0, parsedValue, true);
+    const ts = view.getFloat64(0);
 };
 map[UINT32] = (ctx, val, def) => {
     if (ctx.len + 4 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     ctx.buf[ctx.len++] = val;
     ctx.buf[ctx.len++] = val >>>= 8;
     ctx.buf[ctx.len++] = val >>>= 8;
@@ -89,6 +115,9 @@ map[UINT16] = (ctx, val, def) => {
     if (ctx.len + 2 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     ctx.buf[ctx.len++] = val;
     ctx.buf[ctx.len++] = val >>>= 8;
 };
@@ -96,12 +125,18 @@ map[UINT8] = (ctx, val, def) => {
     if (ctx.len + 1 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     ctx.buf[ctx.len++] = val;
 };
 map[INT32] = (ctx, val, def) => {
     if (ctx.len + 4 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     ctx.buf[ctx.len++] = val;
     ctx.buf[ctx.len++] = val >>>= 8;
     ctx.buf[ctx.len++] = val >>>= 8;
@@ -111,6 +146,9 @@ map[INT16] = (ctx, val, def) => {
     if (ctx.len + 2 > ctx.max) {
         return RANGE_ERR;
     }
+    if (!def.validation(val, def)) {
+        return new ModifyError(def, val);
+    }
     ctx.buf[ctx.len++] = val;
     ctx.buf[ctx.len++] = val >>>= 8;
 };
@@ -118,12 +156,12 @@ map[INT8] = (ctx, val, def) => {
     if (ctx.len + 1 > ctx.max) {
         return RANGE_ERR;
     }
-    ctx.buf[ctx.len++] = val;
-};
-export const writeFixedValue = (ctx, val, def, pos) => {
     if (!def.validation(val, def)) {
         return new ModifyError(def, val);
     }
+    ctx.buf[ctx.len++] = val;
+};
+export const writeFixedValue = (ctx, val, def, pos) => {
     const len = ctx.len;
     ctx.len = pos;
     const res = map[def.typeIndex](ctx, val, def);
@@ -131,9 +169,6 @@ export const writeFixedValue = (ctx, val, def, pos) => {
     return res;
 };
 export const appendFixedValue = (ctx, val, def) => {
-    if (!def.validation(val, def)) {
-        return new ModifyError(def, val);
-    }
     return map[def.typeIndex](ctx, val, def);
 };
 //# sourceMappingURL=fixed.js.map

package/dist/src/client/modify/modify.js

@@ -77,7 +77,6 @@ function _modify(ctx, res, obj, schema, mod, tree, overwrite, unsafe) {
                     ctx.lastMain = ctx.len;
                     ctx.buf.set(schema.mainEmpty, ctx.len);
                     ctx.len += schema.mainLen;
-                    // ctx.buf.fill(0, ctx.len, (ctx.len += schema.mainLen))
                 }
                 if (typeof val === 'object' && val !== null && 'increment' in val) {
                     err = writeFixedValue(ctx, val.increment, def, ctx.lastMain + def.start);

package/dist/src/client/modify/references/{appendRefs.d.ts → appendEdgeRefs.d.ts}

@@ -1,4 +1,4 @@
 import { PropDefEdge } from '@based/schema/def';
 import { ModifyCtx } from '../../flushModify.js';
 import { ModifyErr } from '../types.js';
-export declare function appendRefs(t: PropDefEdge, ctx: ModifyCtx, value: any[]): ModifyErr;
+export declare function appendEdgeRefs(t: PropDefEdge, ctx: ModifyCtx, value: any[]): ModifyErr;

package/dist/src/client/modify/references/{appendRefs.js → appendEdgeRefs.js}

@@ -1,5 +1,5 @@
 import { ModifyState, ModifyError } from '../ModifyRes.js';
-export function appendRefs(t, ctx, value) {
+export function appendEdgeRefs(t, ctx, value) {
     for (let i = 0; i < value.length; i++) {
         let id = value[i];
         if (typeof id !== 'number') {
@@ -13,6 +13,9 @@ export function appendRefs(t, ctx, value) {
                 return new ModifyError(t, value);
             }
         }
+        if (!t.validation(id, t)) {
+            return new ModifyError(t, value);
+        }
         if (id > 0) {
             ctx.buf[ctx.len++] = id;
             ctx.buf[ctx.len++] = id >>>= 8;
@@ -24,4 +27,4 @@ export function appendRefs(t, ctx, value) {
         }
     }
 }
-//# sourceMappingURL=appendRefs.js.map
+//# sourceMappingURL=appendEdgeRefs.js.map