datafolder 1.0.17 → 1.0.18

package/src/QyFileContentUtils.js

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

package/src/QyHNSW.d.ts

@@ -0,0 +1,10 @@
+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;
+}

package/src/QyHNSW.js

@@ -0,0 +1,57 @@
+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;
+                }
+            }
+            return e;
+        }
+    }
+}
+
+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;
+    }
+}
+
+export {
+    t as QyHNSW
+};

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;