mirror of
https://github.com/JamesIves/github-pages-deploy-action.git
synced 2023-12-15 20:03:39 +08:00
80 lines
1.9 KiB
JavaScript
80 lines
1.9 KiB
JavaScript
'use strict';
|
|
|
|
Object.defineProperty(exports, '__esModule', {
|
|
value: true
|
|
});
|
|
exports.default = treeProcessor;
|
|
|
|
/**
|
|
* Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
function treeProcessor(options) {
|
|
const {
|
|
nodeComplete,
|
|
nodeStart,
|
|
queueRunnerFactory,
|
|
runnableIds,
|
|
tree
|
|
} = options;
|
|
|
|
function isEnabled(node, parentEnabled) {
|
|
return parentEnabled || runnableIds.indexOf(node.id) !== -1;
|
|
}
|
|
|
|
function getNodeHandler(node, parentEnabled) {
|
|
const enabled = isEnabled(node, parentEnabled);
|
|
return node.children
|
|
? getNodeWithChildrenHandler(node, enabled)
|
|
: getNodeWithoutChildrenHandler(node, enabled);
|
|
}
|
|
|
|
function getNodeWithoutChildrenHandler(node, enabled) {
|
|
return function fn(done = () => {}) {
|
|
node.execute(done, enabled);
|
|
};
|
|
}
|
|
|
|
function getNodeWithChildrenHandler(node, enabled) {
|
|
return async function fn(done = () => {}) {
|
|
nodeStart(node);
|
|
await queueRunnerFactory({
|
|
onException: error => node.onException(error),
|
|
queueableFns: wrapChildren(node, enabled),
|
|
userContext: node.sharedUserContext()
|
|
});
|
|
nodeComplete(node);
|
|
done();
|
|
};
|
|
}
|
|
|
|
function hasNoEnabledTest(node) {
|
|
if (node.children) {
|
|
return node.children.every(hasNoEnabledTest);
|
|
}
|
|
|
|
return node.disabled || node.markedPending;
|
|
}
|
|
|
|
function wrapChildren(node, enabled) {
|
|
if (!node.children) {
|
|
throw new Error('`node.children` is not defined.');
|
|
}
|
|
|
|
const children = node.children.map(child => ({
|
|
fn: getNodeHandler(child, enabled)
|
|
}));
|
|
|
|
if (hasNoEnabledTest(node)) {
|
|
return children;
|
|
}
|
|
|
|
return node.beforeAllFns.concat(children).concat(node.afterAllFns);
|
|
}
|
|
|
|
const treeHandler = getNodeHandler(tree, false);
|
|
return treeHandler();
|
|
}
|