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

package/dist/ideal/append-nodes.js.map

@@ -1 +1 @@
-{"version":3,"file":"append-nodes.js","sourceRoot":"","sources":["../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAE1D,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAE3C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAEnC,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAA;AAOtE,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAA;AACzD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAI5C,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAA;AAMvE,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AAEtD,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,kBAAkB,GACnB,MAAM,YAAY,CAAA;AAenB;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAC3B,IAAU,EACV,OAA2B,EAC3B,EAAE,CACF,OAAO,KAAK,iBAAiB;IAC7B,IAAI,CAAC,QAAQ;IACb,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAE3B;;GAEG;AACH,MAAM,eAAe,GAAG,CACtB,IAAU,EACV,QAAc,EACd,MAAkB,EACQ,EAAE;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAM;IAE7B,4CAA4C;IAC5C,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,CAAC,2BAA2B,EAAE,EAAE,IAAI,EAAE,CAAC,CAAA;IACpD,CAAC;IACD,oBAAoB;IAEpB,uEAAuE;IACvE,2EAA2E;IAC3E,uEAAuE;IACvE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACpE,MAAM,IAAI,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;IACnC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;IAEzC,OAAO;QACL,IAAI;QACJ,EAAE;QACF,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE;KACjD,CAAA;AACH,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,CAAC,CAAU,EAAiB,EAAE,CAClD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAA;AA8BzD;;GAEG;AACH,MAAM,qBAAqB,GAAG,KAAK,EACjC,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,WAAwB,EACxB,YAA+C,EAC/C,KAAK,GAAG,CAAC,EACqB,EAAE;IAChC,wDAAwD;IACxD,MAAM,UAAU,GAAwB,EAAE,CAAA;IAC1C,MAAM,cAAc,GAAwB,EAAE,CAAA;IAE9C,KAAK,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAChD,IAAI,IAAI,GAAG,YAAY,CAAA;QACvB,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC5D,MAAM,cAAc,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnD,iEAAiE;QACjE,MAAM,aAAa,GAAG,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAA;QACpD,MAAM,gBAAgB,GACpB,cAAc;YACd,cAAc,CAAC,qBAAqB,CAAC,OAAO;gBAC1C,cAAc,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAA;QAC3C,IACE,aAAa;YACb,gBAAgB;YAChB,MAAM,IAAI,cAAc,CAAC,QAAQ,EACjC,CAAC;YACD,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAA;YACnC,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE,CAAC;gBAC1B,SAAQ;YACV,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,cAAc,CAAA;QAEvD,2DAA2D;QAC3D,yDAAyD;QACzD,MAAM,YAAY,GAAG,KAAK,CAAC,cAAc,CACvC,IAAI,EACJ,QAAQ,EACR,aAAa,CACd,CAAA;QACD,+CAA+C;QAC/C,MAAM,iBAAiB,GACrB,YAAY;YACZ,CAAC,YAAY,CAAC,QAAQ;YACtB,gCAAgC;YAChC,qBAAqB;YACrB,CAAC,CAAC,IAAI;gBACJ,mEAAmE;gBACnE,YAAY,CAAC,WAAW,KAAK,QAAQ,CAAC,WAAW,CAAC,CAAA;QACtD,oBAAoB;QAEpB,IACE,iBAAiB;YACjB,wDAAwD;YACxD,8CAA8C;YAC9C,YAAY,EAAE,QAAQ,EACtB,CAAC;YACD,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAA;YACjD,SAAQ;QACV,CAAC;QAED,0DAA0D;QAC1D,MAAM,YAAY,GAChB,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,cAAc,CAAA;QAEhD,2DAA2D;QAC3D,MAAM,eAAe;QACnB,mEAAmE;QACnE,wEAAwE;QACxE,2DAA2D;QAC3D,YAAY,EAAE,QAAQ,CAAC,CAAC;YACtB,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,QAAgC,CAAC;YAC9D,+DAA+D;YAC/D,2CAA2C;YAC7C,CAAC,CAAC,WAAW;iBACR,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;iBAC3D,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAgC,CAAC;iBAClD,KAAK,CAAC,CAAC,EAAW,EAAE,EAAE;gBACrB,wCAAwC;gBACxC,IAAI,YAAY,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;oBACtC,OAAO,SAAS,CAAA;gBAClB,CAAC;gBACD,MAAM,EAAE,CAAA;YACV,CAAC,CAAC,CAAA;QAER,MAAM,SAAS,GAAsB;YACnC,IAAI;YACJ,IAAI;YACJ,QAAQ;YACR,YAAY;YACZ,cAAc;YACd,aAAa;YACb,YAAY;YACZ,eAAe;YACf,KAAK;YACL,WAAW;SACZ,CAAA;QAED,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC5B,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,eAAe,CAAA;QAEhD,cAAc,CAAC,IAAI,CAAC;YAClB,SAAS;YACT,QAAQ;SACT,CAAC,CAAA;IACJ,CAAC;IAED,4EAA4E;IAC5E,oEAAoE;IACpE,yEAAyE;IACzE,qDAAqD;IACrD,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,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,qDAAqD;QACrD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,OAAO,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED,iCAAiC;QACjC,+DAA+D;QAC/D,MAAM,KAAK,GACT,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAA;QAChE,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAA;QACvD,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,OAAO,cAAc,CAAA;AACvB,CAAC,CAAA;AAED;;;;GAIG;AACH,MAAM,qBAAqB,GAAG,KAAK,EACjC,KAAY,EACZ,OAAoB,EACpB,cAAmC,EACnC,GAA6B,EAC7B,SAAyB,EACzB,MAAmB,EACnB,WAA+B,EAC/B,eAA0C,EAC1C,MAAc,EACd,aAA0B,EAC1B,OAAwB,EACxB,YAA8B,EAC9B,eAAoC,EACH,EAAE;IACnC,MAAM,kBAAkB,GAA2B,EAAE,CAAA;IAErD,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;QAC3C,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,aAAa,CAAA;QAC7C,IAAI,EACF,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,aAAa,EACb,IAAI,EACJ,IAAI,GACL,GAAG,SAAS,CAAA;QAEb,sEAAsE;QACtE,mEAAmE;QACnE,2DAA2D;QAC3D,MAAM,WAAW,GACf,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAC1D,IAAI,GAAG,eAAe,CAAC,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QAE5D,sCAAsC;QACtC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC,YAAY,IAAI,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC;gBAC3C,8DAA8D;gBAC9D,kCAAkC;gBAClC,sBAAsB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;gBACvC,SAAQ;YACV,CAAC;iBAAM,IAAI,YAAY,EAAE,CAAC;gBACxB,wDAAwD;gBACxD,iEAAiE;gBACjE,SAAQ;YACV,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAC,8BAA8B,EAAE;oBAC1C,IAAI;oBACJ,IAAI,EAAE,QAAQ,CAAC,QAAQ;iBACxB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,mEAAmE;QACnE,uDAAuD;QACvD,MAAM,aAAa,GAAG,kBAAkB,CACtC,WAAW,EACX,QAAQ,EACR,QAAQ,EACR,OAAO,CACR,CAAA;QACD,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,CAAA;QAC7C,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,CAAA;QAEjD,sEAAsE;QACtE,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAC7B,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,iBAAiB,CAAC,QAAQ,CAAC,EAC3B,YAAY,EAAE,EAAE,EAChB,SAAS,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,CACpD,CAAA;QAED,8DAA8D;QAC9D,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,KAAK,CAAC,yBAAyB,EAAE;gBACrC,IAAI,EAAE,QAAQ,CAAC,QAAQ;gBACvB,IAAI;aACL,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,mCAAmC;QACnC,IAAI,cAAc,EAAE,CAAC;YACnB,SAAS,EAAE,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;QACpD,CAAC;QAED,MAAM,qBAAqB,GACzB,IAAI,KAAK,MAAM;YACf,IAAI,KAAK,cAAc;YACvB,OAAO;YACP,eAAe;YACf,MAAM;YACN,MAAM;YACN,WAAW;YACX,IAAI,CAAC,UAAU,EAAE;YACjB,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,4DAA4D;YAC5D,oBAAoB,CAAC,CAAC,YAAY,EAAE,WAAW;YAC/C,CAAC,IAAI,CAAC,QAAQ,CAAA;QAEhB,iEAAiE;QACjE,IAAI,qBAAqB,EAAE,CAAC;YAC1B,qBAAqB;YACrB,IAAI,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,SAAQ;YACV,CAAC;YACD,oBAAoB;YACpB,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC3B,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5C,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,oEAAoE;gBACpE,MAAM,cAAc,GAAG,WAAW,CAChC,IAAI,EACJ,MAAM,EACN,OAAO,EACP,OAAO,EACP,WAAW,CACZ,CAAA;gBACD,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,IAAI,YAAY,EAAE,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;YACnD,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAA;QACnC,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAA;QAElB,8DAA8D;QAC9D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsB,CAAA;QAElD,wBAAwB;QACxB,MAAM,UAAU,GAAG,QAAQ,CAAC,kBAAkB,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CACE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,QAAQ;YACb,CAAC,aAAa,CAAC,UAAU,CAAC,CAC7B,CAAC,CAAC;YACD,EAAE;YACJ,CAAC,CAAC,UAAU,CACb,CAAA;QAED,qEAAqE;QACrE,MAAM,QAAQ,GAAiB,EAAE,CAAA;QAEjC,0DAA0D;QAC1D,uCAAuC;QACvC,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAAE,CAAC;YAC9C,MAAM,SAAS,GACb,QAAQ,CAAC,WAAW,CAAC,CAAA;YAEvB,IAAI,SAAS,IAAI,oBAAoB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;gBACzD,kDAAkD;gBAClD,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,IAAI,CAClD,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CACvC,CAAA;gBACD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;oBAC7C,mDAAmD;oBACnD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,SAAQ;oBAC/B,MAAM,GAAG,GAAG;wBACV,IAAI,EAAE,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,QAAQ,CAAC;wBAC1C,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE;4BAC/B,GAAG,OAAO;4BACV,QAAQ,EAAE,IAAI,CAAC,QAAQ;yBACxB,CAAC;qBACH,CAAA;oBACD,IAAI,WAAW,KAAK,kBAAkB,EAAE,CAAC;wBACvC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;oBAC7B,CAAC;yBAAM,CAAC;wBACN,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,oEAAoE;QACpE,mEAAmE;QACnE,MAAM,aAAa,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChD,IAAI,aAAa,EAAE,CAAC;YAClB,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,aAAa,EAAE,CAAC;gBACpC,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;oBACvD,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;oBACpC,SAAQ;gBACV,CAAC;gBAED,2DAA2D;gBAC3D,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAC9B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CACnC,CAAA;gBACD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjB,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;gBAC3B,CAAC;gBAED,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACpB,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,MAAM,iBAAiB,GAAG,eAAe,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACvD,IAAI,iBAAiB,EAAE,CAAC;YACtB,KAAK,MAAM,OAAO,IAAI,iBAAiB,EAAE,CAAC;gBACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAC9B,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CACjC,CAAA;gBACD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjB,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;oBACzB,SAAQ;gBACV,CAAC;gBAED,IAAI,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC9B,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,mEAAmE;QACnE,iEAAiE;QACjE,MAAM,aAAa,GAAG,gBAAgB,CACpC,WAAW,EACX,QAAQ,EACR,YAAY,EACZ,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,aAAa,CACd,CAAA;QAED,kBAAkB,CAAC,IAAI,CAAC;YACtB,IAAI;YACJ,IAAI,EAAE,QAAQ;YACd,YAAY,EAAE,SAAS,EAAE,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;YACxD,WAAW;YACX,aAAa;SACd,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,kBAAkB,CAAA;AAC3B,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,OAAoB,EACpB,IAAgB,EAChB,GAA6B,EAC7B,SAAyB,EACzB,YAA+C,EAC/C,eAA0C,EAC1C,MAAc,EACd,aAA0B,EAC1B,OAAwB,EACxB,YAA8B,EAC9B,eAAoC,EACpC,EAAE;IACF,oBAAoB;IACpB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAM;IACjC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAErB,8CAA8C;IAC9C,MAAM,CAAC,kBAAkB,CAAC,GAAG,KAAK,CAAC,YAAY,CAAA;IAC/C,kCAAkC;IAClC,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACxB,MAAM,KAAK,CAAC,wCAAwC,CAAC,CAAA;IACvD,CAAC;IACD,oBAAoB;IAEpB,2CAA2C;IAC3C,IAAI,gBAAgB,GAAsB;QACxC;YACE,IAAI,EAAE,QAAQ;YACd,IAAI;YACJ,YAAY;YACZ,KAAK,EAAE,CAAC;YACR,WAAW,EAAE,kBAAkB;YAC/B,qBAAqB;YACrB,aAAa,EAAE;gBACb,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS;gBAC3B,eAAe,EAAE,GAAG,EAAE,GAAE,CAAC;aAC1B;YACD,oBAAoB;SACrB;KACF,CAAA;IAED,OAAO,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,aAAa,GAAsB,EAAE,CAAA;QAE3C,qDAAqD;QACrD,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,GAAG,CACpC,gBAAgB,CAAC,GAAG,CAClB,KAAK,EAAE,EACL,IAAI,EACJ,IAAI,EAAE,QAAQ,EACd,YAAY,EAAE,gBAAgB,EAC9B,WAAW,EACX,KAAK,GACW,EAAE,EAAE;YACpB,8DAA8D;YAC9D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAEjB,+CAA+C;YAC/C,MAAM,cAAc,GAAG,MAAM,qBAAqB,CAChD,WAAW,EACX,KAAK,EACL,IAAI;YACJ,4DAA4D;YAC5D,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAC7C,EACD,MAAM,EACN,WAAW,EACX,gBAAgB,EAChB,KAAK,CACN,CAAA;YAED,yDAAyD;YACzD,OAAO,MAAM,qBAAqB,CAChC,KAAK,EACL,OAAO,EACP,cAAc,EACd,GAAG,EACH,SAAS,EACT,MAAM,EACN,WAAW,EACX,eAAe,EACf,MAAM,EACN,aAAa,EACb,OAAO,EACP,YAAY,EACZ,eAAe,CAChB,CAAA;QACH,CAAC,CACF,CACF,CAAA;QAED,oEAAoE;QACpE,sEAAsE;QACtE,sEAAsE;QACtE,+BAA+B;QAC/B,sBAAsB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;QAE3C,oDAAoD;QACpD,KAAK,MAAM,kBAAkB,IAAI,YAAY,EAAE,CAAC;YAC9C,KAAK,MAAM,QAAQ,IAAI,kBAAkB,EAAE,CAAC;gBAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAChC,oBAAoB;oBACpB,MAAM,YAAY,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;oBACpD,aAAa,CAAC,IAAI,CAAC;wBACjB,GAAG,QAAQ;wBACX,KAAK,EAAE,YAAY,GAAG,CAAC;qBACxB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,gBAAgB,GAAG,aAAa,CAAA;IAClC,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { joinDepIDTuple, joinExtra } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport { longDependencyTypes, normalizeManifest } from '@vltpkg/types'\nimport type {\n  DependencyTypeLong,\n  DependencySaveType,\n  Manifest,\n} from '@vltpkg/types'\nimport type { PathScurry } from 'path-scurry'\nimport { fixupAddedNames } from '../fixup-added-names.ts'\nimport { shorten } from '../dependencies.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\nimport { removeOptionalSubgraph } from '../remove-optional-subgraph.ts'\nimport type {\n  GraphModifier,\n  ModifierActiveEntry,\n} from '../modifiers.ts'\nimport type { ExtractResult } from '../reify/extract-node.ts'\nimport { extractNode } from '../reify/extract-node.ts'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport {\n  endPeerPlacement,\n  postPlacementPeerCheck,\n  startPeerPlacement,\n} from './peers.ts'\nimport type {\n  PeerContext,\n  AppendNodeEntry,\n  ProcessPlacementResult,\n  TransientAddMap,\n  TransientRemoveMap,\n} from './types.ts'\n\ntype FileTypeInfo = {\n  id: DepID\n  path: string\n  isDirectory: boolean\n}\n\n/**\n * Only install devDeps for git dependencies and importers\n * Everything else always gets installed\n */\nconst shouldInstallDepType = (\n  node: Node,\n  depType: DependencyTypeLong,\n) =>\n  depType !== 'devDependencies' ||\n  node.importer ||\n  node.id.startsWith('git')\n\n/**\n * Retrieve the {@link DepID} and location for a `file:` type {@link Node}.\n */\nconst getFileTypeInfo = (\n  spec: Spec,\n  fromNode: Node,\n  scurry: PathScurry,\n): FileTypeInfo | undefined => {\n  const f = spec.final\n  if (f.type !== 'file') return\n\n  /* c8 ignore start - should be impossible */\n  if (!f.file) {\n    throw error('no path on file specifier', { spec })\n  }\n  /* c8 ignore stop */\n\n  // Given that both linked folders and local tarballs (both defined with\n  // usage of the `file:` spec prefix) location needs to be relative to their\n  // parents, build the expected path and use it for both location and id\n  const target = scurry.cwd.resolve(fromNode.location).resolve(f.file)\n  const path = target.relativePosix()\n  const id = joinDepIDTuple(['file', path])\n\n  return {\n    path,\n    id,\n    isDirectory: !!target.lstatSync()?.isDirectory(),\n  }\n}\n\nconst isStringArray = (a: unknown): a is string[] =>\n  Array.isArray(a) && !a.some(b => typeof b !== 'string')\n\n/**\n * Represents a manifest fetch operation with all the context needed.\n */\ntype ManifestFetchTask = {\n  spec: Spec\n  type: DependencySaveType\n  fromNode: Node\n  fileTypeInfo?: FileTypeInfo\n  activeModifier?: ModifierActiveEntry\n  queryModifier?: string\n  edgeOptional: boolean\n  manifestPromise: Promise<Manifest | undefined>\n  depth: number\n  peerContext: PeerContext\n}\n\n/**\n * Represents a node placement operation that depends on a resolved manifest.\n */\ntype NodePlacementTask = {\n  fetchTask: ManifestFetchTask\n  manifest: Manifest | undefined\n  node?: Node\n  childDeps?: Dependency[]\n  childModifierRefs?: Map<string, ModifierActiveEntry>\n  childPeerContext?: PeerContext\n}\n\n/**\n * Fetch manifests for dependencies and create placement tasks.\n */\nconst fetchManifestsForDeps = async (\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  peerContext: PeerContext,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n  depth = 0,\n): Promise<NodePlacementTask[]> => {\n  // Create fetch tasks for all dependencies at this level\n  const fetchTasks: ManifestFetchTask[] = []\n  const placementTasks: NodePlacementTask[] = []\n\n  for (const { spec: originalSpec, type } of deps) {\n    let spec = originalSpec\n    const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry)\n    const activeModifier = modifierRefs?.get(spec.name)\n\n    // here is the place we swap specs if a edge modifier was defined\n    const queryModifier = activeModifier?.modifier.query\n    const completeModifier =\n      activeModifier &&\n      activeModifier.interactiveBreadcrumb.current ===\n        activeModifier.modifier.breadcrumb.last\n    if (\n      queryModifier &&\n      completeModifier &&\n      'spec' in activeModifier.modifier\n    ) {\n      spec = activeModifier.modifier.spec\n      if (spec.bareSpec === '-') {\n        continue\n      }\n    }\n\n    const peer = type === 'peer' || type === 'peerOptional'\n\n    // skip reusing nodes for peer deps since their reusability\n    // is handled ahead-of-time during its parent's placement\n    const existingNode = graph.findResolution(\n      spec,\n      fromNode,\n      queryModifier,\n    )\n    // defines what nodes are eligible to be reused\n    const validExistingNode =\n      existingNode &&\n      !existingNode.detached &&\n      // Regular deps can always reuse\n      /* c8 ignore start */\n      (!peer ||\n        // otherwise reusing peer deps only in case of a peerSetHash matche\n        existingNode.peerSetHash === fromNode.peerSetHash)\n    /* c8 ignore stop */\n\n    if (\n      validExistingNode ||\n      // importers are handled at the ./add-nodes.ts top-level\n      // so we should just skip whenever we find one\n      existingNode?.importer\n    ) {\n      graph.addEdge(type, spec, fromNode, existingNode)\n      continue\n    }\n\n    // is the current edge pointint go an optional dependency?\n    const edgeOptional =\n      type === 'optional' || type === 'peerOptional'\n\n    // Start manifest fetch immediately for parallel processing\n    const manifestPromise =\n      // the \"detached\" node state means that it has already been load as\n      // part of a graph (either lockfile or actual) and it has valid manifest\n      // data so we shortcut the package info manifest fetch here\n      existingNode?.detached ?\n        Promise.resolve(existingNode.manifest as Manifest | undefined)\n        // this is the entry point to fetch calls to retrieve manifests\n        // from the build ideal graph point of view\n      : packageInfo\n          .manifest(spec, { from: scurry.resolve(fromNode.location) })\n          .then(manifest => manifest as Manifest | undefined)\n          .catch((er: unknown) => {\n            // optional deps ignored if inaccessible\n            if (edgeOptional || fromNode.optional) {\n              return undefined\n            }\n            throw er\n          })\n\n    const fetchTask: ManifestFetchTask = {\n      spec,\n      type,\n      fromNode,\n      fileTypeInfo,\n      activeModifier,\n      queryModifier,\n      edgeOptional,\n      manifestPromise,\n      depth,\n      peerContext,\n    }\n\n    fetchTasks.push(fetchTask)\n  }\n\n  // Create placement tasks from fetch tasks\n  for (const fetchTask of fetchTasks) {\n    const manifest = await fetchTask.manifestPromise\n\n    placementTasks.push({\n      fetchTask,\n      manifest,\n    })\n  }\n\n  // sort placement tasks: non-peer dependencies first, then peer dependencies\n  // so that peer dependencies can easily reuse already placed regular\n  // dependencies as part of peer context set resolution also makes sure to\n  // sort by the manifest name for deterministic order.\n  placementTasks.sort((a, b) => {\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    // regular dependencies first, peer dependencies last\n    if (aIsPeer !== bIsPeer) {\n      return aIsPeer - bIsPeer\n    }\n\n    // if both are in the same group,\n    // sort alphabetically by manifest name (fallback to spec.name)\n    const aName =\n      a.manifest?.name /* c8 ignore next */ || a.fetchTask.spec.name\n    const bName = b.manifest?.name || b.fetchTask.spec.name\n    return aName.localeCompare(bName, 'en')\n  })\n\n  return placementTasks\n}\n\n/**\n * Process placement tasks and collect child dependencies, this is the\n * second step of the appendNodes operation after manifest fetching in\n * which the final graph data structure is actually built.\n */\nconst processPlacementTasks = async (\n  graph: Graph,\n  options: SpecOptions,\n  placementTasks: NodePlacementTask[],\n  add?: Map<string, Dependency>,\n  modifiers?: GraphModifier,\n  scurry?: PathScurry,\n  packageInfo?: PackageInfoClient,\n  extractPromises?: Promise<ExtractResult>[],\n  actual?: Graph,\n  seenExtracted?: Set<DepID>,\n  remover?: RollbackRemove,\n  transientAdd?: TransientAddMap,\n  transientRemove?: TransientRemoveMap,\n): Promise<ProcessPlacementResult> => {\n  const childDepsToProcess: ProcessPlacementResult = []\n\n  for (const placementTask of placementTasks) {\n    const { fetchTask, manifest } = placementTask\n    let {\n      activeModifier,\n      edgeOptional,\n      fileTypeInfo,\n      fromNode,\n      peerContext,\n      queryModifier,\n      spec,\n      type,\n    } = fetchTask\n\n    // fix the name in the `add` map when needed. This allows the upcoming\n    // reify step to properly update the package.json file dependencies\n    // using the correct names retrieved from the manifest data\n    const additiveMap =\n      fromNode.importer ? add : transientAdd?.get(fromNode.id)\n    spec = fixupAddedNames(additiveMap, manifest, options, spec)\n\n    // handles missing manifest resolution\n    if (!manifest) {\n      if (!edgeOptional && fromNode.isOptional()) {\n        // failed resolution of a non-optional dep of an optional node\n        // have to clean up the dependents\n        removeOptionalSubgraph(graph, fromNode)\n        continue\n      } else if (edgeOptional) {\n        // failed resolution of an optional dep, just ignore it,\n        // nothing to prune because we never added it in the first place.\n        continue\n      } else {\n        throw error('failed to resolve dependency', {\n          spec,\n          from: fromNode.location,\n        })\n      }\n    }\n\n    // start peer deps placement process, populating the peer context with\n    // dependency data; adding the parent node deps and this manifest's\n    // peer deps references to the current peer context set\n    const peerPlacement = startPeerPlacement(\n      peerContext,\n      manifest,\n      fromNode,\n      options,\n    )\n    const peerSetHash = peerPlacement.peerSetHash\n    const queuedEntries = peerPlacement.queuedEntries\n\n    // places a new node in the graph representing a newly seen dependency\n    const node = graph.placePackage(\n      fromNode,\n      type,\n      spec,\n      normalizeManifest(manifest),\n      fileTypeInfo?.id,\n      joinExtra({ peerSetHash, modifier: queryModifier }),\n    )\n\n    /* c8 ignore start - not possible, already ensured manifest */\n    if (!node) {\n      throw error('failed to place package', {\n        from: fromNode.location,\n        spec,\n      })\n    }\n    /* c8 ignore stop */\n\n    // update the node modifier tracker\n    if (activeModifier) {\n      modifiers?.updateActiveEntry(node, activeModifier)\n    }\n\n    const eligibleForExtraction =\n      type !== 'peer' &&\n      type !== 'peerOptional' &&\n      remover &&\n      extractPromises &&\n      actual &&\n      scurry &&\n      packageInfo &&\n      node.inVltStore() &&\n      !node.isOptional() &&\n      // this fixes an issue with installing `file:pathname` specs\n      /* c8 ignore next */ !fileTypeInfo?.isDirectory &&\n      !node.importer\n\n    // extract the node if it meets the criteria for early extraction\n    if (eligibleForExtraction) {\n      /* c8 ignore start */\n      if (seenExtracted?.has(node.id)) {\n        continue\n      }\n      /* c8 ignore stop */\n      seenExtracted?.add(node.id)\n      const actualNode = actual.nodes.get(node.id)\n      if (!actualNode?.equals(node)) {\n        // extract the node without awaiting - push the promise to the array\n        const extractPromise = extractNode(\n          node,\n          scurry,\n          remover,\n          options,\n          packageInfo,\n        )\n        extractPromises.push(extractPromise)\n      }\n    }\n\n    // updates graph node information\n    if (fileTypeInfo?.path && fileTypeInfo.isDirectory) {\n      node.location = fileTypeInfo.path\n    }\n    node.setResolved()\n\n    // collect child dependencies for processing in the next level\n    const nextPeerDeps = new Map<string, Dependency>()\n\n    // compute deps normally\n    const bundleDeps = manifest.bundleDependencies\n    const bundled = new Set<string>(\n      (\n        node.id.startsWith('git') ||\n          node.importer ||\n          !isStringArray(bundleDeps)\n      ) ?\n        []\n      : bundleDeps,\n    )\n\n    // setup next level to process all child dependencies in the manifest\n    const nextDeps: Dependency[] = []\n\n    // traverse actual dependency declarations in the manifest\n    // creating dependency entries for them\n    for (const depTypeName of longDependencyTypes) {\n      const depRecord: Record<string, string> | undefined =\n        manifest[depTypeName]\n\n      if (depRecord && shouldInstallDepType(node, depTypeName)) {\n        // Sort Object.entries for deterministic iteration\n        const sortedEntries = Object.entries(depRecord).sort(\n          ([a], [b]) => a.localeCompare(b, 'en'),\n        )\n        for (const [name, bareSpec] of sortedEntries) {\n          // might need to skip already placed peer deps here\n          if (bundled.has(name)) continue\n          const dep = {\n            type: shorten(depTypeName, name, manifest),\n            spec: Spec.parse(name, bareSpec, {\n              ...options,\n              registry: spec.registry,\n            }),\n          }\n          if (depTypeName === 'peerDependencies') {\n            nextPeerDeps.set(name, dep)\n          } else {\n            nextDeps.push(dep)\n          }\n        }\n      }\n    }\n\n    // Inject transient dependencies for non-importer nodes (nested folders)\n    // These are deps that were added from a nested folder context using\n    // relative file: specs that should resolve relative to that folder\n    const transientDeps = transientAdd?.get(node.id)\n    if (transientDeps) {\n      for (const [, dep] of transientDeps) {\n        if (dep.type === 'peer' || dep.type === 'peerOptional') {\n          nextPeerDeps.set(dep.spec.name, dep)\n          continue\n        }\n\n        // remove the dependency from nextDeps if it already exists\n        const index = nextDeps.findIndex(\n          d => d.spec.name === dep.spec.name,\n        )\n        if (index !== -1) {\n          nextDeps.splice(index, 1)\n        }\n\n        nextDeps.push(dep)\n      }\n    }\n\n    // Remove transient removals when needed\n    const transientRemovals = transientRemove?.get(node.id)\n    if (transientRemovals) {\n      for (const depName of transientRemovals) {\n        const index = nextDeps.findIndex(\n          dep => dep.spec.name === depName,\n        )\n        if (index !== -1) {\n          nextDeps.splice(index, 1)\n          continue\n        }\n\n        if (nextPeerDeps.has(depName)) {\n          nextPeerDeps.delete(depName)\n        }\n      }\n    }\n\n    // finish peer placement for this node, resolving satisfied peers\n    // to seen nodes from the peer context and adding unsatisfied peers\n    // to `nextDeps` so they get processed along regular dependencies\n    const updateContext = endPeerPlacement(\n      peerContext,\n      nextDeps,\n      nextPeerDeps,\n      graph,\n      spec,\n      fromNode,\n      node,\n      type,\n      queuedEntries,\n    )\n\n    childDepsToProcess.push({\n      node,\n      deps: nextDeps,\n      modifierRefs: modifiers?.tryDependencies(node, nextDeps),\n      peerContext,\n      updateContext,\n    })\n  }\n\n  return childDepsToProcess\n}\n\n/**\n * Append new nodes in the given `graph` for dependencies specified at `add`\n * and missing dependencies from the `deps` parameter.\n *\n * It also applies any modifiers that applies to a given node as it processes\n * and builds the graph.\n */\nexport const appendNodes = async (\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  options: SpecOptions,\n  seen: Set<DepID>,\n  add?: Map<string, Dependency>,\n  modifiers?: GraphModifier,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n  extractPromises?: Promise<ExtractResult>[],\n  actual?: Graph,\n  seenExtracted?: Set<DepID>,\n  remover?: RollbackRemove,\n  transientAdd?: TransientAddMap,\n  transientRemove?: TransientRemoveMap,\n) => {\n  /* c8 ignore next */\n  if (seen.has(fromNode.id)) return\n  seen.add(fromNode.id)\n\n  // Get the initial peer context from the graph\n  const [initialPeerContext] = graph.peerContexts\n  /* c8 ignore start - impossible */\n  if (!initialPeerContext) {\n    throw error('no initial peer context found in graph')\n  }\n  /* c8 ignore stop */\n\n  // Use a queue for breadth-first processing\n  let currentLevelDeps: AppendNodeEntry[] = [\n    {\n      node: fromNode,\n      deps,\n      modifierRefs,\n      depth: 0,\n      peerContext: initialPeerContext,\n      /* c8 ignore start */\n      updateContext: {\n        putEntries: () => undefined,\n        resolvePeerDeps: () => {},\n      },\n      /* c8 ignore stop */\n    },\n  ]\n\n  while (currentLevelDeps.length > 0) {\n    const nextLevelDeps: AppendNodeEntry[] = []\n\n    // Process all nodes at the current level in parallel\n    const levelResults = await Promise.all(\n      currentLevelDeps.map(\n        async ({\n          node,\n          deps: nodeDeps,\n          modifierRefs: nodeModifierRefs,\n          peerContext,\n          depth,\n        }: AppendNodeEntry) => {\n          // Mark node as seen when we start processing its dependencies\n          seen.add(node.id)\n\n          // Fetch manifests for this node's dependencies\n          const placementTasks = await fetchManifestsForDeps(\n            packageInfo,\n            graph,\n            node,\n            // Sort dependencies by spec.name for deterministic ordering\n            nodeDeps.sort((a, b) =>\n              a.spec.name.localeCompare(b.spec.name, 'en'),\n            ),\n            scurry,\n            peerContext,\n            nodeModifierRefs,\n            depth,\n          )\n\n          // Process the placement tasks and get child dependencies\n          return await processPlacementTasks(\n            graph,\n            options,\n            placementTasks,\n            add,\n            modifiers,\n            scurry,\n            packageInfo,\n            extractPromises,\n            actual,\n            seenExtracted,\n            remover,\n            transientAdd,\n            transientRemove,\n          )\n        },\n      ),\n    )\n\n    // Traverse the queued up children dependencies, adding and tracking\n    // dependencies on the peer context set, forking the context as needed\n    // and resolving any peer dependency that is able to be resolved using\n    // the current peer context set\n    postPlacementPeerCheck(graph, levelResults)\n\n    // Collect all child dependencies for the next level\n    for (const childDepsToProcess of levelResults) {\n      for (const childDep of childDepsToProcess) {\n        if (!seen.has(childDep.node.id)) {\n          /* c8 ignore next */\n          const currentDepth = currentLevelDeps[0]?.depth ?? 0\n          nextLevelDeps.push({\n            ...childDep,\n            depth: currentDepth + 1,\n          })\n        }\n      }\n    }\n\n    // Move to the next level\n    currentLevelDeps = nextLevelDeps\n  }\n}\n"]}
+{"version":3,"file":"append-nodes.js","sourceRoot":"","sources":["../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAE1D,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAE3C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAEnC,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAA;AAOtE,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAA;AACzD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAI5C,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAA;AAMvE,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AAEtD,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,eAAe,EACf,sBAAsB,EACtB,kBAAkB,GACnB,MAAM,YAAY,CAAA;AAenB;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAC3B,IAAU,EACV,OAA2B,EAC3B,EAAE,CACF,OAAO,KAAK,iBAAiB;IAC7B,IAAI,CAAC,QAAQ;IACb,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAE3B;;GAEG;AACH,MAAM,eAAe,GAAG,CACtB,IAAU,EACV,QAAc,EACd,MAAkB,EACQ,EAAE;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAM;IAE7B,4CAA4C;IAC5C,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,CAAC,2BAA2B,EAAE,EAAE,IAAI,EAAE,CAAC,CAAA;IACpD,CAAC;IACD,oBAAoB;IAEpB,uEAAuE;IACvE,2EAA2E;IAC3E,uEAAuE;IACvE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACpE,MAAM,IAAI,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;IACnC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;IAEzC,OAAO;QACL,IAAI;QACJ,EAAE;QACF,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE;KACjD,CAAA;AACH,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,CAAC,CAAU,EAAiB,EAAE,CAClD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAA;AA8BzD;;GAEG;AACH,MAAM,qBAAqB,GAAG,KAAK,EACjC,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,WAAwB,EACxB,YAA+C,EAC/C,KAAK,GAAG,CAAC,EACqB,EAAE;IAChC,wDAAwD;IACxD,MAAM,UAAU,GAAwB,EAAE,CAAA;IAC1C,MAAM,cAAc,GAAwB,EAAE,CAAA;IAE9C,KAAK,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAChD,IAAI,IAAI,GAAG,YAAY,CAAA;QACvB,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC5D,MAAM,cAAc,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnD,iEAAiE;QACjE,MAAM,aAAa,GAAG,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAA;QACpD,MAAM,gBAAgB,GACpB,cAAc;YACd,cAAc,CAAC,qBAAqB,CAAC,OAAO;gBAC1C,cAAc,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAA;QAC3C,IACE,aAAa;YACb,gBAAgB;YAChB,MAAM,IAAI,cAAc,CAAC,QAAQ,EACjC,CAAC;YACD,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAA;YACnC,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE,CAAC;gBAC1B,SAAQ;YACV,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,cAAc,CAAA;QAEvD,2DAA2D;QAC3D,yDAAyD;QACzD,MAAM,YAAY,GAAG,KAAK,CAAC,cAAc,CACvC,IAAI,EACJ,QAAQ,EACR,aAAa,CACd,CAAA;QAED,qEAAqE;QACrE,MAAM,gBAAgB,GACpB,YAAY,CAAC,CAAC;YACZ,wBAAwB,CACtB,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,KAAK,CACN;YACH,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAA;QAExB,wDAAwD;QACxD,IAAI,oBAAoB,GAAG,WAAW,CAAA;QACtC,qBAAqB;QACrB,IAAI,CAAC,gBAAgB,CAAC,UAAU,IAAI,gBAAgB,CAAC,SAAS,EAAE,CAAC;YAC/D,oBAAoB,GAAG,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE;gBACzD,gBAAgB,CAAC,SAAS;aAC3B,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,+CAA+C;QAC/C,MAAM,iBAAiB,GACrB,YAAY;YACZ,CAAC,YAAY,CAAC,QAAQ;YACtB,gCAAgC;YAChC,qBAAqB;YACrB,CAAC,CAAC,IAAI;gBACJ,kEAAkE;gBAClE,YAAY,CAAC,WAAW,KAAK,QAAQ,CAAC,WAAW,CAAC;YACpD,qEAAqE;YACrE,gBAAgB,CAAC,UAAU,CAAA;QAC7B,oBAAoB;QAEpB,IACE,iBAAiB;YACjB,kEAAkE;YAClE,8CAA8C;YAC9C,YAAY,EAAE,QAAQ,EACtB,CAAC;YACD,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAA;YACjD,SAAQ;QACV,CAAC;QAED,0DAA0D;QAC1D,MAAM,YAAY,GAChB,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,cAAc,CAAA;QAEhD,2DAA2D;QAC3D,MAAM,eAAe;QACnB,mEAAmE;QACnE,wEAAwE;QACxE,2DAA2D;QAC3D,YAAY,EAAE,QAAQ,CAAC,CAAC;YACtB,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,QAAgC,CAAC;YAC9D,+DAA+D;YAC/D,2CAA2C;YAC7C,CAAC,CAAC,WAAW;iBACR,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;iBAC3D,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAgC,CAAC;iBAClD,KAAK,CAAC,CAAC,EAAW,EAAE,EAAE;gBACrB,wCAAwC;gBACxC,IAAI,YAAY,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;oBACtC,OAAO,SAAS,CAAA;gBAClB,CAAC;gBACD,MAAM,EAAE,CAAA;YACV,CAAC,CAAC,CAAA;QAER,MAAM,SAAS,GAAsB;YACnC,IAAI;YACJ,IAAI;YACJ,QAAQ;YACR,YAAY;YACZ,cAAc;YACd,aAAa;YACb,YAAY;YACZ,eAAe;YACf,KAAK;YACL,WAAW,EAAE,oBAAoB;SAClC,CAAA;QAED,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC5B,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,eAAe,CAAA;QAEhD,cAAc,CAAC,IAAI,CAAC;YAClB,SAAS;YACT,QAAQ;SACT,CAAC,CAAA;IACJ,CAAC;IAED,4EAA4E;IAC5E,oEAAoE;IACpE,yEAAyE;IACzE,qDAAqD;IACrD,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,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,qDAAqD;QACrD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,OAAO,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED,iCAAiC;QACjC,+DAA+D;QAC/D,MAAM,KAAK,GACT,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAA;QAChE,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAA;QACvD,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,OAAO,cAAc,CAAA;AACvB,CAAC,CAAA;AAED;;;;GAIG;AACH,MAAM,qBAAqB,GAAG,KAAK,EACjC,KAAY,EACZ,OAAoB,EACpB,cAAmC,EACnC,GAA6B,EAC7B,SAAyB,EACzB,MAAmB,EACnB,WAA+B,EAC/B,eAA0C,EAC1C,MAAc,EACd,aAA0B,EAC1B,OAAwB,EACxB,YAA8B,EAC9B,eAAoC,EACH,EAAE;IACnC,MAAM,kBAAkB,GAA2B,EAAE,CAAA;IAErD,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;QAC3C,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,aAAa,CAAA;QAC7C,IAAI,EACF,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,aAAa,EACb,IAAI,EACJ,IAAI,GACL,GAAG,SAAS,CAAA;QAEb,sEAAsE;QACtE,mEAAmE;QACnE,2DAA2D;QAC3D,MAAM,WAAW,GACf,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAC1D,IAAI,GAAG,eAAe,CAAC,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QAE5D,sCAAsC;QACtC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC,YAAY,IAAI,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC;gBAC3C,8DAA8D;gBAC9D,kCAAkC;gBAClC,sBAAsB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;gBACvC,SAAQ;YACV,CAAC;iBAAM,IAAI,YAAY,EAAE,CAAC;gBACxB,wDAAwD;gBACxD,iEAAiE;gBACjE,SAAQ;YACV,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAC,8BAA8B,EAAE;oBAC1C,IAAI;oBACJ,IAAI,EAAE,QAAQ,CAAC,QAAQ;iBACxB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,mEAAmE;QACnE,uDAAuD;QACvD,MAAM,aAAa,GAAG,kBAAkB,CACtC,WAAW,EACX,QAAQ,EACR,QAAQ,EACR,OAAO,CACR,CAAA;QACD,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,CAAA;QAC7C,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,CAAA;QAEjD,sEAAsE;QACtE,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAC7B,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,iBAAiB,CAAC,QAAQ,CAAC,EAC3B,YAAY,EAAE,EAAE,EAChB,SAAS,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,CACpD,CAAA;QAED,8DAA8D;QAC9D,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,KAAK,CAAC,yBAAyB,EAAE;gBACrC,IAAI,EAAE,QAAQ,CAAC,QAAQ;gBACvB,IAAI;aACL,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,mCAAmC;QACnC,IAAI,cAAc,EAAE,CAAC;YACnB,SAAS,EAAE,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;QACpD,CAAC;QAED,MAAM,qBAAqB,GACzB,IAAI,KAAK,MAAM;YACf,IAAI,KAAK,cAAc;YACvB,OAAO;YACP,eAAe;YACf,MAAM;YACN,MAAM;YACN,WAAW;YACX,IAAI,CAAC,UAAU,EAAE;YACjB,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,4DAA4D;YAC5D,oBAAoB,CAAC,CAAC,YAAY,EAAE,WAAW;YAC/C,CAAC,IAAI,CAAC,QAAQ,CAAA;QAEhB,iEAAiE;QACjE,IAAI,qBAAqB,EAAE,CAAC;YAC1B,qBAAqB;YACrB,IAAI,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,SAAQ;YACV,CAAC;YACD,oBAAoB;YACpB,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC3B,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5C,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,oEAAoE;gBACpE,MAAM,cAAc,GAAG,WAAW,CAChC,IAAI,EACJ,MAAM,EACN,OAAO,EACP,OAAO,EACP,WAAW,CACZ,CAAA;gBACD,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,IAAI,YAAY,EAAE,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;YACnD,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAA;QACnC,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAA;QAElB,8DAA8D;QAC9D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsB,CAAA;QAElD,wBAAwB;QACxB,MAAM,UAAU,GAAG,QAAQ,CAAC,kBAAkB,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CACE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,QAAQ;YACb,CAAC,aAAa,CAAC,UAAU,CAAC,CAC7B,CAAC,CAAC;YACD,EAAE;YACJ,CAAC,CAAC,UAAU,CACb,CAAA;QAED,qEAAqE;QACrE,MAAM,QAAQ,GAAiB,EAAE,CAAA;QAEjC,0DAA0D;QAC1D,uCAAuC;QACvC,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAAE,CAAC;YAC9C,MAAM,SAAS,GACb,QAAQ,CAAC,WAAW,CAAC,CAAA;YAEvB,IAAI,SAAS,IAAI,oBAAoB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;gBACzD,kDAAkD;gBAClD,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,IAAI,CAClD,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CACvC,CAAA;gBACD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;oBAC7C,mDAAmD;oBACnD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,SAAQ;oBAC/B,MAAM,GAAG,GAAG;wBACV,IAAI,EAAE,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,QAAQ,CAAC;wBAC1C,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE;4BAC/B,GAAG,OAAO;4BACV,QAAQ,EAAE,IAAI,CAAC,QAAQ;yBACxB,CAAC;qBACH,CAAA;oBACD,IAAI,WAAW,KAAK,kBAAkB,EAAE,CAAC;wBACvC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;oBAC7B,CAAC;yBAAM,CAAC;wBACN,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,oEAAoE;QACpE,mEAAmE;QACnE,MAAM,aAAa,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChD,IAAI,aAAa,EAAE,CAAC;YAClB,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,aAAa,EAAE,CAAC;gBACpC,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;oBACvD,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;oBACpC,SAAQ;gBACV,CAAC;gBAED,2DAA2D;gBAC3D,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAC9B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CACnC,CAAA;gBACD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjB,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;gBAC3B,CAAC;gBAED,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACpB,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,MAAM,iBAAiB,GAAG,eAAe,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACvD,IAAI,iBAAiB,EAAE,CAAC;YACtB,KAAK,MAAM,OAAO,IAAI,iBAAiB,EAAE,CAAC;gBACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAC9B,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CACjC,CAAA;gBACD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjB,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;oBACzB,SAAQ;gBACV,CAAC;gBAED,IAAI,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC9B,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,mEAAmE;QACnE,iEAAiE;QACjE,MAAM,aAAa,GAAG,gBAAgB,CACpC,WAAW,EACX,QAAQ,EACR,YAAY,EACZ,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,aAAa,CACd,CAAA;QAED,kBAAkB,CAAC,IAAI,CAAC;YACtB,IAAI;YACJ,IAAI,EAAE,QAAQ;YACd,YAAY,EAAE,SAAS,EAAE,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;YACxD,WAAW;YACX,aAAa;SACd,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,kBAAkB,CAAA;AAC3B,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,OAAoB,EACpB,IAAgB,EAChB,GAA6B,EAC7B,SAAyB,EACzB,YAA+C,EAC/C,eAA0C,EAC1C,MAAc,EACd,aAA0B,EAC1B,OAAwB,EACxB,YAA8B,EAC9B,eAAoC,EACpC,EAAE;IACF,oBAAoB;IACpB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAM;IACjC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAErB,8CAA8C;IAC9C,MAAM,CAAC,kBAAkB,CAAC,GAAG,KAAK,CAAC,YAAY,CAAA;IAC/C,kCAAkC;IAClC,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACxB,MAAM,KAAK,CAAC,wCAAwC,CAAC,CAAA;IACvD,CAAC;IACD,oBAAoB;IAEpB,2CAA2C;IAC3C,IAAI,gBAAgB,GAAsB;QACxC;YACE,IAAI,EAAE,QAAQ;YACd,IAAI;YACJ,YAAY;YACZ,KAAK,EAAE,CAAC;YACR,WAAW,EAAE,kBAAkB;YAC/B,qBAAqB;YACrB,aAAa,EAAE;gBACb,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS;gBAC3B,eAAe,EAAE,GAAG,EAAE,GAAE,CAAC;aAC1B;YACD,oBAAoB;SACrB;KACF,CAAA;IAED,OAAO,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,aAAa,GAAsB,EAAE,CAAA;QAE3C,qDAAqD;QACrD,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,GAAG,CACpC,gBAAgB,CAAC,GAAG,CAClB,KAAK,EAAE,EACL,IAAI,EACJ,IAAI,EAAE,QAAQ,EACd,YAAY,EAAE,gBAAgB,EAC9B,WAAW,EACX,KAAK,GACW,EAAE,EAAE;YACpB,8DAA8D;YAC9D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAEjB,+CAA+C;YAC/C,MAAM,cAAc,GAAG,MAAM,qBAAqB,CAChD,WAAW,EACX,KAAK,EACL,IAAI;YACJ,4DAA4D;YAC5D,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAC7C,EACD,MAAM,EACN,WAAW,EACX,gBAAgB,EAChB,KAAK,CACN,CAAA;YAED,yDAAyD;YACzD,OAAO,MAAM,qBAAqB,CAChC,KAAK,EACL,OAAO,EACP,cAAc,EACd,GAAG,EACH,SAAS,EACT,MAAM,EACN,WAAW,EACX,eAAe,EACf,MAAM,EACN,aAAa,EACb,OAAO,EACP,YAAY,EACZ,eAAe,CAChB,CAAA;QACH,CAAC,CACF,CACF,CAAA;QAED,oEAAoE;QACpE,sEAAsE;QACtE,sEAAsE;QACtE,+BAA+B;QAC/B,sBAAsB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;QAE3C,oDAAoD;QACpD,KAAK,MAAM,kBAAkB,IAAI,YAAY,EAAE,CAAC;YAC9C,KAAK,MAAM,QAAQ,IAAI,kBAAkB,EAAE,CAAC;gBAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAChC,oBAAoB;oBACpB,MAAM,YAAY,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;oBACpD,aAAa,CAAC,IAAI,CAAC;wBACjB,GAAG,QAAQ;wBACX,KAAK,EAAE,YAAY,GAAG,CAAC;qBACxB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,gBAAgB,GAAG,aAAa,CAAA;IAClC,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { joinDepIDTuple, joinExtra } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport { longDependencyTypes, normalizeManifest } from '@vltpkg/types'\nimport type {\n  DependencyTypeLong,\n  DependencySaveType,\n  Manifest,\n} from '@vltpkg/types'\nimport type { PathScurry } from 'path-scurry'\nimport { fixupAddedNames } from '../fixup-added-names.ts'\nimport { shorten } from '../dependencies.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\nimport { removeOptionalSubgraph } from '../remove-optional-subgraph.ts'\nimport type {\n  GraphModifier,\n  ModifierActiveEntry,\n} from '../modifiers.ts'\nimport type { ExtractResult } from '../reify/extract-node.ts'\nimport { extractNode } from '../reify/extract-node.ts'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport {\n  checkPeerEdgesCompatible,\n  endPeerPlacement,\n  forkPeerContext,\n  postPlacementPeerCheck,\n  startPeerPlacement,\n} from './peers.ts'\nimport type {\n  PeerContext,\n  AppendNodeEntry,\n  ProcessPlacementResult,\n  TransientAddMap,\n  TransientRemoveMap,\n} from './types.ts'\n\ntype FileTypeInfo = {\n  id: DepID\n  path: string\n  isDirectory: boolean\n}\n\n/**\n * Only install devDeps for git dependencies and importers\n * Everything else always gets installed\n */\nconst shouldInstallDepType = (\n  node: Node,\n  depType: DependencyTypeLong,\n) =>\n  depType !== 'devDependencies' ||\n  node.importer ||\n  node.id.startsWith('git')\n\n/**\n * Retrieve the {@link DepID} and location for a `file:` type {@link Node}.\n */\nconst getFileTypeInfo = (\n  spec: Spec,\n  fromNode: Node,\n  scurry: PathScurry,\n): FileTypeInfo | undefined => {\n  const f = spec.final\n  if (f.type !== 'file') return\n\n  /* c8 ignore start - should be impossible */\n  if (!f.file) {\n    throw error('no path on file specifier', { spec })\n  }\n  /* c8 ignore stop */\n\n  // Given that both linked folders and local tarballs (both defined with\n  // usage of the `file:` spec prefix) location needs to be relative to their\n  // parents, build the expected path and use it for both location and id\n  const target = scurry.cwd.resolve(fromNode.location).resolve(f.file)\n  const path = target.relativePosix()\n  const id = joinDepIDTuple(['file', path])\n\n  return {\n    path,\n    id,\n    isDirectory: !!target.lstatSync()?.isDirectory(),\n  }\n}\n\nconst isStringArray = (a: unknown): a is string[] =>\n  Array.isArray(a) && !a.some(b => typeof b !== 'string')\n\n/**\n * Represents a manifest fetch operation with all the context needed.\n */\ntype ManifestFetchTask = {\n  spec: Spec\n  type: DependencySaveType\n  fromNode: Node\n  fileTypeInfo?: FileTypeInfo\n  activeModifier?: ModifierActiveEntry\n  queryModifier?: string\n  edgeOptional: boolean\n  manifestPromise: Promise<Manifest | undefined>\n  depth: number\n  peerContext: PeerContext\n}\n\n/**\n * Represents a node placement operation that depends on a resolved manifest.\n */\ntype NodePlacementTask = {\n  fetchTask: ManifestFetchTask\n  manifest: Manifest | undefined\n  node?: Node\n  childDeps?: Dependency[]\n  childModifierRefs?: Map<string, ModifierActiveEntry>\n  childPeerContext?: PeerContext\n}\n\n/**\n * Fetch manifests for dependencies and create placement tasks.\n */\nconst fetchManifestsForDeps = async (\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  peerContext: PeerContext,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n  depth = 0,\n): Promise<NodePlacementTask[]> => {\n  // Create fetch tasks for all dependencies at this level\n  const fetchTasks: ManifestFetchTask[] = []\n  const placementTasks: NodePlacementTask[] = []\n\n  for (const { spec: originalSpec, type } of deps) {\n    let spec = originalSpec\n    const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry)\n    const activeModifier = modifierRefs?.get(spec.name)\n\n    // here is the place we swap specs if a edge modifier was defined\n    const queryModifier = activeModifier?.modifier.query\n    const completeModifier =\n      activeModifier &&\n      activeModifier.interactiveBreadcrumb.current ===\n        activeModifier.modifier.breadcrumb.last\n    if (\n      queryModifier &&\n      completeModifier &&\n      'spec' in activeModifier.modifier\n    ) {\n      spec = activeModifier.modifier.spec\n      if (spec.bareSpec === '-') {\n        continue\n      }\n    }\n\n    const peer = type === 'peer' || type === 'peerOptional'\n\n    // skip reusing nodes for peer deps since their reusability\n    // is handled ahead-of-time during its parent's placement\n    const existingNode = graph.findResolution(\n      spec,\n      fromNode,\n      queryModifier,\n    )\n\n    // Check if existing node's peer edges are compatible with new parent\n    const peerCompatResult =\n      existingNode ?\n        checkPeerEdgesCompatible(\n          existingNode,\n          fromNode,\n          peerContext,\n          graph,\n        )\n      : { compatible: true }\n\n    // Fork peer context if incompatible peer edges detected\n    let effectivePeerContext = peerContext\n    /* c8 ignore start */\n    if (!peerCompatResult.compatible && peerCompatResult.forkEntry) {\n      effectivePeerContext = forkPeerContext(graph, peerContext, [\n        peerCompatResult.forkEntry,\n      ])\n    }\n    /* c8 ignore stop */\n\n    // defines what nodes are eligible to be reused\n    const validExistingNode =\n      existingNode &&\n      !existingNode.detached &&\n      // Regular deps can always reuse\n      /* c8 ignore start */\n      (!peer ||\n        // otherwise reusing peer deps only in case of a peerSetHash match\n        existingNode.peerSetHash === fromNode.peerSetHash) &&\n      // Check if existing node's peer edges are compatible with new parent\n      peerCompatResult.compatible\n    /* c8 ignore stop */\n\n    if (\n      validExistingNode ||\n      // importers are handled at the ./refresh-ideal-graph.ts top-level\n      // so we should just skip whenever we find one\n      existingNode?.importer\n    ) {\n      graph.addEdge(type, spec, fromNode, existingNode)\n      continue\n    }\n\n    // is the current edge pointint go an optional dependency?\n    const edgeOptional =\n      type === 'optional' || type === 'peerOptional'\n\n    // Start manifest fetch immediately for parallel processing\n    const manifestPromise =\n      // the \"detached\" node state means that it has already been load as\n      // part of a graph (either lockfile or actual) and it has valid manifest\n      // data so we shortcut the package info manifest fetch here\n      existingNode?.detached ?\n        Promise.resolve(existingNode.manifest as Manifest | undefined)\n        // this is the entry point to fetch calls to retrieve manifests\n        // from the build ideal graph point of view\n      : packageInfo\n          .manifest(spec, { from: scurry.resolve(fromNode.location) })\n          .then(manifest => manifest as Manifest | undefined)\n          .catch((er: unknown) => {\n            // optional deps ignored if inaccessible\n            if (edgeOptional || fromNode.optional) {\n              return undefined\n            }\n            throw er\n          })\n\n    const fetchTask: ManifestFetchTask = {\n      spec,\n      type,\n      fromNode,\n      fileTypeInfo,\n      activeModifier,\n      queryModifier,\n      edgeOptional,\n      manifestPromise,\n      depth,\n      peerContext: effectivePeerContext,\n    }\n\n    fetchTasks.push(fetchTask)\n  }\n\n  // Create placement tasks from fetch tasks\n  for (const fetchTask of fetchTasks) {\n    const manifest = await fetchTask.manifestPromise\n\n    placementTasks.push({\n      fetchTask,\n      manifest,\n    })\n  }\n\n  // sort placement tasks: non-peer dependencies first, then peer dependencies\n  // so that peer dependencies can easily reuse already placed regular\n  // dependencies as part of peer context set resolution also makes sure to\n  // sort by the manifest name for deterministic order.\n  placementTasks.sort((a, b) => {\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    // regular dependencies first, peer dependencies last\n    if (aIsPeer !== bIsPeer) {\n      return aIsPeer - bIsPeer\n    }\n\n    // if both are in the same group,\n    // sort alphabetically by manifest name (fallback to spec.name)\n    const aName =\n      a.manifest?.name /* c8 ignore next */ || a.fetchTask.spec.name\n    const bName = b.manifest?.name || b.fetchTask.spec.name\n    return aName.localeCompare(bName, 'en')\n  })\n\n  return placementTasks\n}\n\n/**\n * Process placement tasks and collect child dependencies, this is the\n * second step of the appendNodes operation after manifest fetching in\n * which the final graph data structure is actually built.\n */\nconst processPlacementTasks = async (\n  graph: Graph,\n  options: SpecOptions,\n  placementTasks: NodePlacementTask[],\n  add?: Map<string, Dependency>,\n  modifiers?: GraphModifier,\n  scurry?: PathScurry,\n  packageInfo?: PackageInfoClient,\n  extractPromises?: Promise<ExtractResult>[],\n  actual?: Graph,\n  seenExtracted?: Set<DepID>,\n  remover?: RollbackRemove,\n  transientAdd?: TransientAddMap,\n  transientRemove?: TransientRemoveMap,\n): Promise<ProcessPlacementResult> => {\n  const childDepsToProcess: ProcessPlacementResult = []\n\n  for (const placementTask of placementTasks) {\n    const { fetchTask, manifest } = placementTask\n    let {\n      activeModifier,\n      edgeOptional,\n      fileTypeInfo,\n      fromNode,\n      peerContext,\n      queryModifier,\n      spec,\n      type,\n    } = fetchTask\n\n    // fix the name in the `add` map when needed. This allows the upcoming\n    // reify step to properly update the package.json file dependencies\n    // using the correct names retrieved from the manifest data\n    const additiveMap =\n      fromNode.importer ? add : transientAdd?.get(fromNode.id)\n    spec = fixupAddedNames(additiveMap, manifest, options, spec)\n\n    // handles missing manifest resolution\n    if (!manifest) {\n      if (!edgeOptional && fromNode.isOptional()) {\n        // failed resolution of a non-optional dep of an optional node\n        // have to clean up the dependents\n        removeOptionalSubgraph(graph, fromNode)\n        continue\n      } else if (edgeOptional) {\n        // failed resolution of an optional dep, just ignore it,\n        // nothing to prune because we never added it in the first place.\n        continue\n      } else {\n        throw error('failed to resolve dependency', {\n          spec,\n          from: fromNode.location,\n        })\n      }\n    }\n\n    // start peer deps placement process, populating the peer context with\n    // dependency data; adding the parent node deps and this manifest's\n    // peer deps references to the current peer context set\n    const peerPlacement = startPeerPlacement(\n      peerContext,\n      manifest,\n      fromNode,\n      options,\n    )\n    const peerSetHash = peerPlacement.peerSetHash\n    const queuedEntries = peerPlacement.queuedEntries\n\n    // places a new node in the graph representing a newly seen dependency\n    const node = graph.placePackage(\n      fromNode,\n      type,\n      spec,\n      normalizeManifest(manifest),\n      fileTypeInfo?.id,\n      joinExtra({ peerSetHash, modifier: queryModifier }),\n    )\n\n    /* c8 ignore start - not possible, already ensured manifest */\n    if (!node) {\n      throw error('failed to place package', {\n        from: fromNode.location,\n        spec,\n      })\n    }\n    /* c8 ignore stop */\n\n    // update the node modifier tracker\n    if (activeModifier) {\n      modifiers?.updateActiveEntry(node, activeModifier)\n    }\n\n    const eligibleForExtraction =\n      type !== 'peer' &&\n      type !== 'peerOptional' &&\n      remover &&\n      extractPromises &&\n      actual &&\n      scurry &&\n      packageInfo &&\n      node.inVltStore() &&\n      !node.isOptional() &&\n      // this fixes an issue with installing `file:pathname` specs\n      /* c8 ignore next */ !fileTypeInfo?.isDirectory &&\n      !node.importer\n\n    // extract the node if it meets the criteria for early extraction\n    if (eligibleForExtraction) {\n      /* c8 ignore start */\n      if (seenExtracted?.has(node.id)) {\n        continue\n      }\n      /* c8 ignore stop */\n      seenExtracted?.add(node.id)\n      const actualNode = actual.nodes.get(node.id)\n      if (!actualNode?.equals(node)) {\n        // extract the node without awaiting - push the promise to the array\n        const extractPromise = extractNode(\n          node,\n          scurry,\n          remover,\n          options,\n          packageInfo,\n        )\n        extractPromises.push(extractPromise)\n      }\n    }\n\n    // updates graph node information\n    if (fileTypeInfo?.path && fileTypeInfo.isDirectory) {\n      node.location = fileTypeInfo.path\n    }\n    node.setResolved()\n\n    // collect child dependencies for processing in the next level\n    const nextPeerDeps = new Map<string, Dependency>()\n\n    // compute deps normally\n    const bundleDeps = manifest.bundleDependencies\n    const bundled = new Set<string>(\n      (\n        node.id.startsWith('git') ||\n          node.importer ||\n          !isStringArray(bundleDeps)\n      ) ?\n        []\n      : bundleDeps,\n    )\n\n    // setup next level to process all child dependencies in the manifest\n    const nextDeps: Dependency[] = []\n\n    // traverse actual dependency declarations in the manifest\n    // creating dependency entries for them\n    for (const depTypeName of longDependencyTypes) {\n      const depRecord: Record<string, string> | undefined =\n        manifest[depTypeName]\n\n      if (depRecord && shouldInstallDepType(node, depTypeName)) {\n        // Sort Object.entries for deterministic iteration\n        const sortedEntries = Object.entries(depRecord).sort(\n          ([a], [b]) => a.localeCompare(b, 'en'),\n        )\n        for (const [name, bareSpec] of sortedEntries) {\n          // might need to skip already placed peer deps here\n          if (bundled.has(name)) continue\n          const dep = {\n            type: shorten(depTypeName, name, manifest),\n            spec: Spec.parse(name, bareSpec, {\n              ...options,\n              registry: spec.registry,\n            }),\n          }\n          if (depTypeName === 'peerDependencies') {\n            nextPeerDeps.set(name, dep)\n          } else {\n            nextDeps.push(dep)\n          }\n        }\n      }\n    }\n\n    // Inject transient dependencies for non-importer nodes (nested folders)\n    // These are deps that were added from a nested folder context using\n    // relative file: specs that should resolve relative to that folder\n    const transientDeps = transientAdd?.get(node.id)\n    if (transientDeps) {\n      for (const [, dep] of transientDeps) {\n        if (dep.type === 'peer' || dep.type === 'peerOptional') {\n          nextPeerDeps.set(dep.spec.name, dep)\n          continue\n        }\n\n        // remove the dependency from nextDeps if it already exists\n        const index = nextDeps.findIndex(\n          d => d.spec.name === dep.spec.name,\n        )\n        if (index !== -1) {\n          nextDeps.splice(index, 1)\n        }\n\n        nextDeps.push(dep)\n      }\n    }\n\n    // Remove transient removals when needed\n    const transientRemovals = transientRemove?.get(node.id)\n    if (transientRemovals) {\n      for (const depName of transientRemovals) {\n        const index = nextDeps.findIndex(\n          dep => dep.spec.name === depName,\n        )\n        if (index !== -1) {\n          nextDeps.splice(index, 1)\n          continue\n        }\n\n        if (nextPeerDeps.has(depName)) {\n          nextPeerDeps.delete(depName)\n        }\n      }\n    }\n\n    // finish peer placement for this node, resolving satisfied peers\n    // to seen nodes from the peer context and adding unsatisfied peers\n    // to `nextDeps` so they get processed along regular dependencies\n    const updateContext = endPeerPlacement(\n      peerContext,\n      nextDeps,\n      nextPeerDeps,\n      graph,\n      spec,\n      fromNode,\n      node,\n      type,\n      queuedEntries,\n    )\n\n    childDepsToProcess.push({\n      node,\n      deps: nextDeps,\n      modifierRefs: modifiers?.tryDependencies(node, nextDeps),\n      peerContext,\n      updateContext,\n    })\n  }\n\n  return childDepsToProcess\n}\n\n/**\n * Append new nodes in the given `graph` for dependencies specified at `add`\n * and missing dependencies from the `deps` parameter.\n *\n * It also applies any modifiers that applies to a given node as it processes\n * and builds the graph.\n */\nexport const appendNodes = async (\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  options: SpecOptions,\n  seen: Set<DepID>,\n  add?: Map<string, Dependency>,\n  modifiers?: GraphModifier,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n  extractPromises?: Promise<ExtractResult>[],\n  actual?: Graph,\n  seenExtracted?: Set<DepID>,\n  remover?: RollbackRemove,\n  transientAdd?: TransientAddMap,\n  transientRemove?: TransientRemoveMap,\n) => {\n  /* c8 ignore next */\n  if (seen.has(fromNode.id)) return\n  seen.add(fromNode.id)\n\n  // Get the initial peer context from the graph\n  const [initialPeerContext] = graph.peerContexts\n  /* c8 ignore start - impossible */\n  if (!initialPeerContext) {\n    throw error('no initial peer context found in graph')\n  }\n  /* c8 ignore stop */\n\n  // Use a queue for breadth-first processing\n  let currentLevelDeps: AppendNodeEntry[] = [\n    {\n      node: fromNode,\n      deps,\n      modifierRefs,\n      depth: 0,\n      peerContext: initialPeerContext,\n      /* c8 ignore start */\n      updateContext: {\n        putEntries: () => undefined,\n        resolvePeerDeps: () => {},\n      },\n      /* c8 ignore stop */\n    },\n  ]\n\n  while (currentLevelDeps.length > 0) {\n    const nextLevelDeps: AppendNodeEntry[] = []\n\n    // Process all nodes at the current level in parallel\n    const levelResults = await Promise.all(\n      currentLevelDeps.map(\n        async ({\n          node,\n          deps: nodeDeps,\n          modifierRefs: nodeModifierRefs,\n          peerContext,\n          depth,\n        }: AppendNodeEntry) => {\n          // Mark node as seen when we start processing its dependencies\n          seen.add(node.id)\n\n          // Fetch manifests for this node's dependencies\n          const placementTasks = await fetchManifestsForDeps(\n            packageInfo,\n            graph,\n            node,\n            // Sort dependencies by spec.name for deterministic ordering\n            nodeDeps.sort((a, b) =>\n              a.spec.name.localeCompare(b.spec.name, 'en'),\n            ),\n            scurry,\n            peerContext,\n            nodeModifierRefs,\n            depth,\n          )\n\n          // Process the placement tasks and get child dependencies\n          return await processPlacementTasks(\n            graph,\n            options,\n            placementTasks,\n            add,\n            modifiers,\n            scurry,\n            packageInfo,\n            extractPromises,\n            actual,\n            seenExtracted,\n            remover,\n            transientAdd,\n            transientRemove,\n          )\n        },\n      ),\n    )\n\n    // Traverse the queued up children dependencies, adding and tracking\n    // dependencies on the peer context set, forking the context as needed\n    // and resolving any peer dependency that is able to be resolved using\n    // the current peer context set\n    postPlacementPeerCheck(graph, levelResults)\n\n    // Collect all child dependencies for the next level\n    for (const childDepsToProcess of levelResults) {\n      for (const childDep of childDepsToProcess) {\n        if (!seen.has(childDep.node.id)) {\n          /* c8 ignore next */\n          const currentDepth = currentLevelDeps[0]?.depth ?? 0\n          nextLevelDeps.push({\n            ...childDep,\n            depth: currentDepth + 1,\n          })\n        }\n      }\n    }\n\n    // Move to the next level\n    currentLevelDeps = nextLevelDeps\n  }\n}\n"]}

package/dist/ideal/peers.d.ts

@@ -1,10 +1,31 @@
+import { Spec } from '@vltpkg/spec';
 import type { PeerContext, PeerContextEntry, PeerContextEntryInput, ProcessPlacementResult } from './types.ts';
-import type { Spec, SpecOptions } from '@vltpkg/spec';
+import type { SpecOptions } from '@vltpkg/spec';
 import type { DependencySaveType, Manifest } from '@vltpkg/types';
 import type { Monorepo } from '@vltpkg/workspaces';
 import type { Dependency } from '../dependencies.ts';
 import type { Graph } from '../graph.ts';
 import type { Node } from '../node.ts';
+/**
+ * Result of checking if an existing node's peer edges are compatible
+ * with a new parent's context. The `forkEntry` property is optional
+ * and will only be present if the node's peer edges are incompatible.
+ */
+type PeerEdgeCompatResult = {
+    compatible: boolean;
+    /** When incompatible, entry to add to forked context */
+    forkEntry?: {
+        spec: Spec;
+        target: Node;
+        type: DependencySaveType;
+    };
+};
+/**
+ * Check if an existing node's peer edges would still resolve to the same
+ * targets from a new parent's context. Returns incompatible info if any
+ * peer would resolve differently, meaning the node should NOT be reused.
+ */
+export declare const checkPeerEdgesCompatible: (existingNode: Node, fromNode: Node, peerContext: PeerContext, graph: Graph) => PeerEdgeCompatResult;
 /**
  * Retrieve a unique hash value for a given peer context set.
  */
@@ -73,4 +94,5 @@ export declare const endPeerPlacement: (peerContext: PeerContext, nextDeps: Depe
  * nodes already present in the graph if possible.
  */
 export declare const postPlacementPeerCheck: (graph: Graph, sortedLevelResults: ProcessPlacementResult[]) => void;
+export {};
 //# sourceMappingURL=peers.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"peers.d.ts","sourceRoot":"","sources":["../../src/ideal/peers.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAEV,WAAW,EACX,gBAAgB,EAChB,qBAAqB,EACrB,sBAAsB,EACvB,MAAM,YAAY,CAAA;AACnB,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AACrD,OAAO,KAAK,EAAE,kBAAkB,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAClD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC;;GAEG;AACH,eAAO,MAAM,uBAAuB,gBACrB,WAAW,GAAG,SAAS,KACnC,MAAM,GAAG,SAKX,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,SACtB,IAAI,SACH,gBAAgB,KACtB,OAkBF,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,4BAA4B,YAC9B,qBAAqB,EAAE,KAC/B,qBAAqB,EAUpB,CAAA;AAQJ,eAAO,MAAM,yBAAyB,gBACvB,WAAW,WACf,qBAAqB,EAAE,KAC/B,OAgBF,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,uBAAuB,gBACrB,WAAW,WACf,qBAAqB,EAAE,YACtB,IAAI,aACH,QAAQ,KAClB,OAsEF,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,eAAe,UACnB,KAAK,eACC,WAAW,WACf,qBAAqB,EAAE,KAC/B,WAqCF,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,kBAAkB,gBAChB,WAAW,YACd,QAAQ,YACR,IAAI,WACL,WAAW;;;CA4CrB,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,gBACd,WAAW,YACd,UAAU,EAAE,gBACR,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG;IAAE,EAAE,CAAC,EAAE,MAAM,CAAA;CAAE,SAChD,KAAK,QACN,IAAI,YACA,IAAI,QACR,IAAI,QACJ,kBAAkB,iBACT,qBAAqB,EAAE;IAEtC;;OAEG;;;;;;IA2CH;;;OAGG;;CAyEH,CAAA;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,sBAAsB,UAC1B,KAAK,sBACQ,sBAAsB,EAAE,SAiE7C,CAAA"}
+{"version":3,"file":"peers.d.ts","sourceRoot":"","sources":["../../src/ideal/peers.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAGnC,OAAO,KAAK,EAEV,WAAW,EACX,gBAAgB,EAChB,qBAAqB,EACrB,sBAAsB,EACvB,MAAM,YAAY,CAAA;AACnB,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAE/C,OAAO,KAAK,EAAE,kBAAkB,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAClD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC;;;;GAIG;AACH,KAAK,oBAAoB,GAAG;IAC1B,UAAU,EAAE,OAAO,CAAA;IACnB,wDAAwD;IACxD,SAAS,CAAC,EAAE;QACV,IAAI,EAAE,IAAI,CAAA;QACV,MAAM,EAAE,IAAI,CAAA;QACZ,IAAI,EAAE,kBAAkB,CAAA;KACzB,CAAA;CACF,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,wBAAwB,iBACrB,IAAI,YACR,IAAI,eACD,WAAW,SACjB,KAAK,KACX,oBAuIF,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,uBAAuB,gBACrB,WAAW,GAAG,SAAS,KACnC,MAAM,GAAG,SAKX,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,SACtB,IAAI,SACH,gBAAgB,KACtB,OAmBF,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,4BAA4B,YAC9B,qBAAqB,EAAE,KAC/B,qBAAqB,EAUpB,CAAA;AAQJ,eAAO,MAAM,yBAAyB,gBACvB,WAAW,WACf,qBAAqB,EAAE,KAC/B,OAgBF,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,uBAAuB,gBACrB,WAAW,WACf,qBAAqB,EAAE,YACtB,IAAI,aACH,QAAQ,KAClB,OAwEF,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,eAAe,UACnB,KAAK,eACC,WAAW,WACf,qBAAqB,EAAE,KAC/B,WAqCF,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,kBAAkB,gBAChB,WAAW,YACd,QAAQ,YACR,IAAI,WACL,WAAW;;;CA4CrB,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,gBACd,WAAW,YACd,UAAU,EAAE,gBACR,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG;IAAE,EAAE,CAAC,EAAE,MAAM,CAAA;CAAE,SAChD,KAAK,QACN,IAAI,YACA,IAAI,QACR,IAAI,QACJ,kBAAkB,iBACT,qBAAqB,EAAE;IAEtC;;OAEG;;;;;;IA2CH;;;OAGG;;CAyEH,CAAA;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,sBAAsB,UAC1B,KAAK,sBACQ,sBAAsB,EAAE,SAiE7C,CAAA"}

package/dist/ideal/peers.js

@@ -2,8 +2,105 @@
 // during the ideal graph building process.
 import { intersects } from '@vltpkg/semver';
 import { satisfies } from '@vltpkg/satisfies';
-import { getDependencies } from "../dependencies.js";
+import { Spec } from '@vltpkg/spec';
+import { getDependencies, shorten } from "../dependencies.js";
 import { getOrderedDependencies } from "./get-ordered-dependencies.js";
+import { longDependencyTypes } from '@vltpkg/types';
+/**
+ * Check if an existing node's peer edges would still resolve to the same
+ * targets from a new parent's context. Returns incompatible info if any
+ * peer would resolve differently, meaning the node should NOT be reused.
+ */
+export const checkPeerEdgesCompatible = (existingNode, fromNode, peerContext, graph) => {
+    // No peer deps means always compatible
+    if (!existingNode.manifest?.peerDependencies ||
+        Object.keys(existingNode.manifest.peerDependencies).length === 0)
+        return { compatible: true };
+    const peerDeps = existingNode.manifest.peerDependencies;
+    for (const [peerName, peerSpec] of Object.entries(peerDeps)) {
+        const existingEdge = existingNode.edgesOut.get(peerName);
+        if (!existingEdge?.to)
+            continue; // dangling peer, skip
+        // Check the peer context for what this parent's context would provide
+        const contextEntry = peerContext.get(peerName);
+        // If context has a different target for this peer, not compatible
+        if (contextEntry?.target &&
+            contextEntry.target.id !== existingEdge.to.id) {
+            // Verify the context target would actually satisfy the peer spec
+            const spec = Spec.parse(peerName, peerSpec, {
+                ...graph.mainImporter.options,
+                registry: fromNode.registry,
+            });
+            if (satisfies(contextEntry.target.id, spec, fromNode.location, fromNode.projectRoot, graph.monorepo)) {
+                return {
+                    compatible: false,
+                    forkEntry: {
+                        spec,
+                        target: contextEntry.target,
+                        type: contextEntry.type,
+                    },
+                };
+            }
+        }
+        // Also check parent's already-placed siblings
+        const siblingEdge = fromNode.edgesOut.get(peerName);
+        if (siblingEdge?.to && siblingEdge.to.id !== existingEdge.to.id) {
+            const spec = Spec.parse(peerName, peerSpec, {
+                ...graph.mainImporter.options,
+                registry: fromNode.registry,
+            });
+            if (satisfies(siblingEdge.to.id, spec, fromNode.location, fromNode.projectRoot, graph.monorepo)) {
+                return {
+                    compatible: false,
+                    forkEntry: {
+                        spec,
+                        target: siblingEdge.to,
+                        type: siblingEdge.type,
+                    },
+                };
+            }
+        }
+        // Check parent's manifest for not-yet-placed siblings
+        // This handles the case where sibling hasn't been placed yet but will be
+        const parentManifest = fromNode.manifest;
+        if (parentManifest) {
+            for (const depType of longDependencyTypes) {
+                const depRecord = parentManifest[depType];
+                if (depRecord?.[peerName]) {
+                    // Parent declares this peer as a dependency
+                    // Check if there's an existing graph node that would satisfy it differently
+                    const parentSpec = Spec.parse(peerName, depRecord[peerName], {
+                        ...graph.mainImporter.options,
+                        registry: fromNode.registry,
+                    });
+                    // Look for a node in the graph that satisfies parent's spec but differs from existing edge
+                    for (const candidateNode of graph.nodes.values()) {
+                        if (candidateNode.name === peerName &&
+                            candidateNode.id !== existingEdge.to.id &&
+                            satisfies(candidateNode.id, parentSpec, fromNode.location, fromNode.projectRoot, graph.monorepo)) {
+                            // Also verify this candidate satisfies the peer spec
+                            const peerSpecParsed = Spec.parse(peerName, peerSpec, {
+                                ...graph.mainImporter.options,
+                                registry: fromNode.registry,
+                            });
+                            if (satisfies(candidateNode.id, peerSpecParsed, fromNode.location, fromNode.projectRoot, graph.monorepo)) {
+                                return {
+                                    compatible: false,
+                                    forkEntry: {
+                                        spec: peerSpecParsed,
+                                        target: candidateNode,
+                                        type: shorten(depType),
+                                    },
+                                };
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    return { compatible: true };
+};
 /**
  * Retrieve a unique hash value for a given peer context set.
  */
@@ -21,7 +118,8 @@ export const retrievePeerContextHash = (peerContext) => {
  */
 export const incompatibleSpecs = (spec, entry) => {
     if (entry.specs.size > 0) {
-        for (const s of entry.specs) {
+        for (const s_ of entry.specs) {
+            const s = s_.final;
             if (
             // only able to check range intersections for registry types
             (spec.type === 'registry' &&
@@ -65,7 +163,7 @@ export const checkEntriesToPeerContext = (peerContext, entries) => {
         if (!entry?.active)
             continue;
         // validate if the provided spec is compatible with existing specs
-        if (incompatibleSpecs(spec, entry)) {
+        if (incompatibleSpecs(spec.final, entry)) {
             return true;
         }
     }
@@ -107,8 +205,9 @@ export const addEntriesToPeerContext = (peerContext, entries, fromNode, monorepo
         // perform an extra check that confirms the new spec does not
         // conflicts with existing specs in this entry, this handles the
         // case of adding sibling deps that conflicts with one another
-        if (incompatibleSpecs(spec, entry))
+        if (incompatibleSpecs(spec.final, entry)) {
             return true;
+        }
         if (target &&
             [...entry.specs].every(s => satisfies(target.id, s, fromNode.location, fromNode.projectRoot, monorepo))) {
             if (target.id !== entry.target?.id &&

package/dist/ideal/peers.js.map

@@ -1 +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,+DAA+D;gBAC/D,+DAA+D;gBAC/D,4DAA4D;gBAC5D,gEAAgE;gBAChE,wDAAwD;gBACxD,MAAM,YAAY,GAAG,aAAa,CAAC,IAAI,CACrC,CAAC,CAAC,EAAE,CACF,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAC5D,CAAA;gBAED,IACE,YAAY,EAAE,MAAM;oBACpB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;oBACnC,SAAS,CACP,YAAY,CAAC,MAAM,CAAC,EAAE,EACtB,IAAI,EACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;oBACD,yDAAyD;oBACzD,yDAAyD;oBACzD,wDAAwD;oBACxD,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;oBACpD,SAAQ;gBACV,CAAC;gBAED,wDAAwD;gBACxD,+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,IACL,YAAY;oBACZ,YAAY,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EAC5C,CAAC;oBACD,qDAAqD;oBACrD,2DAA2D;oBAC3D,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC,CAAA;gBACxD,CAAC;qBAAM,CAAC;oBACN,mEAAmE;oBACnE,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        // FIRST: Check if there's a sibling dependency from the parent\n        // that specifies this same package. Sibling deps take priority\n        // because they represent the workspace's direct dependency,\n        // which should be preferred over versions from other workspaces\n        // that may have been added to the peer context earlier.\n        const siblingEntry = queuedEntries.find(\n          e =>\n            (e.target?.name ?? e.spec.final.name) === spec.final.name,\n        )\n\n        if (\n          siblingEntry?.target &&\n          !node.edgesOut.has(spec.final.name) &&\n          satisfies(\n            siblingEntry.target.id,\n            spec,\n            fromNode.location,\n            fromNode.projectRoot,\n            graph.monorepo,\n          )\n        ) {\n          // The sibling's resolved target satisfies the peer spec,\n          // use it directly - this prioritizes the workspace's own\n          // direct dependency over versions from other workspaces\n          graph.addEdge(type, spec, node, siblingEntry.target)\n          continue\n        }\n\n        // THEN: 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 if (\n          siblingEntry &&\n          siblingEntry.spec.bareSpec !== spec.bareSpec\n        ) {\n          // Sibling has a more specific spec for this package,\n          // use it when resolving to ensure we get the right version\n          nextDeps.push({ ...nextDep, spec: siblingEntry.spec })\n        } else {\n          // could not satisfy from peer context or sibling, 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"]}
+{"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,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAC7D,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAA;AAStE,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAA;AAsBnD;;;;GAIG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CACtC,YAAkB,EAClB,QAAc,EACd,WAAwB,EACxB,KAAY,EACU,EAAE;IACxB,uCAAuC;IACvC,IACE,CAAC,YAAY,CAAC,QAAQ,EAAE,gBAAgB;QACxC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,KAAK,CAAC;QAEhE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAA;IAE7B,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,gBAAgB,CAAA;IAEvD,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5D,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACxD,IAAI,CAAC,YAAY,EAAE,EAAE;YAAE,SAAQ,CAAC,sBAAsB;QAEtD,sEAAsE;QACtE,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QAE9C,kEAAkE;QAClE,IACE,YAAY,EAAE,MAAM;YACpB,YAAY,CAAC,MAAM,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC,EAAE,EAC7C,CAAC;YACD,iEAAiE;YACjE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE;gBAC1C,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO;gBAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;aAC5B,CAAC,CAAA;YACF,IACE,SAAS,CACP,YAAY,CAAC,MAAM,CAAC,EAAE,EACtB,IAAI,EACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;gBACD,OAAO;oBACL,UAAU,EAAE,KAAK;oBACjB,SAAS,EAAE;wBACT,IAAI;wBACJ,MAAM,EAAE,YAAY,CAAC,MAAM;wBAC3B,IAAI,EAAE,YAAY,CAAC,IAAI;qBACxB;iBACF,CAAA;YACH,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACnD,IAAI,WAAW,EAAE,EAAE,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE;gBAC1C,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO;gBAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;aAC5B,CAAC,CAAA;YACF,IACE,SAAS,CACP,WAAW,CAAC,EAAE,CAAC,EAAE,EACjB,IAAI,EACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;gBACD,OAAO;oBACL,UAAU,EAAE,KAAK;oBACjB,SAAS,EAAE;wBACT,IAAI;wBACJ,MAAM,EAAE,WAAW,CAAC,EAAE;wBACtB,IAAI,EAAE,WAAW,CAAC,IAAI;qBACvB;iBACF,CAAA;YACH,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,yEAAyE;QACzE,MAAM,cAAc,GAAG,QAAQ,CAAC,QAAQ,CAAA;QACxC,IAAI,cAAc,EAAE,CAAC;YACnB,KAAK,MAAM,OAAO,IAAI,mBAAmB,EAAE,CAAC;gBAC1C,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;gBACzC,IAAI,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC1B,4CAA4C;oBAC5C,4EAA4E;oBAC5E,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAC3B,QAAQ,EACR,SAAS,CAAC,QAAQ,CAAC,EACnB;wBACE,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO;wBAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;qBAC5B,CACF,CAAA;oBACD,2FAA2F;oBAC3F,KAAK,MAAM,aAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;wBACjD,IACE,aAAa,CAAC,IAAI,KAAK,QAAQ;4BAC/B,aAAa,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC,EAAE;4BACvC,SAAS,CACP,aAAa,CAAC,EAAE,EAChB,UAAU,EACV,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;4BACD,qDAAqD;4BACrD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE;gCACpD,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO;gCAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;6BAC5B,CAAC,CAAA;4BACF,IACE,SAAS,CACP,aAAa,CAAC,EAAE,EAChB,cAAc,EACd,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;gCACD,OAAO;oCACL,UAAU,EAAE,KAAK;oCACjB,SAAS,EAAE;wCACT,IAAI,EAAE,cAAc;wCACpB,MAAM,EAAE,aAAa;wCACrB,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC;qCACvB;iCACF,CAAA;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAA;AAC7B,CAAC,CAAA;AAED;;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,EAAE,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAA;YAClB;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,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YACzC,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,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YACzC,OAAO,IAAI,CAAA;QACb,CAAC;QAED,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,+DAA+D;gBAC/D,+DAA+D;gBAC/D,4DAA4D;gBAC5D,gEAAgE;gBAChE,wDAAwD;gBACxD,MAAM,YAAY,GAAG,aAAa,CAAC,IAAI,CACrC,CAAC,CAAC,EAAE,CACF,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAC5D,CAAA;gBAED,IACE,YAAY,EAAE,MAAM;oBACpB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;oBACnC,SAAS,CACP,YAAY,CAAC,MAAM,CAAC,EAAE,EACtB,IAAI,EACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;oBACD,yDAAyD;oBACzD,yDAAyD;oBACzD,wDAAwD;oBACxD,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;oBACpD,SAAQ;gBACV,CAAC;gBAED,wDAAwD;gBACxD,+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,IACL,YAAY;oBACZ,YAAY,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EAC5C,CAAC;oBACD,qDAAqD;oBACrD,2DAA2D;oBAC3D,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC,CAAA;gBACxD,CAAC;qBAAM,CAAC;oBACN,mEAAmE;oBACnE,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 { Spec } from '@vltpkg/spec'\nimport { getDependencies, shorten } 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 { SpecOptions } from '@vltpkg/spec'\nimport { longDependencyTypes } from '@vltpkg/types'\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 * Result of checking if an existing node's peer edges are compatible\n * with a new parent's context. The `forkEntry` property is optional\n * and will only be present if the node's peer edges are incompatible.\n */\ntype PeerEdgeCompatResult = {\n  compatible: boolean\n  /** When incompatible, entry to add to forked context */\n  forkEntry?: {\n    spec: Spec\n    target: Node\n    type: DependencySaveType\n  }\n}\n\n/**\n * Check if an existing node's peer edges would still resolve to the same\n * targets from a new parent's context. Returns incompatible info if any\n * peer would resolve differently, meaning the node should NOT be reused.\n */\nexport const checkPeerEdgesCompatible = (\n  existingNode: Node,\n  fromNode: Node,\n  peerContext: PeerContext,\n  graph: Graph,\n): PeerEdgeCompatResult => {\n  // No peer deps means always compatible\n  if (\n    !existingNode.manifest?.peerDependencies ||\n    Object.keys(existingNode.manifest.peerDependencies).length === 0\n  )\n    return { compatible: true }\n\n  const peerDeps = existingNode.manifest.peerDependencies\n\n  for (const [peerName, peerSpec] of Object.entries(peerDeps)) {\n    const existingEdge = existingNode.edgesOut.get(peerName)\n    if (!existingEdge?.to) continue // dangling peer, skip\n\n    // Check the peer context for what this parent's context would provide\n    const contextEntry = peerContext.get(peerName)\n\n    // If context has a different target for this peer, not compatible\n    if (\n      contextEntry?.target &&\n      contextEntry.target.id !== existingEdge.to.id\n    ) {\n      // Verify the context target would actually satisfy the peer spec\n      const spec = Spec.parse(peerName, peerSpec, {\n        ...graph.mainImporter.options,\n        registry: fromNode.registry,\n      })\n      if (\n        satisfies(\n          contextEntry.target.id,\n          spec,\n          fromNode.location,\n          fromNode.projectRoot,\n          graph.monorepo,\n        )\n      ) {\n        return {\n          compatible: false,\n          forkEntry: {\n            spec,\n            target: contextEntry.target,\n            type: contextEntry.type,\n          },\n        }\n      }\n    }\n\n    // Also check parent's already-placed siblings\n    const siblingEdge = fromNode.edgesOut.get(peerName)\n    if (siblingEdge?.to && siblingEdge.to.id !== existingEdge.to.id) {\n      const spec = Spec.parse(peerName, peerSpec, {\n        ...graph.mainImporter.options,\n        registry: fromNode.registry,\n      })\n      if (\n        satisfies(\n          siblingEdge.to.id,\n          spec,\n          fromNode.location,\n          fromNode.projectRoot,\n          graph.monorepo,\n        )\n      ) {\n        return {\n          compatible: false,\n          forkEntry: {\n            spec,\n            target: siblingEdge.to,\n            type: siblingEdge.type,\n          },\n        }\n      }\n    }\n\n    // Check parent's manifest for not-yet-placed siblings\n    // This handles the case where sibling hasn't been placed yet but will be\n    const parentManifest = fromNode.manifest\n    if (parentManifest) {\n      for (const depType of longDependencyTypes) {\n        const depRecord = parentManifest[depType]\n        if (depRecord?.[peerName]) {\n          // Parent declares this peer as a dependency\n          // Check if there's an existing graph node that would satisfy it differently\n          const parentSpec = Spec.parse(\n            peerName,\n            depRecord[peerName],\n            {\n              ...graph.mainImporter.options,\n              registry: fromNode.registry,\n            },\n          )\n          // Look for a node in the graph that satisfies parent's spec but differs from existing edge\n          for (const candidateNode of graph.nodes.values()) {\n            if (\n              candidateNode.name === peerName &&\n              candidateNode.id !== existingEdge.to.id &&\n              satisfies(\n                candidateNode.id,\n                parentSpec,\n                fromNode.location,\n                fromNode.projectRoot,\n                graph.monorepo,\n              )\n            ) {\n              // Also verify this candidate satisfies the peer spec\n              const peerSpecParsed = Spec.parse(peerName, peerSpec, {\n                ...graph.mainImporter.options,\n                registry: fromNode.registry,\n              })\n              if (\n                satisfies(\n                  candidateNode.id,\n                  peerSpecParsed,\n                  fromNode.location,\n                  fromNode.projectRoot,\n                  graph.monorepo,\n                )\n              ) {\n                return {\n                  compatible: false,\n                  forkEntry: {\n                    spec: peerSpecParsed,\n                    target: candidateNode,\n                    type: shorten(depType),\n                  },\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { compatible: true }\n}\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      const s = s_.final\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.final, 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.final, entry)) {\n      return true\n    }\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        // FIRST: Check if there's a sibling dependency from the parent\n        // that specifies this same package. Sibling deps take priority\n        // because they represent the workspace's direct dependency,\n        // which should be preferred over versions from other workspaces\n        // that may have been added to the peer context earlier.\n        const siblingEntry = queuedEntries.find(\n          e =>\n            (e.target?.name ?? e.spec.final.name) === spec.final.name,\n        )\n\n        if (\n          siblingEntry?.target &&\n          !node.edgesOut.has(spec.final.name) &&\n          satisfies(\n            siblingEntry.target.id,\n            spec,\n            fromNode.location,\n            fromNode.projectRoot,\n            graph.monorepo,\n          )\n        ) {\n          // The sibling's resolved target satisfies the peer spec,\n          // use it directly - this prioritizes the workspace's own\n          // direct dependency over versions from other workspaces\n          graph.addEdge(type, spec, node, siblingEntry.target)\n          continue\n        }\n\n        // THEN: 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 if (\n          siblingEntry &&\n          siblingEntry.spec.bareSpec !== spec.bareSpec\n        ) {\n          // Sibling has a more specific spec for this package,\n          // use it when resolving to ensure we get the right version\n          nextDeps.push({ ...nextDep, spec: siblingEntry.spec })\n        } else {\n          // could not satisfy from peer context or sibling, 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

@@ -1 +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"}
+{"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;AAuCH;;GAEG;AACH,eAAO,MAAM,iBAAiB,2HAY3B,wBAAwB,kBAkE1B,CAAA;AAMD;;GAEG;AACH,eAAO,MAAM,oBAAoB,cAA2B,CAAA"}

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

@@ -5,6 +5,12 @@ import { getNodeOrderedDependencies } from "./get-ordered-dependencies.js";
  */
 const getOrderedImporters = (graph) => {
     const orderedImporters = [...graph.importers].sort((a, b) => {
+        // mainImporter always comes first
+        /* c8 ignore next */
+        if (a === graph.mainImporter)
+            return -1;
+        if (b === graph.mainImporter)
+            return 1;
         // sorts importers first by usage of peer deps
         const aIsPeer = (a.manifest?.peerDependencies &&
             Object.keys(a.manifest.peerDependencies).length > 0) ?

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

@@ -1 +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"]}
+{"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,kCAAkC;QAClC,oBAAoB;QACpB,IAAI,CAAC,KAAK,KAAK,CAAC,YAAY;YAAE,OAAO,CAAC,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK,KAAK,CAAC,YAAY;YAAE,OAAO,CAAC,CAAA;QAEtC,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    // mainImporter always comes first\n    /* c8 ignore next */\n    if (a === graph.mainImporter) return -1\n    if (b === graph.mainImporter) return 1\n\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/lockfile/types.d.ts

@@ -8,6 +8,7 @@ export type LockfilePlatform = {
     engines?: Record<string, string>;
     os?: string[] | string;
     cpu?: string[] | string;
+    libc?: string[] | string;
 };
 /**
  * This is the main type definition for the contents of the

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

@@ -1 +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"}
+{"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;IACvB,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;CACzB,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"}