datafolder 1.0.12 → 1.0.13
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +6 -2
- package/package.json +1 -1
- package/scripts/airbnb.js +1 -1
- package/scripts/airbnb2.js +1 -1
- package/scripts/flights.js +2 -2
- package/scripts/flights2.js +2 -2
- package/src/QyBatch.d.ts +13 -6
- package/src/QyBatch.js +209 -126
- package/src/QyCache.d.ts +6 -3
- package/src/QyCache.js +86 -68
- package/src/QyDB.d.ts +3 -0
- package/src/QyDB.js +36 -21
- package/src/QyDefaultOptions.js +0 -3
- package/src/QyDir.d.ts +1 -0
- package/src/QyDir.js +49 -20
- package/src/QyExpire.d.ts +9 -15
- package/src/QyExpire.js +60 -68
- package/src/QyExpireInfo.d.ts +10 -0
- package/src/QyExpireInfo.js +92 -0
- package/src/QyExpire_Worker.d.ts +13 -14
- package/src/QyExpire_Worker.js +74 -89
- package/src/QyFile.d.ts +1 -1
- package/src/QyFile.js +58 -43
- package/src/QyFileContentUtils.d.ts +1 -0
- package/src/QyFileContentUtils.js +107 -93
- package/src/QyItem.d.ts +6 -0
- package/src/QyItem.js +25 -7
- package/src/QyKVData.d.ts +3 -1
- package/src/QyKVData.js +70 -63
- package/src/QyUtils.d.ts +3 -1
- package/src/QyUtils.js +41 -34
- package/static/codemirror.bundle/editor.bundle.js +6 -1
- package/src/QyExpireClock.d.ts +0 -15
- package/src/QyExpireClock.js +0 -53
- package/src/rpc/evalCode.js +0 -9
- package/src/rpc/getFileContent.js +0 -16
- package/src/rpc/getRpcFiles.js +0 -1
- package/src/rpc/getSubItems.js +0 -16
- package/src/rpc/getTriggerFiles.js +0 -1
- package/src/rpc/queryFiles.js +0 -10
- package/src/rpc/reloadRpc.js +0 -1
package/src/QyFile.js
CHANGED
|
@@ -7,25 +7,25 @@ import {
|
|
|
7
7
|
SpecialFilePaths as n,
|
|
8
8
|
getContentKey as i,
|
|
9
9
|
isNotNullObj as a,
|
|
10
|
-
isSimpleType as
|
|
11
|
-
fromSingleName as
|
|
12
|
-
isEmptyObj as
|
|
10
|
+
isSimpleType as h,
|
|
11
|
+
fromSingleName as s,
|
|
12
|
+
isEmptyObj as r,
|
|
13
|
+
getNowTime as l
|
|
13
14
|
} from "./QyUtils.js";
|
|
14
15
|
|
|
15
16
|
import {
|
|
16
|
-
getValByNamePath as
|
|
17
|
+
getValByNamePath as o
|
|
17
18
|
} from "./QyFileContentUtils.js";
|
|
18
19
|
|
|
19
20
|
import {
|
|
20
|
-
QyIndexPropTree as
|
|
21
|
+
QyIndexPropTree as f
|
|
21
22
|
} from "./QyIndexPropTree.js";
|
|
22
23
|
|
|
23
24
|
import {
|
|
24
|
-
analyzeExpireInfo as f,
|
|
25
25
|
handleExpiredProps as u
|
|
26
26
|
} from "./QyExpire.js";
|
|
27
27
|
|
|
28
|
-
let
|
|
28
|
+
let d = Array.isArray, C = n.IndexPropPathsFileName, {
|
|
29
29
|
$spec: p,
|
|
30
30
|
$raw: c,
|
|
31
31
|
$clone: y
|
|
@@ -50,15 +50,7 @@ class m extends e {
|
|
|
50
50
|
return this._fileContentKey || (this._fileContentKey = i(this.fullPathHash));
|
|
51
51
|
}
|
|
52
52
|
get fileContent() {
|
|
53
|
-
|
|
54
|
-
return r.created && null == r._fileContent && !r.fileContentLoaded && (r.fileContentLoaded = !0,
|
|
55
|
-
e = r.qyCache) && (r._fileContent = e.qyKVData.getValueSync(r.fileContentKey),
|
|
56
|
-
!r.underHiddenFolder && (r = r, i = (e = e).getExpireInfoFile(r.fullPathHash)) && ({
|
|
57
|
-
expiredProps: i,
|
|
58
|
-
remainingExpireInfoObj: t,
|
|
59
|
-
toDeleteFile: n
|
|
60
|
-
} = f(i.fileContent), u(e.qyDB, r, i, n), l(t) || e.monitorContentExpire(r, t))),
|
|
61
|
-
this.visited = !0, this._fileContent;
|
|
53
|
+
return this.ensureLoaded(), this.visited = !0, this._fileContent;
|
|
62
54
|
}
|
|
63
55
|
set fileContent(e) {
|
|
64
56
|
this.visited = !0, this._fileContent = e;
|
|
@@ -70,12 +62,12 @@ class m extends e {
|
|
|
70
62
|
fileContent: n,
|
|
71
63
|
underHiddenFolder: i
|
|
72
64
|
} = this;
|
|
73
|
-
if (e && i && t ==
|
|
65
|
+
if (e && i && t == C) {
|
|
74
66
|
e = this._qyIndexPropTree;
|
|
75
67
|
if (e) return e;
|
|
76
|
-
var r,
|
|
77
|
-
for (r in n)
|
|
78
|
-
return
|
|
68
|
+
var r, o = this._qyIndexPropTree = new f();
|
|
69
|
+
for (r in n) o.insert(s(r));
|
|
70
|
+
return o;
|
|
79
71
|
}
|
|
80
72
|
}
|
|
81
73
|
get isFile() {
|
|
@@ -88,42 +80,65 @@ class m extends e {
|
|
|
88
80
|
get clonedContent() {
|
|
89
81
|
return structuredClone(this.fileContent);
|
|
90
82
|
}
|
|
91
|
-
setContent(e) {
|
|
92
|
-
this.fileContent = e;
|
|
93
|
-
}
|
|
94
83
|
view(e = y, t) {
|
|
95
84
|
var n = this.fileContent;
|
|
96
|
-
return null == n ||
|
|
85
|
+
return null == n || h(n) ? n : function t(n, i, r, o) {
|
|
97
86
|
if (r === c) return i;
|
|
98
87
|
if (null == r) return;
|
|
99
|
-
if (
|
|
88
|
+
if (h(r)) return r ? o ? i : structuredClone(i) : void 0;
|
|
100
89
|
let e = r.$link;
|
|
101
|
-
if (null != e) return
|
|
102
|
-
if (
|
|
103
|
-
|
|
104
|
-
let
|
|
90
|
+
if (null != e) return v(n, i, e, r[p]);
|
|
91
|
+
if (h(i)) return i;
|
|
92
|
+
d(r) && (r = Object.fromEntries(r.filter(e => e).map(e => [ e, 1 ])));
|
|
93
|
+
let s = d(i) ? [] : {};
|
|
105
94
|
let {
|
|
106
|
-
$all:
|
|
95
|
+
$all: l,
|
|
107
96
|
"**": a
|
|
108
97
|
} = r;
|
|
109
|
-
if (
|
|
110
|
-
let e = r[f] ??
|
|
111
|
-
e && (
|
|
98
|
+
if (l || a) for (var f in i) {
|
|
99
|
+
let e = r[f] ?? l ?? a;
|
|
100
|
+
e && (s[f] = t(n, i[f], e, o));
|
|
112
101
|
} else for (var u in r) {
|
|
113
102
|
let e = r[u];
|
|
114
|
-
e && (
|
|
103
|
+
e && (s[u] = t(n, i[u], e, o));
|
|
115
104
|
}
|
|
116
|
-
return
|
|
105
|
+
return s;
|
|
117
106
|
}(this, n, e, t);
|
|
118
107
|
}
|
|
119
108
|
prop(e, t = y, n) {
|
|
120
109
|
var i;
|
|
121
|
-
if (t) return e =
|
|
110
|
+
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);
|
|
122
111
|
}
|
|
123
112
|
unloadFileContent() {
|
|
124
113
|
this.created && this.fileContentLoaded && null != this._fileContent && (this._fileContent = void 0,
|
|
125
114
|
this.fileContentLoaded = !1);
|
|
126
115
|
}
|
|
116
|
+
ensureLoaded() {
|
|
117
|
+
if (this.created && null == this._fileContent && !this.fileContentLoaded) {
|
|
118
|
+
this.fileContentLoaded = !0;
|
|
119
|
+
var e = this.qyCache;
|
|
120
|
+
if (!e) return;
|
|
121
|
+
if (this._fileContent = e.qyKVData.getValueSync(this.fileContentKey),
|
|
122
|
+
!this.underHiddenFolder) {
|
|
123
|
+
var t, n, i = this;
|
|
124
|
+
!i.cExpireChecked && (i.cExpireChecked = !0, t = e.getExpireInfoFile(i.fullPathHash, "c")) && ({
|
|
125
|
+
expiredProps: t,
|
|
126
|
+
remainingExpireInfoObj: n
|
|
127
|
+
} = ((e, t = l()) => {
|
|
128
|
+
let n, i = {};
|
|
129
|
+
for (var r in e) {
|
|
130
|
+
var o = e[r];
|
|
131
|
+
o <= t ? n ? n.push(r) : n = [ r ] : i[r] = o;
|
|
132
|
+
}
|
|
133
|
+
return {
|
|
134
|
+
expiredProps: n,
|
|
135
|
+
remainingExpireInfoObj: i
|
|
136
|
+
};
|
|
137
|
+
})(t.fileContent), t && u(e.qyDB, i, t), r(n) || e.monitorContentExpire(i, n));
|
|
138
|
+
}
|
|
139
|
+
}
|
|
140
|
+
return this;
|
|
141
|
+
}
|
|
127
142
|
}
|
|
128
143
|
|
|
129
144
|
function g(e, t, n, i) {
|
|
@@ -134,15 +149,15 @@ function g(e, t, n, i) {
|
|
|
134
149
|
return t;
|
|
135
150
|
}
|
|
136
151
|
|
|
137
|
-
function
|
|
138
|
-
let
|
|
139
|
-
if (
|
|
152
|
+
function v(e, t, n, i, r = !1) {
|
|
153
|
+
let o = e.qyCache.getDir(n);
|
|
154
|
+
if (d(t)) return t.map(e => g(o, e, i, r));
|
|
140
155
|
if (a(t)) {
|
|
141
|
-
var
|
|
142
|
-
for (
|
|
143
|
-
return
|
|
156
|
+
var s, l = {};
|
|
157
|
+
for (s in t) l[s] = g(o, s, i, r);
|
|
158
|
+
return l;
|
|
144
159
|
}
|
|
145
|
-
return g(
|
|
160
|
+
return g(o, t, i, r);
|
|
146
161
|
}
|
|
147
162
|
|
|
148
163
|
export {
|
|
@@ -6,5 +6,6 @@ export declare function mergeContentAndGenDelta(oldContent: any, newContent: any
|
|
|
6
6
|
};
|
|
7
7
|
export declare function setValByNamePath(rootObj: any, namePath: any, value: any): any;
|
|
8
8
|
export declare function getValByNamePath(obj: any, namePath: any): any;
|
|
9
|
+
export declare function delValByNamePath(obj: any, propPath: any, keepEmptyObj?: boolean, idx?: number): any;
|
|
9
10
|
export declare function cleanContent(obj: any, shouldCleanMark?: boolean, strict?: boolean): any;
|
|
10
11
|
export declare function objToDelMarks(obj: any): any;
|
|
@@ -2,171 +2,185 @@ import {
|
|
|
2
2
|
isNotNullObj as a,
|
|
3
3
|
trimArrayTail as g,
|
|
4
4
|
isSimpleType as h,
|
|
5
|
-
SpecialOperators as r
|
|
5
|
+
SpecialOperators as r,
|
|
6
|
+
isEmptyObj as i
|
|
6
7
|
} from "./QyUtils.js";
|
|
7
8
|
|
|
8
9
|
let p = Array.isArray, {
|
|
9
|
-
$del:
|
|
10
|
-
$rpl:
|
|
10
|
+
$del: m,
|
|
11
|
+
$rpl: w,
|
|
11
12
|
$ext: y
|
|
12
13
|
} = r;
|
|
13
14
|
|
|
14
|
-
function
|
|
15
|
+
function f(r, n) {
|
|
15
16
|
if (null == n) return r;
|
|
16
|
-
if (n !==
|
|
17
|
+
if (n !== m) {
|
|
17
18
|
if (h(n)) return n;
|
|
18
|
-
var
|
|
19
|
-
if (null !=
|
|
19
|
+
var e = n[w];
|
|
20
|
+
if (null != e) return e;
|
|
20
21
|
if (null == r || h(r)) return n;
|
|
21
22
|
if (r != n) {
|
|
22
|
-
var
|
|
23
|
-
for (
|
|
24
|
-
var
|
|
25
|
-
null ==
|
|
23
|
+
var l, t = p(r);
|
|
24
|
+
for (l in n) {
|
|
25
|
+
var u = f(r[l], n[l]);
|
|
26
|
+
null == u ? (delete r[l], t && g(r)) : r[l] = u;
|
|
26
27
|
}
|
|
27
28
|
}
|
|
28
29
|
return r;
|
|
29
30
|
}
|
|
30
31
|
}
|
|
31
32
|
|
|
32
|
-
function
|
|
33
|
-
if (n ==
|
|
34
|
-
if (null != n[
|
|
35
|
-
var
|
|
36
|
-
if (null !=
|
|
37
|
-
if (r ==
|
|
38
|
-
[
|
|
33
|
+
function o(r, n) {
|
|
34
|
+
if (n == m) return m;
|
|
35
|
+
if (null != n[w]) return n;
|
|
36
|
+
var e = r[w];
|
|
37
|
+
if (null != e) r[w] = f(e, n); else {
|
|
38
|
+
if (r == m) return {
|
|
39
|
+
[w]: O(n)
|
|
39
40
|
};
|
|
40
41
|
if (h(r) || h(n)) return n;
|
|
41
|
-
for (var
|
|
42
|
-
var
|
|
43
|
-
r[
|
|
42
|
+
for (var l in n) {
|
|
43
|
+
var t = n[l], u = r[l];
|
|
44
|
+
r[l] = null == u ? t : o(u, t);
|
|
44
45
|
}
|
|
45
46
|
}
|
|
46
47
|
return r;
|
|
47
48
|
}
|
|
48
49
|
|
|
49
50
|
function n(r, n) {
|
|
50
|
-
let
|
|
51
|
+
let e = {
|
|
51
52
|
oldValue: {},
|
|
52
53
|
newValue: {}
|
|
53
54
|
};
|
|
54
|
-
r =
|
|
55
|
-
return
|
|
55
|
+
r = S(r, n, [], 0, e);
|
|
56
|
+
return e.oldValue = O(e.oldValue, !0, !0), e.newValue = O(e.newValue, !1, !1),
|
|
56
57
|
{
|
|
57
58
|
merged: r,
|
|
58
|
-
delta:
|
|
59
|
+
delta: e = e.oldValue || e.newValue ? e : void 0
|
|
59
60
|
};
|
|
60
61
|
}
|
|
61
62
|
|
|
62
|
-
function
|
|
63
|
-
if (!n || 0 == n.length) return
|
|
64
|
-
let
|
|
63
|
+
function t(r, n, e) {
|
|
64
|
+
if (!n || 0 == n.length) return e;
|
|
65
|
+
let l = r;
|
|
65
66
|
for (let r = 0; r < n.length - 1; ++r) {
|
|
66
|
-
var
|
|
67
|
-
a(
|
|
67
|
+
var t = n[r];
|
|
68
|
+
a(l[t]) || (l[t] = {}), l = l[t];
|
|
68
69
|
}
|
|
69
|
-
var
|
|
70
|
-
return void 0 ===
|
|
70
|
+
var u = n.at(-1);
|
|
71
|
+
return void 0 === e ? delete l[u] : l[u] = e, r;
|
|
71
72
|
}
|
|
72
73
|
|
|
73
|
-
function
|
|
74
|
-
if (null != n && null != (r =
|
|
75
|
-
if (!p(n)) return "" == n ? r :
|
|
76
|
-
if (0 != n.length && (1 != n.length || "" != n[0])) for (var
|
|
74
|
+
function e(r, n) {
|
|
75
|
+
if (null != n && null != (r = u(r))) {
|
|
76
|
+
if (!p(n)) return "" == n ? r : u(r[n]);
|
|
77
|
+
if (0 != n.length && (1 != n.length || "" != n[0])) for (var e of n) if (null == (r = u(r[e]))) return;
|
|
77
78
|
return r;
|
|
78
79
|
}
|
|
79
80
|
}
|
|
80
81
|
|
|
81
|
-
function
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
82
|
+
function v(r, n, e = !1, l = 0) {
|
|
83
|
+
var t = n[l];
|
|
84
|
+
if (l == n.length - 1) return delete r[t], !e && i(r) ? void 0 : r;
|
|
85
|
+
var u = r[t];
|
|
86
|
+
if (a(u)) {
|
|
87
|
+
u = v(u, n, e, l + 1);
|
|
88
|
+
if (null == u && !e) return delete r[t], i(r) ? void 0 : r;
|
|
89
|
+
r[t] = u;
|
|
90
|
+
}
|
|
91
|
+
return r;
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
function O(r, n = !0, e = !1) {
|
|
95
|
+
return function e(l, t, u) {
|
|
96
|
+
if (l instanceof Date) return l.toISOString();
|
|
97
|
+
if (!a(l)) return (u ? void 0 === l : null == l) || t && l === m ? void 0 : l;
|
|
98
|
+
if (t) {
|
|
99
|
+
let r = l[w];
|
|
100
|
+
if (null != r) return e(r, t, u);
|
|
101
|
+
let n = l[y];
|
|
102
|
+
if (null != n) return e(p(n) ? n : [ n ], t, u);
|
|
90
103
|
}
|
|
91
|
-
let n = p(
|
|
104
|
+
let n = p(l);
|
|
92
105
|
let i = !0;
|
|
93
|
-
for (var f in
|
|
94
|
-
let r = l
|
|
95
|
-
(
|
|
106
|
+
for (var f in l) {
|
|
107
|
+
let r = e(l[f], t, u);
|
|
108
|
+
(u ? void 0 === r : null == r) ? (delete l[f], n && g(l)) : (l[f] = r,
|
|
96
109
|
i = !1);
|
|
97
110
|
}
|
|
98
|
-
return i ? void 0 :
|
|
99
|
-
}(r, n,
|
|
111
|
+
return i ? void 0 : l;
|
|
112
|
+
}(r, n, e);
|
|
100
113
|
}
|
|
101
114
|
|
|
102
|
-
function
|
|
103
|
-
if (h(r)) return r ?
|
|
115
|
+
function l(r) {
|
|
116
|
+
if (h(r)) return r ? m : void 0;
|
|
104
117
|
for (var n in r) {
|
|
105
|
-
var
|
|
106
|
-
|
|
118
|
+
var e = l(r[n]);
|
|
119
|
+
e ? r[n] = e : delete r[n];
|
|
107
120
|
}
|
|
108
121
|
return p(r) && g(r), r;
|
|
109
122
|
}
|
|
110
123
|
|
|
111
|
-
function
|
|
112
|
-
if (null ==
|
|
113
|
-
if (
|
|
114
|
-
if (null == n || h(n) || h(
|
|
115
|
-
var i =
|
|
116
|
-
if (null != i) return
|
|
117
|
-
let r =
|
|
118
|
-
if (null != r) return p(r) || (r = [ r ]), (p(n) ? (n,
|
|
119
|
-
|
|
120
|
-
var
|
|
121
|
-
for (let r = 0; r <
|
|
122
|
-
var
|
|
123
|
-
null !=
|
|
124
|
-
[
|
|
124
|
+
function S(n, e, l, t, u) {
|
|
125
|
+
if (null == e) return n;
|
|
126
|
+
if (e !== m) {
|
|
127
|
+
if (null == n || h(n) || h(e)) return j(n, e, l, u);
|
|
128
|
+
var i = e[w];
|
|
129
|
+
if (null != i) return j(n, i, l, u);
|
|
130
|
+
let r = e[y];
|
|
131
|
+
if (null != r) return p(r) || (r = [ r ]), (p(n) ? (n, e, r, l) => {
|
|
132
|
+
e = O(e);
|
|
133
|
+
var t = {};
|
|
134
|
+
for (let r = 0; r < e.length; ++r) {
|
|
135
|
+
var u = e[r];
|
|
136
|
+
null != u && (t[r + n.length] = h(u) ? u : {
|
|
137
|
+
[w]: u
|
|
125
138
|
});
|
|
126
139
|
}
|
|
127
|
-
return
|
|
128
|
-
} :
|
|
129
|
-
if (p(n) && !p(
|
|
130
|
-
var f = n, a =
|
|
140
|
+
return A(l, r, n, t), n.concat(e);
|
|
141
|
+
} : j)(n, r, l, u);
|
|
142
|
+
if (p(n) && !p(e) || !p(n) && p(e)) return j(n, e, l, u);
|
|
143
|
+
var f = n, a = e, o = l, v = t, d = u;
|
|
131
144
|
if (f != a) {
|
|
132
145
|
var c, s = p(f);
|
|
133
146
|
for (c in a) {
|
|
134
147
|
o[v] = c, o.length = v + 1;
|
|
135
|
-
var V =
|
|
148
|
+
var V = S(f[c], a[c], o, v + 1, d);
|
|
136
149
|
null == V ? (delete f[c], s && g(f)) : f[c] = V;
|
|
137
150
|
}
|
|
138
151
|
}
|
|
139
152
|
return f;
|
|
140
153
|
}
|
|
141
|
-
null != n &&
|
|
154
|
+
null != n && A(u, l, n, m);
|
|
142
155
|
}
|
|
143
156
|
|
|
144
|
-
function
|
|
145
|
-
n =
|
|
146
|
-
return r === n ? r : null != n ? (null == r ?
|
|
147
|
-
[
|
|
148
|
-
}) :
|
|
149
|
-
[
|
|
150
|
-
}), n) : void
|
|
157
|
+
function j(r, n, e, l) {
|
|
158
|
+
n = O(n);
|
|
159
|
+
return r === n ? r : null != n ? (null == r ? A(l, e, 0 == e.length ? void 0 : null, h(n) ? n : {
|
|
160
|
+
[w]: n
|
|
161
|
+
}) : A(l, e, r, h(r) ? n : {
|
|
162
|
+
[w]: n
|
|
163
|
+
}), n) : void A(l, e, r, m);
|
|
151
164
|
}
|
|
152
165
|
|
|
153
|
-
function
|
|
154
|
-
r.oldValue =
|
|
166
|
+
function A(r, n, e, l) {
|
|
167
|
+
r.oldValue = t(r.oldValue, n, e), r.newValue = t(r.newValue, n, l);
|
|
155
168
|
}
|
|
156
169
|
|
|
157
|
-
function
|
|
158
|
-
if (null != r && r !=
|
|
159
|
-
for (;null != r[
|
|
170
|
+
function u(r) {
|
|
171
|
+
if (null != r && r != m) {
|
|
172
|
+
for (;null != r[w]; ) if ((r = r[w]) == m) return;
|
|
160
173
|
return r;
|
|
161
174
|
}
|
|
162
175
|
}
|
|
163
176
|
|
|
164
177
|
export {
|
|
165
|
-
|
|
166
|
-
|
|
178
|
+
f as mergeContent,
|
|
179
|
+
o as mergeContentChanges,
|
|
167
180
|
n as mergeContentAndGenDelta,
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
181
|
+
t as setValByNamePath,
|
|
182
|
+
e as getValByNamePath,
|
|
183
|
+
v as delValByNamePath,
|
|
184
|
+
O as cleanContent,
|
|
185
|
+
l as objToDelMarks
|
|
172
186
|
};
|
package/src/QyItem.d.ts
CHANGED
|
@@ -14,6 +14,12 @@ export declare class QyItem {
|
|
|
14
14
|
set fileMapLoaded(val: boolean);
|
|
15
15
|
get fileContentLoaded(): boolean;
|
|
16
16
|
set fileContentLoaded(val: boolean);
|
|
17
|
+
get dExpireChecked(): boolean;
|
|
18
|
+
set dExpireChecked(val: boolean);
|
|
19
|
+
get fExpireChecked(): boolean;
|
|
20
|
+
set fExpireChecked(val: boolean);
|
|
21
|
+
get cExpireChecked(): boolean;
|
|
22
|
+
set cExpireChecked(val: boolean);
|
|
17
23
|
get visited(): boolean;
|
|
18
24
|
set visited(val: boolean);
|
|
19
25
|
get nameNum(): number | string;
|
package/src/QyItem.js
CHANGED
|
@@ -11,7 +11,7 @@ class e {
|
|
|
11
11
|
flagInt;
|
|
12
12
|
constructor(t, e = !1, a) {
|
|
13
13
|
this.name = t.toString(), this.parentDir = a, this.flagInt = 0, this._created = e,
|
|
14
|
-
a && (a.name == r || a.underHiddenFolder) && (this.flagInt |= 2);
|
|
14
|
+
(t == r || a && (a.name == r || a.underHiddenFolder)) && (this.flagInt |= 2);
|
|
15
15
|
}
|
|
16
16
|
get qyCache() {
|
|
17
17
|
var t = this.parentDir;
|
|
@@ -21,31 +21,49 @@ class e {
|
|
|
21
21
|
return i(this, 1);
|
|
22
22
|
}
|
|
23
23
|
set _created(t) {
|
|
24
|
-
|
|
24
|
+
s(this, 1, t);
|
|
25
25
|
}
|
|
26
26
|
get subdirMapLoaded() {
|
|
27
27
|
return i(this, 4);
|
|
28
28
|
}
|
|
29
29
|
set subdirMapLoaded(t) {
|
|
30
|
-
|
|
30
|
+
s(this, 4, t);
|
|
31
31
|
}
|
|
32
32
|
get fileMapLoaded() {
|
|
33
33
|
return i(this, 8);
|
|
34
34
|
}
|
|
35
35
|
set fileMapLoaded(t) {
|
|
36
|
-
|
|
36
|
+
s(this, 8, t);
|
|
37
37
|
}
|
|
38
38
|
get fileContentLoaded() {
|
|
39
39
|
return i(this, 16);
|
|
40
40
|
}
|
|
41
41
|
set fileContentLoaded(t) {
|
|
42
|
-
|
|
42
|
+
s(this, 16, t);
|
|
43
|
+
}
|
|
44
|
+
get dExpireChecked() {
|
|
45
|
+
return i(this, 64);
|
|
46
|
+
}
|
|
47
|
+
set dExpireChecked(t) {
|
|
48
|
+
s(this, 64, t);
|
|
49
|
+
}
|
|
50
|
+
get fExpireChecked() {
|
|
51
|
+
return i(this, 128);
|
|
52
|
+
}
|
|
53
|
+
set fExpireChecked(t) {
|
|
54
|
+
s(this, 128, t);
|
|
55
|
+
}
|
|
56
|
+
get cExpireChecked() {
|
|
57
|
+
return i(this, 256);
|
|
58
|
+
}
|
|
59
|
+
set cExpireChecked(t) {
|
|
60
|
+
s(this, 256, t);
|
|
43
61
|
}
|
|
44
62
|
get visited() {
|
|
45
63
|
return i(this, 32);
|
|
46
64
|
}
|
|
47
65
|
set visited(t) {
|
|
48
|
-
|
|
66
|
+
s(this, 32, t);
|
|
49
67
|
}
|
|
50
68
|
get nameNum() {
|
|
51
69
|
var t = this._nameNum;
|
|
@@ -108,7 +126,7 @@ function i(t, e) {
|
|
|
108
126
|
return 0 != (t.flagInt & e);
|
|
109
127
|
}
|
|
110
128
|
|
|
111
|
-
function
|
|
129
|
+
function s(t, e, a) {
|
|
112
130
|
a ? t.flagInt |= e : t.flagInt &= ~e;
|
|
113
131
|
}
|
|
114
132
|
|
package/src/QyKVData.d.ts
CHANGED
|
@@ -27,6 +27,8 @@ export declare class QyKVData {
|
|
|
27
27
|
removeKey(key: any): any;
|
|
28
28
|
onSnapshotSavedChangeId(snapshotSavedChangeId: any, pMOnlySnapshot?: any): void;
|
|
29
29
|
onCompactUpdates(compactUpdates: any): void;
|
|
30
|
-
monitorContentExpire(file: any,
|
|
30
|
+
monitorContentExpire(file: any, flattedAbsTimeObj: any): void;
|
|
31
31
|
unmonitorContentExpire(file: any, flattedDelObj: any): void;
|
|
32
|
+
monitorItemExpire(item: any, expireTime: any): void;
|
|
33
|
+
unmonitorItemExpire(item: any): void;
|
|
32
34
|
}
|