@teambit/builder 1.0.769 → 1.0.771

package/dist/build-pipeline-order.js

@@ -103,9 +103,13 @@ function calculatePipelineOrder(taskSlot, envs, pipeNameOnEnv, tasks = [], skipT
   let tasksQueue = new (_tasksQueue().TasksQueue)();
   locations.forEach(location => addTasksToGraph(tasksQueue, dataPerLocation, location));
   if (tasks.length) {
+    const originalLength = tasksQueue.length;
     tasksQueue = new (_tasksQueue().TasksQueue)(...tasksQueue.filter(({
       task
     }) => tasks.includes(task.name) || tasks.includes(task.aspectId)));
+    if (tasksQueue.length === 0 && originalLength > 0) {
+      throw new Error(`Pipeline error - no tasks found matching the specified filter: "${tasks.join(', ')}". Available tasks: ${getAvailableTaskNames(flattenedPipeline).join(', ')}`);
+    }
   }
   if (skipTests) {
     tasksQueue = new (_tasksQueue().TasksQueue)(...tasksQueue.filter(({
@@ -119,6 +123,14 @@ function calculatePipelineOrder(taskSlot, envs, pipeNameOnEnv, tasks = [], skipT
   }
   return tasksQueue;
 }
+function getAvailableTaskNames(tasks) {
+  const uniqueTaskNames = new Set();
+  tasks.forEach(task => {
+    uniqueTaskNames.add(task.name);
+    uniqueTaskNames.add(task.aspectId);
+  });
+  return Array.from(uniqueTaskNames).sort();
+}
 function addTasksToGraph(tasksQueue, dataPerLocation, location) {
   const data = dataPerLocation.find(d => d.location === location);
   if (!data) return;

package/dist/build-pipeline-order.js.map

@@ -1 +1 @@
-{"version":3,"names":["_graph","data","require","_buildTask","_tasksQueue","_legacy","calculatePipelineOrder","taskSlot","envs","pipeNameOnEnv","tasks","skipTests","skipTasks","graphs","locations","forEach","location","push","graph","Graph","pipelineEnvs","envDefinition","pipeline","getPipelineForEnv","env","flattenedPipeline","map","pipelineEnv","flat","task","addDependenciesToGraph","dataPerLocation","pipelineEnvsPerLocation","filter","tasksQueue","TasksQueue","addTasksToGraph","length","includes","name","aspectId","Extensions","tester","find","d","sorted","toposort","taskNode","BuildTaskHelper","deserializeId","attr","taskIndex","findIndex","pipelineTask","splice","dependencies","taskId","serializeId","dependency","deserializeIdAllowEmptyName","dependencyTasks","Error","dependencyTask","getLocation","graphLocation","g","dependencyId","setNode","Node","setEdge","Edge","taskLocation","dependencyLocation","isDependencyAhead","isDependencyEqual","buildTasks","slotsTasks","values","tasksAtStart","tasksAtEnd","mergedTasks"],"sources":["build-pipeline-order.ts"],"sourcesContent":["import { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport type { EnvDefinition, Environment } from '@teambit/envs';\nimport type { BuildTask } from './build-task';\nimport { BuildTaskHelper } from './build-task';\nimport type { TaskSlot } from './builder.main.runtime';\nimport { TasksQueue } from './tasks-queue';\nimport type { PipeFunctionNames } from './builder.service';\nimport { Extensions } from '@teambit/legacy.constants';\n\ntype TaskDependenciesGraph = Graph<string, string>;\ntype Location = 'start' | 'middle' | 'end';\ntype TasksLocationGraph = { location: Location; graph: TaskDependenciesGraph };\ntype PipelineEnv = { env: EnvDefinition; pipeline: BuildTask[] };\ntype DataPerLocation = { location: Location; graph: TaskDependenciesGraph; pipelineEnvs: PipelineEnv[] };\n\n/**\n * there are two ways how to add tasks to build pipeline.\n * 1. `getBuildPipe()` method of the env.\n * 2. registering to the `builder.registerBuildTask()`.\n *\n * in the option #1, it's possible to determine the order. e.g. `getBuildPipe() { return [taskA, taskB, taskC]; }`\n * in the option #2, the register happens once the extension is loaded, so there is no way to put\n * one task before/after another task.\n *\n * To be able to determine the order, you can do the following\n * 1. \"task.location\", it has two options \"start\" and \"end\". the rest are \"middle\".\n * 2. \"task.dependencies\", the dependencies must be completed for all envs before this task starts.\n * the dependencies are applicable inside a location and not across locations. see getLocation()\n * or/and continue reading for more info about this.\n *\n * to determine the final order of the tasks, the following is done:\n * 1. split all tasks to three groups: start, middle and end.\n * 2. for each group define a dependencies graph for the tasks with \"dependencies\" prop and the pipeline.\n * 3. start with the first group \"start\", toposort the dependencies graph and push the found tasks\n * to a queue. once completed, iterate the pipeline and add all tasks to the queue.\n * 4. do the same for the \"middle\" and \"end\" groups.\n *\n * the reason for splitting the tasks to the three groups and not using the \"dependencies\" field\n * alone to determine the order is that the \"start\" and \"end\" groups are mostly core and \"middle\"\n * is mostly the user entering tasks to the pipeline and we as the core don't know about the users\n * tasks. For example, a core task \"PublishComponent\" must happen after the compiler, however, a\n * user might have an env without a compiler. if we determine the order only by the dependencies\n * field, the \"PublishComponent\" would have a dependency \"compiler\" and because in this case there\n * is no compiler task, it would throw an error about missing dependencies.\n */\nexport function calculatePipelineOrder(\n  taskSlot: TaskSlot,\n  envs: EnvDefinition[],\n  pipeNameOnEnv: PipeFunctionNames,\n  tasks: string[] = [],\n  skipTests = false,\n  skipTasks: string[] = []\n): TasksQueue {\n  const graphs: TasksLocationGraph[] = [];\n  const locations: Location[] = ['start', 'middle', 'end']; // the order is important here!\n  locations.forEach((location) => {\n    graphs.push({ location, graph: new Graph<string, string>() });\n  });\n  const pipelineEnvs: PipelineEnv[] = [];\n  envs.forEach((envDefinition) => {\n    const pipeline = getPipelineForEnv(taskSlot, envDefinition.env, pipeNameOnEnv);\n    pipelineEnvs.push({ env: envDefinition, pipeline });\n  });\n\n  const flattenedPipeline: BuildTask[] = pipelineEnvs.map((pipelineEnv) => pipelineEnv.pipeline).flat();\n  flattenedPipeline.forEach((task) => addDependenciesToGraph(graphs, flattenedPipeline, task));\n\n  const dataPerLocation: DataPerLocation[] = graphs.map(({ location, graph }) => {\n    const pipelineEnvsPerLocation: PipelineEnv[] = pipelineEnvs.map(({ env, pipeline }) => {\n      return { env, pipeline: pipeline.filter((task) => (task.location || 'middle') === location) };\n    });\n    return { location, graph, pipelineEnvs: pipelineEnvsPerLocation };\n  });\n\n  let tasksQueue = new TasksQueue();\n  locations.forEach((location) => addTasksToGraph(tasksQueue, dataPerLocation, location));\n  if (tasks.length) {\n    tasksQueue = new TasksQueue(\n      ...tasksQueue.filter(({ task }) => tasks.includes(task.name) || tasks.includes(task.aspectId))\n    );\n  }\n  if (skipTests) {\n    tasksQueue = new TasksQueue(...tasksQueue.filter(({ task }) => task.aspectId !== Extensions.tester));\n  }\n  if (skipTasks.length) {\n    tasksQueue = new TasksQueue(\n      ...tasksQueue.filter(({ task }) => !skipTasks.includes(task.name) && !skipTasks.includes(task.aspectId))\n    );\n  }\n\n  return tasksQueue;\n}\n\nfunction addTasksToGraph(tasksQueue: TasksQueue, dataPerLocation: DataPerLocation[], location: Location) {\n  const data = dataPerLocation.find((d) => d.location === location);\n  if (!data) return;\n  const sorted = data.graph.toposort();\n  sorted.forEach((taskNode) => {\n    const { aspectId, name } = BuildTaskHelper.deserializeId(taskNode.attr);\n    data.pipelineEnvs.forEach(({ env, pipeline }) => {\n      const taskIndex = pipeline.findIndex(\n        (pipelineTask) => pipelineTask.aspectId === aspectId && pipelineTask.name === name\n      );\n      if (taskIndex < 0) return;\n      const task = pipeline[taskIndex];\n      tasksQueue.push({ env, task });\n      pipeline.splice(taskIndex, 1); // delete the task from the pipeline\n    });\n  });\n  data.pipelineEnvs.forEach(({ env, pipeline }) => {\n    pipeline.forEach((task) => tasksQueue.push({ env, task }));\n  });\n}\n\nfunction addDependenciesToGraph(graphs: TasksLocationGraph[], pipeline: BuildTask[], task: BuildTask) {\n  if (!task.dependencies || !task.dependencies.length) return;\n  const taskId = BuildTaskHelper.serializeId(task);\n  task.dependencies.forEach((dependency) => {\n    const { aspectId, name } = BuildTaskHelper.deserializeIdAllowEmptyName(dependency);\n    const dependencyTasks = pipeline.filter((pipelineTask) => {\n      if (pipelineTask.aspectId !== aspectId) return false;\n      return name ? name === pipelineTask.name : true;\n    });\n    if (dependencyTasks.length === 0) {\n      throw new Error(\n        `Pipeline error - missing task dependency \"${dependency}\" of the \"${BuildTaskHelper.serializeId(task)}\"`\n      );\n    }\n    dependencyTasks.forEach((dependencyTask) => {\n      const location = getLocation(task, dependencyTask);\n      if (!location) {\n        // the dependency is behind and will be in the correct order regardless the graph.\n        return;\n      }\n      const graphLocation = graphs.find((g) => g.location === location);\n      if (!graphLocation) throw new Error(`unable to find graph for location ${location}`);\n      const dependencyId = BuildTaskHelper.serializeId(dependencyTask);\n      const graph = graphLocation.graph;\n      graph.setNode(new Node(taskId, taskId));\n      graph.setNode(new Node(dependencyId, dependencyId));\n      graph.setEdge(new Edge(dependencyId, taskId, 'dependency'));\n    });\n  });\n}\n\n/**\n * since the task execution is happening per group: \"start\", \"middle\" and \"end\", the dependencies\n * need to be inside the same group.\n * e.g. if a dependency located at \"end\" group and the task located at \"start\", it's impossible to\n * complete the dependency before the task, there it throws an error.\n * it's ok to have the dependency located earlier, e.g. \"start\" and the task at \"end\", and in this\n * case, it will not be part of the graph because there is no need to do any special calculation.\n */\nfunction getLocation(task: BuildTask, dependencyTask: BuildTask): Location | null {\n  const taskLocation = task.location || 'middle';\n  const dependencyLocation = dependencyTask.location || 'middle';\n\n  const isDependencyAhead =\n    (taskLocation === 'start' && dependencyLocation !== 'start') ||\n    (taskLocation === 'middle' && dependencyLocation === 'end');\n\n  const isDependencyEqual = taskLocation === dependencyLocation;\n\n  if (isDependencyAhead) {\n    throw new Error(`a task \"${BuildTaskHelper.serializeId(task)}\" located at ${taskLocation}\nhas a dependency \"${BuildTaskHelper.serializeId(dependencyTask)} located at ${dependencyLocation},\nwhich is invalid. the dependency must be located earlier or in the same location as the task\"`);\n  }\n\n  if (isDependencyEqual) {\n    return taskLocation;\n  }\n\n  // dependency is behind. e.g. task is \"end\" and dependency is \"start\". no need to enter to the\n  // graph as it's going to be executed in the right order regardless the graph.\n  return null;\n}\n\nfunction getPipelineForEnv(taskSlot: TaskSlot, env: Environment, pipeNameOnEnv: string): BuildTask[] {\n  const buildTasks: BuildTask[] = env[pipeNameOnEnv] ? env[pipeNameOnEnv]() : [];\n  const slotsTasks = taskSlot.values().flat();\n  const tasksAtStart: BuildTask[] = [];\n  const tasksAtEnd: BuildTask[] = [];\n  slotsTasks.forEach((task) => {\n    if (task.location === 'start') {\n      tasksAtStart.push(task);\n      return;\n    }\n    if (task.location === 'end') {\n      tasksAtEnd.push(task);\n      return;\n    }\n    tasksAtStart.push(task);\n  });\n\n  // merge with extension registered tasks.\n  const mergedTasks = [...tasksAtStart, ...buildTasks, ...tasksAtEnd];\n\n  return mergedTasks;\n}\n"],"mappings":";;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAGA,SAAAE,WAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,UAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAG,YAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,WAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAI,QAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,OAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAQA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASK,sBAAsBA,CACpCC,QAAkB,EAClBC,IAAqB,EACrBC,aAAgC,EAChCC,KAAe,GAAG,EAAE,EACpBC,SAAS,GAAG,KAAK,EACjBC,SAAmB,GAAG,EAAE,EACZ;EACZ,MAAMC,MAA4B,GAAG,EAAE;EACvC,MAAMC,SAAqB,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;EAC1DA,SAAS,CAACC,OAAO,CAAEC,QAAQ,IAAK;IAC9BH,MAAM,CAACI,IAAI,CAAC;MAAED,QAAQ;MAAEE,KAAK,EAAE,KAAIC,cAAK,EAAiB;IAAE,CAAC,CAAC;EAC/D,CAAC,CAAC;EACF,MAAMC,YAA2B,GAAG,EAAE;EACtCZ,IAAI,CAACO,OAAO,CAAEM,aAAa,IAAK;IAC9B,MAAMC,QAAQ,GAAGC,iBAAiB,CAAChB,QAAQ,EAAEc,aAAa,CAACG,GAAG,EAAEf,aAAa,CAAC;IAC9EW,YAAY,CAACH,IAAI,CAAC;MAAEO,GAAG,EAAEH,aAAa;MAAEC;IAAS,CAAC,CAAC;EACrD,CAAC,CAAC;EAEF,MAAMG,iBAA8B,GAAGL,YAAY,CAACM,GAAG,CAAEC,WAAW,IAAKA,WAAW,CAACL,QAAQ,CAAC,CAACM,IAAI,CAAC,CAAC;EACrGH,iBAAiB,CAACV,OAAO,CAAEc,IAAI,IAAKC,sBAAsB,CAACjB,MAAM,EAAEY,iBAAiB,EAAEI,IAAI,CAAC,CAAC;EAE5F,MAAME,eAAkC,GAAGlB,MAAM,CAACa,GAAG,CAAC,CAAC;IAAEV,QAAQ;IAAEE;EAAM,CAAC,KAAK;IAC7E,MAAMc,uBAAsC,GAAGZ,YAAY,CAACM,GAAG,CAAC,CAAC;MAAEF,GAAG;MAAEF;IAAS,CAAC,KAAK;MACrF,OAAO;QAAEE,GAAG;QAAEF,QAAQ,EAAEA,QAAQ,CAACW,MAAM,CAAEJ,IAAI,IAAK,CAACA,IAAI,CAACb,QAAQ,IAAI,QAAQ,MAAMA,QAAQ;MAAE,CAAC;IAC/F,CAAC,CAAC;IACF,OAAO;MAAEA,QAAQ;MAAEE,KAAK;MAAEE,YAAY,EAAEY;IAAwB,CAAC;EACnE,CAAC,CAAC;EAEF,IAAIE,UAAU,GAAG,KAAIC,wBAAU,EAAC,CAAC;EACjCrB,SAAS,CAACC,OAAO,CAAEC,QAAQ,IAAKoB,eAAe,CAACF,UAAU,EAAEH,eAAe,EAAEf,QAAQ,CAAC,CAAC;EACvF,IAAIN,KAAK,CAAC2B,MAAM,EAAE;IAChBH,UAAU,GAAG,KAAIC,wBAAU,EACzB,GAAGD,UAAU,CAACD,MAAM,CAAC,CAAC;MAAEJ;IAAK,CAAC,KAAKnB,KAAK,CAAC4B,QAAQ,CAACT,IAAI,CAACU,IAAI,CAAC,IAAI7B,KAAK,CAAC4B,QAAQ,CAACT,IAAI,CAACW,QAAQ,CAAC,CAC/F,CAAC;EACH;EACA,IAAI7B,SAAS,EAAE;IACbuB,UAAU,GAAG,KAAIC,wBAAU,EAAC,GAAGD,UAAU,CAACD,MAAM,CAAC,CAAC;MAAEJ;IAAK,CAAC,KAAKA,IAAI,CAACW,QAAQ,KAAKC,oBAAU,CAACC,MAAM,CAAC,CAAC;EACtG;EACA,IAAI9B,SAAS,CAACyB,MAAM,EAAE;IACpBH,UAAU,GAAG,KAAIC,wBAAU,EACzB,GAAGD,UAAU,CAACD,MAAM,CAAC,CAAC;MAAEJ;IAAK,CAAC,KAAK,CAACjB,SAAS,CAAC0B,QAAQ,CAACT,IAAI,CAACU,IAAI,CAAC,IAAI,CAAC3B,SAAS,CAAC0B,QAAQ,CAACT,IAAI,CAACW,QAAQ,CAAC,CACzG,CAAC;EACH;EAEA,OAAON,UAAU;AACnB;AAEA,SAASE,eAAeA,CAACF,UAAsB,EAAEH,eAAkC,EAAEf,QAAkB,EAAE;EACvG,MAAMf,IAAI,GAAG8B,eAAe,CAACY,IAAI,CAAEC,CAAC,IAAKA,CAAC,CAAC5B,QAAQ,KAAKA,QAAQ,CAAC;EACjE,IAAI,CAACf,IAAI,EAAE;EACX,MAAM4C,MAAM,GAAG5C,IAAI,CAACiB,KAAK,CAAC4B,QAAQ,CAAC,CAAC;EACpCD,MAAM,CAAC9B,OAAO,CAAEgC,QAAQ,IAAK;IAC3B,MAAM;MAAEP,QAAQ;MAAED;IAAK,CAAC,GAAGS,4BAAe,CAACC,aAAa,CAACF,QAAQ,CAACG,IAAI,CAAC;IACvEjD,IAAI,CAACmB,YAAY,CAACL,OAAO,CAAC,CAAC;MAAES,GAAG;MAAEF;IAAS,CAAC,KAAK;MAC/C,MAAM6B,SAAS,GAAG7B,QAAQ,CAAC8B,SAAS,CACjCC,YAAY,IAAKA,YAAY,CAACb,QAAQ,KAAKA,QAAQ,IAAIa,YAAY,CAACd,IAAI,KAAKA,IAChF,CAAC;MACD,IAAIY,SAAS,GAAG,CAAC,EAAE;MACnB,MAAMtB,IAAI,GAAGP,QAAQ,CAAC6B,SAAS,CAAC;MAChCjB,UAAU,CAACjB,IAAI,CAAC;QAAEO,GAAG;QAAEK;MAAK,CAAC,CAAC;MAC9BP,QAAQ,CAACgC,MAAM,CAACH,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC;EACJ,CAAC,CAAC;EACFlD,IAAI,CAACmB,YAAY,CAACL,OAAO,CAAC,CAAC;IAAES,GAAG;IAAEF;EAAS,CAAC,KAAK;IAC/CA,QAAQ,CAACP,OAAO,CAAEc,IAAI,IAAKK,UAAU,CAACjB,IAAI,CAAC;MAAEO,GAAG;MAAEK;IAAK,CAAC,CAAC,CAAC;EAC5D,CAAC,CAAC;AACJ;AAEA,SAASC,sBAAsBA,CAACjB,MAA4B,EAAES,QAAqB,EAAEO,IAAe,EAAE;EACpG,IAAI,CAACA,IAAI,CAAC0B,YAAY,IAAI,CAAC1B,IAAI,CAAC0B,YAAY,CAAClB,MAAM,EAAE;EACrD,MAAMmB,MAAM,GAAGR,4BAAe,CAACS,WAAW,CAAC5B,IAAI,CAAC;EAChDA,IAAI,CAAC0B,YAAY,CAACxC,OAAO,CAAE2C,UAAU,IAAK;IACxC,MAAM;MAAElB,QAAQ;MAAED;IAAK,CAAC,GAAGS,4BAAe,CAACW,2BAA2B,CAACD,UAAU,CAAC;IAClF,MAAME,eAAe,GAAGtC,QAAQ,CAACW,MAAM,CAAEoB,YAAY,IAAK;MACxD,IAAIA,YAAY,CAACb,QAAQ,KAAKA,QAAQ,EAAE,OAAO,KAAK;MACpD,OAAOD,IAAI,GAAGA,IAAI,KAAKc,YAAY,CAACd,IAAI,GAAG,IAAI;IACjD,CAAC,CAAC;IACF,IAAIqB,eAAe,CAACvB,MAAM,KAAK,CAAC,EAAE;MAChC,MAAM,IAAIwB,KAAK,CACb,6CAA6CH,UAAU,aAAaV,4BAAe,CAACS,WAAW,CAAC5B,IAAI,CAAC,GACvG,CAAC;IACH;IACA+B,eAAe,CAAC7C,OAAO,CAAE+C,cAAc,IAAK;MAC1C,MAAM9C,QAAQ,GAAG+C,WAAW,CAAClC,IAAI,EAAEiC,cAAc,CAAC;MAClD,IAAI,CAAC9C,QAAQ,EAAE;QACb;QACA;MACF;MACA,MAAMgD,aAAa,GAAGnD,MAAM,CAAC8B,IAAI,CAAEsB,CAAC,IAAKA,CAAC,CAACjD,QAAQ,KAAKA,QAAQ,CAAC;MACjE,IAAI,CAACgD,aAAa,EAAE,MAAM,IAAIH,KAAK,CAAC,qCAAqC7C,QAAQ,EAAE,CAAC;MACpF,MAAMkD,YAAY,GAAGlB,4BAAe,CAACS,WAAW,CAACK,cAAc,CAAC;MAChE,MAAM5C,KAAK,GAAG8C,aAAa,CAAC9C,KAAK;MACjCA,KAAK,CAACiD,OAAO,CAAC,KAAIC,aAAI,EAACZ,MAAM,EAAEA,MAAM,CAAC,CAAC;MACvCtC,KAAK,CAACiD,OAAO,CAAC,KAAIC,aAAI,EAACF,YAAY,EAAEA,YAAY,CAAC,CAAC;MACnDhD,KAAK,CAACmD,OAAO,CAAC,KAAIC,aAAI,EAACJ,YAAY,EAAEV,MAAM,EAAE,YAAY,CAAC,CAAC;IAC7D,CAAC,CAAC;EACJ,CAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASO,WAAWA,CAAClC,IAAe,EAAEiC,cAAyB,EAAmB;EAChF,MAAMS,YAAY,GAAG1C,IAAI,CAACb,QAAQ,IAAI,QAAQ;EAC9C,MAAMwD,kBAAkB,GAAGV,cAAc,CAAC9C,QAAQ,IAAI,QAAQ;EAE9D,MAAMyD,iBAAiB,GACpBF,YAAY,KAAK,OAAO,IAAIC,kBAAkB,KAAK,OAAO,IAC1DD,YAAY,KAAK,QAAQ,IAAIC,kBAAkB,KAAK,KAAM;EAE7D,MAAME,iBAAiB,GAAGH,YAAY,KAAKC,kBAAkB;EAE7D,IAAIC,iBAAiB,EAAE;IACrB,MAAM,IAAIZ,KAAK,CAAC,WAAWb,4BAAe,CAACS,WAAW,CAAC5B,IAAI,CAAC,gBAAgB0C,YAAY;AAC5F,oBAAoBvB,4BAAe,CAACS,WAAW,CAACK,cAAc,CAAC,eAAeU,kBAAkB;AAChG,8FAA8F,CAAC;EAC7F;EAEA,IAAIE,iBAAiB,EAAE;IACrB,OAAOH,YAAY;EACrB;;EAEA;EACA;EACA,OAAO,IAAI;AACb;AAEA,SAAShD,iBAAiBA,CAAChB,QAAkB,EAAEiB,GAAgB,EAAEf,aAAqB,EAAe;EACnG,MAAMkE,UAAuB,GAAGnD,GAAG,CAACf,aAAa,CAAC,GAAGe,GAAG,CAACf,aAAa,CAAC,CAAC,CAAC,GAAG,EAAE;EAC9E,MAAMmE,UAAU,GAAGrE,QAAQ,CAACsE,MAAM,CAAC,CAAC,CAACjD,IAAI,CAAC,CAAC;EAC3C,MAAMkD,YAAyB,GAAG,EAAE;EACpC,MAAMC,UAAuB,GAAG,EAAE;EAClCH,UAAU,CAAC7D,OAAO,CAAEc,IAAI,IAAK;IAC3B,IAAIA,IAAI,CAACb,QAAQ,KAAK,OAAO,EAAE;MAC7B8D,YAAY,CAAC7D,IAAI,CAACY,IAAI,CAAC;MACvB;IACF;IACA,IAAIA,IAAI,CAACb,QAAQ,KAAK,KAAK,EAAE;MAC3B+D,UAAU,CAAC9D,IAAI,CAACY,IAAI,CAAC;MACrB;IACF;IACAiD,YAAY,CAAC7D,IAAI,CAACY,IAAI,CAAC;EACzB,CAAC,CAAC;;EAEF;EACA,MAAMmD,WAAW,GAAG,CAAC,GAAGF,YAAY,EAAE,GAAGH,UAAU,EAAE,GAAGI,UAAU,CAAC;EAEnE,OAAOC,WAAW;AACpB","ignoreList":[]}
+{"version":3,"names":["_graph","data","require","_buildTask","_tasksQueue","_legacy","calculatePipelineOrder","taskSlot","envs","pipeNameOnEnv","tasks","skipTests","skipTasks","graphs","locations","forEach","location","push","graph","Graph","pipelineEnvs","envDefinition","pipeline","getPipelineForEnv","env","flattenedPipeline","map","pipelineEnv","flat","task","addDependenciesToGraph","dataPerLocation","pipelineEnvsPerLocation","filter","tasksQueue","TasksQueue","addTasksToGraph","length","originalLength","includes","name","aspectId","Error","join","getAvailableTaskNames","Extensions","tester","uniqueTaskNames","Set","add","Array","from","sort","find","d","sorted","toposort","taskNode","BuildTaskHelper","deserializeId","attr","taskIndex","findIndex","pipelineTask","splice","dependencies","taskId","serializeId","dependency","deserializeIdAllowEmptyName","dependencyTasks","dependencyTask","getLocation","graphLocation","g","dependencyId","setNode","Node","setEdge","Edge","taskLocation","dependencyLocation","isDependencyAhead","isDependencyEqual","buildTasks","slotsTasks","values","tasksAtStart","tasksAtEnd","mergedTasks"],"sources":["build-pipeline-order.ts"],"sourcesContent":["import { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport type { EnvDefinition, Environment } from '@teambit/envs';\nimport type { BuildTask } from './build-task';\nimport { BuildTaskHelper } from './build-task';\nimport type { TaskSlot } from './builder.main.runtime';\nimport { TasksQueue } from './tasks-queue';\nimport type { PipeFunctionNames } from './builder.service';\nimport { Extensions } from '@teambit/legacy.constants';\n\ntype TaskDependenciesGraph = Graph<string, string>;\ntype Location = 'start' | 'middle' | 'end';\ntype TasksLocationGraph = { location: Location; graph: TaskDependenciesGraph };\ntype PipelineEnv = { env: EnvDefinition; pipeline: BuildTask[] };\ntype DataPerLocation = { location: Location; graph: TaskDependenciesGraph; pipelineEnvs: PipelineEnv[] };\n\n/**\n * there are two ways how to add tasks to build pipeline.\n * 1. `getBuildPipe()` method of the env.\n * 2. registering to the `builder.registerBuildTask()`.\n *\n * in the option #1, it's possible to determine the order. e.g. `getBuildPipe() { return [taskA, taskB, taskC]; }`\n * in the option #2, the register happens once the extension is loaded, so there is no way to put\n * one task before/after another task.\n *\n * To be able to determine the order, you can do the following\n * 1. \"task.location\", it has two options \"start\" and \"end\". the rest are \"middle\".\n * 2. \"task.dependencies\", the dependencies must be completed for all envs before this task starts.\n * the dependencies are applicable inside a location and not across locations. see getLocation()\n * or/and continue reading for more info about this.\n *\n * to determine the final order of the tasks, the following is done:\n * 1. split all tasks to three groups: start, middle and end.\n * 2. for each group define a dependencies graph for the tasks with \"dependencies\" prop and the pipeline.\n * 3. start with the first group \"start\", toposort the dependencies graph and push the found tasks\n * to a queue. once completed, iterate the pipeline and add all tasks to the queue.\n * 4. do the same for the \"middle\" and \"end\" groups.\n *\n * the reason for splitting the tasks to the three groups and not using the \"dependencies\" field\n * alone to determine the order is that the \"start\" and \"end\" groups are mostly core and \"middle\"\n * is mostly the user entering tasks to the pipeline and we as the core don't know about the users\n * tasks. For example, a core task \"PublishComponent\" must happen after the compiler, however, a\n * user might have an env without a compiler. if we determine the order only by the dependencies\n * field, the \"PublishComponent\" would have a dependency \"compiler\" and because in this case there\n * is no compiler task, it would throw an error about missing dependencies.\n */\nexport function calculatePipelineOrder(\n  taskSlot: TaskSlot,\n  envs: EnvDefinition[],\n  pipeNameOnEnv: PipeFunctionNames,\n  tasks: string[] = [],\n  skipTests = false,\n  skipTasks: string[] = []\n): TasksQueue {\n  const graphs: TasksLocationGraph[] = [];\n  const locations: Location[] = ['start', 'middle', 'end']; // the order is important here!\n  locations.forEach((location) => {\n    graphs.push({ location, graph: new Graph<string, string>() });\n  });\n  const pipelineEnvs: PipelineEnv[] = [];\n  envs.forEach((envDefinition) => {\n    const pipeline = getPipelineForEnv(taskSlot, envDefinition.env, pipeNameOnEnv);\n    pipelineEnvs.push({ env: envDefinition, pipeline });\n  });\n\n  const flattenedPipeline: BuildTask[] = pipelineEnvs.map((pipelineEnv) => pipelineEnv.pipeline).flat();\n  flattenedPipeline.forEach((task) => addDependenciesToGraph(graphs, flattenedPipeline, task));\n\n  const dataPerLocation: DataPerLocation[] = graphs.map(({ location, graph }) => {\n    const pipelineEnvsPerLocation: PipelineEnv[] = pipelineEnvs.map(({ env, pipeline }) => {\n      return { env, pipeline: pipeline.filter((task) => (task.location || 'middle') === location) };\n    });\n    return { location, graph, pipelineEnvs: pipelineEnvsPerLocation };\n  });\n\n  let tasksQueue = new TasksQueue();\n  locations.forEach((location) => addTasksToGraph(tasksQueue, dataPerLocation, location));\n  if (tasks.length) {\n    const originalLength = tasksQueue.length;\n    tasksQueue = new TasksQueue(\n      ...tasksQueue.filter(({ task }) => tasks.includes(task.name) || tasks.includes(task.aspectId))\n    );\n    if (tasksQueue.length === 0 && originalLength > 0) {\n      throw new Error(\n        `Pipeline error - no tasks found matching the specified filter: \"${tasks.join(', ')}\". Available tasks: ${getAvailableTaskNames(flattenedPipeline).join(', ')}`\n      );\n    }\n  }\n  if (skipTests) {\n    tasksQueue = new TasksQueue(...tasksQueue.filter(({ task }) => task.aspectId !== Extensions.tester));\n  }\n  if (skipTasks.length) {\n    tasksQueue = new TasksQueue(\n      ...tasksQueue.filter(({ task }) => !skipTasks.includes(task.name) && !skipTasks.includes(task.aspectId))\n    );\n  }\n\n  return tasksQueue;\n}\n\nfunction getAvailableTaskNames(tasks: BuildTask[]): string[] {\n  const uniqueTaskNames = new Set<string>();\n  tasks.forEach((task) => {\n    uniqueTaskNames.add(task.name);\n    uniqueTaskNames.add(task.aspectId);\n  });\n  return Array.from(uniqueTaskNames).sort();\n}\n\nfunction addTasksToGraph(tasksQueue: TasksQueue, dataPerLocation: DataPerLocation[], location: Location) {\n  const data = dataPerLocation.find((d) => d.location === location);\n  if (!data) return;\n  const sorted = data.graph.toposort();\n  sorted.forEach((taskNode) => {\n    const { aspectId, name } = BuildTaskHelper.deserializeId(taskNode.attr);\n    data.pipelineEnvs.forEach(({ env, pipeline }) => {\n      const taskIndex = pipeline.findIndex(\n        (pipelineTask) => pipelineTask.aspectId === aspectId && pipelineTask.name === name\n      );\n      if (taskIndex < 0) return;\n      const task = pipeline[taskIndex];\n      tasksQueue.push({ env, task });\n      pipeline.splice(taskIndex, 1); // delete the task from the pipeline\n    });\n  });\n  data.pipelineEnvs.forEach(({ env, pipeline }) => {\n    pipeline.forEach((task) => tasksQueue.push({ env, task }));\n  });\n}\n\nfunction addDependenciesToGraph(graphs: TasksLocationGraph[], pipeline: BuildTask[], task: BuildTask) {\n  if (!task.dependencies || !task.dependencies.length) return;\n  const taskId = BuildTaskHelper.serializeId(task);\n  task.dependencies.forEach((dependency) => {\n    const { aspectId, name } = BuildTaskHelper.deserializeIdAllowEmptyName(dependency);\n    const dependencyTasks = pipeline.filter((pipelineTask) => {\n      if (pipelineTask.aspectId !== aspectId) return false;\n      return name ? name === pipelineTask.name : true;\n    });\n    if (dependencyTasks.length === 0) {\n      throw new Error(\n        `Pipeline error - missing task dependency \"${dependency}\" of the \"${BuildTaskHelper.serializeId(task)}\"`\n      );\n    }\n    dependencyTasks.forEach((dependencyTask) => {\n      const location = getLocation(task, dependencyTask);\n      if (!location) {\n        // the dependency is behind and will be in the correct order regardless the graph.\n        return;\n      }\n      const graphLocation = graphs.find((g) => g.location === location);\n      if (!graphLocation) throw new Error(`unable to find graph for location ${location}`);\n      const dependencyId = BuildTaskHelper.serializeId(dependencyTask);\n      const graph = graphLocation.graph;\n      graph.setNode(new Node(taskId, taskId));\n      graph.setNode(new Node(dependencyId, dependencyId));\n      graph.setEdge(new Edge(dependencyId, taskId, 'dependency'));\n    });\n  });\n}\n\n/**\n * since the task execution is happening per group: \"start\", \"middle\" and \"end\", the dependencies\n * need to be inside the same group.\n * e.g. if a dependency located at \"end\" group and the task located at \"start\", it's impossible to\n * complete the dependency before the task, there it throws an error.\n * it's ok to have the dependency located earlier, e.g. \"start\" and the task at \"end\", and in this\n * case, it will not be part of the graph because there is no need to do any special calculation.\n */\nfunction getLocation(task: BuildTask, dependencyTask: BuildTask): Location | null {\n  const taskLocation = task.location || 'middle';\n  const dependencyLocation = dependencyTask.location || 'middle';\n\n  const isDependencyAhead =\n    (taskLocation === 'start' && dependencyLocation !== 'start') ||\n    (taskLocation === 'middle' && dependencyLocation === 'end');\n\n  const isDependencyEqual = taskLocation === dependencyLocation;\n\n  if (isDependencyAhead) {\n    throw new Error(`a task \"${BuildTaskHelper.serializeId(task)}\" located at ${taskLocation}\nhas a dependency \"${BuildTaskHelper.serializeId(dependencyTask)} located at ${dependencyLocation},\nwhich is invalid. the dependency must be located earlier or in the same location as the task\"`);\n  }\n\n  if (isDependencyEqual) {\n    return taskLocation;\n  }\n\n  // dependency is behind. e.g. task is \"end\" and dependency is \"start\". no need to enter to the\n  // graph as it's going to be executed in the right order regardless the graph.\n  return null;\n}\n\nfunction getPipelineForEnv(taskSlot: TaskSlot, env: Environment, pipeNameOnEnv: string): BuildTask[] {\n  const buildTasks: BuildTask[] = env[pipeNameOnEnv] ? env[pipeNameOnEnv]() : [];\n  const slotsTasks = taskSlot.values().flat();\n  const tasksAtStart: BuildTask[] = [];\n  const tasksAtEnd: BuildTask[] = [];\n  slotsTasks.forEach((task) => {\n    if (task.location === 'start') {\n      tasksAtStart.push(task);\n      return;\n    }\n    if (task.location === 'end') {\n      tasksAtEnd.push(task);\n      return;\n    }\n    tasksAtStart.push(task);\n  });\n\n  // merge with extension registered tasks.\n  const mergedTasks = [...tasksAtStart, ...buildTasks, ...tasksAtEnd];\n\n  return mergedTasks;\n}\n"],"mappings":";;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAGA,SAAAE,WAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,UAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAG,YAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,WAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAI,QAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,OAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAQA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASK,sBAAsBA,CACpCC,QAAkB,EAClBC,IAAqB,EACrBC,aAAgC,EAChCC,KAAe,GAAG,EAAE,EACpBC,SAAS,GAAG,KAAK,EACjBC,SAAmB,GAAG,EAAE,EACZ;EACZ,MAAMC,MAA4B,GAAG,EAAE;EACvC,MAAMC,SAAqB,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;EAC1DA,SAAS,CAACC,OAAO,CAAEC,QAAQ,IAAK;IAC9BH,MAAM,CAACI,IAAI,CAAC;MAAED,QAAQ;MAAEE,KAAK,EAAE,KAAIC,cAAK,EAAiB;IAAE,CAAC,CAAC;EAC/D,CAAC,CAAC;EACF,MAAMC,YAA2B,GAAG,EAAE;EACtCZ,IAAI,CAACO,OAAO,CAAEM,aAAa,IAAK;IAC9B,MAAMC,QAAQ,GAAGC,iBAAiB,CAAChB,QAAQ,EAAEc,aAAa,CAACG,GAAG,EAAEf,aAAa,CAAC;IAC9EW,YAAY,CAACH,IAAI,CAAC;MAAEO,GAAG,EAAEH,aAAa;MAAEC;IAAS,CAAC,CAAC;EACrD,CAAC,CAAC;EAEF,MAAMG,iBAA8B,GAAGL,YAAY,CAACM,GAAG,CAAEC,WAAW,IAAKA,WAAW,CAACL,QAAQ,CAAC,CAACM,IAAI,CAAC,CAAC;EACrGH,iBAAiB,CAACV,OAAO,CAAEc,IAAI,IAAKC,sBAAsB,CAACjB,MAAM,EAAEY,iBAAiB,EAAEI,IAAI,CAAC,CAAC;EAE5F,MAAME,eAAkC,GAAGlB,MAAM,CAACa,GAAG,CAAC,CAAC;IAAEV,QAAQ;IAAEE;EAAM,CAAC,KAAK;IAC7E,MAAMc,uBAAsC,GAAGZ,YAAY,CAACM,GAAG,CAAC,CAAC;MAAEF,GAAG;MAAEF;IAAS,CAAC,KAAK;MACrF,OAAO;QAAEE,GAAG;QAAEF,QAAQ,EAAEA,QAAQ,CAACW,MAAM,CAAEJ,IAAI,IAAK,CAACA,IAAI,CAACb,QAAQ,IAAI,QAAQ,MAAMA,QAAQ;MAAE,CAAC;IAC/F,CAAC,CAAC;IACF,OAAO;MAAEA,QAAQ;MAAEE,KAAK;MAAEE,YAAY,EAAEY;IAAwB,CAAC;EACnE,CAAC,CAAC;EAEF,IAAIE,UAAU,GAAG,KAAIC,wBAAU,EAAC,CAAC;EACjCrB,SAAS,CAACC,OAAO,CAAEC,QAAQ,IAAKoB,eAAe,CAACF,UAAU,EAAEH,eAAe,EAAEf,QAAQ,CAAC,CAAC;EACvF,IAAIN,KAAK,CAAC2B,MAAM,EAAE;IAChB,MAAMC,cAAc,GAAGJ,UAAU,CAACG,MAAM;IACxCH,UAAU,GAAG,KAAIC,wBAAU,EACzB,GAAGD,UAAU,CAACD,MAAM,CAAC,CAAC;MAAEJ;IAAK,CAAC,KAAKnB,KAAK,CAAC6B,QAAQ,CAACV,IAAI,CAACW,IAAI,CAAC,IAAI9B,KAAK,CAAC6B,QAAQ,CAACV,IAAI,CAACY,QAAQ,CAAC,CAC/F,CAAC;IACD,IAAIP,UAAU,CAACG,MAAM,KAAK,CAAC,IAAIC,cAAc,GAAG,CAAC,EAAE;MACjD,MAAM,IAAII,KAAK,CACb,mEAAmEhC,KAAK,CAACiC,IAAI,CAAC,IAAI,CAAC,uBAAuBC,qBAAqB,CAACnB,iBAAiB,CAAC,CAACkB,IAAI,CAAC,IAAI,CAAC,EAC/J,CAAC;IACH;EACF;EACA,IAAIhC,SAAS,EAAE;IACbuB,UAAU,GAAG,KAAIC,wBAAU,EAAC,GAAGD,UAAU,CAACD,MAAM,CAAC,CAAC;MAAEJ;IAAK,CAAC,KAAKA,IAAI,CAACY,QAAQ,KAAKI,oBAAU,CAACC,MAAM,CAAC,CAAC;EACtG;EACA,IAAIlC,SAAS,CAACyB,MAAM,EAAE;IACpBH,UAAU,GAAG,KAAIC,wBAAU,EACzB,GAAGD,UAAU,CAACD,MAAM,CAAC,CAAC;MAAEJ;IAAK,CAAC,KAAK,CAACjB,SAAS,CAAC2B,QAAQ,CAACV,IAAI,CAACW,IAAI,CAAC,IAAI,CAAC5B,SAAS,CAAC2B,QAAQ,CAACV,IAAI,CAACY,QAAQ,CAAC,CACzG,CAAC;EACH;EAEA,OAAOP,UAAU;AACnB;AAEA,SAASU,qBAAqBA,CAAClC,KAAkB,EAAY;EAC3D,MAAMqC,eAAe,GAAG,IAAIC,GAAG,CAAS,CAAC;EACzCtC,KAAK,CAACK,OAAO,CAAEc,IAAI,IAAK;IACtBkB,eAAe,CAACE,GAAG,CAACpB,IAAI,CAACW,IAAI,CAAC;IAC9BO,eAAe,CAACE,GAAG,CAACpB,IAAI,CAACY,QAAQ,CAAC;EACpC,CAAC,CAAC;EACF,OAAOS,KAAK,CAACC,IAAI,CAACJ,eAAe,CAAC,CAACK,IAAI,CAAC,CAAC;AAC3C;AAEA,SAAShB,eAAeA,CAACF,UAAsB,EAAEH,eAAkC,EAAEf,QAAkB,EAAE;EACvG,MAAMf,IAAI,GAAG8B,eAAe,CAACsB,IAAI,CAAEC,CAAC,IAAKA,CAAC,CAACtC,QAAQ,KAAKA,QAAQ,CAAC;EACjE,IAAI,CAACf,IAAI,EAAE;EACX,MAAMsD,MAAM,GAAGtD,IAAI,CAACiB,KAAK,CAACsC,QAAQ,CAAC,CAAC;EACpCD,MAAM,CAACxC,OAAO,CAAE0C,QAAQ,IAAK;IAC3B,MAAM;MAAEhB,QAAQ;MAAED;IAAK,CAAC,GAAGkB,4BAAe,CAACC,aAAa,CAACF,QAAQ,CAACG,IAAI,CAAC;IACvE3D,IAAI,CAACmB,YAAY,CAACL,OAAO,CAAC,CAAC;MAAES,GAAG;MAAEF;IAAS,CAAC,KAAK;MAC/C,MAAMuC,SAAS,GAAGvC,QAAQ,CAACwC,SAAS,CACjCC,YAAY,IAAKA,YAAY,CAACtB,QAAQ,KAAKA,QAAQ,IAAIsB,YAAY,CAACvB,IAAI,KAAKA,IAChF,CAAC;MACD,IAAIqB,SAAS,GAAG,CAAC,EAAE;MACnB,MAAMhC,IAAI,GAAGP,QAAQ,CAACuC,SAAS,CAAC;MAChC3B,UAAU,CAACjB,IAAI,CAAC;QAAEO,GAAG;QAAEK;MAAK,CAAC,CAAC;MAC9BP,QAAQ,CAAC0C,MAAM,CAACH,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC;EACJ,CAAC,CAAC;EACF5D,IAAI,CAACmB,YAAY,CAACL,OAAO,CAAC,CAAC;IAAES,GAAG;IAAEF;EAAS,CAAC,KAAK;IAC/CA,QAAQ,CAACP,OAAO,CAAEc,IAAI,IAAKK,UAAU,CAACjB,IAAI,CAAC;MAAEO,GAAG;MAAEK;IAAK,CAAC,CAAC,CAAC;EAC5D,CAAC,CAAC;AACJ;AAEA,SAASC,sBAAsBA,CAACjB,MAA4B,EAAES,QAAqB,EAAEO,IAAe,EAAE;EACpG,IAAI,CAACA,IAAI,CAACoC,YAAY,IAAI,CAACpC,IAAI,CAACoC,YAAY,CAAC5B,MAAM,EAAE;EACrD,MAAM6B,MAAM,GAAGR,4BAAe,CAACS,WAAW,CAACtC,IAAI,CAAC;EAChDA,IAAI,CAACoC,YAAY,CAAClD,OAAO,CAAEqD,UAAU,IAAK;IACxC,MAAM;MAAE3B,QAAQ;MAAED;IAAK,CAAC,GAAGkB,4BAAe,CAACW,2BAA2B,CAACD,UAAU,CAAC;IAClF,MAAME,eAAe,GAAGhD,QAAQ,CAACW,MAAM,CAAE8B,YAAY,IAAK;MACxD,IAAIA,YAAY,CAACtB,QAAQ,KAAKA,QAAQ,EAAE,OAAO,KAAK;MACpD,OAAOD,IAAI,GAAGA,IAAI,KAAKuB,YAAY,CAACvB,IAAI,GAAG,IAAI;IACjD,CAAC,CAAC;IACF,IAAI8B,eAAe,CAACjC,MAAM,KAAK,CAAC,EAAE;MAChC,MAAM,IAAIK,KAAK,CACb,6CAA6C0B,UAAU,aAAaV,4BAAe,CAACS,WAAW,CAACtC,IAAI,CAAC,GACvG,CAAC;IACH;IACAyC,eAAe,CAACvD,OAAO,CAAEwD,cAAc,IAAK;MAC1C,MAAMvD,QAAQ,GAAGwD,WAAW,CAAC3C,IAAI,EAAE0C,cAAc,CAAC;MAClD,IAAI,CAACvD,QAAQ,EAAE;QACb;QACA;MACF;MACA,MAAMyD,aAAa,GAAG5D,MAAM,CAACwC,IAAI,CAAEqB,CAAC,IAAKA,CAAC,CAAC1D,QAAQ,KAAKA,QAAQ,CAAC;MACjE,IAAI,CAACyD,aAAa,EAAE,MAAM,IAAI/B,KAAK,CAAC,qCAAqC1B,QAAQ,EAAE,CAAC;MACpF,MAAM2D,YAAY,GAAGjB,4BAAe,CAACS,WAAW,CAACI,cAAc,CAAC;MAChE,MAAMrD,KAAK,GAAGuD,aAAa,CAACvD,KAAK;MACjCA,KAAK,CAAC0D,OAAO,CAAC,KAAIC,aAAI,EAACX,MAAM,EAAEA,MAAM,CAAC,CAAC;MACvChD,KAAK,CAAC0D,OAAO,CAAC,KAAIC,aAAI,EAACF,YAAY,EAAEA,YAAY,CAAC,CAAC;MACnDzD,KAAK,CAAC4D,OAAO,CAAC,KAAIC,aAAI,EAACJ,YAAY,EAAET,MAAM,EAAE,YAAY,CAAC,CAAC;IAC7D,CAAC,CAAC;EACJ,CAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASM,WAAWA,CAAC3C,IAAe,EAAE0C,cAAyB,EAAmB;EAChF,MAAMS,YAAY,GAAGnD,IAAI,CAACb,QAAQ,IAAI,QAAQ;EAC9C,MAAMiE,kBAAkB,GAAGV,cAAc,CAACvD,QAAQ,IAAI,QAAQ;EAE9D,MAAMkE,iBAAiB,GACpBF,YAAY,KAAK,OAAO,IAAIC,kBAAkB,KAAK,OAAO,IAC1DD,YAAY,KAAK,QAAQ,IAAIC,kBAAkB,KAAK,KAAM;EAE7D,MAAME,iBAAiB,GAAGH,YAAY,KAAKC,kBAAkB;EAE7D,IAAIC,iBAAiB,EAAE;IACrB,MAAM,IAAIxC,KAAK,CAAC,WAAWgB,4BAAe,CAACS,WAAW,CAACtC,IAAI,CAAC,gBAAgBmD,YAAY;AAC5F,oBAAoBtB,4BAAe,CAACS,WAAW,CAACI,cAAc,CAAC,eAAeU,kBAAkB;AAChG,8FAA8F,CAAC;EAC7F;EAEA,IAAIE,iBAAiB,EAAE;IACrB,OAAOH,YAAY;EACrB;;EAEA;EACA;EACA,OAAO,IAAI;AACb;AAEA,SAASzD,iBAAiBA,CAAChB,QAAkB,EAAEiB,GAAgB,EAAEf,aAAqB,EAAe;EACnG,MAAM2E,UAAuB,GAAG5D,GAAG,CAACf,aAAa,CAAC,GAAGe,GAAG,CAACf,aAAa,CAAC,CAAC,CAAC,GAAG,EAAE;EAC9E,MAAM4E,UAAU,GAAG9E,QAAQ,CAAC+E,MAAM,CAAC,CAAC,CAAC1D,IAAI,CAAC,CAAC;EAC3C,MAAM2D,YAAyB,GAAG,EAAE;EACpC,MAAMC,UAAuB,GAAG,EAAE;EAClCH,UAAU,CAACtE,OAAO,CAAEc,IAAI,IAAK;IAC3B,IAAIA,IAAI,CAACb,QAAQ,KAAK,OAAO,EAAE;MAC7BuE,YAAY,CAACtE,IAAI,CAACY,IAAI,CAAC;MACvB;IACF;IACA,IAAIA,IAAI,CAACb,QAAQ,KAAK,KAAK,EAAE;MAC3BwE,UAAU,CAACvE,IAAI,CAACY,IAAI,CAAC;MACrB;IACF;IACA0D,YAAY,CAACtE,IAAI,CAACY,IAAI,CAAC;EACzB,CAAC,CAAC;;EAEF;EACA,MAAM4D,WAAW,GAAG,CAAC,GAAGF,YAAY,EAAE,GAAGH,UAAU,EAAE,GAAGI,UAAU,CAAC;EAEnE,OAAOC,WAAW;AACpB","ignoreList":[]}

package/dist/{preview-1759510479013.js → preview-1759527825988.js}

@@ -1,5 +1,5 @@
-import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.pipelines_builder@1.0.769/dist/builder.composition.js';
-import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.pipelines_builder@1.0.769/dist/builder.docs.mdx';
+import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.pipelines_builder@1.0.771/dist/builder.composition.js';
+import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.pipelines_builder@1.0.771/dist/builder.docs.mdx';
 
 export const compositions = [compositions_0];
 export const overview = [overview_0];

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@teambit/builder",
-  "version": "1.0.769",
+  "version": "1.0.771",
   "homepage": "https://bit.cloud/teambit/pipelines/builder",
   "main": "dist/index.js",
   "componentId": {
     "scope": "teambit.pipelines",
     "name": "builder",
-    "version": "1.0.769"
+    "version": "1.0.771"
   },
   "dependencies": {
     "chalk": "4.1.2",
@@ -40,16 +40,16 @@
     "@teambit/component-id": "1.2.4",
     "@teambit/legacy.utils": "0.0.28",
     "@teambit/legacy.scope": "0.0.79",
-    "@teambit/component": "1.0.769",
-    "@teambit/envs": "1.0.769",
-    "@teambit/isolator": "1.0.769",
-    "@teambit/workspace": "1.0.769",
-    "@teambit/aspect-loader": "1.0.769",
-    "@teambit/generator": "1.0.770",
-    "@teambit/graphql": "1.0.769",
-    "@teambit/issues": "1.0.769",
-    "@teambit/scope": "1.0.769",
-    "@teambit/ui": "1.0.769"
+    "@teambit/component": "1.0.771",
+    "@teambit/envs": "1.0.771",
+    "@teambit/isolator": "1.0.771",
+    "@teambit/workspace": "1.0.771",
+    "@teambit/aspect-loader": "1.0.771",
+    "@teambit/generator": "1.0.772",
+    "@teambit/graphql": "1.0.771",
+    "@teambit/issues": "1.0.771",
+    "@teambit/scope": "1.0.771",
+    "@teambit/ui": "1.0.771"
   },
   "devDependencies": {
     "@types/pretty-time": "^1.1.5",