datafolder 1.0.17 → 1.0.19

package/src/QyFile.js

@@ -10,7 +10,8 @@ import {
     isSimpleType as h,
     fromSingleName as s,
     isEmptyObj as r,
-    getNowTime as l
+    getNowTime as l,
+    isArray as d
 } from "./QyUtils.js";
 
 import {
@@ -25,13 +26,13 @@ import {
     handleExpiredProps as u
 } from "./QyExpire.js";
 
-let d = Array.isArray, C = n.IndexPropPathsFileName, {
+let C = n.IndexPropPathsFileName, {
     $spec: p,
     $raw: c,
-    $clone: y
+    $clone: m
 } = t;
 
-class m extends e {
+class y extends e {
     _fileContentKey;
     _fileContent;
     cChangeId = 0;
@@ -80,7 +81,7 @@ class m extends e {
     get clonedContent() {
         return structuredClone(this.fileContent);
     }
-    view(e = y, t) {
+    view(e = m, t) {
         var n = this.fileContent;
         return null == n || h(n) ? n : function t(n, i, r, o) {
             if (r === c) return i;
@@ -105,7 +106,7 @@ class m extends e {
             return s;
         }(this, n, e, t);
     }
-    prop(e, t = y, n) {
+    prop(e, t = m, n) {
         var i;
         if (t) return e = o(this.fileContent, d(e) ? e : [ e ]), i = t.$link, null != i ? v(this, e, i, t[p], n) : n || t === c ? e : structuredClone(e);
     }
@@ -161,5 +162,5 @@ function v(e, t, n, i, r = !1) {
 }
 
 export {
-    m as QyFile
+    y as QyFile
 };

package/src/QyFileContentUtils.d.ts

@@ -1,5 +1,4 @@
 export declare function mergeContent(oldContent: any, newContent: any): any;
-export declare function mergeChanges(oldChanges: any, newChanges: any): any;
 export declare function mergeContentAndGenDelta(oldContent: any, newContent: any): {
     merged: any;
     delta: any;

package/src/QyFileContentUtils.js

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

package/src/QyHNSW.d.ts

@@ -0,0 +1,7 @@
+export declare class QyHNSW {
+    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

@@ -0,0 +1,49 @@
+import "./QyBinaryHeap.js";
+
+class 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 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,
+    r as cosineSimilarity,
+    n as euclideanSimilarity
+};

package/src/QyIndex.js

@@ -7,35 +7,36 @@ import {
     SpecialOperators as i,
     getSuffix as p,
     fromSingleName as r,
-    toSingleName as o
+    toSingleName as o,
+    isArray as v
 } from "./QyUtils.js";
 
 import {
-    getValByNamePath as v
+    getValByNamePath as m
 } from "./QyFileContentUtils.js";
 
 import {
-    QyUnionNode as m
+    QyUnionNode as y
 } from "./QyUnionNode.js";
 
 import {
-    QyIntersectNode as y
+    QyIntersectNode as b
 } from "./QyIntersectNode.js";
 
 import {
-    logger as b
+    logger as S
 } from "./QyLogger.js";
 
-let S = Array.isArray, {
+let {
     $or: h,
     $and: N
-} = i, $ = new m(), l = [];
+} = i, $ = new y(), l = [];
 
 function e(e) {
     if (null != e && !s(e)) return function r(i, n, t, l) {
         if (C(i)) 0 < t.length && (n[o(t)] = 1); else {
             let e = i[h] || i[N];
-            if (null != e) if (S(e)) for (var f of e) r(f, n, t, l), t.length = l; else r(e, n, t, l), 
+            if (null != e) if (v(e)) for (var f of e) r(f, n, t, l), t.length = l; else r(e, n, t, l), 
             t.length = l; else for (var u in i) t.push(u), r(i[u], n, t, l + 1), 
             t.length = l;
         }
@@ -43,9 +44,9 @@ function e(e) {
 }
 
 function n(e, r, i, n, t, l) {
-    n = v(n, r), t = v(t, r);
+    n = m(n, r), t = m(t, r);
     if (n !== t) {
-        var f, u, o, a, l = S(t) || S(v(l, r)), s = Object.fromEntries(Q(n, l).map(e => [ JSON.stringify(e), e ])), d = Object.fromEntries(Q(t, l).map(e => [ JSON.stringify(e), e ])), g = [], c = [];
+        var f, u, o, a, l = v(t) || v(m(l, r)), s = Object.fromEntries(Q(n, l).map(e => [ JSON.stringify(e), e ])), d = Object.fromEntries(Q(t, l).map(e => [ JSON.stringify(e), e ])), g = [], c = [];
         for (f in s) d[f] || (u = s[f], (u = e.searchSubdir(u)) && (u = u.getFile(i)) && c.push(u));
         for (o in d) s[o] || (a = d[o], a = e.searchOrCreateSubdir(a), g.push(a.getOrCreateFile(i)));
         return {
@@ -70,9 +71,9 @@ function* L(e, r, i = 0) {
         if ("**" == n) {
             t.isHiddenFolder || (yield t);
             for (var e of t.allSubdirs()) yield e;
-        } else if ("*" == n) for (var f of t.subdirList) yield* L(i, f, l + 1); else if (g(n)) for (var u of t.filterSubdirNames(n)) yield* L(i, u, l + 1); else if (S(n)) for (var o of n) yield* r(i, o, t, l); else {
+        } else if ("*" == n) for (var f of t.subdirList) yield* L(i, f, l + 1); else if (g(n)) for (var u of t.filterSubdirNames(n)) yield* L(i, u, l + 1); else if (v(n)) for (var o of n) yield* r(i, o, t, l); else {
             let e = n.$or || n.$in;
-            if (S(e)) for (var a of e) yield* r(i, a, t, l); else if (H(n)) for (var s of R(t, n)) yield* L(i, s, l + 1); else {
+            if (v(e)) for (var a of e) yield* r(i, a, t, l); else if (H(n)) for (var s of R(t, n)) yield* L(i, s, l + 1); else {
                 let e = t.getSubdir(n);
                 e && (yield* L(i, e, l + 1));
             }
@@ -93,7 +94,7 @@ function O(r, i, n, t, l) {
             if (!i) return;
             for (o of function i(n, e) {
                 if (null == e) return $;
-                if (d(e)) return new m(n.getSubdir(e));
+                if (d(e)) return new y(n.getSubdir(e));
                 if (g(e)) return j(n.filterSubdirNames(e));
                 if (H(e)) return j(R(n, e));
                 let {
@@ -101,21 +102,21 @@ function O(r, i, n, t, l) {
                     $spec: l
                 } = e;
                 if (null != t) {
-                    let e = new m(), {
+                    let e = new y(), {
                         qyCache: r,
                         subdirList: i
                     } = n;
                     for (var f of i) D(r, t, f.name, l) && e.addDir(f);
                     return e;
                 }
-                let u = new y();
-                if (S(e)) for (var r of e) u.addNode(i(n, r)); else for (var o in e) {
+                let u = new b();
+                if (v(e)) for (var r of e) u.addNode(i(n, r)); else for (var o in e) {
                     let r = e[o];
-                    if (o == h) if (S(r)) {
-                        let e = new m();
+                    if (o == h) if (v(r)) {
+                        let e = new y();
                         for (var a of r) e.addNode(i(n, a));
                         u.addNode(e);
-                    } else u.addNode(i(n, r)); else if (o == N) if (S(r)) for (var s of r) u.addNode(i(n, s)); else u.addNode(i(n, r)); else {
+                    } else u.addNode(i(n, r)); else if (o == N) if (v(r)) for (var s of r) u.addNode(i(n, s)); else u.addNode(i(n, r)); else {
                         let e = n.getSubdir(o);
                         if (null == e) return $;
                         u.addNode(i(e, r));
@@ -124,7 +125,7 @@ function O(r, i, n, t, l) {
                 return u;
             }(i, n).getFiles(l)) t.push(r.getFile(o)), ++e;
         }
-        b.info(`Checking ${f} file${p(f)}, result: ${e} file` + p(e));
+        S.info(`Checking ${f} file${p(f)}, result: ${e} file` + p(e));
     }
 }
 
@@ -135,7 +136,7 @@ function u(e) {
 
 function j(e) {
     if (0 == e.length) return $;
-    var r, i = new m();
+    var r, i = new y();
     for (r of e) i.addDir(r);
     return i;
 }
@@ -177,10 +178,10 @@ function D(e, r, i, n) {
     var r = e.getDir(r);
     return !!r && !!(r = r.getFile(i)) && (null == n || function r(i, n, t) {
         if (null == n) return !1;
-        if (d(t)) return S(n) ? n.includes(t) : c(n) ? n[t] : n == t;
+        if (d(t)) return v(n) ? n.includes(t) : c(n) ? n[t] : n == t;
         if (g(t)) return t(n);
-        if (S(t)) {
-            if (!S(n)) return !1;
+        if (v(t)) {
+            if (!v(n)) return !1;
             for (let e = 0; e < t.length; ++e) if (!r(i, n[e], t[e])) return !1;
         } else {
             var e, {
@@ -189,12 +190,12 @@ function D(e, r, i, n) {
             } = t;
             if (l) {
                 if (d(n)) return D(i, l, n, f);
-                if (S(n)) {
+                if (v(n)) {
                     for (var u of n) if (D(i, l, u, f)) return !0;
                 } else for (var o in n) if (D(i, l, o, f)) return !0;
                 return !1;
             }
-            if (d(n) || S(n)) return !1;
+            if (d(n) || v(n)) return !1;
             for (e in t) if (!r(i, n[e], t[e])) return !1;
         }
         return !0;
@@ -203,7 +204,7 @@ function D(e, r, i, n) {
 
 function Q(e, r, i = [], n = [], t = 0) {
     if (null != e) if (u(e = c(e) && r ? Object.values(e) : e)) n[t] = e, n.length = t + 1, 
-    i.push([ ...n ]); else if (S(e)) {
+    i.push([ ...n ]); else if (v(e)) {
         n.length = t + 1;
         for (var l of e.filter(e => u(e))) n[t] = l, i.push([ ...n ]);
     } else if (c(e)) for (var f in e) n[t] = f, n.length = t + 1, Q(e[f], !1, i, n, t + 1);

package/src/QyIndexPropTree.js

@@ -1,4 +1,6 @@
-let t = Array.isArray;
+import {
+    isArray as t
+} from "./QyUtils.js";
 
 class o {
     name;