UNPKG

graphql

Version:

A Query Language and Runtime which can target any service.

1 lines • 78.3 kB
{"version":3,"file":"OverlappingFieldsCanBeMergedRule.mjs","sourceRoot":"","sources":["../../../src/validation/rules/OverlappingFieldsCanBeMergedRule.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAE,kCAAiC;AAGnD,OAAO,EAAE,YAAY,EAAE,qCAAoC;AAY3D,OAAO,EAAE,MAAM,EAAE,+BAA8B;AAC/C,OAAO,EAAE,IAAI,EAAE,iCAAgC;AAC/C,OAAO,EAAE,KAAK,EAAE,mCAAkC;AAQlD,OAAO,EACL,YAAY,EACZ,eAAe,EACf,UAAU,EACV,UAAU,EACV,aAAa,EACb,YAAY,GACb,kCAAiC;AAElC,OAAO,EAAE,WAAW,EAAE,wCAAuC;AAG7D,OAAO,EAAE,sBAAsB,EAAE,sCAAqC;AAQtE,MAAM,0BAA0B,GAAG,IAAI,CAAC;AACxC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAIvC,MAAM,qBAAqB,GAAG,OAAO,CAAC;AA6CtC,MAAM,UAAU,gCAAgC,CAC9C,iBAAoC;IAEpC,MAAM,WAAW,GAAgB;QAI/B,8BAA8B,EAAE,IAAI,GAAG,EAAE;QACzC,qBAAqB,EAAE,IAAI,GAAG,EAAE;QAIhC,0BAA0B,EAAE,IAAI,GAAG,EAAE;QACrC,eAAe,EAAE,IAAI,GAAG,EAAE;QAC1B,wBAAwB,EAAE,IAAI,GAAG,EAAE;QACnC,uBAAuB,EAAE,IAAI,GAAG,EAAE;QAClC,yBAAyB,EAAE,qBAAqB;KACjD,CAAC;IACF,IAAI,aAAwC,CAAC;IAE7C,OAAO;QACL,kBAAkB,EAAE;YAClB,KAAK,CAAC,IAAI;gBACR,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBACrC,MAAM,iBAAiB,GACrB,iBAAiB,CAAC,0BAA0B,EAAE,CAAC,YAAY,CAAC,CAAC;gBAC/D,aAAa,GAAG,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;YACtD,CAAC;YACD,KAAK;gBACH,aAAa,GAAG,SAAS,CAAC;YAC5B,CAAC;SACF;QACD,YAAY,CAAC,YAAY,EAAE,IAAI,EAAE,MAAM;YAGrC,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvE,OAAO;YACT,CAAC;YACD,IACE,YAAY,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC;gBACnC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,IAAI,CAAC,eAAe,EACzD,CAAC;gBACD,OAAO;YACT,CAAC;YACD,MAAM,SAAS,GAAG,+BAA+B,CAC/C,iBAAiB,EACjB,WAAW,EACX,iBAAiB,CAAC,aAAa,EAAE,EACjC,YAAY,EACZ,aAAa,CACd,CAAC;YACF,KAAK,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,SAAS,EAAE,CAAC;gBACnE,iBAAiB,CAAC,WAAW,CAC3B,IAAI,YAAY,CACd,WAAW,eAAe,CAAC,YAAY,CAAC,sBAAsB,MAAM,8EAA8E,EAClJ,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CACnC,CACF,CAAC;YACJ,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AA0JD,SAAS,+BAA+B,CACtC,iBAAoC,EACpC,WAAwB,EACxB,UAAmC,EACnC,YAA8B,EAC9B,KAAgC;IAEhC,MAAM,SAAS,GAAoB,EAAE,CAAC;IAEtC,MAAM,mBAAmB,GAAG,aAAa,CACvC,iBAAiB,EACjB,WAAW,EACX,UAAU,EACV,YAAY,CACb,CAAC;IAIF,sBAAsB,CACpB,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,mBAAmB,EACnB,KAAK,CACN,CAAC;IAGF,IACE,mBAAmB,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QACxC,CAAC,mBAAmB,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC;YAC7C,mBAAmB,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EACzC,CAAC;QACD,MAAM,eAAe,GAAG,kBAAkB,CACxC,iBAAiB,EACjB,WAAW,EACX,mBAAmB,EACnB,KAAK,CACN,CAAC;QAGF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,wCAAwC,CACtC,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,KAAK,EACL,mBAAmB,EACnB,KAAK,EACL,eAAe,CAAC,CAAC,CAAC,CACnB,CAAC;YAKF,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,gCAAgC,CAC9B,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,KAAK,EACL,eAAe,CAAC,CAAC,CAAC,EAClB,eAAe,CAAC,CAAC,CAAC,CACnB,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAID,SAAS,wCAAwC,CAC/C,iBAAoC,EACpC,WAAwB,EACxB,SAA0B,EAC1B,oBAA6B,EAC7B,mBAAwC,EACxC,KAAgC,EAChC,cAA8B;IAI9B,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAEtC,IAAI,mBAAmB,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnD,OAAO;IACT,CAAC;IAID,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,CAAC;IAC3C,IAAI,eAAe,GAAG,WAAW,CAAC,8BAA8B,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5E,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QAClC,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,WAAW,CAAC,8BAA8B,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,8BAA8B,GAAG,eAAe,CAAC,GAAG,CACtD,cAAc,CAAC,KAAK,CACrB,CAAC;IACF,IAAI,8BAA8B,KAAK,SAAS,EAAE,CAAC;QACjD,8BAA8B,GAAG,IAAI,cAAc,EAAE,CAAC;QACtD,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,EAAE,8BAA8B,CAAC,CAAC;IAC5E,CAAC;IAID,IACE,8BAA8B,CAAC,GAAG,CAChC,mBAAmB,EACnB,QAAQ,EACR,oBAAoB,CACrB,EACD,CAAC;QACD,OAAO;IACT,CAAC;IACD,8BAA8B,CAAC,GAAG,CAChC,mBAAmB,EACnB,QAAQ,EACR,oBAAoB,CACrB,CAAC;IAEF,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO;IACT,CAAC;IAED,MAAM,oBAAoB,GAAG,qBAAqB,CAChD,iBAAiB,EACjB,WAAW,EACX,QAAQ,CACT,CAAC;IACF,MAAM,yBAAyB,GAAG,kBAAkB,CAClD,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,cAAc,CAAC,KAAK,CACrB,CAAC;IAGF,IACE,mBAAmB,KAAK,oBAAoB;QAC5C,KAAK,KAAK,cAAc,CAAC,KAAK,EAC9B,CAAC;QACD,OAAO;IACT,CAAC;IAID,uBAAuB,CACrB,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,mBAAmB,EACnB,KAAK,EACL,oBAAoB,EACpB,cAAc,CAAC,KAAK,CACrB,CAAC;IAIF,KAAK,MAAM,wBAAwB,IAAI,yBAAyB,EAAE,CAAC;QACjE,wCAAwC,CACtC,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,mBAAmB,EACnB,KAAK,EACL,wBAAwB,CACzB,CAAC;IACJ,CAAC;AACH,CAAC;AAID,SAAS,gCAAgC,CACvC,iBAAoC,EACpC,WAAwB,EACxB,SAA0B,EAC1B,oBAA6B,EAC7B,eAA+B,EAC/B,eAA+B;IAE/B,MAAM,SAAS,GAAG,eAAe,CAAC,UAAU,CAAC;IAC7C,MAAM,SAAS,GAAG,eAAe,CAAC,UAAU,CAAC;IAC7C,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC;IACrC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC;IAErC,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAGtC,IAAI,SAAS,KAAK,SAAS,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACjD,OAAO;IACT,CAAC;IAGD,IAAI,OAAO,GAAG,WAAW,CAAC,qBAAqB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC5D,IAAI,qBAAqB,GACvB,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC;QACpB,WAAW,CAAC,qBAAqB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7D,IAAI,qBAAqB,KAAK,SAAS,EAAE,CAAC;QACxC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;YACpB,WAAW,CAAC,qBAAqB,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACzD,CAAC;QACD,qBAAqB,GAAG,IAAI,OAAO,EAAE,CAAC;QACtC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,IAAI,qBAAqB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;YAC3D,OAAO;QACT,CAAC;QACD,qBAAqB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACvD,iBAAiB,CAAC,WAAW,CAC3B,IAAI,YAAY,CACd,YAAY,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,4BAA4B,CAAC,WAAW,EAAE,eAAe,CAAC,IAAI,CAAC,QAAQ,4BAA4B,CAAC,WAAW,EAAE,eAAe,CAAC,IAAI,CAAC,qCAAqC,EAC7P,EAAE,KAAK,EAAE,CAAC,eAAe,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,EAAE,CACxD,CACF,CAAC;QACF,OAAO;IACT,CAAC;IAGD,IAAI,qBAAqB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,oBAAoB,CAAC,EAAE,CAAC;QAC1E,OAAO;IACT,CAAC;IACD,qBAAqB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;IAEtE,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;QAC7B,OAAO;IACT,CAAC;IAED,MAAM,oBAAoB,GAAG,qBAAqB,CAChD,iBAAiB,EACjB,WAAW,EACX,SAAS,CACV,CAAC;IACF,MAAM,0BAA0B,GAAG,kBAAkB,CACnD,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,eAAe,CAAC,KAAK,CACtB,CAAC;IACF,MAAM,oBAAoB,GAAG,qBAAqB,CAChD,iBAAiB,EACjB,WAAW,EACX,SAAS,CACV,CAAC;IACF,MAAM,0BAA0B,GAAG,kBAAkB,CACnD,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,eAAe,CAAC,KAAK,CACtB,CAAC;IAIF,uBAAuB,CACrB,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,oBAAoB,EACpB,eAAe,CAAC,KAAK,EACrB,oBAAoB,EACpB,eAAe,CAAC,KAAK,CACtB,CAAC;IAIF,KAAK,MAAM,yBAAyB,IAAI,0BAA0B,EAAE,CAAC;QACnE,gCAAgC,CAC9B,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,eAAe,EACf,yBAAyB,CAC1B,CAAC;IACJ,CAAC;IAID,KAAK,MAAM,yBAAyB,IAAI,0BAA0B,EAAE,CAAC;QACnE,gCAAgC,CAC9B,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,yBAAyB,EACzB,eAAe,CAChB,CAAC;IACJ,CAAC;AACH,CAAC;AAKD,SAAS,oCAAoC,CAC3C,iBAAoC,EACpC,WAAwB,EACxB,oBAA6B,EAC7B,WAAoC,EACpC,aAA+B,EAC/B,MAAiC,EACjC,WAAoC,EACpC,aAA+B,EAC/B,MAAiC;IAEjC,MAAM,SAAS,GAAoB,EAAE,CAAC;IAEtC,MAAM,oBAAoB,GAAG,aAAa,CACxC,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,aAAa,CACd,CAAC;IACF,MAAM,gBAAgB,GAAG,kBAAkB,CACzC,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,MAAM,CACP,CAAC;IACF,MAAM,oBAAoB,GAAG,aAAa,CACxC,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,aAAa,CACd,CAAC;IACF,MAAM,gBAAgB,GAAG,kBAAkB,CACzC,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,MAAM,CACP,CAAC;IAGF,uBAAuB,CACrB,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,oBAAoB,EACpB,MAAM,EACN,oBAAoB,EACpB,MAAM,CACP,CAAC;IAIF,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;QAC/C,wCAAwC,CACtC,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,oBAAoB,EACpB,MAAM,EACN,eAAe,CAChB,CAAC;IACJ,CAAC;IAID,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;QAC/C,wCAAwC,CACtC,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,oBAAoB,EACpB,MAAM,EACN,eAAe,CAChB,CAAC;IACJ,CAAC;IAKD,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;QAC/C,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;YAC/C,gCAAgC,CAC9B,iBAAiB,EACjB,WAAW,EACX,SAAS,EACT,oBAAoB,EACpB,eAAe,EACf,eAAe,CAChB,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAGD,SAAS,sBAAsB,CAC7B,iBAAoC,EACpC,WAAwB,EACxB,SAA0B,EAC1B,mBAAwC,EACxC,KAAgC;IAMhC,KAAK,MAAM,CACT,YAAY,EACZ,gBAAgB,EACjB,IAAI,mBAAmB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;QAInD,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrD,MAAM,QAAQ,GAAG,YAAY,CAC3B,iBAAiB,EACjB,WAAW,EACX,KAAK,EACL,YAAY,EACZ,gBAAgB,CAAC,CAAC,CAAC,EACnB,KAAK,EACL,gBAAgB,CAAC,CAAC,CAAC,EACnB,KAAK,CACN,CAAC;oBACF,IAAI,QAAQ,EAAE,CAAC;wBACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAOD,SAAS,uBAAuB,CAC9B,iBAAoC,EACpC,WAAwB,EACxB,SAA0B,EAC1B,gCAAyC,EACzC,oBAAyC,EACzC,MAAiC,EACjC,oBAAyC,EACzC,MAAiC;IAEjC,IACE,oBAAoB,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC;QAC/C,oBAAoB,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC,EAC/C,CAAC;QACD,OAAO;IACT,CAAC;IAMD,KAAK,MAAM,EACT,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,GAClB,IAAI,oBAAoB,CACvB,WAAW,EACX,oBAAoB,EACpB,oBAAoB,CACrB,EAAE,CAAC;QACF,KAAK,MAAM,aAAa,IAAI,iBAAiB,EAAE,CAAC;YAC9C,KAAK,MAAM,aAAa,IAAI,iBAAiB,EAAE,CAAC;gBAC9C,MAAM,QAAQ,GAAG,YAAY,CAC3B,iBAAiB,EACjB,WAAW,EACX,gCAAgC,EAChC,YAAY,EACZ,aAAa,EACb,MAAM,EACN,aAAa,EACb,MAAM,CACP,CAAC;gBACF,IAAI,QAAQ,EAAE,CAAC;oBACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAC3B,WAAwB,EACxB,oBAAyC,EACzC,oBAAyC;IAIzC,MAAM,qBAAqB,GAAG,CAAC,oBAAoB,CAAC,iBAAiB;QACnE,IAAI,GAAG,EAAE,CAAC,CAAC;IACb,MAAM,MAAM,GAAG,qBAAqB,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IAC/D,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,iBAAiB,GAA6B,EAAE,CAAC;IACvD,KAAK,MAAM,CACT,YAAY,EACZ,iBAAiB,EAClB,IAAI,oBAAoB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;QAEpD,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,iBAAiB,GACrB,oBAAoB,CAAC,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACzD,IAAI,iBAAiB,IAAI,IAAI,EAAE,CAAC;YAC9B,iBAAiB,CAAC,IAAI,CAAC;gBACrB,YAAY;gBACZ,iBAAiB;gBACjB,iBAAiB;aAClB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,qBAAqB,CAAC,GAAG,CAAC,oBAAoB,EAAE,iBAAiB,CAAC,CAAC;IACnE,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAID,SAAS,YAAY,CACnB,iBAAoC,EACpC,WAAwB,EACxB,gCAAyC,EACzC,YAAoB,EACpB,aAA2B,EAC3B,MAAiC,EACjC,aAA2B,EAC3B,MAAiC;IAEjC,MAAM,EACJ,UAAU,EAAE,WAAW,EACvB,IAAI,EAAE,KAAK,EACX,UAAU,EAAE,IAAI,EAChB,eAAe,EAAE,gBAAgB,GAClC,GAAG,aAAa,CAAC;IAClB,MAAM,EACJ,UAAU,EAAE,WAAW,EACvB,IAAI,EAAE,KAAK,EACX,UAAU,EAAE,IAAI,EAChB,eAAe,EAAE,gBAAgB,GAClC,GAAG,aAAa,CAAC;IAUlB,MAAM,oBAAoB,GACxB,gCAAgC;QAChC,CAAC,WAAW,KAAK,WAAW;YAC1B,YAAY,CAAC,WAAW,CAAC;YACzB,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;IAG/B,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACtC,IACE,aAAa,CAAC,YAAY;QAC1B,aAAa,CAAC,YAAY;QAC1B,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,IAAI;QACzB,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,EACrC,CAAC;QACD,OAAO;IACT,CAAC;IACD,MAAM,UAAU,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;IAC/C,IAAI,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACxD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,UAAU,GAAG,EAAE,CAAC;QAChB,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACrD,CAAC;IAED,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAE1B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAE/B,MAAM,QAAQ,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO;gBACL,YAAY;gBACZ,MAAM,EAAE,IAAI,eAAe,CAAC,KAAK,CAAC,UAAU,eAAe,CAAC,KAAK,CAAC,wBAAwB;gBAC1F,OAAO,EAAE,CAAC,KAAK,CAAC;gBAChB,OAAO,EAAE,CAAC,KAAK,CAAC;aACjB,CAAC;QACJ,CAAC;QAGD,MAAM,iBAAiB,GAAG,CAAC,UAAU,CAAC,SAAS,KAAK,gBAAgB,CAClE,WAAW,EACX,UAAU,CAAC,SAAS,EACpB,UAAU,CAAC,SAAS,CACrB,CAAC,CAAC;QACH,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACnE,OAAO;gBACL,YAAY;gBACZ,MAAM,EAAE,+BAA+B;gBACvC,OAAO,EAAE,CAAC,KAAK,CAAC;gBAChB,OAAO,EAAE,CAAC,KAAK,CAAC;aACjB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,IAAI,gBAAgB,IAAI,gBAAgB,EAAE,CAAC;QACzC,IAAI,MAAM,GAAG,yCAAyC,CAAC;QACvD,IAAI,gBAAgB,IAAI,gBAAgB,EAAE,CAAC;YACzC,MAAM,iBAAiB,GAAG,CAAC,UAAU,CAAC,eAAe;gBACnD,gBAAgB,CACd,WAAW,EACX,UAAU,CAAC,eAAe,EAC1B,UAAU,CAAC,eAAe,CAC3B,CAAC,CAAC;YACL,IAAI,aAAa,CAAC,WAAW,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBAElE,MAAM;oBACJ,kEAAkE,CAAC;YACvE,CAAC;QACH,CAAC;QACD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;IACtE,CAAC;IAGD,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,CAAC;IACzB,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,CAAC;IAEzB,IAAI,KAAK,IAAI,KAAK,IAAI,eAAe,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;QACjE,MAAM,WAAW,GAAG,CAAC,UAAU,CAAC,UAAU,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,CAAC,UAAU,CAAC,UAAU,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,OAAO;YACL,YAAY;YACZ,MAAM,EAAE,kCAAkC,WAAW,UAAU,WAAW,GAAG;YAC7E,OAAO,EAAE,CAAC,KAAK,CAAC;YAChB,OAAO,EAAE,CAAC,KAAK,CAAC;SACjB,CAAC;IACJ,CAAC;IAKD,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC;IACzC,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC;IACzC,IAAI,aAAa,IAAI,aAAa,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,oCAAoC,CACpD,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,UAAU,CAAC,SAAS,EACpB,aAAa,EACb,MAAM,EACN,UAAU,CAAC,SAAS,EACpB,aAAa,EACb,MAAM,CACP,CAAC;QACF,OAAO,iBAAiB,CAAC,SAAS,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAGD,SAAS,YAAY,CAAC,YAA0B;IAC9C,OAAO,CAAC,YAAY,CAAC,IAAI,KAAK;QAC5B,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,SAAS,EAAE,YAAY,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC;QACtD,SAAS,EAAE,eAAe,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC;QACvD,eAAe,EAAE,eAAe,CAAC,YAAY,CAAC,eAAe,EAAE,SAAS,CAAC;KAC1E,CAAC,CAAC;AACL,CAAC;AAED,SAAS,eAAe,CACtB,IAA+B;IAE/B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO;IACT,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IACD,OAAO;QACL,KAAK,EAAE,IAAI;QACX,MAAM;KACP,CAAC;AACJ,CAAC;AAID,SAAS,gBAAgB,CACvB,WAAwB,EACxB,aAAuC,EACvC,aAAuC;IAEvC,MAAM,mBAAmB,GAAqB,EAAE,CAAC;IACjD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO;YACL,aAAa,EAAE,aAAa,KAAK,SAAS;YAC1C,mBAAmB;SACpB,CAAC;IACJ,CAAC;IACD,IAAI,aAAa,CAAC,KAAK,CAAC,MAAM,KAAK,aAAa,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/D,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;IACvD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,EAAE,CAAC;QAEvC,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;QACvD,CAAC;QACD,MAAM,UAAU,GAAG,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,IACE,UAAU,CAAC,aAAa;YACxB,YAAY,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,aAAa,EAC/C,CAAC;YACD,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;QACvD,CAAC;QACD,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,mBAAmB,EAAE,CAAC;AACtD,CAAC;AAED,SAAS,aAAa,CACpB,WAAwB,EACxB,UAA8B,EAC9B,MAAiC,EACjC,MAAiC;IAEjC,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IAGD,OAAO,CACL,MAAM,KAAK,MAAM;QACjB,UAAU,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YAE7C,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACtC,OAAO,CACL,CAAC,kBAAkB,CAAC,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC;gBAC/C,CAAC,kBAAkB,CAAC,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC,CAChD,CAAC;QACJ,CAAC,CAAC,CACH,CAAC;AACJ,CAAC;AAQD,SAAS,kBAAkB,CACzB,WAAwB,EACxB,KAAgB,EAChB,KAAgC;IAEhC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,YAAY,GAAG,CAAC,KAAK,CAAC,iBAAiB,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE;QAEvD,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC,SAAS,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IACH,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAClD,OAAO,cAAc,CAAC;AACxB,CAAC;AAGD,SAAS,YAAY,CAAC,WAAwB,EAAE,KAAgB;IAC9D,MAAM,MAAM,GAAG,WAAW,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAa,EAAE,EAAE;QAClE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,IAAI,CAAC,QAAQ;gBAChB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,MAAM;gBACd,OAAO;oBACL,IAAI,CAAC,IAAI;oBACT,IAAI,CAAC,MAAM;yBACR,KAAK,EAAE;yBACP,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CACtB,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK;wBAClC,CAAC,CAAC,CAAC,CAAC;wBACJ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK;4BACpC,CAAC,CAAC,CAAC;4BACH,CAAC,CAAC,CAAC,CACR;iBACJ,CAAC;YACJ,KAAK,IAAI,CAAC,YAAY;gBACpB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,KAAK,IAAI,CAAC,IAAI;gBACZ,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAClC,KAAK,IAAI,CAAC,MAAM;gBACd,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;YACtD;gBACE,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;IAC/C,WAAW,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAClD,OAAO,SAAS,CAAC;AACnB,CAAC;AAKD,SAAS,eAAe,CACtB,WAAwB,EACxB,KAAwB,EACxB,KAAwB;IAExB,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACtC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,UAAU,CAAC,KAAK,CAAC;YACtB,CAAC,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;YAC1D,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IACD,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,aAAa,CAAC,KAAK,CAAC;YACzB,CAAC,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;YAC1D,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IACD,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,KAAK,KAAK,KAAK,CAAC;IACzB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAMD,SAAS,aAAa,CACpB,iBAAoC,EACpC,WAAwB,EACxB,UAAmC,EACnC,YAA8B;IAE9B,MAAM,EAAE,0BAA0B,EAAE,GAAG,WAAW,CAAC;IAGnD,IAAI,cAAc,GAAG,0BAA0B,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAChE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,0BAA0B,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,mBAAmB,GAAG,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC3D,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACzB,MAAM,eAAe,GAAoB,IAAI,GAAG,EAAE,CAAC;QACnD,MAAM,OAAO,GAA8B,EAAE,CAAC;QAC9C,iBAAiB,CACf,iBAAiB,EACjB,UAAU,EACV,YAAY,EACZ,eAAe,EACf,OAAO,CACR,CAAC;QACF,mBAAmB,GAAG,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;QACnD,cAAc,CAAC,GAAG,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAID,SAAS,qBAAqB,CAC5B,iBAAoC,EACpC,WAAwB,EACxB,QAAgC;IAEhC,MAAM,YAAY,GAAG,WAAW,CAC9B,iBAAiB,CAAC,SAAS,EAAE,EAC7B,QAAQ,CAAC,aAAa,CACvB,CAAC;IACF,OAAO,aAAa,CAClB,iBAAiB,EACjB,WAAW,EACX,YAAY,EACZ,QAAQ,CAAC,YAAY,CACtB,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CACxB,iBAAoC,EACpC,UAAmC,EACnC,YAA8B,EAC9B,eAAgC,EAChC,eAA0C;IAE1C,KAAK,MAAM,SAAS,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;QAChD,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChB,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;gBACvC,IAAI,QAAQ,CAAC;gBACb,IAAI,YAAY,CAAC,UAAU,CAAC,IAAI,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC5D,QAAQ,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC,SAAS,CAAC,CAAC;gBAC/C,CAAC;gBACD,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK;oBAClC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK;oBACvB,CAAC,CAAC,SAAS,CAAC;gBAEd,IAAI,gBAAgB,GAAG,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACzD,IAAI,gBAAgB,IAAI,IAAI,EAAE,CAAC;oBAC7B,gBAAgB,GAAG,EAAE,CAAC;oBACtB,eAAe,CAAC,GAAG,CAAC,YAAY,EAAE,gBAAgB,CAAC,CAAC;gBACtD,CAAC;gBACD,MAAM,eAAe,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,CAChD,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,KAAK,QAAQ,CACjD,CAAC;gBACF,gBAAgB,CAAC,IAAI,CAAC;oBACpB,UAAU;oBACV,IAAI,EAAE,SAAS;oBACf,UAAU,EAAE,QAAQ;oBACpB,YAAY,EACV,CAAC,SAAS,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC;wBACxC,CAAC,SAAS,CAAC,YAAY;wBACvB,eAAe,KAAK,SAAS;oBAC/B,eAAe;iBAChB,CAAC,CAAC;gBACH,MAAM;YACR,CAAC;YACD,KAAK,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;gBAC1B,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAChC,MAAM;YACR,CAAC;YACD,KAAK,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;gBAC1B,MAAM,aAAa,GAAG,SAAS,CAAC,aAAa,CAAC;gBAC9C,MAAM,kBAAkB,GAAG,aAAa;oBACtC,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,SAAS,EAAE,EAAE,aAAa,CAAC;oBAC3D,CAAC,CAAC,UAAU,CAAC;gBACf,iBAAiB,CACf,iBAAiB,EACjB,kBAAkB,EAClB,SAAS,CAAC,YAAY,EACtB,eAAe,EACf,eAAe,CAChB,CAAC;gBACF,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAGD,SAAS,kBAAkB,CACzB,iBAAoC,EACpC,WAAwB,EACxB,mBAAwC,EACxC,KAAgC;IAEhC,MAAM,OAAO,GAAG,CAAC,mBAAmB,CAAC,OAAO,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAG3B,CAAC;IACJ,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,KAAK,MAAM,UAAU,IAAI,mBAAmB,CAAC,OAAO,EAAE,CAAC;QACrD,MAAM,MAAM,GAAG,iBAAiB,CAC9B,iBAAiB,EACjB,WAAW,EACX,UAAU,EACV,KAAK,CACN,CAAC;QACF,IAAI,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;YACzB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACrD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YAEN,QAAQ,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC3B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CACxB,iBAAoC,EACpC,WAAwB,EACxB,kBAAsC,EACtC,KAAgC;IAGhC,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACtC,IAAI,kBAAkB,GACpB,WAAW,CAAC,wBAAwB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAC/D,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,iBAAiB,CAAC,0BAA0B,EAAE,CAC9D,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAC9B,CAAC;QACF,MAAM,YAAY,GAAG,eAAe,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QACnE,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,IAAI,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;YAEnC,MAAM,KAAK,GAAkB,EAAE,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjC,IAAI,SAAS,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC5C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBAChC,MAAM,QAAQ,GAAG,YAAY,CAC3B,WAAW,EACX,MAAM,CAAC,GAAG,CAAC,IAAI,CAAc,CAC9B,CAAC;gBACF,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC;gBACzC,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACpC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,qBAAqB,GAAG,IAAI,CAAC,SAAS,CAAC;YAC3C,SAAS,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK;YAChC,KAAK;SACN,CAAC,CAAC;QACH,kBAAkB,GAAG,WAAW,CAAC,uBAAuB,CAAC,GAAG,CAC1D,qBAAqB,CACtB,CAAC;QACF,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;YACrC,kBAAkB,GAAG;gBACnB,SAAS;gBACT,MAAM;gBACN,OAAO,EAAE,IAAI,GAAG,EAAE;aACnB,CAAC;YACF,WAAW,CAAC,uBAAuB,CAAC,GAAG,CACrC,qBAAqB,EACrB,kBAAkB,CACnB,CAAC;QACJ,CAAC;QACD,WAAW,CAAC,wBAAwB,CAAC,GAAG,CACtC,kBAAkB,EAClB,kBAAkB,CACnB,CAAC;IACJ,CAAC;IAID,MAAM,aAAa,GAAG,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE;QAE7D,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO,kBAAkB,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC;QACA,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,SAAS,CAAC;IACd,IAAI,aAAa,GAAG,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAClE,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;QACnD,aAAa,GAAG,gBAAgB,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAC/D,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO;QACL,IAAI,EAAE,kBAAkB;QACxB,KAAK,EAAE,aAAa;QACpB,UAAU,EAAE,kBAAkB,CAAC,SAAS,EAAE,UAAU;KACrD,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACvB,iBAA2C;IAE3C,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,mBAAmB,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3E,OAAO;IACT,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,4BAA4B,CACnC,WAAwB,EACxB,IAAwB;IAExB,MAAM,WAAW,GAAG;QAClB,GAAG,IAAI;QACP,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QAC/D,UAAU,EAAE,EAAE;KACf,CAAC;IAEF,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;QAC5C,IAAI;YACF,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;gBAC1B,YAAY,CAAC,WAAW,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC;QACjE,IAAI,IAAI,GAAG,0BAA0B,EAAE,CAAC;YACtC,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAID,SAAS,iBAAiB,CACxB,SAAkC,EAClC,YAAoB,EACpB,KAAgB,EAChB,KAAgB;IAEhB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAGzB,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YACvD,OAAO;gBACL,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;oBAC/B,cAAc,eAAe,CAAC,IAAI,CAAC,sBAAsB,MAAM,EAAE,CAAC;YACpE,IAAI,OAAO,CAAC,MAAM,GAAG,0BAA0B,EAAE,CAAC;gBAChD,MAAM;YACR,CAAC;QACH,CAAC;QACD,OAAO;YACL,YAAY;YACZ,MAAM,EAAE,eAAe,CAAC,OAAO,CAAC;YAChC,OAAO,EAAE,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC;YAC1D,OAAO,EAAE,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC;SAC3D,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAC3B,IAAe,EACf,SAAkC,EAClC,IAA2B;IAE3B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,SAAS,GAAG,kBAAkB,GAAG,KAAK,CAAC,MAAM,CAAC;QAGpD,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC;QACvD,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QAC7B,IAAI,KAAK,CAAC,MAAM,KAAK,kBAAkB,EAAE,CAAC;YACxC,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,eAAe,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,MAAM,GAAG,0BAA0B;QAC7C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,0BAA0B,CAAC,GAAG,KAAK;QACnD,CAAC,CAAC,IAAI,CAAC;AACX,CAAC;AAED,SAAS,qBAAqB,CAAC,WAAwB,EAAE,IAAY;IACnE,WAAW,CAAC,yBAAyB,IAAI,IAAI,CAAC;IAE9C,IAAI,WAAW,CAAC,yBAAyB,GAAG,CAAC,EAAE,CAAC;QAC9C,MAAM,sBAAsB,CAAC;IAC/B,CAAC;AACH,CAAC;AAWD,MAAM,cAAc;IAGlB;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,CAAI,EAAE,CAAI,EAAE,aAAsB;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,KAAK,MAAM,CAAC;IACzD,CAAC;IAED,GAAG,CAAC,CAAI,EAAE,CAAI,EAAE,aAAsB;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;CACF;AAQD,MAAM,OAAO;IAGX;QACE,IAAI,CAAC,eAAe,GAAG,IAAI,cAAc,EAAE,CAAC;IAC9C,CAAC;IAED,GAAG,CAAC,CAAI,EAAE,CAAI,EAAE,aAAsB;QACpC,OAAO,CACL,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC;YAC7C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAC9C,CAAC;IACJ,CAAC;IAED,GAAG,CAAC,CAAI,EAAE,CAAI,EAAE,aAAsB;QACpC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IAChD,CAAC;CACF","sourcesContent":["/** @category Validation Rules */\n\nimport { inspect } from '../../jsutils/inspect.ts';\nimport type { Maybe } from '../../jsutils/Maybe.ts';\n\nimport { GraphQLError } from '../../error/GraphQLError.ts';\n\nimport type {\n  ArgumentNode,\n  DirectiveNode,\n  FieldNode,\n  FragmentArgumentNode,\n  FragmentDefinitionNode,\n  FragmentSpreadNode,\n  SelectionSetNode,\n  ValueNode,\n} from '../../language/ast.ts';\nimport { isNode } from '../../language/ast.ts';\nimport { Kind } from '../../language/kinds.ts';\nimport { print } from '../../language/printer.ts';\nimport type { ASTVisitor } from '../../language/visitor.ts';\n\nimport type {\n  GraphQLField,\n  GraphQLNamedType,\n  GraphQLOutputType,\n} from '../../type/definition.ts';\nimport {\n  getNamedType,\n  isInterfaceType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n} from '../../type/definition.ts';\n\nimport { typeFromAST } from '../../utilities/typeFromAST.ts';\nimport type { FragmentSignature } from '../../utilities/TypeInfo.ts';\n\nimport { validationAbortedError } from '../validationAbortedError.ts';\nimport type { ValidationContext } from '../ValidationContext.ts';\n\n/* eslint-disable max-params */\n// This file contains a lot of such errors but we plan to refactor it anyway\n// so just disable it for entire file.\n\n// Keep diagnostic detail bounded independently of document size.\nconst MAX_CONFLICT_DETAIL_LENGTH = 1000;\nconst MAX_CONFLICT_NODES = 20;\nconst MAX_FRAGMENT_ARGUMENT_SIZE = 256;\n\n// Meter work that can grow through repeated comparisons and fragment scopes.\n// Collecting a selection set's fields is shared across scopes and is not charged.\nconst MAX_COMPLEXITY_BUDGET = 500_000;\n\n/**\n * Overlapping fields can be merged\n *\n * A selection set is only valid if all fields (including spreading any\n * fragments) either correspond to distinct response names or can be merged\n * without ambiguity.\n *\n * See https://spec.graphql.org/draft/#sec-Field-Selection-Merging\n * @param validationContext - The validation context used while checking the document.\n * @returns A visitor that reports validation errors for this rule.\n * @example\n * ```ts\n * import { buildSchema, parse, validate } from 'graphql';\n * import { OverlappingFieldsCanBeMergedRule } from 'graphql/validation';\n *\n * const schema = buildSchema(`\n *   type Query {\n *     dog: Dog\n *   }\n *\n *   type Dog {\n *     name: String\n *     barkVolume: Int\n *   }\n * `);\n *\n * const invalidDocument = parse(`\n *   { dog { value: barkVolume value: name } }\n * `);\n * const invalidErrors = validate(schema, invalidDocument, [\n *   OverlappingFieldsCanBeMergedRule,\n * ]);\n *\n * invalidErrors.length; // => 1\n *\n * const validDocument = parse(`\n *   { dog { barkVolume name } }\n * `);\n * const validErrors = validate(schema, validDocument, [\n *   OverlappingFieldsCanBeMergedRule,\n * ]); // => []\n * ```\n */\nexport function OverlappingFieldsCanBeMergedRule(\n  validationContext: ValidationContext,\n): ASTVisitor {\n  const ruleContext: RuleContext = {\n    // A memoization for when fields and a fragment or two fragments are compared\n    // \"between\" each other for conflicts. Comparisons may be made many times,\n    // so memoizing this can dramatically improve the performance of this validator.\n    comparedFieldsAndFragmentPairs: new Map(),\n    comparedFragmentPairs: new Map(),\n\n    // A cache for the \"field map\" and list of fragment spreads found in any given\n    // selection set.\n    cachedCollectFieldsResults: new Map(),\n    valueInfoByNode: new Map(),\n    fragmentSpreadInfoByNode: new Map(),\n    fragmentSpreadInfoByKey: new Map(),\n    remainingComplexityBudget: MAX_COMPLEXITY_BUDGET,\n  };\n  let fragmentScope: VariableScope | undefined;\n\n  return {\n    FragmentDefinition: {\n      enter(node) {\n        const fragmentName = node.name.value;\n        const fragmentSignature =\n          validationContext.getFragmentSignatureByName()(fragmentName);\n        fragmentScope = getVariableScope(fragmentSignature);\n      },\n      leave() {\n        fragmentScope = undefined;\n      },\n    },\n    SelectionSet(selectionSet, _key, parent) {\n      // Inline fragments are flattened into their enclosing response level.\n      // Their fields' own selection sets are still visited independently.\n      if (parent && 'kind' in parent && parent.kind === Kind.INLINE_FRAGMENT) {\n        return;\n      }\n      if (\n        selectionSet.selections.length <= 1 &&\n        selectionSet.selections[0]?.kind !== Kind.INLINE_FRAGMENT\n      ) {\n        return;\n      }\n      const conflicts = findConflictsWithinSelectionSet(\n        validationContext,\n        ruleContext,\n        validationContext.getParentType(),\n        selectionSet,\n        fragmentScope,\n      );\n      for (const { responseName, reason, fields1, fields2 } of conflicts) {\n        validationContext.reportError(\n          new GraphQLError(\n            `Fields \"${maybeAbbreviate(responseName)}\" conflict because ${reason}. Use different aliases on the fields to fetch both if this was intentional.`,\n            { nodes: fields1.concat(fields2) },\n          ),\n        );\n      }\n    },\n  };\n}\n\ninterface Conflict {\n  responseName: string;\n  reason: string;\n  fields1: Array<FieldNode>;\n  fields2: Array<FieldNode>;\n}\n// A field node and its definition in the parent-type context.\ninterface FieldDetails {\n  parentType: Maybe<GraphQLNamedType>;\n  node: FieldNode;\n  definition: Maybe<GraphQLField<unknown, unknown>>;\n  info?: FieldInfo;\n  isSimpleLeaf: boolean;\n  streamDirective: DirectiveNode | undefined;\n}\ninterface FieldInfo {\n  comparisons: Map<FieldInfo, FieldComparison>;\n  namedType: Maybe<GraphQLNamedType>;\n  arguments: ArgumentInfo | undefined;\n  streamArguments: ArgumentInfo | undefined;\n  typeString?: string;\n}\ninterface FieldComparison {\n  sameName?: boolean;\n  arguments?: ArgumentComparison;\n  streamArguments?: ArgumentComparison;\n}\ninterface ArgumentComparison {\n  sameStructure: boolean;\n  valuesWithVariables: ReadonlyArray<ValueInfo>;\n}\ntype FieldDetailsList = Array<FieldDetails>;\ntype GroupedFieldSet = Map<string, FieldDetailsList>;\ninterface OverlappingFields {\n  responseName: string;\n  fieldDetailsList1: FieldDetailsList;\n  fieldDetailsList2: FieldDetailsList;\n}\n// Equivalent spreads share a scope. The signature identifies declarations;\n// object identity distinguishes scopes with different fragment arguments.\ninterface VariableScope {\n  signature: FragmentSignature;\n}\ninterface FragmentSpread {\n  node: FragmentSpreadNode;\n  scope: VariableScope | undefined;\n  definition: FragmentDefinitionNode | undefined;\n}\ntype FragmentSpreads = ReadonlyArray<FragmentSpread>;\n\ninterface CollectFieldsResult {\n  groupedFieldSet: GroupedFieldSet;\n  spreads: ReadonlyArray<FragmentSpreadNode>;\n  byScope?: Map<VariableScope | undefined, FragmentSpreads>;\n  overlappingFields?: Map<CollectFieldsResult, Array<OverlappingFields>>;\n}\ntype ArgumentNodes =\n  | ReadonlyArray<ArgumentNode>\n  | ReadonlyArray<FragmentArgumentNode>;\ninterface ArgumentInfo {\n  nodes: ArgumentNodes;\n  values: Map<string, ValueNode>;\n}\ninterface FragmentSpreadInfo {\n  signature: Maybe<FragmentSignature>;\n  values: ReadonlyArray<ValueInfo>;\n  // Cache the resulting fragment scope by the arguments' enclosing scope.\n  // An undefined key means no local references; an undefined value means\n  // the target fragment declares no variables.\n  byScope: Map<VariableScope | undefined, VariableScope | undefined>;\n}\ninterface RuleContext {\n  comparedFieldsAndFragmentPairs: Map<\n    VariableScope | undefined,\n    Map<\n      VariableScope | undefined,\n      OrderedPairSet<CollectFieldsResult, FragmentDefinitionNode | undefined>\n    >\n  >;\n  comparedFragmentPairs: Map<\n    VariableScope | undefined,\n    Map<VariableScope | undefined, PairSet<FragmentDefinitionNode | undefined>>\n  >;\n  cachedCollectFieldsResults: Map<\n    Maybe<GraphQLNamedType>,\n    Map<SelectionSetNode, CollectFieldsResult>\n  >;\n  valueInfoByNode: Map<ValueNode, ValueInfo>;\n  fragmentSpreadInfoByNode: Map<FragmentSpreadNode, FragmentSpreadInfo>;\n  fragmentSpreadInfoByKey: Map<string, FragmentSpreadInfo>;\n  remainingComplexityBudget: number;\n}\n\n/**\n * Find all conflicts found \"within\" a selection set, including those found\n * via spreading in fragments. Inline-fragment selection sets are included in\n * their enclosing collection.\n *\n * Algorithm:\n *\n * Conflicts occur when two fields exist in a query which will produce the same\n * response name, but represent differing values, thus creating a conflict.\n * The algorithm below finds all conflicts via making a series of comparisons\n * between fields. In order to compare as few fields as possible, this makes\n * a series of comparisons \"within\" sets of fields and \"between\" sets of fields.\n *\n * Given any selection set, a collection produces both a set of fields by\n * also including all inline fragments, as well as a list of fragments\n * referenced by fragment spreads.\n *\n * A) Each selection set represented in the document first compares \"within\" its\n * collected set of fields, finding any conflicts between every pair of\n * overlapping fields.\n * Note: This is the *only time* that the fields \"within\" a set are compared\n * to each other. After this only fields \"between\" sets are compared.\n *\n * B) Also, if any fragment is referenced in a selection set, then a\n * comparison is made \"between\" the original set of fields and the\n * referenced fragment.\n *\n * C) Also, if multiple fragments are referenced, then comparisons\n * are made \"between\" each referenced fragment.\n *\n * D) When comparing \"between\" a set of fields and a referenced fragment, first\n * a comparison is made between each field in the original set of fields and\n * each field in the referenced set of fields.\n *\n * E) Also, if any fragment is referenced in the referenced selection set,\n * then a comparison is made \"between\" the original set of fields and the\n * referenced fragment (recursively referring to step D).\n *\n * F) When comparing \"between\" two fragments, first a comparison is made between\n * each field in the first referenced set of fields and each field in the\n * second referenced set of fields.\n *\n * G) Also, any fragments referenced by the first must be compared to the\n * second, and any fragments referenced by the second must be compared to the\n * first (recursively referring to step F).\n *\n * H) When comparing two fields, if both have selection sets, then a comparison\n * is made \"between\" both selection sets, first comparing the set of fields in\n * the first selection set with the set of fields in the second.\n *\n * I) Also, if any fragment is referenced in either selection set, then a\n * comparison is made \"between\" the other set of fields and the\n * referenced fragment.\n *\n * J) Also, if two fragments are referenced in both selection sets, then a\n * comparison is made \"between\" the two fragments.\n *\n * @internal\n */\nfunction findConflictsWithinSelectionSet(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  parentType: Maybe<GraphQLNamedType>,\n  selectionSet: SelectionSetNode,\n  scope: VariableScope | undefined,\n): Array<Conflict> {\n  const conflicts: Array<Conflict> = [];\n\n  const collectFieldsResult = collectFields(\n    validationContext,\n    ruleContext,\n    parentType,\n    selectionSet,\n  );\n\n  // (A) Find find all conflicts \"within\" the fields and f of this selection set.\n  // Note: this is the *only place* `collectConflictsWithin` is called.\n  collectConflictsWithin(\n    validationContext,\n    ruleContext,\n    conflicts,\n    collectFieldsResult,\n    scope,\n  );\n\n  // Prepare fragment uses only for comparisons with fields or another spread.\n  if (\n    collectFieldsResult.spreads.length !== 0 &&\n    (collectFieldsResult.groupedFieldSet.size !== 0 ||\n      collectFieldsResult.spreads.length > 1)\n  ) {\n    const fragmentSpreads = getFragmentSpreads(\n      validationContext,\n      ruleContext,\n      collectFieldsResult,\n      scope,\n    );\n    // (B) Then collect conflicts between these fields and those represented by\n    // each spread found.\n    for (let i = 0; i < fragmentSpreads.length; i++) {\n      collectConflictsBetweenFieldsAndFragment(\n        validationContext,\n        ruleContext,\n        conflicts,\n        false,\n        collectFieldsResult,\n        scope,\n        fragmentSpreads[i],\n      );\n      // (C) Then compare this fragment with all other fragments found in this\n      // selection set to collect conflicts between fragments spread together.\n      // This compares each item in the list of fragment spreads to every other\n      // item in that same list (except for itself).\n      for (let j = i + 1; j < fragmentSpreads.length; j++) {\n        collectConflictsBetweenFragments(\n          validationContext,\n          ruleContext,\n          conflicts,\n          false,\n          fragmentSpreads[i],\n          fragmentSpreads[j],\n        );\n      }\n    }\n  }\n  return conflicts;\n}\n\n// Collect all conflicts found between a set of fields and a fragment reference\n// including via spreading in any nested fragments.\nfunction collectConflictsBetweenFieldsAndFragment(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  conflicts: Array<Conflict>,\n  areMutuallyExclusive: boolean,\n  collectFieldsResult: CollectFieldsResult,\n  scope: VariableScope | undefined,\n  fragmentSpread: FragmentSpread,\n): void {\n  // Callers can enumerate more field-map/fragment pairs than document nodes.\n  // Count attempts even when an empty collection or the pair cache skips them.\n  spendComplexityBudget(ruleContext, 1);\n\n  if (collectFieldsResult.groupedFieldSet.size === 0) {\n    return;\n  }\n\n  // Fields and fragments can each be compared in different variable scopes.\n  // Keep a separate pair history for each pair of scopes.\n  const fragment = fragmentSpread.definition;\n  let byFragmentScope = ruleContext.comparedFieldsAndFragmentPairs.get(scope);\n  if (byFragmentScope === undefined) {\n    byFragmentScope = new Map();\n    ruleContext.comparedFieldsAndFragmentPairs.set(scope, byFragmentScope);\n  }\n  let comparedFieldsAndFragmentPairs = byFragmentScope.get(\n    fragmentSpread.scope,\n  );\n  if (comparedFieldsAndFragmentPairs === undefined) {\n    comparedFieldsAndFragmentPairs = new OrderedPairSet();\n    byFragmentScope.set(fragmentSpread.scope, comparedFieldsAndFragmentPairs);\n  }\n\n  // Memoize so the fields and fragments are not compared for conflicts more\n  // than once.\n  if (\n    comparedFieldsAndFragmentPairs.has(\n      collectFieldsResult,\n      fragment,\n      areMutuallyExclusive,\n    )\n  ) {\n    return;\n  }\n  comparedFieldsAndFragmentPairs.add(\n    collectFieldsResult,\n    fragment,\n    areMutuallyExclusive,\n  );\n\n  if (!fragment) {\n    return;\n  }\n\n  const collectFieldsResult2 = collectFragmentFields(\n    validationContext,\n    ruleContext,\n    fragment,\n  );\n  const referencedFragmentSpreads = getFragmentSpreads(\n    validationContext,\n    ruleContext,\n    collectFieldsResult2,\n    fragmentSpread.scope,\n  );\n\n  // Do not compare a selection set to itself in the same variable scope.\n  if (\n    collectFieldsResult === collectFieldsResult2 &&\n    scope === fragmentSpread.scope\n  ) {\n    return;\n  }\n\n  // (D) First collect any conflicts between the provided collection of fields\n  // and the collection of fields represented by the given fragment.\n  collectConflictsBetween(\n    validationContext,\n    ruleContext,\n    conflicts,\n    areMutuallyExclusive,\n    collectFieldsResult,\n    scope,\n    collectFieldsResult2,\n    fragmentSpread.scope,\n  );\n\n  // (E) Then collect any conflicts between the provided collection of fields\n  // and any fragment names found in the given fragment.\n  for (const referencedFragmentSpread of referencedFragmentSpreads) {\n    collectConflictsBetweenFieldsAndFragment(\n      validationContext,\n      ruleContext,\n      conflicts,\n      areMutuallyExclusive,\n      collectFieldsResult,\n      scope,\n      referencedFragmentSpread,\n    );\n  }\n}\n\n// Collect all conflicts found between two fragments, including via spreading in\n// any nested fragments.\nfunction collectConflictsBetweenFragments(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  conflicts: Array<Conflict>,\n  areMutuallyExclusive: boolean,\n  fragmentSpread1: FragmentSpread,\n  fragmentSpread2: FragmentSpread,\n): void {\n  const fragment1 = fragmentSpread1.definition;\n  const fragment2 = fragmentSpread2.definition;\n  const scope1 = fragmentSpread1.scope;\n  const scope2 = fragmentSpread2.scope;\n  // Count attempted fragment pairs, including identity and cache hits.\n  spendComplexityBudget(ruleContext, 2);\n\n  // No need to compare a fragment to itself.\n  if (fragment1 === fragment2 && scope1 === scope2) {\n    return;\n  }\n\n  // Scope pairs share a comparison history indexed by fragment definitions.\n  let byScope = ruleContext.comparedFragmentPairs.get(scope1);\n  let comparedFragmentPairs =\n    byScope?.get(scope2) ??\n    ruleContext.comparedFragmentPairs.get(scope2)?.get(scope1);\n  if (comparedFragmentPairs === undefined) {\n    if (byScope === undefined) {\n      byScope = new Map();\n      ruleContext.comparedFragmentPairs.set(scope1, byScope);\n    }\n    comparedFragmentPairs = new PairSet();\n    byScope.set(scope2, comparedFragmentPairs);\n  }\n\n  if (fragment1 === fragment2) {\n    if (comparedFragmentPairs.has(fragment1, fragment2, false)) {\n      return;\n    }\n    comparedFragmentPairs.add(fragment1, fragment2, false);\n    validationContext.reportError(\n      new GraphQLError(\n        `Spreads \"${maybeAbbreviate(fragmentSpread1.node.name.value)}\" conflict because ${getFragmentSpreadDescription(ruleContext, fragmentSpread1.node)} and ${getFragmentSpreadDescription(ruleContext, fragmentSpread2.node)} have different fragment arguments.`,\n        { nodes: [fragmentSpread1.node, fragmentSpread2.node] },\n      ),\n    );\n    return;\n  }\n\n  // Memoize so two fragments are not compared for conflicts more than once.\n  if (comparedFragmentPairs.has(fragment1, fragment2, areMutuallyExclusive)) {\n    return;\n  }\n  comparedFragmentPairs.add(fragment1, fragment2, areMutuallyExclusive);\n\n  if (!fragment1 || !fragment2) {\n    return;\n  }\n\n  const collectFieldsResult1 = collectFragmentFields(\n    validationContext,\n    ruleContext,\n    fragment1,\n  );\n  const referencedFragmentSpreads1 = getFragmentSpreads(\n    validationContext,\n    ruleContext,\n    collectFieldsResult1,\n    fragmentSpread1.scope,\n  );\n  const collectFieldsResult2 = collectFragmentFields(\n    validationContext,\n    ruleContext,\n    fragment2,\n  );\n  const referencedFragmentSpreads2 = getFragmentSpreads(\n    validationContext,\n    ruleContext,\n    collectFieldsResult2,\n    fragmentSpread2.scope,\n  );\n\n  // (F) First, collect all conflicts between these two collections of fields\n  // (not including any nested fragments).\n  collectConflictsBetween(\n    validationContext,\n    ruleContext,\n    conflicts,\n    areMutuallyExclusive,\n    collectFieldsResult1,\n    fragmentSpread1.scope,\n    collectFieldsResult2,\n    fragmentSpread2.scope,\n  );\n\n  // (G) Then collect conflicts between the first fragment and any nested\n  // fragments spread in the second fragment.\n  for (const referencedFragmentSpread2 of referencedFragmentSpreads2) {\n    collectConflictsBetweenFragments(\n      validationContext,\n      ruleContext,\n      conflicts,\n      areMutuallyExclusive,\n      fragmentSpread1,\n      referencedFragmentSpread2,\n    );\n  }\n\n  // (G) Then collect conflicts between the second fragment and any nested\n  // fragments spread in the first fragment.\n  for (const referencedFragmentSpread1 of referencedFragmentSpreads1) {\n    collectConflictsBetweenFragments(\n      validationContext,\n      ruleContext,\n      conflicts,\n      areMutuallyExclusive,\n      referencedFragmentSpread1,\n      fragmentSpread2,\n    );\n  }\n}\n\n// Find all conflicts found between two selection sets, including those found\n// via spreading in fragments. Called when determining if conflicts exist\n// between the sub-fields of two overlapping fields.\nfunction findConflictsBetweenSubSelectionSets(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  areMutuallyExclusive: boolean,\n  parentType1: Maybe<GraphQLNamedType>,\n  selectionSet1: SelectionSetNode,\n  scope1: VariableScope | undefined,\n  parentType2: Maybe<GraphQLNamedType>,\n  selectionSet2: SelectionSetNode,\n  scope2: VariableScope | undefined,\n): Array<Conflict> {\n  const conflicts: Array<Conflict> = [];\n\n  const collectFieldsResult1 = collectFields(\n    validationContext,\n    ruleContext,\n    parentType1,\n    selectionSet1,\n  );\n  const fragmentSpreads1 = getFragmentSpreads(\n    validationContext,\n    ruleContext,\n    collectFieldsResult1,\n    scope1,\n  );\n  const collectFieldsResult2 = collectFields(\n    validationContext,\n    ruleContext,\n    parentType2,\n    selectionSet2,\n  );\n  const fragmentSpreads2 = getFragmentSpreads(\n    validationContext,\n    ruleContext,\n    collectFieldsResult2,\n    scope2,\n  );\n\n  // (H) First, collect all conflicts between these two collections of field.\n  collectConflictsBetween(\n    validationContext,\n    ruleContext,\n    conflicts,\n    areMutuallyExclusive,\n    collectFieldsResult1,\n    scope1,\n    collectFieldsResult2,\n    scope2,\n  );\n\n  // (I) Then collect conflicts between the first collection of fields and\n  // those referenced by each fragment name associated with the second.\n  for (const fragmentSpread2 of fragmentSpreads2) {\n    collectConflictsBetweenFieldsAndFragment(\n      validationContext,\n      ruleContext,\n      conflicts,\n      areMutuallyExclusive,\n      collectFieldsResult1,\n      scope1,\n      fragmentSpread2,\n    );\n  }\n\n  // (I) Then collect conflicts between the second collection of fields and\n  // those referenced by each fragment name associated with the first.\n  for (const fragmentSpread1 of fragmentSpreads1) {\n    collectConflictsBetweenFieldsAndFragment(\n      validationContext,\n      ruleContext,\n      conflicts,\n      areMutuallyExclusive,\n      collectFieldsResult2,\n      scope2,\n      fragmentSpread1,\n    );\n  }\n\n  // (J) Also collect conflicts between any fragment spreads by the first and\n  // fragment spreads by the second. This compares each item in the first set of\n  // spreads to each item in the second set of spreads.\n  for (const fragmentSpread1 of fragmentSpreads1) {\n    for (const fragmentSpread2 of fragmentSpreads2) {\n      collectConflictsBetweenFragments(\n        validationContext,\n        ruleContext,\n        conflicts,\n        areMutuallyExclusive,\n        fragmentSpread1,\n        fragmentSpread2,\n      );\n    }\n  }\n  return conflicts;\n}\n\n// Collect all Conflicts \"within\" one collection of fields.\nfunction collectConflictsWithin(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  conflicts: Array<Conflict>,\n  collectFieldsResult: CollectFieldsResult,\n  scope: VariableScope | undefined,\n): void {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For every response name, if there are multiple fields, they\n  // must be compared to find a potential conflict.\n  for (const [\n    responseName,\n    fieldDetailsList,\n  ] of collectFieldsResult.groupedFieldSet.entries()) {\n    // This compares every field in the list to every other field in this list\n    // (except to itself). If the list only has one item, nothing needs to\n    // be compared.\n    if (fieldDetailsList.length > 1) {\n      for (let i = 0; i < fieldDetailsList.length; i++) {\n        for (let j = i + 1; j < fieldDetailsList.length; j++) {\n          const conflict = findConflict(\n            validationContext,\n            ruleContext,\n            false, // within one collection is never mutually exclusive\n            responseName,\n            fieldDetailsList[i],\n            scope,\n            fieldDetailsList[j],\n            scope,\n          );\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n}\n\n// Collect all Conflicts between two collections of fields. This is similar to,\n// but different from the `collectConflictsWithin` function above. This check\n// assumes that `collectConflictsWithin` has already been called on each\n// provided collection of fields. This is true because this validator traverses\n// each individual selection set.\nfunction collectConflictsBetween(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  conflicts: Array<Conflict>,\n  parentFieldsAreMutuallyExclusive: boolean,\n  collectFieldsResult1: CollectFieldsResult,\n  scope1: VariableScope | undefined,\n  collectFieldsResult2: CollectFieldsResult,\n  scope2: VariableScope | undefined,\n): void {\n  if (\n    collectFieldsResult1.groupedFieldSet.size === 0 ||\n    collectFieldsResult2.groupedFieldSet.size === 0\n  ) {\n    return;\n  }\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For any response name which appears in both provided field\n  // maps, each field from the first field map must be compared to every field\n  // in the second field map to find potential conflicts.\n  for (const {\n    responseName,\n    fieldDetailsList1,\n    fieldDetailsList2,\n  } of getOverlappingFields(\n    ruleContext,\n    collectFieldsResult1,\n    collectFieldsResult2,\n  )) {\n    for (const fieldDetails1 of fieldDetailsList1) {\n      for (const fieldDetails2 of fieldDetailsList2) {\n        const conflict = findConflict(\n          validationContext,\n          ruleContext,\n          parentFieldsAreMutuallyExclusive,\n          responseName,\n          fieldDetails1,\n          scope1,\n          fieldDetails2,\n          scope2,\n        );\n        if (conflict) {\n          conflicts.push(conflict);\n        }\n      }\n    }\n  }\n}\n\nfunction getOverlappingFields(\n  ruleContext: RuleContext,\n  collectFieldsResult1: CollectFieldsResult,\n  collectFieldsResult2: CollectFieldsResult,\n): Array<OverlappingFields> {\n  // Matching response names is independent of variable scopes. Reuse that\n  // matching across scopes, while still comparing fields in their own scope.\n  const byCollectFieldsResult = (collectFieldsResult1.overlappingFields ??=\n    new Map());\n  const cached = byCollectFieldsResult.get(collectFieldsResult2);\n  if (cached !== undefined) {\n    return cached;\n  }\n  const overlappingFields: Array<OverlappingFields> = [];\n  for (const [\n    responseName,\n    fieldDetailsList1,\n  ] of collectFieldsResult1.groupedFieldSet.entries()) {\n    // A field map can participate in many distinct comparisons.\n    spendComplexityBudget(ruleContext, 1);\n    const fieldDetailsList2 =\n      collectFieldsResult2.groupedFieldSet.get(responseName);\n    if (fieldDetailsList2 != null) {\n      overlappingFields.push({\n        responseName,\n        fieldDetailsList1,\n        fieldDetailsList2,\n      });\n    }\n  }\n  byCollectFieldsResult.set(collectFieldsResult2, overlappingFields);\n  return overlappingFields;\n}\n\n// Determines if there is a conflict between two particular fields, including\n// comparing their sub-fields.\nfunction findConflict(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  parentFieldsAreMutuallyExclusive: boolean,\n  responseName: string,\n  fieldDetails1: FieldDetails,\n  scope1: VariableScope | undefined,\n  fieldDetails2: FieldDetails,\n  scope2: VariableScope | undefined,\n): Maybe<Conflict> {\n  const {\n    parentType: parentType1,\n    node: node1,\n    definition: def1,\n    streamDirective: streamDirective1,\n  } = fieldDetails1;\n  const {\n    parentType: parentType2,\n    node: node2,\n    definition: def2,\n    streamDirective: streamDirective2,\n  } = fieldDetails2;\n\n  // If it is known that two fields could not possibly apply at the same\n  // time, due to the parent types, then it is safe to permit them to diverge\n  // in aliased field or arguments used as they will not present any ambiguity\n  // by differing.\n  // It is known that two parent types could never overlap if they are\n  // different Object types. Interface or Union types might overlap - if not\n  // in the current state of the schema, then perhaps in some future version,\n  // thus may not safely diverge.\n  const areMutuallyExclusive =\n    parentFieldsAreMutuallyExclusive ||\n    (parentType1 !== parentType2 &&\n      isObjectType(parentType1) &&\n      isObjectType(parentType2));\n\n  // Count attempted field pairs, including pairs skipped by type exclusivity.\n  spendComplexityBudget(ruleContext, 2);\n  if (\n    fieldDetails1.isSimpleLeaf &&\n    fieldDetails2.isSimpleLeaf &&\n    def1?.type === def2?.type &&\n    node1.name.value === node2.name.value\n  ) {\n    return;\n  }\n  const fieldInfo1 = getFieldInfo(fieldDetails1);\n  const fieldInfo2 = getFieldInfo(fieldDetails2);\n  let comparison = fieldInfo1.comparisons.get(fieldInfo2);\n  if (comparison === undefined) {\n    comparison = {};\n    fieldInfo1.comparisons.set(fieldInfo2, comparison);\n  }\n\n  if (!areMutuallyExclusive) {\n    // Two aliases must refer to the same field.\n    const name1 = node1.name.value;\n    const name2 = node2.name.value;\n    // Field names do not depend on the fragment scope.\n    const sameName = (comparison.sameName ??= name1 === name2);\n    if (!sameName) {\n      return {\n        responseName,\n        reason: `\"${maybeAbbreviate(name1)}\" and \"${maybeAbbreviate(name2)}\" are different fields`,\n        fields1: [node1],\n        fields2: [node2],\n      };\n    }\n\n    // Two field calls must have the same arguments.\n    const comparedArguments = (comparison.arguments ??= compareArguments(\n      ruleContext,\n      fieldInfo1.arguments,\n      fieldInfo2.arguments,\n    ));\n    if (!sameArguments(ruleContext, comparedArguments, scope1, scope2)) {\n      return {\n        responseName,\n        reason: 'they have differing arguments',\n        fields1: [node1],\n        fields2: [node2],\n      };\n    }\n  }\n\n  if (streamDirective1 || streamDirective2) {\n    let reason = 'they have overlapping stream directives';\n    if (streamDirective1 && streamDirective2) {\n      const comparedArguments = (comparison.streamArguments ??=\n        compareArguments(\n          ruleContext,\n          fieldInfo1.streamArguments,\n          fieldInfo2.streamArguments,\n        ));\n      if (sameArguments(ruleContext, comparedArguments, scope1, scope2)) {\n        // This was allowed in previous alpha versions of `graphql-js`.\n        reason +=\n          '. See https://github.com/graphql/defer-stream-wg/discussions/100';\n      }\n    }\n    return { responseName, reason, fields1: [node1], fields2: [node2] };\n  }\n\n  // The return type for each field.\n  const type1 = def1?.type;\n  const type2 = def2?.type;\n\n  if (type1 && type2 && doTypesConflict(ruleContext, type1, type2)) {\n    const type1String = (fieldInfo1.typeString ??= inspect(type1));\n    const type2String = (fieldInfo2.typeString ??= inspect(type2));\n    return {\n      responseName,\n      reason: `they return conflicting types \"${type1String}\" and \"${type2String}\"`,\n      fields1: [node1],\n      fields2: [node2],\n    };\n  }\n\n  // Collect and compare sub-fields. Use the same \"visited fragment spreads\" list\n  // for both collections so fields in a fragment reference are never\n  // compared to themselves.\n  const selectionSet1 = node1.selectionSet;\n  const selectionSet2 = node2.selectionSet;\n  if (selectionSet1 && selectionSet2) {\n    const conflicts = findConflictsBetweenSubSelectionSets(\n      validationContext,\n      ruleContext,\n      areMutuallyExclusive,\n      fieldInfo1.namedType,\n      selectionSet1,\n      scope1,\n      fieldInfo2.namedType,\n      selectionSet2,\n      scope2,\n    );\n    return subfieldConflicts(conflicts, responseName, node1, node2);\n  }\n}\n\n// Prepare argument and directive lookups only when a field overlaps.\nfunction getFieldInfo(fieldDetails: FieldDetails): FieldInfo {\n  return (fieldDetails.info ??= {\n    comparisons: new Map(),\n    namedType: getNamedType(fieldDetails.definition?.type),\n    arguments: getArgumentInfo(fieldDetails.node.arguments),\n    streamArguments: getArgumentInfo(fieldDetails.streamDirective?.arguments),\n  });\n}\n\nfunction getArgumentInfo(\n  args: ArgumentNodes | undefined,\n): ArgumentInfo | undefined {\n  if (args === undefined || args.length === 0) {\n    return;\n  }\n  const values = new Map<string, ValueNode>();\n  for (const { name, value } of args) {\n    values.set(name.value, value);\n  }\n  return {\n    nodes: args,\n    values,\n  };\n}\n\n// Compare names and source values once per field pair. Retain only values\n// containing variables, whose meaning can differ between fragment scopes.\nfunction compareArguments(\n  ruleContext: RuleContext,\n  argumentInfo1: ArgumentInfo | undefined,\n  argumentInfo2: ArgumentInfo | undefined,\n): ArgumentComparison {\n  const valuesWithVariables: Array<ValueInfo> = [];\n  if (argumentInfo1 === undefined) {\n    return {\n      sameStructure: argumentInfo2 === undefined,\n      valuesWithVariables,\n    };\n  }\n  if (argumentInfo1.nodes.length !== argumentInfo2?.nodes.length) {\n    return { sameStructure: false, valuesWithVariables };\n  }\n  for (const arg1 of argumentInfo1.nodes) {\n    // A prepared argument list can participate in many field-pair comparisons.\n    spendComplexityBudget(ruleContext, 1);\n    const value2 = argumentInfo2.values.get(arg1.name.value);\n    if (value2 === undefined) {\n      return { sameStructure: false, valuesWithVariables };\n    }\n    const valueInfo1 = getValueInfo(ruleContext, arg1.value);\n    if (\n      valueInfo1.comparisonKey !==\n      getValueInfo(ruleContext, value2).comparisonKey\n    ) {\n      return { sameStructure: false, valuesWithVariables };\n    }\n    if (valueInfo1.variables.length !== 0) {\n      valuesWithVariables.push(valueInfo1);\n    }\n  }\n  return { sameStructure: true, valuesWithVariables };\n}\n\nfunction sameArguments(\n  ruleContext: RuleContext,\n  comparison: ArgumentComparison,\n  scope1: VariableScope | undefined,\n  scope2: VariableScope | undefined,\n): boolean {\n  if (!comparison.sameStructure) {\n    return false;\n  }\n  // Equal expressions refer to the same variables within a scope. Across scopes,\n  // they agree only when every reference is an operation variable.\n  return (\n    scope1 === scope2 ||\n    comparison.valuesWithVariables.every((value) => {\n      // Different scope pairs can revisit the same prepared values.\n      spendComplexityBudget(ruleContext, 1);\n      return (\n        !usesLocalVariables(ruleContext, value, scope1) &&\n        !usesLocalVariables(ruleContext, value, scope2)\n      );\n    })\n  );\n}\n\ninterface ValueInfo {\n  comparisonKey: string;\n  variables: ReadonlyArray<string>;\n  scopeDependencies?: Map<FragmentSignature, boolean>;\n}\n\nfunction usesLocalVariables(\n  ruleContext: RuleContext,\n  value: ValueInfo,\n  scope: VariableScope | undefined,\n): boolean {\n  if (scope === undefined) {\n    return false;\n  }\n  // Declaration membership does not depend on the fragment arguments.\n  const dependencies = (value.scopeDependencies ??= new Map());\n  const cached = dependencies.get(scope.signature);\n  if (cached !== undefined) {\n    return cached;\n  }\n  const dependsOnScope = value.variables.some((variable) => {\n    // A source value can be checked in several declaration contexts.\n    spendComplexityBudget(ruleContext, 1);\n    return scope.signature.variableDefinitions.has(variable);\n  });\n  dependencies.set(scope.signature, dependsOnScope);\n  return dependsOnScope;\n}\n\n// Keep variable names in the representation and compare their scopes separately.\nfunction getValueInfo(ruleContext: RuleContext, value: ValueNode): ValueInfo {\n  const cached = ruleContext.valueInfoByNode.get(value);\n  if (cached !== undefined) {\n    return cached;\n  }\n  const variables: Array<string> = [];\n  const comparisonKey = JSON.stringify(value, (_key, node: unknown) => {\n    if (!isNode(node)) {\n      return node;\n    }\n    switch (node.kind) {\n      case Kind.VARIABLE:\n        variables.push(node.name.value);\n        return [node.kind, node.name.value];\n      case Kind.OBJECT:\n        return [\n          node.kind,\n          node.fields\n            .slice()\n            .sort((first, second) =>\n              first.name.value < second.name.value\n                ? -1\n                : first.name.value > second.name.value\n                  ? 1\n                  : 0,\n            ),\n        ];\n      case Kind.OBJECT_FIELD:\n        return [node.name.value, node.value];\n      case Kind.LIST:\n        return [node.kind, node.values];\n      case Kind.STRING:\n        return [node.kind, node.value, node.block === true];\n      default:\n        return [node.kind, 'value' in node ? node.value : null];\n    }\n  });\n  const valueInfo = { comparisonKey, variables };\n  ruleContext.valueInfoByNode.set(value, valueInfo);\n  return valueInfo;\n}\n\n// Two types conflict if both types could not apply to a value simultaneously.\n// Composite types are ignored as their individual field types will be compared\n// later recursively. However List and Non-Null types must match.\nfunction doTypesConflict(\n  ruleContext: RuleContext,\n  type1: GraphQLOutputType,\n  type2: GraphQLOutputType,\n): boolean {\n  if (type1 === type2) {\n    return false;\n  }\n  spendComplexityBudget(ruleContext, 1);\n  if (isListType(type1)) {\n    return isListType(type2)\n      ? doTypesConflict(ruleContext, type1.ofType, type2.ofType)\n      : true;\n  }\n  if (isListType(type2)) {\n    return true;\n  }\n  if (isNonNullType(type1)) {\n    return isNonNullType(type2)\n      ? doTypesConflict(ruleContext, type1.ofType, type2.ofType)\n      : true;\n  }\n  if (isNonNullType(type2)) {\n    return true;\n  }\n  if (isLeafType(type1) || isLeafType(type2)) {\n    return type1 !== type2;\n  }\n  return false;\n}\n\n// Given a selection set, return the collection of fields (a mapping of response\n// name to field nodes and definitions) as well as a list of fragment spreads\n// referenced via fragment spreads.\n// Share source fields across scopes; only resolving spreads depends on the scope.\nfunction collectFields(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  parentType: Maybe<GraphQLNamedType>,\n  selectionSet: SelectionSetNode,\n): CollectFieldsResult {\n  const { cachedCollectFieldsResults } = ruleContext;\n  // A programmatically built document can share a selection-set object between\n  // different parent types; their field definitions must not share a cache entry.\n  let bySelectionSet = cachedCollectFieldsResults.get(parentType);\n  if (!bySelectionSet) {\n    bySelectionSet = new Map();\n    cachedCollectFieldsResults.set(parentType, bySelectionSet);\n  }\n  let collectFieldsResult = bySelectionSet.get(selectionSet);\n  if (!collectFieldsResult) {\n    const groupedFieldSet: GroupedFieldSet = new Map();\n    const spreads: Array<FragmentSpreadNode> = [];\n    collectFieldsImpl(\n      validationContext,\n      parentType,\n      selectionSet,\n      groupedFieldSet,\n      spreads,\n    );\n    collectFieldsResult = { groupedFieldSet, spreads };\n    bySelectionSet.set(selectionSet, collectFieldsResult);\n  }\n  return collectFieldsResult;\n}\n\n// Given a reference to a fragment, return the represented collection of fields\n// as well as a list of nested fragment spreads referenced via fragment spreads.\nfunction collectFragmentFields(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  fragment: FragmentDefinitionNode,\n): CollectFieldsResult {\n  const fragmentType = typeFromAST(\n    validationContext.getSchema(),\n    fragment.typeCondition,\n  );\n  return collectFields(\n    validationContext,\n    ruleContext,\n    fragmentType,\n    fragment.selectionSet,\n  );\n}\n\nfunction collectFieldsImpl(\n  validationContext: ValidationContext,\n  parentType: Maybe<GraphQLNamedType>,\n  selectionSet: SelectionSetNode,\n  groupedFieldSet: GroupedFieldSet,\n  fragmentSpreads: Array<FragmentSpreadNode>,\n): void {\n  for (const selection of selectionSet.selections) {\n    switch (selection.kind) {\n      case Kind.FIELD: {\n        const fieldName = selection.name.value;\n        let fieldDef;\n        if (isObjectType(parentType) || isInterfaceType(parentType)) {\n          fieldDef = parentType.getFields()[fieldName];\n        }\n        const responseName = selection.alias\n          ? selection.alias.value\n          : fieldName;\n\n        let fieldDetailsList = groupedFieldSet.get(responseName);\n        if (fieldDetailsList == null) {\n          fieldDetailsList = [];\n          groupedFieldSet.set(responseName, fieldDetailsList);\n        }\n        const streamDirective = selection.directives?.find(\n          (directive) => directive.name.value === 'stream',\n        );\n        fieldDetailsList.push({\n          parentType,\n          node: selection,\n          definition: fieldDef,\n          isSimpleLeaf:\n            (selection.arguments?.length ?? 0) === 0 &&\n            !selection.selectionSet &&\n            streamDirective === undefined,\n          streamDirective,\n        });\n        break;\n      }\n      case Kind.FRAGMENT_SPREAD: {\n        fragmentSpreads.push(selection);\n        break;\n      }\n      case Kind.INLINE_FRAGMENT: {\n        const typeCondition = selection.typeCondition;\n        const inlineFragmentType = typeCondition\n          ? typeFromAST(validationContext.getSchema(), typeCondition)\n          : parentType;\n        collectFieldsImpl(\n          validationContext,\n          inlineFragmentType,\n          selection.selectionSet,\n          groupedFieldSet,\n          fragmentSpreads,\n        );\n        break;\n      }\n    }\n  }\n}\n\n// Resolve a source collection's spreads in the enclosing variable scope.\nfunction getFragmentSpreads(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  collectFieldsResult: CollectFieldsResult,\n  scope: VariableScope | undefined,\n): FragmentSpreads {\n  const byScope = (collectFieldsResult.byScope ??= new Map());\n  const cached = byScope.get(scope);\n  if (cached) {\n    return cached;\n  }\n\n  const spreadsByScope = new Map<\n    VariableScope | undefined,\n    Map<FragmentDefinitionNode | undefined, FragmentSpread>\n  >();\n  const result: Array<FragmentSpread> = [];\n  for (const spreadNode of collectFieldsResult.spreads) {\n    const spread = getFragmentSpread(\n      validationContext,\n      ruleContext,\n      spreadNode,\n      scope,\n    );\n    let byDefinition = spreadsByScope.get(spread.scope);\n    if (byDefinition === undefined) {\n      byDefinition = new Map();\n      spreadsByScope.set(spread.scope, byDefinition);\n    }\n    const previous = byDefinition.get(spread.definition);\n    if (previous === undefined) {\n      byDefinition.set(spread.definition, spread);\n      result.push(spread);\n    } else {\n      // Keep first-occurrence order and the last occurrence's error location.\n      previous.node = spread.node;\n    }\n  }\n  byScope.set(scope, result);\n  return result;\n}\n\nfunction getFragmentSpread(\n  validationContext: ValidationContext,\n  ruleContext: RuleContext,\n  fragmentSpreadNode: FragmentSpreadNode,\n  scope: VariableScope | undefined,\n): FragmentSpread {\n  // New enclosing scopes can repeat spread resolution, including cache hits.\n  spendComplexityBudget(ruleContext, 1);\n  let fragmentSpreadInfo =\n    ruleContext.fragmentSpreadInfoByNode.get(fragmentSpreadNode);\n  if (fragmentSpreadInfo === undefined) {\n    const signature = validationContext.getFragmentSignatureByName()(\n      fragmentSpreadNode.name.value,\n    );\n    const argumentInfo = getArgumentInfo(fragmentSpreadNode.arguments);\n    const parts: Array<string> = [];\n    const values: Array<ValueInfo> = [];\n    if (signature && argumentInfo !== undefined) {\n      const argMap = argumentInfo.values;\n      // Order only supplied, declared arguments, once per source spread.\n      const names: Array<string> = [];\n      for (const name of argMap.keys()) {\n        if (signature.variableDefinitions.has(name)) {\n          names.push(name);\n        }\n      }\n      for (const name of names.sort()) {\n        const argument = getValueInfo(\n          ruleContext,\n          argMap.get(name) as ValueNode,\n        );\n        parts.push(name, argument.comparisonKey);\n        if (argument.variables.length !== 0) {\n          values.push(argument);\n        }\n      }\n    }\n    const fragmentSpreadInfoKey = JSON.stringify([\n      signature?.definition.name.value,\n      parts,\n    ]);\n    fragmentSpreadInfo = ruleContext.fragmentSpreadInfoByKey.get(\n      fragmentSpreadInfoKey,\n    );\n    if (fragmentSpreadInfo === undefined) {\n      fragmentSpreadInfo = {\n        signature,\n        values,\n        byScope: new Map(),\n      };\n      ruleContext.fragmentSpreadInfoByKey.set(\n        fragmentSpreadInfoKey,\n        fragmentSpreadInfo,\n      );\n    }\n    ruleContext.fragmentSpreadInfoByNode.set(\n      fragmentSpreadNode,\n      fragmentSpreadInfo,\n    );\n  }\n\n  // The source key fixes the variable names. Any local reference identifies\n  // the enclosing scope; otherwise all references are operation variables.\n  const variableScope = fragmentSpreadInfo.values.some((value) => {\n    // Enclosing scopes can revisit these prepared argument values.\n    spendComplexityBudget(ruleContext, 1);\n    return usesLocalVariables(ruleContext, value, scope);\n  })\n    ? scope\n    : undefined;\n  let fragmentScope = fragmentSpreadInfo.byScope.get(variableScope);\n  if (!fragmentSpreadInfo.byScope.has(variableScope)) {\n    fragmentScope = getVariableScope(fragmentSpreadInfo.signature);\n    fragmentSpreadInfo.byScope.set(variableScope, fragmentScope);\n  }\n  return {\n    node: fragmentSpreadNode,\n    scope: fragmentScope,\n    definition: fragmentSpreadInfo.signature?.definition,\n  };\n}\n\nfunction getVariableScope(\n  fragmentSignature: Maybe<FragmentSignature>,\n): VariableScope | undefined {\n  if (!fragmentSignature || fragmentSignature.variableDefinitions.size === 0) {\n    return;\n  }\n  return { signature: fragmentSignature };\n}\n\nfunction getFragmentSpreadDescription(\n  ruleContext: RuleContext,\n  node: FragmentSpreadNode,\n): string {\n  const description = {\n    ...node,\n    name: { ...node.name, value: maybeAbbreviate(node.name.value) },\n    directives: [],\n  };\n  // Use the cached representation's length to print only small arguments.\n  let size = 1;\n  for (const argument of node.arguments ?? []) {\n    size +=\n      2 +\n      argument.name.value.length +\n      getValueInfo(ruleContext, argument.value).comparisonKey.length;\n    if (size > MAX_FRAGMENT_ARGUMENT_SIZE) {\n      return description.name.value + '(...)';\n    }\n  }\n  return print(description).slice(3);\n}\n\n// Given a series of Conflicts which occurred between two sub-fields, generate\n// a single Conflict.\nfunction subfieldConflicts(\n  conflicts: ReadonlyArray<Conflict>,\n  responseName: string,\n  node1: FieldNode,\n  node2: FieldNode,\n): Maybe<Conflict> {\n  if (conflicts.length > 0) {\n    // Abbreviate while combining child reasons, not after expanding a whole\n    // tree of conflicts.\n    let message = '';\n    for (const { responseName: name, reason } of conflicts) {\n      message +=\n        (message === '' ? '' : ' and ') +\n        `subfields \"${maybeAbbreviate(name)}\" conflict because ${reason}`;\n      if (message.length > MAX_CONFLICT_DETAIL_LENGTH) {\n        break;\n      }\n    }\n    return {\n      responseName,\n      reason: maybeAbbreviate(message),\n      fields1: collectConflictNodes(node1, conflicts, 'fields1'),\n      fields2: collectConflictNodes(node2, conflicts, 'fields2'),\n    };\n  }\n}\n\nfunction collectConflictNodes(\n  node: FieldNode,\n  conflicts: ReadonlyArray<Conflict>,\n  side: 'fields1' | 'fields2',\n): Array<FieldNode> {\n  const nodes = [node];\n  for (const conflict of conflicts) {\n    const remaining = MAX_CONFLICT_NODES - nodes.length;\n    // Locations start with the enclosing field. Take from the end so that\n    // truncation favors the deeper fields involved in the conflict.\n    const retainedNodes = conflict[side].slice(-remaining);\n    nodes.push(...retainedNodes);\n    if (nodes.length === MAX_CONFLICT_NODES) {\n      break;\n    }\n  }\n  return nodes;\n}\n\nfunction maybeAbbreviate(text: string): string {\n  return text.length > MAX_CONFLICT_DETAIL_LENGTH\n    ? text.slice(0, MAX_CONFLICT_DETAIL_LENGTH) + '...'\n    : text;\n}\n\nfunction spendComplexityBudget(ruleContext: RuleContext, cost: number): void {\n  ruleContext.remainingComplexityBudget -= cost;\n  /* node:coverage ignore next 3 */\n  if (ruleContext.remainingComplexityBudget < 0) {\n    throw validationAbortedError;\n  }\n}\n\n/**\n * A way to keep track of pairs of things where the ordering of the pair\n * matters.\n *\n * Provides a third argument for has/set to allow flagging the pair as\n * weakly or strongly present within the collection.\n *\n * @internal\n */\nclass OrderedPairSet<T, U> {\n  _data: Map<T, Map<U, boolean>>;\n\n  constructor() {\n    this._data = new Map();\n  }\n\n  has(a: T, b: U, weaklyPresent: boolean): boolean {\n    const result = this._data.get(a)?.get(b);\n    if (result === undefined) {\n      return false;\n    }\n\n    return weaklyPresent ? true : weaklyPresent === result;\n  }\n\n  add(a: T, b: U, weaklyPresent: boolean): void {\n    const map = this._data.get(a);\n    if (map === undefined) {\n      this._data.set(a, new Map([[b, weaklyPresent]]));\n    } else {\n      map.set(b, weaklyPresent);\n    }\n  }\n}\n\n/**\n * A way to keep track of pairs of similar things when the ordering of the pair\n * does not matter.\n *\n * @internal\n */\nclass PairSet<T> {\n  _orderedPairSet: OrderedPairSet<T, T>;\n\n  constructor() {\n    this._orderedPairSet = new OrderedPairSet();\n  }\n\n  has(a: T, b: T, weaklyPresent: boolean): boolean {\n    return (\n      this._orderedPairSet.has(a, b, weaklyPresent) ||\n      this._orderedPairSet.has(b, a, weaklyPresent)\n    );\n  }\n\n  add(a: T, b: T, weaklyPresent: boolean): void {\n    this._orderedPairSet.add(a, b, weaklyPresent);\n  }\n}\n"]}