@vltpkg/graph 1.0.0-rc.14 → 1.0.0-rc.15

package/dist/ideal/get-ordered-dependencies.js

@@ -1,42 +0,0 @@
-/**
- * Computes the ordered list of dependencies for an given node,
- * taking into account additions and removals.
- */
-export const getNodeOrderedDependencies = (fromNode, options) => {
-    // using a map here instead of an array helps us get simpler
-    // deduplication while iterating through all the items at hand:
-    // existing dependencies in the graph, dependencies to be added, etc.
-    const deps = new Map();
-    for (const [name, { spec, type }] of fromNode.edgesOut.entries()) {
-        deps.set(name, { spec, type });
-    }
-    // next iterate through the list of dependencies to be added
-    const addedDeps = options?.add.get(fromNode.id);
-    if (addedDeps) {
-        for (const [name, { spec, type }] of addedDeps.entries()) {
-            deps.set(name, { spec, type });
-        }
-    }
-    // finally iterate through the list of dependencies to be removed
-    const removedDeps = options?.remove.get(fromNode.id);
-    if (removedDeps) {
-        for (const name of removedDeps) {
-            deps.delete(name);
-        }
-    }
-    // now turn the map into a sorted array
-    return getOrderedDependencies([...deps.values()]);
-};
-export const getOrderedDependencies = (deps) => {
-    const orderedDeps = [...deps].sort(({ spec: aSpec, type: aType }, { spec: bSpec, type: bType }) => {
-        const aIsPeer = aType === 'peer' || aType === 'peerOptional' ? 1 : 0;
-        const bIsPeer = bType === 'peer' || bType === 'peerOptional' ? 1 : 0;
-        // regular dependencies first, peer dependencies last
-        if (aIsPeer !== bIsPeer) {
-            return aIsPeer - bIsPeer;
-        }
-        return aSpec.name.localeCompare(bSpec.name, 'en');
-    });
-    return orderedDeps;
-};
-//# sourceMappingURL=get-ordered-dependencies.js.map

package/dist/ideal/get-ordered-dependencies.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-ordered-dependencies.js","sourceRoot":"","sources":["../../src/ideal/get-ordered-dependencies.ts"],"names":[],"mappings":"AAOA;;;GAGG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CACxC,QAAc,EACd,OAAwD,EAC1C,EAAE;IAChB,4DAA4D;IAC5D,+DAA+D;IAC/D,qEAAqE;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAA;IAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QACjE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAChC,CAAC;IACD,4DAA4D;IAC5D,MAAM,SAAS,GAAG,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAC/C,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QAChC,CAAC;IACH,CAAC;IACD,iEAAiE;IACjE,MAAM,WAAW,GAAG,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IACpD,IAAI,WAAW,EAAE,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,OAAO,sBAAsB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AACnD,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,IAAkB,EACJ,EAAE;IAChB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAChC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;QAC7D,MAAM,OAAO,GACX,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACtD,MAAM,OAAO,GACX,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEtD,qDAAqD;QACrD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,OAAO,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACnD,CAAC,CACF,CAAA;IACD,OAAO,WAAW,CAAA;AACpB,CAAC,CAAA","sourcesContent":["import type { Node } from '../node.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealRemoveOptions,\n} from './types.ts'\n\n/**\n * Computes the ordered list of dependencies for an given node,\n * taking into account additions and removals.\n */\nexport const getNodeOrderedDependencies = (\n  fromNode: Node,\n  options?: BuildIdealAddOptions & BuildIdealRemoveOptions,\n): Dependency[] => {\n  // using a map here instead of an array helps us get simpler\n  // deduplication while iterating through all the items at hand:\n  // existing dependencies in the graph, dependencies to be added, etc.\n  const deps = new Map<string, Dependency>()\n  for (const [name, { spec, type }] of fromNode.edgesOut.entries()) {\n    deps.set(name, { spec, type })\n  }\n  // next iterate through the list of dependencies to be added\n  const addedDeps = options?.add.get(fromNode.id)\n  if (addedDeps) {\n    for (const [name, { spec, type }] of addedDeps.entries()) {\n      deps.set(name, { spec, type })\n    }\n  }\n  // finally iterate through the list of dependencies to be removed\n  const removedDeps = options?.remove.get(fromNode.id)\n  if (removedDeps) {\n    for (const name of removedDeps) {\n      deps.delete(name)\n    }\n  }\n\n  // now turn the map into a sorted array\n  return getOrderedDependencies([...deps.values()])\n}\n\nexport const getOrderedDependencies = (\n  deps: Dependency[],\n): Dependency[] => {\n  const orderedDeps = [...deps].sort(\n    ({ spec: aSpec, type: aType }, { spec: bSpec, type: bType }) => {\n      const aIsPeer =\n        aType === 'peer' || aType === 'peerOptional' ? 1 : 0\n      const bIsPeer =\n        bType === 'peer' || bType === 'peerOptional' ? 1 : 0\n\n      // regular dependencies first, peer dependencies last\n      if (aIsPeer !== bIsPeer) {\n        return aIsPeer - bIsPeer\n      }\n\n      return aSpec.name.localeCompare(bSpec.name, 'en')\n    },\n  )\n  return orderedDeps\n}\n"]}