@tachybase/module-cloud-component 0.23.22 → 0.23.35
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/dist/client/index.js +1 -1
- package/dist/externalVersion.js +7 -7
- package/dist/node_modules/@babel/core/lib/index.js +76 -76
- package/dist/node_modules/@babel/core/node_modules/.bin/parser +4 -4
- package/dist/node_modules/@babel/core/package.json +1 -1
- package/dist/node_modules/@babel/parser/LICENSE +19 -0
- package/dist/node_modules/@babel/parser/bin/babel-parser.js +15 -0
- package/dist/node_modules/@babel/parser/index.cjs +5 -0
- package/dist/node_modules/@babel/parser/lib/index.js +1 -0
- package/dist/node_modules/@babel/parser/package.json +1 -0
- package/dist/node_modules/@babel/parser/typings/babel-parser.d.ts +267 -0
- package/dist/node_modules/@babel/traverse/LICENSE +22 -0
- package/dist/node_modules/@babel/traverse/lib/cache.js +44 -0
- package/dist/node_modules/@babel/traverse/lib/context.js +119 -0
- package/dist/node_modules/@babel/traverse/lib/hub.js +19 -0
- package/dist/node_modules/@babel/traverse/lib/index.js +13 -0
- package/dist/node_modules/@babel/traverse/lib/path/ancestry.js +141 -0
- package/dist/node_modules/@babel/traverse/lib/path/comments.js +52 -0
- package/dist/node_modules/@babel/traverse/lib/path/context.js +242 -0
- package/dist/node_modules/@babel/traverse/lib/path/conversion.js +609 -0
- package/dist/node_modules/@babel/traverse/lib/path/evaluation.js +347 -0
- package/dist/node_modules/@babel/traverse/lib/path/family.js +340 -0
- package/dist/node_modules/@babel/traverse/lib/path/index.js +292 -0
- package/dist/node_modules/@babel/traverse/lib/path/inference/index.js +149 -0
- package/dist/node_modules/@babel/traverse/lib/path/inference/inferer-reference.js +151 -0
- package/dist/node_modules/@babel/traverse/lib/path/inference/inferers.js +207 -0
- package/dist/node_modules/@babel/traverse/lib/path/inference/util.js +30 -0
- package/dist/node_modules/@babel/traverse/lib/path/introspection.js +398 -0
- package/dist/node_modules/@babel/traverse/lib/path/lib/hoister.js +171 -0
- package/dist/node_modules/@babel/traverse/lib/path/lib/removal-hooks.js +37 -0
- package/dist/node_modules/@babel/traverse/lib/path/lib/virtual-types-validator.js +163 -0
- package/dist/node_modules/@babel/traverse/lib/path/lib/virtual-types.js +26 -0
- package/dist/node_modules/@babel/traverse/lib/path/modification.js +229 -0
- package/dist/node_modules/@babel/traverse/lib/path/removal.js +69 -0
- package/dist/node_modules/@babel/traverse/lib/path/replacement.js +263 -0
- package/dist/node_modules/@babel/traverse/lib/scope/binding.js +83 -0
- package/dist/node_modules/@babel/traverse/lib/scope/index.js +981 -0
- package/dist/node_modules/@babel/traverse/lib/scope/lib/renamer.js +131 -0
- package/dist/node_modules/@babel/traverse/lib/traverse-node.js +29 -0
- package/dist/node_modules/@babel/traverse/lib/types.js +3 -0
- package/dist/node_modules/@babel/traverse/lib/visitors.js +258 -0
- package/dist/node_modules/@babel/traverse/node_modules/.bin/parser +17 -0
- package/dist/node_modules/@babel/traverse/package.json +1 -0
- package/dist/node_modules/@hapi/topo/lib/index.d.ts +60 -0
- package/dist/node_modules/@hapi/topo/lib/index.js +1 -0
- package/dist/node_modules/@hapi/topo/package.json +1 -0
- package/dist/server/services/cloud-libraries-service.js +36 -1
- package/package.json +13 -9
|
@@ -0,0 +1,141 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
Object.defineProperty(exports, "__esModule", {
|
|
4
|
+
value: true
|
|
5
|
+
});
|
|
6
|
+
exports.find = find;
|
|
7
|
+
exports.findParent = findParent;
|
|
8
|
+
exports.getAncestry = getAncestry;
|
|
9
|
+
exports.getDeepestCommonAncestorFrom = getDeepestCommonAncestorFrom;
|
|
10
|
+
exports.getEarliestCommonAncestorFrom = getEarliestCommonAncestorFrom;
|
|
11
|
+
exports.getFunctionParent = getFunctionParent;
|
|
12
|
+
exports.getStatementParent = getStatementParent;
|
|
13
|
+
exports.inType = inType;
|
|
14
|
+
exports.isAncestor = isAncestor;
|
|
15
|
+
exports.isDescendant = isDescendant;
|
|
16
|
+
var _t = require("@babel/types");
|
|
17
|
+
const {
|
|
18
|
+
VISITOR_KEYS
|
|
19
|
+
} = _t;
|
|
20
|
+
function findParent(callback) {
|
|
21
|
+
let path = this;
|
|
22
|
+
while (path = path.parentPath) {
|
|
23
|
+
if (callback(path)) return path;
|
|
24
|
+
}
|
|
25
|
+
return null;
|
|
26
|
+
}
|
|
27
|
+
function find(callback) {
|
|
28
|
+
let path = this;
|
|
29
|
+
do {
|
|
30
|
+
if (callback(path)) return path;
|
|
31
|
+
} while (path = path.parentPath);
|
|
32
|
+
return null;
|
|
33
|
+
}
|
|
34
|
+
function getFunctionParent() {
|
|
35
|
+
return this.findParent(p => p.isFunction());
|
|
36
|
+
}
|
|
37
|
+
function getStatementParent() {
|
|
38
|
+
let path = this;
|
|
39
|
+
do {
|
|
40
|
+
if (!path.parentPath || Array.isArray(path.container) && path.isStatement()) {
|
|
41
|
+
break;
|
|
42
|
+
} else {
|
|
43
|
+
path = path.parentPath;
|
|
44
|
+
}
|
|
45
|
+
} while (path);
|
|
46
|
+
if (path && (path.isProgram() || path.isFile())) {
|
|
47
|
+
throw new Error("File/Program node, we can't possibly find a statement parent to this");
|
|
48
|
+
}
|
|
49
|
+
return path;
|
|
50
|
+
}
|
|
51
|
+
function getEarliestCommonAncestorFrom(paths) {
|
|
52
|
+
return this.getDeepestCommonAncestorFrom(paths, function (deepest, i, ancestries) {
|
|
53
|
+
let earliest;
|
|
54
|
+
const keys = VISITOR_KEYS[deepest.type];
|
|
55
|
+
for (const ancestry of ancestries) {
|
|
56
|
+
const path = ancestry[i + 1];
|
|
57
|
+
if (!earliest) {
|
|
58
|
+
earliest = path;
|
|
59
|
+
continue;
|
|
60
|
+
}
|
|
61
|
+
if (path.listKey && earliest.listKey === path.listKey) {
|
|
62
|
+
if (path.key < earliest.key) {
|
|
63
|
+
earliest = path;
|
|
64
|
+
continue;
|
|
65
|
+
}
|
|
66
|
+
}
|
|
67
|
+
const earliestKeyIndex = keys.indexOf(earliest.parentKey);
|
|
68
|
+
const currentKeyIndex = keys.indexOf(path.parentKey);
|
|
69
|
+
if (earliestKeyIndex > currentKeyIndex) {
|
|
70
|
+
earliest = path;
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
return earliest;
|
|
74
|
+
});
|
|
75
|
+
}
|
|
76
|
+
function getDeepestCommonAncestorFrom(paths, filter) {
|
|
77
|
+
if (!paths.length) {
|
|
78
|
+
return this;
|
|
79
|
+
}
|
|
80
|
+
if (paths.length === 1) {
|
|
81
|
+
return paths[0];
|
|
82
|
+
}
|
|
83
|
+
let minDepth = Infinity;
|
|
84
|
+
let lastCommonIndex, lastCommon;
|
|
85
|
+
const ancestries = paths.map(path => {
|
|
86
|
+
const ancestry = [];
|
|
87
|
+
do {
|
|
88
|
+
ancestry.unshift(path);
|
|
89
|
+
} while ((path = path.parentPath) && path !== this);
|
|
90
|
+
if (ancestry.length < minDepth) {
|
|
91
|
+
minDepth = ancestry.length;
|
|
92
|
+
}
|
|
93
|
+
return ancestry;
|
|
94
|
+
});
|
|
95
|
+
const first = ancestries[0];
|
|
96
|
+
depthLoop: for (let i = 0; i < minDepth; i++) {
|
|
97
|
+
const shouldMatch = first[i];
|
|
98
|
+
for (const ancestry of ancestries) {
|
|
99
|
+
if (ancestry[i] !== shouldMatch) {
|
|
100
|
+
break depthLoop;
|
|
101
|
+
}
|
|
102
|
+
}
|
|
103
|
+
lastCommonIndex = i;
|
|
104
|
+
lastCommon = shouldMatch;
|
|
105
|
+
}
|
|
106
|
+
if (lastCommon) {
|
|
107
|
+
if (filter) {
|
|
108
|
+
return filter(lastCommon, lastCommonIndex, ancestries);
|
|
109
|
+
} else {
|
|
110
|
+
return lastCommon;
|
|
111
|
+
}
|
|
112
|
+
} else {
|
|
113
|
+
throw new Error("Couldn't find intersection");
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
function getAncestry() {
|
|
117
|
+
let path = this;
|
|
118
|
+
const paths = [];
|
|
119
|
+
do {
|
|
120
|
+
paths.push(path);
|
|
121
|
+
} while (path = path.parentPath);
|
|
122
|
+
return paths;
|
|
123
|
+
}
|
|
124
|
+
function isAncestor(maybeDescendant) {
|
|
125
|
+
return maybeDescendant.isDescendant(this);
|
|
126
|
+
}
|
|
127
|
+
function isDescendant(maybeAncestor) {
|
|
128
|
+
return !!this.findParent(parent => parent === maybeAncestor);
|
|
129
|
+
}
|
|
130
|
+
function inType(...candidateTypes) {
|
|
131
|
+
let path = this;
|
|
132
|
+
while (path) {
|
|
133
|
+
for (const type of candidateTypes) {
|
|
134
|
+
if (path.node.type === type) return true;
|
|
135
|
+
}
|
|
136
|
+
path = path.parentPath;
|
|
137
|
+
}
|
|
138
|
+
return false;
|
|
139
|
+
}
|
|
140
|
+
|
|
141
|
+
//# sourceMappingURL=ancestry.js.map
|
|
@@ -0,0 +1,52 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
Object.defineProperty(exports, "__esModule", {
|
|
4
|
+
value: true
|
|
5
|
+
});
|
|
6
|
+
exports.addComment = addComment;
|
|
7
|
+
exports.addComments = addComments;
|
|
8
|
+
exports.shareCommentsWithSiblings = shareCommentsWithSiblings;
|
|
9
|
+
var _t = require("@babel/types");
|
|
10
|
+
const {
|
|
11
|
+
addComment: _addComment,
|
|
12
|
+
addComments: _addComments
|
|
13
|
+
} = _t;
|
|
14
|
+
function shareCommentsWithSiblings() {
|
|
15
|
+
if (typeof this.key === "string") return;
|
|
16
|
+
const node = this.node;
|
|
17
|
+
if (!node) return;
|
|
18
|
+
const trailing = node.trailingComments;
|
|
19
|
+
const leading = node.leadingComments;
|
|
20
|
+
if (!trailing && !leading) return;
|
|
21
|
+
const prev = this.getSibling(this.key - 1);
|
|
22
|
+
const next = this.getSibling(this.key + 1);
|
|
23
|
+
const hasPrev = Boolean(prev.node);
|
|
24
|
+
const hasNext = Boolean(next.node);
|
|
25
|
+
if (hasPrev) {
|
|
26
|
+
if (leading) {
|
|
27
|
+
prev.addComments("trailing", removeIfExisting(leading, prev.node.trailingComments));
|
|
28
|
+
}
|
|
29
|
+
if (trailing && !hasNext) prev.addComments("trailing", trailing);
|
|
30
|
+
}
|
|
31
|
+
if (hasNext) {
|
|
32
|
+
if (trailing) {
|
|
33
|
+
next.addComments("leading", removeIfExisting(trailing, next.node.leadingComments));
|
|
34
|
+
}
|
|
35
|
+
if (leading && !hasPrev) next.addComments("leading", leading);
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
function removeIfExisting(list, toRemove) {
|
|
39
|
+
if (!(toRemove != null && toRemove.length)) return list;
|
|
40
|
+
const set = new Set(toRemove);
|
|
41
|
+
return list.filter(el => {
|
|
42
|
+
return !set.has(el);
|
|
43
|
+
});
|
|
44
|
+
}
|
|
45
|
+
function addComment(type, content, line) {
|
|
46
|
+
_addComment(this.node, type, content, line);
|
|
47
|
+
}
|
|
48
|
+
function addComments(type, comments) {
|
|
49
|
+
_addComments(this.node, type, comments);
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
//# sourceMappingURL=comments.js.map
|
|
@@ -0,0 +1,242 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
Object.defineProperty(exports, "__esModule", {
|
|
4
|
+
value: true
|
|
5
|
+
});
|
|
6
|
+
exports._call = _call;
|
|
7
|
+
exports._getQueueContexts = _getQueueContexts;
|
|
8
|
+
exports._resyncKey = _resyncKey;
|
|
9
|
+
exports._resyncList = _resyncList;
|
|
10
|
+
exports._resyncParent = _resyncParent;
|
|
11
|
+
exports._resyncRemoved = _resyncRemoved;
|
|
12
|
+
exports.call = call;
|
|
13
|
+
exports.isDenylisted = isDenylisted;
|
|
14
|
+
exports.popContext = popContext;
|
|
15
|
+
exports.pushContext = pushContext;
|
|
16
|
+
exports.requeue = requeue;
|
|
17
|
+
exports.requeueComputedKeyAndDecorators = requeueComputedKeyAndDecorators;
|
|
18
|
+
exports.resync = resync;
|
|
19
|
+
exports.setContext = setContext;
|
|
20
|
+
exports.setKey = setKey;
|
|
21
|
+
exports.setScope = setScope;
|
|
22
|
+
exports.setup = setup;
|
|
23
|
+
exports.skip = skip;
|
|
24
|
+
exports.skipKey = skipKey;
|
|
25
|
+
exports.stop = stop;
|
|
26
|
+
exports.visit = visit;
|
|
27
|
+
var _traverseNode = require("../traverse-node.js");
|
|
28
|
+
var _index = require("./index.js");
|
|
29
|
+
var _removal = require("./removal.js");
|
|
30
|
+
var t = require("@babel/types");
|
|
31
|
+
function call(key) {
|
|
32
|
+
const opts = this.opts;
|
|
33
|
+
this.debug(key);
|
|
34
|
+
if (this.node) {
|
|
35
|
+
if (_call.call(this, opts[key])) return true;
|
|
36
|
+
}
|
|
37
|
+
if (this.node) {
|
|
38
|
+
var _opts$this$node$type;
|
|
39
|
+
return _call.call(this, (_opts$this$node$type = opts[this.node.type]) == null ? void 0 : _opts$this$node$type[key]);
|
|
40
|
+
}
|
|
41
|
+
return false;
|
|
42
|
+
}
|
|
43
|
+
function _call(fns) {
|
|
44
|
+
if (!fns) return false;
|
|
45
|
+
for (const fn of fns) {
|
|
46
|
+
if (!fn) continue;
|
|
47
|
+
const node = this.node;
|
|
48
|
+
if (!node) return true;
|
|
49
|
+
const ret = fn.call(this.state, this, this.state);
|
|
50
|
+
if (ret && typeof ret === "object" && typeof ret.then === "function") {
|
|
51
|
+
throw new Error(`You appear to be using a plugin with an async traversal visitor, ` + `which your current version of Babel does not support. ` + `If you're using a published plugin, you may need to upgrade ` + `your @babel/core version.`);
|
|
52
|
+
}
|
|
53
|
+
if (ret) {
|
|
54
|
+
throw new Error(`Unexpected return value from visitor method ${fn}`);
|
|
55
|
+
}
|
|
56
|
+
if (this.node !== node) return true;
|
|
57
|
+
if (this._traverseFlags > 0) return true;
|
|
58
|
+
}
|
|
59
|
+
return false;
|
|
60
|
+
}
|
|
61
|
+
function isDenylisted() {
|
|
62
|
+
var _this$opts$denylist;
|
|
63
|
+
const denylist = (_this$opts$denylist = this.opts.denylist) != null ? _this$opts$denylist : this.opts.blacklist;
|
|
64
|
+
return denylist == null ? void 0 : denylist.includes(this.node.type);
|
|
65
|
+
}
|
|
66
|
+
{
|
|
67
|
+
exports.isBlacklisted = isDenylisted;
|
|
68
|
+
}
|
|
69
|
+
function restoreContext(path, context) {
|
|
70
|
+
if (path.context !== context) {
|
|
71
|
+
path.context = context;
|
|
72
|
+
path.state = context.state;
|
|
73
|
+
path.opts = context.opts;
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
function visit() {
|
|
77
|
+
var _this$opts$shouldSkip, _this$opts;
|
|
78
|
+
if (!this.node) {
|
|
79
|
+
return false;
|
|
80
|
+
}
|
|
81
|
+
if (this.isDenylisted()) {
|
|
82
|
+
return false;
|
|
83
|
+
}
|
|
84
|
+
if ((_this$opts$shouldSkip = (_this$opts = this.opts).shouldSkip) != null && _this$opts$shouldSkip.call(_this$opts, this)) {
|
|
85
|
+
return false;
|
|
86
|
+
}
|
|
87
|
+
const currentContext = this.context;
|
|
88
|
+
if (this.shouldSkip || call.call(this, "enter")) {
|
|
89
|
+
this.debug("Skip...");
|
|
90
|
+
return this.shouldStop;
|
|
91
|
+
}
|
|
92
|
+
restoreContext(this, currentContext);
|
|
93
|
+
this.debug("Recursing into...");
|
|
94
|
+
this.shouldStop = (0, _traverseNode.traverseNode)(this.node, this.opts, this.scope, this.state, this, this.skipKeys);
|
|
95
|
+
restoreContext(this, currentContext);
|
|
96
|
+
call.call(this, "exit");
|
|
97
|
+
return this.shouldStop;
|
|
98
|
+
}
|
|
99
|
+
function skip() {
|
|
100
|
+
this.shouldSkip = true;
|
|
101
|
+
}
|
|
102
|
+
function skipKey(key) {
|
|
103
|
+
if (this.skipKeys == null) {
|
|
104
|
+
this.skipKeys = {};
|
|
105
|
+
}
|
|
106
|
+
this.skipKeys[key] = true;
|
|
107
|
+
}
|
|
108
|
+
function stop() {
|
|
109
|
+
this._traverseFlags |= _index.SHOULD_SKIP | _index.SHOULD_STOP;
|
|
110
|
+
}
|
|
111
|
+
function setScope() {
|
|
112
|
+
var _this$opts2, _this$scope;
|
|
113
|
+
if ((_this$opts2 = this.opts) != null && _this$opts2.noScope) return;
|
|
114
|
+
let path = this.parentPath;
|
|
115
|
+
if ((this.key === "key" || this.listKey === "decorators") && path.isMethod() || this.key === "discriminant" && path.isSwitchStatement()) {
|
|
116
|
+
path = path.parentPath;
|
|
117
|
+
}
|
|
118
|
+
let target;
|
|
119
|
+
while (path && !target) {
|
|
120
|
+
var _path$opts;
|
|
121
|
+
if ((_path$opts = path.opts) != null && _path$opts.noScope) return;
|
|
122
|
+
target = path.scope;
|
|
123
|
+
path = path.parentPath;
|
|
124
|
+
}
|
|
125
|
+
this.scope = this.getScope(target);
|
|
126
|
+
(_this$scope = this.scope) == null || _this$scope.init();
|
|
127
|
+
}
|
|
128
|
+
function setContext(context) {
|
|
129
|
+
if (this.skipKeys != null) {
|
|
130
|
+
this.skipKeys = {};
|
|
131
|
+
}
|
|
132
|
+
this._traverseFlags = 0;
|
|
133
|
+
if (context) {
|
|
134
|
+
this.context = context;
|
|
135
|
+
this.state = context.state;
|
|
136
|
+
this.opts = context.opts;
|
|
137
|
+
}
|
|
138
|
+
setScope.call(this);
|
|
139
|
+
return this;
|
|
140
|
+
}
|
|
141
|
+
function resync() {
|
|
142
|
+
if (this.removed) return;
|
|
143
|
+
_resyncParent.call(this);
|
|
144
|
+
_resyncList.call(this);
|
|
145
|
+
_resyncKey.call(this);
|
|
146
|
+
}
|
|
147
|
+
function _resyncParent() {
|
|
148
|
+
if (this.parentPath) {
|
|
149
|
+
this.parent = this.parentPath.node;
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
function _resyncKey() {
|
|
153
|
+
if (!this.container) return;
|
|
154
|
+
if (this.node === this.container[this.key]) {
|
|
155
|
+
return;
|
|
156
|
+
}
|
|
157
|
+
if (Array.isArray(this.container)) {
|
|
158
|
+
for (let i = 0; i < this.container.length; i++) {
|
|
159
|
+
if (this.container[i] === this.node) {
|
|
160
|
+
setKey.call(this, i);
|
|
161
|
+
return;
|
|
162
|
+
}
|
|
163
|
+
}
|
|
164
|
+
} else {
|
|
165
|
+
for (const key of Object.keys(this.container)) {
|
|
166
|
+
if (this.container[key] === this.node) {
|
|
167
|
+
setKey.call(this, key);
|
|
168
|
+
return;
|
|
169
|
+
}
|
|
170
|
+
}
|
|
171
|
+
}
|
|
172
|
+
this.key = null;
|
|
173
|
+
}
|
|
174
|
+
function _resyncList() {
|
|
175
|
+
if (!this.parent || !this.inList) return;
|
|
176
|
+
const newContainer = this.parent[this.listKey];
|
|
177
|
+
if (this.container === newContainer) return;
|
|
178
|
+
this.container = newContainer || null;
|
|
179
|
+
}
|
|
180
|
+
function _resyncRemoved() {
|
|
181
|
+
if (this.key == null || !this.container || this.container[this.key] !== this.node) {
|
|
182
|
+
_removal._markRemoved.call(this);
|
|
183
|
+
}
|
|
184
|
+
}
|
|
185
|
+
function popContext() {
|
|
186
|
+
this.contexts.pop();
|
|
187
|
+
if (this.contexts.length > 0) {
|
|
188
|
+
this.setContext(this.contexts[this.contexts.length - 1]);
|
|
189
|
+
} else {
|
|
190
|
+
this.setContext(undefined);
|
|
191
|
+
}
|
|
192
|
+
}
|
|
193
|
+
function pushContext(context) {
|
|
194
|
+
this.contexts.push(context);
|
|
195
|
+
this.setContext(context);
|
|
196
|
+
}
|
|
197
|
+
function setup(parentPath, container, listKey, key) {
|
|
198
|
+
this.listKey = listKey;
|
|
199
|
+
this.container = container;
|
|
200
|
+
this.parentPath = parentPath || this.parentPath;
|
|
201
|
+
setKey.call(this, key);
|
|
202
|
+
}
|
|
203
|
+
function setKey(key) {
|
|
204
|
+
var _this$node;
|
|
205
|
+
this.key = key;
|
|
206
|
+
this.node = this.container[this.key];
|
|
207
|
+
this.type = (_this$node = this.node) == null ? void 0 : _this$node.type;
|
|
208
|
+
}
|
|
209
|
+
function requeue(pathToQueue = this) {
|
|
210
|
+
if (pathToQueue.removed) return;
|
|
211
|
+
;
|
|
212
|
+
const contexts = this.contexts;
|
|
213
|
+
for (const context of contexts) {
|
|
214
|
+
context.maybeQueue(pathToQueue);
|
|
215
|
+
}
|
|
216
|
+
}
|
|
217
|
+
function requeueComputedKeyAndDecorators() {
|
|
218
|
+
const {
|
|
219
|
+
context,
|
|
220
|
+
node
|
|
221
|
+
} = this;
|
|
222
|
+
if (!t.isPrivate(node) && node.computed) {
|
|
223
|
+
context.maybeQueue(this.get("key"));
|
|
224
|
+
}
|
|
225
|
+
if (node.decorators) {
|
|
226
|
+
for (const decorator of this.get("decorators")) {
|
|
227
|
+
context.maybeQueue(decorator);
|
|
228
|
+
}
|
|
229
|
+
}
|
|
230
|
+
}
|
|
231
|
+
function _getQueueContexts() {
|
|
232
|
+
let path = this;
|
|
233
|
+
let contexts = this.contexts;
|
|
234
|
+
while (!contexts.length) {
|
|
235
|
+
path = path.parentPath;
|
|
236
|
+
if (!path) break;
|
|
237
|
+
contexts = path.contexts;
|
|
238
|
+
}
|
|
239
|
+
return contexts;
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
//# sourceMappingURL=context.js.map
|