datafolder 1.0.18 → 1.0.19

package/src/QyFileContentUtils.js

@@ -3,40 +3,42 @@ import {
 } from "node:util";
 
 import {
-    isDate as a,
-    isArray as g,
-    isNotNullObj as f,
-    trimArrayTail as m,
-    isSimpleType as p,
+    isDate as f,
+    isArray as d,
+    isNotNullObj as a,
+    trimArrayTail as o,
+    isSimpleType as s,
     SpecialOperators as r,
     isEmptyObj as i,
-    isFloat32Array as u
+    isUint8Array as u,
+    isNumber as c
 } from "./QyUtils.js";
 
 let {
-    $del: y,
-    $rpl: h,
-    $ext: w,
-    $f32: o
+    $del: g,
+    $rpl: p,
+    $ext: V,
+    $pop: m,
+    $u8: v
 } = r;
 
-function d(e, l) {
-    if (null == l) return e;
-    if (l !== y) {
-        if (p(l)) return l;
-        var n = l[h];
-        if (null != n) {
-            let r = n[o];
-            return null != r ? new Float32Array(r) : n;
+function h(e, n) {
+    if (null == n) return e;
+    if (n !== g) {
+        if (s(n)) return n;
+        var l = n[p];
+        if (null != l) {
+            let r = l[v];
+            return null != r ? new Uint8Array(r) : l;
         }
-        let r = l[o];
-        if (null != r) return new Float32Array(r);
-        if (null == e || p(e)) return l;
-        if (e != l) {
-            var t, u = g(e);
-            for (t in l) {
-                var i = d(e[t], l[t]);
-                null == i ? (delete e[t], u && m(e)) : e[t] = i;
+        let r = n[v];
+        if (null != r) return new Uint8Array(r);
+        if (null == e || s(e)) return n;
+        if (e != n) {
+            var t, u = d(e);
+            for (t in n) {
+                var i = h(e[t], n[t]);
+                null == i ? (delete e[t], u && o(e)) : e[t] = i;
             }
         }
         return e;
@@ -44,140 +46,150 @@ function d(e, l) {
 }
 
 function e(r, e) {
-    let l = {
+    let n = {
         oldValue: {},
         newValue: {}
     };
-    r = S(r, e, [], 0, l);
-    return l.oldValue = A(l.oldValue, !0), l.newValue = A(l.newValue, !1), {
+    r = $(r, e, [], 0, n);
+    return n.oldValue = A(n.oldValue, !0), n.newValue = A(n.newValue, !1), {
         merged: r,
-        delta: l = l.oldValue || l.newValue ? l : void 0
+        delta: n = n.oldValue || n.newValue ? n : void 0
     };
 }
 
-function v(r, e, l) {
-    if (!e || 0 == e.length) return l;
-    let n = r;
+function y(r, e, n) {
+    if (!e || 0 == e.length) return n;
+    let l = r;
     for (let r = 0; r < e.length - 1; ++r) {
         var t = e[r];
-        f(n[t]) || (n[t] = {}), n = n[t];
+        a(l[t]) || (l[t] = {}), l = l[t];
     }
     var u = e.at(-1);
-    return void 0 === l ? delete n[u] : n[u] = l, r;
+    return void 0 === n ? delete l[u] : l[u] = n, r;
 }
 
-function l(r, e) {
-    if (null != e && null != (r = c(r))) {
-        if (!g(e)) return "" == e ? r : c(r[e]);
-        if (0 != e.length && (1 != e.length || "" != e[0])) for (var l of e) if (null == (r = c(r[l]))) return;
+function n(r, e) {
+    if (null != e && null != (r = b(r))) {
+        if (!d(e)) return "" == e ? r : b(r[e]);
+        if (0 != e.length && (1 != e.length || "" != e[0])) for (var n of e) if (null == (r = b(r[n]))) return;
         return r;
     }
 }
 
-function s(r, e, l = !1, n = 0) {
-    var t = e[n];
-    if (n == e.length - 1) return delete r[t], !l && i(r) ? void 0 : r;
+function w(r, e, n = !1, l = 0) {
+    var t = e[l];
+    if (l == e.length - 1) return delete r[t], !n && i(r) ? void 0 : r;
     var u = r[t];
-    if (f(u)) {
-        u = s(u, e, l, n + 1);
-        if (null == u && !l) return delete r[t], i(r) ? void 0 : r;
+    if (a(u)) {
+        u = w(u, e, n, l + 1);
+        if (null == u && !n) return delete r[t], i(r) ? void 0 : r;
         r[t] = u;
     }
     return r;
 }
 
 function A(r, e = !0) {
-    return function l(n, t) {
-        if (a(n)) return n.toISOString();
-        if (!f(n)) return t && n === y ? void 0 : n;
-        if (t) {
-            let r = n[h];
-            if (null != r) return l(r, t);
-            let e = n[w];
-            if (null != e) return l(g(e) ? e : [ e ], t);
+    return function l(t, u) {
+        if (f(t)) return t.toISOString();
+        if (!a(t)) return u && t === g ? void 0 : t;
+        if (u) {
+            let r = t[p];
+            if (null != r) return l(r, u);
+            let e = t[V];
+            if (null != e) return l(d(e) ? e : [ e ], u);
+            let n = t[m];
+            if (null != n) return;
         }
-        let e = g(n);
-        let u = !0;
-        for (var i in n) {
-            let r = l(n[i], t);
-            void 0 === r ? (delete n[i], e && m(n)) : (n[i] = r, u = !1);
+        let e = d(t);
+        let n = !0;
+        for (var i in t) {
+            let r = l(t[i], u);
+            void 0 === r ? (delete t[i], e && o(t)) : (t[i] = r, n = !1);
         }
-        return u ? void 0 : n;
+        return n ? void 0 : t;
     }(r, e);
 }
 
-function n(r) {
-    if (p(r)) return r ? y : void 0;
+function l(r) {
+    if (s(r)) return r ? g : void 0;
     for (var e in r) {
-        var l = n(r[e]);
-        l ? r[e] = l : delete r[e];
+        var n = l(r[e]);
+        n ? r[e] = n : delete r[e];
     }
-    return g(r) && m(r), r;
+    return d(r) && o(r), r;
 }
 
-function S(e, l, n, t, u) {
-    if (void 0 === l) return e;
-    if (l !== y && null !== l) {
-        if (null == e || p(e) || p(l)) return O(e, l, n, u);
-        var i = l[h];
-        if (null != i) return O(e, i, n, u);
-        let r = l[w];
-        if (null != r) return g(r) || (r = [ r ]), (g(e) ? (e, l, r, n) => {
-            l = A(l);
+function S(r, e, n, l, t) {
+    if (r != e) {
+        var u, i = d(r);
+        for (u in e) {
+            n[l] = u, n.length = l + 1;
+            var f = $(r[u], e[u], n, l + 1, t);
+            null == f ? (delete r[u], i && o(r)) : r[u] = f;
+        }
+    }
+    return r;
+}
+
+function $(e, n, l, t, u) {
+    if (void 0 === n) return e;
+    if (n !== g && null !== n) {
+        if (null == e || s(e) || s(n)) return O(e, n, l, u);
+        var i = n[p];
+        if (null != i) return O(e, i, l, u);
+        let r = n[V];
+        if (null != r) return d(r) || (r = [ r ]), (d(e) ? (e, n, r, l) => {
+            n = A(n);
             var t = {};
-            for (let r = 0; r < l.length; ++r) {
-                var u = l[r];
-                null != u && (t[r + e.length] = p(u) ? u : {
-                    [h]: u
+            for (let r = 0; r < n.length; ++r) {
+                var u = n[r];
+                null != u && (t[r + e.length] = s(u) ? u : {
+                    [p]: u
                 });
             }
-            return $(n, r, e, t), e.concat(l);
-        } : O)(e, r, n, u);
-        if (g(e) && !g(l) || !g(e) && g(l)) return O(e, l, n, u);
-        var a = e, f = l, o = n, d = t, v = u;
-        if (a != f) {
-            var s, c = g(a);
-            for (s in f) {
-                o[d] = s, o.length = d + 1;
-                var V = S(a[s], f[s], o, d + 1, v);
-                null == V ? (delete a[s], c && m(a)) : a[s] = V;
-            }
-        }
-        return a;
+            return U(l, r, e, t), e.concat(n);
+        } : O)(e, r, l, u);
+        i = n[m];
+        if (null == i) return d(e) && !d(n) || !d(e) && d(n) ? O(e, n, l, u) : S(e, n, l, t, u);
+        var n = e, f = l, a = u;
+        if (!i || !d(n)) return n;
+        var o = n.length, v = [];
+        for (let r = c(i) ? i <= o ? i : o : 1; 0 < r; --r) v[o - r] = g;
+        return S(n, v, f, t, a);
     }
-    null != e && $(u, n, e, y);
+    null != e && U(u, l, e, g);
 }
 
-function O(r, e, l, n) {
+function O(r, e, n, l) {
     e = A(e);
-    return r === e || u(r) && u(e) && t(r, e) ? r : null != e ? (null == r ? $(n, l, 0 == l.length ? void 0 : null, u(e) ? {
-        [o]: Array.from(e)
-    } : p(e) ? e : {
-        [h]: e
-    }) : $(n, l, r, u(e) ? {
-        [o]: Array.from(e)
-    } : p(r) ? e : {
-        [h]: e
-    }), e) : void $(n, l, r, y);
+    return r === e || u(r) && u(e) && t(r, e) ? r : null != e ? (null == r ? U(l, n, 0 == n.length ? void 0 : null, u(e) ? {
+        [v]: Array.from(e)
+    } : s(e) ? e : {
+        [p]: e
+    }) : U(l, n, r, u(e) ? {
+        [v]: Array.from(e)
+    } : s(r) ? e : {
+        [p]: e
+    }), e) : void U(l, n, r, g);
 }
 
-function $(r, e, l, n) {
-    r.oldValue = v(r.oldValue, e, l), r.newValue = v(r.newValue, e, n);
+function U(r, e, n, l) {
+    r.oldValue = y(r.oldValue, e, n), r.newValue = y(r.newValue, e, l);
 }
 
-function c(r) {
-    if (null != r && r != y) {
-        for (;null != r[h]; ) if ((r = r[h]) == y) return;
+function b(r) {
+    if (null != r && r != g) {
+        for (;null != r[p]; ) if ((r = r[p]) == g) return;
         return r;
     }
 }
 
 export {
-    d as mergeContent,
+    h as mergeContent,
     e as mergeContentAndGenDelta,
-    v as setValByNamePath,
-    l as getValByNamePath,
-    s as delValByNamePath,
+    y as setValByNamePath,
+    n as getValByNamePath,
+    w as delValByNamePath,
     A as cleanContent,
-    n as objToDelMarks
+    l as objToDelMarks
 };

package/src/QyHNSW.d.ts

@@ -1,10 +1,7 @@
 export declare class QyHNSW {
-    items: any[];
-    cmpFun: any;
-    constructor(cmpFun?: (x: any, y: any) => number);
-    get size(): number;
-    get isEmpty(): boolean;
-    peek(): any;
-    push(item: any): void;
-    pop(): any;
+    probs: any;
+    constructor(M: any);
+    _determineLayer(prob: any): number | undefined;
 }
+export declare function cosineSimilarity(a: any, b: any): number;
+export declare function euclideanSimilarity(a: any, b: any): number;

package/src/QyHNSW.js

@@ -1,57 +1,49 @@
 import "./QyBinaryHeap.js";
 
 class t {
-    items = [];
-    cmpFun;
-    constructor(t = (t, e) => t - e) {
-        this.cmpFun = t;
-    }
-    get size() {
-        return this.items.length;
-    }
-    get isEmpty() {
-        return 0 == this.items.length;
-    }
-    peek() {
-        return this.items[0];
-    }
-    push(t) {
-        var e = this.items;
-        e.push(t), i(this);
-    }
-    pop() {
-        if (!this.isEmpty) {
-            for (var t = this.items, e = t[0], [ t, i = 0 ] = (t[0] = t.at(-1), 
-            --t.length, [ this ]), {
-                items: s,
-                cmpFun: r
-            } = t, h = s.length; i < h; ) {
-                var n = 2 * i + 1;
-                if (!(n < h)) break;
-                {
-                    let t = i;
-                    0 < r(s[n], s[t]) && (t = n);
-                    n = 1 + n;
-                    if ((t = n < h && 0 < r(s[n], s[t]) ? n : t) == i) break;
-                    [ s[i], s[t] ] = [ s[t], s[i] ], i = t;
+    probs;
+    constructor(t) {
+        this.probs = (t => {
+            let r = 1 / Math.log(t), e = [], n = 0;
+            for (;;) {
+                var a = Math.exp(-e.length / r) * (1 - Math.exp(-1 / r));
+                if (a < 1e-9) {
+                    e.push(1);
+                    break;
                 }
+                e.push(n += a);
             }
             return e;
-        }
+        })(t);
+    }
+    _determineLayer(r) {
+        var e = this.probs, n = e.length;
+        for (let t = 0; t < n; ++t) if (r <= e[t]) return t;
     }
 }
 
-function i(t, e = t.items.length - 1) {
-    for (var {
-        items: i,
-        cmpFun: s
-    } = t; 0 < e; ) {
-        var r = Math.floor((e - 1) / 2);
-        if (!(0 < s(i[e], i[r]))) break;
-        [ i[e], i[r] ] = [ i[r], i[e] ], e = r;
-    }
+function e(r, e = r) {
+    var n = r.length;
+    let a = 0;
+    for (let t = 0; t < n; ++t) a += r[t] * e[t];
+    return a;
+}
+
+function r(t, r) {
+    return e(t, r) / (Math.sqrt(e(t)) * Math.sqrt(e(r)));
+}
+
+function n(t, r) {
+    return 1 / (1 + ((r, e) => {
+        var n = r.length;
+        let a = 0;
+        for (let t = 0; t < n; ++t) a += (r[t] - e[t]) ** 2;
+        return Math.sqrt(a);
+    })(t, r));
 }
 
 export {
-    t as QyHNSW
+    t as QyHNSW,
+    r as cosineSimilarity,
+    n as euclideanSimilarity
 };