@modern-js/monorepo-tools 2.0.0-beta.3 → 2.0.0-beta.6

package/dist/js/modern/commands/deploy.js

@@ -1,35 +1,49 @@
-import { logger } from '@modern-js/utils';
+var __async = (__this, __arguments, generator) => {
+  return new Promise((resolve, reject) => {
+    var fulfilled = (value) => {
+      try {
+        step(generator.next(value));
+      } catch (e) {
+        reject(e);
+      }
+    };
+    var rejected = (value) => {
+      try {
+        step(generator.throw(value));
+      } catch (e) {
+        reject(e);
+      }
+    };
+    var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
+    step((generator = generator.apply(__this, __arguments)).next());
+  });
+};
+import { logger } from "@modern-js/utils";
 import { initDAG } from "../dag";
 import { getMonorepoBaseData } from "../parse-config/monorepo";
 import { getProjects } from "../projects/get-projects";
 import { deploy as runDeployTask } from "../features/deploy";
-export const deploy = async (api, deployProjectNames, option, ignoreMatchs = []) => {
-  const {
-    deployPath = 'output'
-  } = option;
-  const {
-    appDirectory
-  } = api.useAppContext();
-  logger.info(`start deploy ${deployProjectNames.join(',')}`);
-  const projects = await getProjects({
-    packagesMatchs: {
-      enableAutoFinder: true
+const deploy = (_0, _1, _2, ..._3) => __async(void 0, [_0, _1, _2, ..._3], function* (api, deployProjectNames, option, ignoreMatchs = []) {
+  const { deployPath = "output" } = option;
+  const { appDirectory } = api.useAppContext();
+  logger.info(`start deploy ${deployProjectNames.join(",")}`);
+  const projects = yield getProjects(
+    {
+      packagesMatchs: { enableAutoFinder: true },
+      packagesIgnoreMatchs: ignoreMatchs
     },
-    packagesIgnoreMatchs: ignoreMatchs
-  }, appDirectory);
-  const {
-    rootPath,
-    packageManager
-  } = getMonorepoBaseData(process.cwd());
+    appDirectory
+  );
+  const { rootPath, packageManager } = getMonorepoBaseData(process.cwd());
   const operator = initDAG(projects);
-  await runDeployTask(deployProjectNames, operator, {
+  yield runDeployTask(deployProjectNames, operator, {
     rootPath,
     packageManager,
     deployPath
   });
   const runners = api.useHookRunners();
-  runners.afterMonorepoDeploy({
-    operator,
-    deployProjectNames
-  });
-};
+  runners.afterMonorepoDeploy({ operator, deployProjectNames });
+});
+export {
+  deploy
+};

package/dist/js/modern/commands/index.js

@@ -2,4 +2,4 @@ export * from "./deploy";
 export * from "./build";
 export * from "./build-watch";
 export * from "./clear";
-export * from "./install";
+export * from "./install";

package/dist/js/modern/commands/install.js

@@ -1,28 +1,43 @@
+var __async = (__this, __arguments, generator) => {
+  return new Promise((resolve, reject) => {
+    var fulfilled = (value) => {
+      try {
+        step(generator.next(value));
+      } catch (e) {
+        reject(e);
+      }
+    };
+    var rejected = (value) => {
+      try {
+        step(generator.throw(value));
+      } catch (e) {
+        reject(e);
+      }
+    };
+    var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
+    step((generator = generator.apply(__this, __arguments)).next());
+  });
+};
 import { runInstallTask } from "../features/install";
 import { getMonorepoBaseData } from "../parse-config/monorepo";
 import { getProjects } from "../projects/get-projects";
 import { initDAG } from "../dag";
-export const install = async (projectNames = [], option, api) => {
-  const {
+const install = (..._0) => __async(void 0, [..._0], function* (projectNames = [], option, api) {
+  const { appDirectory } = api.useAppContext();
+  const { auto } = option;
+  const projects = yield getProjects(
+    { packagesMatchs: { enableAutoFinder: true } },
     appDirectory
-  } = api.useAppContext();
-  const {
-    auto
-  } = option;
-  const projects = await getProjects({
-    packagesMatchs: {
-      enableAutoFinder: true
-    }
-  }, appDirectory);
+  );
   const operator = initDAG(projects);
   operator.checkCircle();
-  const {
-    rootPath,
-    packageManager
-  } = getMonorepoBaseData(appDirectory);
-  await runInstallTask(projectNames, operator, {
+  const { rootPath, packageManager } = getMonorepoBaseData(appDirectory);
+  yield runInstallTask(projectNames, operator, {
     packageManager,
     rootPath,
     auto
   });
-};
+});
+export {
+  install
+};

package/dist/js/modern/constants.js

@@ -1,10 +1,14 @@
-export const WORKSPACE_FILE = {
-  LERNA: 'lerna.json',
-  YARN: 'package.json',
-  PNPM: 'pnpm-workspace.yaml'
+const WORKSPACE_FILE = {
+  LERNA: "lerna.json",
+  YARN: "package.json",
+  PNPM: "pnpm-workspace.yaml"
+};
+const LOCK_FILE = {
+  YARN: "yarn.lock",
+  PNPM: "pnpm-lock.yaml",
+  NPM: "package-lock.json"
+};
+export {
+  LOCK_FILE,
+  WORKSPACE_FILE
 };
-export const LOCK_FILE = {
-  YARN: 'yarn.lock',
-  PNPM: 'pnpm-lock.yaml',
-  NPM: 'package-lock.json'
-};

package/dist/js/modern/dag/create.js

@@ -1,35 +1,39 @@
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+var __defProp = Object.defineProperty;
+var __getOwnPropSymbols = Object.getOwnPropertySymbols;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __propIsEnum = Object.prototype.propertyIsEnumerable;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __spreadValues = (a, b) => {
+  for (var prop in b || (b = {}))
+    if (__hasOwnProp.call(b, prop))
+      __defNormalProp(a, prop, b[prop]);
+  if (__getOwnPropSymbols)
+    for (var prop of __getOwnPropSymbols(b)) {
+      if (__propIsEnum.call(b, prop))
+        __defNormalProp(a, prop, b[prop]);
+    }
+  return a;
+};
 const initProjectDependencyAndDependent = (project, projectsName, projectsMap) => {
-  // dependencies、devDependencies、peerDependencies
   const dependencies = project.extra.dependencies || {};
   const devDependencies = project.extra.devDependencies || {};
   const optionalDependencies = project.extra.optionalDependencies || {};
-  const DependencyProjectsName = Object.keys(_objectSpread(_objectSpread(_objectSpread({}, dependencies), devDependencies), optionalDependencies)).filter(depName => projectsName.includes(depName));
-
-  // init dependent key
+  const DependencyProjectsName = Object.keys(__spreadValues(__spreadValues(__spreadValues({}, dependencies), devDependencies), optionalDependencies)).filter((depName) => projectsName.includes(depName));
   project.dependent = project.dependent || [];
-  // get dependency ProjectNode
-  project.dependency = DependencyProjectsName.map(projectName => {
-    // 在遍历该项目的 dependency 的时候，顺便更新这些 dependency 的 dependent
+  project.dependency = DependencyProjectsName.map((projectName) => {
     const dependencyProject = projectsMap.get(projectName);
-    const dependent = (dependencyProject === null || dependencyProject === void 0 ? void 0 : dependencyProject.dependent) || [];
-    if (
-    // 消除重复添加的情况
-    !dependent.some(p => p.name === project.name)) {
+    const dependent = (dependencyProject == null ? void 0 : dependencyProject.dependent) || [];
+    if (!dependent.some((p) => p.name === project.name)) {
       dependencyProject.dependent = [...dependent, project];
       dependencyProject.dependentEdge = dependencyProject.dependent.length;
     }
     return dependencyProject;
   });
-  // NOTE: 一个节点有多少依赖，就代表有多少的入度或者叫指向该节点的边
-  // project.dagNodeEdge = project.dependency.length;
   project.dependencyEdge = project.dependency.length;
 };
-export const create = projects => {
+const create = (projects) => {
   const projectsName = [];
-  const projectsMap = new Map();
+  const projectsMap = /* @__PURE__ */ new Map();
   for (const project of projects) {
     projectsMap.set(project.name, project);
     projectsName.push(project.name);
@@ -37,8 +41,8 @@ export const create = projects => {
   for (const project of projects) {
     initProjectDependencyAndDependent(project, projectsName, projectsMap);
   }
-  return {
-    projectsMap,
-    projectList: projectsName
-  };
-};
+  return { projectsMap, projectList: projectsName };
+};
+export {
+  create
+};

package/dist/js/modern/dag/edge-manager.js

@@ -1,7 +1,5 @@
-function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-export class EdgeManager {
+class EdgeManager {
   constructor() {
-    _defineProperty(this, "_dependencyEdgeHash", void 0);
     this._dependencyEdgeHash = {};
   }
   reduceOneEdge(project) {
@@ -25,4 +23,7 @@ export class EdgeManager {
   setEdge(project) {
     this._dependencyEdgeHash[project.name] = project.dependencyEdge;
   }
-}
+}
+export {
+  EdgeManager
+};

package/dist/js/modern/dag/index.js

@@ -1,9 +1,10 @@
 import { create } from "./create";
 import { DagOperator } from "./operator";
-export const initDAG = projects => {
-  const {
-    projectsMap
-  } = create(projects);
+const initDAG = (projects) => {
+  const { projectsMap } = create(projects);
   const operator = new DagOperator(projects, projectsMap);
   return operator;
-};
+};
+export {
+  initDAG
+};

package/dist/js/modern/dag/operator.js

@@ -1,20 +1,51 @@
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-import pMap from 'p-map';
+var __defProp = Object.defineProperty;
+var __defProps = Object.defineProperties;
+var __getOwnPropDescs = Object.getOwnPropertyDescriptors;
+var __getOwnPropSymbols = Object.getOwnPropertySymbols;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __propIsEnum = Object.prototype.propertyIsEnumerable;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __spreadValues = (a, b) => {
+  for (var prop in b || (b = {}))
+    if (__hasOwnProp.call(b, prop))
+      __defNormalProp(a, prop, b[prop]);
+  if (__getOwnPropSymbols)
+    for (var prop of __getOwnPropSymbols(b)) {
+      if (__propIsEnum.call(b, prop))
+        __defNormalProp(a, prop, b[prop]);
+    }
+  return a;
+};
+var __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));
+var __async = (__this, __arguments, generator) => {
+  return new Promise((resolve, reject) => {
+    var fulfilled = (value) => {
+      try {
+        step(generator.next(value));
+      } catch (e) {
+        reject(e);
+      }
+    };
+    var rejected = (value) => {
+      try {
+        step(generator.throw(value));
+      } catch (e) {
+        reject(e);
+      }
+    };
+    var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
+    step((generator = generator.apply(__this, __arguments)).next());
+  });
+};
+import pMap from "p-map";
 import { errorLog } from "../log/error";
 import { TaskRunner } from "./task";
 import { EdgeManager } from "./edge-manager";
 import { recursiveGetDependency, sortProjects } from "./utils";
-export class DagOperator {
-  // 排序好的项目列表
-
+class DagOperator {
   constructor(projects, projectsMap) {
-    _defineProperty(this, "_projects", void 0);
-    _defineProperty(this, "_projectsMap", void 0);
-    _defineProperty(this, "_sortedProjects", void 0);
-    _defineProperty(this, "_createTask", (project, task) => async (stopTask = () => undefined) => {
-      await task(project, project.dependency || [], () => stopTask());
+    this._createTask = (project, task) => (stopTask = () => void 0) => __async(this, null, function* () {
+      yield task(project, project.dependency || [], () => stopTask());
       return project.name;
     });
     this._projects = projects;
@@ -24,9 +55,7 @@ export class DagOperator {
   checkNodeDataExist(name) {
     return this._projectsMap.has(name);
   }
-  getNodeData(name, option = {
-    checkExist: false
-  }) {
+  getNodeData(name, option = { checkExist: false }) {
     if (option.checkExist) {
       if (this._projectsMap.has(name)) {
         return this._projectsMap.get(name);
@@ -37,19 +66,15 @@ export class DagOperator {
     return this._projectsMap.get(name);
   }
   getNodeDependencyData(name) {
-    var _this$_projectsMap$ge;
-    return ((_this$_projectsMap$ge = this._projectsMap.get(name)) === null || _this$_projectsMap$ge === void 0 ? void 0 : _this$_projectsMap$ge.dependency) || [];
+    var _a;
+    return ((_a = this._projectsMap.get(name)) == null ? void 0 : _a.dependency) || [];
   }
   getNodeDependentData(name) {
-    var _this$_projectsMap$ge2;
-    return ((_this$_projectsMap$ge2 = this._projectsMap.get(name)) === null || _this$_projectsMap$ge2 === void 0 ? void 0 : _this$_projectsMap$ge2.dependent) || [];
+    var _a;
+    return ((_a = this._projectsMap.get(name)) == null ? void 0 : _a.dependent) || [];
   }
-  getNodeAllDependencyData(name, option = {
-    skipCircleCheck: false
-  }) {
-    const {
-      skipCircleCheck
-    } = option;
+  getNodeAllDependencyData(name, option = { skipCircleCheck: false }) {
+    const { skipCircleCheck } = option;
     if (!skipCircleCheck) {
       this.checkCircle();
     }
@@ -66,145 +91,137 @@ export class DagOperator {
       errorLog(`No '${name}' project exist`);
     }
   }
-  async traverseAllNodes(task) {
-    const sortedNodes = this._sortedProjects.length > 0 ? this._sortedProjects : sortProjects(this._projects);
-    const finishTaskHash = {};
-    let preNodes = [];
-    let earlyFinish = false;
-    for (const projects of sortedNodes) {
-      if (earlyFinish) {
-        break;
-      }
-      await pMap(projects,
-      // eslint-disable-next-line @typescript-eslint/no-loop-func
-      async project => {
-        if (!finishTaskHash[project.name]) {
-          finishTaskHash[project.name] = true;
-          await task(project, this._getProjectPreviousNode(project.dependent || [], preNodes), () => earlyFinish = true);
+  traverseAllNodes(task) {
+    return __async(this, null, function* () {
+      const sortedNodes = this._sortedProjects.length > 0 ? this._sortedProjects : sortProjects(this._projects);
+      const finishTaskHash = {};
+      let preNodes = [];
+      let earlyFinish = false;
+      for (const projects of sortedNodes) {
+        if (earlyFinish) {
+          break;
         }
-      }, {
-        concurrency: projects.length
-      });
-      preNodes = [...projects];
-    }
+        yield pMap(
+          projects,
+          (project) => __async(this, null, function* () {
+            if (!finishTaskHash[project.name]) {
+              finishTaskHash[project.name] = true;
+              yield task(
+                project,
+                this._getProjectPreviousNode(project.dependent || [], preNodes),
+                () => earlyFinish = true
+              );
+            }
+          }),
+          { concurrency: projects.length }
+        );
+        preNodes = [...projects];
+      }
+    });
   }
   checkCircle() {
-    // this._sortedProjects = sortProjects(this._projects);
-    this._checkForCyclicDependencies(this._projects, [], new Set());
+    this._checkForCyclicDependencies(this._projects, [], /* @__PURE__ */ new Set());
   }
-  async traverseDependenciesToProjectToDependent(name, task, config = {}) {
-    await this.traverseDependenciesToProject(name, task, config);
-    await this.traverseProjectToDependent(name, task, _objectSpread(_objectSpread({}, config), {}, {
-      withSelf: false
-    }));
-  }
-
-  /**
-   * 1. 把目标节点当做叶子节点集合 A 中的元素
-   * 2. 当叶子节点集合中某个 a 元素结束任务的时候进行如下操作：
-   * 2.1 剪(去额外的)枝：获取 a 元素的 dependent集合，将该集合中元素的依赖列表进行过滤，过滤条件为：排除 a 以及 a 元素的 dependent集合以外的元素。
-   * 2.2 入度减一：对 a 元素的 dependent 集合元素的 dependencyEdge 减一
-   * 3. 检查是否存在 dependencyEdge === 0 的节点，加入叶子节点集合 A中。
-   * 4. 根据情况（是否存在空闲的进程）选择是否执行新加入的节点对应的任务。
-   */
-
-  async traverseProjectToDependent(name, task, {
-    withSelf = false,
-    runTaskConcurrency
-  } = {}) {
-    if (!this._projectsMap.has(name)) {
-      errorLog(`No '${name}' project exist`);
-    }
-    const traverseTargetNode = this._projectsMap.get(name);
-    const leafNodeTasks = [withSelf ? this._createTask(traverseTargetNode, task) : async () => Promise.resolve(traverseTargetNode.name)];
-    const taskRunner = new TaskRunner(leafNodeTasks, {
-      concurrency: runTaskConcurrency
+  traverseDependenciesToProjectToDependent(_0, _1) {
+    return __async(this, arguments, function* (name, task, config = {}) {
+      yield this.traverseDependenciesToProject(name, task, config);
+      yield this.traverseProjectToDependent(name, task, __spreadProps(__spreadValues({}, config), {
+        withSelf: false
+      }));
     });
-    const edgeManager = new EdgeManager();
-    taskRunner.on(TaskRunner.TASK_FINISH, projectName => {
-      const projectNode = this.getNodeData(projectName);
-      const dependent = projectNode.dependent || [];
-      for (const dependentProject of dependent) {
-        const dependency = dependentProject.dependency || [];
-        const removeNodes = dependency.filter(dependencyProject => ![projectName, ...dependent.map(p => p.name)].includes(dependencyProject.name));
-        edgeManager.reduceEdges(dependentProject, removeNodes.length + 1);
-        // 变成叶子节点，就加入执行任务的队列中
-        if (edgeManager.getEdge(dependentProject) === 0) {
-          taskRunner.addTask(this._createTask(dependentProject, task));
-        }
+  }
+  traverseProjectToDependent(_0, _1) {
+    return __async(this, arguments, function* (name, task, { withSelf = false, runTaskConcurrency } = {}) {
+      if (!this._projectsMap.has(name)) {
+        errorLog(`No '${name}' project exist`);
       }
+      const traverseTargetNode = this._projectsMap.get(name);
+      const leafNodeTasks = [
+        withSelf ? this._createTask(traverseTargetNode, task) : () => __async(this, null, function* () {
+          return Promise.resolve(traverseTargetNode.name);
+        })
+      ];
+      const taskRunner = new TaskRunner(leafNodeTasks, {
+        concurrency: runTaskConcurrency
+      });
+      const edgeManager = new EdgeManager();
+      taskRunner.on(TaskRunner.TASK_FINISH, (projectName) => {
+        const projectNode = this.getNodeData(projectName);
+        const dependent = projectNode.dependent || [];
+        for (const dependentProject of dependent) {
+          const dependency = dependentProject.dependency || [];
+          const removeNodes = dependency.filter(
+            (dependencyProject) => ![projectName, ...dependent.map((p) => p.name)].includes(
+              dependencyProject.name
+            )
+          );
+          edgeManager.reduceEdges(dependentProject, removeNodes.length + 1);
+          if (edgeManager.getEdge(dependentProject) === 0) {
+            taskRunner.addTask(this._createTask(dependentProject, task));
+          }
+        }
+      });
+      yield taskRunner.run();
     });
-    await taskRunner.run();
   }
-
-  /**
-   * 1. 找到叶子节点集合 A
-   * 2. 找到直接连接叶子节点的节点集合 B
-   * 3. 当有某个叶子节点结束任务，则对该节点的直接连接的节点（或者理解成dependent）的枝数（或者叫入度）减一。
-   * 4. 检查 B 集合中是否存在入度为0的节点，则此节点为叶子节点，并加入叶子节点集合 A
-   * 5. 根据情况（是否存在空闲的进程）选择是否执行新加入的节点对应的任务。
-   */
-
-  // TODO: 执行顺序还需要再确定一下
-  async traverseDependenciesToProject(name, task, {
-    withSelf = false,
-    runTaskConcurrency
-  } = {}) {
-    if (!this._projectsMap.has(name)) {
-      errorLog(`No '${name}' project exist`);
-    }
-    const traverseTargetNode = this._projectsMap.get(name);
-    const leafNodes = this._getDependencyLeafNodes(traverseTargetNode);
-    if ((leafNodes === null || leafNodes === void 0 ? void 0 : leafNodes.length) === 0) {
-      await this._createTask(traverseTargetNode, task)();
-      return;
-    }
-    const leafNodeTasks = leafNodes.map(project => this._createTask(project, task));
-    const taskRunner = new TaskRunner(leafNodeTasks, {
-      concurrency: runTaskConcurrency
-    });
-    const edgeManager = new EdgeManager();
-    taskRunner.on(TaskRunner.TASK_FINISH, projectName => {
-      const projectNode = this.getNodeData(projectName);
-      const dependent = projectNode.dependent || [];
-      for (const dependentProject of dependent) {
-        // 只处理在叶子节点/目标项目的所有依赖集合的节点
-        if (![traverseTargetNode, ...leafNodes].some(n => n.name === dependentProject.name)) {
-          continue;
-        }
-        edgeManager.reduceOneEdge(dependentProject);
-        if (dependentProject.name === traverseTargetNode.name && !withSelf) {
-          continue;
-        }
-
-        // 变成叶子节点，就加入执行任务的队列中
-        if (edgeManager.getEdge(dependentProject) === 0) {
-          taskRunner.addTask(this._createTask(dependentProject, task));
-        }
+  traverseDependenciesToProject(_0, _1) {
+    return __async(this, arguments, function* (name, task, { withSelf = false, runTaskConcurrency } = {}) {
+      if (!this._projectsMap.has(name)) {
+        errorLog(`No '${name}' project exist`);
+      }
+      const traverseTargetNode = this._projectsMap.get(name);
+      const leafNodes = this._getDependencyLeafNodes(traverseTargetNode);
+      if ((leafNodes == null ? void 0 : leafNodes.length) === 0) {
+        yield this._createTask(traverseTargetNode, task)();
+        return;
       }
+      const leafNodeTasks = leafNodes.map(
+        (project) => this._createTask(project, task)
+      );
+      const taskRunner = new TaskRunner(leafNodeTasks, {
+        concurrency: runTaskConcurrency
+      });
+      const edgeManager = new EdgeManager();
+      taskRunner.on(TaskRunner.TASK_FINISH, (projectName) => {
+        const projectNode = this.getNodeData(projectName);
+        const dependent = projectNode.dependent || [];
+        for (const dependentProject of dependent) {
+          if (![traverseTargetNode, ...leafNodes].some(
+            (n) => n.name === dependentProject.name
+          )) {
+            continue;
+          }
+          edgeManager.reduceOneEdge(dependentProject);
+          if (dependentProject.name === traverseTargetNode.name && !withSelf) {
+            continue;
+          }
+          if (edgeManager.getEdge(dependentProject) === 0) {
+            taskRunner.addTask(this._createTask(dependentProject, task));
+          }
+        }
+      });
+      yield taskRunner.run();
     });
-    await taskRunner.run();
   }
-
-  /**
-   * Copyright (c) Microsoft Corporation. All rights reserved.
-   *
-   * This source code is licensed under the MIT license found in the
-   * LICENSE file at
-   * https://github.com/microsoft/rushstack/blob/master/apps/rush-lib/LICENSE
-   *
-  /**
-   * Checks for projects that indirectly depend on themselves.
-   */
   _checkForCyclicDependencies(projects, dependencyChain, alreadyCheckedProjects) {
     for (const project of projects) {
       if (dependencyChain.includes(project.name)) {
-        throw new Error(`${'A cyclic dependency was encountered:\n'}    ${[...dependencyChain, project.name].reverse().join('\n  -> ')}\n`);
+        throw new Error(
+          `${"A cyclic dependency was encountered:\n"}    ${[
+            ...dependencyChain,
+            project.name
+          ].reverse().join("\n  -> ")}
+`
+        );
       }
       if (!alreadyCheckedProjects.has(project.name)) {
         alreadyCheckedProjects.add(project.name);
         dependencyChain.push(project.name);
-        this._checkForCyclicDependencies(project.dependent, dependencyChain, alreadyCheckedProjects);
+        this._checkForCyclicDependencies(
+          project.dependent,
+          dependencyChain,
+          alreadyCheckedProjects
+        );
         dependencyChain.pop();
       }
     }
@@ -216,18 +233,19 @@ export class DagOperator {
     }
     let leafNodes = [...dependency];
     for (const dependencyNode of dependency) {
-      leafNodes = [...leafNodes, ...this._getDependencyLeafNodes(dependencyNode)];
+      leafNodes = [
+        ...leafNodes,
+        ...this._getDependencyLeafNodes(dependencyNode)
+      ];
     }
     return leafNodes;
   }
   _getProjectPreviousNode(searchProjects, preNodes) {
-    return searchProjects.filter(p => preNodes.map(preP => preP.name).includes(p.name));
+    return searchProjects.filter(
+      (p) => preNodes.map((preP) => preP.name).includes(p.name)
+    );
   }
-
-  // public async getOrderTasks() {
-  //     // Precalculate the number of dependent packages
-  //   for (const project of this._projects) {
-  //     calculateCriticalPaths(project);
-  //   }
-  // }
-}
+}
+export {
+  DagOperator
+};