@vltpkg/graph 1.0.0-rc.10 → 1.0.0-rc.11

package/dist/ideal/peers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"peers.js","sourceRoot":"","sources":["../../src/ideal/peers.ts"],"names":[],"mappings":"AAAA,kDAAkD;AAClD,2CAA2C;AAE3C,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAA;AAetE;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CACrC,WAAoC,EAChB,EAAE;IACtB,8CAA8C;IAC9C,IAAI,CAAC,WAAW,EAAE,KAAK;QAAE,OAAO,SAAS,CAAA;IAEzC,OAAO,KAAK,WAAW,CAAC,KAAK,EAAE,CAAA;AACjC,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,IAAU,EACV,KAAuB,EACd,EAAE;IACX,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5B;YACE,4DAA4D;YAC5D,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU;gBACvB,CAAC,CAAC,IAAI,CAAC,KAAK;oBACV,CAAC,CAAC,CAAC,KAAK;oBACR,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtC,iDAAiD;gBACjD,wCAAwC;gBACxC,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,EAC1D,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAC1C,OAAgC,EACP,EAAE,CAC3B,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;IACzB,MAAM,OAAO,GACX,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxD,MAAM,OAAO,GACX,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxD,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,OAAO,GAAG,OAAO,CAAA;IACjD,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC3C,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;AACzC,CAAC,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CACvC,WAAwB,EACxB,OAAgC,EACvB,EAAE;IACX,wCAAwC;IACxC,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;QAE5C,0BAA0B;QAC1B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK,EAAE,MAAM;YAAE,SAAQ;QAE5B,kEAAkE;QAClE,IAAI,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CACrC,WAAwB,EACxB,OAAgC,EAChC,QAAc,EACd,QAAmB,EACV,EAAE;IACX,gEAAgE;IAChE,yDAAyD;IACzD,6DAA6D;IAC7D,+CAA+C;IAC/C,IAAI,yBAAyB,CAAC,WAAW,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAA;IAEhE,6DAA6D;IAC7D,KAAK,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;QACxD,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;QAE5C,2CAA2C;QAC3C,IAAI,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG;gBACN,MAAM,EAAE,IAAI;gBACZ,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBACtB,MAAM;gBACN,IAAI;gBACJ,iBAAiB,EAAE,IAAI,GAAG,EAAE;aAC7B,CAAA;YACD,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;YAC5B,IAAI,SAAS;gBAAE,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YACrD,SAAQ;QACV,CAAC;QAED,6DAA6D;QAC7D,gEAAgE;QAChE,8DAA8D;QAC9D,IAAI,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QAE/C,IACE,MAAM;YACN,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CACzB,SAAS,CACP,MAAM,CAAC,EAAE,EACT,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,QAAQ,CACT,CACF,EACD,CAAC;YACD,IACE,MAAM,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,EAAE,EAAE;gBAC9B,MAAM,CAAC,OAAO,KAAK,KAAK,CAAC,MAAM,EAAE,OAAO,EACxC,CAAC;gBACD,+DAA+D;gBAC/D,iEAAiE;gBACjE,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;oBACjD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBAC1C,IAAI,IAAI,EAAE,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;wBACnC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;wBAC5B,IAAI,CAAC,EAAE,GAAG,MAAM,CAAA;wBAChB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBAC1B,CAAC;gBACH,CAAC;gBACD,KAAK,CAAC,MAAM,GAAG,MAAM,CAAA;YACvB,CAAC;YAED,kDAAkD;YAClD,KAAK,CAAC,MAAM,KAAK,MAAM,CAAA;QACzB,CAAC;QAED,qCAAqC;QACrC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrB,IAAI,SAAS;YAAE,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IACvD,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,KAAY,EACZ,WAAwB,EACxB,OAAgC,EACnB,EAAE;IACf,gCAAgC;IAChC,MAAM,eAAe,GAAgB,IAAI,GAAG,EAAE,CAAA;IAC9C,eAAe,CAAC,KAAK,GAAG,KAAK,CAAC,oBAAoB,EAAE,CAAA;IACpD,2BAA2B;IAC3B,KAAK,CAAC,YAAY,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,eAAe,CAAA;IAE3D,sEAAsE;IACtE,2EAA2E;IAC3E,6DAA6D;IAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE;YACxB,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC;YAC3B,MAAM,EAAE,SAAS;YACjB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,iBAAiB,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC;SACpD,CAAC,CAAA;IACJ,CAAC;IAED,uEAAuE;IACvE,6EAA6E;IAC7E,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAA;QAC/C,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;QACjE,MAAM,QAAQ,GAAG;YACf,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM;YACN,IAAI;YACJ,iBAAiB,EACf,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAQ;SACrD,CAAA;QACD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IACrC,CAAC;IAED,OAAO,eAAe,CAAA;AACxB,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,WAAwB,EACxB,QAAkB,EAClB,QAAc,EACd,OAAoB,EACpB,EAAE;IACF,sEAAsE;IACtE,mEAAmE;IACnE,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAA;IACzD,IAAI,WAA+B,CAAA;IAEnC,IACE,QAAQ,CAAC,gBAAgB;QACzB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,GAAG,CAAC,EACjD,CAAC;QACD,mDAAmD;QACnD,wCAAwC;QACxC,WAAW,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAA;QAElD,gDAAgD;QAChD,kDAAkD;QAClD,MAAM,WAAW,GAAG,eAAe,CAAC,QAAQ,EAAE;YAC5C,GAAG,OAAO;YACV,QAAQ,EAAE,QAAQ,CAAC,QAAQ;SAC5B,CAAC,CAAA;QACF,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QAC5B,CAAC;QAED,wDAAwD;QACxD,sDAAsD;QACtD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBACtB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,OAAO;QACL,WAAW;QACX,6CAA6C;QAC7C,aAAa,EAAE,4BAA4B,CAAC;YAC1C,GAAG,QAAQ,CAAC,MAAM,EAAE;SACrB,CAAC;KACH,CAAA;AACH,CAAC,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,WAAwB,EACxB,QAAsB,EACtB,YAAuD,EACvD,KAAY,EACZ,IAAU,EACV,QAAc,EACd,IAAU,EACV,IAAwB,EACxB,aAAsC,EACtC,EAAE,CAAC,CAAC;IACJ;;OAEG;IACH,UAAU,EAAE,GAAG,EAAE;QACf,qEAAqE;QACrE,IAAI,sBAAsB,GAAG,KAAK,CAAA;QAClC,kDAAkD;QAClD,kDAAkD;QAClD,MAAM,WAAW,GAAG;YAClB,GAAG,aAAa;YAChB,gBAAgB,CAAC;gBACf,IAAI;gBACJ,MAAM,EAAE,IAAI;gBACZ,IAAI;aACL;SACF,CAAA;QACD,uBAAuB,CACrB,WAAW,EACX,WAAW,EACX,QAAQ,EACR,KAAK,CAAC,QAAQ,CACf,CAAA;QAED,2CAA2C;QAC3C,MAAM,WAAW,GAAG;YAClB,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACrD,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxC,GAAG,GAAG;gBACN,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;SACJ,CAAA;QACD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,sBAAsB,GAAG,uBAAuB,CAC9C,WAAW,EACX,WAAW,EACX,IAAI,EACJ,KAAK,CAAC,QAAQ,CACf,CAAA;QACH,CAAC;QAED,wDAAwD;QACxD,mEAAmE;QACnE,OAAO,sBAAsB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAA;IACzD,CAAC;IAED;;;OAGG;IACH,eAAe,EAAE,GAAG,EAAE;QACpB,8DAA8D;QAC9D,8DAA8D;QAC9D,oEAAoE;QACpE,+DAA+D;QAC/D,kDAAkD;QAClD,KAAK,MAAM,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,OAAO,CAAA;YAC9B,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC;gBAC/C,kDAAkD;gBAClD,+BAA+B;gBAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;gBAC9C,IACE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;oBACnC,KAAK,EAAE,MAAM;oBACb,SAAS,CACP,KAAK,CAAC,MAAM,CAAC,EAAE,EACf,IAAI,EACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;oBACD,4CAA4C;oBAC5C,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;oBAC7C,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC7B,CAAC;qBAAM,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC;oBACnC,8CAA8C;oBAC9C,8BAA8B;oBAC9B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;gBACjC,CAAC;qBAAM,CAAC;oBACN,wDAAwD;oBACxD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF,CAAC,CAAA;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,KAAY,EACZ,kBAA4C,EAC5C,EAAE;IACF,qEAAqE;IACrE,qEAAqE;IACrE,4BAA4B;IAC5B,KAAK,MAAM,kBAAkB,IAAI,kBAAkB,EAAE,CAAC;QACpD,uDAAuD;QACvD,MAAM,eAAe,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC5D,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CACzC,CAAA;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAOzB,CAAA;QACH,iEAAiE;QACjE,iEAAiE;QACjE,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,UAAU,EAAE,CAAA;YACrD,IAAI,SAAS,EAAE,CAAC;gBACd,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QAED,qFAAqF;QACrF,MAAM,yBAAyB,GAAG;YAChC,GAAG,YAAY,CAAC,OAAO,EAAE;SAC1B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAA;QAE9D,iEAAiE;QACjE,wDAAwD;QACxD,IAAI,WAAW,CAAA;QACf,KAAK,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,yBAAyB,EAAE,CAAC;YAChE,IACE,WAAW;gBACX,CAAC,yBAAyB,CAAC,WAAW,EAAE,WAAW,CAAC,EACpD,CAAC;gBACD,oDAAoD;gBACpD,uBAAuB,CACrB,WAAW,EACX,WAAW,EACX,QAAQ,CAAC,IAAI,EACb,KAAK,CAAC,QAAQ,CACf,CAAA;gBACD,QAAQ,CAAC,WAAW,GAAG,WAAW,CAAA;gBAClC,SAAQ;YACV,CAAC;YACD,QAAQ,CAAC,WAAW,GAAG,eAAe,CACpC,KAAK,EACL,QAAQ,CAAC,WAAW,EACpB,WAAW,CACZ,CAAA;YACD,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAA;QACpC,CAAC;QACD,4CAA4C;QAC5C,8BAA8B;QAC9B,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,QAAQ,CAAC,aAAa,CAAC,eAAe,EAAE,CAAA;YACxC,QAAQ,CAAC,IAAI,GAAG,sBAAsB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACvD,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["// helpers for managing peer dependency resolution\n// during the ideal graph building process.\n\nimport { intersects } from '@vltpkg/semver'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { getDependencies } from '../dependencies.ts'\nimport { getOrderedDependencies } from './get-ordered-dependencies.ts'\nimport type {\n  ProcessPlacementResultEntry,\n  PeerContext,\n  PeerContextEntry,\n  PeerContextEntryInput,\n  ProcessPlacementResult,\n} from './types.ts'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport type { DependencySaveType, Manifest } from '@vltpkg/types'\nimport type { Monorepo } from '@vltpkg/workspaces'\nimport type { Dependency } from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\n\n/**\n * Retrieve a unique hash value for a given peer context set.\n */\nexport const retrievePeerContextHash = (\n  peerContext: PeerContext | undefined,\n): string | undefined => {\n  // skips creating the initial peer context ref\n  if (!peerContext?.index) return undefined\n\n  return `ṗ:${peerContext.index}`\n}\n\n/**\n * Checks if a given spec is compatible with the specs already\n * assigned to a peer context entry.\n *\n * Returns true if compatible, false otherwise.\n */\nexport const incompatibleSpecs = (\n  spec: Spec,\n  entry: PeerContextEntry,\n): boolean => {\n  if (entry.specs.size > 0) {\n    for (const s of entry.specs) {\n      if (\n        // only able to check range intersections for registry types\n        (spec.type === 'registry' &&\n          (!spec.range ||\n            !s.range ||\n            !intersects(spec.range, s.range))) ||\n        // also support types other than registry in case\n        // they use the very same bareSpec value\n        (spec.type !== 'registry' && spec.bareSpec !== s.bareSpec)\n      ) {\n        return true\n      }\n    }\n  }\n  return false\n}\n\n/**\n * Sort peer context entry inputs for deterministic processing.\n * Orders: non-peer dependencies first, then peer dependencies, alphabetically by name.\n */\nexport const getOrderedPeerContextEntries = (\n  entries: PeerContextEntryInput[],\n): PeerContextEntryInput[] =>\n  [...entries].sort((a, b) => {\n    const aIsPeer =\n      a.type === 'peer' || a.type === 'peerOptional' ? 1 : 0\n    const bIsPeer =\n      b.type === 'peer' || b.type === 'peerOptional' ? 1 : 0\n    if (aIsPeer !== bIsPeer) return aIsPeer - bIsPeer\n    const aName = a.target?.name ?? a.spec.name\n    const bName = b.target?.name ?? b.spec.name\n    return aName.localeCompare(bName, 'en')\n  })\n\n/*\n * Checks if there are any conflicting versions for a given dependency\n * to be added to a peer context set which will require forking.\n *\n * Returns true if forking is needed, false otherwise.\n */\nexport const checkEntriesToPeerContext = (\n  peerContext: PeerContext,\n  entries: PeerContextEntryInput[],\n): boolean => {\n  // check on compatibility of new entries\n  for (const { spec, target } of entries) {\n    const name = target?.name ?? spec.final.name\n\n    // skip any inactive entry\n    const entry = peerContext.get(name)\n    if (!entry?.active) continue\n\n    // validate if the provided spec is compatible with existing specs\n    if (incompatibleSpecs(spec, entry)) {\n      return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Add or update dependencies in a given peer context making sure to check\n * for compatibility with existing dependencies already resolved by a given\n * peer context set. Extra info such as a target or dependent nodes is\n * optional.\n *\n * Returns true if forking is needed, false otherwise.\n */\nexport const addEntriesToPeerContext = (\n  peerContext: PeerContext,\n  entries: PeerContextEntryInput[],\n  fromNode: Node,\n  monorepo?: Monorepo,\n): boolean => {\n  // pre check to see if any of the new entries to be added to the\n  // provided peer context set conflicts with existing ones\n  // if that's already the case we can skip processing them and\n  // will return that a fork is needed right away\n  if (checkEntriesToPeerContext(peerContext, entries)) return true\n\n  // iterate on every entry to be added to the peer context set\n  for (const { dependent, spec, target, type } of entries) {\n    const name = target?.name ?? spec.final.name\n\n    // if there's no existing entry, create one\n    let entry = peerContext.get(name)\n    if (!entry) {\n      entry = {\n        active: true,\n        specs: new Set([spec]),\n        target,\n        type,\n        contextDependents: new Set(),\n      }\n      peerContext.set(name, entry)\n      if (dependent) entry.contextDependents.add(dependent)\n      continue\n    }\n\n    // perform an extra check that confirms the new spec does not\n    // conflicts with existing specs in this entry, this handles the\n    // case of adding sibling deps that conflicts with one another\n    if (incompatibleSpecs(spec, entry)) return true\n\n    if (\n      target &&\n      [...entry.specs].every(s =>\n        satisfies(\n          target.id,\n          s,\n          fromNode.location,\n          fromNode.projectRoot,\n          monorepo,\n        ),\n      )\n    ) {\n      if (\n        target.id !== entry.target?.id &&\n        target.version !== entry.target?.version\n      ) {\n        // we have a compatible entry that has a new, compatible target\n        // so we need to update all dependents to point to the new target\n        for (const dependents of entry.contextDependents) {\n          const edge = dependents.edgesOut.get(name)\n          if (edge?.to && edge.to !== target) {\n            edge.to.edgesIn.delete(edge)\n            edge.to = target\n            target.edgesIn.add(edge)\n          }\n        }\n        entry.target = target\n      }\n\n      // otherwise sets the value in case it was nullish\n      entry.target ??= target\n    }\n\n    // update specs and dependents values\n    entry.specs.add(spec)\n    if (dependent) entry.contextDependents.add(dependent)\n  }\n\n  return false\n}\n\n/**\n * Create and returns a forked copy of a given peer context set.\n */\nexport const forkPeerContext = (\n  graph: Graph,\n  peerContext: PeerContext,\n  entries: PeerContextEntryInput[],\n): PeerContext => {\n  // create a new peer context set\n  const nextPeerContext: PeerContext = new Map()\n  nextPeerContext.index = graph.nextPeerContextIndex()\n  // register it in the graph\n  graph.peerContexts[nextPeerContext.index] = nextPeerContext\n\n  // copy existing entries marking them as inactive, it's also important\n  // to note that specs and contextDependents are new objects so that changes\n  // to those in the new context do not affect the previous one\n  for (const [name, entry] of peerContext.entries()) {\n    nextPeerContext.set(name, {\n      active: false,\n      specs: new Set(entry.specs),\n      target: undefined,\n      type: entry.type,\n      contextDependents: new Set(entry.contextDependents),\n    })\n  }\n\n  // add the new entries to this peer context set, marking them as active\n  // these are the entries that were incompatible with the previous context set\n  for (const entry of entries) {\n    const { dependent, spec, target, type } = entry\n    const name = target?.name /* c8 ignore next */ ?? spec.final.name\n    const newEntry = {\n      active: true,\n      specs: new Set([spec]),\n      target,\n      type,\n      contextDependents:\n        dependent ? new Set([dependent]) : new Set<Node>(),\n    }\n    nextPeerContext.set(name, newEntry)\n  }\n\n  return nextPeerContext\n}\n\n/**\n * Starts the peer dependency placement process\n * for a given node being processed and placed.\n */\nexport const startPeerPlacement = (\n  peerContext: PeerContext,\n  manifest: Manifest,\n  fromNode: Node,\n  options: SpecOptions,\n) => {\n  // queue entries so that they can be added at the end of the placement\n  // process, use a map to ensure deduplication between read json dep\n  // values and the resolved edges in the graph\n  const queueMap = new Map<string, PeerContextEntryInput>()\n  let peerSetHash: string | undefined\n\n  if (\n    manifest.peerDependencies &&\n    Object.keys(manifest.peerDependencies).length > 0\n  ) {\n    // generates a peer context set hash for nodes that\n    // have peer dependencies to be resolved\n    peerSetHash = retrievePeerContextHash(peerContext)\n\n    // get any potential sibling dependency from the\n    // parent node that might have not been parsed yet\n    const siblingDeps = getDependencies(fromNode, {\n      ...options,\n      registry: fromNode.registry,\n    })\n    for (const [depName, dep] of siblingDeps) {\n      queueMap.set(depName, dep)\n    }\n\n    // collect the already parsed nodes and add those to the\n    // list of entries to be added to the peer context set\n    for (const edge of fromNode.edgesOut.values()) {\n      queueMap.set(edge.name, {\n        spec: edge.spec,\n        target: edge.to,\n        type: edge.type,\n      })\n    }\n  }\n\n  return {\n    peerSetHash,\n    // Sort queuedEntries for deterministic order\n    queuedEntries: getOrderedPeerContextEntries([\n      ...queueMap.values(),\n    ]),\n  }\n}\n\n/**\n * Ends the peer dependency placement process, returning the functions that\n * are going to be used to update the peer context set, forking when needed\n * and resolving peer dependencies if possible.\n */\nexport const endPeerPlacement = (\n  peerContext: PeerContext,\n  nextDeps: Dependency[],\n  nextPeerDeps: Map<string, Dependency> & { id?: number },\n  graph: Graph,\n  spec: Spec,\n  fromNode: Node,\n  node: Node,\n  type: DependencySaveType,\n  queuedEntries: PeerContextEntryInput[],\n) => ({\n  /**\n   * Add the new entries to the current peer context set.\n   */\n  putEntries: () => {\n    // keep track of whether we need to fork the current peer context set\n    let needsToForkPeerContext = false\n    // add queued entries from this node parents along\n    // with a self-ref to the current peer context set\n    const prevEntries = [\n      ...queuedEntries,\n      /* ref itself */ {\n        spec,\n        target: node,\n        type,\n      },\n    ]\n    addEntriesToPeerContext(\n      peerContext,\n      prevEntries,\n      fromNode,\n      graph.monorepo,\n    )\n\n    // add this node's direct dependencies next\n    const nextEntries = [\n      ...nextDeps.map(dep => ({ ...dep, dependent: node })),\n      ...[...nextPeerDeps.values()].map(dep => ({\n        ...dep,\n        dependent: node,\n      })),\n    ]\n    if (nextEntries.length > 0) {\n      needsToForkPeerContext = addEntriesToPeerContext(\n        peerContext,\n        nextEntries,\n        node,\n        graph.monorepo,\n      )\n    }\n\n    // returns all entries that need to be added to a forked\n    // context or undefined if the current context was updated directly\n    return needsToForkPeerContext ? nextEntries : undefined\n  },\n\n  /**\n   * Try to resolve peer dependencies using already seen target\n   * values from the current peer context set.\n   */\n  resolvePeerDeps: () => {\n    // iterate on the set of peer dependencies of the current node\n    // and try to resolve them from the existing peer context set,\n    // when possible, add them as edges in the graph right away, if not,\n    // then we move them back to the `nextDeps` list for processing\n    // along with the rest of the regular dependencies\n    for (const nextDep of nextPeerDeps.values()) {\n      const { spec, type } = nextDep\n      if (type === 'peer' || type === 'peerOptional') {\n        // try to retrieve an entry for that peer dep from\n        // the current peer context set\n        const entry = peerContext.get(spec.final.name)\n        if (\n          !node.edgesOut.has(spec.final.name) &&\n          entry?.target &&\n          satisfies(\n            entry.target.id,\n            spec,\n            fromNode.location,\n            fromNode.projectRoot,\n            graph.monorepo,\n          )\n        ) {\n          // entry satisfied, create edge in the graph\n          graph.addEdge(type, spec, node, entry.target)\n          entry.specs.add(spec.final)\n        } else if (type === 'peerOptional') {\n          // skip unsatisfied peerOptional dependencies,\n          // just create a dangling edge\n          graph.addEdge(type, spec, node)\n        } else {\n          // could not satisfy from peer context, add to next deps\n          nextDeps.push(nextDep)\n        }\n      }\n    }\n  },\n})\n\n/**\n * Given an array of processed results for the current level dependencies\n * being placed in the currently building ideal graph, traverse its direct\n * dependencies and track peer dependencies in their appropriate peer context\n * sets, forking as needed and resolving peer dependencies using suitable\n * nodes already present in the graph if possible.\n */\nexport const postPlacementPeerCheck = (\n  graph: Graph,\n  sortedLevelResults: ProcessPlacementResult[],\n) => {\n  // Update peer contexts in a sorted manner after processing all nodes\n  // at a given level to ensure deterministic behavior when it comes to\n  // forking new peer contexts\n  for (const childDepsToProcess of sortedLevelResults) {\n    // Sort childDepsToProcess deterministically by node.id\n    const sortedChildDeps = [...childDepsToProcess].sort((a, b) =>\n      a.node.id.localeCompare(b.node.id, 'en'),\n    )\n\n    const needsForking = new Map<\n      ProcessPlacementResultEntry,\n      {\n        dependent: Node\n        spec: Spec\n        type: DependencySaveType\n      }[]\n    >()\n    // first iterate on all child deps, adding entries to the current\n    // context and collect the information on which ones need forking\n    for (const childDep of sortedChildDeps) {\n      const needsFork = childDep.updateContext.putEntries()\n      if (needsFork) {\n        needsForking.set(childDep, needsFork)\n      }\n    }\n\n    // Sort needsForking entries before iterating (Map iteration order = insertion order)\n    const sortedNeedsForkingEntries = [\n      ...needsForking.entries(),\n    ].sort(([a], [b]) => a.node.id.localeCompare(b.node.id, 'en'))\n\n    // then iterate again, forking contexts as needed but also try to\n    // reuse the context of the previous sibling if possible\n    let prevContext\n    for (const [childDep, nextEntries] of sortedNeedsForkingEntries) {\n      if (\n        prevContext &&\n        !checkEntriesToPeerContext(prevContext, nextEntries)\n      ) {\n        // the context of the previous sibling can be reused\n        addEntriesToPeerContext(\n          prevContext,\n          nextEntries,\n          childDep.node,\n          graph.monorepo,\n        )\n        childDep.peerContext = prevContext\n        continue\n      }\n      childDep.peerContext = forkPeerContext(\n        graph,\n        childDep.peerContext,\n        nextEntries,\n      )\n      prevContext = childDep.peerContext\n    }\n    // try to resolve peer dependencies now that\n    // the context is fully set up\n    for (const childDep of sortedChildDeps) {\n      childDep.updateContext.resolvePeerDeps()\n      childDep.deps = getOrderedDependencies(childDep.deps)\n    }\n  }\n}\n"]}

package/dist/ideal/refresh-ideal-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh-ideal-graph.d.ts","sourceRoot":"","sources":["../../src/ideal/refresh-ideal-graph.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC7D,OAAO,KAAK,EACV,oBAAoB,EACpB,0BAA0B,EAC1B,uBAAuB,EACvB,eAAe,EACf,kBAAkB,EACnB,MAAM,YAAY,CAAA;AAEnB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAEpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAGxC,MAAM,MAAM,wBAAwB,GAAG,oBAAoB,GACzD,uBAAuB,GACvB,0BAA0B,GAC1B,WAAW,GAAG;IACZ;;OAEG;IACH,SAAS,CAAC,EAAE,aAAa,CAAA;IACzB;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;IAElB;;OAEG;IACH,WAAW,EAAE,iBAAiB,CAAA;IAE9B;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IAEd;;OAEG;IACH,OAAO,EAAE,cAAc,CAAA;IAEvB;;;OAGG;IACH,YAAY,CAAC,EAAE,eAAe,CAAA;IAE9B;;;OAGG;IACH,eAAe,CAAC,EAAE,kBAAkB,CAAA;CACrC,CAAA;AAkCH;;GAEG;AACH,eAAO,MAAM,iBAAiB,2HAY3B,wBAAwB,kBAkE1B,CAAA;AAMD;;GAEG;AACH,eAAO,MAAM,oBAAoB,cAA2B,CAAA"}

package/dist/ideal/refresh-ideal-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh-ideal-graph.js","sourceRoot":"","sources":["../../src/ideal/refresh-ideal-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,0BAA0B,EAAE,MAAM,+BAA+B,CAAA;AA4D1E;;GAEG;AACH,MAAM,mBAAmB,GAAG,CAAC,KAAY,EAAU,EAAE;IACnD,MAAM,gBAAgB,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1D,8CAA8C;QAC9C,MAAM,OAAO,GACX,CACE,CAAC,CAAC,QAAQ,EAAE,gBAAgB;YAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,GAAG,CAAC,CACpD,CAAC,CAAC;YACD,CAAC;YACH,CAAC,CAAC,CAAC,CAAA;QACL,MAAM,OAAO,GACX,CACE,CAAC,CAAC,QAAQ,EAAE,gBAAgB;YAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,GAAG,CAAC,CACpD,CAAC,CAAC;YACD,CAAC;YACH,CAAC,CAAC,CAAC,CAAA;QAEL,8DAA8D;QAC9D,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,OAAO,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED,sEAAsE;QACtE,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC3C,CAAC,CAAC,CAAA;IACF,OAAO,gBAAgB,CAAA;AACzB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,KAAK,EAAE,EACtC,GAAG,EACH,KAAK,EACL,SAAS,EACT,WAAW,EACX,MAAM,EACN,MAAM,EACN,MAAM,EACN,OAAO,EACP,YAAY,EACZ,eAAe,EACf,GAAG,WAAW,EACW,EAAE,EAAE;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;IAC7B,MAAM,eAAe,GAA6B,EAAE,CAAA;IACpD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAS,CAAA;IAEtC,uEAAuE;IACvE,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAA;IACnD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAsB,CAAA;IACrD,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,yDAAyD;QACzD,wDAAwD;QACxD,MAAM,IAAI,GAAG,0BAA0B,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAA;QAClE,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACrC,CAAC;IAED,qDAAqD;IACrD,IAAI,GAAG,CAAC,oBAAoB,IAAI,MAAM,CAAC,oBAAoB,EAAE,CAAC;QAC5D,KAAK,CAAC,UAAU,EAAE,CAAA;IACpB,CAAC;IAED,6DAA6D;IAC7D,kEAAkE;IAClE,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,SAAS,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAA;QAEhC,qEAAqE;QACrE,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAEtC,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QAC1C,oBAAoB;QACpB,IAAI,CAAC,IAAI;YAAE,SAAQ;QAEnB,oEAAoE;QACpE,MAAM,YAAY,GAAG,SAAS,EAAE,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;QAE/D,uEAAuE;QACvE,8DAA8D;QAC9D,MAAM,WAAW,CACf,WAAW,EACX,KAAK,EACL,QAAQ,EACR,IAAI,EACJ,MAAM,EACN,WAAW,EACX,IAAI,EACJ,SAAS,EACT,SAAS,EACT,YAAY,EACZ,eAAe,EACf,MAAM,EACN,aAAa,EACb,OAAO,EACP,YAAY,EACZ,eAAe,CAChB,CAAA;IACH,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,kBAAkB,EAAE,CAAA;IAC3B,CAAC;IAED,+CAA+C;IAC/C,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;IACpC,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,IAAI,gBAAgB,GAAG,CAAC,CAAA;AACxB;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,EAAE,CAAC,gBAAgB,EAAE,CAAA","sourcesContent":["import { appendNodes } from './append-nodes.ts'\nimport { getNodeOrderedDependencies } from './get-ordered-dependencies.ts'\nimport type { PathScurry } from 'path-scurry'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealFromGraphOptions,\n  BuildIdealRemoveOptions,\n  TransientAddMap,\n  TransientRemoveMap,\n} from './types.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport type { ExtractResult } from '../reify/extract-node.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\n\nexport type RefreshIdealGraphOptions = BuildIdealAddOptions &\n  BuildIdealRemoveOptions &\n  BuildIdealFromGraphOptions &\n  SpecOptions & {\n    /**\n     * The graph modifiers helper object.\n     */\n    modifiers?: GraphModifier\n    /**\n     * A {@link PathScurry} instance based on the `projectRoot` path\n     */\n    scurry: PathScurry\n\n    /**\n     * A {@link PackageInfoClient} instance to read manifest info from.\n     */\n    packageInfo: PackageInfoClient\n\n    /**\n     * The actual graph to compare against for early extraction\n     */\n    actual?: Graph\n\n    /**\n     * A {@link RollbackRemove} instance to handle extraction rollbacks\n     */\n    remover: RollbackRemove\n\n    /**\n     * Dependencies to be added to non-importer nodes when they are placed.\n     * Used for nested folder dependencies that are not importers.\n     */\n    transientAdd?: TransientAddMap\n\n    /**\n     * Dependencies to be removed from non-importer nodes when they are placed.\n     * Used for nested folder dependencies that are not importers.\n     */\n    transientRemove?: TransientRemoveMap\n  }\n\n/**\n * Returns an ordered list of importer nodes.\n */\nconst getOrderedImporters = (graph: Graph): Node[] => {\n  const orderedImporters = [...graph.importers].sort((a, b) => {\n    // sorts importers first by usage of peer deps\n    const aIsPeer =\n      (\n        a.manifest?.peerDependencies &&\n        Object.keys(a.manifest.peerDependencies).length > 0\n      ) ?\n        1\n      : 0\n    const bIsPeer =\n      (\n        b.manifest?.peerDependencies &&\n        Object.keys(b.manifest.peerDependencies).length > 0\n      ) ?\n        1\n      : 0\n\n    // importers with regular deps only first, with peer deps last\n    if (aIsPeer !== bIsPeer) {\n      return aIsPeer - bIsPeer\n    }\n\n    // if both are in the same group, sort alphabetically by manifest name\n    return a.name.localeCompare(b.name, 'en')\n  })\n  return orderedImporters\n}\n\n/**\n * Rebuilds the provided ideal graph.\n */\nexport const refreshIdealGraph = async ({\n  add,\n  graph,\n  modifiers,\n  packageInfo,\n  scurry,\n  actual,\n  remove,\n  remover,\n  transientAdd,\n  transientRemove,\n  ...specOptions\n}: RefreshIdealGraphOptions) => {\n  const seen = new Set<DepID>()\n  const extractPromises: Promise<ExtractResult>[] = []\n  const seenExtracted = new Set<DepID>()\n\n  // gets an ordered list of importers to ensure deterministic processing\n  const orderedImporters = getOrderedImporters(graph)\n  const depsPerImporter = new Map<Node, Dependency[]>()\n  for (const importer of orderedImporters) {\n    // gets an ordered list of dependencies for this importer\n    // while also taking into account additions and removals\n    const deps = getNodeOrderedDependencies(importer, { add, remove })\n    depsPerImporter.set(importer, deps)\n  }\n\n  // removes all edges to start recalculating the graph\n  if (add.modifiedDependencies || remove.modifiedDependencies) {\n    graph.resetEdges()\n  }\n\n  // iterates on the list of dependencies per importer updating\n  // the graph using metadata fetch from the registry manifest files\n  for (const importer of orderedImporters) {\n    modifiers?.tryImporter(importer)\n\n    // gets a ref to the map of dependencies being added to this importer\n    const addedDeps = add.get(importer.id)\n\n    const deps = depsPerImporter.get(importer)\n    /* c8 ignore next */\n    if (!deps) continue\n\n    // gets a ref to the list of modifier functions for this set of deps\n    const modifierRefs = modifiers?.tryDependencies(importer, deps)\n\n    // Add new nodes for packages defined in the dependencies list fetching\n    // metadata from the registry manifests and updating the graph\n    await appendNodes(\n      packageInfo,\n      graph,\n      importer,\n      deps,\n      scurry,\n      specOptions,\n      seen,\n      addedDeps,\n      modifiers,\n      modifierRefs,\n      extractPromises,\n      actual,\n      seenExtracted,\n      remover,\n      transientAdd,\n      transientRemove,\n    )\n  }\n\n  // set default node locations, if possible\n  for (const node of graph.nodes.values()) {\n    node.setDefaultLocation()\n  }\n\n  // Wait for all extraction promises to complete\n  if (extractPromises.length > 0) {\n    await Promise.all(extractPromises)\n  }\n}\n\n/**\n * Global index to assign unique ids used to track peer context sets.\n */\nlet peerContextIndex = 0\n/**\n * Retrieve the next unique index for a peer context set.\n */\nexport const nextPeerContextIndex = () => peerContextIndex++\n"]}

package/dist/ideal/remove-satisfied-specs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-satisfied-specs.d.ts","sourceRoot":"","sources":["../../src/ideal/remove-satisfied-specs.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,oBAAoB,EACpB,0BAA0B,EAC3B,MAAM,YAAY,CAAA;AAEnB,MAAM,MAAM,2BAA2B,GAAG,oBAAoB,GAC5D,0BAA0B,CAAA;AAE5B;;;GAGG;AACH,eAAO,MAAM,oBAAoB,oBAG9B,2BAA2B,SAqC7B,CAAA"}

package/dist/ideal/remove-satisfied-specs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-satisfied-specs.js","sourceRoot":"","sources":["../../src/ideal/remove-satisfied-specs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAS7C;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,EACnC,GAAG,EACH,KAAK,GACuB,EAAE,EAAE;IAChC,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,KAAK,CAAC,8CAA8C,EAAE;gBAC1D,KAAK,EAAE,KAAK;aACb,CAAC,CAAA;QACJ,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,YAAY,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACxC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,6BAA6B;gBAC7B,SAAQ;YACV,CAAC;YAED,kEAAkE;YAClE,kEAAkE;YAClE,IACE,SAAS,CACP,IAAI,CAAC,EAAE,EAAE,EAAE,EACX,UAAU,CAAC,IAAI,EACf,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,KAAK,CAAC,WAAW,EACjB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;gBACD,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealFromGraphOptions,\n} from './types.ts'\n\nexport type RemoveSatisfiedSpecsOptions = BuildIdealAddOptions &\n  BuildIdealFromGraphOptions\n\n/**\n * Traverse the objects defined in `add` and removes any references to specs\n * that are already satisfied by the contents of the actual `graph`.\n */\nexport const removeSatisfiedSpecs = ({\n  add,\n  graph,\n}: RemoveSatisfiedSpecsOptions) => {\n  for (const [depID, dependencies] of add.entries()) {\n    const importer = graph.nodes.get(depID)\n    if (!importer) {\n      throw error('Referred importer node id could not be found', {\n        found: depID,\n      })\n    }\n    for (const [name, dependency] of dependencies) {\n      const edge = importer.edgesOut.get(name)\n      if (!edge) {\n        // brand new edge being added\n        continue\n      }\n\n      // If the current graph edge is already valid, then we remove that\n      // dependency item from the list of items to be added to the graph\n      if (\n        satisfies(\n          edge.to?.id,\n          dependency.spec,\n          edge.from.location,\n          graph.projectRoot,\n          graph.monorepo,\n        )\n      ) {\n        dependencies.delete(name)\n      }\n    }\n  }\n\n  // Removes any references to an importer that no longer has specs\n  for (const [depID, dependencies] of add.entries()) {\n    if (dependencies.size === 0) {\n      add.delete(depID)\n    }\n  }\n}\n"]}

package/dist/ideal/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/ideal/types.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACxC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AACvD,OAAO,KAAK,EACV,2BAA2B,EAC3B,UAAU,EACV,8BAA8B,EAC/B,MAAM,oBAAoB,CAAA;AAC3B,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAA;AAC1D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GAAG,IAAI,CAChC,2BAA2B,EAC3B,sBAAsB,CACvB,CAAA;AAED;;;;GAIG;AACH,MAAM,MAAM,kBAAkB,GAAG,IAAI,CACnC,8BAA8B,EAC9B,sBAAsB,CACvB,CAAA;AAED,MAAM,MAAM,oBAAoB,GAAG;IACjC;;;;;OAKG;IACH,GAAG,EAAE,2BAA2B,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC;;;;;OAKG;IACH,MAAM,EAAE,8BAA8B,CAAA;CACvC,CAAA;AAED,MAAM,MAAM,0BAA0B,GAAG;IACvC;;;OAGG;IACH,KAAK,EAAE,KAAK,CAAA;CACb,CAAA;AAED,MAAM,MAAM,4BAA4B,GAAG;IACzC;;OAEG;IACH,WAAW,EAAE,iBAAiB,CAAA;CAC/B,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,EAAE,IAAI,CAAA;IACV,IAAI,EAAE,UAAU,EAAE,CAAA;IAClB,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAA;IAC/C,KAAK,EAAE,MAAM,CAAA;IACb,WAAW,EAAE,WAAW,CAAA;IACxB,aAAa,EAAE;QACb,UAAU,EAAE,MACR;YACE,SAAS,EAAE,IAAI,CAAA;YACf,IAAI,EAAE,IAAI,CAAA;YACV,IAAI,EAAE,kBAAkB,CAAA;SACzB,EAAE,GACH,SAAS,CAAA;QACb,eAAe,EAAE,MAAM,IAAI,CAAA;KAC5B,CAAA;CACF,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,2BAA2B,GAAG,IAAI,CAC5C,eAAe,EACf,OAAO,CACR,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,sBAAsB,GAAG,2BAA2B,EAAE,CAAA;AAElE;;GAEG;AACH,MAAM,MAAM,gBAAgB,GAAG;IAC7B;;;;OAIG;IACH,MAAM,EAAE,OAAO,CAAA;IACf,yEAAyE;IACzE,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;IAChB,2EAA2E;IAC3E,MAAM,EAAE,IAAI,GAAG,SAAS,CAAA;IACxB,mDAAmD;IACnD,IAAI,EAAE,kBAAkB,CAAA;IACxB,2EAA2E;IAC3E,iBAAiB,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;CAC7B,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,qBAAqB,GAAG;IAClC,gEAAgE;IAChE,SAAS,CAAC,EAAE,IAAI,CAAA;IAChB,+CAA+C;IAC/C,MAAM,CAAC,EAAE,IAAI,CAAA;CACd,GAAG,UAAU,CAAA;AAEd;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,GAAG;IACxD,KAAK,CAAC,EAAE,MAAM,CAAA;CACf,CAAA"}

package/dist/ideal/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/ideal/types.ts"],"names":[],"mappings":"","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { Spec } from '@vltpkg/spec'\nimport type { DependencySaveType } from '@vltpkg/types'\nimport type {\n  AddImportersDependenciesMap,\n  Dependency,\n  RemoveImportersDependenciesMap,\n} from '../dependencies.ts'\nimport type { ModifierActiveEntry } from '../modifiers.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\n\n/**\n * A map of dependencies to be added to non-importer nodes.\n * Keys are {@link DepID} of nodes that are not importers (e.g., nested folders).\n * When these nodes are resolved and placed in the graph, their dependencies\n * from this map are injected into the processing queue.\n */\nexport type TransientAddMap = Omit<\n  AddImportersDependenciesMap,\n  'modifiedDependencies'\n>\n\n/**\n * A map of dependency names to be removed from non-importer nodes.\n * Keys are {@link DepID} of nodes that are not importers (e.g., nested folders).\n * When these nodes are processed, their dependencies in this map are excluded.\n */\nexport type TransientRemoveMap = Omit<\n  RemoveImportersDependenciesMap,\n  'modifiedDependencies'\n>\n\nexport type BuildIdealAddOptions = {\n  /**\n   * A {@link AddImportersDependenciesMap} in which keys are {@link DepID}\n   * linking to another `Map` in which keys are the dependency names and values\n   * are {@link Dependency}. This structure represents dependencies that need\n   * to be added to the importer represented by {@link DepID}.\n   */\n  add: AddImportersDependenciesMap\n}\n\nexport type BuildIdealRemoveOptions = {\n  /**\n   * A {@link RemoveImportersDependenciesMap} object representing nodes to be\n   * removed from the ideal graph. Each {@link DepID} key represents an\n   * importer node and the `Set` of dependency names to be removed from its\n   * dependency list.\n   */\n  remove: RemoveImportersDependenciesMap\n}\n\nexport type BuildIdealFromGraphOptions = {\n  /**\n   * An initial {@link Graph} to start building from, adding nodes to any\n   * missing edges and appending any new specs defined in `addSpecs`.\n   */\n  graph: Graph\n}\n\nexport type BuildIdealPackageInfoOptions = {\n  /**\n   * A {@link PackageInfoClient} instance to read manifest info from.\n   */\n  packageInfo: PackageInfoClient\n}\n\n/**\n * Represents an ongoing append operation for a node and its dependencies.\n */\nexport type AppendNodeEntry = {\n  node: Node\n  deps: Dependency[]\n  modifierRefs?: Map<string, ModifierActiveEntry>\n  depth: number\n  peerContext: PeerContext\n  updateContext: {\n    putEntries: () =>\n      | {\n          dependent: Node\n          spec: Spec\n          type: DependencySaveType\n        }[]\n      | undefined\n    resolvePeerDeps: () => void\n  }\n}\n\n/**\n * The result of processing a given placed node in the graph.\n */\nexport type ProcessPlacementResultEntry = Omit<\n  AppendNodeEntry,\n  'depth'\n>\n\n/**\n * The result of processing placement for nodes to be added to the graph.\n */\nexport type ProcessPlacementResult = ProcessPlacementResultEntry[]\n\n/**\n * Entry in a peer context representing a resolved peer dependency.\n */\nexport type PeerContextEntry = {\n  /**\n   * True if this entry is currently being resolved and track by this\n   * peer context set, false in case this entry was inherit from a previous\n   * peer context set and should not be considered for resolution.\n   */\n  active: boolean\n  /** List of full Spec objects that are part of this peer context entry */\n  specs: Set<Spec>\n  /** The target Node that satisfies all specs for this peer context entry */\n  target: Node | undefined\n  /** The type of dependency this entry represents */\n  type: DependencySaveType\n  /** Context dependent nodes that had dependencies resolved to this entry */\n  contextDependents: Set<Node>\n}\n\n/**\n * Input for adding an entry to peer contexts.\n */\nexport type PeerContextEntryInput = {\n  /** Node that depends on this resolved peer context set entry */\n  dependent?: Node\n  /** Node this peer context entry resolves to */\n  target?: Node\n} & Dependency\n\n/**\n * Represents resolved peer dependencies in a given append-nodes context.\n */\nexport type PeerContext = Map<string, PeerContextEntry> & {\n  index?: number\n}\n"]}

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA;AACzB,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA;AACzB,cAAc,mBAAmB,CAAA;AACjC,cAAc,wBAAwB,CAAA;AACtC,cAAc,qBAAqB,CAAA;AACnC,cAAc,gCAAgC,CAAA;AAC9C,cAAc,0CAA0C,CAAA;AACxD,cAAc,mCAAmC,CAAA;AACjD,cAAc,qBAAqB,CAAA;AACnC,cAAc,cAAc,CAAA;AAC5B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,aAAa,CAAA;AAC3B,cAAc,WAAW,CAAA;AACzB,cAAc,gBAAgB,CAAA;AAC9B,cAAc,mBAAmB,CAAA;AAGjC,OAAO,KAAK,EAAE,WAAW,IAAI,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AACxE,eAAO,MAAM,MAAM;;CAAuB,CAAA;AAG1C,OAAO,KAAK,EAAE,WAAW,IAAI,mBAAmB,EAAE,MAAM,oBAAoB,CAAA;AAI5E,eAAO,MAAM,QAAQ;;;;;CAKpB,CAAA;AAED,YAAY,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,CAAA;AACtD,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AAGrD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AACzD,YAAY,EAAE,iBAAiB,EAAE,CAAA;AACjC,eAAO,MAAM,KAAK;;CAAY,CAAA;AAE9B,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AACxC,YAAY,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAA;AACpD,YAAY,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA"}

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA;AACzB,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA;AACzB,cAAc,mBAAmB,CAAA;AACjC,cAAc,wBAAwB,CAAA;AACtC,cAAc,qBAAqB,CAAA;AACnC,cAAc,gCAAgC,CAAA;AAC9C,cAAc,0CAA0C,CAAA;AACxD,cAAc,mCAAmC,CAAA;AACjD,cAAc,qBAAqB,CAAA;AACnC,cAAc,cAAc,CAAA;AAC5B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,aAAa,CAAA;AAC3B,cAAc,WAAW,CAAA;AACzB,cAAc,gBAAgB,CAAA;AAC9B,cAAc,mBAAmB,CAAA;AAEjC,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAErD,MAAM,CAAC,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,CAAA;AAE1C,OAAO,EAAE,IAAI,IAAI,YAAY,EAAE,MAAM,oBAAoB,CAAA;AAEzD,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAA;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAA;AACpD,OAAO,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAA;AACzC,MAAM,CAAC,MAAM,QAAQ,GAAG;IACtB,IAAI,EAAE,YAAY;IAClB,SAAS;IACT,SAAS;IACT,IAAI;CACL,CAAA;AAKD,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAGxC,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,CAAA;AAE9B,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA","sourcesContent":["export * from './build.ts'\nexport * from './edge.ts'\nexport * from './graph.ts'\nexport * from './node.ts'\nexport * from './dependencies.ts'\nexport * from './fixup-added-names.ts'\nexport * from './lockfile/types.ts'\nexport * from './visualization/json-output.ts'\nexport * from './visualization/human-readable-output.ts'\nexport * from './visualization/mermaid-output.ts'\nexport * from './stringify-node.ts'\nexport * from './install.ts'\nexport * from './uninstall.ts'\nexport * from './update.ts'\nexport * from './diff.ts'\nexport * from './modifiers.ts'\nexport * from './virtual-root.ts'\n\nimport { load as actualLoad } from './actual/load.ts'\nimport type { LoadOptions as ActualLoadOptions } from './actual/load.ts'\nexport const actual = { load: actualLoad }\n\nimport { load as lockfileLoad } from './lockfile/load.ts'\nimport type { LoadOptions as LockfileLoadOptions } from './lockfile/load.ts'\nimport { loadEdges } from './lockfile/load-edges.ts'\nimport { loadNodes } from './lockfile/load-nodes.ts'\nimport { save } from './lockfile/save.ts'\nexport const lockfile = {\n  load: lockfileLoad,\n  loadEdges,\n  loadNodes,\n  save,\n}\n\nexport type { ActualLoadOptions, LockfileLoadOptions }\nexport type { SaveOptions } from './lockfile/save.ts'\n\nimport { build } from './ideal/build.ts'\nimport type { BuildIdealOptions } from './ideal/build.ts'\nexport type { BuildIdealOptions }\nexport const ideal = { build }\n\nexport { reify } from './reify/index.ts'\nexport type { ReifyOptions } from './reify/index.ts'\nexport type { BuildResult } from './reify/build.ts'\n"]}

package/dist/install.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"install.d.ts","sourceRoot":"","sources":["../src/install.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,KAAK,EACV,2BAA2B,EAG5B,MAAM,mBAAmB,CAAA;AAE1B,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAM3C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAGvC,MAAM,MAAM,cAAc,GAAG,WAAW,GAAG;IACzC,WAAW,EAAE,iBAAiB,CAAA;IAC9B,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,YAAY,EAAE,MAAM,CAAA;CACrB,CAAA;AAED,eAAO,MAAM,OAAO,YACT,cAAc,QACjB,2BAA2B;;;;;;;;EAmOlC,CAAA"}

package/dist/install.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"install.js","sourceRoot":"","sources":["../src/install.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACrD,OAAO,EAAE,KAAK,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAE3C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAGvC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AAMnD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAExD,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,SAAS,CAAA;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AACnC,OAAO,EAAE,IAAI,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAA;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,+BAA+B,CAAA;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AAErC,OAAO,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAA;AAQ5E,MAAM,CAAC,MAAM,OAAO,GAAG,KAAK,EAC1B,OAAuB,EACvB,GAAiC,EACjC,EAAE;IACF,gCAAgC;IAChC,IAAI,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;QACjD,MAAM,KAAK,CACT,6GAA6G,CAC9G,CAAA;IACH,CAAC;IAED,IAAI,OAAO,CAAC,cAAc,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;QACrD,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,eAAe,CAAC,CAAA;QAClE,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;YAC9B,MAAM,KAAK,CACT,+FAA+F,EAC/F;gBACE,IAAI,EAAE,YAAY;aACnB,CACF,CAAA;QACH,CAAC;IACH,CAAC;IAED,IAAI,YAAY,GAAmC,SAAS,CAAA;IAC5D,IAAI,CAAC;QACH,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAC9D,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,KAAK,kCAAkC,EAAE,CAAC;YAChE,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAA;YACxC,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE;gBAC3D,MAAM,EAAE,IAAI;aACb,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,CAAA;QACX,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;QAC3B,mDAAmD;QACnD,IAAI,GAAG,EAAE,oBAAoB,EAAE,CAAC;YAC9B,MAAM,YAAY,GAAa,EAAE,CAAA;YACjC,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;oBAC1B,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzB,CAAC;YACH,CAAC;YACD,MAAM,KAAK,CACT,sDAAsD,EACtD,EAAE,KAAK,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACnC,CAAA;QACH,CAAC;QAED,MAAM,aAAa,GAAG,WAAW,CAAC;YAChC,GAAG,OAAO;YACV,YAAY;SACb,CAAC,CAAA;QAEF,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAC5B,IAAI,GAAG,EAAkC,EACzC,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAChC,CAAA;QACD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAsB,EAAE;YAC/D,oBAAoB,EAAE,KAAK;SAC5B,CAAC,CAAA;QACF,MAAM,aAAa,GAAG,gBAAgB,CAAC;YACrC,KAAK,EAAE,aAAa;YACpB,GAAG,EAAE,QAAQ;YACb,MAAM,EAAE,WAAW;YACnB,GAAG,OAAO;SACX,CAAC,CAAA;QAEF,6EAA6E;QAC7E,MAAM,WAAW,GAAa,EAAE,CAAA;QAChC,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,SAAS,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;YAC/C,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBAC3C,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC;oBACf,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;wBACjD,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;wBACjD,oBAAoB;wBACpB,MAAM,QAAQ,GAAG,IAAI,EAAE,QAAQ,IAAI,QAAQ,CAAC,EAAE,CAAA;wBAC9C,WAAW,CAAC,IAAI,CACd,KAAK,QAAQ,KAAK,OAAO,uBAAuB,IAAI,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,GAAG,CAC9E,CAAA;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IACE,aAAa,CAAC,GAAG,CAAC,oBAAoB;YACtC,aAAa,CAAC,MAAM,CAAC,oBAAoB;YACzC,WAAW,CAAC,MAAM,GAAG,CAAC,EACtB,CAAC;YACD,MAAM,OAAO,GAAa,EAAE,CAAA;YAE5B,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAA;YAC9B,CAAC;YAED,KAAK,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,GAAG,EAAE,CAAC;gBACnD,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBAClB,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;oBAChD,MAAM,QAAQ,GAAG,IAAI,EAAE,QAAQ,IAAI,UAAU,CAAA;oBAC7C,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;oBACxC,MAAM,WAAW,GACf,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAA;oBACjD,OAAO,CAAC,IAAI,CACV,KAAK,QAAQ,KAAK,IAAI,CAAC,IAAI,IAAI,WAAW,YAAY,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC7E,CAAA;gBACH,CAAC;YACH,CAAC;YAED,KAAK,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,MAAM,EAAE,CAAC;gBACtD,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBAClB,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;oBAChD,MAAM,QAAQ,GAAG,IAAI,EAAE,QAAQ,IAAI,UAAU,CAAA;oBAC7C,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACjC,MAAM,cAAc,GAClB,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;wBACf,YAAY;wBACd,CAAC,CAAC,oBAAoB,CAAC,cAAc,CAAA;oBACvC,OAAO,CAAC,IAAI,CACV,KAAK,QAAQ,KAAK,IAAI,CAAC,IAAI,IAAI,cAAc,eAAe,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CACnF,CAAA;gBACH,CAAC;YACH,CAAC;YAED,MAAM,YAAY,GAAG,OAAO,CAC1B,OAAO,CAAC,WAAW,EACnB,eAAe,CAChB,CAAA;YACD,MAAM,KAAK,CACT,2EAA2E;gBACzE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EACpB;gBACE,IAAI,EAAE,YAAY;aACnB,CACF,CAAA;QACH,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,cAAc,EAAE,CAAA;IACpC,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;QACzB,MAAM,eAAe,GAAG,OAAO,CAC7B,OAAO,CAAC,WAAW,EACnB,cAAc,CACf,CAAA;QACD,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;YAChC,MAAM,OAAO,CAAC,EAAE,CAAC,eAAe,CAAC,CAAA;YACjC,OAAO,CAAC,OAAO,EAAE,CAAA;QACnB,CAAC;IACH,CAAC;IAED,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAsB,EAAE;YAC1D,oBAAoB,EAAE,KAAK;SAC5B,CAAmC,CAAA;QACpC,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;QAElD,IAAI,GAAG,GAAsB,UAAU,CAAC;YACtC,GAAG,OAAO;YACV,YAAY;YACZ,aAAa,EAAE,IAAI;YACnB,SAAS,EAAE,SAAS,EAAE,oCAAoC;SAC3D,CAAC,CAAA;QACF,qEAAqE;QACrE,qEAAqE;QACrE,0EAA0E;QAC1E,IAAI,GAAG,CAAC,SAAS,CAAC,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1C,GAAG,GAAG,SAAS,CAAA;QACjB,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC;YAC7B,GAAG,OAAO;YACV,MAAM,EAAE,GAAG;YACX,GAAG;YACH,YAAY;YACZ,aAAa,EAAE,IAAI;YACnB,SAAS;YACT,MAAM;YACN,OAAO;SACR,CAAC,CAAA;QAEF,oEAAoE;QACpE,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YACzB,8DAA8D;YAC9D,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAA;YACnC,MAAM,wBAAwB;YAC5B,oBAAoB;YACpB,GAAG,EAAE,oBAAoB,IAAI,MAAM,CAAC,oBAAoB,CAAC,CAAC;gBACxD,iBAAiB,CAAC;oBAChB,GAAG,OAAO;oBACV,GAAG;oBACH,KAAK;oBACL,MAAM;iBACP,CAAC;gBACJ,CAAC,CAAC,SAAS,CAAA;YACb,wBAAwB,EAAE,EAAE,CAAA;YAC5B,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAA;QACnC,CAAC;QAED,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,MAAM,KAAK,CAAC;YACvC,GAAG,OAAO;YACV,GAAG;YACH,MAAM,EAAE,GAAG;YACX,KAAK;YACL,aAAa,EAAE,IAAI;YACnB,SAAS;YACT,MAAM;YACN,OAAO;SACR,CAAC,CAAA;QAEF,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;IACpC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,oBAAoB;QACpB,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACxC,oCAAoC;QACpC,IAAI,CAAC;YACH,MAAM,cAAc,GAAG,OAAO,CAC5B,OAAO,CAAC,WAAW,EACnB,6BAA6B,CAC9B,CAAA;YACD,IAAI,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAA,CAAC;QACV,MAAM,GAAG,CAAA;IACX,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { load as actualLoad } from './actual/load.ts'\nimport { build as idealBuild } from './ideal/build.ts'\nimport { reify } from './reify/index.ts'\nimport { GraphModifier } from './modifiers.ts'\nimport { init } from '@vltpkg/init'\nimport { error } from '@vltpkg/error-cause'\nimport type { NormalizedManifest } from '@vltpkg/types'\nimport { asError } from '@vltpkg/types'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { LoadOptions } from './actual/load.ts'\nimport { getDependencies } from './dependencies.ts'\nimport type {\n  AddImportersDependenciesMap,\n  Dependency,\n  RemoveImportersDependenciesMap,\n} from './dependencies.ts'\nimport { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { existsSync, rmSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { load as loadVirtual } from './lockfile/load.ts'\nimport { getImporterSpecs } from './ideal/get-importer-specs.ts'\nimport { lockfile } from './index.ts'\nimport type { Graph } from './index.ts'\nimport { updatePackageJson } from './reify/update-importers-package-json.ts'\n\nexport type InstallOptions = LoadOptions & {\n  packageInfo: PackageInfoClient\n  cleanInstall?: boolean // Only set by ci command for clean install\n  allowScripts: string\n}\n\nexport const install = async (\n  options: InstallOptions,\n  add?: AddImportersDependenciesMap,\n) => {\n  // Validate incompatible options\n  if (options.lockfileOnly && options.cleanInstall) {\n    throw error(\n      'Cannot use --lockfile-only with --clean-install (ci command). Clean install requires filesystem operations.',\n    )\n  }\n\n  if (options.expectLockfile || options.frozenLockfile) {\n    const lockfilePath = resolve(options.projectRoot, 'vlt-lock.json')\n    if (!existsSync(lockfilePath)) {\n      throw error(\n        'vlt-lock.json file is required when using --expect-lockfile, --frozen-lockfile, or ci command',\n        {\n          path: lockfilePath,\n        },\n      )\n    }\n  }\n\n  let mainManifest: NormalizedManifest | undefined = undefined\n  try {\n    mainManifest = options.packageJson.read(options.projectRoot)\n  } catch (err) {\n    if (asError(err).message === 'Could not read package.json file') {\n      await init({ cwd: options.projectRoot })\n      mainManifest = options.packageJson.read(options.projectRoot, {\n        reload: true,\n      })\n    } else {\n      throw err\n    }\n  }\n\n  if (options.frozenLockfile) {\n    // validates no add/remove operations are requested\n    if (add?.modifiedDependencies) {\n      const dependencies: string[] = []\n      for (const [, deps] of add) {\n        for (const [name] of deps) {\n          dependencies.push(name)\n        }\n      }\n      throw error(\n        'Cannot add dependencies when using --frozen-lockfile',\n        { found: dependencies.join(', ') },\n      )\n    }\n\n    const lockfileGraph = loadVirtual({\n      ...options,\n      mainManifest,\n    })\n\n    const emptyAdd = Object.assign(\n      new Map<DepID, Map<string, Dependency>>(),\n      { modifiedDependencies: false },\n    )\n    const emptyRemove = Object.assign(new Map<DepID, Set<string>>(), {\n      modifiedDependencies: false,\n    })\n    const importerSpecs = getImporterSpecs({\n      graph: lockfileGraph,\n      add: emptyAdd,\n      remove: emptyRemove,\n      ...options,\n    })\n\n    // Check for spec changes by comparing package.json specs with lockfile edges\n    const specChanges: string[] = []\n    for (const importer of lockfileGraph.importers) {\n      const deps = getDependencies(importer, options)\n      for (const [depName, dep] of deps) {\n        const edge = importer.edgesOut.get(depName)\n        if (edge?.spec) {\n          if (edge.spec.toString() !== dep.spec.toString()) {\n            const node = lockfileGraph.nodes.get(importer.id)\n            /* c8 ignore next */\n            const location = node?.location || importer.id\n            specChanges.push(\n              `  ${location}: ${depName} spec changed from \"${edge.spec}\" to \"${dep.spec}\"`,\n            )\n          }\n        }\n      }\n    }\n\n    if (\n      importerSpecs.add.modifiedDependencies ||\n      importerSpecs.remove.modifiedDependencies ||\n      specChanges.length > 0\n    ) {\n      const details: string[] = []\n\n      if (specChanges.length > 0) {\n        details.push(...specChanges)\n      }\n\n      for (const [importerId, deps] of importerSpecs.add) {\n        if (deps.size > 0) {\n          const node = lockfileGraph.nodes.get(importerId)\n          const location = node?.location || importerId\n          const depNames = Array.from(deps.keys())\n          const depLabelAdd =\n            deps.size === 1 ? 'dependency' : 'dependencies'\n          details.push(\n            `  ${location}: ${deps.size} ${depLabelAdd} to add (${depNames.join(', ')})`,\n          )\n        }\n      }\n\n      for (const [importerId, deps] of importerSpecs.remove) {\n        if (deps.size > 0) {\n          const node = lockfileGraph.nodes.get(importerId)\n          const location = node?.location || importerId\n          const depNames = Array.from(deps)\n          const depLabelRemove =\n            deps.size === 1 ?\n              'dependency'\n            : /* c8 ignore next */ 'dependencies'\n          details.push(\n            `  ${location}: ${deps.size} ${depLabelRemove} to remove (${depNames.join(', ')})`,\n          )\n        }\n      }\n\n      const lockfilePath = resolve(\n        options.projectRoot,\n        'vlt-lock.json',\n      )\n      throw error(\n        'Lockfile is out of sync with package.json. Run \"vlt install\" to update.\\n' +\n          details.join('\\n'),\n        {\n          path: lockfilePath,\n        },\n      )\n    }\n  }\n\n  const remover = new RollbackRemove()\n  if (options.cleanInstall) {\n    const nodeModulesPath = resolve(\n      options.projectRoot,\n      'node_modules',\n    )\n    if (existsSync(nodeModulesPath)) {\n      await remover.rm(nodeModulesPath)\n      remover.confirm()\n    }\n  }\n\n  try {\n    const remove = Object.assign(new Map<DepID, Set<string>>(), {\n      modifiedDependencies: false,\n    }) as RemoveImportersDependenciesMap\n    const modifiers = GraphModifier.maybeLoad(options)\n\n    let act: Graph | undefined = actualLoad({\n      ...options,\n      mainManifest,\n      loadManifests: true,\n      modifiers: undefined, // modifiers should not be used here\n    })\n    // if the actual graph has no dependencies, it's simpler to ignore it\n    // this allows us to check for its availability later on for properly\n    // handling situations like resetting edges for refreshing the ideal graph\n    if (act.importers.size === act.nodes.size) {\n      act = undefined\n    }\n    const graph = await idealBuild({\n      ...options,\n      actual: act,\n      add,\n      mainManifest,\n      loadManifests: true,\n      modifiers,\n      remove,\n      remover,\n    })\n\n    // If lockfileOnly is enabled, skip reify and only save the lockfile\n    if (options.lockfileOnly) {\n      // Save only the main lockfile, skip all filesystem operations\n      lockfile.save({ graph, modifiers })\n      const saveImportersPackageJson =\n        /* c8 ignore next */\n        add?.modifiedDependencies || remove.modifiedDependencies ?\n          updatePackageJson({\n            ...options,\n            add,\n            graph,\n            remove,\n          })\n        : undefined\n      saveImportersPackageJson?.()\n      return { graph, diff: undefined }\n    }\n\n    const { diff, buildQueue } = await reify({\n      ...options,\n      add,\n      actual: act,\n      graph,\n      loadManifests: true,\n      modifiers,\n      remove,\n      remover,\n    })\n\n    return { buildQueue, graph, diff }\n  } catch (err) {\n    /* c8 ignore next */\n    await remover.rollback().catch(() => {})\n    // Remove hidden lockfile on failure\n    try {\n      const hiddenLockfile = resolve(\n        options.projectRoot,\n        'node_modules/.vlt-lock.json',\n      )\n      if (existsSync(hiddenLockfile)) {\n        rmSync(hiddenLockfile, { force: true })\n      }\n    } catch {}\n    throw err\n  }\n}\n"]}

package/dist/lockfile/load-edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"load-edges.d.ts","sourceRoot":"","sources":["../../src/lockfile/load-edges.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAA;AAC3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAEvD,OAAO,KAAK,EACV,mBAAmB,EACnB,SAAS,EACT,QAAQ,EACT,MAAM,eAAe,CAAA;AAEtB,OAAO,KAAK,EACV,YAAY,EAGb,MAAM,YAAY,CAAA;AAEnB,MAAM,MAAM,cAAc,GAAG;IAC3B,QAAQ,EAAE,QAAQ,CAAA;IAClB,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC5B,OAAO,EAAE,mBAAmB,CAAA;IAC5B,IAAI,EAAE,IAAI,CAAA;CACX,CAAA;AA0BD,eAAO,MAAM,SAAS,UACb,SAAS,SACT,YAAY,CAAC,OAAO,CAAC,WACnB,WAAW,SAuGrB,CAAA"}

package/dist/lockfile/load-edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"load-edges.js","sourceRoot":"","sources":["../../src/lockfile/load-edges.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAA;AAChD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAA;AAE3C,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAA;AAMnD,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAA;AAc1D,MAAM,qBAAqB,GAAG,CAC5B,GAAW,EACX,KAAa,EACb,KAAgB,EAChB,MAAc,EACd,SAAiC,EACvB,EAAE;IACZ,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAA;IAClD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,KAAK,CAAC,mCAAmC,EAAE;YAC/C,KAAK,EAAE;gBACL,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBACzC,IAAI,EAAE,SAAS;gBACf,MAAM;gBACN,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE;aACvB;SACF,CAAC,CAAA;IACJ,CAAC;IACD,IAAI,SAAS,EAAE,CAAC;QACd,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAClC,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAgB,EAChB,KAA4B,EAC5B,OAAoB,EACpB,EAAE;IACF,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAGjC,CAAA;IAEH,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAA;IAChC,gDAAgD;IAChD,MAAM,gBAAgB,GAAG,SAAS,GAAG,EAAE,CAAA;IACvC,MAAM,mBAAmB,GAAqB,EAAE,CAAA;IAEhD,oEAAoE;IACpE,MAAM,SAAS,GACb,gBAAgB,CAAC,CAAC,CAAC,IAAI,GAAG,EAAoB,CAAC,CAAC,CAAC,SAAS,CAAA;IAE5D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACnC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QACjD,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QACnD,MAAM,OAAO,GAAG,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;QAE/C,0BAA0B;QAC1B,qBAAqB;QACrB,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChE,SAAQ;QACV,CAAC;QACD,oBAAoB;QAEpB,iCAAiC;QACjC,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,MAAM,KAAK,CAAC,+CAA+C,EAAE;gBAC3D,YAAY,EAAE,CAAC,GAAG,mBAAmB,CAAC;aACvC,CAAC,CAAA;QACJ,CAAC;QAED,wEAAwE;QACxE,IAAI,QAAkB,CAAA;QACtB,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAClC,IAAI,IAAI,EAAE,CAAC;gBACT,QAAQ,GAAG,IAAI,CAAA;YACjB,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,qBAAqB,CAC9B,GAAG,EACH,KAAK,EACL,KAAK,EACL,MAAM,EACN,SAAS,CACV,CAAA;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,qBAAqB,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;QAC7D,CAAC;QAED,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA;QAC3C,IAAI,MAAM,GAAyB,SAAS,CAAA;QAE5C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAChC,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,GAAG,IAAI,CAAA;gBACf,CAAC;qBAAM,CAAC;oBACN,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAA;oBACvC,IAAI,MAAM,EAAE,CAAC;wBACX,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;oBAC7B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE;YAC/D,GAAG,OAAO;YACV,QAAQ,EAAE,QAAQ,CAAC,QAAQ;SAC5B,CAAC,CAAA;QAEF,IAAI,gBAAgB,EAAE,CAAC;YACrB,mBAAmB,CAAC,IAAI,CAAC;gBACvB,QAAQ;gBACR,MAAM;gBACN,OAAO;gBACP,IAAI;aACL,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,uCAAuC;YACvC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAChD,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,IAAI,gBAAgB,EAAE,CAAC;QACrB,KAAK,MAAM,EACT,QAAQ,EACR,MAAM,EACN,OAAO,EACP,IAAI,GACL,IAAI,mBAAmB,EAAE,CAAC;YACzB,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAChD,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { asDepID } from '@vltpkg/dep-id/browser'\nimport { error } from '@vltpkg/error-cause'\nimport { fastSplit } from '@vltpkg/fast-split'\nimport { Spec } from '@vltpkg/spec/browser'\nimport type { SpecOptions } from '@vltpkg/spec/browser'\nimport { longDependencyTypes } from '@vltpkg/types'\nimport type {\n  DependencyTypeShort,\n  GraphLike,\n  NodeLike,\n} from '@vltpkg/types'\nimport { isDependencyTypeShort } from '../dependencies.ts'\nimport type {\n  LockfileData,\n  LockfileEdgeKey,\n  LockfileEdgeValue,\n} from './types.ts'\n\nexport type ProcessingEdge = {\n  fromNode: NodeLike\n  toNode: NodeLike | undefined\n  depType: DependencyTypeShort\n  spec: Spec\n}\n\nconst retrieveNodeFromGraph = (\n  key: string,\n  value: string,\n  graph: GraphLike,\n  fromId: string,\n  seenNodes?: Map<string, NodeLike>,\n): NodeLike => {\n  const foundNode = graph.nodes.get(asDepID(fromId))\n  if (!foundNode) {\n    throw error('Edge info missing its `from` node', {\n      found: {\n        nodes: [...graph.nodes].map(([id]) => id),\n        from: foundNode,\n        fromId,\n        edge: { [key]: value },\n      },\n    })\n  }\n  if (seenNodes) {\n    seenNodes.set(fromId, foundNode)\n  }\n  return foundNode\n}\n\nexport const loadEdges = (\n  graph: GraphLike,\n  edges: LockfileData['edges'],\n  options: SpecOptions,\n) => {\n  const entries = Object.entries(edges) as [\n    LockfileEdgeKey,\n    LockfileEdgeValue,\n  ][]\n\n  const edgeCount = entries.length\n  // Only use optimizations for non-trivial graphs\n  const useOptimizations = edgeCount > 50\n  const edgeProcessingQueue: ProcessingEdge[] = []\n\n  // Cache for frequently accessed nodes to avoid repeated Map lookups\n  const seenNodes =\n    useOptimizations ? new Map<string, NodeLike>() : undefined\n\n  for (const [key, value] of entries) {\n    const [fromId, specName] = fastSplit(key, ' ', 2)\n    const [depType, valRest] = fastSplit(value, ' ', 2)\n    const vrSplit = valRest?.lastIndexOf(' ') ?? -1\n\n    // not a valid edge record\n    /* c8 ignore start */\n    if (!valRest || !depType || !fromId || !specName || vrSplit < 1) {\n      continue\n    }\n    /* c8 ignore stop */\n\n    // Validate dependency type early\n    if (!isDependencyTypeShort(depType)) {\n      throw error('Found unsupported dependency type in lockfile', {\n        validOptions: [...longDependencyTypes],\n      })\n    }\n\n    // Use cached node lookup for large graphs, direct lookup for small ones\n    let fromNode: NodeLike\n    if (seenNodes) {\n      const seen = seenNodes.get(fromId)\n      if (seen) {\n        fromNode = seen\n      } else {\n        fromNode = retrieveNodeFromGraph(\n          key,\n          value,\n          graph,\n          fromId,\n          seenNodes,\n        )\n      }\n    } else {\n      fromNode = retrieveNodeFromGraph(key, value, graph, fromId)\n    }\n\n    const toId = valRest.substring(vrSplit + 1)\n    let toNode: NodeLike | undefined = undefined\n\n    if (toId !== 'MISSING') {\n      if (seenNodes) {\n        const seen = seenNodes.get(toId)\n        if (seen) {\n          toNode = seen\n        } else {\n          toNode = graph.nodes.get(asDepID(toId))\n          if (toNode) {\n            seenNodes.set(toId, toNode)\n          }\n        }\n      } else {\n        toNode = graph.nodes.get(asDepID(toId))\n      }\n    }\n\n    // Parse spec once we know the nodes are valid\n    const spec = Spec.parse(specName, valRest.substring(0, vrSplit), {\n      ...options,\n      registry: fromNode.registry,\n    })\n\n    if (useOptimizations) {\n      edgeProcessingQueue.push({\n        fromNode,\n        toNode,\n        depType,\n        spec,\n      })\n    } else {\n      // Process immediately for small graphs\n      graph.addEdge(depType, spec, fromNode, toNode)\n    }\n  }\n\n  // Batch process all edges (only for non-trivial graphs)\n  if (useOptimizations) {\n    for (const {\n      fromNode,\n      toNode,\n      depType,\n      spec,\n    } of edgeProcessingQueue) {\n      graph.addEdge(depType, spec, fromNode, toNode)\n    }\n  }\n}\n"]}

package/dist/lockfile/load-nodes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"load-nodes.d.ts","sourceRoot":"","sources":["../../src/lockfile/load-nodes.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,YAAY,EAAgB,MAAM,YAAY,CAAA;AAE5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAA;AAC9C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAEvD,eAAO,MAAM,SAAS,UACb,SAAS,SACT,YAAY,CAAC,OAAO,CAAC,WACnB,WAAW,WACX,SAAS,2BACO,OAAO,SAmIjC,CAAA"}

package/dist/lockfile/load-nodes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"load-nodes.js","sourceRoot":"","sources":["../../src/lockfile/load-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAA;AAC/D,OAAO,EACL,sBAAsB,EACtB,oBAAoB,GACrB,MAAM,YAAY,CAAA;AAMnB,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAgB,EAChB,KAA4B,EAC5B,OAAoB,EACpB,MAAkB,EAClB,sBAAgC,EAChC,EAAE;IACF,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAA4B,CAAA;IAChE,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAA;IAEhC,8DAA8D;IAC9D,mCAAmC;IACnC,MAAM,oBAAoB,GACxB,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,EAAkB,CAAC,CAAC,CAAC,IAAI,CAAA;IAEnD,KAAK,MAAM,CAAC,EAAE,EAAE,YAAY,CAAC,IAAI,OAAO,EAAE,CAAC;QACzC,MAAM,CACJ,KAAK,EACL,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,WAAW,EACX,QAAQ,EACR,IAAI,EACJ,UAAU,EACX,GAAG,YAAY,CAAA;QAChB,oEAAoE;QACpE,uEAAuE;QACvE,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QAEjC,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAA;QAC9D,MAAM,KAAK,GACT,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAA;QAChE,MAAM,YAAY,GAAG,UAAU,CAAA;QAE/B,iEAAiE;QACjE,qEAAqE;QACrE,iEAAiE;QACjE,wCAAwC;QACxC,MAAM,aAAa,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC3C,MAAM,IAAI,GAAG,QAAQ,IAAI,aAAa,EAAE,QAAQ,CAAA;QAEhD,yDAAyD;QACzD,IAAI,CAAC,IAAI,IAAI,sBAAsB,EAAE,CAAC;YACpC,MAAM,KAAK,CACT,6BAA6B,EAAE,+BAA+B,CAC/D,CAAA;QACH,CAAC;QAED,qEAAqE;QACrE,IAAI,OAA2B,CAAA;QAC/B,IACE,IAAI,KAAK,UAAU;YACnB,YAAY;YACZ,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAC7B,CAAC;YACD,IAAI,oBAAoB,EAAE,CAAC;gBACzB,MAAM,WAAW,GAAG,oBAAoB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;gBAC1D,qBAAqB;gBACrB,IAAI,WAAW,EAAE,CAAC;oBAChB,OAAO,GAAG,WAAW,CAAA;gBACvB,CAAC;qBAAM,CAAC;oBACN,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;oBAC3D,oBAAoB;oBACpB,IAAI,OAAO,EAAE,CAAC;wBACZ,oBAAoB,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;oBACjD,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;YAC7D,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,uEAAuE;QACvE,MAAM,IAAI,GACR,IAAI,CAAC,CAAC;YACJ,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC;YACzB,CAAC,CAAC,KAAK,CAAC,OAAO,CACX,EAAE,EACF,SAAS,EACT,SAAS,EACT,IAAI,IAAI,SAAS,EACjB,OAAO,CACR,CAAA;QAEL,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;YACnD,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC1B,CAAC;YACD,IAAI,WAAW,EAAE,CAAC;gBAChB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;YAChC,CAAC;QACH,CAAC;QAED,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAA;QACvD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI,aAAa,EAAE,SAAS,CAAA;QACtD,IAAI,CAAC,QAAQ;YACX,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAC7B,CAAC,QAAQ,IAAI,aAAa,EAAE,QAAQ,CAAC,CACtC,CAAA;QACH,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAA;QACpC,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,WAAW,EAAE,CAAA;QACtC,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QAC1B,CAAC;aAAM,CAAC;YACN,8DAA8D;YAC9D,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;gBACpB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC1B,CAAC;QACH,CAAC;QACD,IAAI,IAAI,IAAI,WAAW,EAAE,CAAC;YACxB,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;QAC7C,CAAC;QAED,gCAAgC;QAChC,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QAC1B,CAAC;QAED,sCAAsC;QACtC,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAClB,CAAC;QAED,8BAA8B;QAC9B,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACpD,IAAI,CAAC,UAAU,GAAG,oBAAoB,CAAC,UAAU,CAAC,CAAA;QACpD,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport { splitDepID, splitExtra } from '@vltpkg/dep-id/browser'\nimport {\n  getBooleanFlagsFromNum,\n  getBuildStateFromNum,\n} from './types.ts'\nimport type { LockfileData, LockfileNode } from './types.ts'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { GraphLike } from '@vltpkg/types'\nimport type { SpecOptions } from '@vltpkg/spec/browser'\n\nexport const loadNodes = (\n  graph: GraphLike,\n  nodes: LockfileData['nodes'],\n  options: SpecOptions,\n  actual?: GraphLike,\n  throwOnMissingManifest?: boolean,\n) => {\n  const entries = Object.entries(nodes) as [DepID, LockfileNode][]\n  const nodeCount = entries.length\n\n  // Batch process registry spec parsing (only for large graphs)\n  // Only used for non-trivial graphs\n  const registryVersionCache =\n    nodeCount > 50 ? new Map<string, string>() : null\n\n  for (const [id, lockfileNode] of entries) {\n    const [\n      flags,\n      name,\n      integrity,\n      resolved,\n      location,\n      manifest,\n      rawManifest,\n      platform,\n      bins,\n      buildState,\n    ] = lockfileNode\n    // workspace nodes and the project root node are already part of the\n    // graph and it should not create new nodes if an existing one is there\n    if (graph.nodes.has(id)) continue\n\n    const [type, filepath, maybeExtra, lastExtra] = splitDepID(id)\n    const extra =\n      type === 'registry' || type === 'git' ? lastExtra : maybeExtra\n    const registrySpec = maybeExtra\n\n    // The reference node is a node that matches the same id from the\n    // current iterating node in the provided `actual` graph, this allows\n    // for hydrating missing manifest, integrity, and resolved values\n    // that may be missing from the lockfile\n    const referenceNode = actual?.nodes.get(id)\n    const mani = manifest ?? referenceNode?.manifest\n\n    // Throw if manifest is missing and the option is enabled\n    if (!mani && throwOnMissingManifest) {\n      throw error(\n        `Missing manifest for node ${id} and no reference node found.`,\n      )\n    }\n\n    // Optimize registry version extraction with caching for large graphs\n    let version: string | undefined\n    if (\n      type === 'registry' &&\n      registrySpec &&\n      registrySpec.indexOf('@') > 0\n    ) {\n      if (registryVersionCache) {\n        const seenVersion = registryVersionCache.get(registrySpec)\n        /* c8 ignore start */\n        if (seenVersion) {\n          version = seenVersion\n        } else {\n          version = registrySpec.split('@').slice(-1)[0] || undefined\n          /* c8 ignore stop */\n          if (version) {\n            registryVersionCache.set(registrySpec, version)\n          }\n        }\n      } else {\n        version = registrySpec.split('@').slice(-1)[0] || undefined\n      }\n    }\n\n    // if the lockfile has manifest data then it should just use that\n    // otherwise tries to infer name / version value from the lockfile node\n    const node =\n      mani ?\n        graph.addNode(id, mani)\n      : graph.addNode(\n          id,\n          undefined,\n          undefined,\n          name ?? undefined,\n          version,\n        )\n\n    if (extra) {\n      const { modifier, peerSetHash } = splitExtra(extra)\n      if (modifier) {\n        node.modifier = modifier\n      }\n      if (peerSetHash) {\n        node.peerSetHash = peerSetHash\n      }\n    }\n\n    const { dev, optional } = getBooleanFlagsFromNum(flags)\n    node.options = options\n    node.dev = dev\n    node.optional = optional\n    node.integrity = integrity ?? referenceNode?.integrity\n    node.resolved =\n      type === 'remote' ? filepath : (\n        (resolved ?? referenceNode?.resolved)\n      )\n    node.projectRoot = graph.projectRoot\n    if (!node.resolved) node.setResolved()\n    if (location) {\n      node.location = location\n    } else {\n      // set the location to file dependencies based on the id value\n      if (type === 'file') {\n        node.location = filepath\n      }\n    }\n    if (mani && rawManifest) {\n      node.setConfusedManifest(mani, rawManifest)\n    }\n\n    // Set platform data if provided\n    if (platform) {\n      node.platform = platform\n    }\n\n    // optionally set bin data if provided\n    if (bins) {\n      node.bins = bins\n    }\n\n    // Set build state if provided\n    if (buildState !== undefined && buildState !== null) {\n      node.buildState = getBuildStateFromNum(buildState)\n    }\n  }\n}\n"]}

package/dist/lockfile/load.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../../src/lockfile/load.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAK7C,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACnC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AACvD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAC9C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAEpD,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACtC;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IACd;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;IACnB;;OAEG;IACH,YAAY,EAAE,kBAAkB,CAAA;IAChC;;OAEG;IACH,SAAS,CAAC,EAAE,aAAa,CAAA;IACzB;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAA;IACnB;;OAEG;IACH,WAAW,CAAC,EAAE,WAAW,CAAA;IACzB;;OAEG;IACH,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB;;OAEG;IACH,sBAAsB,CAAC,EAAE,OAAO,CAAA;CACjC,CAAA;AASD,eAAO,MAAM,IAAI,YAAa,WAAW,KAAG,KAM3C,CAAA;AAED,eAAO,MAAM,UAAU,YAAa,WAAW,KAAG,KAQjD,CAAA;AAED,eAAO,MAAM,UAAU,YACZ,WAAW,gBACN,IAAI,CAAC,YAAY,EAAE,SAAS,GAAG,iBAAiB,CAAC,GAC7D,OAAO,CAAC,IAAI,CAAC,YAAY,EAAE,SAAS,GAAG,iBAAiB,CAAC,CAAC,UAgE7D,CAAA"}

package/dist/lockfile/load.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"load.js","sourceRoot":"","sources":["../../src/lockfile/load.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AACtC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AACnC,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AA0CnC,MAAM,YAAY,GAAG,CAAC,WAAmB,EAAE,YAAoB,EAAE,EAAE,CACjE,IAAI,CAAC,KAAK,CACR,YAAY,CAAC,OAAO,CAAC,WAAW,EAAE,YAAY,CAAC,EAAE;IAC/C,QAAQ,EAAE,MAAM;CACjB,CAAC,CACa,CAAA;AAEnB,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,OAAoB,EAAS,EAAE;IAClD,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAA;IAC/B,OAAO,UAAU,CACf,OAAO,EACP,YAAY,CAAC,WAAW,EAAE,eAAe,CAAC,CAC3C,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,OAAoB,EAAS,EAAE;IACxD,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAA;IAC/B,6EAA6E;IAC7E,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAA;IACrC,OAAO,UAAU,CACf,OAAO,EACP,YAAY,CAAC,WAAW,EAAE,6BAA6B,CAAC,CACzD,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,OAAoB,EACpB,YAC4D,EAC5D,EAAE;IACF,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IACxC,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,IAAI,WAAW,EAAE,CAAA;IAC5D,MAAM,QAAQ,GACZ,OAAO,CAAC,QAAQ;QAChB,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAA;IAClE,MAAM,EACJ,OAAO,GAAG,EAAE,EACZ,QAAQ,GAAG,EAAE,EACb,kBAAkB,EAAE,eAAe,EACnC,QAAQ,EACR,UAAU,EACV,WAAW,EAAE,QAAQ,EACrB,mBAAmB,EAAE,eAAe;IACpC,oBAAoB;MACrB,GAAG,YAAY,CAAC,OAAO,IAAI,EAAE,CAAA;IAE9B,iEAAiE;IACjE,MAAM,aAAa,GAAG;QACpB,GAAG,OAAO;QACV,OAAO;QACP,QAAQ;QACR,kBAAkB,EAChB,eAAe,CAAC,CAAC;YACf,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC,EAAE,GAAG,eAAe,EAAE;YACxD,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC/B,QAAQ,EAAE,QAAQ,IAAI,OAAO,CAAC,QAAQ;QACtC,UAAU,EACR,UAAU,CAAC,CAAC;YACV,EAAE,GAAG,OAAO,CAAC,UAAU,EAAE,GAAG,UAAU,EAAE;YAC1C,CAAC,CAAC,OAAO,CAAC,UAAU;QACtB,WAAW,EACT,QAAQ,CAAC,CAAC;YACR,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC,EAAE,GAAG,QAAQ,EAAE;YAC1C,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;QACxB,mBAAmB,EACjB,eAAe,CAAC,CAAC;YACf,EAAE,GAAG,OAAO,CAAC,mBAAmB,CAAC,EAAE,GAAG,eAAe,EAAE;YACzD,CAAC,CAAC,OAAO,CAAC,mBAAmB,CAAC;KACjC,CAAA;IACD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,GAAG,aAAa;QAChB,YAAY;QACZ,QAAQ;KACT,CAAC,CAAA;IACF,SAAS,CACP,KAAK,EACL,YAAY,CAAC,KAAK,EAClB,aAAa,EACb,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,sBAAsB,CAC/B,CAAA;IACD,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,aAAa,CAAC,CAAA;IAEnD,2CAA2C;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;QAChC,IAAI,SAAS,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAA;QACzC,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA","sourcesContent":["import { PackageJson } from '@vltpkg/package-json'\nimport { Monorepo } from '@vltpkg/workspaces'\nimport { readFileSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { loadEdges } from './load-edges.ts'\nimport { loadNodes } from './load-nodes.ts'\nimport { Graph } from '../graph.ts'\nimport type { PathScurry } from 'path-scurry'\nimport type { NormalizedManifest } from '@vltpkg/types'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { LockfileData } from './types.ts'\nimport type { GraphModifier } from '../modifiers.ts'\n\nexport type LoadOptions = SpecOptions & {\n  /**\n   * An optional {@link Graph} object to hydrate extra data from.\n   */\n  actual?: Graph\n  /**\n   * The project root dirname.\n   */\n  projectRoot: string\n  /**\n   * The project root manifest.\n   */\n  mainManifest: NormalizedManifest\n  /**\n   * The graph modifiers helper object.\n   */\n  modifiers?: GraphModifier\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * A {@link PackageJson} object, for sharing manifest caches\n   */\n  packageJson?: PackageJson\n  /**\n   * A {@link PathScurry} object, for use in globs\n   */\n  scurry?: PathScurry\n  /**\n   * Whether to throw an error if a manifest is missing when loading nodes.\n   */\n  throwOnMissingManifest?: boolean\n}\n\nconst loadLockfile = (projectRoot: string, lockfilePath: string) =>\n  JSON.parse(\n    readFileSync(resolve(projectRoot, lockfilePath), {\n      encoding: 'utf8',\n    }),\n  ) as LockfileData\n\nexport const load = (options: LoadOptions): Graph => {\n  const { projectRoot } = options\n  return loadObject(\n    options,\n    loadLockfile(projectRoot, 'vlt-lock.json'),\n  )\n}\n\nexport const loadHidden = (options: LoadOptions): Graph => {\n  const { projectRoot } = options\n  // Ensure that missing manifests throw an error when loading hidden lockfiles\n  options.throwOnMissingManifest = true\n  return loadObject(\n    options,\n    loadLockfile(projectRoot, 'node_modules/.vlt-lock.json'),\n  )\n}\n\nexport const loadObject = (\n  options: LoadOptions,\n  lockfileData: Omit<LockfileData, 'options' | 'lockfileVersion'> &\n    Partial<Pick<LockfileData, 'options' | 'lockfileVersion'>>,\n) => {\n  const { mainManifest, scurry } = options\n  const packageJson = options.packageJson ?? new PackageJson()\n  const monorepo =\n    options.monorepo ??\n    Monorepo.maybeLoad(options.projectRoot, { packageJson, scurry })\n  const {\n    catalog = {},\n    catalogs = {},\n    'scope-registries': scopeRegistries,\n    registry,\n    registries,\n    'git-hosts': gitHosts,\n    'git-host-archives': gitHostArchives,\n    /* c8 ignore next */\n  } = lockfileData.options ?? {}\n\n  // Optimize options merging - only create new objects when needed\n  const mergedOptions = {\n    ...options,\n    catalog,\n    catalogs,\n    'scope-registries':\n      scopeRegistries ?\n        { ...options['scope-registries'], ...scopeRegistries }\n      : options['scope-registries'],\n    registry: registry ?? options.registry,\n    registries:\n      registries ?\n        { ...options.registries, ...registries }\n      : options.registries,\n    'git-hosts':\n      gitHosts ?\n        { ...options['git-hosts'], ...gitHosts }\n      : options['git-hosts'],\n    'git-host-archives':\n      gitHostArchives ?\n        { ...options['git-host-archives'], ...gitHostArchives }\n      : options['git-host-archives'],\n  }\n  const graph = new Graph({\n    ...mergedOptions,\n    mainManifest,\n    monorepo,\n  })\n  loadNodes(\n    graph,\n    lockfileData.nodes,\n    mergedOptions,\n    options.actual,\n    options.throwOnMissingManifest,\n  )\n  loadEdges(graph, lockfileData.edges, mergedOptions)\n\n  // hydrate missing node-level registry data\n  for (const node of graph.nodes.values()) {\n    const [firstEdge] = node.edgesIn\n    if (firstEdge?.spec.registry) {\n      node.registry = firstEdge.spec.registry\n    }\n  }\n\n  return graph\n}\n"]}

package/dist/lockfile/save.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"save.d.ts","sourceRoot":"","sources":["../../src/lockfile/save.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAE/C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAExC,OAAO,KAAK,EACV,YAAY,EAMb,MAAM,YAAY,CAAA;AACnB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAGpD,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACtC;;OAEG;IACH,KAAK,EAAE,KAAK,CAAA;IACZ;;OAEG;IACH,SAAS,CAAC,EAAE,aAAa,CAAA;IACzB;;OAEG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB;;OAEG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB;;OAEG;IACH,sBAAsB,CAAC,EAAE,OAAO,CAAA;CACjC,CAAA;AAoHD,eAAO,MAAM,YAAY,4PActB,WAAW,KAAG,YA+DhB,CAAA;AAeD,eAAO,MAAM,QAAQ,SACb,YAAY,YACR,MAAM,8BAEf,IAIF,CAAA;AAED,eAAO,MAAM,IAAI,YACN,IAAI,CAAC,WAAW,EAAE,eAAe,CAAC,KAC1C,IAKF,CAAA;AAED,eAAO,MAAM,UAAU,YACZ,IAAI,CAAC,WAAW,EAAE,eAAe,GAAG,eAAe,CAAC,KAC5D,IAqBF,CAAA"}

package/dist/lockfile/save.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"save.js","sourceRoot":"","sources":["../../src/lockfile/save.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,+BAA+B,EAC/B,oBAAoB,GACrB,MAAM,eAAe,CAAA;AACtB,OAAO,EACL,sBAAsB,EACtB,eAAe,EACf,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,EACf,sBAAsB,GACvB,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAClD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAA;AAetE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAyB3C,MAAM,WAAW,GAAG,CAClB,KAAqB,EACrB,aAAuB,EACvB,aAAuB,EACvB,QAAiB,EACjB,sBAAgC,EAChC,EAAE;IACF,gEAAgE;IAChE,mEAAmE;IACnE,MAAM,GAAG,GAAW,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IAC7D,2DAA2D;IAC3D,MAAM,YAAY,GAAW,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC7C,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAC/B,CAAA;IAED,MAAM,GAAG,GAAgC,EAAE,CAAA;IAC3C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,cAAc,GAClB,IAAI,CAAC,QAAQ,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;QAClE,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAA;QAC3D,2DAA2D;QAC3D,MAAM,QAAQ,GACZ,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YAC/C,SAAS;YACX,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QAEjB,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAA;QACtC,MAAM,YAAY,GAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAErD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;QAClC,CAAC;QAED,uCAAuC;QACvC,uCAAuC;QACvC,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9C,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAA;QAC5B,CAAC;QAED,IAAI,QAAQ,EAAE,CAAC;YACb,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAA;QAC5B,CAAC;QAED,IAAI,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,YAAY,CAAC,CAAC,CAAC,GAAG,+BAA+B,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAEhE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACtC,YAAY,CAAC,CAAC,CAAC,GAAG,+BAA+B,CAC/C,IAAI,CAAC,WAAW,CACjB,CAAA;YACH,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,IAAI,sBAAsB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7C,MAAM,KAAK,CAAC,6BAA6B,IAAI,CAAC,EAAE,GAAG,CAAC,CAAA;QACtD,CAAC;QAED,mEAAmE;QACnE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAA4B,CAAA;QACrD,CAAC;QAED,6BAA6B;QAC7B,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;YAC/C,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAA;QAC7B,CAAC;QAED,qCAAqC;QACrC,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;YAC9C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,YAAY,CAAC,CAAC,CAAC,GAAG,UAAU,CAAA;YAC9B,CAAC;QACH,CAAC;QAED,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,YAAY,CAAA;IAC7B,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAiB,EAAE,CACtD,MAAM,CAAC,WAAW,CAChB,CAAC,GAAG,KAAK,CAAC;KACP,IAAI,CACH,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;AACP,4DAA4D;AAC5D,oDAAoD;AACpD,mBAAmB;AACnB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;IACjD,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;IACxC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;IAClC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAEjD;KACA,GAAG,CAAC,CAAC,IAAI,EAAwC,EAAE,CAAC;IACnD,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;IACnC,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,SAAS,EAAE;CACxE,CAAC,CACL,CAAA;AAEH,MAAM,kBAAkB,GAAG,CACzB,YAAoC,EACpC,KAA6B,EAC7B,EAAE;IACF,MAAM,GAAG,GAA2B,EAAE,CAAA;IACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;YACtD,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;QAClB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,EAC3B,KAAK,EACL,OAAO,EACP,QAAQ,EACR,WAAW,EAAE,QAAQ,EACrB,mBAAmB,EAAE,eAAe,EACpC,SAAS,EACT,QAAQ,EACR,UAAU,EACV,aAAa,EACb,aAAa,EACb,kBAAkB,EAAE,eAAe,EACnC,gBAAgB,EAAE,aAAa,EAC/B,sBAAsB,GACV,EAAgB,EAAE;IAC9B,MAAM,aAAa,GACjB,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC9B,kBAAkB,CAAC,eAAe,EAAE,QAAQ,CAAC;QAC/C,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,oBAAoB,GACxB,oBAAoB,CAAC,eAAe,CAAC,CAAC,CAAC;QACrC,kBAAkB,CAAC,sBAAsB,EAAE,eAAe,CAAC;QAC7D,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,cAAc,GAClB,SAAS,IAAI,oBAAoB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QACnD,SAAS,CAAC,MAAM;QAClB,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,eAAe,GACnB,oBAAoB,CAAC,UAAU,CAAC,CAAC,CAAC;QAChC,kBAAkB,CAAC,iBAAiB,EAAE,UAAU,CAAC;QACnD,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,oBAAoB,GACxB,oBAAoB,CAAC,eAAe,CAAC,CAAC,CAAC;QACrC,kBAAkB,CAAC,sBAAsB,EAAE,eAAe,CAAC;QAC7D,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,kBAAkB,GACtB,oBAAoB,CAAC,aAAa,CAAC,CAAC,CAAC;QACnC,kBAAkB,CAAC,oBAAoB,EAAE,aAAa,CAAC;QACzD,CAAC,CAAC,SAAS,CAAA;IACb,MAAM,QAAQ,GAAG,CAAC,KAA0C,EAAE,EAAE,CAC9D,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAA;IACpC,OAAO;QACL,eAAe,EAAE,CAAC;QAClB,OAAO,EAAE;YACP,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC;gBAC5B,EAAE,SAAS,EAAE,cAAc,EAAE;gBAC/B,CAAC,CAAC,EAAE,CAAC;YACL,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,GAAG,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC,CAAC;gBAClC,EAAE,kBAAkB,EAAE,oBAAoB,EAAE;gBAC9C,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBAChC,EAAE,gBAAgB,EAAE,kBAAkB,EAAE;gBAC1C,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,eAAe,CAAC,CAAC;gBAC1D,EAAE,QAAQ,EAAE;gBACd,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;gBACxB,EAAE,UAAU,EAAE,eAAe,EAAE;gBACjC,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC;gBAC3B,EAAE,WAAW,EAAE,aAAa,EAAE;gBAChC,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC,CAAC;gBAClC,EAAE,mBAAmB,EAAE,oBAAoB,EAAE;gBAC/C,CAAC,CAAC,SAAS,CAAC;SACb;QACD,KAAK,EAAE,WAAW,CAChB,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EACpB,aAAa,EACb,aAAa,EACb,QAAQ,EACR,sBAAsB,CACvB;QACD,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC;KAChC,CAAA;AACH,CAAC,CAAA;AAED,kDAAkD;AAClD,MAAM,WAAW,GAAG,CAAC,UAAkB,EAAE,EAAE;IACzC,MAAM,GAAG,GAAG,GAAG,UAAU,IAAI,CAAA;IAC7B,MAAM,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAA;IAClD,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;IAClB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,GAAG,CAAC,IAAI,CACN,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAC3D,CAAA;IACH,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;AACjC,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,IAAkB,EAClB,QAAgB,EAChB,aAAa,GAAG,KAAK,EACf,EAAE;IACR,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;IAC1C,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACxD,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;AAClC,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,OAA2C,EACrC,EAAE;IACR,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAA;IACzB,MAAM,IAAI,GAAG,YAAY,CAAC,EAAE,GAAG,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,eAAe,CAAC,CAAA;IAC5D,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;AACjC,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,OAA6D,EACvD,EAAE;IACR,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAA;IACzB,IAAI,IAA8B,CAAA;IAElC,IAAI,CAAC;QACH,IAAI,GAAG,YAAY,CAAC;YAClB,GAAG,OAAO;YACV,aAAa,EAAE,IAAI;YACnB,aAAa,EAAE,IAAI;YACnB,sBAAsB,EAAE,IAAI;SAC7B,CAAC,CAAA;IACJ,CAAC;IAAC,MAAM,CAAC,CAAA,CAAC;IAEV,IAAI,CAAC,IAAI;QAAE,OAAM;IAEjB,MAAM,QAAQ,GAAG,OAAO,CACtB,KAAK,CAAC,WAAW,EACjB,6BAA6B,CAC9B,CAAA;IACD,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IACjD,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;AAChC,CAAC,CAAA","sourcesContent":["import {\n  expandNormalizedManifestSymbols,\n  isRecordStringString,\n} from '@vltpkg/types'\nimport {\n  defaultGitHostArchives,\n  defaultGitHosts,\n  defaultJsrRegistries,\n  defaultRegistries,\n  defaultRegistry,\n  defaultScopeRegistries,\n} from '@vltpkg/spec'\nimport { mkdirSync, writeFileSync } from 'node:fs'\nimport { dirname, resolve } from 'node:path'\nimport { getFlagNumFromNode, getBuildStateFromNode } from './types.ts'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { Edge } from '../edge.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\nimport type {\n  LockfileData,\n  LockfileEdgeKey,\n  LockfileEdges,\n  LockfileEdgeValue,\n  LockfileNode,\n  LockfilePlatform,\n} from './types.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport { error } from '@vltpkg/error-cause'\n\nexport type SaveOptions = SpecOptions & {\n  /**\n   * The graph to be stored in the lockfile.\n   */\n  graph: Graph\n  /**\n   * The graph modifiers helper object.\n   */\n  modifiers?: GraphModifier\n  /**\n   * Should it save manifest data in the lockfile?\n   */\n  saveManifests?: boolean\n  /**\n   * Should it save build state data in the lockfile?\n   */\n  saveBuildData?: boolean\n  /**\n   * Should it throw an error if a manifest is missing?\n   */\n  throwOnMissingManifest?: boolean\n}\n\nconst formatNodes = (\n  nodes: Iterable<Node>,\n  saveManifests?: boolean,\n  saveBuildData?: boolean,\n  registry?: string,\n  throwOnMissingManifest?: boolean,\n) => {\n  // we do not store importers in the lockfile, though we do store\n  // their edges. when we load, we always read workspaces/main fresh.\n  const arr: Node[] = [...nodes].filter(node => !node.importer)\n  // nodes are sorted in order to have a deterministic result\n  const orderedNodes: Node[] = arr.sort((a, b) =>\n    a.id.localeCompare(b.id, 'en'),\n  )\n\n  const res: Record<DepID, LockfileNode> = {}\n  for (const node of orderedNodes) {\n    const customRegistry =\n      node.resolved && registry && !node.resolved.startsWith(registry)\n    const resolved = customRegistry ? node.resolved : undefined\n    // if it's in a location other than the default, stash that\n    const location =\n      node.id.startsWith('file') || node.inVltStore() ?\n        undefined\n      : node.location\n\n    const flags = getFlagNumFromNode(node)\n    const lockfileNode: LockfileNode = [flags, node.name]\n\n    if (node.integrity) {\n      lockfileNode[2] = node.integrity\n    }\n\n    // skip resolved for remote nodes since\n    // these are already part of the dep id\n    if (resolved && !node.id.startsWith('remote')) {\n      lockfileNode[3] = resolved\n    }\n\n    if (location) {\n      lockfileNode[4] = location\n    }\n\n    if (saveManifests && node.manifest) {\n      lockfileNode[5] = expandNormalizedManifestSymbols(node.manifest)\n\n      if (node.confused && node.rawManifest) {\n        lockfileNode[6] = expandNormalizedManifestSymbols(\n          node.rawManifest,\n        )\n      }\n    }\n\n    // Throw an error if a manifest is missing and the option is enabled\n    if (throwOnMissingManifest && !node.manifest) {\n      throw error(`Missing manifest for node ${node.id}.`)\n    }\n\n    // Always save platform data for optional dependencies if available\n    if (node.optional && node.platform) {\n      lockfileNode[7] = node.platform as LockfilePlatform\n    }\n\n    // Save bin data if available\n    if (node.bins && Object.keys(node.bins).length) {\n      lockfileNode[8] = node.bins\n    }\n\n    // Save build state data if requested\n    if (saveBuildData) {\n      const buildState = getBuildStateFromNode(node)\n      if (buildState !== undefined) {\n        lockfileNode[9] = buildState\n      }\n    }\n\n    res[node.id] = lockfileNode\n  }\n  return res\n}\n\nconst formatEdges = (edges: Set<Edge>): LockfileEdges =>\n  Object.fromEntries(\n    [...edges]\n      .sort(\n        (a, b) =>\n          /* c8 ignore start - nondeterminstic and annoying to test */\n          // sort importers to the top, then alphabetically by\n          // id, type, target\n          Number(b.from.importer) - Number(a.from.importer) ||\n          a.from.id.localeCompare(b.from.id, 'en') ||\n          a.type.localeCompare(b.type, 'en') ||\n          (a.to?.id ?? '').localeCompare(b.to?.id ?? ''),\n        /* c8 ignore stop */\n      )\n      .map((edge): [LockfileEdgeKey, LockfileEdgeValue] => [\n        `${edge.from.id} ${edge.spec.name}`,\n        `${edge.type} ${edge.spec.bareSpec || '*'} ${edge.to?.id ?? 'MISSING'}`,\n      ]),\n  )\n\nconst removeDefaultItems = (\n  defaultItems: Record<string, string>,\n  items: Record<string, string>,\n) => {\n  const res: Record<string, string> = {}\n  for (const [key, value] of Object.entries(items)) {\n    if (!defaultItems[key] || defaultItems[key] !== value) {\n      res[key] = value\n    }\n  }\n  return res\n}\n\nexport const lockfileData = ({\n  graph,\n  catalog,\n  catalogs,\n  'git-hosts': gitHosts,\n  'git-host-archives': gitHostArchives,\n  modifiers,\n  registry,\n  registries,\n  saveManifests,\n  saveBuildData,\n  'scope-registries': scopeRegistries,\n  'jsr-registries': jsrRegistries,\n  throwOnMissingManifest,\n}: SaveOptions): LockfileData => {\n  const cleanGitHosts =\n    isRecordStringString(gitHosts) ?\n      removeDefaultItems(defaultGitHosts, gitHosts)\n    : undefined\n  const cleanGitHostArchives =\n    isRecordStringString(gitHostArchives) ?\n      removeDefaultItems(defaultGitHostArchives, gitHostArchives)\n    : undefined\n  const cleanModifiers =\n    modifiers && isRecordStringString(modifiers.config) ?\n      modifiers.config\n    : undefined\n  const cleanRegistries =\n    isRecordStringString(registries) ?\n      removeDefaultItems(defaultRegistries, registries)\n    : undefined\n  const cleanScopeRegistries =\n    isRecordStringString(scopeRegistries) ?\n      removeDefaultItems(defaultScopeRegistries, scopeRegistries)\n    : undefined\n  const cleanJsrRegistries =\n    isRecordStringString(jsrRegistries) ?\n      removeDefaultItems(defaultJsrRegistries, jsrRegistries)\n    : undefined\n  const hasItems = (clean: Record<string, unknown> | undefined) =>\n    clean && Object.keys(clean).length\n  return {\n    lockfileVersion: 0,\n    options: {\n      ...(hasItems(cleanModifiers) ?\n        { modifiers: cleanModifiers }\n      : {}),\n      ...(hasItems(catalog) ? { catalog } : {}),\n      ...(hasItems(catalogs) ? { catalogs } : {}),\n      ...(hasItems(cleanScopeRegistries) ?\n        { 'scope-registries': cleanScopeRegistries }\n      : undefined),\n      ...(hasItems(cleanJsrRegistries) ?\n        { 'jsr-registries': cleanJsrRegistries }\n      : undefined),\n      ...(registry !== undefined && registry !== defaultRegistry ?\n        { registry }\n      : undefined),\n      ...(hasItems(registries) ?\n        { registries: cleanRegistries }\n      : undefined),\n      ...(hasItems(cleanGitHosts) ?\n        { 'git-hosts': cleanGitHosts }\n      : undefined),\n      ...(hasItems(cleanGitHostArchives) ?\n        { 'git-host-archives': cleanGitHostArchives }\n      : undefined),\n    },\n    nodes: formatNodes(\n      graph.nodes.values(),\n      saveManifests,\n      saveBuildData,\n      registry,\n      throwOnMissingManifest,\n    ),\n    edges: formatEdges(graph.edges),\n  }\n}\n\n// renders each node / edge as a single line entry\nconst extraFormat = (jsonString: string) => {\n  const str = `${jsonString}\\n`\n  const [init, ...parts] = str.split('  \"nodes\": {')\n  const res = [init]\n  for (const part of parts) {\n    res.push(\n      part.replaceAll('\\n      ', '').replaceAll('\\n    ]', ']'),\n    )\n  }\n  return res.join('  \"nodes\": {')\n}\n\nexport const saveData = (\n  data: LockfileData,\n  fileName: string,\n  saveManifests = false,\n): void => {\n  const json = JSON.stringify(data, null, 2)\n  const content = saveManifests ? json : extraFormat(json)\n  writeFileSync(fileName, content)\n}\n\nexport const save = (\n  options: Omit<SaveOptions, 'saveManifests'>,\n): void => {\n  const { graph } = options\n  const data = lockfileData({ ...options, saveManifests: false })\n  const fileName = resolve(graph.projectRoot, 'vlt-lock.json')\n  saveData(data, fileName, false)\n}\n\nexport const saveHidden = (\n  options: Omit<SaveOptions, 'saveManifests' | 'saveBuildData'>,\n): void => {\n  const { graph } = options\n  let data: LockfileData | undefined\n\n  try {\n    data = lockfileData({\n      ...options,\n      saveManifests: true,\n      saveBuildData: true,\n      throwOnMissingManifest: true,\n    })\n  } catch {}\n\n  if (!data) return\n\n  const fileName = resolve(\n    graph.projectRoot,\n    'node_modules/.vlt-lock.json',\n  )\n  mkdirSync(dirname(fileName), { recursive: true })\n  saveData(data, fileName, true)\n}\n"]}

package/dist/lockfile/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/lockfile/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AACrD,OAAO,KAAK,EACV,SAAS,EACT,kBAAkB,EAClB,mBAAmB,EACpB,MAAM,eAAe,CAAA;AAGtB;;GAEG;AACH,MAAM,MAAM,gBAAgB,GAAG;IAC7B,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAChC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;IACtB,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;CACxB,CAAA;AAED;;;;;;GAMG;AACH,MAAM,MAAM,YAAY,GAAG;IACzB,eAAe,EAAE,MAAM,CAAA;IACvB,OAAO,EAAE,WAAW,GAAG;QACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAA;KAC/C,CAAA;IACD,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;IAClC,KAAK,EAAE,aAAa,CAAA;CACrB,CAAA;AAED,eAAO,MAAM,kBAAkB,SAAU;IACvC,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,GAAG,CAAC,EAAE,OAAO,CAAA;CACd,kBAIuB,CAAA;AAExB,eAAO,MAAM,sBAAsB,UAAW,iBAAiB;;;CAG7D,CAAA;AAEF,eAAO,MAAM,oBAAoB,IAAI,CAAA;AACrC,eAAO,MAAM,wBAAwB,IAAI,CAAA;AACzC,eAAO,MAAM,mBAAmB,IAAI,CAAA;AACpC,eAAO,MAAM,2BAA2B,IAAI,CAAA;AAE5C;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAE7C;;GAEG;AACH,eAAO,MAAM,cAAc,WAAY,CAAA;AACvC,eAAO,MAAM,gBAAgB,IAAI,CAAA;AACjC,eAAO,MAAM,eAAe,IAAI,CAAA;AAChC,eAAO,MAAM,gBAAgB,IAAI,CAAA;AAEjC;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAAG,SAAS,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAEtD,eAAO,MAAM,qBAAqB,SAAU;IAC1C,UAAU,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAA;CACpD,KAAG,kBAWH,CAAA;AAED,eAAO,MAAM,oBAAoB,UACxB,kBAAkB,KACxB,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,QAWhC,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,iBAAiB;IACxB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI;IACpB,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAC5B,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI;IACxB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI;IACxB,QAAQ,CAAC,EAAE,kBAAkB,GAAG,IAAI;IACpC,WAAW,CAAC,EAAE,kBAAkB,GAAG,IAAI;IACvC,QAAQ,CAAC,EAAE,gBAAgB,GAAG,IAAI;IAClC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IACpC,UAAU,CAAC,EAAE,kBAAkB,GAAG,IAAI;CACvC,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,aAAa,GAAG;IAC1B,CAAC,GAAG,EAAE,eAAe,GAAG,iBAAiB,CAAA;CAC1C,CAAA;AAED,4BAA4B;AAC5B,MAAM,MAAM,eAAe,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAA;AAElD,8BAA8B;AAC9B,MAAM,MAAM,iBAAiB,GAC3B,GAAG,mBAAmB,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAA"}

package/dist/lockfile/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/lockfile/types.ts"],"names":[],"mappings":"AAkCA,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,IAGlC,EAAE,EAAE,CACH,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,2BAA2B;IACvD,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,wBAAwB;QAC1C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAChC,CAAC,CAAC,oBAAoB,CAAA;AAExB,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,KAAwB,EAAE,EAAE,CAAC,CAAC;IACnE,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,mBAAmB,CAAC;IACpC,QAAQ,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,wBAAwB,CAAC;CAC/C,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAA;AACrC,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAA;AACzC,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAA;AACpC,MAAM,CAAC,MAAM,2BAA2B,GAAG,CAAC,CAAA;AAO5C;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,SAAS,CAAA;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAA;AACjC,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAA;AAChC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAA;AAOjC,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,IAErC,EAAsB,EAAE;IACvB,QAAQ,IAAI,CAAC,UAAU,EAAE,CAAC;QACxB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAA;QACzB,KAAK,OAAO;YACV,OAAO,eAAe,CAAA;QACxB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAA;QACzB;YACE,OAAO,cAAc,CAAA;IACzB,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAyB,EACe,EAAE;IAC1C,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAA;QACjB,KAAK,eAAe;YAClB,OAAO,OAAO,CAAA;QAChB,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAA;QACjB;YACE,OAAO,MAAM,CAAA;IACjB,CAAC;AACH,CAAC,CAAA","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport type {\n  Integrity,\n  NormalizedManifest,\n  DependencyTypeShort,\n} from '@vltpkg/types'\nimport type { Graph } from '../graph.ts'\n\n/**\n * Platform requirements for a lockfile node\n */\nexport type LockfilePlatform = {\n  engines?: Record<string, string>\n  os?: string[] | string\n  cpu?: string[] | string\n}\n\n/**\n * This is the main type definition for the contents of the\n * `vlt-lock.json` file.\n *\n * The nodes and edges information from the lockfile are used to reconstruct\n * a {@link Graph} representing a previous install.\n */\nexport type LockfileData = {\n  lockfileVersion: number\n  options: SpecOptions & {\n    modifiers?: Record<string, string> | undefined\n  }\n  nodes: Record<DepID, LockfileNode>\n  edges: LockfileEdges\n}\n\nexport const getFlagNumFromNode = (node: {\n  optional?: boolean\n  dev?: boolean\n}) =>\n  node.optional && node.dev ? LockfileNodeFlagDevOptional\n  : node.optional ? LockfileNodeFlagOptional\n  : node.dev ? LockfileNodeFlagDev\n  : LockfileNodeFlagNone\n\nexport const getBooleanFlagsFromNum = (flags: LockfileNodeFlags) => ({\n  dev: !!(flags & LockfileNodeFlagDev),\n  optional: !!(flags & LockfileNodeFlagOptional),\n})\n\nexport const LockfileNodeFlagNone = 0\nexport const LockfileNodeFlagOptional = 1\nexport const LockfileNodeFlagDev = 2\nexport const LockfileNodeFlagDevOptional = 3\n\n/**\n * Bit flags indicating whether a node is optional and/or dev.\n */\nexport type LockfileNodeFlags = 0 | 1 | 2 | 3\n\n/**\n * Build state constants for lockfile nodes\n */\nexport const BuildStateNone = undefined\nexport const BuildStateNeeded = 1\nexport const BuildStateBuilt = 2\nexport const BuildStateFailed = 3\n\n/**\n * Build state for a node - tracks whether it needs building, has been built, or failed\n */\nexport type LockfileBuildState = undefined | 1 | 2 | 3\n\nexport const getBuildStateFromNode = (node: {\n  buildState?: 'none' | 'needed' | 'built' | 'failed'\n}): LockfileBuildState => {\n  switch (node.buildState) {\n    case 'needed':\n      return BuildStateNeeded\n    case 'built':\n      return BuildStateBuilt\n    case 'failed':\n      return BuildStateFailed\n    default:\n      return BuildStateNone\n  }\n}\n\nexport const getBuildStateFromNum = (\n  state: LockfileBuildState,\n): 'none' | 'needed' | 'built' | 'failed' => {\n  switch (state) {\n    case BuildStateNeeded:\n      return 'needed'\n    case BuildStateBuilt:\n      return 'built'\n    case BuildStateFailed:\n      return 'failed'\n    default:\n      return 'none'\n  }\n}\n\n/**\n * Lockfile representation of a node from the install graph.\n */\nexport type LockfileNode = [\n  flags: LockfileNodeFlags,\n  name?: string | null,\n  integrity?: Integrity | null,\n  resolved?: string | null,\n  location?: string | null,\n  manifest?: NormalizedManifest | null,\n  rawManifest?: NormalizedManifest | null,\n  platform?: LockfilePlatform | null,\n  bins?: Record<string, string> | null,\n  buildState?: LockfileBuildState | null,\n]\n\n/**\n * Lockfile edges are stored as a record object where the key\n * is `${from.id} ${spec.name}` and the value is\n * `${type} ${spec.bareSpec} ${to.id | 'MISSING'}`\n *\n * Storing them in a record like this means that we are guaranteed to\n * never end up with duplicates, and a standard `JSON.stringify()`\n * will nicely print them out one line per edge.\n */\nexport type LockfileEdges = {\n  [key: LockfileEdgeKey]: LockfileEdgeValue\n}\n\n/** `${from} ${dep name}` */\nexport type LockfileEdgeKey = `${DepID} ${string}`\n\n/** `${type} ${spec} ${to}` */\nexport type LockfileEdgeValue =\n  `${DependencyTypeShort} ${Spec['bareSpec']} ${DepID | 'MISSING'}`\n"]}

package/dist/modifiers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modifiers.d.ts","sourceRoot":"","sources":["../src/modifiers.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAOnC,OAAO,KAAK,EACV,kBAAkB,EAClB,6BAA6B,EAC9B,MAAM,wBAAwB,CAAA;AAC/B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AACvD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAEnD;;GAEG;AACH,MAAM,MAAM,yBAAyB,GAAG;IACtC,SAAS,EAAE,yBAAyB,CAAA;CACrC,CAAA;AAED;;GAEG;AAEH,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAE9D;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;IACrB,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,kBAAkB,CAAA;IAC9B,KAAK,EAAE,MAAM,GAAG,kBAAkB,CAAA;IAClC,IAAI,EAAE,GAAG,CAAC;QACR,IAAI,EAAE,MAAM,CAAA;QACZ,IAAI,EAAE,IAAI,CAAA;KACX,CAAC,CAAA;CACH,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,iBAAiB,GAAG;IAClD,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,IAAI,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;CACd,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,iBAAiB,GAAG;IAClD,IAAI,EAAE,MAAM,CAAA;IACZ,QAAQ,EAAE,kBAAkB,CAAA;CAC7B,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,iBAAiB,GAAG,iBAAiB,CAAA;AAEjE;;;;;GAKG;AACH,MAAM,MAAM,mBAAmB,GAAG;IAChC;;OAEG;IACH,QAAQ,EAAE,aAAa,CAAA;IACvB;;OAEG;IACH,qBAAqB,EAAE,6BAA6B,CAAA;IACpD;;OAEG;IACH,YAAY,EAAE,IAAI,CAAA;IAClB;;OAEG;IACH,YAAY,CAAC,EAAE,IAAI,CAAA;IACnB;;OAEG;IACH,YAAY,CAAC,EAAE,IAAI,CAAA;CACpB,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,aAAa;;IA2BxB;;OAEG;IACH,eAAe,2BAAiC;IAChD,+DAA+D;IAC/D,aAAa,cAAoB;gBAErB,OAAO,EAAE,WAAW;IAIhC;;;OAGG;IACH,IAAI,MAAM,IAAI,yBAAyB,CAItC;IAED;;OAEG;IACH,IAAI,CAAC,OAAO,EAAE,WAAW;IAkDzB;;;;OAIG;IACH,WAAW,CAAC,QAAQ,EAAE,IAAI;IAwB1B;;;;;;;;;;;;;;;OAeG;IACH,gBAAgB,CACd,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACT,mBAAmB,GAAG,SAAS;IAiElC;;;;;;OAMG;IACH,eAAe,CACb,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,UAAU,EAAE,GAAG,IAAI,EAAE,GAClC,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC;IAWnC;;;;OAIG;IACH,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,mBAAmB,GAAG,IAAI;IA6BhE;;OAEG;IACH,WAAW,CACT,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,aAAa,GACtB,mBAAmB;IAQtB;;OAEG;IACH,kBAAkB,CAAC,QAAQ,EAAE,aAAa,GAAG,IAAI;IAmBjD;;;;;;;OAOG;IACH,qBAAqB,IAAI,IAAI;IAc7B;;;;OAIG;IACH,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,WAAW;IAMrC;;;OAGG;IACH,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW;CAGjC"}

package/dist/modifiers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modifiers.js","sourceRoot":"","sources":["../src/modifiers.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,eAAe,GAChB,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,EACL,oBAAoB,EACpB,wBAAwB,EACxB,iBAAiB,GAClB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAA;AAyFvC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,aAAa;IACxB,yCAAyC;IACzC,OAAO,CAA4B;IACnC,kDAAkD;IAClD,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAA;IACrC,uDAAuD;IACvD,cAAc,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC7C,uDAAuD;IACvD,cAAc,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC7C;;;;OAIG;IACH,eAAe,GAAG,IAAI,GAAG,EAA8B,CAAA;IACvD;;;;;;;OAOG;IACH,cAAc,GAAG,IAAI,GAAG,EAGrB,CAAA;IACH;;OAEG;IACH,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAA;IAChD,+DAA+D;IAC/D,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,YAAY,OAAoB;QAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACpB,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACR,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC,OAAO,CAAA;QACrC,OAAO,CAAC,IAAI,CAAC,OAAO;YAClB,IAAI,CAAC,WAAW,EAAE,wBAAwB,CAAC,IAAI,EAAE,CAAC,CAAA;IACtD,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,OAAoB;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC3B,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;YACvC,8CAA8C;YAC9C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC1B,MAAM,KAAK,CAAC,mCAAmC,EAAE;oBAC/C,KAAK,EAAE,GAAG;iBACX,CAAC,CAAA;YACJ,CAAC;YACD,oBAAoB;YACpB,IAAI,GAAkB,CAAA;YACtB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC9B,GAAG,GAAG;oBACJ,UAAU;oBACV,KAAK,EAAE,GAAG;oBACV,IAAI,EAAE,IAAI,GAAG,EAAE;oBACf,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC;oBACtD,IAAI,EAAE,MAAM;oBACZ,KAAK;iBACsB,CAAA;gBAC7B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBAC5B,4BAA4B;YAC9B,CAAC;iBAAM,CAAC;gBACN,MAAM,QAAQ,GAAG,oBAAoB,CACnC,iBAAiB,CAAC,KAAK,CAAC,CACzB,CAAA;gBACD,GAAG,GAAG;oBACJ,UAAU;oBACV,KAAK,EAAE,GAAG;oBACV,QAAQ;oBACR,IAAI,EAAE,IAAI,GAAG,EAAE;oBACf,IAAI,EAAE,MAAM;oBACZ,KAAK,EAAE,QAAQ;iBACY,CAAA;gBAC7B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC9B,CAAC;YACD,mBAAmB;YACnB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACxB,0DAA0D;YAC1D,yDAAyD;YACzD,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC1B,MAAM,UAAU,GACd,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;gBAC9D,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACnB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,QAAc;QACxB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,oEAAoE;YACpE,mEAAmE;YACnE,MAAM,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAA;YACrC,MAAM,SAAS,GACb,KAAK,CAAC,KAAK,KAAK,OAAO,IAAI,QAAQ,CAAC,YAAY,CAAA;YAClD,MAAM,cAAc,GAClB,KAAK,CAAC,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC,QAAQ,CAAA;YACnD,MAAM,QAAQ,GACZ,KAAK,CAAC,KAAK,KAAK,UAAU,IAAI,SAAS,IAAI,cAAc,CAAA;YAC3D,IAAI,KAAK,CAAC,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;gBACnD,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAA;gBAChD,8DAA8D;gBAC9D,6DAA6D;gBAC7D,sBAAsB;gBACtB,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,gBAAgB,CACd,IAAU,EACV,IAAU;QAEV,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;QAC7B,mEAAmE;QACnE,mEAAmE;QACnE,kEAAkE;QAClE,MAAM,GAAG,GAAG,IAAI,GAAG,EAGhB,CAAA;QACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,gDAAgD;YAChD,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc;iBAC9B,GAAG,CAAC,QAAQ,CAAC;gBACd,EAAE,GAAG,CAAC,IAAI,CAAC;gBACX,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;YACb,IAAI,KAAK,EAAE,CAAC;gBACV,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;QACD,qEAAqE;QACrE,kEAAkE;QAClE,4CAA4C;QAC5C,MAAM,UAAU,GACd,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAiB,CAAA;QAC5D,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,MAAM,YAAY;YAChB,+CAA+C;YAC/C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;gBACtD,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;YACjC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,EAAE,YAAY,CAAC,CAAA;QACzD,CAAC;QACD,iEAAiE;QACjE,gEAAgE;QAChE,qEAAqE;QACrE,oEAAoE;QACpE,0DAA0D;QAC1D,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;QAC7B,MAAM,eAAe,GAAG,GAAG,CAAC,MAAM,CAChC,MAAM,CAAC,EAAE,CACP,MAAM,CAAC,qBAAqB,CAAC,OAAO;YACpC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAClC,CAAA;QACD,+BAA+B;QAC/B,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QACzC,CAAC;QACD,yEAAyE;QACzE,uEAAuE;QACvE,iEAAiE;QACjE,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAA;QAC9D,OAAO,GAAG,CAAC,GAAG,CACZ,eAAe,CACb,OAAO;YACL,uDAAuD;YACvD,0DAA0D;aACzD,MAAM,CAAC,CAAC,CAAC,EAAE,CACV,CAAC,CAAC,qBAAqB,CAAC,OAAO,EAAE,UAAU,CAAC;YAC1C,MAAM;SACP,CAAC,CACH;aACA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CACnC,CAAC,CAAC,CAAC,CACL,CAAA;IACH,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CACb,IAAU,EACV,YAAmC;QAEnC,MAAM,YAAY,GAAG,IAAI,GAAG,EAA+B,CAAA;QAC3D,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,YAAY,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YAChD,IAAI,MAAM,EAAE,CAAC;gBACX,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YACrC,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAA;IACrB,CAAC;IAED;;;;OAIG;IACH,iBAAiB,CAAC,IAAU,EAAE,MAA2B;QACvD,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAA;QAC3B,MAAM,qBAAqB,GAAG,MAAM,CAAC,qBAAqB,CAAC,IAAI,EAAE,CAAA;QACjE,MAAM,IAAI,GAAG,qBAAqB,CAAC,OAAO,EAAE,IAAI,CAAA;QAEhD,oDAAoD;QACpD,wDAAwD;QACxD,IAAI,qBAAqB,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAA;YACjC,OAAM;QACR,CAAC;QAED,+BAA+B;QAC/B,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QAExC,4CAA4C;QAC5C,MAAM,OAAO,GACX,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC;YACjC,IAAI,GAAG,EAA0C,CAAA;QACnD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;QAC1C,MAAM,OAAO,GACX,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAA6B,CAAA;QAC3D,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;QAE1B,mCAAmC;QACnC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAC3B,CAAC;IAED;;OAEG;IACH,WAAW,CACT,IAAU,EACV,QAAuB;QAEvB,OAAO;YACL,QAAQ;YACR,qBAAqB,EAAE,QAAQ,CAAC,UAAU,CAAC,WAAW,EAAE;YACxD,YAAY,EAAE,IAAI;SACnB,CAAA;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,QAAuB;QACxC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;YAC5D,IAAI,OAAO,EAAE,CAAC;gBACZ,yDAAyD;gBACzD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC/B,IAAI,KAAK,EAAE,CAAC;oBACV,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;gBACpC,CAAC;gBACD,wCAAwC;gBACxC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACpB,gEAAgE;gBAChE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;oBAClB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,qBAAqB;QACnB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YAC5C,oEAAoE;YACpE,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC1B,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAChC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAC/B,QAAQ,CAAC,YAAY,CACtB,CAAA;YACH,CAAC;YACD,kCAAkC;YAClC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;QAC5C,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,SAAS,CAAC,OAAoB;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,wBAAwB,CAAC,CAAA;QAC1D,IAAI,CAAC,MAAM;YAAE,OAAM;QACnB,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,CAAA;IACnC,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAI,CAAC,OAAoB;QAC9B,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,CAAA;IACnC,CAAC;CACF","sourcesContent":["import {\n  parseBreadcrumb,\n  specificitySort,\n} from '@vltpkg/dss-breadcrumb'\nimport { error } from '@vltpkg/error-cause'\nimport { Spec } from '@vltpkg/spec'\nimport {\n  asNormalizedManifest,\n  assertRecordStringString,\n  normalizeManifest,\n} from '@vltpkg/types'\nimport { load } from '@vltpkg/vlt-json'\nimport type {\n  ModifierBreadcrumb,\n  ModifierInteractiveBreadcrumb,\n} from '@vltpkg/dss-breadcrumb'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { NormalizedManifest } from '@vltpkg/types'\nimport type { Edge } from './edge.ts'\nimport type { Node } from './node.ts'\nimport type { Dependency } from './dependencies.ts'\n\n/**\n * Loaded modifiers configuration as described in the `vlt.json` file.\n */\nexport type GraphModifierLoadedConfig = {\n  modifiers: GraphModifierConfigObject\n}\n\n/**\n * Type definition for the modifiers configuration object\n */\n// TODO: subtype string into a more specific type for Queries\nexport type GraphModifierConfigObject = Record<string, string>\n\n/**\n * Info needed to define a graph modifier.\n */\nexport type BaseModifierEntry = {\n  type: 'edge' | 'node'\n  query: string\n  breadcrumb: ModifierBreadcrumb\n  value: string | NormalizedManifest\n  refs: Set<{\n    name: string\n    from: Node\n  }>\n}\n\n/**\n * Extra info to define specifically a graph edge modifier.\n */\nexport type EdgeModifierEntry = BaseModifierEntry & {\n  type: 'edge'\n  spec: Spec\n  value: string\n}\n\n/**\n * Extra info to define the graph node modifier.\n */\nexport type NodeModifierEntry = BaseModifierEntry & {\n  type: 'node'\n  manifest: NormalizedManifest\n}\n\n/**\n * A graph modifier entry, which can be either an edge or a node modifier.\n */\nexport type ModifierEntry = EdgeModifierEntry | NodeModifierEntry\n\n/**\n * An object to track modifiers that have matched an initial part of the\n * breadcrumb. It holds pointers to both nodes and edges matched in the\n * current traversed graph on top of the modifier info and the breadcrumb\n * state that is used to track the current state of the parsing.\n */\nexport type ModifierActiveEntry = {\n  /**\n   * The modifier this active entry is working with.\n   */\n  modifier: ModifierEntry\n  /**\n   * The breadcrumb that is used to track the current state of the parsing.\n   */\n  interactiveBreadcrumb: ModifierInteractiveBreadcrumb\n  /**\n   * The first node to be affected by this modifier.\n   */\n  originalFrom: Node\n  /**\n   * The original edge that is being replaced with this entry.\n   */\n  originalEdge?: Edge\n  /**\n   * The modified edge that is being used to replace the original edge.\n   */\n  modifiedEdge?: Edge\n}\n\n/**\n * Class representing loaded modifiers configuration for a project.\n *\n * Instances of this class can be used as a helper to modify the graph\n * during the graph build ideal traversal time.\n *\n * ```\n * const modifier = new GraphModifier(options)\n * modifier.load(options)\n * ```\n *\n * The `tryImporter` method can be used to register the initial importer\n * node along with any modifier that includes an importer selector, e.g:\n * `modifier.tryImporter(graph.mainImporter)`\n *\n * When traversing the graph, use the `tryNewDependency` method to check\n * if a given dependency spec to the current traversed node has matching\n * registered modifiers, e.g:\n * `const entries = modifier.tryNewDependency(fromNode, depSpec)`\n *\n * Use `updateActiveEntry` to update a given active modifier entry state\n * with the current node of the graph being traversed. e.g:\n * ```\n * for (const entry of entries)\n *   modifier.updateActiveEntry(fromNode, entry)\n * ```\n */\nexport class GraphModifier {\n  /** The loaded modifiers configuration */\n  #config?: GraphModifierConfigObject\n  /** A set of all modifiers loaded from vlt.json */\n  #modifiers = new Set<ModifierEntry>()\n  /** A set of all edge modifiers loaded from vlt.json */\n  #edgeModifiers = new Set<EdgeModifierEntry>()\n  /** A set of all node modifiers loaded from vlt.json */\n  #nodeModifiers = new Set<NodeModifierEntry>()\n  /**\n   * A map of initial entries, keyed by the name of the first breadcrumb\n   * item to its modifier entry. Useful for checking for non-importer\n   * starting breadcrumbs, e.g: `#a > #b`\n   */\n  #initialEntries = new Map<string, Set<ModifierEntry>>()\n  /**\n   * A multi-level map of active entries, keyed by:\n   * - modifiers\n   * - edge name\n   * - from node\n   * that allows for retrieving seen {@link ModifierActiveEntry} instances\n   * in constant time.\n   */\n  #activeEntries = new Map<\n    ModifierEntry,\n    Map<string, Map<Node, ModifierActiveEntry>>\n  >()\n  /**\n   * A set of currently active modifiers, which are being parsed.\n   */\n  activeModifiers = new Set<ModifierActiveEntry>()\n  /** A set of all modifier string values loaded from vlt.json */\n  modifierNames = new Set<string>()\n\n  constructor(options: SpecOptions) {\n    this.load(options)\n  }\n\n  /**\n   * Load the modifiers definitions from vlt.json,\n   * converting the result into a GraphModifierConfigObject\n   */\n  get config(): GraphModifierConfigObject {\n    if (this.#config) return this.#config\n    return (this.#config =\n      load('modifiers', assertRecordStringString) ?? {})\n  }\n\n  /**\n   * Loads the modifiers defined in `vlt.json` into memory.\n   */\n  load(options: SpecOptions) {\n    for (const [key, value] of Object.entries(this.config)) {\n      this.modifierNames.add(key)\n      const breadcrumb = parseBreadcrumb(key)\n      /* c8 ignore start - should not be possible */\n      if (!breadcrumb.last.name) {\n        throw error('Could not find name in breadcrumb', {\n          found: key,\n        })\n      }\n      /* c8 ignore stop */\n      let mod: ModifierEntry\n      if (typeof value === 'string') {\n        mod = {\n          breadcrumb,\n          query: key,\n          refs: new Set(),\n          spec: Spec.parse(breadcrumb.last.name, value, options),\n          type: 'edge',\n          value,\n        } satisfies EdgeModifierEntry\n        this.#edgeModifiers.add(mod)\n        /* c8 ignore start - TODO */\n      } else {\n        const manifest = asNormalizedManifest(\n          normalizeManifest(value),\n        )\n        mod = {\n          breadcrumb,\n          query: key,\n          manifest,\n          refs: new Set(),\n          type: 'node',\n          value: manifest,\n        } satisfies NodeModifierEntry\n        this.#nodeModifiers.add(mod)\n      }\n      /* c8 ignore end */\n      this.#modifiers.add(mod)\n      // if the breadcrumb starts with an id, then add it to the\n      // map of initial entries, so that we can use it to match\n      if (breadcrumb.first.name) {\n        const initialSet =\n          this.#initialEntries.get(breadcrumb.first.name) ?? new Set()\n        initialSet.add(mod)\n        this.#initialEntries.set(breadcrumb.first.name, initialSet)\n      }\n    }\n  }\n\n  /**\n   * Try matching the provided node against the top-level selectors. In case\n   * a match is found it will also register the active entry modifier and\n   * update the active entry to the current importer node.\n   */\n  tryImporter(importer: Node) {\n    for (const modifier of this.#modifiers) {\n      // if the first item in the breadcrumb is an importer and it matches\n      // any of the valid top-level selectors, then register the modifier\n      const { first } = modifier.breadcrumb\n      const matchRoot =\n        first.value === ':root' && importer.mainImporter\n      const matchWorkspace =\n        first.value === ':workspace' && importer.importer\n      const matchAny =\n        first.value === ':project' || matchRoot || matchWorkspace\n      if (first.importer && matchAny) {\n        const active = this.newModifier(importer, modifier)\n        const single = active.modifier.breadcrumb.single\n        // only the importers will update the active entry right after\n        // registering it since tryImporter doesn't try to match from\n        // active dependencies\n        if (!single) {\n          this.updateActiveEntry(importer, active)\n        }\n      }\n    }\n  }\n\n  /**\n   * Try matching the provided node and spec to the current\n   * active parsing modifier entries along with possible starting-level\n   * modifiers.\n   *\n   * Any entries in which the breachcrumb have already reached its last\n   * element will be prioritized, along with checking for specificity,\n   * the complete entry with the highest specificity will be returned or just\n   * the entry with the highest specificity if no complete entry is found.\n   * Returns `undefined` if no matching entry is found.\n   *\n   * This method works with the assumption that it's going to be called\n   * during a graph traversal, such that any ascendent has been checked\n   * and the active modifier entry state has been updated in the previous\n   * iteration.\n   */\n  tryNewDependency(\n    from: Node,\n    spec: Spec,\n  ): ModifierActiveEntry | undefined {\n    const { name, semver } = spec\n    // here we use a map instead of a set so that we can associate each\n    // modifier active entry with its breadcrumb so that it's easier to\n    // pick the correct entry when we sort breadcrbumbs by specificity\n    const all = new Map<\n      ModifierBreadcrumb | undefined,\n      ModifierActiveEntry\n    >()\n    for (const modifier of this.#modifiers) {\n      // if an active entry is found then returns that\n      const entry = this.#activeEntries\n        .get(modifier)\n        ?.get(name)\n        ?.get(from)\n      if (entry) {\n        all.set(entry.modifier.breadcrumb, entry)\n      }\n    }\n    // matches the name against the initial entries, this will make it so\n    // that modifier queries that start with a name (e.g: #a > #b) can\n    // match at any point of the graph traversal\n    const initialSet =\n      this.#initialEntries.get(name) ?? new Set<ModifierEntry>()\n    for (const initial of initialSet) {\n      const initialEntry =\n        /* c8 ignore next - difficult to test branch */\n        this.#activeEntries.get(initial)?.get(name)?.get(from) ??\n        this.newModifier(from, initial)\n      all.set(initialEntry.modifier.breadcrumb, initialEntry)\n    }\n    // selects the active entry that should apply to this dependency,\n    // any active entry that is done parsing has the priority, if we\n    // find multiple entries then we use css specificity to pick a winner\n    // if we have multiple matches but no active entry is complete, then\n    // we pick the one with the highest specificity breadcrumb\n    const arr = [...all.values()]\n    const completeEntries = arr.filter(\n      active =>\n        active.interactiveBreadcrumb.current ===\n        active.modifier.breadcrumb.last,\n    )\n    // deregister completed entries\n    for (const entry of completeEntries) {\n      this.deregisterModifier(entry.modifier)\n    }\n    // returns the highest specificity entry from either the complete entries\n    // if any were found or from any of the entries if available, otherwise\n    // it will return undefined as no entry is found in the `all` map\n    const entries = completeEntries.length ? completeEntries : arr\n    return all.get(\n      specificitySort(\n        entries\n          // here we filter out any entries that do not match the\n          // pseudo selector comparators used in the breadcrumb item\n          .filter(i =>\n            i.interactiveBreadcrumb.current?.comparator({\n              semver,\n            }),\n          )\n          .map(i => i.modifier.breadcrumb),\n      )[0],\n    )\n  }\n\n  /**\n   * Returns the set of {@link ModifierActiveEntry} instances that matches\n   * the provided {@link Dependency} specs for a given node.\n   *\n   * This method is mostly a helper to {@link GraphModifier.tryNewDependency}\n   * that handles the registered modifiers traversal lookup.\n   */\n  tryDependencies(\n    from: Node,\n    dependencies: Dependency[] | Edge[],\n  ): Map<string, ModifierActiveEntry> {\n    const modifierRefs = new Map<string, ModifierActiveEntry>()\n    for (const { spec } of dependencies) {\n      const active = this.tryNewDependency(from, spec)\n      if (active) {\n        modifierRefs.set(spec.name, active)\n      }\n    }\n    return modifierRefs\n  }\n\n  /**\n   * Updates an active entry state keeping track of items in the multi-level\n   * active entries map. If the current breadcrumb state shows there's no more\n   * items left, then we deregister the modifier.\n   */\n  updateActiveEntry(from: Node, active: ModifierActiveEntry): void {\n    const { modifier } = active\n    const interactiveBreadcrumb = active.interactiveBreadcrumb.next()\n    const name = interactiveBreadcrumb.current?.name\n\n    // if there's no name, or we're done parsing then we\n    // deregister the modifier instead of updating the entry\n    if (interactiveBreadcrumb.done || !name) {\n      this.deregisterModifier(modifier)\n      return\n    }\n\n    // register the active modifier\n    this.activeModifiers.add(active)\n    active.modifier.refs.add({ from, name })\n\n    // optionally read or create the nested maps\n    const nameMap =\n      this.#activeEntries.get(modifier) ??\n      new Map<string, Map<Node, ModifierActiveEntry>>()\n    this.#activeEntries.set(modifier, nameMap)\n    const nodeMap =\n      nameMap.get(name) ?? new Map<Node, ModifierActiveEntry>()\n    nameMap.set(name, nodeMap)\n\n    // sets the active entry in the map\n    nodeMap.set(from, active)\n  }\n\n  /**\n   * Creates a new active modifier.\n   */\n  newModifier(\n    from: Node,\n    modifier: ModifierEntry,\n  ): ModifierActiveEntry {\n    return {\n      modifier,\n      interactiveBreadcrumb: modifier.breadcrumb.interactive(),\n      originalFrom: from,\n    }\n  }\n\n  /**\n   * Removes a previously registered modifier from the active entries.\n   */\n  deregisterModifier(modifier: ModifierEntry): void {\n    for (const { from, name } of modifier.refs) {\n      const nodeMap = this.#activeEntries.get(modifier)?.get(name)\n      if (nodeMap) {\n        // if an entry is found, we remove it from the active set\n        const entry = nodeMap.get(from)\n        if (entry) {\n          this.activeModifiers.delete(entry)\n        }\n        // then we remove the entry from the map\n        nodeMap.delete(from)\n        // if the map is empty, we remove it from the active entries map\n        if (!nodeMap.size) {\n          this.#activeEntries.get(modifier)?.delete(name)\n        }\n      }\n    }\n  }\n\n  /**\n   * Operates in previously registered nodes and edges in order to put\n   * back in place any of the original edges that were referenced to in\n   * active (ongoing) breadcrumb parsing entries that were never completed.\n   *\n   * This method can be used to easily rollback any pending operations\n   * once the graph traversal is done.\n   */\n  rollbackActiveEntries(): void {\n    for (const modifier of this.activeModifiers) {\n      // if the modifier has an original edge, we can put it back in place\n      if (modifier.originalEdge) {\n        modifier.originalFrom.edgesOut.set(\n          modifier.originalEdge.spec.name,\n          modifier.originalEdge,\n        )\n      }\n      // then we deregister the modifier\n      this.deregisterModifier(modifier.modifier)\n    }\n  }\n\n  /**\n   * Convenience method to instantiate and load in one call.\n   * Returns undefined if the project does not have a vlt.json file,\n   * otherwise returns the loaded Modifiers instance.\n   */\n  static maybeLoad(options: SpecOptions) {\n    const config = load('modifiers', assertRecordStringString)\n    if (!config) return\n    return new GraphModifier(options)\n  }\n\n  /**\n   * Convenience method to instantiate and load in one call.\n   * Throws if called on a directory that does not have a vlt.json file.\n   */\n  static load(options: SpecOptions) {\n    return new GraphModifier(options)\n  }\n}\n"]}

package/dist/node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAO7C,OAAO,KAAK,EAAE,KAAK,EAAc,MAAM,gBAAgB,CAAA;AAEvD,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAErD,OAAO,KAAK,EACV,SAAS,EACT,kBAAkB,EAClB,mBAAmB,EACnB,SAAS,EACT,QAAQ,EACT,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAKvC,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACtC,WAAW,EAAE,MAAM,CAAA;IACnB,KAAK,EAAE,SAAS,CAAA;CACjB,CAAA;AAED,qBAAa,IAAK,YAAW,QAAQ;;IACnC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAOD;;;;;;OAMG;IACH,IAAI,QAAQ,IAGW,OAAO,CAD7B;IACD,IAAI,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAS7B;IAED,UAAU,IAAI,IAAI,IAAI,IAAI,GAAG;QAAE,QAAQ,EAAE,IAAI,CAAA;KAAE;IAK/C;;;;;OAKG;IACH,IAAI,GAAG,IAGM,OAAO,CADnB;IACD,IAAI,GAAG,CAAC,GAAG,EAAE,OAAO,EASnB;IAED,KAAK,IAAI,IAAI,IAAI,IAAI,GAAG;QAAE,GAAG,EAAE,IAAI,CAAA;KAAE;IAIrC;;OAEG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,SAAS,UAAQ;IAEjB;;OAEG;IACH,OAAO,YAAkB;IAEzB;;;OAGG;IACH,QAAQ,oBAA0B;IAElC;;;OAGG;IACH,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,SAAS,CAAA;IAEzC;;OAEG;IACH,EAAE,EAAE,KAAK,CAAA;IAET;;OAEG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,YAAY,UAAQ;IAEpB;;OAEG;IACH,KAAK,EAAE,KAAK,CAAA;IAEZ;;OAEG;IACH,SAAS,CAAC,EAAE,SAAS,CAAA;IAErB;;OAEG;IACH,QAAQ,CAAC,EAAE,kBAAkB,CAAA;IAE7B;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;IAEnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;;;OAIG;IACH,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAA;IAS5B,IAAI,IAAI,WAIP;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;IAEhB;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;;;OAIG;IACH,QAAQ,CAAC,EAAE;QACT,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAChC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;QACtB,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;KACxB,CAAA;IAED;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAE7B;;OAEG;IACH,KAAK,UAAQ;IAEb;;;;;;OAMG;IACH,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAS;IAE3D;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;IAEpB;;;;;OAKG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAQrB;IAED,IAAI,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAM5B;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;IAI5C;;;;;;;OAOG;IACH,WAAW,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;gBAQrC,OAAO,EAAE,WAAW,EACpB,EAAE,CAAC,EAAE,KAAK,EACV,QAAQ,CAAC,EAAE,kBAAkB,EAC7B,IAAI,CAAC,EAAE,IAAI,EACX,IAAI,CAAC,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM;IAwBlB;;;;OAIG;IACH,UAAU,IAAI,OAAO;IAkBrB,IAAI,OAAO,IAKQ,WAAW,CAH7B;IAGD,IAAI,OAAO,CAAC,KAAK,EAAE,WAAW,EAAI;IAElC,MAAM,CAAC,KAAK,EAAE,IAAI;IAIlB;;OAEG;IACH,mBAAmB,CAAC,QAAQ,EAAE,MAAM;IAKpC;;;;OAIG;IACH,WAAW;IAqBX,kBAAkB;IAclB;;OAEG;IACH,UAAU,CAAC,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI;IAO7D;;;OAGG;IACH,IAAI,WAAW,IAAI,kBAAkB,GAAG,SAAS,CAEhD;IAED;;OAEG;IACH,mBAAmB,CACjB,KAAK,EAAE,kBAAkB,EACzB,QAAQ,CAAC,EAAE,kBAAkB;IAQ/B;;OAEG;IACH,wBAAwB,CACtB,IAAI,EAAE,IAAI,EACV,QAAQ,CAAC,EAAE,kBAAkB;IAa/B,MAAM;;;;;;;;;;;;;;;;;sBAnPM,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;iBAC3B,MAAM,EAAE,GAAG,MAAM;kBAChB,MAAM,EAAE,GAAG,MAAM;;;;IA6QzB,QAAQ;CAGT;AAED,eAAO,MAAM,MAAM,UAAW,OAAO,KAAG,KAAK,IAAI,IAQhD,CAAA;AAED,eAAO,MAAM,MAAM,UAAW,OAAO,KAAG,IAKvC,CAAA"}

package/dist/node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.js","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AACA,OAAO,EACL,qBAAqB,EACrB,KAAK,EACL,YAAY,EACZ,UAAU,GACX,MAAM,gBAAgB,CAAA;AAEvB,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AAE/C,OAAO,EAAE,+BAA+B,EAAE,MAAM,eAAe,CAAA;AAQ/D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AASnD,MAAM,OAAO,IAAI;IACf,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,QAAQ,CAAa;IACrB,SAAS,CAAS;IAClB,YAAY,CAAqB;IAEjC,SAAS,GAAG,KAAK,CAAA;IACjB;;;;;;OAMG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IACD,IAAI,QAAQ,CAAC,QAAiB;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAA;QAC7B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxB,8BAA8B;YAC9B,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,QAAQ;oBAAE,EAAE,CAAC,QAAQ,GAAG,KAAK,CAAA;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,IAAI,GAAG,KAAK,CAAA;IACZ;;;;;OAKG;IACH,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IACD,IAAI,GAAG,CAAC,GAAY;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;QACxB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;QACf,IAAI,MAAM,IAAI,CAAC,GAAG,EAAE,CAAC;YACnB,8BAA8B;YAC9B,KAAK,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,GAAG,IAAI,EAAE,EAAE,GAAG;oBAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAA;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAED;;OAEG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,SAAS,GAAG,KAAK,CAAA;IAEjB;;OAEG;IACH,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEzB;;;OAGG;IACH,QAAQ,GAAG,IAAI,GAAG,EAAgB,CAAA;IAElC;;;OAGG;IACH,UAAU,CAA+B;IAEzC;;OAEG;IACH,EAAE,CAAO;IAET;;OAEG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,YAAY,GAAG,KAAK,CAAA;IAEpB;;OAEG;IACH,KAAK,CAAO;IAEZ;;OAEG;IACH,SAAS,CAAY;IAErB;;OAEG;IACH,QAAQ,CAAqB;IAE7B;;OAEG;IACH,WAAW,CAAQ;IAEnB;;;;OAIG;IACH,QAAQ,CAAS;IAEjB;;;;OAIG;IACH,QAAQ,CAAoB;IAE5B;;;;;OAKG;IACH,KAAK,CAAS;IACd,IAAI,IAAI;QACN,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,CAAA;QACpB,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAS;IAEhB;;OAEG;IACH,QAAQ,CAAS;IAEjB;;;;OAIG;IACH,QAAQ,CAIP;IAED;;OAEG;IACH,IAAI,CAAyB;IAE7B;;OAEG;IACH,KAAK,GAAG,KAAK,CAAA;IAEb;;;;;;OAMG;IACH,UAAU,GAA2C,MAAM,CAAA;IAE3D;;;;OAIG;IACH,WAAW,CAAS;IAEpB;;;;;OAKG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,IAAI,QAAQ;QACV,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,SAAS,CAAA;QACvB,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,uBAAuB,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAA;QAC3E,oDAAoD;QACpD,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,IAAI,CAAA;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,IAAI,QAAQ,CAAC,QAAgB;QAC3B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,qDAAqD;QACrD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YAClD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAA;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAkB;QACjC,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAA;IACrD,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CAAC,MAAkB;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QACzC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACrD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,cAAc,CAAC,CAAA;IACzC,CAAC;IAED,YACE,OAAoB,EACpB,EAAU,EACV,QAA6B,EAC7B,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACd,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBACvB,MAAM,SAAS,CACb,8DAA8D,EAC9D;oBACE,QAAQ;iBACT,CACF,CAAA;YACH,CAAC;YACD,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAc,CAAA;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QAExB,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAA;QACxC,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAA;IAClD,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,uEAAuE;QACvE,mEAAmE;QACnE,wDAAwD;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CACpC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAC5C,CAAA;QACD,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,OAAO,CAAA;QAC/B,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,qBAAqB,CAAC,KAAiB;QACrC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3D,IAAI,CAAC,QAAQ;YACX,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,2BAA2B,CAAA;QAClE,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAA;IACnD,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAA;IACtB,CAAC;IAED,oBAAoB;IACpB,IAAI,OAAO,CAAC,KAAkB,IAAG,CAAC;IAElC,MAAM,CAAC,KAAW;QAChB,OAAO,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;IACjE,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,QAAgB;QAClC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;IACtB,CAAC;IAED;;;;OAIG;IACH,WAAW;QACT,iEAAiE;QACjE,8DAA8D;QAC9D,mBAAmB;QACnB,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACjC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,KAAK,CAAA;QAC9B,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;gBACxB,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAA;gBACjD,MAAK;YACP,CAAC;YACD,KAAK,UAAU;gBACb,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAA;gBACjC,MAAK;YACP;gBACE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;gBACxB,MAAK;QACT,CAAC;IACH,CAAC;IAED,kBAAkB;QAChB,MAAM,GAAG,GAAG,uBAAuB,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAA;QAEtE,2DAA2D;QAC3D,IACE,CAAC,IAAI,CAAC,QAAQ;YACd,CAAC,CAAC,IAAI,CAAC,SAAS;gBACd,CAAC,IAAI,CAAC,SAAS,KAAK,GAAG;oBACrB,0BAA0B,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EACrD,CAAC;YACD,IAAI,CAAC,SAAS,GAAG,GAAG,CAAA;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,IAAyB,EAAE,IAAU,EAAE,IAAW;QAC3D,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC7C,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAClC,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;OAGG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAA;IAC3C,CAAC;IAED;;OAEG;IACH,mBAAmB,CACjB,KAAyB,EACzB,QAA6B;QAE7B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;QACrB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAA;QAC5B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,wBAAwB,CACtB,IAAU,EACV,QAA6B;QAE7B,IAAI,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,mBAAmB,CACtB;gBACE,GAAG,IAAI,CAAC,QAAQ;gBAChB,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,EACD,QAAQ,CACT,CAAA;QACH,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EACN,IAAI,CAAC,QAAQ;gBACb,+BAA+B,CAAC,IAAI,CAAC,QAAQ,CAAC;YAChD,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACpB,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE;gBACnC,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjB,EAAE,WAAW,EAAE,IAAI,CAAC,YAAY,EAAE;gBACpC,CAAC,CAAC,SAAS,CAAC;SACb,CAAA;IACH,CAAC;IAED,QAAQ;QACN,OAAO,aAAa,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;CACF;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAc,EAAiB,EAAE;IACtD,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,IAAI,IAAI;QACb,IAAI,IAAI,KAAK;QACb,UAAU,IAAI,KAAK;QAClB,KAAc,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,oBAAoB,CAC7D,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAc,EAAQ,EAAE;IAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACnB,MAAM,SAAS,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA","sourcesContent":["import type { PathScurry } from 'path-scurry'\nimport {\n  isPackageNameConfused,\n  getId,\n  hydrateTuple,\n  splitDepID,\n} from '@vltpkg/dep-id'\nimport type { DepID, DepIDTuple } from '@vltpkg/dep-id'\nimport { typeError } from '@vltpkg/error-cause'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport { expandNormalizedManifestSymbols } from '@vltpkg/types'\nimport type {\n  Integrity,\n  NormalizedManifest,\n  DependencyTypeShort,\n  GraphLike,\n  NodeLike,\n} from '@vltpkg/types'\nimport { Edge } from './edge.ts'\nimport type { Graph } from './graph.ts'\nimport { stringifyNode } from './stringify-node.ts'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { GraphModifier } from './modifiers.ts'\n\nexport type NodeOptions = SpecOptions & {\n  projectRoot: string\n  graph: GraphLike\n}\n\nexport class Node implements NodeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Node'\n  }\n\n  #options: SpecOptions\n  #location?: string\n  #rawManifest?: NormalizedManifest\n\n  #optional = false\n  /**\n   * True if a node is only reachable via optional or peerOptional edges from\n   * any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any optional-flagged non-optional dependencies.\n   */\n  get optional() {\n    return this.#optional\n  }\n  set optional(optional: boolean) {\n    const before = this.#optional\n    this.#optional = optional\n    if (before && !optional) {\n      // unset for all deps, as well\n      for (const { to, optional } of this.edgesOut.values()) {\n        if (!optional && to?.optional) to.optional = false\n      }\n    }\n  }\n\n  isOptional(): this is Node & { optional: true } {\n    return this.#optional\n  }\n\n  #dev = false\n  /**\n   * True if a node is only reachable via dev edges from any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any dev-flagged non-dev dependencies.\n   */\n  get dev() {\n    return this.#dev\n  }\n  set dev(dev: boolean) {\n    const before = this.#dev\n    this.#dev = dev\n    if (before && !dev) {\n      // unset for all deps, as well\n      for (const { to, dev } of this.edgesOut.values()) {\n        if (!dev && to?.dev) to.dev = false\n      }\n    }\n  }\n\n  isDev(): this is Node & { dev: true } {\n    return this.#dev\n  }\n\n  /**\n   * True if there's a manifest-confused package name.\n   */\n  confused = false\n\n  /**\n   * True if this node has been extracted to the file system.\n   */\n  extracted = false\n\n  /**\n   * List of edges coming into this node.\n   */\n  edgesIn = new Set<Edge>()\n\n  /**\n   * List of edges from this node into other nodes. This usually represents\n   * that the connected node is a direct dependency of this node.\n   */\n  edgesOut = new Map<string, Edge>()\n\n  /**\n   * A `mainImporter` node may have workspace connected to it,\n   * equivalent to its `edgesOut` linked deps.\n   */\n  workspaces: Map<string, Edge> | undefined\n\n  /**\n   * A reference to the {@link DepID} this node represents in the graph.\n   */\n  id: DepID\n\n  /**\n   * True if this node is an importer node.\n   */\n  importer = false\n\n  /**\n   * True if this node is the project root node.\n   */\n  mainImporter = false\n\n  /**\n   * A reference to the graph this node is a part of.\n   */\n  graph: Graph\n\n  /**\n   * The manifest integrity value.\n   */\n  integrity?: Integrity\n\n  /**\n   * The manifest this node represents in the graph.\n   */\n  manifest?: NormalizedManifest\n\n  /**\n   * Project where this node resides\n   */\n  projectRoot: string\n\n  /**\n   * For registry nodes, this is the registry we fetched them from.\n   * Needed because their un-prefixed dependencies need to come from\n   * the same registry, if it's not the default.\n   */\n  registry?: string\n\n  /**\n   * If this node has been modified as part of applying a {@link GraphModifier}\n   * then this field will contain the modifier query that was applied.\n   * Otherwise, it will be `undefined`.\n   */\n  modifier: string | undefined\n\n  /**\n   * The name of the package represented by this node, this is usually\n   * equivalent to `manifest.name` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package names instead.\n   */\n  #name?: string\n  get name() {\n    if (this.#name) return this.#name\n    this.#name = this.id\n    return this.#name\n  }\n\n  /**\n   * The version of the package represented by this node, this is usually\n   * equivalent to `manifest.version` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package versions instead.\n   */\n  version?: string\n\n  /**\n   * An address {@link PackageInfoClient} may use to extract this package.\n   */\n  resolved?: string\n\n  /**\n   * Platform requirements (engines, os, cpu) extracted from manifest.\n   * Stored separately for optional dependencies to enable platform checks\n   * when manifest is not loaded.\n   */\n  platform?: {\n    engines?: Record<string, string>\n    os?: string[] | string\n    cpu?: string[] | string\n  }\n\n  /**\n   * Record of binary names to their paths in the package, if any.\n   */\n  bins?: Record<string, string>\n\n  /**\n   * True if this node has been built as part of the reify step.\n   */\n  built = false\n\n  /**\n   * Build state of this node - tracks whether it needs building, has been built, or failed.\n   * - 'none': No build state (default)\n   * - 'needed': Node needs to be built\n   * - 'built': Node has been successfully built\n   * - 'failed': Node build has failed\n   */\n  buildState: 'none' | 'needed' | 'built' | 'failed' = 'none'\n\n  /**\n   * Deterministic unique string used to identify (and ultimately duplicate)\n   * nodes that are affected by a peer context set modified resolution.\n   * These are appended to the node {@link DepID} as the `extra` suffix.\n   */\n  peerSetHash?: string\n\n  /**\n   * True if this node is detached from the graph.\n   * This is used to indicate that the node is not part of the graph\n   * although the node is still available as part of the resolution process.\n   * Allows for skipping fetching manifests for detached nodes.\n   */\n  detached = false\n\n  /**\n   * The file system location for this node.\n   */\n  get location(): string {\n    if (this.#location) {\n      return this.#location\n    }\n    this.#location = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n    // if using the default location, it is in the store\n    this.inVltStore = () => true\n    return this.#location\n  }\n\n  set location(location: string) {\n    this.#location = location\n    // reset memoization, since it might be elsewhere now\n    if (this.inVltStore !== Node.prototype.inVltStore) {\n      this.inVltStore = Node.prototype.inVltStore\n    }\n  }\n\n  /**\n   * The resolved location of the node in the file system.\n   */\n  resolvedLocation(scurry: PathScurry): string {\n    return scurry.cwd.resolve(this.location).fullpath()\n  }\n\n  /**\n   * The location of the node_modules folder where this node's edgesOut\n   * should be linked into. For nodes in the store, this is the parent\n   * directory, since they're extracted into a node_modules folder\n   * side by side with links to their deps. For nodes outside of the store\n   * (ie, importers and arbitrary link deps) this is the node_modules folder\n   * directly inside the node's directory.\n   */\n  nodeModules(scurry: PathScurry): string {\n    const loc = this.resolvedLocation(scurry)\n    return this.inVltStore() ?\n        loc.substring(0, loc.length - this.name.length - 1)\n      : scurry.resolve(loc, 'node_modules')\n  }\n\n  constructor(\n    options: NodeOptions,\n    id?: DepID,\n    manifest?: NormalizedManifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    this.#options = options\n    this.projectRoot = options.projectRoot\n    if (id) {\n      this.id = id\n    } else {\n      if (!manifest || !spec) {\n        throw typeError(\n          'A new Node needs either a manifest & spec or an id parameter',\n          {\n            manifest,\n          },\n        )\n      }\n      this.id = getId(spec, manifest)\n    }\n    this.graph = options.graph as Graph\n    this.manifest = manifest\n\n    this.#name = name || this.manifest?.name\n    this.version = version || this.manifest?.version\n  }\n\n  /**\n   * return true if this node is located in the vlt store\n   * memoized the first time it's called, since the store location\n   * doesn't change within the context of a single operation.\n   */\n  inVltStore(): boolean {\n    // technically this just means it's in *a* vlt store, but we can safely\n    // assume that a user won't construct a path like this by accident,\n    // and there's only ever one store in any given project.\n    const inStore = this.location.endsWith(\n      `.vlt/${this.id}/node_modules/${this.name}`,\n    )\n    this.inVltStore = () => inStore\n    return inStore\n  }\n\n  #registryNodeResolved(tuple: DepIDTuple) {\n    const spec = hydrateTuple(tuple, this.#name, this.#options)\n    this.resolved =\n      this.manifest?.dist?.tarball || spec.conventionalRegistryTarball\n    this.integrity ??= this.manifest?.dist?.integrity\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  /* c8 ignore next */\n  set options(_opts: SpecOptions) {}\n\n  equals(other: Node) {\n    return this.id === other.id && this.location === other.location\n  }\n\n  /**\n   * Sets the node as an importer along with its location.\n   */\n  setImporterLocation(location: string) {\n    this.#location = location\n    this.importer = true\n  }\n\n  /**\n   * Sets the appropriate resolve / integrity value for this node.\n   * Note that other places might also set these values, like for\n   * example the lockfile that might have already have this info.\n   */\n  setResolved() {\n    // file | remote | workspace type of ids all points to a URI that\n    // can be used as the `resolved` value, so we split the dep id\n    // for these cases.\n    const tuple = splitDepID(this.id)\n    const [type, resolved] = tuple\n    switch (type) {\n      case 'remote': {\n        this.resolved = resolved\n        this.integrity ??= this.manifest?.dist?.integrity\n        break\n      }\n      case 'registry':\n        this.#registryNodeResolved(tuple)\n        break\n      default:\n        this.resolved = resolved\n        break\n    }\n  }\n\n  setDefaultLocation() {\n    const def = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n\n    // only relocate if the location is in node_modules already\n    if (\n      !this.importer &&\n      (!this.#location ||\n        (this.#location !== def &&\n          /^(?:\\.\\/)?node_modules\\//.test(this.#location)))\n    ) {\n      this.#location = def\n    }\n  }\n\n  /**\n   * Add an edge from this node connecting it to a direct dependency.\n   */\n  addEdgesTo(type: DependencyTypeShort, spec: Spec, node?: Node) {\n    const edge = new Edge(type, spec, this, node)\n    node?.edgesIn.add(edge)\n    this.edgesOut.set(spec.name, edge)\n    return edge\n  }\n\n  /**\n   * The raw manifest before any modifications.\n   * If not set, falls back to the current manifest.\n   */\n  get rawManifest(): NormalizedManifest | undefined {\n    return this.#rawManifest ?? this.manifest\n  }\n\n  /**\n   * Sets this node as having a manifest-confused manifest.\n   */\n  setConfusedManifest(\n    fixed: NormalizedManifest,\n    confused?: NormalizedManifest,\n  ) {\n    this.manifest = fixed\n    this.#rawManifest = confused\n    this.confused = true\n    this.#name = this.manifest.name\n  }\n\n  /**\n   * Sets this node as having a manifest-confused manifest.\n   */\n  maybeSetConfusedManifest(\n    spec: Spec,\n    confused?: NormalizedManifest,\n  ) {\n    if (isPackageNameConfused(spec, this.manifest?.name)) {\n      this.setConfusedManifest(\n        {\n          ...this.manifest,\n          name: spec.name,\n        },\n        confused,\n      )\n    }\n  }\n\n  toJSON() {\n    return {\n      id: this.id,\n      name: this.name,\n      version: this.version,\n      location: this.location,\n      importer: this.importer,\n      manifest:\n        this.manifest &&\n        expandNormalizedManifestSymbols(this.manifest),\n      projectRoot: this.projectRoot,\n      integrity: this.integrity,\n      resolved: this.resolved,\n      dev: this.dev,\n      optional: this.optional,\n      confused: this.confused,\n      modifier: this.modifier,\n      platform: this.platform,\n      buildState: this.buildState,\n      ...(this.peerSetHash ?\n        { peerSetHash: this.peerSetHash }\n      : undefined),\n      ...(this.confused ?\n        { rawManifest: this.#rawManifest }\n      : undefined),\n    }\n  }\n\n  toString() {\n    return stringifyNode(this)\n  }\n}\n\nexport const isNode = (value: unknown): value is Node => {\n  return (\n    typeof value === 'object' &&\n    value != null &&\n    'id' in value &&\n    'manifest' in value &&\n    (value as Node)[Symbol.toStringTag] === '@vltpkg/graph.Node'\n  )\n}\n\nexport const asNode = (value: unknown): Node => {\n  if (!isNode(value)) {\n    throw typeError('Expected a node', { found: value })\n  }\n  return value\n}\n"]}

package/dist/non-empty-list.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-empty-list.d.ts","sourceRoot":"","sources":["../src/non-empty-list.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,cAAc,GAAI,CAAC,QACxB,CAAC,EAAE,KACR,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,EAAE,CAAkB,CAAA;AAEpD,eAAO,MAAM,YAAY,GAAI,CAAC,SAAS,CAAC,EAAE,yCACC,CAAA"}

package/dist/non-empty-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-empty-list.js","sourceRoot":"","sources":["../src/non-empty-list.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,IAAS,EACyB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;AAEpD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,KAAU,EAAE,EAAE,CAC5C,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAA","sourcesContent":["export const isNonEmptyList = <T>(\n  list: T[],\n): list is [first: T, ...rest: T[]] => !!list.length\n\nexport const nonEmptyList = <T>(nodes: T[]) =>\n  isNonEmptyList(nodes) ? nodes : undefined\n"]}

package/dist/reify/add-edge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-edge.d.ts","sourceRoot":"","sources":["../../src/reify/add-edge.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAG7D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAoCtC;;;;GAIG;AACH,eAAO,MAAM,OAAO,SACZ,IAAI,UACF,UAAU,WACT,cAAc,SAChB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,kBAqC9B,CAAA"}

package/dist/reify/add-edge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-edge.js","sourceRoot":"","sources":["../../src/reify/add-edge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAElD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAA;AACjD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAI7C,MAAM,cAAc,GAAG,KAAK,EAC1B,MAAc,EACd,IAAY,EACZ,OAAuB,EACvB,IAAI,GAAG,MAAM,EACb,EAAE;IACF,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IAC/C,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;IACnC,CAAC;IAAC,OAAO,EAAE,EAAE,CAAC;QACZ,qBAAqB;QACrB,IAAK,EAA4B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACpD,MAAM,EAAE,CAAA;QACV,CAAC;QACD,oBAAoB;QAEpB,mCAAmC;QACnC,MAAM,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;QAEtB,IAAI,CAAC;YACH,8BAA8B;YAC9B,MAAM,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;YACjC,qBAAqB;QACvB,CAAC;QAAC,OAAO,EAAE,EAAE,CAAC;YACZ,0EAA0E;YAC1E,iFAAiF;YACjF,IAAK,EAA4B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACpD,MAAM,EAAE,CAAA;YACV,CAAC;QACH,CAAC;QACD,oBAAoB;IACtB,CAAC;AACH,CAAC,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,KAAK,EAC1B,IAAU,EACV,MAAkB,EAClB,OAAuB,EACvB,IAA6B,EAC7B,EAAE;IACF,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAM;IACpB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAC5B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAC7B,MAAM,CACP,CAAA;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CACzB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAC7B,IAAI,CAAC,IAAI,CAAC,IAAI,CACf,CAAA;IACD,MAAM,QAAQ,GAAuB,EAAE,CAAA;IACvC,MAAM,MAAM,GAAG,QAAQ,CACrB,OAAO,CAAC,IAAI,CAAC,EACb,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CACjC,CAAA;IAED,8DAA8D;IAC9D,0DAA0D;IAC1D,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IACtD,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO;QAAE,MAAM,CAAC,CAAA;;QACpC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAErB,IAAI,IAAI,EAAE,CAAC;QACT,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;YACzC,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;YAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;YAC3C,sCAAsC;YACtC,QAAQ,CAAC,IAAI,CACX,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;gBAC5B,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC;gBAC3C,CAAC,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CACxC,CAAA;QACH,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;AAClD,CAAC,CAAA","sourcesContent":["import { cmdShimIfExists } from '@vltpkg/cmd-shim'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { mkdir, symlink } from 'node:fs/promises'\nimport { dirname, relative } from 'node:path'\nimport type { PathScurry } from 'path-scurry'\nimport type { Edge } from '../edge.ts'\n\nconst clobberSymlink = async (\n  target: string,\n  link: string,\n  remover: RollbackRemove,\n  type = 'file',\n) => {\n  await mkdir(dirname(link), { recursive: true })\n  try {\n    await symlink(target, link, type)\n  } catch (er) {\n    /* c8 ignore start */\n    if ((er as NodeJS.ErrnoException).code !== 'EEXIST') {\n      throw er\n    }\n    /* c8 ignore stop */\n\n    // if the symlink exists, remove it\n    await remover.rm(link)\n\n    try {\n      // then try to create it again\n      await symlink(target, link, type)\n      /* c8 ignore start */\n    } catch (er) {\n      // if the symlink still exists, then multiple paths could be writing to it\n      // so now just ignore that error. See https://github.com/vltpkg/vltpkg/issues/797\n      if ((er as NodeJS.ErrnoException).code !== 'EEXIST') {\n        throw er\n      }\n    }\n    /* c8 ignore stop */\n  }\n}\n\n/**\n * reify an edge into a node_modules folder, with bins linked\n * this does NOT chmod the bins to 0o777, because they might not exist\n * until scripts are run, in the case of non-store deps like workspaces\n */\nexport const addEdge = async (\n  edge: Edge,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n  bins?: Record<string, string>,\n) => {\n  if (!edge.to) return\n  const binRoot = scurry.resolve(\n    edge.from.nodeModules(scurry),\n    '.bin',\n  )\n  const path = scurry.resolve(\n    edge.from.nodeModules(scurry),\n    edge.spec.name,\n  )\n  const promises: Promise<unknown>[] = []\n  const target = relative(\n    dirname(path),\n    edge.to.resolvedLocation(scurry),\n  )\n\n  // can only parallelize this on posix, because the win32 shims\n  // need to know that they will exist before being created.\n  const p = clobberSymlink(target, path, remover, 'dir')\n  if (process.platform === 'win32') await p\n  else promises.push(p)\n\n  if (bins) {\n    for (const [key, val] of Object.entries(bins)) {\n      const link = scurry.resolve(binRoot, key)\n      const absTarget = scurry.resolve(path, val)\n      const target = relative(binRoot, absTarget)\n      // TODO: bash/cmd/ps1 shims on Windows\n      promises.push(\n        process.platform === 'win32' ?\n          cmdShimIfExists(absTarget, link, remover)\n        : clobberSymlink(target, link, remover),\n      )\n    }\n  }\n  if (promises.length) await Promise.all(promises)\n}\n"]}

package/dist/reify/add-edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-edges.d.ts","sourceRoot":"","sources":["../../src/reify/add-edges.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC7D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGtC,eAAO,MAAM,QAAQ,SACb,IAAI,UACF,UAAU,WACT,cAAc,KACtB,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC,EAS1B,CAAA"}

package/dist/reify/add-edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-edges.js","sourceRoot":"","sources":["../../src/reify/add-edges.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAEvC,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,IAAU,EACV,MAAkB,EAClB,OAAuB,EACK,EAAE;IAC9B,MAAM,OAAO,GAA+B,EAAE,CAAA;IAC9C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAClC,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAA;QACnB,IAAI,CAAC,EAAE;YAAE,SAAQ;QACjB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAA;QACpB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAA;IAC1D,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA","sourcesContent":["import type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type { PathScurry } from 'path-scurry'\nimport type { Diff } from '../diff.ts'\nimport { addEdge } from './add-edge.ts'\n\nexport const addEdges = (\n  diff: Diff,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n): (() => Promise<unknown>)[] => {\n  const actions: (() => Promise<unknown>)[] = []\n  for (const edge of diff.edges.add) {\n    const { to } = edge\n    if (!to) continue\n    const bins = to.bins\n    actions.push(() => addEdge(edge, scurry, remover, bins))\n  }\n  return actions\n}\n"]}

package/dist/reify/add-nodes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-nodes.d.ts","sourceRoot":"","sources":["../../src/reify/add-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGtC,eAAO,MAAM,QAAQ,SACb,IAAI,UACF,UAAU,WACT,cAAc,WACd,WAAW,eACP,iBAAiB,KAC7B,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC,EAgB1B,CAAA"}

package/dist/reify/add-nodes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-nodes.js","sourceRoot":"","sources":["../../src/reify/add-nodes.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAE/C,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,IAAU,EACV,MAAkB,EAClB,OAAuB,EACvB,OAAoB,EACpB,WAA8B,EACF,EAAE;IAC9B,MAAM,OAAO,GAA+B,EAAE,CAAA;IAC9C,2DAA2D;IAC3D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAClC,iEAAiE;QACjE,wDAAwD;QACxD,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YAAE,SAAQ;QAEhC,8CAA8C;QAC9C,IAAI,IAAI,CAAC,SAAS;YAAE,SAAQ;QAE5B,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAChB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,CAC/D,CAAA;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA","sourcesContent":["import type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { PathScurry } from 'path-scurry'\nimport type { Diff } from '../diff.ts'\nimport { extractNode } from './extract-node.ts'\n\nexport const addNodes = (\n  diff: Diff,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n  options: SpecOptions,\n  packageInfo: PackageInfoClient,\n): (() => Promise<unknown>)[] => {\n  const actions: (() => Promise<unknown>)[] = []\n  // fetch and extract all the nodes, removing any in the way\n  for (const node of diff.nodes.add) {\n    // if it's not in the store, we don't have to extract it, because\n    // we're just linking to a location that already exists.\n    if (!node.inVltStore()) continue\n\n    // skip nodes that have already been extracted\n    if (node.extracted) continue\n\n    actions.push(() =>\n      extractNode(node, scurry, remover, options, packageInfo, diff),\n    )\n  }\n  return actions\n}\n"]}

package/dist/reify/bin-chmod.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin-chmod.d.ts","sourceRoot":"","sources":["../../src/reify/bin-chmod.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC;;GAEG;AACH,eAAO,MAAM,WAAW,UACf,QAAQ,CAAC,IAAI,CAAC,UACb,UAAU,KACjB,OAAO,CAAC,IAAI,CAMd,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,QAAQ,SACb,IAAI,UACF,UAAU,KACjB,OAAO,CAAC,IAAI,CAad,CAAA"}

package/dist/reify/bin-chmod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin-chmod.js","sourceRoot":"","sources":["../../src/reify/bin-chmod.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAIxC;;GAEG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,KAAqB,EACrB,MAAkB,EACH,EAAE;IACjB,MAAM,MAAM,GAAoB,EAAE,CAAA;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAA;IACrC,CAAC;IACD,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;AAC3B,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,KAAK,EAC3B,IAAU,EACV,MAAkB,EACH,EAAE;IACjB,MAAM,MAAM,GAAoB,EAAE,CAAA;IAClC,IAAI,CAAC,IAAI,CAAC,IAAI;QAAE,OAAM;IACtB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CACzB,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,CAC1C,CAAA;QACD,iDAAiD;QACjD,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAA;QACnC,CAAC;IACH,CAAC;IACD,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;AAC3B,CAAC,CAAA;AAED,qBAAqB;AACrB,4DAA4D;AAC5D,oEAAoE;AACpE,IAAI,QAAQ,GAAG,CAAC,CAAA;AAChB,MAAM,cAAc,GAAG,KAAK,EAAE,IAAY,EAAE,EAAE;IAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,QAAQ,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK,CAAA;IAClD,CAAC;IACD,MAAM,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;AAC7B,CAAC,CAAA","sourcesContent":["import { statSync, existsSync } from 'node:fs'\nimport { chmod } from 'node:fs/promises'\nimport type { PathScurry } from 'path-scurry'\nimport type { Node } from '../node.ts'\n\n/**\n * Make all the packages' bins executable.\n */\nexport const binChmodAll = async (\n  nodes: Iterable<Node>,\n  scurry: PathScurry,\n): Promise<void> => {\n  const chmods: Promise<void>[] = []\n  for (const node of nodes) {\n    chmods.push(binChmod(node, scurry))\n  }\n  await Promise.all(chmods)\n}\n\n/**\n * Make all the package's bins executable.\n */\nexport const binChmod = async (\n  node: Node,\n  scurry: PathScurry,\n): Promise<void> => {\n  const chmods: Promise<void>[] = []\n  if (!node.bins) return\n  for (const bin of Object.values(node.bins)) {\n    const path = scurry.resolve(\n      `${node.resolvedLocation(scurry)}/${bin}`,\n    )\n    // only try to make executable if the file exists\n    if (existsSync(path)) {\n      chmods.push(makeExecutable(path))\n    }\n  }\n  await Promise.all(chmods)\n}\n\n// 0 is \"not yet set\"\n// This is defined by doing `0o111 | <mode>` so that systems\n// that create files group-writable result in 0o775 instead of 0o755\nlet execMode = 0\nconst makeExecutable = async (path: string) => {\n  if (!execMode) {\n    execMode = (statSync(path).mode & 0o777) | 0o111\n  }\n  await chmod(path, execMode)\n}\n"]}

package/dist/reify/build.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../src/reify/build.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAGvD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAKtC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG;IACxB,OAAO,EAAE,IAAI,EAAE,CAAA;IACf,OAAO,EAAE,IAAI,EAAE,CAAA;CAChB,CAAA;AAED,eAAO,MAAM,KAAK,SACV,IAAI,eACG,WAAW,UAChB,UAAU,qBACC,GAAG,CAAC,KAAK,CAAC,KAC5B,OAAO,CAAC,WAAW,CA6DrB,CAAA"}

package/dist/{esm/reify → reify}/build.js

@@ -2,7 +2,7 @@
 // at the end, we get back to the importers, and run their prepare
 // script as well as install script.
 import { run } from '@vltpkg/run';
-import { graphRun } from 'graph-run';
+import { graphRun } from '@vltpkg/graph-run';
 import { nonEmptyList } from "../non-empty-list.js";
 import { optionalFail } from "./optional-fail.js";
 import { binChmod } from "./bin-chmod.js";

package/dist/reify/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/reify/build.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,kEAAkE;AAClE,oCAAoC;AAGpC,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAA;AACjC,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AAK5C,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAA;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAUzC,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EACxB,IAAU,EACV,WAAwB,EACxB,MAAkB,EAClB,iBAA6B,EACP,EAAE;IACxB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAA;IACrB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAA;IAChD,MAAM,GAAG,GAAgB,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAA;IAErD,oEAAoE;IACpE,MAAM,gBAAgB,GAAG,CAAC,IAAU,EAAW,EAAE,CAC/C,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAEhC,4DAA4D;IAC5D,IAAI,CAAC,KAAK;QAAE,OAAO,GAAG,CAAA;IAEtB,MAAM,QAAQ,CAAgB;QAC5B,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,KAAK,EAAE,IAAU,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE;YACxC,2DAA2D;YAC3D,mEAAmE;YACnE,iEAAiE;YACjE,qBAAqB;YACrB,6DAA6D;YAC7D,8BAA8B;YAE9B,IACE,CAAC,IAAI,CAAC,QAAQ;gBACd,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBAEtD,OAAM;YAER,IAAI,CAAC;gBACH,MAAM,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;gBACpD,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACnB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAA;oBACzB,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACxB,CAAC;gBACD,4DAA4D;YAC9D,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,wDAAwD;gBACxD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAA;oBAC1B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACtB,oCAAoC;oBACpC,MAAM,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;gBAC3D,CAAC;qBAAM,CAAC;oBACN,iCAAiC;oBACjC,MAAM,GAAG,CAAA;gBACX,CAAC;YACH,CAAC;YACD,oBAAoB;QACtB,CAAC;QAED,OAAO,EAAE,IAAI,CAAC,EAAE;YACd,MAAM,IAAI,GAAW,EAAE,CAAA;YACvB,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC5C,uDAAuD;gBACvD,IAAI,EAAE;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACvB,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;KACF,CAAC,CAAA;IAEF,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,KAAK,GAAG,KAAK,EACjB,WAAwB,EACxB,MAAkB,EAClB,IAAU,EACV,MAAmB,EACnB,KAAa,EACE,EAAE;IACjB,qEAAqE;IACrE,qEAAqE;IACrE,iEAAiE;IACjE,qCAAqC;IACrC,IAAI,CAAC,QAAQ,KAAK,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAA;IACjE,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;IACzB,MAAM,EAAE,OAAO,GAAG,EAAE,EAAE,GAAG,QAAQ,CAAA;IAEjC,MAAM,EACJ,OAAO,EACP,UAAU,EACV,WAAW,EACX,OAAO,EACP,UAAU,EACV,WAAW,GACZ,GAAG,OAAO,CAAA;IAEX,mCAAmC;IACnC,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,UAAU,IAAI,WAAW,CAAC,CAAA;IAC3D,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,GAAG,CAAC;YACR,MAAM;YACN,IAAI,EAAE,SAAS;YACf,aAAa,EAAE,IAAI;YACnB,WAAW;YACX,GAAG,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;YAClC,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,QAAQ;SACT,CAAC,CAAA;IACJ,CAAC;IAED,0CAA0C;IAC1C,MAAM,QAAQ,GACZ,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAA;IAClE,MAAM,UAAU,GACd,CAAC,CAAC,CAAC,OAAO,IAAI,UAAU,IAAI,WAAW,CAAC,IAAI,QAAQ,CAAA;IAEtD,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,GAAG,CAAC;YACR,MAAM;YACN,IAAI,EAAE,SAAS;YACf,aAAa,EAAE,IAAI;YACnB,WAAW;YACX,GAAG,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;YAClC,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,QAAQ;SACT,CAAC,CAAA;IACJ,CAAC;IAED,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;AAC9B,CAAC,CAAA","sourcesContent":["// walk the graph of added nodes, building and chmoding their bins\n// at the end, we get back to the importers, and run their prepare\n// script as well as install script.\n\nimport type { PackageJson } from '@vltpkg/package-json'\nimport { run } from '@vltpkg/run'\nimport { graphRun } from '@vltpkg/graph-run'\nimport type { PathScurry } from 'path-scurry'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { Diff } from '../diff.ts'\nimport type { Node } from '../node.ts'\nimport { nonEmptyList } from '../non-empty-list.ts'\nimport { optionalFail } from './optional-fail.ts'\nimport { binChmod } from './bin-chmod.ts'\n\n/**\n * Returns an object mapping registries to the names of the packages built.\n */\nexport type BuildResult = {\n  success: Node[]\n  failure: Node[]\n}\n\nexport const build = async (\n  diff: Diff,\n  packageJson: PackageJson,\n  scurry: PathScurry,\n  allowScriptsNodes: Set<DepID>,\n): Promise<BuildResult> => {\n  const graph = diff.to\n  const nodes = nonEmptyList([...graph.importers])\n  const res: BuildResult = { success: [], failure: [] }\n\n  // determine if scripts should run - check if node is in allowed set\n  const shouldRunScripts = (node: Node): boolean =>\n    allowScriptsNodes.has(node.id)\n\n  /* c8 ignore next - all graphs have at least one importer */\n  if (!nodes) return res\n\n  await graphRun<Node, unknown>({\n    graph: nodes,\n    visit: async (node: Node, signal, path) => {\n      // if it's not an importer or an added node, nothing to do.\n      // TODO: only build importers if it has changed deps, there's never\n      // been a previous build, or it contains something newer than the\n      // most recent build.\n      // For now, just always build all importers, because we don't\n      // track all that other stuff.\n\n      if (\n        !node.importer &&\n        (!diff.nodes.add.has(node) || !shouldRunScripts(node))\n      )\n        return\n\n      try {\n        await visit(packageJson, scurry, node, signal, path)\n        if (!node.importer) {\n          node.buildState = 'built'\n          res.success.push(node)\n        }\n        /* c8 ignore start - windows on CI is missing those tests */\n      } catch (err) {\n        // Check if this is an optional failure that was handled\n        if (node.optional) {\n          node.buildState = 'failed'\n          res.failure.push(node)\n          // Let optionalFail handle the error\n          await Promise.reject(err).catch(optionalFail(diff, node))\n        } else {\n          // Re-throw non-optional failures\n          throw err\n        }\n      }\n      /* c8 ignore stop */\n    },\n\n    getDeps: node => {\n      const deps: Node[] = []\n      for (const { to } of node.edgesOut.values()) {\n        /* c8 ignore next - vanishingly unlikely in practice */\n        if (to) deps.push(to)\n      }\n      return deps\n    },\n  })\n\n  return res\n}\n\nconst visit = async (\n  packageJson: PackageJson,\n  scurry: PathScurry,\n  node: Node,\n  signal: AbortSignal,\n  _path: Node[],\n): Promise<void> => {\n  // at this point we might have to read the manifest from disk if it's\n  // currently nullish, that could happen in a scenario where the ideal\n  // graph is from a lockfile and there's no actual graph available\n  // to hydrate the manifest data from.\n  node.manifest ??= packageJson.read(node.resolvedLocation(scurry))\n  const { manifest } = node\n  const { scripts = {} } = manifest\n\n  const {\n    install,\n    preinstall,\n    postinstall,\n    prepare,\n    preprepare,\n    postprepare,\n  } = scripts\n\n  // if it has install script, run it\n  const runInstall = !!(install || preinstall || postinstall)\n  if (runInstall) {\n    await run({\n      signal,\n      arg0: 'install',\n      ignoreMissing: true,\n      packageJson,\n      cwd: node.resolvedLocation(scurry),\n      projectRoot: node.projectRoot,\n      manifest,\n    })\n  }\n\n  // if it's an importer or git, run prepare\n  const prepable =\n    node.id.startsWith('git') || node.importer || !node.inVltStore()\n  const runPrepare =\n    !!(prepare || preprepare || postprepare) && prepable\n\n  if (runPrepare) {\n    await run({\n      signal,\n      arg0: 'prepare',\n      ignoreMissing: true,\n      packageJson,\n      cwd: node.resolvedLocation(scurry),\n      projectRoot: node.projectRoot,\n      manifest,\n    })\n  }\n\n  await binChmod(node, scurry)\n}\n"]}

package/dist/reify/calculate-save-value.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"calculate-save-value.d.ts","sourceRoot":"","sources":["../../src/reify/calculate-save-value.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAGxC,eAAO,MAAM,kBAAkB,aACnB,MAAM,QACV,IAAI,YACA,MAAM,GAAG,SAAS,eACf,MAAM,GAAG,SAAS,KAC9B,MAoDF,CAAA"}