You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1 lines
759 KiB
1 lines
759 KiB
{"version":3,"file":"settings-vue-settings-admin-sharing.js?v=65e52c8015aac2b2a2b4","mappings":";UAAIA,ECAAC,EACAC,4FCEJ,MCHwQ,GDGzPC,EAAAA,EAAAA,IAAgB,CAC3BC,KAAM,2BACNC,WAAY,CACRC,sBAAqBA,EAAAA,IAEzBC,MAAO,CACHC,MAAO,CACHC,KAAMC,OACNC,UAAU,IAGlBC,MAAO,CACH,eAAiBJ,GAA2B,iBAAVA,GAEtCK,KAAIA,KACO,CACHC,kBAAmB,EACnBC,kBAAmB,EACnBC,kBAAmB,EACnBC,iBAAkB,KAG1BC,SAAU,CACNC,SAAAA,GACI,OAAiD,IAAzC,KAAKX,MAAQ,KAAKO,kBAC9B,EACAK,SAAAA,GACI,OAAiD,IAAzC,KAAKZ,MAAQ,KAAKM,kBAC9B,EACAO,SAAAA,GACI,OAAiD,IAAzC,KAAKb,MAAQ,KAAKQ,kBAC9B,EACAM,QAAAA,GACI,OAAgD,IAAxC,KAAKd,MAAQ,KAAKS,iBAC9B,GAEJM,QAAS,CACLC,EAAGC,EAAAA,GAKHC,MAAAA,CAAOC,GAEH,KAAKC,MAAM,eAAgB,KAAKpB,MAAQmB,EAC5C,4IErCJE,EAAU,CAAC,EAEfA,EAAQC,kBAAoB,IAC5BD,EAAQE,cAAgB,IAElBF,EAAQG,OAAS,SAAc,KAAM,QAE3CH,EAAQI,OAAS,IACjBJ,EAAQK,mBAAqB,IAEhB,IAAI,IAASL,GAKJ,KAAW,IAAQM,QAAS,IAAQA,sBCP1D,SAXgB,OACd,GHTW,WAAkB,IAAIC,EAAIC,KAAKC,EAAGF,EAAIG,MAAMD,GAAgC,OAAtBF,EAAIG,MAAMC,YAAmBF,EAAG,WAAW,CAACG,YAAY,sBAAsB,CAACH,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIjB,WAAWwB,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAIV,OAAOU,EAAIrB,kBAAkB,IAAI,CAACqB,EAAIS,GAAG,SAAST,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,WAAW,UAAUY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIhB,WAAWuB,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAIV,OAAOU,EAAItB,kBAAkB,IAAI,CAACsB,EAAIS,GAAG,SAAST,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,WAAW,UAAUY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIf,WAAWsB,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAIV,OAAOU,EAAIpB,kBAAkB,IAAI,CAACoB,EAAIS,GAAG,SAAST,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,WAAW,UAAUY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAId,UAAUqB,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAIV,OAAOU,EAAInB,iBAAiB,IAAI,CAACmB,EAAIS,GAAG,SAAST,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,YAAY,WAAW,EAC1+B,GACsB,IGUpB,EACA,KACA,WACA,MAI8B,iCCZhC,SAAerB,EAAAA,EAAAA,IAAgB,CAC3BC,KAAM,2BACNC,WAAY,CACRC,sBAAqB,KACrByC,sBAAqB,KACrBC,WAAU,KACVC,YAAW,IACXC,yBAAwBA,GAE5BrC,KAAIA,KACO,CACHsC,cAAcC,EAAAA,EAAAA,GAAU,WAAY,qBAG5ClC,SAAU,CACNmC,QAAAA,GAEI,OADAC,EAAQC,KAAK,aACN,IAAIC,MAAM,KAAKL,aAAc,CAChCM,IAAGA,CAACC,EAAQC,IACDD,EAAOC,GAElBC,GAAAA,CAAIF,EAAQC,EAAUE,GAClB,MAAMC,EAAU,YAAAC,QAAeC,EAAAA,EAAAA,WAAUL,IACnCnD,EAA4B,kBAAbqD,EAA0BA,EAAW,MAAQ,KAA6B,iBAAbA,EAAwBA,EAAWI,KAAKC,UAAUL,GAGpI,OAFAM,OAAOC,IAAIC,UAAUC,SAAS,OAAQR,EAAYtD,GAClDkD,EAAOC,GAAYE,GACZ,CACX,GAER,EACAU,6BAA8B,CAC1Bd,GAAAA,GACI,MAA8D,iBAAhD,KAAKN,aAAaqB,yBACpC,EACAZ,GAAAA,CAAIpD,GACIA,EACA,KAAK2C,aAAaqB,0BAA4B,GAG9C,KAAKC,oBAEb,IAGRlD,QAAS,CACLC,EAAC,KACDiD,oBAAoBC,EAAAA,EAAAA,WAAS,SAAUlE,GACnC,MAAMqB,EAAU,CACZ8C,OAAAA,GACQnE,GACAoE,EAAAA,EAAAA,KAAYpD,EAAAA,EAAAA,IAAE,WAAY,6BAG1BoD,EAAAA,EAAAA,KAAYpD,EAAAA,EAAAA,IAAE,WAAY,2BAElC,EACAqD,KAAAA,IACIC,EAAAA,EAAAA,KAAUtD,EAAAA,EAAAA,IAAE,WAAY,iCAC5B,GAEChB,EAID2D,OAAOC,IAAIC,UAAUC,SAAS,OAAQ,sCAAuC9D,EAAOqB,GAHpFsC,OAAOC,IAAIC,UAAUU,UAAU,OAAQ,sCAAuClD,GAKlF,KAAKsB,aAAaqB,0BAA4BhE,CAClD,GAAG,KACHwE,uBAAuBN,EAAAA,EAAAA,WAAS,SAAUlE,GACtC2D,OAAOC,IAAIC,UAAUC,SAAS,OAAQ,gBAAiB9D,GACvD,KAAK6C,SAAS4B,cAAgBzE,CAClC,GAAG,QC9E6P,mBCWpQ,EAAU,CAAC,EAEf,EAAQsB,kBAAoB,IAC5B,EAAQC,cAAgB,IAElB,EAAQC,OAAS,SAAc,KAAM,QAE3C,EAAQC,OAAS,IACjB,EAAQC,mBAAqB,IAEhB,IAAI,IAAS,GAKJ,KAAW,IAAQC,QAAS,IAAQA,OCP1D,SAXgB,OACd,GHTW,WAAkB,IAAIC,EAAIC,KAAKC,EAAGF,EAAIG,MAAMD,GAAgC,OAAtBF,EAAIG,MAAMC,YAAmBF,EAAG,OAAO,CAACG,YAAY,WAAW,CAACH,EAAG,wBAAwB,CAACI,MAAM,CAAC,gBAAgB,2HAA2H,KAAO,SAAS,QAAUN,EAAIiB,SAAS6B,SAASvC,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,UAAWT,EAAO,IAAI,CAACR,EAAIS,GAAG,SAAST,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,oCAAoC,UAAUY,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAAS6B,QAASI,WAAW,qBAAqB7C,YAAY,uBAAuBC,MAAM,CAAC,GAAK,kCAAkC,CAACJ,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAASkC,gBAAgB5C,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,iBAAkBT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,oBAAoB,YAAYY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAASmC,mBAAmB7C,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,oBAAqBT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,8BAA8B,YAAYY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAASoC,2BAA2B9C,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,4BAA6BT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,4DAA4D,YAAYY,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAASoC,0BAA2BH,WAAW,uCAAuC7C,YAAY,wCAAwCC,MAAM,CAAC,GAAK,yCAAyC,CAACJ,EAAG,QAAQ,CAACI,MAAM,CAAC,IAAM,wDAAwD,CAACN,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,kEAAkEY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACoD,YAAY,CAAC,MAAQ,QAAQhD,MAAM,CAAC,GAAK,sDAAsD,MAAQN,EAAIZ,EAAE,WAAY,+DAA+DmE,MAAM,CAACnF,MAAO4B,EAAIiB,SAASuC,0CAA2CC,SAAS,SAAUC,GAAM1D,EAAI+C,KAAK/C,EAAIiB,SAAU,4CAA6CyC,EAAI,EAAER,WAAW,yDAAyD,IAAI,GAAGlD,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAAS6B,QAASI,WAAW,qBAAqB7C,YAAY,mBAAmBC,MAAM,CAAC,GAAK,yBAAyB,CAACJ,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,gBAAgB,mCAAmC,QAAUN,EAAIiB,SAAS0C,YAAYpD,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,aAAcT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,6CAA6C,YAAYY,EAAIS,GAAG,KAAKP,EAAG,WAAW,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAAS0C,WAAYT,WAAW,wBAAwB7C,YAAY,uBAAuBC,MAAM,CAAC,GAAK,qCAAqC,CAACJ,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS2C,mBAAmBrD,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,oBAAqBT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,yBAAyB,cAAcY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS4C,6BAA6BtD,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,8BAA+BT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,8BAA8B,cAAcY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS6C,qBAAqB,UAAY9D,EAAIiB,SAAS4C,6BAA6BtD,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,uBAAwBT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,gCAAgC,cAAcY,EAAIS,GAAG,KAAMT,EAAIiB,SAAS8C,qCAAsC7D,EAAG,QAAQ,CAACG,YAAY,yCAAyC,CAACH,EAAG,OAAO,CAACF,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,iDAAiDY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACoD,YAAY,CAAC,MAAQ,QAAQhD,MAAM,CAAC,UAAYN,EAAIiB,SAAS6C,uBAAyB9D,EAAIiB,SAAS4C,6BAA6BN,MAAM,CAACnF,MAAO4B,EAAIiB,SAAS+C,uBAAwBP,SAAS,SAAUC,GAAM1D,EAAI+C,KAAK/C,EAAIiB,SAAU,yBAA0ByC,EAAI,EAAER,WAAW,sCAAsC,GAAGlD,EAAIiE,KAAKjE,EAAIS,GAAG,KAAKP,EAAG,QAAQ,CAACG,YAAY,yCAAyC,CAACH,EAAG,OAAO,CAACF,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,gDAAgDY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACoD,YAAY,CAAC,MAAQ,QAAQhD,MAAM,CAAC,MAAQN,EAAIZ,EAAE,WAAY,6CAA6CmE,MAAM,CAACnF,MAAO4B,EAAIiB,SAASiD,wBAAyBT,SAAS,SAAUC,GAAM1D,EAAI+C,KAAK/C,EAAIiB,SAAU,0BAA2ByC,EAAI,EAAER,WAAW,uCAAuC,IAAI,GAAGlD,EAAIS,GAAG,KAAKP,EAAG,QAAQ,CAACF,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,qCAAqCY,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAACG,YAAY,wBAAwB,CAACH,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS4B,cAAc,KAAO,gBAAgB,MAAQ,KAAK,KAAO,SAAStC,GAAG,CAAC,iBAAiB,CAAC,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,gBAAiBT,EAAO,EAAER,EAAI4C,yBAAyB,CAAC5C,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,yCAAyC,cAAcY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS4B,cAAc,KAAO,gBAAgB,MAAQ,MAAM,KAAO,SAAStC,GAAG,CAAC,iBAAiB,CAAC,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,gBAAiBT,EAAO,EAAER,EAAI4C,yBAAyB,CAAC5C,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,qCAAqC,cAAcY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS4B,cAAc,KAAO,gBAAgB,MAAQ,QAAQ,KAAO,SAAStC,GAAG,CAAC,iBAAiB,CAAC,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,gBAAiBT,EAAO,EAAER,EAAI4C,yBAAyB,CAAC5C,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,iCAAiC,cAAcY,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAsC,OAA/B4B,EAAIiB,SAAS4B,cAAwBK,WAAW,oCAAoC7C,YAAY,yCAAyC,CAACH,EAAG,wBAAwB,CAACoD,YAAY,CAAC,MAAQ,QAAQhD,MAAM,CAAC,GAAK,mCAAmC,mBAAmB,wCAAwC,MAAuC,UAA/BN,EAAIiB,SAAS4B,cAA4B7C,EAAIZ,EAAE,WAAY,2BAA6BY,EAAIZ,EAAE,WAAY,gCAAgC,SAA0C,OAA/BY,EAAIiB,SAAS4B,eAAwBU,MAAM,CAACnF,MAAO4B,EAAIiB,SAASkD,kBAAmBV,SAAS,SAAUC,GAAM1D,EAAI+C,KAAK/C,EAAIiB,SAAU,oBAAqByC,EAAI,EAAER,WAAW,gCAAgClD,EAAIS,GAAG,KAAKP,EAAG,KAAK,CAACI,MAAM,CAAC,GAAK,0CAA0C,CAACN,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,2FAA2F,IAAI,GAAGY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,gBAAgB,kCAAkC,QAAUN,EAAIiB,SAASmD,2BAA2B7D,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,4BAA6BT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,2CAA2C,YAAYY,EAAIS,GAAG,KAAKP,EAAG,WAAW,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAASmD,0BAA2BlB,WAAW,uCAAuC7C,YAAY,uBAAuBC,MAAM,CAAC,GAAK,oCAAoC,CAACJ,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAASoD,2BAA2B9D,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,4BAA6BT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,4BAA4B,cAAcY,EAAIS,GAAG,KAAKP,EAAG,cAAc,CAACG,YAAY,iBAAiBC,MAAM,CAAC,KAAO,SAAS,MAAQN,EAAIZ,EAAE,WAAY,iDAAiD,YAAcY,EAAIZ,EAAE,WAAY,8BAA8B,MAAQY,EAAIiB,SAASqD,0BAA0B/D,GAAG,CAAC,eAAe,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,2BAA4BT,EAAO,MAAM,GAAGR,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,gBAAgB,yCAAyC,QAAUN,EAAIiB,SAASsD,yBAAyBhE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,0BAA2BT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,4DAA4D,YAAYY,EAAIS,GAAG,KAAKP,EAAG,WAAW,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAASsD,wBAAyBrB,WAAW,qCAAqC7C,YAAY,uBAAuBC,MAAM,CAAC,GAAK,2CAA2C,CAACJ,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAASuD,yBAAyBjE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,0BAA2BT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,8CAA8C,cAAcY,EAAIS,GAAG,KAAKP,EAAG,cAAc,CAACG,YAAY,iBAAiBC,MAAM,CAAC,KAAO,SAAS,MAAQN,EAAIZ,EAAE,WAAY,oDAAoD,YAAcY,EAAIZ,EAAE,WAAY,qCAAqC,MAAQY,EAAIiB,SAASwD,wBAAwBlE,GAAG,CAAC,eAAe,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,yBAA0BT,EAAO,MAAM,GAAGR,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,gBAAgB,sCAAsC,QAAUN,EAAIiB,SAASyD,kBAAkB,UAAY1E,EAAIiB,SAAS0C,YAAYpD,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,oBAAqBT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,4DAA4D,YAAYY,EAAIS,GAAG,KAAKP,EAAG,WAAW,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAAS0C,YAAc3D,EAAIiB,SAASyD,kBAAmBxB,WAAW,sDAAsD7C,YAAY,uBAAuBC,MAAM,CAAC,GAAK,wCAAwC,CAACJ,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS0D,mBAAmBpE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,oBAAqBT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,8CAA8C,cAAcY,EAAIS,GAAG,KAAKP,EAAG,cAAc,CAACG,YAAY,iBAAiBC,MAAM,CAAC,KAAO,SAAS,MAAQN,EAAIZ,EAAE,WAAY,6CAA6C,YAAcY,EAAIZ,EAAE,WAAY,8BAA8B,MAAQY,EAAIiB,SAAS2D,kBAAkBrE,GAAG,CAAC,eAAe,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,mBAAoBT,EAAO,MAAM,IAAI,GAAGR,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAAS6B,QAASI,WAAW,qBAAqB7C,YAAY,mBAAmBC,MAAM,CAAC,GAAK,qCAAqC,CAACJ,EAAG,KAAK,CAACF,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,oCAAoCY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,gBAAgB,4CAA4C,QAAUN,EAAIiB,SAAS4D,iCAAiCtE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,kCAAmCT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,kGAAkG,YAAYY,EAAIS,GAAG,KAAKP,EAAG,WAAW,CAAC8C,WAAW,CAAC,CAAChF,KAAK,OAAOiF,QAAQ,SAAS7E,MAAO4B,EAAIiB,SAAS4D,gCAAiC3B,WAAW,6CAA6C7C,YAAY,uBAAuBC,MAAM,CAAC,GAAK,8CAA8C,CAACJ,EAAG,KAAK,CAACF,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,4HAA4H,cAAcY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS6D,gCAAgCvE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,iCAAkCT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,iIAAiI,cAAcY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,QAAUN,EAAIiB,SAAS8D,gCAAgCxE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,iCAAkCT,EAAO,IAAI,CAACR,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,iFAAiF,eAAe,GAAGY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,QAAUN,EAAIiB,SAAS+D,kCAAkCzE,GAAG,CAAC,iBAAiB,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,mCAAoCT,EAAO,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,qIAAqI,YAAYY,EAAIS,GAAG,KAAKP,EAAG,wBAAwB,CAACI,MAAM,CAAC,KAAO,SAAS,QAAUN,EAAImC,8BAA8B5B,GAAG,CAAC,iBAAiB,SAASC,GAAQR,EAAImC,6BAA6B3B,CAAM,IAAI,CAACR,EAAIS,GAAG,WAAWT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,kGAAkG,YAAYY,EAAIS,GAAG,KAAwD,iBAA3CT,EAAIiB,SAASmB,0BAAwClC,EAAG,MAAM,CAACG,YAAY,uBAAuBC,MAAM,CAAC,mBAAmB,qDAAqD,CAACJ,EAAG,aAAa,CAACG,YAAY,iBAAiBC,MAAM,CAAC,MAAQN,EAAIZ,EAAE,WAAY,mBAAmB,mBAAmB,mDAAmD,MAAQY,EAAIiB,SAASmB,2BAA2B7B,GAAG,CAAC,eAAeP,EAAIqC,sBAAsBrC,EAAIS,GAAG,KAAKP,EAAG,KAAK,CAACG,YAAY,iBAAiBC,MAAM,CAAC,GAAK,qDAAqD,CAACN,EAAIS,GAAG,aAAaT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,yFAAyF,eAAe,GAAGY,EAAIiE,MAAM,GAAGjE,EAAIS,GAAG,KAAKP,EAAG,MAAM,CAACG,YAAY,mBAAmBC,MAAM,CAAC,GAAK,yCAAyC,CAACJ,EAAG,KAAK,CAACF,EAAIS,GAAGT,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,iCAAiCY,EAAIS,GAAG,KAAKP,EAAG,2BAA2B,CAACI,MAAM,CAAC,MAAQN,EAAIiB,SAASgE,oBAAoB1E,GAAG,CAAC,eAAe,SAASC,GAAQ,OAAOR,EAAI+C,KAAK/C,EAAIiB,SAAU,qBAAsBT,EAAO,MAAM,IAAI,EAC1zd,GACsB,IGUpB,EACA,KACA,WACA,MAI8B,QCnBoO,GCKrPzC,EAAAA,EAAAA,IAAgB,CAC3BC,KAAM,uBACNC,WAAY,CACRiH,yBAAwB,EACxBC,WAAU,KACVC,kBAAiBA,EAAAA,IAErB3G,KAAIA,KACO,CACH4G,mBAAmBrE,EAAAA,EAAAA,GAAU,WAAY,uBAAwB,IACjEsE,mBAAmBtE,EAAAA,EAAAA,GAAU,WAAY,qBAAqB,KAGtE7B,QAAS,CACLC,EAACA,EAAAA,MCDT,GAXgB,OACd,GDRW,WAAkB,IAAIY,EAAIC,KAAKC,EAAGF,EAAIG,MAAMD,GAAgC,OAAtBF,EAAIG,MAAMC,YAAmBF,EAAG,oBAAoB,CAACI,MAAM,CAAC,mCAAmC,GAAG,eAAc,EAAK,UAAUN,EAAIqF,kBAAkB,KAAOrF,EAAIZ,EAAE,WAAY,WAAW,YAAcY,EAAIZ,EAAE,WAAY,yGAAyG,CAAGY,EAAIsF,kBAA+JpF,EAAG,4BAA/IA,EAAG,aAAa,CAACI,MAAM,CAAC,KAAO,YAAY,CAACN,EAAIS,GAAG,SAAST,EAAIU,GAAGV,EAAIZ,EAAE,WAAY,6CAA6C,WAA0C,EAC3kB,GACsB,ICSpB,EACA,KACA,KACA,MAI8B,QCKhC,IAAmBmG,EAAAA,GAAI,CACnBvH,KAAM,8BACNwH,GAAI,8BACJC,OAASC,GAAMA,EAAEC,uFCvBjBC,QAA0B,GAA4B,KAE1DA,EAAwBC,KAAK,CAACC,EAAOC,GAAI,6nBAA8nB,GAAG,CAAC,QAAU,EAAE,QAAU,CAAC,yEAAyE,MAAQ,GAAG,SAAW,wQAAwQ,eAAiB,CAAC,yzBAAyzB,WAAa,MAEj4D,4FCJIH,QAA0B,GAA4B,KAE1DA,EAAwBC,KAAK,CAACC,EAAOC,GAAI,mGAMtC,GAAG,CAAC,QAAU,EAAE,QAAU,CAAC,yEAAyE,MAAQ,GAAG,SAAW,4CAA4C,eAAiB,CAAC,m7FAA46F,WAAa,MAEpnG,gCCbA,iBAQE,WAGA,IAAIC,EAUAC,EAAkB,sBAIlBC,EAAiB,4BAMjBC,EAAc,yBAiBdC,EAAoB,GAEpBC,EAAgB,IAkBhBC,EAAW,IACXC,EAAmB,iBAEnBC,EAAM,IAGNC,EAAmB,WAKnBC,EAAY,CACd,CAAC,MAAOL,GACR,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAAWD,GACZ,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBO,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBACZC,EAAa,mBAEbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmBC,OAAOH,EAAcI,QACxCC,EAAqBF,OAAOF,EAAgBG,QAG5CE,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhBC,EAAe,mDACfC,EAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBV,OAAOS,GAAaR,QAGtCU,GAAc,OAGdC,GAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAGpBC,GAAgB,kBAIhBC,GAAeC,gDACfC,GAAiB,kBACjBC,GAAe,4BAKfC,GAAe,4BACfC,GAAa,iBACbC,GAAeC,8OAIfC,GAAW,IAAMT,GAAgB,IACjCU,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMV,GAAe,IAC/BW,GAAW,OACXC,GAAY,IAAMV,GAAiB,IACnCW,GAAU,IAAMV,GAAe,IAC/BW,GAAS,KAAOf,GAAgBO,GAAeK,GAAWT,GAAiBC,GAAeC,GAAe,IACzGW,GAAS,2BAETC,GAAc,KAAOjB,GAAgB,IACrCkB,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMf,GAAe,IAC/BgB,GAAQ,UAGRC,GAAc,MAAQR,GAAU,IAAMC,GAAS,IAC/CQ,GAAc,MAAQH,GAAU,IAAML,GAAS,IAC/CS,GAAkB,gCAClBC,GAAkB,gCAClBC,GAZa,MAAQf,GAAU,IAAMK,GAY1BW,KACXC,GAAW,IAAMtB,GAAa,KAI9BuB,GAAQD,GAAWF,GAHP,MAAQL,GAAQ,MAAQ,CAACJ,GAAaC,GAAYC,IAAYW,KAAK,KAAO,IAAMF,GAAWF,GAAW,KAIlHK,GAAU,MAAQ,CAAClB,GAAWK,GAAYC,IAAYW,KAAK,KAAO,IAAMD,GACxEG,GAAW,MAAQ,CAACf,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUqB,KAAK,KAAO,IAGxGG,GAAS9D,OA/BA,OA+Be,KAMxB+D,GAAc/D,OAAOwC,GAAS,KAG9BwB,GAAYhE,OAAO6C,GAAS,MAAQA,GAAS,KAAOgB,GAAWH,GAAO,KAGtEO,GAAgBjE,OAAO,CACzBiD,GAAU,IAAMN,GAAU,IAAMU,GAAkB,MAAQ,CAACd,GAASU,GAAS,KAAKU,KAAK,KAAO,IAC9FP,GAAc,IAAME,GAAkB,MAAQ,CAACf,GAASU,GAAUE,GAAa,KAAKQ,KAAK,KAAO,IAChGV,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAtBD,mDADA,mDA0Bfb,GACAmB,IACAD,KAAK,KAAM,KAGTO,GAAelE,OAAO,IAAMkD,GAAQrB,GAAiBC,GAAeK,GAAa,KAGjFgC,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,CAAC,EACtBA,GAAerF,GAAcqF,GAAepF,GAC5CoF,GAAenF,GAAWmF,GAAelF,GACzCkF,GAAejF,GAAYiF,GAAehF,GAC1CgF,GAAe/E,GAAmB+E,GAAe9E,GACjD8E,GAAe7E,IAAa,EAC5B6E,GAAevG,GAAWuG,GAAetG,GACzCsG,GAAevF,GAAkBuF,GAAerG,GAChDqG,GAAetF,GAAesF,GAAepG,GAC7CoG,GAAenG,GAAYmG,GAAelG,GAC1CkG,GAAehG,GAAUgG,GAAe/F,GACxC+F,GAAe9F,GAAa8F,GAAe5F,GAC3C4F,GAAe3F,GAAU2F,GAAe1F,GACxC0F,GAAexF,IAAc,EAG7B,IAAIyF,GAAgB,CAAC,EACrBA,GAAcxG,GAAWwG,GAAcvG,GACvCuG,GAAcxF,GAAkBwF,GAAcvF,GAC9CuF,GAActG,GAAWsG,GAAcrG,GACvCqG,GAActF,GAAcsF,GAAcrF,GAC1CqF,GAAcpF,GAAWoF,GAAcnF,GACvCmF,GAAclF,GAAYkF,GAAcjG,GACxCiG,GAAchG,GAAagG,GAAc/F,GACzC+F,GAAc7F,GAAa6F,GAAc5F,GACzC4F,GAAc3F,GAAa2F,GAAc1F,GACzC0F,GAAcjF,GAAYiF,GAAchF,GACxCgF,GAAc/E,GAAa+E,GAAc9E,IAAa,EACtD8E,GAAcpG,GAAYoG,GAAcnG,GACxCmG,GAAczF,IAAc,EAG5B,IA4EI0F,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfC,GAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAOC,SAAWA,QAAU,EAAAD,EAGhFE,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,GAAOL,IAAcG,IAAYG,SAAS,cAATA,GAGjCC,GAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,GAAaH,IAA4ClI,IAAWA,EAAOoI,UAAYpI,EAGvFsI,GAAgBD,IAAcA,GAAWF,UAAYD,GAGrDK,GAAcD,IAAiBX,GAAWa,QAG1CC,GAAY,WACd,IAIE,OAFYJ,IAAcA,GAAWK,SAAWL,GAAWK,QAAQ,QAAQC,OAOpEJ,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,OACnE,CAAE,MAAOC,GAAI,CACf,CAZe,GAeXC,GAAoBL,IAAYA,GAASM,cACzCC,GAAaP,IAAYA,GAASQ,OAClCC,GAAYT,IAAYA,GAASU,MACjCC,GAAeX,IAAYA,GAASY,SACpCC,GAAYb,IAAYA,GAASc,MACjCC,GAAmBf,IAAYA,GAASgB,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAKC,QACX,KAAK,EAAG,OAAOH,EAAKI,KAAKH,GACzB,KAAK,EAAG,OAAOD,EAAKI,KAAKH,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKI,KAAKH,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKI,KAAKH,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,EAC7B,CAYA,SAASG,GAAgBC,EAAOC,EAAQC,EAAUC,GAIhD,IAHA,IAAIC,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GAClBH,EAAOE,EAAa9R,EAAO6R,EAAS7R,GAAQ2R,EAC9C,CACA,OAAOG,CACT,CAWA,SAASE,GAAUL,EAAOE,GAIxB,IAHA,IAAIE,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,IAC8B,IAAzCK,EAASF,EAAMI,GAAQA,EAAOJ,KAIpC,OAAOA,CACT,CAWA,SAASM,GAAeN,EAAOE,GAG7B,IAFA,IAAIL,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEhCA,MAC0C,IAA3CK,EAASF,EAAMH,GAASA,EAAQG,KAItC,OAAOA,CACT,CAYA,SAASO,GAAWP,EAAOQ,GAIzB,IAHA,IAAIJ,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GACf,IAAKW,EAAUR,EAAMI,GAAQA,EAAOJ,GAClC,OAAO,EAGX,OAAO,CACT,CAWA,SAASS,GAAYT,EAAOQ,GAM1B,IALA,IAAIJ,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCa,EAAW,EACXC,EAAS,KAEJP,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdI,EAAUnS,EAAO+R,EAAOJ,KAC1BW,EAAOD,KAAcrS,EAEzB,CACA,OAAOsS,CACT,CAWA,SAASC,GAAcZ,EAAO3R,GAE5B,QADsB,MAAT2R,IAAoBA,EAAMH,SACpBgB,GAAYb,EAAO3R,EAAO,IAAM,CACrD,CAWA,SAASyS,GAAkBd,EAAO3R,EAAO0S,GAIvC,IAHA,IAAIX,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GACf,GAAIkB,EAAW1S,EAAO2R,EAAMI,IAC1B,OAAO,EAGX,OAAO,CACT,CAWA,SAASY,GAAShB,EAAOE,GAKvB,IAJA,IAAIE,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCc,EAASM,MAAMpB,KAEVO,EAAQP,GACfc,EAAOP,GAASF,EAASF,EAAMI,GAAQA,EAAOJ,GAEhD,OAAOW,CACT,CAUA,SAASO,GAAUlB,EAAOmB,GAKxB,IAJA,IAAIf,GAAS,EACTP,EAASsB,EAAOtB,OAChBuB,EAASpB,EAAMH,SAEVO,EAAQP,GACfG,EAAMoB,EAAShB,GAASe,EAAOf,GAEjC,OAAOJ,CACT,CAcA,SAASqB,GAAYrB,EAAOE,EAAUC,EAAamB,GACjD,IAAIlB,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAKvC,IAHIyB,GAAazB,IACfM,EAAcH,IAAQI,MAEfA,EAAQP,GACfM,EAAcD,EAASC,EAAaH,EAAMI,GAAQA,EAAOJ,GAE3D,OAAOG,CACT,CAcA,SAASoB,GAAiBvB,EAAOE,EAAUC,EAAamB,GACtD,IAAIzB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAIvC,IAHIyB,GAAazB,IACfM,EAAcH,IAAQH,IAEjBA,KACLM,EAAcD,EAASC,EAAaH,EAAMH,GAASA,EAAQG,GAE7D,OAAOG,CACT,CAYA,SAASqB,GAAUxB,EAAOQ,GAIxB,IAHA,IAAIJ,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GACf,GAAIW,EAAUR,EAAMI,GAAQA,EAAOJ,GACjC,OAAO,EAGX,OAAO,CACT,CASA,IAAIyB,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYpB,EAAWqB,GAC1C,IAAIlB,EAOJ,OANAkB,EAASD,GAAY,SAASvT,EAAOyT,EAAKF,GACxC,GAAIpB,EAAUnS,EAAOyT,EAAKF,GAExB,OADAjB,EAASmB,GACF,CAEX,IACOnB,CACT,CAaA,SAASoB,GAAc/B,EAAOQ,EAAWwB,EAAWC,GAIlD,IAHA,IAAIpC,EAASG,EAAMH,OACfO,EAAQ4B,GAAaC,EAAY,GAAK,GAElCA,EAAY7B,MAAYA,EAAQP,GACtC,GAAIW,EAAUR,EAAMI,GAAQA,EAAOJ,GACjC,OAAOI,EAGX,OAAQ,CACV,CAWA,SAASS,GAAYb,EAAO3R,EAAO2T,GACjC,OAAO3T,GAAUA,EAidnB,SAAuB2R,EAAO3R,EAAO2T,GAInC,IAHA,IAAI5B,EAAQ4B,EAAY,EACpBnC,EAASG,EAAMH,SAEVO,EAAQP,GACf,GAAIG,EAAMI,KAAW/R,EACnB,OAAO+R,EAGX,OAAQ,CACV,CA1dM8B,CAAclC,EAAO3R,EAAO2T,GAC5BD,GAAc/B,EAAOmC,GAAWH,EACtC,CAYA,SAASI,GAAgBpC,EAAO3R,EAAO2T,EAAWjB,GAIhD,IAHA,IAAIX,EAAQ4B,EAAY,EACpBnC,EAASG,EAAMH,SAEVO,EAAQP,GACf,GAAIkB,EAAWf,EAAMI,GAAQ/R,GAC3B,OAAO+R,EAGX,OAAQ,CACV,CASA,SAAS+B,GAAU9T,GACjB,OAAOA,GAAUA,CACnB,CAWA,SAASgU,GAASrC,EAAOE,GACvB,IAAIL,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAAUyC,GAAQtC,EAAOE,GAAYL,EAAUpJ,CACxD,CASA,SAASiL,GAAaI,GACpB,OAAO,SAASS,GACd,OAAiB,MAAVA,EAAiBtM,EAAYsM,EAAOT,EAC7C,CACF,CASA,SAASU,GAAeD,GACtB,OAAO,SAAST,GACd,OAAiB,MAAVS,EAAiBtM,EAAYsM,EAAOT,EAC7C,CACF,CAeA,SAASW,GAAWb,EAAY1B,EAAUC,EAAamB,EAAWO,GAMhE,OALAA,EAASD,GAAY,SAASvT,EAAO+R,EAAOwB,GAC1CzB,EAAcmB,GACTA,GAAY,EAAOjT,GACpB6R,EAASC,EAAa9R,EAAO+R,EAAOwB,EAC1C,IACOzB,CACT,CA+BA,SAASmC,GAAQtC,EAAOE,GAKtB,IAJA,IAAIS,EACAP,GAAS,EACTP,EAASG,EAAMH,SAEVO,EAAQP,GAAQ,CACvB,IAAI6C,EAAUxC,EAASF,EAAMI,IACzBsC,IAAYzM,IACd0K,EAASA,IAAW1K,EAAYyM,EAAW/B,EAAS+B,EAExD,CACA,OAAO/B,CACT,CAWA,SAASgC,GAAUC,EAAG1C,GAIpB,IAHA,IAAIE,GAAS,EACTO,EAASM,MAAM2B,KAEVxC,EAAQwC,GACfjC,EAAOP,GAASF,EAASE,GAE3B,OAAOO,CACT,CAwBA,SAASkC,GAASC,GAChB,OAAOA,EACHA,EAAOC,MAAM,EAAGC,GAAgBF,GAAU,GAAGG,QAAQzJ,GAAa,IAClEsJ,CACN,CASA,SAASI,GAAUxD,GACjB,OAAO,SAASrR,GACd,OAAOqR,EAAKrR,EACd,CACF,CAYA,SAAS8U,GAAWZ,EAAQnU,GAC1B,OAAO4S,GAAS5S,GAAO,SAAS0T,GAC9B,OAAOS,EAAOT,EAChB,GACF,CAUA,SAASsB,GAASC,EAAOvB,GACvB,OAAOuB,EAAMC,IAAIxB,EACnB,CAWA,SAASyB,GAAgBC,EAAYC,GAInC,IAHA,IAAIrD,GAAS,EACTP,EAAS2D,EAAW3D,SAEfO,EAAQP,GAAUgB,GAAY4C,EAAYD,EAAWpD,GAAQ,IAAM,IAC5E,OAAOA,CACT,CAWA,SAASsD,GAAcF,EAAYC,GAGjC,IAFA,IAAIrD,EAAQoD,EAAW3D,OAEhBO,KAAWS,GAAY4C,EAAYD,EAAWpD,GAAQ,IAAM,IACnE,OAAOA,CACT,CA8BA,IAAIuD,GAAenB,GAjxBG,CAEpB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IACnC,EAAQ,KAAM,EAAQ,KACtB,EAAQ,KAAM,EAAQ,KACtB,EAAQ,KAER,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAC1B,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACtF,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACtF,EAAU,IAAM,EAAU,IAC1B,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,KAAM,EAAU,KAC1B,EAAU,KAAM,EAAU,KAC1B,EAAU,KAAM,EAAU,MAouBxBoB,GAAiBpB,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASqB,GAAiBC,GACxB,MAAO,KAAOzG,GAAcyG,EAC9B,CAqBA,SAASC,GAAWjB,GAClB,OAAO/F,GAAaiH,KAAKlB,EAC3B,CAqCA,SAASmB,GAAWC,GAClB,IAAI9D,GAAS,EACTO,EAASM,MAAMiD,EAAIC,MAKvB,OAHAD,EAAIE,SAAQ,SAAS/V,EAAOyT,GAC1BnB,IAASP,GAAS,CAAC0B,EAAKzT,EAC1B,IACOsS,CACT,CAUA,SAAS0D,GAAQ3E,EAAM4E,GACrB,OAAO,SAASC,GACd,OAAO7E,EAAK4E,EAAUC,GACxB,CACF,CAWA,SAASC,GAAexE,EAAOyE,GAM7B,IALA,IAAIrE,GAAS,EACTP,EAASG,EAAMH,OACfa,EAAW,EACXC,EAAS,KAEJP,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACd/R,IAAUoW,GAAepW,IAAU+H,IACrC4J,EAAMI,GAAShK,EACfuK,EAAOD,KAAcN,EAEzB,CACA,OAAOO,CACT,CASA,SAAS+D,GAAWjT,GAClB,IAAI2O,GAAS,EACTO,EAASM,MAAMxP,EAAI0S,MAKvB,OAHA1S,EAAI2S,SAAQ,SAAS/V,GACnBsS,IAASP,GAAS/R,CACpB,IACOsS,CACT,CASA,SAASgE,GAAWlT,GAClB,IAAI2O,GAAS,EACTO,EAASM,MAAMxP,EAAI0S,MAKvB,OAHA1S,EAAI2S,SAAQ,SAAS/V,GACnBsS,IAASP,GAAS,CAAC/R,EAAOA,EAC5B,IACOsS,CACT,CAmDA,SAASiE,GAAW9B,GAClB,OAAOiB,GAAWjB,GAiDpB,SAAqBA,GAEnB,IADA,IAAInC,EAAS9D,GAAUgI,UAAY,EAC5BhI,GAAUmH,KAAKlB,MAClBnC,EAEJ,OAAOA,CACT,CAtDMmE,CAAYhC,GACZrB,GAAUqB,EAChB,CASA,SAASiC,GAAcjC,GACrB,OAAOiB,GAAWjB,GAmDpB,SAAwBA,GACtB,OAAOA,EAAOkC,MAAMnI,KAAc,EACpC,CApDMoI,CAAenC,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAOoC,MAAM,GACtB,CA4kBMC,CAAarC,EACnB,CAUA,SAASE,GAAgBF,GAGvB,IAFA,IAAI1C,EAAQ0C,EAAOjD,OAEZO,KAAW3G,GAAauK,KAAKlB,EAAOsC,OAAOhF,MAClD,OAAOA,CACT,CASA,IAAIiF,GAAmB7C,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MAk4gBP8C,GAt3ee,SAAUC,EAAaC,GAIxC,IA6BMC,EA7BFxE,GAHJuE,EAAqB,MAAXA,EAAkBzH,GAAOuH,GAAEI,SAAS3H,GAAKH,SAAU4H,EAASF,GAAEK,KAAK5H,GAAMd,MAG/DgE,MAChB2E,GAAOJ,EAAQI,KACfC,GAAQL,EAAQK,MAChB7H,GAAWwH,EAAQxH,SACnB8H,GAAON,EAAQM,KACflI,GAAS4H,EAAQ5H,OACjB/E,GAAS2M,EAAQ3M,OACjBkN,GAASP,EAAQO,OACjBC,GAAYR,EAAQQ,UAGpBC,GAAahF,EAAMiF,UACnBC,GAAYnI,GAASkI,UACrBE,GAAcxI,GAAOsI,UAGrBG,GAAab,EAAQ,sBAGrBc,GAAeH,GAAUI,SAGzBC,GAAiBJ,GAAYI,eAG7BC,GAAY,EAGZC,IACEjB,EAAM,SAASkB,KAAKN,IAAcA,GAAWO,MAAQP,GAAWO,KAAKC,UAAY,KACvE,iBAAmBpB,EAAO,GAQtCqB,GAAuBV,GAAYG,SAGnCQ,GAAmBT,GAAaxG,KAAKlC,IAGrCoJ,GAAUjJ,GAAKuH,EAGf2B,GAAapO,GAAO,IACtByN,GAAaxG,KAAK0G,IAAgBvD,QAAQ3J,GAAc,QACvD2J,QAAQ,yDAA0D,SAAW,KAI5EiE,GAAS7I,GAAgBmH,EAAQ0B,OAASjR,EAC1CkR,GAAS3B,EAAQ2B,OACjBC,GAAa5B,EAAQ4B,WACrBC,GAAcH,GAASA,GAAOG,YAAcpR,EAC5CqR,GAAejD,GAAQzG,GAAO2J,eAAgB3J,IAC9C4J,GAAe5J,GAAO6J,OACtBC,GAAuBtB,GAAYsB,qBACnCC,GAAS1B,GAAW0B,OACpBC,GAAmBT,GAASA,GAAOU,mBAAqB5R,EACxD6R,GAAcX,GAASA,GAAOY,SAAW9R,EACzC+R,GAAiBb,GAASA,GAAOc,YAAchS,EAE/CiS,GAAkB,WACpB,IACE,IAAIxI,EAAOyI,GAAUvK,GAAQ,kBAE7B,OADA8B,EAAK,CAAC,EAAG,GAAI,CAAC,GACPA,CACT,CAAE,MAAOd,GAAI,CACf,CANqB,GASjBwJ,GAAkB5C,EAAQ6C,eAAiBtK,GAAKsK,cAAgB7C,EAAQ6C,aACxEC,GAAS1C,IAAQA,GAAK2C,MAAQxK,GAAK6H,KAAK2C,KAAO3C,GAAK2C,IACpDC,GAAgBhD,EAAQiD,aAAe1K,GAAK0K,YAAcjD,EAAQiD,WAGlEC,GAAa5C,GAAK6C,KAClBC,GAAc9C,GAAK+C,MACnBC,GAAmBlL,GAAOmL,sBAC1BC,GAAiB9B,GAASA,GAAO+B,SAAWhT,EAC5CiT,GAAiB1D,EAAQ2D,SACzBC,GAAanD,GAAWzJ,KACxB6M,GAAahF,GAAQzG,GAAOgJ,KAAMhJ,IAClC0L,GAAYxD,GAAKyD,IACjBC,GAAY1D,GAAK2D,IACjBC,GAAY9D,GAAK2C,IACjBoB,GAAiBnE,EAAQ/H,SACzBmM,GAAe9D,GAAK+D,OACpBC,GAAgB7D,GAAW8D,QAG3BC,GAAW7B,GAAU3C,EAAS,YAC9ByE,GAAM9B,GAAU3C,EAAS,OACzB0E,GAAU/B,GAAU3C,EAAS,WAC7B2E,GAAMhC,GAAU3C,EAAS,OACzB4E,GAAUjC,GAAU3C,EAAS,WAC7B6E,GAAelC,GAAUvK,GAAQ,UAGjC0M,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,CAAC,EAGbC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAc3D,GAASA,GAAOjB,UAAYjQ,EAC1C8U,GAAgBD,GAAcA,GAAYE,QAAU/U,EACpDgV,GAAiBH,GAAcA,GAAYvE,SAAWtQ,EAyH1D,SAASiV,GAAO7c,GACd,GAAI8c,GAAa9c,KAAW+c,GAAQ/c,MAAYA,aAAiBgd,IAAc,CAC7E,GAAIhd,aAAiBid,GACnB,OAAOjd,EAET,GAAImY,GAAe1G,KAAKzR,EAAO,eAC7B,OAAOkd,GAAald,EAExB,CACA,OAAO,IAAIid,GAAcjd,EAC3B,CAUA,IAAImd,GAAc,WAChB,SAASjJ,IAAU,CACnB,OAAO,SAASkJ,GACd,IAAKC,GAASD,GACZ,MAAO,CAAC,EAEV,GAAIjE,GACF,OAAOA,GAAaiE,GAEtBlJ,EAAO2D,UAAYuF,EACnB,IAAI9K,EAAS,IAAI4B,EAEjB,OADAA,EAAO2D,UAAYjQ,EACZ0K,CACT,CACF,CAdiB,GAqBjB,SAASgL,KAET,CASA,SAASL,GAAcjd,EAAOud,GAC5B1b,KAAK2b,YAAcxd,EACnB6B,KAAK4b,YAAc,GACnB5b,KAAK6b,YAAcH,EACnB1b,KAAK8b,UAAY,EACjB9b,KAAK+b,WAAahW,CACpB,CA+EA,SAASoV,GAAYhd,GACnB6B,KAAK2b,YAAcxd,EACnB6B,KAAK4b,YAAc,GACnB5b,KAAKgc,QAAU,EACfhc,KAAKic,cAAe,EACpBjc,KAAKkc,cAAgB,GACrBlc,KAAKmc,cAAgB3V,EACrBxG,KAAKoc,UAAY,EACnB,CA+GA,SAASC,GAAKC,GACZ,IAAIpM,GAAS,EACTP,EAAoB,MAAX2M,EAAkB,EAAIA,EAAQ3M,OAG3C,IADA3P,KAAKuc,UACIrM,EAAQP,GAAQ,CACvB,IAAI6M,EAAQF,EAAQpM,GACpBlQ,KAAKuB,IAAIib,EAAM,GAAIA,EAAM,GAC3B,CACF,CA+FA,SAASC,GAAUH,GACjB,IAAIpM,GAAS,EACTP,EAAoB,MAAX2M,EAAkB,EAAIA,EAAQ3M,OAG3C,IADA3P,KAAKuc,UACIrM,EAAQP,GAAQ,CACvB,IAAI6M,EAAQF,EAAQpM,GACpBlQ,KAAKuB,IAAIib,EAAM,GAAIA,EAAM,GAC3B,CACF,CA4GA,SAASE,GAASJ,GAChB,IAAIpM,GAAS,EACTP,EAAoB,MAAX2M,EAAkB,EAAIA,EAAQ3M,OAG3C,IADA3P,KAAKuc,UACIrM,EAAQP,GAAQ,CACvB,IAAI6M,EAAQF,EAAQpM,GACpBlQ,KAAKuB,IAAIib,EAAM,GAAIA,EAAM,GAC3B,CACF,CA+FA,SAASG,GAAS1L,GAChB,IAAIf,GAAS,EACTP,EAAmB,MAAVsB,EAAiB,EAAIA,EAAOtB,OAGzC,IADA3P,KAAK4c,SAAW,IAAIF,KACXxM,EAAQP,GACf3P,KAAK6c,IAAI5L,EAAOf,GAEpB,CA2CA,SAAS4M,GAAMR,GACb,IAAI9d,EAAOwB,KAAK4c,SAAW,IAAIH,GAAUH,GACzCtc,KAAKiU,KAAOzV,EAAKyV,IACnB,CAoGA,SAAS8I,GAAc5e,EAAO6e,GAC5B,IAAIC,EAAQ/B,GAAQ/c,GAChB+e,GAASD,GAASE,GAAYhf,GAC9Bif,GAAUH,IAAUC,GAASnE,GAAS5a,GACtCkf,GAAUJ,IAAUC,IAAUE,GAAU9N,GAAanR,GACrDmf,EAAcL,GAASC,GAASE,GAAUC,EAC1C5M,EAAS6M,EAAc7K,GAAUtU,EAAMwR,OAAQkG,IAAU,GACzDlG,EAASc,EAAOd,OAEpB,IAAK,IAAIiC,KAAOzT,GACT6e,IAAa1G,GAAe1G,KAAKzR,EAAOyT,IACvC0L,IAEQ,UAAP1L,GAECwL,IAAkB,UAAPxL,GAA0B,UAAPA,IAE9ByL,IAAkB,UAAPzL,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD2L,GAAQ3L,EAAKjC,KAElBc,EAAO7K,KAAKgM,GAGhB,OAAOnB,CACT,CASA,SAAS+M,GAAY1N,GACnB,IAAIH,EAASG,EAAMH,OACnB,OAAOA,EAASG,EAAM2N,GAAW,EAAG9N,EAAS,IAAM5J,CACrD,CAUA,SAAS2X,GAAgB5N,EAAO4C,GAC9B,OAAOiL,GAAYC,GAAU9N,GAAQ+N,GAAUnL,EAAG,EAAG5C,EAAMH,QAC7D,CASA,SAASmO,GAAahO,GACpB,OAAO6N,GAAYC,GAAU9N,GAC/B,CAWA,SAASiO,GAAiB1L,EAAQT,EAAKzT,IAChCA,IAAU4H,IAAciY,GAAG3L,EAAOT,GAAMzT,IACxCA,IAAU4H,KAAe6L,KAAOS,KACnC4L,GAAgB5L,EAAQT,EAAKzT,EAEjC,CAYA,SAAS+f,GAAY7L,EAAQT,EAAKzT,GAChC,IAAIggB,EAAW9L,EAAOT,GAChB0E,GAAe1G,KAAKyC,EAAQT,IAAQoM,GAAGG,EAAUhgB,KAClDA,IAAU4H,GAAe6L,KAAOS,IACnC4L,GAAgB5L,EAAQT,EAAKzT,EAEjC,CAUA,SAASigB,GAAatO,EAAO8B,GAE3B,IADA,IAAIjC,EAASG,EAAMH,OACZA,KACL,GAAIqO,GAAGlO,EAAMH,GAAQ,GAAIiC,GACvB,OAAOjC,EAGX,OAAQ,CACV,CAaA,SAAS0O,GAAe3M,EAAY3B,EAAQC,EAAUC,GAIpD,OAHAqO,GAAS5M,GAAY,SAASvT,EAAOyT,EAAKF,GACxC3B,EAAOE,EAAa9R,EAAO6R,EAAS7R,GAAQuT,EAC9C,IACOzB,CACT,CAWA,SAASsO,GAAWlM,EAAQzJ,GAC1B,OAAOyJ,GAAUmM,GAAW5V,EAAQ8N,GAAK9N,GAASyJ,EACpD,CAwBA,SAAS4L,GAAgB5L,EAAQT,EAAKzT,GACzB,aAAPyT,GAAsBoG,GACxBA,GAAe3F,EAAQT,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASzT,EACT,UAAY,IAGdkU,EAAOT,GAAOzT,CAElB,CAUA,SAASsgB,GAAOpM,EAAQqM,GAMtB,IALA,IAAIxO,GAAS,EACTP,EAAS+O,EAAM/O,OACfc,EAASM,EAAMpB,GACfgP,EAAiB,MAAVtM,IAEFnC,EAAQP,GACfc,EAAOP,GAASyO,EAAO5Y,EAAY3E,GAAIiR,EAAQqM,EAAMxO,IAEvD,OAAOO,CACT,CAWA,SAASoN,GAAUe,EAAQC,EAAOC,GAShC,OARIF,GAAWA,IACTE,IAAU/Y,IACZ6Y,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAU9Y,IACZ6Y,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,CACT,CAkBA,SAASG,GAAU5gB,EAAO6gB,EAASC,EAAYrN,EAAKS,EAAQ6M,GAC1D,IAAIzO,EACA0O,EArkFc,EAqkFLH,EACTI,EArkFc,EAqkFLJ,EACTK,EArkFiB,EAqkFRL,EAKb,GAHIC,IACFxO,EAAS4B,EAAS4M,EAAW9gB,EAAOyT,EAAKS,EAAQ6M,GAASD,EAAW9gB,IAEnEsS,IAAW1K,EACb,OAAO0K,EAET,IAAK+K,GAASrd,GACZ,OAAOA,EAET,IAAI8e,EAAQ/B,GAAQ/c,GACpB,GAAI8e,GAEF,GADAxM,EA68GJ,SAAwBX,GACtB,IAAIH,EAASG,EAAMH,OACfc,EAAS,IAAIX,EAAMwP,YAAY3P,GAOnC,OAJIA,GAA6B,iBAAZG,EAAM,IAAkBwG,GAAe1G,KAAKE,EAAO,WACtEW,EAAOP,MAAQJ,EAAMI,MACrBO,EAAO8O,MAAQzP,EAAMyP,OAEhB9O,CACT,CAv9Ga+O,CAAerhB,IACnBghB,EACH,OAAOvB,GAAUzf,EAAOsS,OAErB,CACL,IAAIgP,EAAMC,GAAOvhB,GACbwhB,EAASF,GAAO1Y,GAAW0Y,GAAOzY,EAEtC,GAAI+R,GAAS5a,GACX,OAAOyhB,GAAYzhB,EAAOghB,GAE5B,GAAIM,GAAOtY,GAAasY,GAAO/Y,GAAYiZ,IAAWtN,GAEpD,GADA5B,EAAU2O,GAAUO,EAAU,CAAC,EAAIE,GAAgB1hB,IAC9CghB,EACH,OAAOC,EA+nEf,SAAuBxW,EAAQyJ,GAC7B,OAAOmM,GAAW5V,EAAQkX,GAAalX,GAASyJ,EAClD,CAhoEY0N,CAAc5hB,EAnH1B,SAAsBkU,EAAQzJ,GAC5B,OAAOyJ,GAAUmM,GAAW5V,EAAQoX,GAAOpX,GAASyJ,EACtD,CAiHiC4N,CAAaxP,EAAQtS,IAknEtD,SAAqByK,EAAQyJ,GAC3B,OAAOmM,GAAW5V,EAAQsX,GAAWtX,GAASyJ,EAChD,CAnnEY8N,CAAYhiB,EAAOogB,GAAW9N,EAAQtS,QAEvC,CACL,IAAK+O,GAAcuS,GACjB,OAAOpN,EAASlU,EAAQ,CAAC,EAE3BsS,EA49GN,SAAwB4B,EAAQoN,EAAKN,GACnC,IAzlDmBiB,EAylDfC,EAAOhO,EAAOiN,YAClB,OAAQG,GACN,KAAK/X,EACH,OAAO4Y,GAAiBjO,GAE1B,KAAKzL,EACL,KAAKC,EACH,OAAO,IAAIwZ,GAAMhO,GAEnB,KAAK1K,EACH,OA5nDN,SAAuB4Y,EAAUpB,GAC/B,IAAIqB,EAASrB,EAASmB,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASjB,YAAYkB,EAAQD,EAASE,WAAYF,EAASG,WACxE,CAynDaC,CAActO,EAAQ8M,GAE/B,KAAKvX,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OAAOwY,GAAgBvO,EAAQ8M,GAEjC,KAAKlY,EACH,OAAO,IAAIoZ,EAEb,KAAKnZ,EACL,KAAKK,EACH,OAAO,IAAI8Y,EAAKhO,GAElB,KAAKhL,EACH,OA/nDN,SAAqBwZ,GACnB,IAAIpQ,EAAS,IAAIoQ,EAAOvB,YAAYuB,EAAOjY,OAAQmB,GAAQ0M,KAAKoK,IAEhE,OADApQ,EAAOkE,UAAYkM,EAAOlM,UACnBlE,CACT,CA2nDaqQ,CAAYzO,GAErB,KAAK/K,EACH,OAAO,IAAI+Y,EAEb,KAAK7Y,EACH,OAxnDe4Y,EAwnDI/N,EAvnDhBwI,GAAgBnN,GAAOmN,GAAcjL,KAAKwQ,IAAW,CAAC,EAynD/D,CA9/GeW,CAAe5iB,EAAOshB,EAAKN,EACtC,CACF,CAEAD,IAAUA,EAAQ,IAAIpC,IACtB,IAAIkE,EAAU9B,EAAM9d,IAAIjD,GACxB,GAAI6iB,EACF,OAAOA,EAET9B,EAAM3d,IAAIpD,EAAOsS,GAEbrB,GAAMjR,GACRA,EAAM+V,SAAQ,SAAS+M,GACrBxQ,EAAOoM,IAAIkC,GAAUkC,EAAUjC,EAASC,EAAYgC,EAAU9iB,EAAO+gB,GACvE,IACSlQ,GAAM7Q,IACfA,EAAM+V,SAAQ,SAAS+M,EAAUrP,GAC/BnB,EAAOlP,IAAIqQ,EAAKmN,GAAUkC,EAAUjC,EAASC,EAAYrN,EAAKzT,EAAO+gB,GACvE,IAGF,IAIIhhB,EAAQ+e,EAAQlX,GAJLsZ,EACVD,EAAS8B,GAAeC,GACxB/B,EAASY,GAAStJ,IAEkBvY,GASzC,OARAgS,GAAUjS,GAASC,GAAO,SAAS8iB,EAAUrP,GACvC1T,IAEF+iB,EAAW9iB,EADXyT,EAAMqP,IAIR/C,GAAYzN,EAAQmB,EAAKmN,GAAUkC,EAAUjC,EAASC,EAAYrN,EAAKzT,EAAO+gB,GAChF,IACOzO,CACT,CAwBA,SAAS2Q,GAAe/O,EAAQzJ,EAAQ1K,GACtC,IAAIyR,EAASzR,EAAMyR,OACnB,GAAc,MAAV0C,EACF,OAAQ1C,EAGV,IADA0C,EAAS3E,GAAO2E,GACT1C,KAAU,CACf,IAAIiC,EAAM1T,EAAMyR,GACZW,EAAY1H,EAAOgJ,GACnBzT,EAAQkU,EAAOT,GAEnB,GAAKzT,IAAU4H,KAAe6L,KAAOS,KAAa/B,EAAUnS,GAC1D,OAAO,CAEX,CACA,OAAO,CACT,CAYA,SAASkjB,GAAU7R,EAAM8R,EAAM5R,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAIsG,GAAU9P,GAEtB,OAAOuS,IAAW,WAAa/I,EAAKD,MAAMxJ,EAAW2J,EAAO,GAAG4R,EACjE,CAaA,SAASC,GAAezR,EAAOmB,EAAQjB,EAAUa,GAC/C,IAAIX,GAAS,EACTsR,EAAW9Q,GACX+Q,GAAW,EACX9R,EAASG,EAAMH,OACfc,EAAS,GACTiR,EAAezQ,EAAOtB,OAE1B,IAAKA,EACH,OAAOc,EAELT,IACFiB,EAASH,GAASG,EAAQ+B,GAAUhD,KAElCa,GACF2Q,EAAW5Q,GACX6Q,GAAW,GAEJxQ,EAAOtB,QAtvFG,MAuvFjB6R,EAAWtO,GACXuO,GAAW,EACXxQ,EAAS,IAAI0L,GAAS1L,IAExB0Q,EACA,OAASzR,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdrR,EAAuB,MAAZmR,EAAmB7R,EAAQ6R,EAAS7R,GAGnD,GADAA,EAAS0S,GAAwB,IAAV1S,EAAeA,EAAQ,EAC1CsjB,GAAY5iB,GAAaA,EAAU,CAErC,IADA,IAAI+iB,EAAcF,EACXE,KACL,GAAI3Q,EAAO2Q,KAAiB/iB,EAC1B,SAAS8iB,EAGblR,EAAO7K,KAAKzH,EACd,MACUqjB,EAASvQ,EAAQpS,EAAUgS,IACnCJ,EAAO7K,KAAKzH,EAEhB,CACA,OAAOsS,CACT,CAlkCAuK,GAAO6G,iBAAmB,CAQxB,OAAU/Y,EAQV,SAAYC,EAQZ,YAAeC,EAQf,SAAY,GAQZ,QAAW,CAQT,EAAKgS,KAKTA,GAAOhF,UAAYyF,GAAWzF,UAC9BgF,GAAOhF,UAAUsJ,YAActE,GAE/BI,GAAcpF,UAAYsF,GAAWG,GAAWzF,WAChDoF,GAAcpF,UAAUsJ,YAAclE,GAsHtCD,GAAYnF,UAAYsF,GAAWG,GAAWzF,WAC9CmF,GAAYnF,UAAUsJ,YAAcnE,GAoGpCkB,GAAKrG,UAAUuG,MAvEf,WACEvc,KAAK4c,SAAWzC,GAAeA,GAAa,MAAQ,CAAC,EACrDna,KAAKiU,KAAO,CACd,EAqEAoI,GAAKrG,UAAkB,OAzDvB,SAAoBpE,GAClB,IAAInB,EAASzQ,KAAKoT,IAAIxB,WAAe5R,KAAK4c,SAAShL,GAEnD,OADA5R,KAAKiU,MAAQxD,EAAS,EAAI,EACnBA,CACT,EAsDA4L,GAAKrG,UAAU5U,IA3Cf,SAAiBwQ,GACf,IAAIpT,EAAOwB,KAAK4c,SAChB,GAAIzC,GAAc,CAChB,IAAI1J,EAASjS,EAAKoT,GAClB,OAAOnB,IAAWxK,EAAiBF,EAAY0K,CACjD,CACA,OAAO6F,GAAe1G,KAAKpR,EAAMoT,GAAOpT,EAAKoT,GAAO7L,CACtD,EAqCAsW,GAAKrG,UAAU5C,IA1Bf,SAAiBxB,GACf,IAAIpT,EAAOwB,KAAK4c,SAChB,OAAOzC,GAAgB3b,EAAKoT,KAAS7L,EAAauQ,GAAe1G,KAAKpR,EAAMoT,EAC9E,EAwBAyK,GAAKrG,UAAUzU,IAZf,SAAiBqQ,EAAKzT,GACpB,IAAIK,EAAOwB,KAAK4c,SAGhB,OAFA5c,KAAKiU,MAAQjU,KAAKoT,IAAIxB,GAAO,EAAI,EACjCpT,EAAKoT,GAAQuI,IAAgBhc,IAAU4H,EAAaE,EAAiB9H,EAC9D6B,IACT,EAwHAyc,GAAUzG,UAAUuG,MApFpB,WACEvc,KAAK4c,SAAW,GAChB5c,KAAKiU,KAAO,CACd,EAkFAwI,GAAUzG,UAAkB,OAvE5B,SAAyBpE,GACvB,IAAIpT,EAAOwB,KAAK4c,SACZ1M,EAAQkO,GAAa5f,EAAMoT,GAE/B,QAAI1B,EAAQ,IAIRA,GADY1R,EAAKmR,OAAS,EAE5BnR,EAAKsjB,MAELrK,GAAO7H,KAAKpR,EAAM0R,EAAO,KAEzBlQ,KAAKiU,KACA,GACT,EAyDAwI,GAAUzG,UAAU5U,IA9CpB,SAAsBwQ,GACpB,IAAIpT,EAAOwB,KAAK4c,SACZ1M,EAAQkO,GAAa5f,EAAMoT,GAE/B,OAAO1B,EAAQ,EAAInK,EAAYvH,EAAK0R,GAAO,EAC7C,EA0CAuM,GAAUzG,UAAU5C,IA/BpB,SAAsBxB,GACpB,OAAOwM,GAAape,KAAK4c,SAAUhL,IAAQ,CAC7C,EA8BA6K,GAAUzG,UAAUzU,IAlBpB,SAAsBqQ,EAAKzT,GACzB,IAAIK,EAAOwB,KAAK4c,SACZ1M,EAAQkO,GAAa5f,EAAMoT,GAQ/B,OANI1B,EAAQ,KACRlQ,KAAKiU,KACPzV,EAAKoH,KAAK,CAACgM,EAAKzT,KAEhBK,EAAK0R,GAAO,GAAK/R,EAEZ6B,IACT,EA0GA0c,GAAS1G,UAAUuG,MAtEnB,WACEvc,KAAKiU,KAAO,EACZjU,KAAK4c,SAAW,CACd,KAAQ,IAAIP,GACZ,IAAO,IAAKtC,IAAO0C,IACnB,OAAU,IAAIJ,GAElB,EAgEAK,GAAS1G,UAAkB,OArD3B,SAAwBpE,GACtB,IAAInB,EAASsR,GAAW/hB,KAAM4R,GAAa,OAAEA,GAE7C,OADA5R,KAAKiU,MAAQxD,EAAS,EAAI,EACnBA,CACT,EAkDAiM,GAAS1G,UAAU5U,IAvCnB,SAAqBwQ,GACnB,OAAOmQ,GAAW/hB,KAAM4R,GAAKxQ,IAAIwQ,EACnC,EAsCA8K,GAAS1G,UAAU5C,IA3BnB,SAAqBxB,GACnB,OAAOmQ,GAAW/hB,KAAM4R,GAAKwB,IAAIxB,EACnC,EA0BA8K,GAAS1G,UAAUzU,IAdnB,SAAqBqQ,EAAKzT,GACxB,IAAIK,EAAOujB,GAAW/hB,KAAM4R,GACxBqC,EAAOzV,EAAKyV,KAIhB,OAFAzV,EAAK+C,IAAIqQ,EAAKzT,GACd6B,KAAKiU,MAAQzV,EAAKyV,MAAQA,EAAO,EAAI,EAC9BjU,IACT,EA0DA2c,GAAS3G,UAAU6G,IAAMF,GAAS3G,UAAUpQ,KAnB5C,SAAqBzH,GAEnB,OADA6B,KAAK4c,SAASrb,IAAIpD,EAAO8H,GAClBjG,IACT,EAiBA2c,GAAS3G,UAAU5C,IANnB,SAAqBjV,GACnB,OAAO6B,KAAK4c,SAASxJ,IAAIjV,EAC3B,EAsGA2e,GAAM9G,UAAUuG,MA3EhB,WACEvc,KAAK4c,SAAW,IAAIH,GACpBzc,KAAKiU,KAAO,CACd,EAyEA6I,GAAM9G,UAAkB,OA9DxB,SAAqBpE,GACnB,IAAIpT,EAAOwB,KAAK4c,SACZnM,EAASjS,EAAa,OAAEoT,GAG5B,OADA5R,KAAKiU,KAAOzV,EAAKyV,KACVxD,CACT,EAyDAqM,GAAM9G,UAAU5U,IA9ChB,SAAkBwQ,GAChB,OAAO5R,KAAK4c,SAASxb,IAAIwQ,EAC3B,EA6CAkL,GAAM9G,UAAU5C,IAlChB,SAAkBxB,GAChB,OAAO5R,KAAK4c,SAASxJ,IAAIxB,EAC3B,EAiCAkL,GAAM9G,UAAUzU,IArBhB,SAAkBqQ,EAAKzT,GACrB,IAAIK,EAAOwB,KAAK4c,SAChB,GAAIpe,aAAgBie,GAAW,CAC7B,IAAIuF,EAAQxjB,EAAKoe,SACjB,IAAK7C,IAAQiI,EAAMrS,OAASsS,IAG1B,OAFAD,EAAMpc,KAAK,CAACgM,EAAKzT,IACjB6B,KAAKiU,OAASzV,EAAKyV,KACZjU,KAETxB,EAAOwB,KAAK4c,SAAW,IAAIF,GAASsF,EACtC,CAGA,OAFAxjB,EAAK+C,IAAIqQ,EAAKzT,GACd6B,KAAKiU,KAAOzV,EAAKyV,KACVjU,IACT,EAqcA,IAAIse,GAAW4D,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAU5Q,EAAYpB,GAC7B,IAAIG,GAAS,EAKb,OAJA6N,GAAS5M,GAAY,SAASvT,EAAO+R,EAAOwB,GAE1C,OADAjB,IAAWH,EAAUnS,EAAO+R,EAAOwB,EAErC,IACOjB,CACT,CAYA,SAAS8R,GAAazS,EAAOE,EAAUa,GAIrC,IAHA,IAAIX,GAAS,EACTP,EAASG,EAAMH,SAEVO,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdsC,EAAUxC,EAAS7R,GAEvB,GAAe,MAAXqU,IAAoB3T,IAAakH,EAC5ByM,GAAYA,IAAYgQ,GAAShQ,GAClC3B,EAAW2B,EAAS3T,IAE1B,IAAIA,EAAW2T,EACX/B,EAAStS,CAEjB,CACA,OAAOsS,CACT,CAsCA,SAASgS,GAAW/Q,EAAYpB,GAC9B,IAAIG,EAAS,GAMb,OALA6N,GAAS5M,GAAY,SAASvT,EAAO+R,EAAOwB,GACtCpB,EAAUnS,EAAO+R,EAAOwB,IAC1BjB,EAAO7K,KAAKzH,EAEhB,IACOsS,CACT,CAaA,SAASiS,GAAY5S,EAAO6S,EAAOrS,EAAWsS,EAAUnS,GACtD,IAAIP,GAAS,EACTP,EAASG,EAAMH,OAKnB,IAHAW,IAAcA,EAAYuS,IAC1BpS,IAAWA,EAAS,MAEXP,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdyS,EAAQ,GAAKrS,EAAUnS,GACrBwkB,EAAQ,EAEVD,GAAYvkB,EAAOwkB,EAAQ,EAAGrS,EAAWsS,EAAUnS,GAEnDO,GAAUP,EAAQtS,GAEVykB,IACVnS,EAAOA,EAAOd,QAAUxR,EAE5B,CACA,OAAOsS,CACT,CAaA,IAAIqS,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAW9P,EAAQrC,GAC1B,OAAOqC,GAAUyQ,GAAQzQ,EAAQrC,EAAU0G,GAC7C,CAUA,SAAS2L,GAAgBhQ,EAAQrC,GAC/B,OAAOqC,GAAU2Q,GAAa3Q,EAAQrC,EAAU0G,GAClD,CAWA,SAASuM,GAAc5Q,EAAQnU,GAC7B,OAAOqS,GAAYrS,GAAO,SAAS0T,GACjC,OAAOsR,GAAW7Q,EAAOT,GAC3B,GACF,CAUA,SAASuR,GAAQ9Q,EAAQ+Q,GAMvB,IAHA,IAAIlT,EAAQ,EACRP,GAHJyT,EAAOC,GAASD,EAAM/Q,IAGJ1C,OAED,MAAV0C,GAAkBnC,EAAQP,GAC/B0C,EAASA,EAAOiR,GAAMF,EAAKlT,OAE7B,OAAQA,GAASA,GAASP,EAAU0C,EAAStM,CAC/C,CAaA,SAASwd,GAAelR,EAAQmR,EAAUC,GACxC,IAAIhT,EAAS+S,EAASnR,GACtB,OAAO6I,GAAQ7I,GAAU5B,EAASO,GAAUP,EAAQgT,EAAYpR,GAClE,CASA,SAASqR,GAAWvlB,GAClB,OAAa,MAATA,EACKA,IAAU4H,EAn7FJ,qBARL,gBA67FF+R,IAAkBA,MAAkBpK,GAAOvP,GA23FrD,SAAmBA,GACjB,IAAIwlB,EAAQrN,GAAe1G,KAAKzR,EAAO2Z,IACnC2H,EAAMthB,EAAM2Z,IAEhB,IACE3Z,EAAM2Z,IAAkB/R,EACxB,IAAI6d,GAAW,CACjB,CAAE,MAAOlV,GAAI,CAEb,IAAI+B,EAASmG,GAAqBhH,KAAKzR,GAQvC,OAPIylB,IACED,EACFxlB,EAAM2Z,IAAkB2H,SAEjBthB,EAAM2Z,KAGVrH,CACT,CA54FMoT,CAAU1lB,GA+5GhB,SAAwBA,GACtB,OAAOyY,GAAqBhH,KAAKzR,EACnC,CAh6GM2lB,CAAe3lB,EACrB,CAWA,SAAS4lB,GAAO5lB,EAAO6lB,GACrB,OAAO7lB,EAAQ6lB,CACjB,CAUA,SAASC,GAAQ5R,EAAQT,GACvB,OAAiB,MAAVS,GAAkBiE,GAAe1G,KAAKyC,EAAQT,EACvD,CAUA,SAASsS,GAAU7R,EAAQT,GACzB,OAAiB,MAAVS,GAAkBT,KAAOlE,GAAO2E,EACzC,CAyBA,SAAS8R,GAAiBC,EAAQpU,EAAUa,GAS1C,IARA,IAAI2Q,EAAW3Q,EAAaD,GAAoBF,GAC5Cf,EAASyU,EAAO,GAAGzU,OACnB0U,EAAYD,EAAOzU,OACnB2U,EAAWD,EACXE,EAASxT,EAAMsT,GACfG,EAAYC,IACZhU,EAAS,GAEN6T,KAAY,CACjB,IAAIxU,EAAQsU,EAAOE,GACfA,GAAYtU,IACdF,EAAQgB,GAAShB,EAAOkD,GAAUhD,KAEpCwU,EAAYlL,GAAUxJ,EAAMH,OAAQ6U,GACpCD,EAAOD,IAAazT,IAAeb,GAAaL,GAAU,KAAOG,EAAMH,QAAU,KAC7E,IAAIgN,GAAS2H,GAAYxU,GACzB/J,CACN,CACA+J,EAAQsU,EAAO,GAEf,IAAIlU,GAAS,EACTwU,EAAOH,EAAO,GAElB5C,EACA,OAASzR,EAAQP,GAAUc,EAAOd,OAAS6U,GAAW,CACpD,IAAIrmB,EAAQ2R,EAAMI,GACdrR,EAAWmR,EAAWA,EAAS7R,GAASA,EAG5C,GADAA,EAAS0S,GAAwB,IAAV1S,EAAeA,EAAQ,IACxCumB,EACExR,GAASwR,EAAM7lB,GACf2iB,EAAS/Q,EAAQ5R,EAAUgS,IAC5B,CAEL,IADAyT,EAAWD,IACFC,GAAU,CACjB,IAAInR,EAAQoR,EAAOD,GACnB,KAAMnR,EACED,GAASC,EAAOtU,GAChB2iB,EAAS4C,EAAOE,GAAWzlB,EAAUgS,IAE3C,SAAS8Q,CAEb,CACI+C,GACFA,EAAK9e,KAAK/G,GAEZ4R,EAAO7K,KAAKzH,EACd,CACF,CACA,OAAOsS,CACT,CA8BA,SAASkU,GAAWtS,EAAQ+Q,EAAM1T,GAGhC,IAAIF,EAAiB,OADrB6C,EAASuS,GAAOvS,EADhB+Q,EAAOC,GAASD,EAAM/Q,KAEMA,EAASA,EAAOiR,GAAMuB,GAAKzB,KACvD,OAAe,MAAR5T,EAAezJ,EAAYwJ,GAAMC,EAAM6C,EAAQ3C,EACxD,CASA,SAASoV,GAAgB3mB,GACvB,OAAO8c,GAAa9c,IAAUulB,GAAWvlB,IAAUuI,CACrD,CAsCA,SAASqe,GAAY5mB,EAAO6lB,EAAOhF,EAASC,EAAYC,GACtD,OAAI/gB,IAAU6lB,IAGD,MAAT7lB,GAA0B,MAAT6lB,IAAmB/I,GAAa9c,KAAW8c,GAAa+I,GACpE7lB,GAAUA,GAAS6lB,GAAUA,EAmBxC,SAAyB3R,EAAQ2R,EAAOhF,EAASC,EAAY+F,EAAW9F,GACtE,IAAI+F,EAAW/J,GAAQ7I,GACnB6S,EAAWhK,GAAQ8I,GACnBmB,EAASF,EAAWte,EAAW+Y,GAAOrN,GACtC+S,EAASF,EAAWve,EAAW+Y,GAAOsE,GAKtCqB,GAHJF,EAASA,GAAUze,EAAUS,EAAYge,IAGhBhe,EACrBme,GAHJF,EAASA,GAAU1e,EAAUS,EAAYie,IAGhBje,EACrBoe,EAAYJ,GAAUC,EAE1B,GAAIG,GAAaxM,GAAS1G,GAAS,CACjC,IAAK0G,GAASiL,GACZ,OAAO,EAETiB,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAnG,IAAUA,EAAQ,IAAIpC,IACdmI,GAAY3V,GAAa+C,GAC7BmT,GAAYnT,EAAQ2R,EAAOhF,EAASC,EAAY+F,EAAW9F,GA81EnE,SAAoB7M,EAAQ2R,EAAOvE,EAAKT,EAASC,EAAY+F,EAAW9F,GACtE,OAAQO,GACN,KAAK9X,EACH,GAAK0K,EAAOqO,YAAcsD,EAAMtD,YAC3BrO,EAAOoO,YAAcuD,EAAMvD,WAC9B,OAAO,EAETpO,EAASA,EAAOmO,OAChBwD,EAAQA,EAAMxD,OAEhB,KAAK9Y,EACH,QAAK2K,EAAOqO,YAAcsD,EAAMtD,aAC3BsE,EAAU,IAAI9N,GAAW7E,GAAS,IAAI6E,GAAW8M,KAKxD,KAAKpd,EACL,KAAKC,EACL,KAAKK,EAGH,OAAO8W,IAAI3L,GAAS2R,GAEtB,KAAKld,EACH,OAAOuL,EAAOtU,MAAQimB,EAAMjmB,MAAQsU,EAAOoT,SAAWzB,EAAMyB,QAE9D,KAAKpe,EACL,KAAKE,EAIH,OAAO8K,GAAW2R,EAAQ,GAE5B,KAAK/c,EACH,IAAIye,EAAU3R,GAEhB,KAAKzM,EACH,IAAIqe,EAxnLe,EAwnLH3G,EAGhB,GAFA0G,IAAYA,EAAUlR,IAElBnC,EAAO4B,MAAQ+P,EAAM/P,OAAS0R,EAChC,OAAO,EAGT,IAAI3E,EAAU9B,EAAM9d,IAAIiR,GACxB,GAAI2O,EACF,OAAOA,GAAWgD,EAEpBhF,GAloLqB,EAqoLrBE,EAAM3d,IAAI8Q,EAAQ2R,GAClB,IAAIvT,EAAS+U,GAAYE,EAAQrT,GAASqT,EAAQ1B,GAAQhF,EAASC,EAAY+F,EAAW9F,GAE1F,OADAA,EAAc,OAAE7M,GACT5B,EAET,KAAKjJ,EACH,GAAIqT,GACF,OAAOA,GAAcjL,KAAKyC,IAAWwI,GAAcjL,KAAKoU,GAG9D,OAAO,CACT,CA55EQ4B,CAAWvT,EAAQ2R,EAAOmB,EAAQnG,EAASC,EAAY+F,EAAW9F,GAExE,KAvvGuB,EAuvGjBF,GAAiC,CACrC,IAAI6G,EAAeR,GAAY/O,GAAe1G,KAAKyC,EAAQ,eACvDyT,EAAeR,GAAYhP,GAAe1G,KAAKoU,EAAO,eAE1D,GAAI6B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAexT,EAAOlU,QAAUkU,EAC/C2T,EAAeF,EAAe9B,EAAM7lB,QAAU6lB,EAGlD,OADA9E,IAAUA,EAAQ,IAAIpC,IACfkI,EAAUe,EAAcC,EAAchH,EAASC,EAAYC,EACpE,CACF,CACA,QAAKqG,IAGLrG,IAAUA,EAAQ,IAAIpC,IA05ExB,SAAsBzK,EAAQ2R,EAAOhF,EAASC,EAAY+F,EAAW9F,GACnE,IAAIyG,EAjqLmB,EAiqLP3G,EACZiH,EAAW9E,GAAW9O,GACtB6T,EAAYD,EAAStW,OAIzB,GAAIuW,GAHW/E,GAAW6C,GACDrU,SAEMgW,EAC7B,OAAO,EAGT,IADA,IAAIzV,EAAQgW,EACLhW,KAAS,CACd,IAAI0B,EAAMqU,EAAS/V,GACnB,KAAMyV,EAAY/T,KAAOoS,EAAQ1N,GAAe1G,KAAKoU,EAAOpS,IAC1D,OAAO,CAEX,CAEA,IAAIuU,EAAajH,EAAM9d,IAAIiR,GACvB+T,EAAalH,EAAM9d,IAAI4iB,GAC3B,GAAImC,GAAcC,EAChB,OAAOD,GAAcnC,GAASoC,GAAc/T,EAE9C,IAAI5B,GAAS,EACbyO,EAAM3d,IAAI8Q,EAAQ2R,GAClB9E,EAAM3d,IAAIyiB,EAAO3R,GAGjB,IADA,IAAIgU,EAAWV,IACNzV,EAAQgW,GAAW,CAE1B,IAAI/H,EAAW9L,EADfT,EAAMqU,EAAS/V,IAEXoW,EAAWtC,EAAMpS,GAErB,GAAIqN,EACF,IAAIsH,EAAWZ,EACX1G,EAAWqH,EAAUnI,EAAUvM,EAAKoS,EAAO3R,EAAQ6M,GACnDD,EAAWd,EAAUmI,EAAU1U,EAAKS,EAAQ2R,EAAO9E,GAGzD,KAAMqH,IAAaxgB,EACVoY,IAAamI,GAAYtB,EAAU7G,EAAUmI,EAAUtH,EAASC,EAAYC,GAC7EqH,GACD,CACL9V,GAAS,EACT,KACF,CACA4V,IAAaA,EAAkB,eAAPzU,EAC1B,CACA,GAAInB,IAAW4V,EAAU,CACvB,IAAIG,EAAUnU,EAAOiN,YACjBmH,EAAUzC,EAAM1E,YAGhBkH,GAAWC,KACV,gBAAiBpU,MAAU,gBAAiB2R,IACzB,mBAAXwC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDhW,GAAS,EAEb,CAGA,OAFAyO,EAAc,OAAE7M,GAChB6M,EAAc,OAAE8E,GACTvT,CACT,CAx9ESiW,CAAarU,EAAQ2R,EAAOhF,EAASC,EAAY+F,EAAW9F,GACrE,CA5DSyH,CAAgBxoB,EAAO6lB,EAAOhF,EAASC,EAAY8F,GAAa7F,GACzE,CAkFA,SAAS0H,GAAYvU,EAAQzJ,EAAQie,EAAW5H,GAC9C,IAAI/O,EAAQ2W,EAAUlX,OAClBA,EAASO,EACT4W,GAAgB7H,EAEpB,GAAc,MAAV5M,EACF,OAAQ1C,EAGV,IADA0C,EAAS3E,GAAO2E,GACTnC,KAAS,CACd,IAAI1R,EAAOqoB,EAAU3W,GACrB,GAAK4W,GAAgBtoB,EAAK,GAClBA,EAAK,KAAO6T,EAAO7T,EAAK,MACtBA,EAAK,KAAM6T,GAEnB,OAAO,CAEX,CACA,OAASnC,EAAQP,GAAQ,CAEvB,IAAIiC,GADJpT,EAAOqoB,EAAU3W,IACF,GACXiO,EAAW9L,EAAOT,GAClBmV,EAAWvoB,EAAK,GAEpB,GAAIsoB,GAAgBtoB,EAAK,IACvB,GAAI2f,IAAapY,KAAe6L,KAAOS,GACrC,OAAO,MAEJ,CACL,IAAI6M,EAAQ,IAAIpC,GAChB,GAAImC,EACF,IAAIxO,EAASwO,EAAWd,EAAU4I,EAAUnV,EAAKS,EAAQzJ,EAAQsW,GAEnE,KAAMzO,IAAW1K,EACTgf,GAAYgC,EAAU5I,EAAU6I,EAA+C/H,EAAYC,GAC3FzO,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,CAUA,SAASwW,GAAa9oB,GACpB,SAAKqd,GAASrd,KA05FEqR,EA15FiBrR,EA25FxBqY,IAAeA,MAAchH,MAx5FxB0T,GAAW/kB,GAAS4Y,GAAa7M,IAChC4J,KAAKyG,GAASpc,IAs5F/B,IAAkBqR,CAr5FlB,CA2CA,SAAS0X,GAAa/oB,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKgpB,GAEW,iBAAThpB,EACF+c,GAAQ/c,GACXipB,GAAoBjpB,EAAM,GAAIA,EAAM,IACpCkpB,GAAYlpB,GAEXmD,GAASnD,EAClB,CASA,SAASmpB,GAASjV,GAChB,IAAKkV,GAAYlV,GACf,OAAO8G,GAAW9G,GAEpB,IAAI5B,EAAS,GACb,IAAK,IAAImB,KAAOlE,GAAO2E,GACjBiE,GAAe1G,KAAKyC,EAAQT,IAAe,eAAPA,GACtCnB,EAAO7K,KAAKgM,GAGhB,OAAOnB,CACT,CAiCA,SAAS+W,GAAOrpB,EAAO6lB,GACrB,OAAO7lB,EAAQ6lB,CACjB,CAUA,SAASyD,GAAQ/V,EAAY1B,GAC3B,IAAIE,GAAS,EACTO,EAASiX,GAAYhW,GAAcX,EAAMW,EAAW/B,QAAU,GAKlE,OAHA2O,GAAS5M,GAAY,SAASvT,EAAOyT,EAAKF,GACxCjB,IAASP,GAASF,EAAS7R,EAAOyT,EAAKF,EACzC,IACOjB,CACT,CASA,SAAS4W,GAAYze,GACnB,IAAIie,EAAYc,GAAa/e,GAC7B,OAAwB,GAApBie,EAAUlX,QAAekX,EAAU,GAAG,GACjCe,GAAwBf,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASxU,GACd,OAAOA,IAAWzJ,GAAUge,GAAYvU,EAAQzJ,EAAQie,EAC1D,CACF,CAUA,SAASO,GAAoBhE,EAAM2D,GACjC,OAAIc,GAAMzE,IAAS0E,GAAmBf,GAC7Ba,GAAwBtE,GAAMF,GAAO2D,GAEvC,SAAS1U,GACd,IAAI8L,EAAW/c,GAAIiR,EAAQ+Q,GAC3B,OAAQjF,IAAapY,GAAaoY,IAAa4I,EAC3CgB,GAAM1V,EAAQ+Q,GACd2B,GAAYgC,EAAU5I,EAAU6I,EACtC,CACF,CAaA,SAASgB,GAAU3V,EAAQzJ,EAAQqf,EAAUhJ,EAAYC,GACnD7M,IAAWzJ,GAGfka,GAAQla,GAAQ,SAASme,EAAUnV,GAEjC,GADAsN,IAAUA,EAAQ,IAAIpC,IAClBtB,GAASuL,IA+BjB,SAAuB1U,EAAQzJ,EAAQgJ,EAAKqW,EAAUC,EAAWjJ,EAAYC,GAC3E,IAAIf,EAAWgK,GAAQ9V,EAAQT,GAC3BmV,EAAWoB,GAAQvf,EAAQgJ,GAC3BoP,EAAU9B,EAAM9d,IAAI2lB,GAExB,GAAI/F,EACFjD,GAAiB1L,EAAQT,EAAKoP,OADhC,CAIA,IAAIxf,EAAWyd,EACXA,EAAWd,EAAU4I,EAAWnV,EAAM,GAAKS,EAAQzJ,EAAQsW,GAC3DnZ,EAEA0b,EAAWjgB,IAAauE,EAE5B,GAAI0b,EAAU,CACZ,IAAIxE,EAAQ/B,GAAQ6L,GAChB3J,GAAUH,GAASlE,GAASgO,GAC5BqB,GAAWnL,IAAUG,GAAU9N,GAAayX,GAEhDvlB,EAAWulB,EACP9J,GAASG,GAAUgL,EACjBlN,GAAQiD,GACV3c,EAAW2c,EAEJkK,GAAkBlK,GACzB3c,EAAWoc,GAAUO,GAEdf,GACPqE,GAAW,EACXjgB,EAAWoe,GAAYmH,GAAU,IAE1BqB,GACP3G,GAAW,EACXjgB,EAAWof,GAAgBmG,GAAU,IAGrCvlB,EAAW,GAGN8mB,GAAcvB,IAAa5J,GAAY4J,IAC9CvlB,EAAW2c,EACPhB,GAAYgB,GACd3c,EAAW+mB,GAAcpK,GAEjB3C,GAAS2C,KAAa+E,GAAW/E,KACzC3c,EAAWqe,GAAgBkH,KAI7BtF,GAAW,CAEf,CACIA,IAEFvC,EAAM3d,IAAIwlB,EAAUvlB,GACpB0mB,EAAU1mB,EAAUulB,EAAUkB,EAAUhJ,EAAYC,GACpDA,EAAc,OAAE6H,IAElBhJ,GAAiB1L,EAAQT,EAAKpQ,EAnD9B,CAoDF,CA1FMgnB,CAAcnW,EAAQzJ,EAAQgJ,EAAKqW,EAAUD,GAAW/I,EAAYC,OAEjE,CACH,IAAI1d,EAAWyd,EACXA,EAAWkJ,GAAQ9V,EAAQT,GAAMmV,EAAWnV,EAAM,GAAKS,EAAQzJ,EAAQsW,GACvEnZ,EAEAvE,IAAauE,IACfvE,EAAWulB,GAEbhJ,GAAiB1L,EAAQT,EAAKpQ,EAChC,CACF,GAAGwe,GACL,CAuFA,SAASyI,GAAQ3Y,EAAO4C,GACtB,IAAI/C,EAASG,EAAMH,OACnB,GAAKA,EAIL,OAAO4N,GADP7K,GAAKA,EAAI,EAAI/C,EAAS,EACJA,GAAUG,EAAM4C,GAAK3M,CACzC,CAWA,SAAS2iB,GAAYhX,EAAYiX,EAAWC,GAExCD,EADEA,EAAUhZ,OACAmB,GAAS6X,GAAW,SAAS3Y,GACvC,OAAIkL,GAAQlL,GACH,SAAS7R,GACd,OAAOglB,GAAQhlB,EAA2B,IAApB6R,EAASL,OAAeK,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAACmX,IAGf,IAAIjX,GAAS,EACbyY,EAAY7X,GAAS6X,EAAW3V,GAAU6V,OAE1C,IAAIpY,EAASgX,GAAQ/V,GAAY,SAASvT,EAAOyT,EAAKF,GACpD,IAAIoX,EAAWhY,GAAS6X,GAAW,SAAS3Y,GAC1C,OAAOA,EAAS7R,EAClB,IACA,MAAO,CAAE,SAAY2qB,EAAU,QAAW5Y,EAAO,MAAS/R,EAC5D,IAEA,OA5xFJ,SAAoB2R,EAAOiZ,GACzB,IAAIpZ,EAASG,EAAMH,OAGnB,IADAG,EAAMkZ,MAyxFsB,SAAS3W,EAAQ2R,GACzC,OA04BJ,SAAyB3R,EAAQ2R,EAAO4E,GAOtC,IANA,IAAI1Y,GAAS,EACT+Y,EAAc5W,EAAOyW,SACrBI,EAAclF,EAAM8E,SACpBnZ,EAASsZ,EAAYtZ,OACrBwZ,EAAeP,EAAOjZ,SAEjBO,EAAQP,GAAQ,CACvB,IAAIc,EAAS2Y,GAAiBH,EAAY/Y,GAAQgZ,EAAYhZ,IAC9D,GAAIO,EACF,OAAIP,GAASiZ,EACJ1Y,EAGFA,GAAmB,QADdmY,EAAO1Y,IACiB,EAAI,EAE5C,CAQA,OAAOmC,EAAOnC,MAAQ8T,EAAM9T,KAC9B,CAn6BWmZ,CAAgBhX,EAAQ2R,EAAO4E,EACxC,IA1xFKjZ,KACLG,EAAMH,GAAUG,EAAMH,GAAQxR,MAEhC,OAAO2R,CACT,CAoxFWwZ,CAAW7Y,EAGpB,CA0BA,SAAS8Y,GAAWlX,EAAQqM,EAAOpO,GAKjC,IAJA,IAAIJ,GAAS,EACTP,EAAS+O,EAAM/O,OACfc,EAAS,CAAC,IAELP,EAAQP,GAAQ,CACvB,IAAIyT,EAAO1E,EAAMxO,GACb/R,EAAQglB,GAAQ9Q,EAAQ+Q,GAExB9S,EAAUnS,EAAOilB,IACnBoG,GAAQ/Y,EAAQ4S,GAASD,EAAM/Q,GAASlU,EAE5C,CACA,OAAOsS,CACT,CA0BA,SAASgZ,GAAY3Z,EAAOmB,EAAQjB,EAAUa,GAC5C,IAAI6Y,EAAU7Y,EAAaqB,GAAkBvB,GACzCT,GAAS,EACTP,EAASsB,EAAOtB,OAChB+U,EAAO5U,EAQX,IANIA,IAAUmB,IACZA,EAAS2M,GAAU3M,IAEjBjB,IACF0U,EAAO5T,GAAShB,EAAOkD,GAAUhD,OAE1BE,EAAQP,GAKf,IAJA,IAAImC,EAAY,EACZ3T,EAAQ8S,EAAOf,GACfrR,EAAWmR,EAAWA,EAAS7R,GAASA,GAEpC2T,EAAY4X,EAAQhF,EAAM7lB,EAAUiT,EAAWjB,KAAgB,GACjE6T,IAAS5U,GACX2H,GAAO7H,KAAK8U,EAAM5S,EAAW,GAE/B2F,GAAO7H,KAAKE,EAAOgC,EAAW,GAGlC,OAAOhC,CACT,CAWA,SAAS6Z,GAAW7Z,EAAO8Z,GAIzB,IAHA,IAAIja,EAASG,EAAQ8Z,EAAQja,OAAS,EAClCgF,EAAYhF,EAAS,EAElBA,KAAU,CACf,IAAIO,EAAQ0Z,EAAQja,GACpB,GAAIA,GAAUgF,GAAazE,IAAU2Z,EAAU,CAC7C,IAAIA,EAAW3Z,EACXqN,GAAQrN,GACVuH,GAAO7H,KAAKE,EAAOI,EAAO,GAE1B4Z,GAAUha,EAAOI,EAErB,CACF,CACA,OAAOJ,CACT,CAWA,SAAS2N,GAAWoB,EAAOC,GACzB,OAAOD,EAAQnG,GAAYgB,MAAkBoF,EAAQD,EAAQ,GAC/D,CAiCA,SAASkL,GAAWnX,EAAQF,GAC1B,IAAIjC,EAAS,GACb,IAAKmC,GAAUF,EAAI,GAAKA,EAAIpM,EAC1B,OAAOmK,EAIT,GACMiC,EAAI,IACNjC,GAAUmC,IAEZF,EAAIgG,GAAYhG,EAAI,MAElBE,GAAUA,SAELF,GAET,OAAOjC,CACT,CAUA,SAASuZ,GAASxa,EAAMya,GACtB,OAAOC,GAAYC,GAAS3a,EAAMya,EAAO9C,IAAW3X,EAAO,GAC7D,CASA,SAAS4a,GAAW1Y,GAClB,OAAO8L,GAAYvM,GAAOS,GAC5B,CAUA,SAAS2Y,GAAe3Y,EAAYgB,GAClC,IAAI5C,EAAQmB,GAAOS,GACnB,OAAOiM,GAAY7N,EAAO+N,GAAUnL,EAAG,EAAG5C,EAAMH,QAClD,CAYA,SAAS6Z,GAAQnX,EAAQ+Q,EAAMjlB,EAAO8gB,GACpC,IAAKzD,GAASnJ,GACZ,OAAOA,EAST,IALA,IAAInC,GAAS,EACTP,GAHJyT,EAAOC,GAASD,EAAM/Q,IAGJ1C,OACdgF,EAAYhF,EAAS,EACrB2a,EAASjY,EAEI,MAAViY,KAAoBpa,EAAQP,GAAQ,CACzC,IAAIiC,EAAM0R,GAAMF,EAAKlT,IACjB1O,EAAWrD,EAEf,GAAY,cAARyT,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOS,EAGT,GAAInC,GAASyE,EAAW,CACtB,IAAIwJ,EAAWmM,EAAO1Y,IACtBpQ,EAAWyd,EAAaA,EAAWd,EAAUvM,EAAK0Y,GAAUvkB,KAC3CA,IACfvE,EAAWga,GAAS2C,GAChBA,EACCZ,GAAQ6F,EAAKlT,EAAQ,IAAM,GAAK,CAAC,EAE1C,CACAgO,GAAYoM,EAAQ1Y,EAAKpQ,GACzB8oB,EAASA,EAAO1Y,EAClB,CACA,OAAOS,CACT,CAUA,IAAIkY,GAAenQ,GAAqB,SAAS5K,EAAMhR,GAErD,OADA4b,GAAQ7Y,IAAIiO,EAAMhR,GACXgR,CACT,EAH6B2X,GAazBqD,GAAmBxS,GAA4B,SAASxI,EAAMoD,GAChE,OAAOoF,GAAexI,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASib,GAAS7X,GAClB,UAAY,GAEhB,EAPwCuU,GAgBxC,SAASuD,GAAYhZ,GACnB,OAAOiM,GAAY1M,GAAOS,GAC5B,CAWA,SAASiZ,GAAU7a,EAAOma,EAAOW,GAC/B,IAAI1a,GAAS,EACTP,EAASG,EAAMH,OAEfsa,EAAQ,IACVA,GAASA,EAAQta,EAAS,EAAKA,EAASsa,IAE1CW,EAAMA,EAAMjb,EAASA,EAASib,GACpB,IACRA,GAAOjb,GAETA,EAASsa,EAAQW,EAAM,EAAMA,EAAMX,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIxZ,EAASM,EAAMpB,KACVO,EAAQP,GACfc,EAAOP,GAASJ,EAAMI,EAAQ+Z,GAEhC,OAAOxZ,CACT,CAWA,SAASoa,GAASnZ,EAAYpB,GAC5B,IAAIG,EAMJ,OAJA6N,GAAS5M,GAAY,SAASvT,EAAO+R,EAAOwB,GAE1C,QADAjB,EAASH,EAAUnS,EAAO+R,EAAOwB,GAEnC,MACSjB,CACX,CAcA,SAASqa,GAAgBhb,EAAO3R,EAAO4sB,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATnb,EAAgBkb,EAAMlb,EAAMH,OAEvC,GAAoB,iBAATxR,GAAqBA,GAAUA,GAAS8sB,GAn/H3BzkB,WAm/H0D,CAChF,KAAOwkB,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvBpsB,EAAWiR,EAAMob,GAEJ,OAAbrsB,IAAsB2jB,GAAS3jB,KAC9BksB,EAAclsB,GAAYV,EAAUU,EAAWV,GAClD6sB,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACA,OAAOD,CACT,CACA,OAAOE,GAAkBrb,EAAO3R,EAAOgpB,GAAU4D,EACnD,CAeA,SAASI,GAAkBrb,EAAO3R,EAAO6R,EAAU+a,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATnb,EAAgB,EAAIA,EAAMH,OACrC,GAAa,IAATsb,EACF,OAAO,EAST,IALA,IAAIG,GADJjtB,EAAQ6R,EAAS7R,KACQA,EACrBktB,EAAsB,OAAVltB,EACZmtB,EAAc9I,GAASrkB,GACvBotB,EAAiBptB,IAAU4H,EAExBilB,EAAMC,GAAM,CACjB,IAAIC,EAAMxS,IAAasS,EAAMC,GAAQ,GACjCpsB,EAAWmR,EAASF,EAAMob,IAC1BM,EAAe3sB,IAAakH,EAC5B0lB,EAAyB,OAAb5sB,EACZ6sB,EAAiB7sB,GAAaA,EAC9B8sB,EAAcnJ,GAAS3jB,GAE3B,GAAIusB,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAclsB,GAAYV,EAAUU,EAAWV,GAEtDytB,EACFZ,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACA,OAAO5R,GAAU2R,EA1jICzkB,WA2jIpB,CAWA,SAASqlB,GAAe/b,EAAOE,GAM7B,IALA,IAAIE,GAAS,EACTP,EAASG,EAAMH,OACfa,EAAW,EACXC,EAAS,KAEJP,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdrR,EAAWmR,EAAWA,EAAS7R,GAASA,EAE5C,IAAK+R,IAAU8N,GAAGnf,EAAU6lB,GAAO,CACjC,IAAIA,EAAO7lB,EACX4R,EAAOD,KAAwB,IAAVrS,EAAc,EAAIA,CACzC,CACF,CACA,OAAOsS,CACT,CAUA,SAASqb,GAAa3tB,GACpB,MAAoB,iBAATA,EACFA,EAELqkB,GAASrkB,GACJoI,GAEDpI,CACV,CAUA,SAAS4tB,GAAa5tB,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI+c,GAAQ/c,GAEV,OAAO2S,GAAS3S,EAAO4tB,IAAgB,GAEzC,GAAIvJ,GAASrkB,GACX,OAAO4c,GAAiBA,GAAenL,KAAKzR,GAAS,GAEvD,IAAIsS,EAAUtS,EAAQ,GACtB,MAAkB,KAAVsS,GAAkB,EAAItS,IAAU,IAAa,KAAOsS,CAC9D,CAWA,SAASub,GAASlc,EAAOE,EAAUa,GACjC,IAAIX,GAAS,EACTsR,EAAW9Q,GACXf,EAASG,EAAMH,OACf8R,GAAW,EACXhR,EAAS,GACTiU,EAAOjU,EAEX,GAAII,EACF4Q,GAAW,EACXD,EAAW5Q,QAER,GAAIjB,GAjtIU,IAitIkB,CACnC,IAAIpO,EAAMyO,EAAW,KAAOic,GAAUnc,GACtC,GAAIvO,EACF,OAAOiT,GAAWjT,GAEpBkgB,GAAW,EACXD,EAAWtO,GACXwR,EAAO,IAAI/H,EACb,MAEE+H,EAAO1U,EAAW,GAAKS,EAEzBkR,EACA,OAASzR,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdrR,EAAWmR,EAAWA,EAAS7R,GAASA,EAG5C,GADAA,EAAS0S,GAAwB,IAAV1S,EAAeA,EAAQ,EAC1CsjB,GAAY5iB,GAAaA,EAAU,CAErC,IADA,IAAIqtB,EAAYxH,EAAK/U,OACduc,KACL,GAAIxH,EAAKwH,KAAertB,EACtB,SAAS8iB,EAGT3R,GACF0U,EAAK9e,KAAK/G,GAEZ4R,EAAO7K,KAAKzH,EACd,MACUqjB,EAASkD,EAAM7lB,EAAUgS,KAC7B6T,IAASjU,GACXiU,EAAK9e,KAAK/G,GAEZ4R,EAAO7K,KAAKzH,GAEhB,CACA,OAAOsS,CACT,CAUA,SAASqZ,GAAUzX,EAAQ+Q,GAGzB,OAAiB,OADjB/Q,EAASuS,GAAOvS,EADhB+Q,EAAOC,GAASD,EAAM/Q,aAEUA,EAAOiR,GAAMuB,GAAKzB,IACpD,CAYA,SAAS+I,GAAW9Z,EAAQ+Q,EAAMgJ,EAASnN,GACzC,OAAOuK,GAAQnX,EAAQ+Q,EAAMgJ,EAAQjJ,GAAQ9Q,EAAQ+Q,IAAQnE,EAC/D,CAaA,SAASoN,GAAUvc,EAAOQ,EAAWgc,EAAQva,GAI3C,IAHA,IAAIpC,EAASG,EAAMH,OACfO,EAAQ6B,EAAYpC,GAAU,GAE1BoC,EAAY7B,MAAYA,EAAQP,IACtCW,EAAUR,EAAMI,GAAQA,EAAOJ,KAEjC,OAAOwc,EACH3B,GAAU7a,EAAQiC,EAAY,EAAI7B,EAAS6B,EAAY7B,EAAQ,EAAIP,GACnEgb,GAAU7a,EAAQiC,EAAY7B,EAAQ,EAAI,EAAK6B,EAAYpC,EAASO,EAC1E,CAYA,SAASqc,GAAiBpuB,EAAOquB,GAC/B,IAAI/b,EAAStS,EAIb,OAHIsS,aAAkB0K,KACpB1K,EAASA,EAAOtS,SAEXgT,GAAYqb,GAAS,SAAS/b,EAAQgc,GAC3C,OAAOA,EAAOjd,KAAKD,MAAMkd,EAAOhd,QAASuB,GAAU,CAACP,GAASgc,EAAO/c,MACtE,GAAGe,EACL,CAYA,SAASic,GAAQtI,EAAQpU,EAAUa,GACjC,IAAIlB,EAASyU,EAAOzU,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASqc,GAAS5H,EAAO,IAAM,GAKxC,IAHA,IAAIlU,GAAS,EACTO,EAASM,EAAMpB,KAEVO,EAAQP,GAIf,IAHA,IAAIG,EAAQsU,EAAOlU,GACfoU,GAAY,IAEPA,EAAW3U,GACd2U,GAAYpU,IACdO,EAAOP,GAASqR,GAAe9Q,EAAOP,IAAUJ,EAAOsU,EAAOE,GAAWtU,EAAUa,IAIzF,OAAOmb,GAAStJ,GAAYjS,EAAQ,GAAIT,EAAUa,EACpD,CAWA,SAAS8b,GAAczuB,EAAO+S,EAAQ2b,GAMpC,IALA,IAAI1c,GAAS,EACTP,EAASzR,EAAMyR,OACfkd,EAAa5b,EAAOtB,OACpBc,EAAS,CAAC,IAELP,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ+R,EAAQ2c,EAAa5b,EAAOf,GAASnK,EACjD6mB,EAAWnc,EAAQvS,EAAMgS,GAAQ/R,EACnC,CACA,OAAOsS,CACT,CASA,SAASqc,GAAoB3uB,GAC3B,OAAOkqB,GAAkBlqB,GAASA,EAAQ,EAC5C,CASA,SAAS4uB,GAAa5uB,GACpB,MAAuB,mBAATA,EAAsBA,EAAQgpB,EAC9C,CAUA,SAAS9D,GAASllB,EAAOkU,GACvB,OAAI6I,GAAQ/c,GACHA,EAEF0pB,GAAM1pB,EAAOkU,GAAU,CAAClU,GAAS6uB,GAAa3W,GAASlY,GAChE,CAWA,IAAI8uB,GAAWjD,GAWf,SAASkD,GAAUpd,EAAOma,EAAOW,GAC/B,IAAIjb,EAASG,EAAMH,OAEnB,OADAib,EAAMA,IAAQ7kB,EAAY4J,EAASib,GAC1BX,GAASW,GAAOjb,EAAUG,EAAQ6a,GAAU7a,EAAOma,EAAOW,EACrE,CAQA,IAAIzS,GAAeD,IAAmB,SAASpS,GAC7C,OAAO+H,GAAKsK,aAAarS,EAC3B,EAUA,SAAS8Z,GAAYY,EAAQrB,GAC3B,GAAIA,EACF,OAAOqB,EAAO3N,QAEhB,IAAIlD,EAAS6Q,EAAO7Q,OAChBc,EAAS0G,GAAcA,GAAYxH,GAAU,IAAI6Q,EAAOlB,YAAY3P,GAGxE,OADA6Q,EAAO2M,KAAK1c,GACLA,CACT,CASA,SAAS6P,GAAiB8M,GACxB,IAAI3c,EAAS,IAAI2c,EAAY9N,YAAY8N,EAAY1M,YAErD,OADA,IAAIxJ,GAAWzG,GAAQlP,IAAI,IAAI2V,GAAWkW,IACnC3c,CACT,CA+CA,SAASmQ,GAAgByM,EAAYlO,GACnC,IAAIqB,EAASrB,EAASmB,GAAiB+M,EAAW7M,QAAU6M,EAAW7M,OACvE,OAAO,IAAI6M,EAAW/N,YAAYkB,EAAQ6M,EAAW5M,WAAY4M,EAAW1d,OAC9E,CAUA,SAASyZ,GAAiBjrB,EAAO6lB,GAC/B,GAAI7lB,IAAU6lB,EAAO,CACnB,IAAIsJ,EAAenvB,IAAU4H,EACzBslB,EAAsB,OAAVltB,EACZovB,EAAiBpvB,GAAUA,EAC3BmtB,EAAc9I,GAASrkB,GAEvBqtB,EAAexH,IAAUje,EACzB0lB,EAAsB,OAAVzH,EACZ0H,EAAiB1H,GAAUA,EAC3B2H,EAAcnJ,GAASwB,GAE3B,IAAMyH,IAAcE,IAAgBL,GAAentB,EAAQ6lB,GACtDsH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B4B,GAAgB5B,IACjB6B,EACH,OAAO,EAET,IAAMlC,IAAcC,IAAgBK,GAAextB,EAAQ6lB,GACtD2H,GAAe2B,GAAgBC,IAAmBlC,IAAcC,GAChEG,GAAa6B,GAAgBC,IAC5B/B,GAAgB+B,IACjB7B,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,CAsDA,SAAS8B,GAAY9d,EAAM+d,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAane,EAAKC,OAClBme,EAAgBJ,EAAQ/d,OACxBoe,GAAa,EACbC,EAAaP,EAAS9d,OACtBse,EAAc7U,GAAUyU,EAAaC,EAAe,GACpDrd,EAASM,EAAMid,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBvd,EAAOsd,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7Bpd,EAAOid,EAAQE,IAAcle,EAAKke,IAGtC,KAAOK,KACLxd,EAAOsd,KAAere,EAAKke,KAE7B,OAAOnd,CACT,CAaA,SAAS0d,GAAiBze,EAAM+d,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAane,EAAKC,OAClBye,GAAgB,EAChBN,EAAgBJ,EAAQ/d,OACxB0e,GAAc,EACdC,EAAcb,EAAS9d,OACvBse,EAAc7U,GAAUyU,EAAaC,EAAe,GACpDrd,EAASM,EAAMkd,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBxd,EAAOmd,GAAale,EAAKke,GAG3B,IADA,IAAI1c,EAAS0c,IACJS,EAAaC,GACpB7d,EAAOS,EAASmd,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7Bpd,EAAOS,EAASwc,EAAQU,IAAiB1e,EAAKke,MAGlD,OAAOnd,CACT,CAUA,SAASmN,GAAUhV,EAAQkH,GACzB,IAAII,GAAS,EACTP,EAAS/G,EAAO+G,OAGpB,IADAG,IAAUA,EAAQiB,EAAMpB,MACfO,EAAQP,GACfG,EAAMI,GAAStH,EAAOsH,GAExB,OAAOJ,CACT,CAYA,SAAS0O,GAAW5V,EAAQ1K,EAAOmU,EAAQ4M,GACzC,IAAIsP,GAASlc,EACbA,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAInC,GAAS,EACTP,EAASzR,EAAMyR,SAEVO,EAAQP,GAAQ,CACvB,IAAIiC,EAAM1T,EAAMgS,GAEZ1O,EAAWyd,EACXA,EAAW5M,EAAOT,GAAMhJ,EAAOgJ,GAAMA,EAAKS,EAAQzJ,GAClD7C,EAEAvE,IAAauE,IACfvE,EAAWoH,EAAOgJ,IAEhB2c,EACFtQ,GAAgB5L,EAAQT,EAAKpQ,GAE7B0c,GAAY7L,EAAQT,EAAKpQ,EAE7B,CACA,OAAO6Q,CACT,CAkCA,SAASmc,GAAiBze,EAAQ0e,GAChC,OAAO,SAAS/c,EAAY1B,GAC1B,IAAIR,EAAO0L,GAAQxJ,GAAc7B,GAAkBwO,GAC/CpO,EAAcwe,EAAcA,IAAgB,CAAC,EAEjD,OAAOjf,EAAKkC,EAAY3B,EAAQ8Y,GAAY7Y,EAAU,GAAIC,EAC5D,CACF,CASA,SAASye,GAAeC,GACtB,OAAO3E,IAAS,SAAS3X,EAAQuc,GAC/B,IAAI1e,GAAS,EACTP,EAASif,EAAQjf,OACjBsP,EAAatP,EAAS,EAAIif,EAAQjf,EAAS,GAAK5J,EAChD8oB,EAAQlf,EAAS,EAAIif,EAAQ,GAAK7oB,EAWtC,IATAkZ,EAAc0P,EAAShf,OAAS,GAA0B,mBAAdsP,GACvCtP,IAAUsP,GACXlZ,EAEA8oB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD5P,EAAatP,EAAS,EAAI5J,EAAYkZ,EACtCtP,EAAS,GAEX0C,EAAS3E,GAAO2E,KACPnC,EAAQP,GAAQ,CACvB,IAAI/G,EAASgmB,EAAQ1e,GACjBtH,GACF+lB,EAAStc,EAAQzJ,EAAQsH,EAAO+O,EAEpC,CACA,OAAO5M,CACT,GACF,CAUA,SAAS6P,GAAevQ,EAAUI,GAChC,OAAO,SAASL,EAAY1B,GAC1B,GAAkB,MAAd0B,EACF,OAAOA,EAET,IAAKgW,GAAYhW,GACf,OAAOC,EAASD,EAAY1B,GAM9B,IAJA,IAAIL,EAAS+B,EAAW/B,OACpBO,EAAQ6B,EAAYpC,GAAU,EAC9Bof,EAAWrhB,GAAOgE,IAEdK,EAAY7B,MAAYA,EAAQP,KACa,IAA/CK,EAAS+e,EAAS7e,GAAQA,EAAO6e,KAIvC,OAAOrd,CACT,CACF,CASA,SAASqR,GAAchR,GACrB,OAAO,SAASM,EAAQrC,EAAUwT,GAMhC,IALA,IAAItT,GAAS,EACT6e,EAAWrhB,GAAO2E,GAClBnU,EAAQslB,EAASnR,GACjB1C,EAASzR,EAAMyR,OAEZA,KAAU,CACf,IAAIiC,EAAM1T,EAAM6T,EAAYpC,IAAWO,GACvC,IAA+C,IAA3CF,EAAS+e,EAASnd,GAAMA,EAAKmd,GAC/B,KAEJ,CACA,OAAO1c,CACT,CACF,CA8BA,SAAS2c,GAAgBC,GACvB,OAAO,SAASrc,GAGd,IAAIU,EAAaO,GAFjBjB,EAASyD,GAASzD,IAGdiC,GAAcjC,GACd7M,EAEA6N,EAAMN,EACNA,EAAW,GACXV,EAAOsC,OAAO,GAEdga,EAAW5b,EACX4Z,GAAU5Z,EAAY,GAAGhH,KAAK,IAC9BsG,EAAOC,MAAM,GAEjB,OAAOe,EAAIqb,KAAgBC,CAC7B,CACF,CASA,SAASC,GAAiB3rB,GACxB,OAAO,SAASoP,GACd,OAAOzB,GAAYie,GAAMC,GAAOzc,GAAQG,QAAQtG,GAAQ,KAAMjJ,EAAU,GAC1E,CACF,CAUA,SAAS8rB,GAAWjP,GAClB,OAAO,WAIL,IAAI3Q,EAAO6f,UACX,OAAQ7f,EAAKC,QACX,KAAK,EAAG,OAAO,IAAI0Q,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK3Q,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI2Q,EAAK3Q,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI2Q,EAAK3Q,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI2Q,EAAK3Q,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI2Q,EAAK3Q,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI2Q,EAAK3Q,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI2Q,EAAK3Q,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAI8f,EAAclU,GAAW+E,EAAKrK,WAC9BvF,EAAS4P,EAAK9Q,MAAMigB,EAAa9f,GAIrC,OAAO8L,GAAS/K,GAAUA,EAAS+e,CACrC,CACF,CA8CA,SAASC,GAAWC,GAClB,OAAO,SAAShe,EAAYpB,EAAWwB,GACrC,IAAIid,EAAWrhB,GAAOgE,GACtB,IAAKgW,GAAYhW,GAAa,CAC5B,IAAI1B,EAAW6Y,GAAYvY,EAAW,GACtCoB,EAAagF,GAAKhF,GAClBpB,EAAY,SAASsB,GAAO,OAAO5B,EAAS+e,EAASnd,GAAMA,EAAKmd,EAAW,CAC7E,CACA,IAAI7e,EAAQwf,EAAche,EAAYpB,EAAWwB,GACjD,OAAO5B,GAAS,EAAI6e,EAAS/e,EAAW0B,EAAWxB,GAASA,GAASnK,CACvE,CACF,CASA,SAAS4pB,GAAW5d,GAClB,OAAO6d,IAAS,SAASC,GACvB,IAAIlgB,EAASkgB,EAAMlgB,OACfO,EAAQP,EACRmgB,EAAS1U,GAAcpF,UAAU+Z,KAKrC,IAHIhe,GACF8d,EAAMhW,UAED3J,KAAS,CACd,IAAIV,EAAOqgB,EAAM3f,GACjB,GAAmB,mBAARV,EACT,MAAM,IAAIsG,GAAU9P,GAEtB,GAAI8pB,IAAWE,GAAgC,WAArBC,GAAYzgB,GACpC,IAAIwgB,EAAU,IAAI5U,GAAc,IAAI,EAExC,CAEA,IADAlL,EAAQ8f,EAAU9f,EAAQP,IACjBO,EAAQP,GAAQ,CAGvB,IAAIugB,EAAWD,GAFfzgB,EAAOqgB,EAAM3f,IAGT1R,EAAmB,WAAZ0xB,EAAwBC,GAAQ3gB,GAAQzJ,EAMjDiqB,EAJExxB,GAAQ4xB,GAAW5xB,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGmR,QAAqB,GAAXnR,EAAK,GAElBwxB,EAAQC,GAAYzxB,EAAK,KAAK+Q,MAAMygB,EAASxxB,EAAK,IAElC,GAAfgR,EAAKG,QAAeygB,GAAW5gB,GACtCwgB,EAAQE,KACRF,EAAQD,KAAKvgB,EAErB,CACA,OAAO,WACL,IAAIE,EAAO6f,UACPpxB,EAAQuR,EAAK,GAEjB,GAAIsgB,GAA0B,GAAftgB,EAAKC,QAAeuL,GAAQ/c,GACzC,OAAO6xB,EAAQK,MAAMlyB,GAAOA,QAK9B,IAHA,IAAI+R,EAAQ,EACRO,EAASd,EAASkgB,EAAM3f,GAAOX,MAAMvP,KAAM0P,GAAQvR,IAE9C+R,EAAQP,GACfc,EAASof,EAAM3f,GAAON,KAAK5P,KAAMyQ,GAEnC,OAAOA,CACT,CACF,GACF,CAqBA,SAAS6f,GAAa9gB,EAAMwP,EAASvP,EAASge,EAAUC,EAAS6C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EAAQ5R,EAAU5Y,EAClByqB,EA5iKa,EA4iKJ7R,EACT8R,EA5iKiB,EA4iKL9R,EACZ2O,EAAsB,GAAV3O,EACZ+R,EAtiKa,IAsiKJ/R,EACTqB,EAAOyQ,EAAY/qB,EAAYupB,GAAW9f,GA6C9C,OA3CA,SAASwgB,IAKP,IAJA,IAAIrgB,EAAS4f,UAAU5f,OACnBD,EAAOqB,EAAMpB,GACbO,EAAQP,EAELO,KACLR,EAAKQ,GAASqf,UAAUrf,GAE1B,GAAIyd,EACF,IAAIpZ,EAAcyc,GAAUhB,GACxBiB,EAvhIZ,SAAsBnhB,EAAOyE,GAI3B,IAHA,IAAI5E,EAASG,EAAMH,OACfc,EAAS,EAENd,KACDG,EAAMH,KAAY4E,KAClB9D,EAGN,OAAOA,CACT,CA6gI2BygB,CAAaxhB,EAAM6E,GASxC,GAPIkZ,IACF/d,EAAO8d,GAAY9d,EAAM+d,EAAUC,EAASC,IAE1C4C,IACF7gB,EAAOye,GAAiBze,EAAM6gB,EAAeC,EAAc7C,IAE7Dhe,GAAUshB,EACNtD,GAAahe,EAASghB,EAAO,CAC/B,IAAIQ,EAAa7c,GAAe5E,EAAM6E,GACtC,OAAO6c,GACL5hB,EAAMwP,EAASsR,GAAcN,EAAQzb,YAAa9E,EAClDC,EAAMyhB,EAAYV,EAAQC,EAAKC,EAAQhhB,EAE3C,CACA,IAAI6f,EAAcqB,EAASphB,EAAUzP,KACjCqxB,EAAKP,EAAYtB,EAAYhgB,GAAQA,EAczC,OAZAG,EAASD,EAAKC,OACV8gB,EACF/gB,EAg4CN,SAAiBI,EAAO8Z,GAKtB,IAJA,IAAI0H,EAAYxhB,EAAMH,OAClBA,EAAS2J,GAAUsQ,EAAQja,OAAQ2hB,GACnCC,EAAW3T,GAAU9N,GAElBH,KAAU,CACf,IAAIO,EAAQ0Z,EAAQja,GACpBG,EAAMH,GAAU4N,GAAQrN,EAAOohB,GAAaC,EAASrhB,GAASnK,CAChE,CACA,OAAO+J,CACT,CA14Ca0hB,CAAQ9hB,EAAM+gB,GACZM,GAAUphB,EAAS,GAC5BD,EAAKmK,UAEH+W,GAASF,EAAM/gB,IACjBD,EAAKC,OAAS+gB,GAEZ1wB,MAAQA,OAAS6N,IAAQ7N,gBAAgBgwB,IAC3CqB,EAAKhR,GAAQiP,GAAW+B,IAEnBA,EAAG9hB,MAAMigB,EAAa9f,EAC/B,CAEF,CAUA,SAAS+hB,GAAe1hB,EAAQ2hB,GAC9B,OAAO,SAASrf,EAAQrC,GACtB,OAh/DJ,SAAsBqC,EAAQtC,EAAQC,EAAUC,GAI9C,OAHAkS,GAAW9P,GAAQ,SAASlU,EAAOyT,EAAKS,GACtCtC,EAAOE,EAAaD,EAAS7R,GAAQyT,EAAKS,EAC5C,IACOpC,CACT,CA2+DW0hB,CAAatf,EAAQtC,EAAQ2hB,EAAW1hB,GAAW,CAAC,EAC7D,CACF,CAUA,SAAS4hB,GAAoBC,EAAUC,GACrC,OAAO,SAAS3zB,EAAO6lB,GACrB,IAAIvT,EACJ,GAAItS,IAAU4H,GAAaie,IAAUje,EACnC,OAAO+rB,EAKT,GAHI3zB,IAAU4H,IACZ0K,EAAStS,GAEP6lB,IAAUje,EAAW,CACvB,GAAI0K,IAAW1K,EACb,OAAOie,EAEW,iBAAT7lB,GAAqC,iBAAT6lB,GACrC7lB,EAAQ4tB,GAAa5tB,GACrB6lB,EAAQ+H,GAAa/H,KAErB7lB,EAAQ2tB,GAAa3tB,GACrB6lB,EAAQ8H,GAAa9H,IAEvBvT,EAASohB,EAAS1zB,EAAO6lB,EAC3B,CACA,OAAOvT,CACT,CACF,CASA,SAASshB,GAAWC,GAClB,OAAOpC,IAAS,SAASjH,GAEvB,OADAA,EAAY7X,GAAS6X,EAAW3V,GAAU6V,OACnCmB,IAAS,SAASta,GACvB,IAAID,EAAUzP,KACd,OAAOgyB,EAAUrJ,GAAW,SAAS3Y,GACnC,OAAOT,GAAMS,EAAUP,EAASC,EAClC,GACF,GACF,GACF,CAWA,SAASuiB,GAActiB,EAAQuiB,GAG7B,IAAIC,GAFJD,EAAQA,IAAUnsB,EAAY,IAAMgmB,GAAamG,IAEzBviB,OACxB,GAAIwiB,EAAc,EAChB,OAAOA,EAAcpI,GAAWmI,EAAOviB,GAAUuiB,EAEnD,IAAIzhB,EAASsZ,GAAWmI,EAAO1Z,GAAW7I,EAAS+E,GAAWwd,KAC9D,OAAOre,GAAWqe,GACdhF,GAAUrY,GAAcpE,GAAS,EAAGd,GAAQrD,KAAK,IACjDmE,EAAOoC,MAAM,EAAGlD,EACtB,CA4CA,SAASyiB,GAAYrgB,GACnB,OAAO,SAASkY,EAAOW,EAAKyH,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBvD,GAAe7E,EAAOW,EAAKyH,KAChEzH,EAAMyH,EAAOtsB,GAGfkkB,EAAQqI,GAASrI,GACbW,IAAQ7kB,GACV6kB,EAAMX,EACNA,EAAQ,GAERW,EAAM0H,GAAS1H,GA57CrB,SAAmBX,EAAOW,EAAKyH,EAAMtgB,GAKnC,IAJA,IAAI7B,GAAS,EACTP,EAASyJ,GAAUZ,IAAYoS,EAAMX,IAAUoI,GAAQ,IAAK,GAC5D5hB,EAASM,EAAMpB,GAEZA,KACLc,EAAOsB,EAAYpC,IAAWO,GAAS+Z,EACvCA,GAASoI,EAEX,OAAO5hB,CACT,CAq7CW8hB,CAAUtI,EAAOW,EADxByH,EAAOA,IAAStsB,EAAakkB,EAAQW,EAAM,GAAK,EAAK0H,GAASD,GAC3BtgB,EACrC,CACF,CASA,SAASygB,GAA0BX,GACjC,OAAO,SAAS1zB,EAAO6lB,GAKrB,MAJsB,iBAAT7lB,GAAqC,iBAAT6lB,IACvC7lB,EAAQs0B,GAASt0B,GACjB6lB,EAAQyO,GAASzO,IAEZ6N,EAAS1zB,EAAO6lB,EACzB,CACF,CAmBA,SAASoN,GAAc5hB,EAAMwP,EAAS0T,EAAUne,EAAa9E,EAASge,EAAUC,EAAS+C,EAAQC,EAAKC,GACpG,IAAIgC,EArxKc,EAqxKJ3T,EAMdA,GAAY2T,EAAUxsB,EAxxKI,GAJF,GA6xKxB6Y,KAAa2T,EAzxKa,GAyxKuBxsB,MAG/C6Y,IAAW,GAEb,IAAI4T,EAAU,CACZpjB,EAAMwP,EAASvP,EAVCkjB,EAAUlF,EAAW1nB,EAFtB4sB,EAAUjF,EAAU3nB,EAGd4sB,EAAU5sB,EAAY0nB,EAFvBkF,EAAU5sB,EAAY2nB,EAYzB+C,EAAQC,EAAKC,GAG5BlgB,EAASiiB,EAASnjB,MAAMxJ,EAAW6sB,GAKvC,OAJIxC,GAAW5gB,IACbqjB,GAAQpiB,EAAQmiB,GAElBniB,EAAO8D,YAAcA,EACdue,GAAgBriB,EAAQjB,EAAMwP,EACvC,CASA,SAAS+T,GAAY9D,GACnB,IAAIzf,EAAOoG,GAAKqZ,GAChB,OAAO,SAASrQ,EAAQoU,GAGtB,GAFApU,EAAS6T,GAAS7T,IAClBoU,EAAyB,MAAbA,EAAoB,EAAI1Z,GAAU2Z,GAAUD,GAAY,OACnDha,GAAe4F,GAAS,CAGvC,IAAIsU,GAAQ7c,GAASuI,GAAU,KAAK5J,MAAM,KAI1C,SADAke,GAAQ7c,GAFI7G,EAAK0jB,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKhe,MAAM,MACvB,GAAK,MAAQke,EAAK,GAAKF,GACvC,CACA,OAAOxjB,EAAKoP,EACd,CACF,CASA,IAAIqN,GAAchS,IAAQ,EAAIzF,GAAW,IAAIyF,GAAI,CAAC,EAAE,KAAK,IAAO5T,EAAmB,SAAS4K,GAC1F,OAAO,IAAIgJ,GAAIhJ,EACjB,EAF4EkiB,GAW5E,SAASC,GAAc5P,GACrB,OAAO,SAASnR,GACd,IAAIoN,EAAMC,GAAOrN,GACjB,OAAIoN,GAAOxY,EACF8M,GAAW1B,GAEhBoN,GAAOnY,EACFmN,GAAWpC,GAn6I1B,SAAqBA,EAAQnU,GAC3B,OAAO4S,GAAS5S,GAAO,SAAS0T,GAC9B,MAAO,CAACA,EAAKS,EAAOT,GACtB,GACF,CAi6IayhB,CAAYhhB,EAAQmR,EAASnR,GACtC,CACF,CA2BA,SAASihB,GAAW9jB,EAAMwP,EAASvP,EAASge,EAAUC,EAAS+C,EAAQC,EAAKC,GAC1E,IAAIG,EAl4KiB,EAk4KL9R,EAChB,IAAK8R,GAA4B,mBAARthB,EACvB,MAAM,IAAIsG,GAAU9P,GAEtB,IAAI2J,EAAS8d,EAAWA,EAAS9d,OAAS,EAS1C,GARKA,IACHqP,IAAW,GACXyO,EAAWC,EAAU3nB,GAEvB2qB,EAAMA,IAAQ3qB,EAAY2qB,EAAMtX,GAAU6Z,GAAUvC,GAAM,GAC1DC,EAAQA,IAAU5qB,EAAY4qB,EAAQsC,GAAUtC,GAChDhhB,GAAU+d,EAAUA,EAAQ/d,OAAS,EAx4KX,GA04KtBqP,EAAmC,CACrC,IAAIuR,EAAgB9C,EAChB+C,EAAe9C,EAEnBD,EAAWC,EAAU3nB,CACvB,CACA,IAAIvH,EAAOsyB,EAAY/qB,EAAYoqB,GAAQ3gB,GAEvCojB,EAAU,CACZpjB,EAAMwP,EAASvP,EAASge,EAAUC,EAAS6C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfInyB,GA26BN,SAAmBA,EAAMoK,GACvB,IAAIoW,EAAUxgB,EAAK,GACf+0B,EAAa3qB,EAAO,GACpB4qB,EAAaxU,EAAUuU,EACvB9R,EAAW+R,EAAa,IAExBC,EACAF,GAAcntB,GA50MA,GA40MmB4Y,GACjCuU,GAAcntB,GAx0MA,KAw0MmB4Y,GAAgCxgB,EAAK,GAAGmR,QAAU/G,EAAO,IAC5E,KAAd2qB,GAAqD3qB,EAAO,GAAG+G,QAAU/G,EAAO,IA90MlE,GA80M0EoW,EAG5F,IAAMyC,IAAYgS,EAChB,OAAOj1B,EAr1MQ,EAw1Mb+0B,IACF/0B,EAAK,GAAKoK,EAAO,GAEjB4qB,GA31Me,EA21MDxU,EAA2B,EAz1MnB,GA41MxB,IAAI7gB,EAAQyK,EAAO,GACnB,GAAIzK,EAAO,CACT,IAAIsvB,EAAWjvB,EAAK,GACpBA,EAAK,GAAKivB,EAAWD,GAAYC,EAAUtvB,EAAOyK,EAAO,IAAMzK,EAC/DK,EAAK,GAAKivB,EAAWnZ,GAAe9V,EAAK,GAAI0H,GAAe0C,EAAO,EACrE,EAEAzK,EAAQyK,EAAO,MAEb6kB,EAAWjvB,EAAK,GAChBA,EAAK,GAAKivB,EAAWU,GAAiBV,EAAUtvB,EAAOyK,EAAO,IAAMzK,EACpEK,EAAK,GAAKivB,EAAWnZ,GAAe9V,EAAK,GAAI0H,GAAe0C,EAAO,KAGrEzK,EAAQyK,EAAO,MAEbpK,EAAK,GAAKL,GAGRo1B,EAAantB,IACf5H,EAAK,GAAgB,MAAXA,EAAK,GAAaoK,EAAO,GAAK0Q,GAAU9a,EAAK,GAAIoK,EAAO,KAGrD,MAAXpK,EAAK,KACPA,EAAK,GAAKoK,EAAO,IAGnBpK,EAAK,GAAKoK,EAAO,GACjBpK,EAAK,GAAKg1B,CAGZ,CA/9BIE,CAAUd,EAASp0B,GAErBgR,EAAOojB,EAAQ,GACf5T,EAAU4T,EAAQ,GAClBnjB,EAAUmjB,EAAQ,GAClBnF,EAAWmF,EAAQ,GACnBlF,EAAUkF,EAAQ,KAClBjC,EAAQiC,EAAQ,GAAKA,EAAQ,KAAO7sB,EAC/B+qB,EAAY,EAAIthB,EAAKG,OACtByJ,GAAUwZ,EAAQ,GAAKjjB,EAAQ,KAEX,GAAVqP,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGdvO,EA56KgB,GA26KPuO,GA16Ka,IA06KiBA,EApgB3C,SAAqBxP,EAAMwP,EAAS2R,GAClC,IAAItQ,EAAOiP,GAAW9f,GAwBtB,OAtBA,SAASwgB,IAMP,IALA,IAAIrgB,EAAS4f,UAAU5f,OACnBD,EAAOqB,EAAMpB,GACbO,EAAQP,EACR4E,EAAcyc,GAAUhB,GAErB9f,KACLR,EAAKQ,GAASqf,UAAUrf,GAE1B,IAAIwd,EAAW/d,EAAS,GAAKD,EAAK,KAAO6E,GAAe7E,EAAKC,EAAS,KAAO4E,EACzE,GACAD,GAAe5E,EAAM6E,GAGzB,OADA5E,GAAU+d,EAAQ/d,QACLghB,EACJS,GACL5hB,EAAMwP,EAASsR,GAAcN,EAAQzb,YAAaxO,EAClD2J,EAAMge,EAAS3nB,EAAWA,EAAW4qB,EAAQhhB,GAG1CJ,GADGvP,MAAQA,OAAS6N,IAAQ7N,gBAAgBgwB,EAAW3P,EAAO7Q,EACpDxP,KAAM0P,EACzB,CAEF,CA2eaikB,CAAYnkB,EAAMwP,EAAS2R,GAC1B3R,GAAW7Y,GAAgC,IAAX6Y,GAAqD0O,EAAQ/d,OAG9F2gB,GAAa/gB,MAAMxJ,EAAW6sB,GA9O3C,SAAuBpjB,EAAMwP,EAASvP,EAASge,GAC7C,IAAIoD,EAtsKa,EAssKJ7R,EACTqB,EAAOiP,GAAW9f,GAkBtB,OAhBA,SAASwgB,IAQP,IAPA,IAAIpC,GAAa,EACbC,EAAa0B,UAAU5f,OACvBoe,GAAa,EACbC,EAAaP,EAAS9d,OACtBD,EAAOqB,EAAMid,EAAaH,GAC1BwD,EAAMrxB,MAAQA,OAAS6N,IAAQ7N,gBAAgBgwB,EAAW3P,EAAO7Q,IAE5Due,EAAYC,GACnBte,EAAKqe,GAAaN,EAASM,GAE7B,KAAOF,KACLne,EAAKqe,KAAewB,YAAY3B,GAElC,OAAOre,GAAM8hB,EAAIR,EAASphB,EAAUzP,KAAM0P,EAC5C,CAEF,CAuNakkB,CAAcpkB,EAAMwP,EAASvP,EAASge,QAJ/C,IAAIhd,EAhmBR,SAAoBjB,EAAMwP,EAASvP,GACjC,IAAIohB,EA90Ja,EA80JJ7R,EACTqB,EAAOiP,GAAW9f,GAMtB,OAJA,SAASwgB,IAEP,OADUhwB,MAAQA,OAAS6N,IAAQ7N,gBAAgBgwB,EAAW3P,EAAO7Q,GAC3DD,MAAMshB,EAASphB,EAAUzP,KAAMuvB,UAC3C,CAEF,CAulBiBsE,CAAWrkB,EAAMwP,EAASvP,GASzC,OAAOqjB,IADMt0B,EAAO+rB,GAAcsI,IACJpiB,EAAQmiB,GAAUpjB,EAAMwP,EACxD,CAcA,SAAS8U,GAAuB3V,EAAU4I,EAAUnV,EAAKS,GACvD,OAAI8L,IAAapY,GACZiY,GAAGG,EAAUjI,GAAYtE,MAAU0E,GAAe1G,KAAKyC,EAAQT,GAC3DmV,EAEF5I,CACT,CAgBA,SAAS4V,GAAoB5V,EAAU4I,EAAUnV,EAAKS,EAAQzJ,EAAQsW,GAOpE,OANI1D,GAAS2C,IAAa3C,GAASuL,KAEjC7H,EAAM3d,IAAIwlB,EAAU5I,GACpB6J,GAAU7J,EAAU4I,EAAUhhB,EAAWguB,GAAqB7U,GAC9DA,EAAc,OAAE6H,IAEX5I,CACT,CAWA,SAAS6V,GAAgB71B,GACvB,OAAOmqB,GAAcnqB,GAAS4H,EAAY5H,CAC5C,CAeA,SAASqnB,GAAY1V,EAAOkU,EAAOhF,EAASC,EAAY+F,EAAW9F,GACjE,IAAIyG,EApgLmB,EAogLP3G,EACZsS,EAAYxhB,EAAMH,OAClB0U,EAAYL,EAAMrU,OAEtB,GAAI2hB,GAAajN,KAAesB,GAAatB,EAAYiN,GACvD,OAAO,EAGT,IAAI2C,EAAa/U,EAAM9d,IAAI0O,GACvBsW,EAAalH,EAAM9d,IAAI4iB,GAC3B,GAAIiQ,GAAc7N,EAChB,OAAO6N,GAAcjQ,GAASoC,GAActW,EAE9C,IAAII,GAAS,EACTO,GAAS,EACTiU,EAlhLqB,EAkhLb1F,EAAoC,IAAIrC,GAAW5W,EAM/D,IAJAmZ,EAAM3d,IAAIuO,EAAOkU,GACjB9E,EAAM3d,IAAIyiB,EAAOlU,KAGRI,EAAQohB,GAAW,CAC1B,IAAI4C,EAAWpkB,EAAMI,GACjBoW,EAAWtC,EAAM9T,GAErB,GAAI+O,EACF,IAAIsH,EAAWZ,EACX1G,EAAWqH,EAAU4N,EAAUhkB,EAAO8T,EAAOlU,EAAOoP,GACpDD,EAAWiV,EAAU5N,EAAUpW,EAAOJ,EAAOkU,EAAO9E,GAE1D,GAAIqH,IAAaxgB,EAAW,CAC1B,GAAIwgB,EACF,SAEF9V,GAAS,EACT,KACF,CAEA,GAAIiU,GACF,IAAKpT,GAAU0S,GAAO,SAASsC,EAAUhC,GACnC,IAAKpR,GAASwR,EAAMJ,KACf4P,IAAa5N,GAAYtB,EAAUkP,EAAU5N,EAAUtH,EAASC,EAAYC,IAC/E,OAAOwF,EAAK9e,KAAK0e,EAErB,IAAI,CACN7T,GAAS,EACT,KACF,OACK,GACDyjB,IAAa5N,IACXtB,EAAUkP,EAAU5N,EAAUtH,EAASC,EAAYC,GACpD,CACLzO,GAAS,EACT,KACF,CACF,CAGA,OAFAyO,EAAc,OAAEpP,GAChBoP,EAAc,OAAE8E,GACTvT,CACT,CAyKA,SAASmf,GAASpgB,GAChB,OAAO0a,GAAYC,GAAS3a,EAAMzJ,EAAWouB,IAAU3kB,EAAO,GAChE,CASA,SAAS2R,GAAW9O,GAClB,OAAOkR,GAAelR,EAAQqE,GAAMwJ,GACtC,CAUA,SAASgB,GAAa7O,GACpB,OAAOkR,GAAelR,EAAQ2N,GAAQF,GACxC,CASA,IAAIqQ,GAAW/V,GAAiB,SAAS5K,GACvC,OAAO4K,GAAQhZ,IAAIoO,EACrB,EAFyB2jB,GAWzB,SAASlD,GAAYzgB,GAKnB,IAJA,IAAIiB,EAAUjB,EAAKzR,KAAO,GACtB+R,EAAQuK,GAAU5J,GAClBd,EAAS2G,GAAe1G,KAAKyK,GAAW5J,GAAUX,EAAMH,OAAS,EAE9DA,KAAU,CACf,IAAInR,EAAOsR,EAAMH,GACbykB,EAAY51B,EAAKgR,KACrB,GAAiB,MAAb4kB,GAAqBA,GAAa5kB,EACpC,OAAOhR,EAAKT,IAEhB,CACA,OAAO0S,CACT,CASA,SAASugB,GAAUxhB,GAEjB,OADa8G,GAAe1G,KAAKoL,GAAQ,eAAiBA,GAASxL,GACrD+E,WAChB,CAaA,SAASsU,KACP,IAAIpY,EAASuK,GAAOhL,UAAYA,GAEhC,OADAS,EAASA,IAAWT,GAAWkX,GAAezW,EACvC8e,UAAU5f,OAASc,EAAO8e,UAAU,GAAIA,UAAU,IAAM9e,CACjE,CAUA,SAASsR,GAAW/N,EAAKpC,GACvB,IAgYiBzT,EACbC,EAjYAI,EAAOwV,EAAI4I,SACf,OAiYgB,WADZxe,SADaD,EA/XAyT,KAiYmB,UAARxT,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVD,EACU,OAAVA,GAlYDK,EAAmB,iBAAPoT,EAAkB,SAAW,QACzCpT,EAAKwV,GACX,CASA,SAAS2T,GAAatV,GAIpB,IAHA,IAAI5B,EAASiG,GAAKrE,GACd1C,EAASc,EAAOd,OAEbA,KAAU,CACf,IAAIiC,EAAMnB,EAAOd,GACbxR,EAAQkU,EAAOT,GAEnBnB,EAAOd,GAAU,CAACiC,EAAKzT,EAAO2pB,GAAmB3pB,GACnD,CACA,OAAOsS,CACT,CAUA,SAASwH,GAAU5F,EAAQT,GACzB,IAAIzT,EAlxJR,SAAkBkU,EAAQT,GACxB,OAAiB,MAAVS,EAAiBtM,EAAYsM,EAAOT,EAC7C,CAgxJgByiB,CAAShiB,EAAQT,GAC7B,OAAOqV,GAAa9oB,GAASA,EAAQ4H,CACvC,CAoCA,IAAIma,GAActH,GAA+B,SAASvG,GACxD,OAAc,MAAVA,EACK,IAETA,EAAS3E,GAAO2E,GACT9B,GAAYqI,GAAiBvG,IAAS,SAAS+N,GACpD,OAAO5I,GAAqB5H,KAAKyC,EAAQ+N,EAC3C,IACF,EARqCkU,GAiBjCxU,GAAgBlH,GAA+B,SAASvG,GAE1D,IADA,IAAI5B,EAAS,GACN4B,GACLrB,GAAUP,EAAQyP,GAAW7N,IAC7BA,EAAS+E,GAAa/E,GAExB,OAAO5B,CACT,EAPuC6jB,GAgBnC5U,GAASgE,GA2Eb,SAAS6Q,GAAQliB,EAAQ+Q,EAAMoR,GAO7B,IAJA,IAAItkB,GAAS,EACTP,GAHJyT,EAAOC,GAASD,EAAM/Q,IAGJ1C,OACdc,GAAS,IAEJP,EAAQP,GAAQ,CACvB,IAAIiC,EAAM0R,GAAMF,EAAKlT,IACrB,KAAMO,EAAmB,MAAV4B,GAAkBmiB,EAAQniB,EAAQT,IAC/C,MAEFS,EAASA,EAAOT,EAClB,CACA,OAAInB,KAAYP,GAASP,EAChBc,KAETd,EAAmB,MAAV0C,EAAiB,EAAIA,EAAO1C,SAClB8kB,GAAS9kB,IAAW4N,GAAQ3L,EAAKjC,KACjDuL,GAAQ7I,IAAW8K,GAAY9K,GACpC,CA4BA,SAASwN,GAAgBxN,GACvB,MAAqC,mBAAtBA,EAAOiN,aAA8BiI,GAAYlV,GAE5D,CAAC,EADDiJ,GAAWlE,GAAa/E,GAE9B,CA4EA,SAASwQ,GAAc1kB,GACrB,OAAO+c,GAAQ/c,IAAUgf,GAAYhf,OAChCuZ,IAAoBvZ,GAASA,EAAMuZ,IAC1C,CAUA,SAAS6F,GAAQpf,EAAOwR,GACtB,IAAIvR,SAAcD,EAGlB,SAFAwR,EAAmB,MAAVA,EAAiBrJ,EAAmBqJ,KAGlC,UAARvR,GACU,UAARA,GAAoBgM,GAAS0J,KAAK3V,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQwR,CACjD,CAYA,SAASmf,GAAe3wB,EAAO+R,EAAOmC,GACpC,IAAKmJ,GAASnJ,GACZ,OAAO,EAET,IAAIjU,SAAc8R,EAClB,SAAY,UAAR9R,EACKspB,GAAYrV,IAAWkL,GAAQrN,EAAOmC,EAAO1C,QACrC,UAARvR,GAAoB8R,KAASmC,IAE7B2L,GAAG3L,EAAOnC,GAAQ/R,EAG7B,CAUA,SAAS0pB,GAAM1pB,EAAOkU,GACpB,GAAI6I,GAAQ/c,GACV,OAAO,EAET,IAAIC,SAAcD,EAClB,QAAY,UAARC,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATD,IAAiBqkB,GAASrkB,KAGvB+K,EAAc4K,KAAK3V,KAAW8K,EAAa6K,KAAK3V,IAC1C,MAAVkU,GAAkBlU,KAASuP,GAAO2E,EACvC,CAwBA,SAAS+d,GAAW5gB,GAClB,IAAI0gB,EAAWD,GAAYzgB,GACvBwU,EAAQhJ,GAAOkV,GAEnB,GAAoB,mBAATlM,KAAyBkM,KAAY/U,GAAYnF,WAC1D,OAAO,EAET,GAAIxG,IAASwU,EACX,OAAO,EAET,IAAIxlB,EAAO2xB,GAAQnM,GACnB,QAASxlB,GAAQgR,IAAShR,EAAK,EACjC,EA9SKsb,IAAY4F,GAAO,IAAI5F,GAAS,IAAI4a,YAAY,MAAQ/sB,GACxDoS,IAAO2F,GAAO,IAAI3F,KAAQ9S,GAC1B+S,IAAW0F,GAAO1F,GAAQ2a,YAAcvtB,GACxC6S,IAAOyF,GAAO,IAAIzF,KAAQ3S,GAC1B4S,IAAWwF,GAAO,IAAIxF,KAAYzS,KACrCiY,GAAS,SAASvhB,GAChB,IAAIsS,EAASiT,GAAWvlB,GACpBkiB,EAAO5P,GAAUtJ,EAAYhJ,EAAMmhB,YAAcvZ,EACjD6uB,EAAavU,EAAO9F,GAAS8F,GAAQ,GAEzC,GAAIuU,EACF,OAAQA,GACN,KAAKta,GAAoB,OAAO3S,EAChC,KAAK6S,GAAe,OAAOvT,EAC3B,KAAKwT,GAAmB,OAAOrT,EAC/B,KAAKsT,GAAe,OAAOpT,EAC3B,KAAKqT,GAAmB,OAAOlT,EAGnC,OAAOgJ,CACT,GA8SF,IAAIokB,GAAa1e,GAAa+M,GAAa4R,GAS3C,SAASvN,GAAYppB,GACnB,IAAIkiB,EAAOliB,GAASA,EAAMmhB,YAG1B,OAAOnhB,KAFqB,mBAARkiB,GAAsBA,EAAKrK,WAAcE,GAG/D,CAUA,SAAS4R,GAAmB3pB,GAC1B,OAAOA,GAAUA,IAAUqd,GAASrd,EACtC,CAWA,SAASypB,GAAwBhW,EAAKmV,GACpC,OAAO,SAAS1U,GACd,OAAc,MAAVA,GAGGA,EAAOT,KAASmV,IACpBA,IAAahhB,GAAc6L,KAAOlE,GAAO2E,GAC9C,CACF,CAoIA,SAAS8X,GAAS3a,EAAMya,EAAO7V,GAE7B,OADA6V,EAAQ7Q,GAAU6Q,IAAUlkB,EAAayJ,EAAKG,OAAS,EAAKsa,EAAO,GAC5D,WAML,IALA,IAAIva,EAAO6f,UACPrf,GAAS,EACTP,EAASyJ,GAAU1J,EAAKC,OAASsa,EAAO,GACxCna,EAAQiB,EAAMpB,KAETO,EAAQP,GACfG,EAAMI,GAASR,EAAKua,EAAQ/Z,GAE9BA,GAAS,EAET,IADA,IAAI6kB,EAAYhkB,EAAMkZ,EAAQ,KACrB/Z,EAAQ+Z,GACf8K,EAAU7kB,GAASR,EAAKQ,GAG1B,OADA6kB,EAAU9K,GAAS7V,EAAUtE,GACtBP,GAAMC,EAAMxP,KAAM+0B,EAC3B,CACF,CAUA,SAASnQ,GAAOvS,EAAQ+Q,GACtB,OAAOA,EAAKzT,OAAS,EAAI0C,EAAS8Q,GAAQ9Q,EAAQsY,GAAUvH,EAAM,GAAI,GACxE,CAgCA,SAAS+E,GAAQ9V,EAAQT,GACvB,IAAY,gBAARA,GAAgD,mBAAhBS,EAAOT,KAIhC,aAAPA,EAIJ,OAAOS,EAAOT,EAChB,CAgBA,IAAIihB,GAAUmC,GAASzK,IAUnBhS,GAAaD,IAAiB,SAAS9I,EAAM8R,GAC/C,OAAOzT,GAAK0K,WAAW/I,EAAM8R,EAC/B,EAUI4I,GAAc8K,GAASxK,IAY3B,SAASsI,GAAgB9C,EAASiF,EAAWjW,GAC3C,IAAIpW,EAAUqsB,EAAY,GAC1B,OAAO/K,GAAY8F,EA1brB,SAA2BpnB,EAAQssB,GACjC,IAAIvlB,EAASulB,EAAQvlB,OACrB,IAAKA,EACH,OAAO/G,EAET,IAAI+L,EAAYhF,EAAS,EAGzB,OAFAulB,EAAQvgB,IAAchF,EAAS,EAAI,KAAO,IAAMulB,EAAQvgB,GACxDugB,EAAUA,EAAQ5oB,KAAKqD,EAAS,EAAI,KAAO,KACpC/G,EAAOmK,QAAQvJ,GAAe,uBAAyB0rB,EAAU,SAC1E,CAib8BC,CAAkBvsB,EAqHhD,SAA2BssB,EAASlW,GAOlC,OANA7O,GAAU1J,GAAW,SAASysB,GAC5B,IAAI/0B,EAAQ,KAAO+0B,EAAK,GACnBlU,EAAUkU,EAAK,KAAQxiB,GAAcwkB,EAAS/2B,IACjD+2B,EAAQtvB,KAAKzH,EAEjB,IACO+2B,EAAQlM,MACjB,CA7HwDoM,CAtjBxD,SAAwBxsB,GACtB,IAAIkM,EAAQlM,EAAOkM,MAAMrL,IACzB,OAAOqL,EAAQA,EAAM,GAAGE,MAAMtL,IAAkB,EAClD,CAmjB0E2rB,CAAezsB,GAASoW,IAClG,CAWA,SAASgW,GAASxlB,GAChB,IAAI8lB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQhc,KACRic,EApiNK,IAoiNmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAziNE,IA0iNN,OAAO/F,UAAU,QAGnB+F,EAAQ,EAEV,OAAO9lB,EAAKD,MAAMxJ,EAAWwpB,UAC/B,CACF,CAUA,SAAS5R,GAAY7N,EAAOmE,GAC1B,IAAI/D,GAAS,EACTP,EAASG,EAAMH,OACfgF,EAAYhF,EAAS,EAGzB,IADAsE,EAAOA,IAASlO,EAAY4J,EAASsE,IAC5B/D,EAAQ+D,GAAM,CACrB,IAAIyhB,EAAOjY,GAAWvN,EAAOyE,GACzBxW,EAAQ2R,EAAM4lB,GAElB5lB,EAAM4lB,GAAQ5lB,EAAMI,GACpBJ,EAAMI,GAAS/R,CACjB,CAEA,OADA2R,EAAMH,OAASsE,EACRnE,CACT,CASA,IAtTMW,GAOA0C,GA+SF6Z,IAtTEvc,GAASklB,IAsTkB,SAAS/iB,GACxC,IAAInC,EAAS,GAOb,OAN6B,KAAzBmC,EAAOgjB,WAAW,IACpBnlB,EAAO7K,KAAK,IAEdgN,EAAOG,QAAQ5J,IAAY,SAAS2L,EAAO8J,EAAQiX,EAAOC,GACxDrlB,EAAO7K,KAAKiwB,EAAQC,EAAU/iB,QAAQlJ,GAAc,MAAS+U,GAAU9J,EACzE,IACOrE,CACT,IA/T6B,SAASmB,GAIlC,OAh0MiB,MA6zMbuB,GAAMc,MACRd,GAAMoJ,QAED3K,CACT,IAEIuB,GAAQ1C,GAAO0C,MACZ1C,IAgUT,SAAS6S,GAAMnlB,GACb,GAAoB,iBAATA,GAAqBqkB,GAASrkB,GACvC,OAAOA,EAET,IAAIsS,EAAUtS,EAAQ,GACtB,MAAkB,KAAVsS,GAAkB,EAAItS,IAAU,IAAa,KAAOsS,CAC9D,CASA,SAAS8J,GAAS/K,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO4G,GAAaxG,KAAKJ,EAC3B,CAAE,MAAOd,GAAI,CACb,IACE,OAAQc,EAAO,EACjB,CAAE,MAAOd,GAAI,CACf,CACA,MAAO,EACT,CA2BA,SAAS2M,GAAa2U,GACpB,GAAIA,aAAmB7U,GACrB,OAAO6U,EAAQ+F,QAEjB,IAAItlB,EAAS,IAAI2K,GAAc4U,EAAQrU,YAAaqU,EAAQnU,WAI5D,OAHApL,EAAOmL,YAAcgC,GAAUoS,EAAQpU,aACvCnL,EAAOqL,UAAakU,EAAQlU,UAC5BrL,EAAOsL,WAAaiU,EAAQjU,WACrBtL,CACT,CAqIA,IAAIulB,GAAahM,IAAS,SAASla,EAAOmB,GACxC,OAAOoX,GAAkBvY,GACrByR,GAAezR,EAAO4S,GAAYzR,EAAQ,EAAGoX,IAAmB,IAChE,EACN,IA4BI4N,GAAejM,IAAS,SAASla,EAAOmB,GAC1C,IAAIjB,EAAW6U,GAAK5T,GAIpB,OAHIoX,GAAkBrY,KACpBA,EAAWjK,GAENsiB,GAAkBvY,GACrByR,GAAezR,EAAO4S,GAAYzR,EAAQ,EAAGoX,IAAmB,GAAOQ,GAAY7Y,EAAU,IAC7F,EACN,IAyBIkmB,GAAiBlM,IAAS,SAASla,EAAOmB,GAC5C,IAAIJ,EAAagU,GAAK5T,GAItB,OAHIoX,GAAkBxX,KACpBA,EAAa9K,GAERsiB,GAAkBvY,GACrByR,GAAezR,EAAO4S,GAAYzR,EAAQ,EAAGoX,IAAmB,GAAOtiB,EAAW8K,GAClF,EACN,IAqOA,SAASslB,GAAUrmB,EAAOQ,EAAWwB,GACnC,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAqB,MAAb4B,EAAoB,EAAImhB,GAAUnhB,GAI9C,OAHI5B,EAAQ,IACVA,EAAQkJ,GAAUzJ,EAASO,EAAO,IAE7B2B,GAAc/B,EAAO+Y,GAAYvY,EAAW,GAAIJ,EACzD,CAqCA,SAASkmB,GAActmB,EAAOQ,EAAWwB,GACvC,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAQP,EAAS,EAOrB,OANImC,IAAc/L,IAChBmK,EAAQ+iB,GAAUnhB,GAClB5B,EAAQ4B,EAAY,EAChBsH,GAAUzJ,EAASO,EAAO,GAC1BoJ,GAAUpJ,EAAOP,EAAS,IAEzBkC,GAAc/B,EAAO+Y,GAAYvY,EAAW,GAAIJ,GAAO,EAChE,CAgBA,SAASikB,GAAQrkB,GAEf,OADsB,MAATA,GAAoBA,EAAMH,OACvB+S,GAAY5S,EAAO,GAAK,EAC1C,CA+FA,SAASumB,GAAKvmB,GACZ,OAAQA,GAASA,EAAMH,OAAUG,EAAM,GAAK/J,CAC9C,CAyEA,IAAIuwB,GAAetM,IAAS,SAAS5F,GACnC,IAAImS,EAASzlB,GAASsT,EAAQ0I,IAC9B,OAAQyJ,EAAO5mB,QAAU4mB,EAAO,KAAOnS,EAAO,GAC1CD,GAAiBoS,GACjB,EACN,IAyBIC,GAAiBxM,IAAS,SAAS5F,GACrC,IAAIpU,EAAW6U,GAAKT,GAChBmS,EAASzlB,GAASsT,EAAQ0I,IAO9B,OALI9c,IAAa6U,GAAK0R,GACpBvmB,EAAWjK,EAEXwwB,EAAOzU,MAEDyU,EAAO5mB,QAAU4mB,EAAO,KAAOnS,EAAO,GAC1CD,GAAiBoS,EAAQ1N,GAAY7Y,EAAU,IAC/C,EACN,IAuBIymB,GAAmBzM,IAAS,SAAS5F,GACvC,IAAIvT,EAAagU,GAAKT,GAClBmS,EAASzlB,GAASsT,EAAQ0I,IAM9B,OAJAjc,EAAkC,mBAAdA,EAA2BA,EAAa9K,IAE1DwwB,EAAOzU,MAEDyU,EAAO5mB,QAAU4mB,EAAO,KAAOnS,EAAO,GAC1CD,GAAiBoS,EAAQxwB,EAAW8K,GACpC,EACN,IAmCA,SAASgU,GAAK/U,GACZ,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASG,EAAMH,EAAS,GAAK5J,CACtC,CAsFA,IAAI2wB,GAAO1M,GAAS2M,IAsBpB,SAASA,GAAQ7mB,EAAOmB,GACtB,OAAQnB,GAASA,EAAMH,QAAUsB,GAAUA,EAAOtB,OAC9C8Z,GAAY3Z,EAAOmB,GACnBnB,CACN,CAoFA,IAAI8mB,GAAShH,IAAS,SAAS9f,EAAO8Z,GACpC,IAAIja,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCc,EAASgO,GAAO3O,EAAO8Z,GAM3B,OAJAD,GAAW7Z,EAAOgB,GAAS8Y,GAAS,SAAS1Z,GAC3C,OAAOqN,GAAQrN,EAAOP,IAAWO,EAAQA,CAC3C,IAAG8Y,KAAKI,KAED3Y,CACT,IA0EA,SAASoJ,GAAQ/J,GACf,OAAgB,MAATA,EAAgBA,EAAQ8J,GAAchK,KAAKE,EACpD,CAiaA,IAAI+mB,GAAQ7M,IAAS,SAAS5F,GAC5B,OAAO4H,GAAStJ,GAAY0B,EAAQ,EAAGiE,IAAmB,GAC5D,IAyBIyO,GAAU9M,IAAS,SAAS5F,GAC9B,IAAIpU,EAAW6U,GAAKT,GAIpB,OAHIiE,GAAkBrY,KACpBA,EAAWjK,GAENimB,GAAStJ,GAAY0B,EAAQ,EAAGiE,IAAmB,GAAOQ,GAAY7Y,EAAU,GACzF,IAuBI+mB,GAAY/M,IAAS,SAAS5F,GAChC,IAAIvT,EAAagU,GAAKT,GAEtB,OADAvT,EAAkC,mBAAdA,EAA2BA,EAAa9K,EACrDimB,GAAStJ,GAAY0B,EAAQ,EAAGiE,IAAmB,GAAOtiB,EAAW8K,EAC9E,IA+FA,SAASmmB,GAAMlnB,GACb,IAAMA,IAASA,EAAMH,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAG,EAAQS,GAAYT,GAAO,SAASmnB,GAClC,GAAI5O,GAAkB4O,GAEpB,OADAtnB,EAASyJ,GAAU6d,EAAMtnB,OAAQA,IAC1B,CAEX,IACO8C,GAAU9C,GAAQ,SAASO,GAChC,OAAOY,GAAShB,EAAO0B,GAAatB,GACtC,GACF,CAuBA,SAASgnB,GAAUpnB,EAAOE,GACxB,IAAMF,IAASA,EAAMH,OACnB,MAAO,GAET,IAAIc,EAASumB,GAAMlnB,GACnB,OAAgB,MAAZE,EACKS,EAEFK,GAASL,GAAQ,SAASwmB,GAC/B,OAAO1nB,GAAMS,EAAUjK,EAAWkxB,EACpC,GACF,CAsBA,IAAIE,GAAUnN,IAAS,SAASla,EAAOmB,GACrC,OAAOoX,GAAkBvY,GACrByR,GAAezR,EAAOmB,GACtB,EACN,IAoBImmB,GAAMpN,IAAS,SAAS5F,GAC1B,OAAOsI,GAAQnc,GAAY6T,EAAQiE,IACrC,IAyBIgP,GAAQrN,IAAS,SAAS5F,GAC5B,IAAIpU,EAAW6U,GAAKT,GAIpB,OAHIiE,GAAkBrY,KACpBA,EAAWjK,GAEN2mB,GAAQnc,GAAY6T,EAAQiE,IAAoBQ,GAAY7Y,EAAU,GAC/E,IAuBIsnB,GAAUtN,IAAS,SAAS5F,GAC9B,IAAIvT,EAAagU,GAAKT,GAEtB,OADAvT,EAAkC,mBAAdA,EAA2BA,EAAa9K,EACrD2mB,GAAQnc,GAAY6T,EAAQiE,IAAoBtiB,EAAW8K,EACpE,IAkBI0mB,GAAMvN,GAASgN,IA6DfQ,GAAUxN,IAAS,SAAS5F,GAC9B,IAAIzU,EAASyU,EAAOzU,OAChBK,EAAWL,EAAS,EAAIyU,EAAOzU,EAAS,GAAK5J,EAGjD,OADAiK,EAA8B,mBAAZA,GAA0BoU,EAAOtC,MAAO9R,GAAYjK,EAC/DmxB,GAAU9S,EAAQpU,EAC3B,IAiCA,SAASynB,GAAMt5B,GACb,IAAIsS,EAASuK,GAAO7c,GAEpB,OADAsS,EAAOoL,WAAY,EACZpL,CACT,CAqDA,SAASsf,GAAK5xB,EAAOu5B,GACnB,OAAOA,EAAYv5B,EACrB,CAkBA,IAAIw5B,GAAY/H,IAAS,SAASlR,GAChC,IAAI/O,EAAS+O,EAAM/O,OACfsa,EAAQta,EAAS+O,EAAM,GAAK,EAC5BvgB,EAAQ6B,KAAK2b,YACb+b,EAAc,SAASrlB,GAAU,OAAOoM,GAAOpM,EAAQqM,EAAQ,EAEnE,QAAI/O,EAAS,GAAK3P,KAAK4b,YAAYjM,SAC7BxR,aAAiBgd,IAAiBoC,GAAQ0M,KAGhD9rB,EAAQA,EAAM0U,MAAMoX,GAAQA,GAASta,EAAS,EAAI,KAC5CiM,YAAYhW,KAAK,CACrB,KAAQmqB,GACR,KAAQ,CAAC2H,GACT,QAAW3xB,IAEN,IAAIqV,GAAcjd,EAAO6B,KAAK6b,WAAWkU,MAAK,SAASjgB,GAI5D,OAHIH,IAAWG,EAAMH,QACnBG,EAAMlK,KAAKG,GAEN+J,CACT,KAbS9P,KAAK+vB,KAAK2H,EAcrB,IAiPIE,GAAUpJ,IAAiB,SAAS/d,EAAQtS,EAAOyT,GACjD0E,GAAe1G,KAAKa,EAAQmB,KAC5BnB,EAAOmB,GAETqM,GAAgBxN,EAAQmB,EAAK,EAEjC,IAqIIimB,GAAOpI,GAAW0G,IAqBlB2B,GAAWrI,GAAW2G,IA2G1B,SAASliB,GAAQxC,EAAY1B,GAE3B,OADWkL,GAAQxJ,GAAcvB,GAAYmO,IACjC5M,EAAYmX,GAAY7Y,EAAU,GAChD,CAsBA,SAAS+nB,GAAarmB,EAAY1B,GAEhC,OADWkL,GAAQxJ,GAActB,GAAiBgS,IACtC1Q,EAAYmX,GAAY7Y,EAAU,GAChD,CAyBA,IAAIgoB,GAAUxJ,IAAiB,SAAS/d,EAAQtS,EAAOyT,GACjD0E,GAAe1G,KAAKa,EAAQmB,GAC9BnB,EAAOmB,GAAKhM,KAAKzH,GAEjB8f,GAAgBxN,EAAQmB,EAAK,CAACzT,GAElC,IAoEI85B,GAAYjO,IAAS,SAAStY,EAAY0R,EAAM1T,GAClD,IAAIQ,GAAS,EACTyP,EAAwB,mBAARyD,EAChB3S,EAASiX,GAAYhW,GAAcX,EAAMW,EAAW/B,QAAU,GAKlE,OAHA2O,GAAS5M,GAAY,SAASvT,GAC5BsS,IAASP,GAASyP,EAASpQ,GAAM6T,EAAMjlB,EAAOuR,GAAQiV,GAAWxmB,EAAOilB,EAAM1T,EAChF,IACOe,CACT,IA8BIynB,GAAQ1J,IAAiB,SAAS/d,EAAQtS,EAAOyT,GACnDqM,GAAgBxN,EAAQmB,EAAKzT,EAC/B,IA4CA,SAAS6V,GAAItC,EAAY1B,GAEvB,OADWkL,GAAQxJ,GAAcZ,GAAW2W,IAChC/V,EAAYmX,GAAY7Y,EAAU,GAChD,CAiFA,IAAImoB,GAAY3J,IAAiB,SAAS/d,EAAQtS,EAAOyT,GACvDnB,EAAOmB,EAAM,EAAI,GAAGhM,KAAKzH,EAC3B,IAAG,WAAa,MAAO,CAAC,GAAI,GAAK,IAmS7Bi6B,GAASpO,IAAS,SAAStY,EAAYiX,GACzC,GAAkB,MAAdjX,EACF,MAAO,GAET,IAAI/B,EAASgZ,EAAUhZ,OAMvB,OALIA,EAAS,GAAKmf,GAAepd,EAAYiX,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHhZ,EAAS,GAAKmf,GAAenG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYhX,EAAYgR,GAAYiG,EAAW,GAAI,GAC5D,IAoBItQ,GAAMD,IAAU,WAClB,OAAOvK,GAAK6H,KAAK2C,KACnB,EAyDA,SAASqY,GAAIlhB,EAAMkD,EAAGmc,GAGpB,OAFAnc,EAAImc,EAAQ9oB,EAAY2M,EACxBA,EAAKlD,GAAa,MAALkD,EAAalD,EAAKG,OAAS+C,EACjC4gB,GAAW9jB,EAAMpJ,EAAeL,EAAWA,EAAWA,EAAWA,EAAW2M,EACrF,CAmBA,SAAS2lB,GAAO3lB,EAAGlD,GACjB,IAAIiB,EACJ,GAAmB,mBAARjB,EACT,MAAM,IAAIsG,GAAU9P,GAGtB,OADA0M,EAAIugB,GAAUvgB,GACP,WAOL,QANMA,EAAI,IACRjC,EAASjB,EAAKD,MAAMvP,KAAMuvB,YAExB7c,GAAK,IACPlD,EAAOzJ,GAEF0K,CACT,CACF,CAqCA,IAAI6nB,GAAOtO,IAAS,SAASxa,EAAMC,EAASge,GAC1C,IAAIzO,EAv4Ta,EAw4TjB,GAAIyO,EAAS9d,OAAQ,CACnB,IAAI+d,EAAUpZ,GAAemZ,EAAUuD,GAAUsH,KACjDtZ,GAAW7Y,CACb,CACA,OAAOmtB,GAAW9jB,EAAMwP,EAASvP,EAASge,EAAUC,EACtD,IA+CI6K,GAAUvO,IAAS,SAAS3X,EAAQT,EAAK6b,GAC3C,IAAIzO,EAAUwZ,EACd,GAAI/K,EAAS9d,OAAQ,CACnB,IAAI+d,EAAUpZ,GAAemZ,EAAUuD,GAAUuH,KACjDvZ,GAAW7Y,CACb,CACA,OAAOmtB,GAAW1hB,EAAKoN,EAAS3M,EAAQob,EAAUC,EACpD,IAqJA,SAASrrB,GAASmN,EAAM8R,EAAM9hB,GAC5B,IAAIi5B,EACAC,EACAC,EACAloB,EACAmoB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACT9J,GAAW,EAEf,GAAmB,mBAAR1f,EACT,MAAM,IAAIsG,GAAU9P,GAUtB,SAASizB,EAAWC,GAClB,IAAIxpB,EAAO+oB,EACPhpB,EAAUipB,EAKd,OAHAD,EAAWC,EAAW3yB,EACtB+yB,EAAiBI,EACjBzoB,EAASjB,EAAKD,MAAME,EAASC,EAE/B,CAqBA,SAASypB,EAAaD,GACpB,IAAIE,EAAoBF,EAAOL,EAM/B,OAAQA,IAAiB9yB,GAAcqzB,GAAqB9X,GACzD8X,EAAoB,GAAOJ,GANJE,EAAOJ,GAM8BH,CACjE,CAEA,SAASU,IACP,IAAIH,EAAO7gB,KACX,GAAI8gB,EAAaD,GACf,OAAOI,EAAaJ,GAGtBN,EAAUrgB,GAAW8gB,EA3BvB,SAAuBH,GACrB,IAEIK,EAAcjY,GAFM4X,EAAOL,GAI/B,OAAOG,EACH1f,GAAUigB,EAAaZ,GAJDO,EAAOJ,IAK7BS,CACN,CAmBqCC,CAAcN,GACnD,CAEA,SAASI,EAAaJ,GAKpB,OAJAN,EAAU7yB,EAINmpB,GAAYuJ,EACPQ,EAAWC,IAEpBT,EAAWC,EAAW3yB,EACf0K,EACT,CAcA,SAASgpB,IACP,IAAIP,EAAO7gB,KACPqhB,EAAaP,EAAaD,GAM9B,GAJAT,EAAWlJ,UACXmJ,EAAW14B,KACX64B,EAAeK,EAEXQ,EAAY,CACd,GAAId,IAAY7yB,EACd,OAzEN,SAAqBmzB,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUrgB,GAAW8gB,EAAc/X,GAE5ByX,EAAUE,EAAWC,GAAQzoB,CACtC,CAkEakpB,CAAYd,GAErB,GAAIG,EAIF,OAFA7gB,GAAaygB,GACbA,EAAUrgB,GAAW8gB,EAAc/X,GAC5B2X,EAAWJ,EAEtB,CAIA,OAHID,IAAY7yB,IACd6yB,EAAUrgB,GAAW8gB,EAAc/X,IAE9B7Q,CACT,CAGA,OA3GA6Q,EAAOmR,GAASnR,IAAS,EACrB9F,GAAShc,KACXu5B,IAAYv5B,EAAQu5B,QAEpBJ,GADAK,EAAS,YAAax5B,GACH4Z,GAAUqZ,GAASjzB,EAAQm5B,UAAY,EAAGrX,GAAQqX,EACrEzJ,EAAW,aAAc1vB,IAAYA,EAAQ0vB,SAAWA,GAoG1DuK,EAAUG,OApCV,WACMhB,IAAY7yB,GACdoS,GAAaygB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAU7yB,CACjD,EA+BA0zB,EAAUI,MA7BV,WACE,OAAOjB,IAAY7yB,EAAY0K,EAAS6oB,EAAajhB,KACvD,EA4BOohB,CACT,CAoBA,IAAIK,GAAQ9P,IAAS,SAASxa,EAAME,GAClC,OAAO2R,GAAU7R,EAAM,EAAGE,EAC5B,IAqBIqqB,GAAQ/P,IAAS,SAASxa,EAAM8R,EAAM5R,GACxC,OAAO2R,GAAU7R,EAAMijB,GAASnR,IAAS,EAAG5R,EAC9C,IAoEA,SAASimB,GAAQnmB,EAAMwqB,GACrB,GAAmB,mBAARxqB,GAAmC,MAAZwqB,GAAuC,mBAAZA,EAC3D,MAAM,IAAIlkB,GAAU9P,GAEtB,IAAIi0B,EAAW,WACb,IAAIvqB,EAAO6f,UACP3d,EAAMooB,EAAWA,EAASzqB,MAAMvP,KAAM0P,GAAQA,EAAK,GACnDyD,EAAQ8mB,EAAS9mB,MAErB,GAAIA,EAAMC,IAAIxB,GACZ,OAAOuB,EAAM/R,IAAIwQ,GAEnB,IAAInB,EAASjB,EAAKD,MAAMvP,KAAM0P,GAE9B,OADAuqB,EAAS9mB,MAAQA,EAAM5R,IAAIqQ,EAAKnB,IAAW0C,EACpC1C,CACT,EAEA,OADAwpB,EAAS9mB,MAAQ,IAAKwiB,GAAQuE,OAASxd,IAChCud,CACT,CAyBA,SAASE,GAAO7pB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIwF,GAAU9P,GAEtB,OAAO,WACL,IAAI0J,EAAO6f,UACX,OAAQ7f,EAAKC,QACX,KAAK,EAAG,OAAQW,EAAUV,KAAK5P,MAC/B,KAAK,EAAG,OAAQsQ,EAAUV,KAAK5P,KAAM0P,EAAK,IAC1C,KAAK,EAAG,OAAQY,EAAUV,KAAK5P,KAAM0P,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQY,EAAUV,KAAK5P,KAAM0P,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQY,EAAUf,MAAMvP,KAAM0P,EAChC,CACF,CApCAimB,GAAQuE,MAAQxd,GA2FhB,IAAI0d,GAAWnN,IAAS,SAASzd,EAAM6qB,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAW1qB,QAAeuL,GAAQmf,EAAW,IACvDvpB,GAASupB,EAAW,GAAIrnB,GAAU6V,OAClC/X,GAAS4R,GAAY2X,EAAY,GAAIrnB,GAAU6V,QAEtBlZ,OAC7B,OAAOqa,IAAS,SAASta,GAIvB,IAHA,IAAIQ,GAAS,EACTP,EAAS2J,GAAU5J,EAAKC,OAAQ2qB,KAE3BpqB,EAAQP,GACfD,EAAKQ,GAASmqB,EAAWnqB,GAAON,KAAK5P,KAAM0P,EAAKQ,IAElD,OAAOX,GAAMC,EAAMxP,KAAM0P,EAC3B,GACF,IAmCI6qB,GAAUvQ,IAAS,SAASxa,EAAMie,GACpC,IAAIC,EAAUpZ,GAAemZ,EAAUuD,GAAUuJ,KACjD,OAAOjH,GAAW9jB,EAAMrJ,EAAmBJ,EAAW0nB,EAAUC,EAClE,IAkCI8M,GAAexQ,IAAS,SAASxa,EAAMie,GACzC,IAAIC,EAAUpZ,GAAemZ,EAAUuD,GAAUwJ,KACjD,OAAOlH,GAAW9jB,EAvgVQ,GAugVuBzJ,EAAW0nB,EAAUC,EACxE,IAwBI+M,GAAQ7K,IAAS,SAASpgB,EAAMoa,GAClC,OAAO0J,GAAW9jB,EA/hVA,IA+hVuBzJ,EAAWA,EAAWA,EAAW6jB,EAC5E,IAgaA,SAAS5L,GAAG7f,EAAO6lB,GACjB,OAAO7lB,IAAU6lB,GAAU7lB,GAAUA,GAAS6lB,GAAUA,CAC1D,CAyBA,IAAI0W,GAAKlI,GAA0BzO,IAyB/B4W,GAAMnI,IAA0B,SAASr0B,EAAO6lB,GAClD,OAAO7lB,GAAS6lB,CAClB,IAoBI7G,GAAc2H,GAAgB,WAAa,OAAOyK,SAAW,CAA/B,IAAsCzK,GAAkB,SAAS3mB,GACjG,OAAO8c,GAAa9c,IAAUmY,GAAe1G,KAAKzR,EAAO,YACtDqZ,GAAqB5H,KAAKzR,EAAO,SACtC,EAyBI+c,GAAUnK,EAAMmK,QAmBhBtM,GAAgBD,GAAoBqE,GAAUrE,IA75PlD,SAA2BxQ,GACzB,OAAO8c,GAAa9c,IAAUulB,GAAWvlB,IAAUuJ,CACrD,EAs7PA,SAASggB,GAAYvpB,GACnB,OAAgB,MAATA,GAAiBs2B,GAASt2B,EAAMwR,UAAYuT,GAAW/kB,EAChE,CA2BA,SAASkqB,GAAkBlqB,GACzB,OAAO8c,GAAa9c,IAAUupB,GAAYvpB,EAC5C,CAyCA,IAAI4a,GAAWD,IAAkBgc,GAmB7BhmB,GAASD,GAAamE,GAAUnE,IAxgQpC,SAAoB1Q,GAClB,OAAO8c,GAAa9c,IAAUulB,GAAWvlB,IAAU0I,CACrD,EA8qQA,SAAS+zB,GAAQz8B,GACf,IAAK8c,GAAa9c,GAChB,OAAO,EAET,IAAIshB,EAAMiE,GAAWvlB,GACrB,OAAOshB,GAAO3Y,GA9yWF,yBA8yWc2Y,GACC,iBAAjBthB,EAAMsnB,SAA4C,iBAAdtnB,EAAMJ,OAAqBuqB,GAAcnqB,EACzF,CAiDA,SAAS+kB,GAAW/kB,GAClB,IAAKqd,GAASrd,GACZ,OAAO,EAIT,IAAIshB,EAAMiE,GAAWvlB,GACrB,OAAOshB,GAAO1Y,GAAW0Y,GAAOzY,GA32WrB,0BA22W+ByY,GA/1W/B,kBA+1WkDA,CAC/D,CA4BA,SAASob,GAAU18B,GACjB,MAAuB,iBAATA,GAAqBA,GAAS80B,GAAU90B,EACxD,CA4BA,SAASs2B,GAASt2B,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASmI,CAC7C,CA2BA,SAASkV,GAASrd,GAChB,IAAIC,SAAcD,EAClB,OAAgB,MAATA,IAA0B,UAARC,GAA4B,YAARA,EAC/C,CA0BA,SAAS6c,GAAa9c,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAmBA,IAAI6Q,GAAQD,GAAYiE,GAAUjE,IA5xQlC,SAAmB5Q,GACjB,OAAO8c,GAAa9c,IAAUuhB,GAAOvhB,IAAU8I,CACjD,EA4+QA,SAAS6zB,GAAS38B,GAChB,MAAuB,iBAATA,GACX8c,GAAa9c,IAAUulB,GAAWvlB,IAAU+I,CACjD,CA8BA,SAASohB,GAAcnqB,GACrB,IAAK8c,GAAa9c,IAAUulB,GAAWvlB,IAAUgJ,EAC/C,OAAO,EAET,IAAIoU,EAAQnE,GAAajZ,GACzB,GAAc,OAAVod,EACF,OAAO,EAET,IAAI8E,EAAO/J,GAAe1G,KAAK2L,EAAO,gBAAkBA,EAAM+D,YAC9D,MAAsB,mBAARe,GAAsBA,aAAgBA,GAClDjK,GAAaxG,KAAKyQ,IAASxJ,EAC/B,CAmBA,IAAI3H,GAAWD,GAAe+D,GAAU/D,IA59QxC,SAAsB9Q,GACpB,OAAO8c,GAAa9c,IAAUulB,GAAWvlB,IAAUkJ,CACrD,EA4gRI+H,GAAQD,GAAY6D,GAAU7D,IAngRlC,SAAmBhR,GACjB,OAAO8c,GAAa9c,IAAUuhB,GAAOvhB,IAAUmJ,CACjD,EAohRA,SAASyzB,GAAS58B,GAChB,MAAuB,iBAATA,IACV+c,GAAQ/c,IAAU8c,GAAa9c,IAAUulB,GAAWvlB,IAAUoJ,CACpE,CAmBA,SAASib,GAASrkB,GAChB,MAAuB,iBAATA,GACX8c,GAAa9c,IAAUulB,GAAWvlB,IAAUqJ,CACjD,CAmBA,IAAI8H,GAAeD,GAAmB2D,GAAU3D,IAvjRhD,SAA0BlR,GACxB,OAAO8c,GAAa9c,IAClBs2B,GAASt2B,EAAMwR,WAAa1C,GAAeyW,GAAWvlB,GAC1D,EA4oRI68B,GAAKxI,GAA0BhL,IAyB/ByT,GAAMzI,IAA0B,SAASr0B,EAAO6lB,GAClD,OAAO7lB,GAAS6lB,CAClB,IAyBA,SAASkX,GAAQ/8B,GACf,IAAKA,EACH,MAAO,GAET,GAAIupB,GAAYvpB,GACd,OAAO48B,GAAS58B,GAAS0W,GAAc1W,GAASyf,GAAUzf,GAE5D,GAAIyZ,IAAezZ,EAAMyZ,IACvB,OAv8VN,SAAyBC,GAIvB,IAHA,IAAIrZ,EACAiS,EAAS,KAEJjS,EAAOqZ,EAASsjB,QAAQC,MAC/B3qB,EAAO7K,KAAKpH,EAAKL,OAEnB,OAAOsS,CACT,CA+7Va4qB,CAAgBl9B,EAAMyZ,OAE/B,IAAI6H,EAAMC,GAAOvhB,GAGjB,OAFWshB,GAAOxY,EAAS8M,GAAc0L,GAAOnY,EAASkN,GAAavD,IAE1D9S,EACd,CAyBA,SAASm0B,GAASn0B,GAChB,OAAKA,GAGLA,EAAQs0B,GAASt0B,MACHkI,GAAYlI,KAAU,IAxkYtB,uBAykYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,CA4BA,SAAS80B,GAAU90B,GACjB,IAAIsS,EAAS6hB,GAASn0B,GAClBm9B,EAAY7qB,EAAS,EAEzB,OAAOA,GAAWA,EAAU6qB,EAAY7qB,EAAS6qB,EAAY7qB,EAAU,CACzE,CA6BA,SAAS8qB,GAASp9B,GAChB,OAAOA,EAAQ0f,GAAUoV,GAAU90B,GAAQ,EAAGqI,GAAoB,CACpE,CAyBA,SAASisB,GAASt0B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIqkB,GAASrkB,GACX,OAAOoI,EAET,GAAIiV,GAASrd,GAAQ,CACnB,IAAI6lB,EAAgC,mBAAjB7lB,EAAM2c,QAAwB3c,EAAM2c,UAAY3c,EACnEA,EAAQqd,GAASwI,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAAT7lB,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQwU,GAASxU,GACjB,IAAIq9B,EAAWvxB,GAAW6J,KAAK3V,GAC/B,OAAQq9B,GAAYrxB,GAAU2J,KAAK3V,GAC/BmP,GAAanP,EAAM0U,MAAM,GAAI2oB,EAAW,EAAI,GAC3CxxB,GAAW8J,KAAK3V,GAASoI,GAAOpI,CACvC,CA0BA,SAASoqB,GAAcpqB,GACrB,OAAOqgB,GAAWrgB,EAAO6hB,GAAO7hB,GAClC,CAqDA,SAASkY,GAASlY,GAChB,OAAgB,MAATA,EAAgB,GAAK4tB,GAAa5tB,EAC3C,CAoCA,IAAIs9B,GAAS/M,IAAe,SAASrc,EAAQzJ,GAC3C,GAAI2e,GAAY3e,IAAW8e,GAAY9e,GACrC4V,GAAW5V,EAAQ8N,GAAK9N,GAASyJ,QAGnC,IAAK,IAAIT,KAAOhJ,EACV0N,GAAe1G,KAAKhH,EAAQgJ,IAC9BsM,GAAY7L,EAAQT,EAAKhJ,EAAOgJ,GAGtC,IAiCI8pB,GAAWhN,IAAe,SAASrc,EAAQzJ,GAC7C4V,GAAW5V,EAAQoX,GAAOpX,GAASyJ,EACrC,IA+BIspB,GAAejN,IAAe,SAASrc,EAAQzJ,EAAQqf,EAAUhJ,GACnET,GAAW5V,EAAQoX,GAAOpX,GAASyJ,EAAQ4M,EAC7C,IA8BI2c,GAAalN,IAAe,SAASrc,EAAQzJ,EAAQqf,EAAUhJ,GACjET,GAAW5V,EAAQ8N,GAAK9N,GAASyJ,EAAQ4M,EAC3C,IAmBI4c,GAAKjM,GAASnR,IA8DdjJ,GAAWwU,IAAS,SAAS3X,EAAQuc,GACvCvc,EAAS3E,GAAO2E,GAEhB,IAAInC,GAAS,EACTP,EAASif,EAAQjf,OACjBkf,EAAQlf,EAAS,EAAIif,EAAQ,GAAK7oB,EAMtC,IAJI8oB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDlf,EAAS,KAGFO,EAAQP,GAMf,IALA,IAAI/G,EAASgmB,EAAQ1e,GACjBhS,EAAQ8hB,GAAOpX,GACfkzB,GAAc,EACdC,EAAc79B,EAAMyR,SAEfmsB,EAAaC,GAAa,CACjC,IAAInqB,EAAM1T,EAAM49B,GACZ39B,EAAQkU,EAAOT,IAEfzT,IAAU4H,GACTiY,GAAG7f,EAAO+X,GAAYtE,MAAU0E,GAAe1G,KAAKyC,EAAQT,MAC/DS,EAAOT,GAAOhJ,EAAOgJ,GAEzB,CAGF,OAAOS,CACT,IAqBI2pB,GAAehS,IAAS,SAASta,GAEnC,OADAA,EAAK9J,KAAKG,EAAWguB,IACdxkB,GAAM0sB,GAAWl2B,EAAW2J,EACrC,IA+RA,SAAStO,GAAIiR,EAAQ+Q,EAAM0O,GACzB,IAAIrhB,EAAmB,MAAV4B,EAAiBtM,EAAYod,GAAQ9Q,EAAQ+Q,GAC1D,OAAO3S,IAAW1K,EAAY+rB,EAAerhB,CAC/C,CA2DA,SAASsX,GAAM1V,EAAQ+Q,GACrB,OAAiB,MAAV/Q,GAAkBkiB,GAAQliB,EAAQ+Q,EAAMc,GACjD,CAoBA,IAAIgY,GAASzK,IAAe,SAAShhB,EAAQtS,EAAOyT,GACrC,MAATzT,GACyB,mBAAlBA,EAAMkY,WACflY,EAAQyY,GAAqBhH,KAAKzR,IAGpCsS,EAAOtS,GAASyT,CAClB,GAAG6Y,GAAStD,KA4BRgV,GAAW1K,IAAe,SAAShhB,EAAQtS,EAAOyT,GACvC,MAATzT,GACyB,mBAAlBA,EAAMkY,WACflY,EAAQyY,GAAqBhH,KAAKzR,IAGhCmY,GAAe1G,KAAKa,EAAQtS,GAC9BsS,EAAOtS,GAAOyH,KAAKgM,GAEnBnB,EAAOtS,GAAS,CAACyT,EAErB,GAAGiX,IAoBCuT,GAASpS,GAASrF,IA8BtB,SAASjO,GAAKrE,GACZ,OAAOqV,GAAYrV,GAAU0K,GAAc1K,GAAUiV,GAASjV,EAChE,CAyBA,SAAS2N,GAAO3N,GACd,OAAOqV,GAAYrV,GAAU0K,GAAc1K,GAAQ,GAloTrD,SAAoBA,GAClB,IAAKmJ,GAASnJ,GACZ,OA09FJ,SAAsBA,GACpB,IAAI5B,EAAS,GACb,GAAc,MAAV4B,EACF,IAAK,IAAIT,KAAOlE,GAAO2E,GACrB5B,EAAO7K,KAAKgM,GAGhB,OAAOnB,CACT,CAl+FW4rB,CAAahqB,GAEtB,IAAIiqB,EAAU/U,GAAYlV,GACtB5B,EAAS,GAEb,IAAK,IAAImB,KAAOS,GACD,eAAPT,IAAyB0qB,GAAYhmB,GAAe1G,KAAKyC,EAAQT,KACrEnB,EAAO7K,KAAKgM,GAGhB,OAAOnB,CACT,CAqnT6D8rB,CAAWlqB,EACxE,CAsGA,IAAImqB,GAAQ9N,IAAe,SAASrc,EAAQzJ,EAAQqf,GAClDD,GAAU3V,EAAQzJ,EAAQqf,EAC5B,IAiCIgU,GAAYvN,IAAe,SAASrc,EAAQzJ,EAAQqf,EAAUhJ,GAChE+I,GAAU3V,EAAQzJ,EAAQqf,EAAUhJ,EACtC,IAsBIwd,GAAO7M,IAAS,SAASvd,EAAQqM,GACnC,IAAIjO,EAAS,CAAC,EACd,GAAc,MAAV4B,EACF,OAAO5B,EAET,IAAI0O,GAAS,EACbT,EAAQ5N,GAAS4N,GAAO,SAAS0E,GAG/B,OAFAA,EAAOC,GAASD,EAAM/Q,GACtB8M,IAAWA,EAASiE,EAAKzT,OAAS,GAC3ByT,CACT,IACA5E,GAAWnM,EAAQ6O,GAAa7O,GAAS5B,GACrC0O,IACF1O,EAASsO,GAAUtO,EAAQisB,EAAwD1I,KAGrF,IADA,IAAIrkB,EAAS+O,EAAM/O,OACZA,KACLma,GAAUrZ,EAAQiO,EAAM/O,IAE1B,OAAOc,CACT,IA2CIgF,GAAOma,IAAS,SAASvd,EAAQqM,GACnC,OAAiB,MAAVrM,EAAiB,CAAC,EAnmT3B,SAAkBA,EAAQqM,GACxB,OAAO6K,GAAWlX,EAAQqM,GAAO,SAASvgB,EAAOilB,GAC/C,OAAO2E,GAAM1V,EAAQ+Q,EACvB,GACF,CA+lT+BuZ,CAAStqB,EAAQqM,EAChD,IAoBA,SAASke,GAAOvqB,EAAQ/B,GACtB,GAAc,MAAV+B,EACF,MAAO,CAAC,EAEV,IAAInU,EAAQ4S,GAASoQ,GAAa7O,IAAS,SAASwqB,GAClD,MAAO,CAACA,EACV,IAEA,OADAvsB,EAAYuY,GAAYvY,GACjBiZ,GAAWlX,EAAQnU,GAAO,SAASC,EAAOilB,GAC/C,OAAO9S,EAAUnS,EAAOilB,EAAK,GAC/B,GACF,CA0IA,IAAI0Z,GAAU1J,GAAc1c,IA0BxBqmB,GAAY3J,GAAcpT,IA4K9B,SAAS/O,GAAOoB,GACd,OAAiB,MAAVA,EAAiB,GAAKY,GAAWZ,EAAQqE,GAAKrE,GACvD,CAiNA,IAAI2qB,GAAY7N,IAAiB,SAAS1e,EAAQwsB,EAAM/sB,GAEtD,OADA+sB,EAAOA,EAAKC,cACLzsB,GAAUP,EAAQitB,GAAWF,GAAQA,EAC9C,IAiBA,SAASE,GAAWvqB,GAClB,OAAOwqB,GAAW/mB,GAASzD,GAAQsqB,cACrC,CAoBA,SAAS7N,GAAOzc,GAEd,OADAA,EAASyD,GAASzD,KACDA,EAAOG,QAAQ1I,GAASoJ,IAAcV,QAAQrG,GAAa,GAC9E,CAqHA,IAAI2wB,GAAYlO,IAAiB,SAAS1e,EAAQwsB,EAAM/sB,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAM+sB,EAAKC,aAC5C,IAsBII,GAAYnO,IAAiB,SAAS1e,EAAQwsB,EAAM/sB,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAM+sB,EAAKC,aAC5C,IAmBIK,GAAavO,GAAgB,eA0N7BrtB,GAAYwtB,IAAiB,SAAS1e,EAAQwsB,EAAM/sB,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAM+sB,EAAKC,aAC5C,IA+DIM,GAAYrO,IAAiB,SAAS1e,EAAQwsB,EAAM/sB,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAMktB,GAAWH,EAClD,IAqiBIQ,GAAYtO,IAAiB,SAAS1e,EAAQwsB,EAAM/sB,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAM+sB,EAAKS,aAC5C,IAmBIN,GAAapO,GAAgB,eAqBjC,SAASI,GAAMxc,EAAQ+qB,EAAS9O,GAI9B,OAHAjc,EAASyD,GAASzD,IAClB+qB,EAAU9O,EAAQ9oB,EAAY43B,KAEd53B,EArybpB,SAAwB6M,GACtB,OAAO9F,GAAiBgH,KAAKlB,EAC/B,CAoybagrB,CAAehrB,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAOkC,MAAMlI,KAAkB,EACxC,CAwjbsCixB,CAAajrB,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAOkC,MAAMnL,KAAgB,EACtC,CAurc6Dm0B,CAAWlrB,GAE7DA,EAAOkC,MAAM6oB,IAAY,EAClC,CA0BA,IAAII,GAAU/T,IAAS,SAASxa,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMzJ,EAAW2J,EAChC,CAAE,MAAOhB,GACP,OAAOksB,GAAQlsB,GAAKA,EAAI,IAAIiH,GAAMjH,EACpC,CACF,IA4BIsvB,GAAUpO,IAAS,SAASvd,EAAQ4rB,GAKtC,OAJA9tB,GAAU8tB,GAAa,SAASrsB,GAC9BA,EAAM0R,GAAM1R,GACZqM,GAAgB5L,EAAQT,EAAK0mB,GAAKjmB,EAAOT,GAAMS,GACjD,IACOA,CACT,IAoGA,SAASoY,GAAStsB,GAChB,OAAO,WACL,OAAOA,CACT,CACF,CAgDA,IAAI+/B,GAAOvO,KAuBPwO,GAAYxO,IAAW,GAkB3B,SAASxI,GAAShpB,GAChB,OAAOA,CACT,CA4CA,SAAS6R,GAASR,GAChB,OAAO0X,GAA4B,mBAAR1X,EAAqBA,EAAOuP,GAAUvP,EAjte/C,GAktepB,CAsGA,IAAI4uB,GAASpU,IAAS,SAAS5G,EAAM1T,GACnC,OAAO,SAAS2C,GACd,OAAOsS,GAAWtS,EAAQ+Q,EAAM1T,EAClC,CACF,IAyBI2uB,GAAWrU,IAAS,SAAS3X,EAAQ3C,GACvC,OAAO,SAAS0T,GACd,OAAOuB,GAAWtS,EAAQ+Q,EAAM1T,EAClC,CACF,IAsCA,SAAS4uB,GAAMjsB,EAAQzJ,EAAQpJ,GAC7B,IAAItB,EAAQwY,GAAK9N,GACbq1B,EAAchb,GAAcra,EAAQ1K,GAEzB,MAAXsB,GACEgc,GAAS5S,KAAYq1B,EAAYtuB,SAAWzR,EAAMyR,UACtDnQ,EAAUoJ,EACVA,EAASyJ,EACTA,EAASrS,KACTi+B,EAAchb,GAAcra,EAAQ8N,GAAK9N,KAE3C,IAAI6uB,IAAUjc,GAAShc,IAAY,UAAWA,IAAcA,EAAQi4B,OAChE9X,EAASuD,GAAW7Q,GAqBxB,OAnBAlC,GAAU8tB,GAAa,SAAShP,GAC9B,IAAIzf,EAAO5G,EAAOqmB,GAClB5c,EAAO4c,GAAczf,EACjBmQ,IACFtN,EAAO2D,UAAUiZ,GAAc,WAC7B,IAAIvT,EAAW1b,KAAK6b,UACpB,GAAI4b,GAAS/b,EAAU,CACrB,IAAIjL,EAAS4B,EAAOrS,KAAK2b,aAKzB,OAJclL,EAAOmL,YAAcgC,GAAU5d,KAAK4b,cAE1ChW,KAAK,CAAE,KAAQ4J,EAAM,KAAQ+f,UAAW,QAAWld,IAC3D5B,EAAOoL,UAAYH,EACZjL,CACT,CACA,OAAOjB,EAAKD,MAAM8C,EAAQrB,GAAU,CAAChR,KAAK7B,SAAUoxB,WACtD,EAEJ,IAEOld,CACT,CAkCA,SAAS8gB,KAET,CA+CA,IAAIoL,GAAOxM,GAAWjhB,IA8BlB0tB,GAAYzM,GAAW1hB,IAiCvBouB,GAAW1M,GAAWzgB,IAwB1B,SAAShQ,GAAS8hB,GAChB,OAAOyE,GAAMzE,GAAQ5R,GAAa8R,GAAMF,IAh3X1C,SAA0BA,GACxB,OAAO,SAAS/Q,GACd,OAAO8Q,GAAQ9Q,EAAQ+Q,EACzB,CACF,CA42XmDsb,CAAiBtb,EACpE,CAsEA,IAAIub,GAAQvM,KAsCRwM,GAAaxM,IAAY,GAoB7B,SAASkC,KACP,MAAO,EACT,CAeA,SAASQ,KACP,OAAO,CACT,CA8JA,IA2oBMlsB,GA3oBFiU,GAAM+U,IAAoB,SAASiN,EAAQC,GAC7C,OAAOD,EAASC,CAClB,GAAG,GAuBCrmB,GAAOsa,GAAY,QAiBnBgM,GAASnN,IAAoB,SAASoN,EAAUC,GAClD,OAAOD,EAAWC,CACpB,GAAG,GAuBCtmB,GAAQoa,GAAY,SAwKpBmM,GAAWtN,IAAoB,SAASuN,EAAYC,GACtD,OAAOD,EAAaC,CACtB,GAAG,GAuBCC,GAAQtM,GAAY,SAiBpBuM,GAAW1N,IAAoB,SAAS2N,EAASC,GACnD,OAAOD,EAAUC,CACnB,GAAG,GAgmBH,OA1iBAxkB,GAAOykB,MAp6MP,SAAe/sB,EAAGlD,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIsG,GAAU9P,GAGtB,OADA0M,EAAIugB,GAAUvgB,GACP,WACL,KAAMA,EAAI,EACR,OAAOlD,EAAKD,MAAMvP,KAAMuvB,UAE5B,CACF,EA25MAvU,GAAO0V,IAAMA,GACb1V,GAAOygB,OAASA,GAChBzgB,GAAO0gB,SAAWA,GAClB1gB,GAAO2gB,aAAeA,GACtB3gB,GAAO4gB,WAAaA,GACpB5gB,GAAO6gB,GAAKA,GACZ7gB,GAAOqd,OAASA,GAChBrd,GAAOsd,KAAOA,GACdtd,GAAOgjB,QAAUA,GACjBhjB,GAAOud,QAAUA,GACjBvd,GAAO0kB,UAl8KP,WACE,IAAKnQ,UAAU5f,OACb,MAAO,GAET,IAAIxR,EAAQoxB,UAAU,GACtB,OAAOrU,GAAQ/c,GAASA,EAAQ,CAACA,EACnC,EA67KA6c,GAAOyc,MAAQA,GACfzc,GAAO2kB,MApgTP,SAAe7vB,EAAOmE,EAAM4a,GAExB5a,GADG4a,EAAQC,GAAehf,EAAOmE,EAAM4a,GAAS5a,IAASlO,GAClD,EAEAqT,GAAU6Z,GAAUhf,GAAO,GAEpC,IAAItE,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,GAAUsE,EAAO,EACpB,MAAO,GAMT,IAJA,IAAI/D,EAAQ,EACRM,EAAW,EACXC,EAASM,EAAMyH,GAAW7I,EAASsE,IAEhC/D,EAAQP,GACbc,EAAOD,KAAcma,GAAU7a,EAAOI,EAAQA,GAAS+D,GAEzD,OAAOxD,CACT,EAm/SAuK,GAAO4kB,QAl+SP,SAAiB9vB,GAMf,IALA,IAAII,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCa,EAAW,EACXC,EAAS,KAEJP,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACd/R,IACFsS,EAAOD,KAAcrS,EAEzB,CACA,OAAOsS,CACT,EAs9SAuK,GAAOtZ,OA97SP,WACE,IAAIiO,EAAS4f,UAAU5f,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAID,EAAOqB,EAAMpB,EAAS,GACtBG,EAAQyf,UAAU,GAClBrf,EAAQP,EAELO,KACLR,EAAKQ,EAAQ,GAAKqf,UAAUrf,GAE9B,OAAOc,GAAUkK,GAAQpL,GAAS8N,GAAU9N,GAAS,CAACA,GAAQ4S,GAAYhT,EAAM,GAClF,EAk7SAsL,GAAO6kB,KA3tCP,SAAc7d,GACZ,IAAIrS,EAAkB,MAATqS,EAAgB,EAAIA,EAAMrS,OACnC+hB,EAAa7I,KASjB,OAPA7G,EAASrS,EAAcmB,GAASkR,GAAO,SAASkR,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIpd,GAAU9P,GAEtB,MAAO,CAAC0rB,EAAWwB,EAAK,IAAKA,EAAK,GACpC,IALkB,GAOXlJ,IAAS,SAASta,GAEvB,IADA,IAAIQ,GAAS,IACJA,EAAQP,GAAQ,CACvB,IAAIujB,EAAOlR,EAAM9R,GACjB,GAAIX,GAAM2jB,EAAK,GAAIlzB,KAAM0P,GACvB,OAAOH,GAAM2jB,EAAK,GAAIlzB,KAAM0P,EAEhC,CACF,GACF,EAwsCAsL,GAAO8kB,SA9qCP,SAAkBl3B,GAChB,OAz5YF,SAAsBA,GACpB,IAAI1K,EAAQwY,GAAK9N,GACjB,OAAO,SAASyJ,GACd,OAAO+O,GAAe/O,EAAQzJ,EAAQ1K,EACxC,CACF,CAo5YS6hC,CAAahhB,GAAUnW,EA/ieZ,GAgjepB,EA6qCAoS,GAAOyP,SAAWA,GAClBzP,GAAO4c,QAAUA,GACjB5c,GAAOzD,OAtuHP,SAAgBvB,EAAWgqB,GACzB,IAAIvvB,EAAS6K,GAAWtF,GACxB,OAAqB,MAAdgqB,EAAqBvvB,EAAS8N,GAAW9N,EAAQuvB,EAC1D,EAouHAhlB,GAAOilB,MAzuMP,SAASA,EAAMzwB,EAAMmhB,EAAO9B,GAE1B,IAAIpe,EAAS6iB,GAAW9jB,EA7+TN,EA6+T6BzJ,EAAWA,EAAWA,EAAWA,EAAWA,EAD3F4qB,EAAQ9B,EAAQ9oB,EAAY4qB,GAG5B,OADAlgB,EAAO8D,YAAc0rB,EAAM1rB,YACpB9D,CACT,EAquMAuK,GAAOklB,WA7rMP,SAASA,EAAW1wB,EAAMmhB,EAAO9B,GAE/B,IAAIpe,EAAS6iB,GAAW9jB,EAzhUA,GAyhU6BzJ,EAAWA,EAAWA,EAAWA,EAAWA,EADjG4qB,EAAQ9B,EAAQ9oB,EAAY4qB,GAG5B,OADAlgB,EAAO8D,YAAc2rB,EAAW3rB,YACzB9D,CACT,EAyrMAuK,GAAO3Y,SAAWA,GAClB2Y,GAAOxF,SAAWA,GAClBwF,GAAOghB,aAAeA,GACtBhhB,GAAO8e,MAAQA,GACf9e,GAAO+e,MAAQA,GACf/e,GAAOgb,WAAaA,GACpBhb,GAAOib,aAAeA,GACtBjb,GAAOkb,eAAiBA,GACxBlb,GAAOmlB,KAt0SP,SAAcrwB,EAAO4C,EAAGmc,GACtB,IAAIlf,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,EAIEgb,GAAU7a,GADjB4C,EAAKmc,GAASnc,IAAM3M,EAAa,EAAIktB,GAAUvgB,IACnB,EAAI,EAAIA,EAAG/C,GAH9B,EAIX,EAg0SAqL,GAAOolB,UArySP,SAAmBtwB,EAAO4C,EAAGmc,GAC3B,IAAIlf,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,EAKEgb,GAAU7a,EAAO,GADxB4C,EAAI/C,GADJ+C,EAAKmc,GAASnc,IAAM3M,EAAa,EAAIktB,GAAUvgB,KAEhB,EAAI,EAAIA,GAJ9B,EAKX,EA8xSAsI,GAAOqlB,eAzvSP,SAAwBvwB,EAAOQ,GAC7B,OAAQR,GAASA,EAAMH,OACnB0c,GAAUvc,EAAO+Y,GAAYvY,EAAW,IAAI,GAAM,GAClD,EACN,EAsvSA0K,GAAOslB,UAjtSP,SAAmBxwB,EAAOQ,GACxB,OAAQR,GAASA,EAAMH,OACnB0c,GAAUvc,EAAO+Y,GAAYvY,EAAW,IAAI,GAC5C,EACN,EA8sSA0K,GAAOulB,KA/qSP,SAAczwB,EAAO3R,EAAO8rB,EAAOW,GACjC,IAAIjb,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGDsa,GAAyB,iBAATA,GAAqB6E,GAAehf,EAAO3R,EAAO8rB,KACpEA,EAAQ,EACRW,EAAMjb,GAzvIV,SAAkBG,EAAO3R,EAAO8rB,EAAOW,GACrC,IAAIjb,EAASG,EAAMH,OAWnB,KATAsa,EAAQgJ,GAAUhJ,IACN,IACVA,GAASA,EAAQta,EAAS,EAAKA,EAASsa,IAE1CW,EAAOA,IAAQ7kB,GAAa6kB,EAAMjb,EAAUA,EAASsjB,GAAUrI,IACrD,IACRA,GAAOjb,GAETib,EAAMX,EAAQW,EAAM,EAAI2Q,GAAS3Q,GAC1BX,EAAQW,GACb9a,EAAMma,KAAW9rB,EAEnB,OAAO2R,CACT,CA2uIS0wB,CAAS1wB,EAAO3R,EAAO8rB,EAAOW,IAN5B,EAOX,EAsqSA5P,GAAOylB,OA3vOP,SAAgB/uB,EAAYpB,GAE1B,OADW4K,GAAQxJ,GAAcnB,GAAckS,IACnC/Q,EAAYmX,GAAYvY,EAAW,GACjD,EAyvOA0K,GAAO0lB,QAvqOP,SAAiBhvB,EAAY1B,GAC3B,OAAO0S,GAAY1O,GAAItC,EAAY1B,GAAW,EAChD,EAsqOAgL,GAAO2lB,YAhpOP,SAAqBjvB,EAAY1B,GAC/B,OAAO0S,GAAY1O,GAAItC,EAAY1B,GAAW3J,EAChD,EA+oOA2U,GAAO4lB,aAxnOP,SAAsBlvB,EAAY1B,EAAU2S,GAE1C,OADAA,EAAQA,IAAU5c,EAAY,EAAIktB,GAAUtQ,GACrCD,GAAY1O,GAAItC,EAAY1B,GAAW2S,EAChD,EAsnOA3H,GAAOmZ,QAAUA,GACjBnZ,GAAO6lB,YAviSP,SAAqB/wB,GAEnB,OADsB,MAATA,GAAoBA,EAAMH,OACvB+S,GAAY5S,EAAOzJ,GAAY,EACjD,EAqiSA2U,GAAO8lB,aA/gSP,SAAsBhxB,EAAO6S,GAE3B,OADsB,MAAT7S,GAAoBA,EAAMH,OAKhC+S,GAAY5S,EADnB6S,EAAQA,IAAU5c,EAAY,EAAIktB,GAAUtQ,IAFnC,EAIX,EAygSA3H,GAAO+lB,KAz9LP,SAAcvxB,GACZ,OAAO8jB,GAAW9jB,EA5wUD,IA6wUnB,EAw9LAwL,GAAOkjB,KAAOA,GACdljB,GAAOmjB,UAAYA,GACnBnjB,GAAOgmB,UA3/RP,SAAmBhf,GAKjB,IAJA,IAAI9R,GAAS,EACTP,EAAkB,MAATqS,EAAgB,EAAIA,EAAMrS,OACnCc,EAAS,CAAC,IAELP,EAAQP,GAAQ,CACvB,IAAIujB,EAAOlR,EAAM9R,GACjBO,EAAOyiB,EAAK,IAAMA,EAAK,EACzB,CACA,OAAOziB,CACT,EAk/RAuK,GAAOimB,UA38GP,SAAmB5uB,GACjB,OAAiB,MAAVA,EAAiB,GAAK4Q,GAAc5Q,EAAQqE,GAAKrE,GAC1D,EA08GA2I,GAAOkmB,YAj7GP,SAAqB7uB,GACnB,OAAiB,MAAVA,EAAiB,GAAK4Q,GAAc5Q,EAAQ2N,GAAO3N,GAC5D,EAg7GA2I,GAAOgd,QAAUA,GACjBhd,GAAOmmB,QA56RP,SAAiBrxB,GAEf,OADsB,MAATA,GAAoBA,EAAMH,OACvBgb,GAAU7a,EAAO,GAAI,GAAK,EAC5C,EA06RAkL,GAAOsb,aAAeA,GACtBtb,GAAOwb,eAAiBA,GACxBxb,GAAOyb,iBAAmBA,GAC1Bzb,GAAOkhB,OAASA,GAChBlhB,GAAOmhB,SAAWA,GAClBnhB,GAAOid,UAAYA,GACnBjd,GAAOhL,SAAWA,GAClBgL,GAAOkd,MAAQA,GACfld,GAAOtE,KAAOA,GACdsE,GAAOgF,OAASA,GAChBhF,GAAOhH,IAAMA,GACbgH,GAAOomB,QA1rGP,SAAiB/uB,EAAQrC,GACvB,IAAIS,EAAS,CAAC,EAMd,OALAT,EAAW6Y,GAAY7Y,EAAU,GAEjCmS,GAAW9P,GAAQ,SAASlU,EAAOyT,EAAKS,GACtC4L,GAAgBxN,EAAQT,EAAS7R,EAAOyT,EAAKS,GAASlU,EACxD,IACOsS,CACT,EAmrGAuK,GAAOqmB,UArpGP,SAAmBhvB,EAAQrC,GACzB,IAAIS,EAAS,CAAC,EAMd,OALAT,EAAW6Y,GAAY7Y,EAAU,GAEjCmS,GAAW9P,GAAQ,SAASlU,EAAOyT,EAAKS,GACtC4L,GAAgBxN,EAAQmB,EAAK5B,EAAS7R,EAAOyT,EAAKS,GACpD,IACO5B,CACT,EA8oGAuK,GAAOsmB,QAphCP,SAAiB14B,GACf,OAAOye,GAAYtI,GAAUnW,EAxveX,GAyvepB,EAmhCAoS,GAAOumB,gBAh/BP,SAAyBne,EAAM2D,GAC7B,OAAOK,GAAoBhE,EAAMrE,GAAUgI,EA7xezB,GA8xepB,EA++BA/L,GAAO2a,QAAUA,GACjB3a,GAAOwhB,MAAQA,GACfxhB,GAAOihB,UAAYA,GACnBjhB,GAAOojB,OAASA,GAChBpjB,GAAOqjB,SAAWA,GAClBrjB,GAAOsjB,MAAQA,GACftjB,GAAOmf,OAASA,GAChBnf,GAAOwmB,OAzzBP,SAAgB9uB,GAEd,OADAA,EAAIugB,GAAUvgB,GACPsX,IAAS,SAASta,GACvB,OAAO+Y,GAAQ/Y,EAAMgD,EACvB,GACF,EAqzBAsI,GAAOyhB,KAAOA,GACdzhB,GAAOymB,OAnhGP,SAAgBpvB,EAAQ/B,GACtB,OAAOssB,GAAOvqB,EAAQ8nB,GAAOtR,GAAYvY,IAC3C,EAkhGA0K,GAAO0mB,KA73LP,SAAclyB,GACZ,OAAO6oB,GAAO,EAAG7oB,EACnB,EA43LAwL,GAAO2mB,QAr4NP,SAAiBjwB,EAAYiX,EAAWC,EAAQiG,GAC9C,OAAkB,MAAdnd,EACK,IAEJwJ,GAAQyN,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnCzN,GADL0N,EAASiG,EAAQ9oB,EAAY6iB,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYhX,EAAYiX,EAAWC,GAC5C,EA03NA5N,GAAOujB,KAAOA,GACdvjB,GAAOof,SAAWA,GAClBpf,GAAOwjB,UAAYA,GACnBxjB,GAAOyjB,SAAWA,GAClBzjB,GAAOuf,QAAUA,GACjBvf,GAAOwf,aAAeA,GACtBxf,GAAOmd,UAAYA,GACnBnd,GAAOvF,KAAOA,GACduF,GAAO4hB,OAASA,GAChB5hB,GAAO1Z,SAAWA,GAClB0Z,GAAO4mB,WA/rBP,SAAoBvvB,GAClB,OAAO,SAAS+Q,GACd,OAAiB,MAAV/Q,EAAiBtM,EAAYod,GAAQ9Q,EAAQ+Q,EACtD,CACF,EA4rBApI,GAAO0b,KAAOA,GACd1b,GAAO2b,QAAUA,GACjB3b,GAAO6mB,UApsRP,SAAmB/xB,EAAOmB,EAAQjB,GAChC,OAAQF,GAASA,EAAMH,QAAUsB,GAAUA,EAAOtB,OAC9C8Z,GAAY3Z,EAAOmB,EAAQ4X,GAAY7Y,EAAU,IACjDF,CACN,EAisRAkL,GAAO8mB,YAxqRP,SAAqBhyB,EAAOmB,EAAQJ,GAClC,OAAQf,GAASA,EAAMH,QAAUsB,GAAUA,EAAOtB,OAC9C8Z,GAAY3Z,EAAOmB,EAAQlL,EAAW8K,GACtCf,CACN,EAqqRAkL,GAAO4b,OAASA,GAChB5b,GAAO2jB,MAAQA,GACf3jB,GAAO4jB,WAAaA,GACpB5jB,GAAOyf,MAAQA,GACfzf,GAAO+mB,OAxvNP,SAAgBrwB,EAAYpB,GAE1B,OADW4K,GAAQxJ,GAAcnB,GAAckS,IACnC/Q,EAAYyoB,GAAOtR,GAAYvY,EAAW,IACxD,EAsvNA0K,GAAOgnB,OAzmRP,SAAgBlyB,EAAOQ,GACrB,IAAIG,EAAS,GACb,IAAMX,IAASA,EAAMH,OACnB,OAAOc,EAET,IAAIP,GAAS,EACT0Z,EAAU,GACVja,EAASG,EAAMH,OAGnB,IADAW,EAAYuY,GAAYvY,EAAW,KAC1BJ,EAAQP,GAAQ,CACvB,IAAIxR,EAAQ2R,EAAMI,GACdI,EAAUnS,EAAO+R,EAAOJ,KAC1BW,EAAO7K,KAAKzH,GACZyrB,EAAQhkB,KAAKsK,GAEjB,CAEA,OADAyZ,GAAW7Z,EAAO8Z,GACXnZ,CACT,EAulRAuK,GAAOinB,KAluLP,SAAczyB,EAAMya,GAClB,GAAmB,mBAARza,EACT,MAAM,IAAIsG,GAAU9P,GAGtB,OAAOgkB,GAASxa,EADhBya,EAAQA,IAAUlkB,EAAYkkB,EAAQgJ,GAAUhJ,GAElD,EA6tLAjP,GAAOnB,QAAUA,GACjBmB,GAAOknB,WAhtNP,SAAoBxwB,EAAYgB,EAAGmc,GAOjC,OALEnc,GADGmc,EAAQC,GAAepd,EAAYgB,EAAGmc,GAASnc,IAAM3M,GACpD,EAEAktB,GAAUvgB,IAELwI,GAAQxJ,GAAcgM,GAAkB2M,IACvC3Y,EAAYgB,EAC1B,EAysNAsI,GAAOzZ,IAv6FP,SAAa8Q,EAAQ+Q,EAAMjlB,GACzB,OAAiB,MAAVkU,EAAiBA,EAASmX,GAAQnX,EAAQ+Q,EAAMjlB,EACzD,EAs6FA6c,GAAOmnB,QA54FP,SAAiB9vB,EAAQ+Q,EAAMjlB,EAAO8gB,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAalZ,EAC3C,MAAVsM,EAAiBA,EAASmX,GAAQnX,EAAQ+Q,EAAMjlB,EAAO8gB,EAChE,EA04FAjE,GAAOonB,QA1rNP,SAAiB1wB,GAEf,OADWwJ,GAAQxJ,GAAcoM,GAAe4M,IACpChZ,EACd,EAwrNAsJ,GAAOnI,MAhjRP,SAAe/C,EAAOma,EAAOW,GAC3B,IAAIjb,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGDib,GAAqB,iBAAPA,GAAmBkE,GAAehf,EAAOma,EAAOW,IAChEX,EAAQ,EACRW,EAAMjb,IAGNsa,EAAiB,MAATA,EAAgB,EAAIgJ,GAAUhJ,GACtCW,EAAMA,IAAQ7kB,EAAY4J,EAASsjB,GAAUrI,IAExCD,GAAU7a,EAAOma,EAAOW,IAVtB,EAWX,EAmiRA5P,GAAOod,OAASA,GAChBpd,GAAOqnB,WAx3QP,SAAoBvyB,GAClB,OAAQA,GAASA,EAAMH,OACnBkc,GAAe/b,GACf,EACN,EAq3QAkL,GAAOsnB,aAn2QP,SAAsBxyB,EAAOE,GAC3B,OAAQF,GAASA,EAAMH,OACnBkc,GAAe/b,EAAO+Y,GAAY7Y,EAAU,IAC5C,EACN,EAg2QAgL,GAAOhG,MA5hEP,SAAepC,EAAQ2vB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB1T,GAAelc,EAAQ2vB,EAAWC,KACzED,EAAYC,EAAQz8B,IAEtBy8B,EAAQA,IAAUz8B,EAAYS,EAAmBg8B,IAAU,IAI3D5vB,EAASyD,GAASzD,MAEQ,iBAAb2vB,GACO,MAAbA,IAAsBrzB,GAASqzB,OAEpCA,EAAYxW,GAAawW,KACP1uB,GAAWjB,GACpBsa,GAAUrY,GAAcjC,GAAS,EAAG4vB,GAGxC5vB,EAAOoC,MAAMutB,EAAWC,GAZtB,EAaX,EA0gEAxnB,GAAOynB,OAnsLP,SAAgBjzB,EAAMya,GACpB,GAAmB,mBAARza,EACT,MAAM,IAAIsG,GAAU9P,GAGtB,OADAikB,EAAiB,MAATA,EAAgB,EAAI7Q,GAAU6Z,GAAUhJ,GAAQ,GACjDD,IAAS,SAASta,GACvB,IAAII,EAAQJ,EAAKua,GACb8K,EAAY7H,GAAUxd,EAAM,EAAGua,GAKnC,OAHIna,GACFkB,GAAU+jB,EAAWjlB,GAEhBP,GAAMC,EAAMxP,KAAM+0B,EAC3B,GACF,EAsrLA/Z,GAAO0nB,KAl1QP,SAAc5yB,GACZ,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASgb,GAAU7a,EAAO,EAAGH,GAAU,EAChD,EAg1QAqL,GAAO2nB,KArzQP,SAAc7yB,EAAO4C,EAAGmc,GACtB,OAAM/e,GAASA,EAAMH,OAIdgb,GAAU7a,EAAO,GADxB4C,EAAKmc,GAASnc,IAAM3M,EAAa,EAAIktB,GAAUvgB,IAChB,EAAI,EAAIA,GAH9B,EAIX,EAgzQAsI,GAAO4nB,UArxQP,SAAmB9yB,EAAO4C,EAAGmc,GAC3B,IAAIlf,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,EAKEgb,GAAU7a,GADjB4C,EAAI/C,GADJ+C,EAAKmc,GAASnc,IAAM3M,EAAa,EAAIktB,GAAUvgB,KAEnB,EAAI,EAAIA,EAAG/C,GAJ9B,EAKX,EA8wQAqL,GAAO6nB,eAzuQP,SAAwB/yB,EAAOQ,GAC7B,OAAQR,GAASA,EAAMH,OACnB0c,GAAUvc,EAAO+Y,GAAYvY,EAAW,IAAI,GAAO,GACnD,EACN,EAsuQA0K,GAAO8nB,UAjsQP,SAAmBhzB,EAAOQ,GACxB,OAAQR,GAASA,EAAMH,OACnB0c,GAAUvc,EAAO+Y,GAAYvY,EAAW,IACxC,EACN,EA8rQA0K,GAAO+nB,IApuPP,SAAa5kC,EAAOu5B,GAElB,OADAA,EAAYv5B,GACLA,CACT,EAkuPA6c,GAAOgoB,SA9oLP,SAAkBxzB,EAAM8R,EAAM9hB,GAC5B,IAAIu5B,GAAU,EACV7J,GAAW,EAEf,GAAmB,mBAAR1f,EACT,MAAM,IAAIsG,GAAU9P,GAMtB,OAJIwV,GAAShc,KACXu5B,EAAU,YAAav5B,IAAYA,EAAQu5B,QAAUA,EACrD7J,EAAW,aAAc1vB,IAAYA,EAAQ0vB,SAAWA,GAEnD7sB,GAASmN,EAAM8R,EAAM,CAC1B,QAAWyX,EACX,QAAWzX,EACX,SAAY4N,GAEhB,EA+nLAlU,GAAO+U,KAAOA,GACd/U,GAAOkgB,QAAUA,GACjBlgB,GAAO8hB,QAAUA,GACjB9hB,GAAO+hB,UAAYA,GACnB/hB,GAAOioB,OArfP,SAAgB9kC,GACd,OAAI+c,GAAQ/c,GACH2S,GAAS3S,EAAOmlB,IAElBd,GAASrkB,GAAS,CAACA,GAASyf,GAAUoP,GAAa3W,GAASlY,IACrE,EAifA6c,GAAOuN,cAAgBA,GACvBvN,GAAO5G,UA10FP,SAAmB/B,EAAQrC,EAAUC,GACnC,IAAIgN,EAAQ/B,GAAQ7I,GAChB6wB,EAAYjmB,GAASlE,GAAS1G,IAAW/C,GAAa+C,GAG1D,GADArC,EAAW6Y,GAAY7Y,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIoQ,EAAOhO,GAAUA,EAAOiN,YAE1BrP,EADEizB,EACYjmB,EAAQ,IAAIoD,EAAO,GAE1B7E,GAASnJ,IACF6Q,GAAW7C,GAAQ/E,GAAWlE,GAAa/E,IAG3C,CAAC,CAEnB,CAIA,OAHC6wB,EAAY/yB,GAAYgS,IAAY9P,GAAQ,SAASlU,EAAO+R,EAAOmC,GAClE,OAAOrC,EAASC,EAAa9R,EAAO+R,EAAOmC,EAC7C,IACOpC,CACT,EAszFA+K,GAAOmoB,MArnLP,SAAe3zB,GACb,OAAOkhB,GAAIlhB,EAAM,EACnB,EAonLAwL,GAAO6b,MAAQA,GACf7b,GAAO8b,QAAUA,GACjB9b,GAAO+b,UAAYA,GACnB/b,GAAOooB,KAzmQP,SAActzB,GACZ,OAAQA,GAASA,EAAMH,OAAUqc,GAASlc,GAAS,EACrD,EAwmQAkL,GAAOqoB,OA/kQP,SAAgBvzB,EAAOE,GACrB,OAAQF,GAASA,EAAMH,OAAUqc,GAASlc,EAAO+Y,GAAY7Y,EAAU,IAAM,EAC/E,EA8kQAgL,GAAOsoB,SAxjQP,SAAkBxzB,EAAOe,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa9K,EACpD+J,GAASA,EAAMH,OAAUqc,GAASlc,EAAO/J,EAAW8K,GAAc,EAC5E,EAsjQAmK,GAAOuoB,MAhyFP,SAAelxB,EAAQ+Q,GACrB,OAAiB,MAAV/Q,GAAwByX,GAAUzX,EAAQ+Q,EACnD,EA+xFApI,GAAOgc,MAAQA,GACfhc,GAAOkc,UAAYA,GACnBlc,GAAOwoB,OApwFP,SAAgBnxB,EAAQ+Q,EAAMgJ,GAC5B,OAAiB,MAAV/Z,EAAiBA,EAAS8Z,GAAW9Z,EAAQ+Q,EAAM2J,GAAaX,GACzE,EAmwFApR,GAAOyoB,WAzuFP,SAAoBpxB,EAAQ+Q,EAAMgJ,EAASnN,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAalZ,EAC3C,MAAVsM,EAAiBA,EAAS8Z,GAAW9Z,EAAQ+Q,EAAM2J,GAAaX,GAAUnN,EACnF,EAuuFAjE,GAAO/J,OAASA,GAChB+J,GAAO0oB,SAhrFP,SAAkBrxB,GAChB,OAAiB,MAAVA,EAAiB,GAAKY,GAAWZ,EAAQ2N,GAAO3N,GACzD,EA+qFA2I,GAAOmc,QAAUA,GACjBnc,GAAOoU,MAAQA,GACfpU,GAAO2oB,KA3mLP,SAAcxlC,EAAO6xB,GACnB,OAAOuK,GAAQxN,GAAaiD,GAAU7xB,EACxC,EA0mLA6c,GAAOoc,IAAMA,GACbpc,GAAOqc,MAAQA,GACfrc,GAAOsc,QAAUA,GACjBtc,GAAOuc,IAAMA,GACbvc,GAAO4oB,UAj3PP,SAAmB1lC,EAAO+S,GACxB,OAAO0b,GAAczuB,GAAS,GAAI+S,GAAU,GAAIiN,GAClD,EAg3PAlD,GAAO6oB,cA/1PP,SAAuB3lC,EAAO+S,GAC5B,OAAO0b,GAAczuB,GAAS,GAAI+S,GAAU,GAAIuY,GAClD,EA81PAxO,GAAOwc,QAAUA,GAGjBxc,GAAOsB,QAAUwgB,GACjB9hB,GAAO8oB,UAAY/G,GACnB/hB,GAAO+oB,OAASrI,GAChB1gB,GAAOgpB,WAAarI,GAGpB2C,GAAMtjB,GAAQA,IAKdA,GAAO6B,IAAMA,GACb7B,GAAO+iB,QAAUA,GACjB/iB,GAAOgiB,UAAYA,GACnBhiB,GAAOmiB,WAAaA,GACpBniB,GAAOvC,KAAOA,GACduC,GAAOipB,MAprFP,SAAerlB,EAAQC,EAAOC,GAa5B,OAZIA,IAAU/Y,IACZ+Y,EAAQD,EACRA,EAAQ9Y,GAEN+Y,IAAU/Y,IAEZ+Y,GADAA,EAAQ2T,GAAS3T,KACCA,EAAQA,EAAQ,GAEhCD,IAAU9Y,IAEZ8Y,GADAA,EAAQ4T,GAAS5T,KACCA,EAAQA,EAAQ,GAE7BhB,GAAU4U,GAAS7T,GAASC,EAAOC,EAC5C,EAuqFA9D,GAAO+a,MA7jLP,SAAe53B,GACb,OAAO4gB,GAAU5gB,EArzVI,EAszVvB,EA4jLA6c,GAAOkpB,UApgLP,SAAmB/lC,GACjB,OAAO4gB,GAAU5gB,EAAOu+B,EAC1B,EAmgLA1hB,GAAOmpB,cAr+KP,SAAuBhmC,EAAO8gB,GAE5B,OAAOF,GAAU5gB,EAAOu+B,EADxBzd,EAAkC,mBAAdA,EAA2BA,EAAalZ,EAE9D,EAm+KAiV,GAAOopB,UA7hLP,SAAmBjmC,EAAO8gB,GAExB,OAAOF,GAAU5gB,EAz1VI,EAw1VrB8gB,EAAkC,mBAAdA,EAA2BA,EAAalZ,EAE9D,EA2hLAiV,GAAOqpB,WA18KP,SAAoBhyB,EAAQzJ,GAC1B,OAAiB,MAAVA,GAAkBwY,GAAe/O,EAAQzJ,EAAQ8N,GAAK9N,GAC/D,EAy8KAoS,GAAOqU,OAASA,GAChBrU,GAAOspB,UA1xCP,SAAmBnmC,EAAO2zB,GACxB,OAAiB,MAAT3zB,GAAiBA,GAAUA,EAAS2zB,EAAe3zB,CAC7D,EAyxCA6c,GAAO+jB,OAASA,GAChB/jB,GAAOupB,SAz9EP,SAAkB3xB,EAAQvR,EAAQmjC,GAChC5xB,EAASyD,GAASzD,GAClBvR,EAAS0qB,GAAa1qB,GAEtB,IAAIsO,EAASiD,EAAOjD,OAKhBib,EAJJ4Z,EAAWA,IAAaz+B,EACpB4J,EACAkO,GAAUoV,GAAUuR,GAAW,EAAG70B,GAItC,OADA60B,GAAYnjC,EAAOsO,SACA,GAAKiD,EAAOC,MAAM2xB,EAAU5Z,IAAQvpB,CACzD,EA88EA2Z,GAAOgD,GAAKA,GACZhD,GAAOypB,OAj7EP,SAAgB7xB,GAEd,OADAA,EAASyD,GAASzD,KACA/J,EAAmBiL,KAAKlB,GACtCA,EAAOG,QAAQtK,EAAiBiL,IAChCd,CACN,EA66EAoI,GAAO0pB,aA55EP,SAAsB9xB,GAEpB,OADAA,EAASyD,GAASzD,KACAvJ,GAAgByK,KAAKlB,GACnCA,EAAOG,QAAQ3J,GAAc,QAC7BwJ,CACN,EAw5EAoI,GAAO2pB,MA57OP,SAAejzB,EAAYpB,EAAWue,GACpC,IAAIrf,EAAO0L,GAAQxJ,GAAcrB,GAAaiS,GAI9C,OAHIuM,GAASC,GAAepd,EAAYpB,EAAWue,KACjDve,EAAYvK,GAEPyJ,EAAKkC,EAAYmX,GAAYvY,EAAW,GACjD,EAu7OA0K,GAAO6c,KAAOA,GACd7c,GAAOmb,UAAYA,GACnBnb,GAAO4pB,QArxHP,SAAiBvyB,EAAQ/B,GACvB,OAAOmB,GAAYY,EAAQwW,GAAYvY,EAAW,GAAI6R,GACxD,EAoxHAnH,GAAO8c,SAAWA,GAClB9c,GAAOob,cAAgBA,GACvBpb,GAAO6pB,YAjvHP,SAAqBxyB,EAAQ/B,GAC3B,OAAOmB,GAAYY,EAAQwW,GAAYvY,EAAW,GAAI+R,GACxD,EAgvHArH,GAAOrC,MAAQA,GACfqC,GAAO9G,QAAUA,GACjB8G,GAAO+c,aAAeA,GACtB/c,GAAO8pB,MArtHP,SAAezyB,EAAQrC,GACrB,OAAiB,MAAVqC,EACHA,EACAyQ,GAAQzQ,EAAQwW,GAAY7Y,EAAU,GAAIgQ,GAChD,EAktHAhF,GAAO+pB,WAtrHP,SAAoB1yB,EAAQrC,GAC1B,OAAiB,MAAVqC,EACHA,EACA2Q,GAAa3Q,EAAQwW,GAAY7Y,EAAU,GAAIgQ,GACrD,EAmrHAhF,GAAOgqB,OArpHP,SAAgB3yB,EAAQrC,GACtB,OAAOqC,GAAU8P,GAAW9P,EAAQwW,GAAY7Y,EAAU,GAC5D,EAopHAgL,GAAOiqB,YAxnHP,SAAqB5yB,EAAQrC,GAC3B,OAAOqC,GAAUgQ,GAAgBhQ,EAAQwW,GAAY7Y,EAAU,GACjE,EAunHAgL,GAAO5Z,IAAMA,GACb4Z,GAAO0f,GAAKA,GACZ1f,GAAO2f,IAAMA,GACb3f,GAAO5H,IAzgHP,SAAaf,EAAQ+Q,GACnB,OAAiB,MAAV/Q,GAAkBkiB,GAAQliB,EAAQ+Q,EAAMa,GACjD,EAwgHAjJ,GAAO+M,MAAQA,GACf/M,GAAOqb,KAAOA,GACdrb,GAAOmM,SAAWA,GAClBnM,GAAOwG,SA5pOP,SAAkB9P,EAAYvT,EAAO2T,EAAW+c,GAC9Cnd,EAAagW,GAAYhW,GAAcA,EAAaT,GAAOS,GAC3DI,EAAaA,IAAc+c,EAASoE,GAAUnhB,GAAa,EAE3D,IAAInC,EAAS+B,EAAW/B,OAIxB,OAHImC,EAAY,IACdA,EAAYsH,GAAUzJ,EAASmC,EAAW,IAErCipB,GAASrpB,GACXI,GAAanC,GAAU+B,EAAWgY,QAAQvrB,EAAO2T,IAAc,IAC7DnC,GAAUgB,GAAYe,EAAYvT,EAAO2T,IAAc,CAChE,EAkpOAkJ,GAAO0O,QA9lSP,SAAiB5Z,EAAO3R,EAAO2T,GAC7B,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAqB,MAAb4B,EAAoB,EAAImhB,GAAUnhB,GAI9C,OAHI5B,EAAQ,IACVA,EAAQkJ,GAAUzJ,EAASO,EAAO,IAE7BS,GAAYb,EAAO3R,EAAO+R,EACnC,EAqlSA8K,GAAOkqB,QAlqFP,SAAiBtmB,EAAQqL,EAAOW,GAS9B,OARAX,EAAQqI,GAASrI,GACbW,IAAQ7kB,GACV6kB,EAAMX,EACNA,EAAQ,GAERW,EAAM0H,GAAS1H,GArsVnB,SAAqBhM,EAAQqL,EAAOW,GAClC,OAAOhM,GAAUtF,GAAU2Q,EAAOW,IAAQhM,EAASxF,GAAU6Q,EAAOW,EACtE,CAssVSua,CADPvmB,EAAS6T,GAAS7T,GACSqL,EAAOW,EACpC,EAypFA5P,GAAOohB,OAASA,GAChBphB,GAAOmC,YAAcA,GACrBnC,GAAOE,QAAUA,GACjBF,GAAOpM,cAAgBA,GACvBoM,GAAO0M,YAAcA,GACrB1M,GAAOqN,kBAAoBA,GAC3BrN,GAAOoqB,UAtwKP,SAAmBjnC,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB8c,GAAa9c,IAAUulB,GAAWvlB,IAAUyI,CACjD,EAowKAoU,GAAOjC,SAAWA,GAClBiC,GAAOlM,OAASA,GAChBkM,GAAOqqB,UA7sKP,SAAmBlnC,GACjB,OAAO8c,GAAa9c,IAA6B,IAAnBA,EAAM8P,WAAmBqa,GAAcnqB,EACvE,EA4sKA6c,GAAOsqB,QAzqKP,SAAiBnnC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIupB,GAAYvpB,KACX+c,GAAQ/c,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMsZ,QAC1DsB,GAAS5a,IAAUmR,GAAanR,IAAUgf,GAAYhf,IAC1D,OAAQA,EAAMwR,OAEhB,IAAI8P,EAAMC,GAAOvhB,GACjB,GAAIshB,GAAOxY,GAAUwY,GAAOnY,EAC1B,OAAQnJ,EAAM8V,KAEhB,GAAIsT,GAAYppB,GACd,OAAQmpB,GAASnpB,GAAOwR,OAE1B,IAAK,IAAIiC,KAAOzT,EACd,GAAImY,GAAe1G,KAAKzR,EAAOyT,GAC7B,OAAO,EAGX,OAAO,CACT,EAopKAoJ,GAAOuqB,QAtnKP,SAAiBpnC,EAAO6lB,GACtB,OAAOe,GAAY5mB,EAAO6lB,EAC5B,EAqnKAhJ,GAAOwqB,YAnlKP,SAAqBrnC,EAAO6lB,EAAO/E,GAEjC,IAAIxO,GADJwO,EAAkC,mBAAdA,EAA2BA,EAAalZ,GAClCkZ,EAAW9gB,EAAO6lB,GAASje,EACrD,OAAO0K,IAAW1K,EAAYgf,GAAY5mB,EAAO6lB,EAAOje,EAAWkZ,KAAgBxO,CACrF,EAglKAuK,GAAO4f,QAAUA,GACjB5f,GAAO/B,SA1hKP,SAAkB9a,GAChB,MAAuB,iBAATA,GAAqB6a,GAAe7a,EACpD,EAyhKA6c,GAAOkI,WAAaA,GACpBlI,GAAO6f,UAAYA,GACnB7f,GAAOyZ,SAAWA,GAClBzZ,GAAOhM,MAAQA,GACfgM,GAAOyqB,QA11JP,SAAiBpzB,EAAQzJ,GACvB,OAAOyJ,IAAWzJ,GAAUge,GAAYvU,EAAQzJ,EAAQ+e,GAAa/e,GACvE,EAy1JAoS,GAAO0qB,YAvzJP,SAAqBrzB,EAAQzJ,EAAQqW,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAalZ,EACrD6gB,GAAYvU,EAAQzJ,EAAQ+e,GAAa/e,GAASqW,EAC3D,EAqzJAjE,GAAO2qB,MAvxJP,SAAexnC,GAIb,OAAO28B,GAAS38B,IAAUA,IAAUA,CACtC,EAmxJA6c,GAAO4qB,SAvvJP,SAAkBznC,GAChB,GAAI02B,GAAW12B,GACb,MAAM,IAAIwX,GAtsXM,mEAwsXlB,OAAOsR,GAAa9oB,EACtB,EAmvJA6c,GAAO6qB,MAxsJP,SAAe1nC,GACb,OAAgB,MAATA,CACT,EAusJA6c,GAAO8qB,OAjuJP,SAAgB3nC,GACd,OAAiB,OAAVA,CACT,EAguJA6c,GAAO8f,SAAWA,GAClB9f,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOsN,cAAgBA,GACvBtN,GAAO9L,SAAWA,GAClB8L,GAAO+qB,cArlJP,SAAuB5nC,GACrB,OAAO08B,GAAU18B,IAAUA,IAAS,kBAAqBA,GAASmI,CACpE,EAolJA0U,GAAO5L,MAAQA,GACf4L,GAAO+f,SAAWA,GAClB/f,GAAOwH,SAAWA,GAClBxH,GAAO1L,aAAeA,GACtB0L,GAAOgrB,YAn/IP,SAAqB7nC,GACnB,OAAOA,IAAU4H,CACnB,EAk/IAiV,GAAOirB,UA/9IP,SAAmB9nC,GACjB,OAAO8c,GAAa9c,IAAUuhB,GAAOvhB,IAAUsJ,CACjD,EA89IAuT,GAAOkrB,UA38IP,SAAmB/nC,GACjB,OAAO8c,GAAa9c,IAn6XP,oBAm6XiBulB,GAAWvlB,EAC3C,EA08IA6c,GAAO1O,KAz/RP,SAAcwD,EAAOyyB,GACnB,OAAgB,MAATzyB,EAAgB,GAAKoJ,GAAWtJ,KAAKE,EAAOyyB,EACrD,EAw/RAvnB,GAAOqiB,UAAYA,GACnBriB,GAAO6J,KAAOA,GACd7J,GAAOmrB,YAh9RP,SAAqBr2B,EAAO3R,EAAO2T,GACjC,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAQP,EAKZ,OAJImC,IAAc/L,IAEhBmK,GADAA,EAAQ+iB,GAAUnhB,IACF,EAAIsH,GAAUzJ,EAASO,EAAO,GAAKoJ,GAAUpJ,EAAOP,EAAS,IAExExR,GAAUA,EArvMrB,SAA2B2R,EAAO3R,EAAO2T,GAEvC,IADA,IAAI5B,EAAQ4B,EAAY,EACjB5B,KACL,GAAIJ,EAAMI,KAAW/R,EACnB,OAAO+R,EAGX,OAAOA,CACT,CA8uMQk2B,CAAkBt2B,EAAO3R,EAAO+R,GAChC2B,GAAc/B,EAAOmC,GAAW/B,GAAO,EAC7C,EAo8RA8K,GAAOsiB,UAAYA,GACnBtiB,GAAOuiB,WAAaA,GACpBviB,GAAOggB,GAAKA,GACZhgB,GAAOigB,IAAMA,GACbjgB,GAAO3B,IAhfP,SAAavJ,GACX,OAAQA,GAASA,EAAMH,OACnB4S,GAAazS,EAAOqX,GAAUpD,IAC9Bhe,CACN,EA6eAiV,GAAOqrB,MApdP,SAAev2B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnB4S,GAAazS,EAAO+Y,GAAY7Y,EAAU,GAAI+T,IAC9Che,CACN,EAidAiV,GAAOsrB,KAjcP,SAAcx2B,GACZ,OAAOqC,GAASrC,EAAOqX,GACzB,EAgcAnM,GAAOurB,OAvaP,SAAgBz2B,EAAOE,GACrB,OAAOmC,GAASrC,EAAO+Y,GAAY7Y,EAAU,GAC/C,EAsaAgL,GAAOzB,IAlZP,SAAazJ,GACX,OAAQA,GAASA,EAAMH,OACnB4S,GAAazS,EAAOqX,GAAUK,IAC9BzhB,CACN,EA+YAiV,GAAOwrB,MAtXP,SAAe12B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnB4S,GAAazS,EAAO+Y,GAAY7Y,EAAU,GAAIwX,IAC9CzhB,CACN,EAmXAiV,GAAOsZ,UAAYA,GACnBtZ,GAAO8Z,UAAYA,GACnB9Z,GAAOyrB,WAztBP,WACE,MAAO,CAAC,CACV,EAwtBAzrB,GAAO0rB,WAzsBP,WACE,MAAO,EACT,EAwsBA1rB,GAAO2rB,SAzrBP,WACE,OAAO,CACT,EAwrBA3rB,GAAOkkB,SAAWA,GAClBlkB,GAAO4rB,IA77RP,SAAa92B,EAAO4C,GAClB,OAAQ5C,GAASA,EAAMH,OAAU8Y,GAAQ3Y,EAAOmjB,GAAUvgB,IAAM3M,CAClE,EA47RAiV,GAAO6rB,WAliCP,WAIE,OAHIh5B,GAAKuH,IAAMpV,OACb6N,GAAKuH,EAAI0B,IAEJ9W,IACT,EA8hCAgb,GAAOmY,KAAOA,GACdnY,GAAO3C,IAAMA,GACb2C,GAAO8rB,IAj5EP,SAAal0B,EAAQjD,EAAQuiB,GAC3Btf,EAASyD,GAASzD,GAGlB,IAAIm0B,GAFJp3B,EAASsjB,GAAUtjB,IAEM+E,GAAW9B,GAAU,EAC9C,IAAKjD,GAAUo3B,GAAap3B,EAC1B,OAAOiD,EAET,IAAIsY,GAAOvb,EAASo3B,GAAa,EACjC,OACE9U,GAAcvZ,GAAYwS,GAAMgH,GAChCtf,EACAqf,GAAczZ,GAAW0S,GAAMgH,EAEnC,EAo4EAlX,GAAOgsB,OA32EP,SAAgBp0B,EAAQjD,EAAQuiB,GAC9Btf,EAASyD,GAASzD,GAGlB,IAAIm0B,GAFJp3B,EAASsjB,GAAUtjB,IAEM+E,GAAW9B,GAAU,EAC9C,OAAQjD,GAAUo3B,EAAYp3B,EACzBiD,EAASqf,GAActiB,EAASo3B,EAAW7U,GAC5Ctf,CACN,EAo2EAoI,GAAOisB,SA30EP,SAAkBr0B,EAAQjD,EAAQuiB,GAChCtf,EAASyD,GAASzD,GAGlB,IAAIm0B,GAFJp3B,EAASsjB,GAAUtjB,IAEM+E,GAAW9B,GAAU,EAC9C,OAAQjD,GAAUo3B,EAAYp3B,EACzBsiB,GAActiB,EAASo3B,EAAW7U,GAAStf,EAC5CA,CACN,EAo0EAoI,GAAOzN,SA1yEP,SAAkBqF,EAAQs0B,EAAOrY,GAM/B,OALIA,GAAkB,MAATqY,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJztB,GAAepD,GAASzD,GAAQG,QAAQzJ,GAAa,IAAK49B,GAAS,EAC5E,EAoyEAlsB,GAAOrB,OA1rFP,SAAgBkF,EAAOC,EAAOqoB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBrY,GAAejQ,EAAOC,EAAOqoB,KAC3EroB,EAAQqoB,EAAWphC,GAEjBohC,IAAaphC,IACK,kBAAT+Y,GACTqoB,EAAWroB,EACXA,EAAQ/Y,GAEe,kBAAT8Y,IACdsoB,EAAWtoB,EACXA,EAAQ9Y,IAGR8Y,IAAU9Y,GAAa+Y,IAAU/Y,GACnC8Y,EAAQ,EACRC,EAAQ,IAGRD,EAAQyT,GAASzT,GACbC,IAAU/Y,GACZ+Y,EAAQD,EACRA,EAAQ,GAERC,EAAQwT,GAASxT,IAGjBD,EAAQC,EAAO,CACjB,IAAIsoB,EAAOvoB,EACXA,EAAQC,EACRA,EAAQsoB,CACV,CACA,GAAID,GAAYtoB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI4W,EAAOhc,KACX,OAAOJ,GAAUuF,EAAS6W,GAAQ5W,EAAQD,EAAQzR,GAAe,QAAUsoB,EAAO,IAAI/lB,OAAS,KAAOmP,EACxG,CACA,OAAOrB,GAAWoB,EAAOC,EAC3B,EAspFA9D,GAAOqsB,OA5+NP,SAAgB31B,EAAY1B,EAAUC,GACpC,IAAIT,EAAO0L,GAAQxJ,GAAcP,GAAcoB,GAC3CnB,EAAYme,UAAU5f,OAAS,EAEnC,OAAOH,EAAKkC,EAAYmX,GAAY7Y,EAAU,GAAIC,EAAamB,EAAWkN,GAC5E,EAw+NAtD,GAAOssB,YAh9NP,SAAqB51B,EAAY1B,EAAUC,GACzC,IAAIT,EAAO0L,GAAQxJ,GAAcL,GAAmBkB,GAChDnB,EAAYme,UAAU5f,OAAS,EAEnC,OAAOH,EAAKkC,EAAYmX,GAAY7Y,EAAU,GAAIC,EAAamB,EAAWgR,GAC5E,EA48NApH,GAAOusB,OA/wEP,SAAgB30B,EAAQF,EAAGmc,GAMzB,OAJEnc,GADGmc,EAAQC,GAAelc,EAAQF,EAAGmc,GAASnc,IAAM3M,GAChD,EAEAktB,GAAUvgB,GAETqX,GAAW1T,GAASzD,GAASF,EACtC,EAywEAsI,GAAOjI,QApvEP,WACE,IAAIrD,EAAO6f,UACP3c,EAASyD,GAAS3G,EAAK,IAE3B,OAAOA,EAAKC,OAAS,EAAIiD,EAASA,EAAOG,QAAQrD,EAAK,GAAIA,EAAK,GACjE,EAgvEAsL,GAAOvK,OAtoGP,SAAgB4B,EAAQ+Q,EAAM0O,GAG5B,IAAI5hB,GAAS,EACTP,GAHJyT,EAAOC,GAASD,EAAM/Q,IAGJ1C,OAOlB,IAJKA,IACHA,EAAS,EACT0C,EAAStM,KAEFmK,EAAQP,GAAQ,CACvB,IAAIxR,EAAkB,MAAVkU,EAAiBtM,EAAYsM,EAAOiR,GAAMF,EAAKlT,KACvD/R,IAAU4H,IACZmK,EAAQP,EACRxR,EAAQ2zB,GAEVzf,EAAS6Q,GAAW/kB,GAASA,EAAMyR,KAAKyC,GAAUlU,CACpD,CACA,OAAOkU,CACT,EAmnGA2I,GAAOqkB,MAAQA,GACfrkB,GAAO3F,aAAeA,EACtB2F,GAAOwsB,OA15NP,SAAgB91B,GAEd,OADWwJ,GAAQxJ,GAAc8L,GAAc4M,IACnC1Y,EACd,EAw5NAsJ,GAAO/G,KA/0NP,SAAcvC,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIgW,GAAYhW,GACd,OAAOqpB,GAASrpB,GAAcgD,GAAWhD,GAAcA,EAAW/B,OAEpE,IAAI8P,EAAMC,GAAOhO,GACjB,OAAI+N,GAAOxY,GAAUwY,GAAOnY,EACnBoK,EAAWuC,KAEbqT,GAAS5V,GAAY/B,MAC9B,EAo0NAqL,GAAOrZ,UAAYA,GACnBqZ,GAAOysB,KA/xNP,SAAc/1B,EAAYpB,EAAWue,GACnC,IAAIrf,EAAO0L,GAAQxJ,GAAcJ,GAAYuZ,GAI7C,OAHIgE,GAASC,GAAepd,EAAYpB,EAAWue,KACjDve,EAAYvK,GAEPyJ,EAAKkC,EAAYmX,GAAYvY,EAAW,GACjD,EA0xNA0K,GAAO0sB,YAhsRP,SAAqB53B,EAAO3R,GAC1B,OAAO2sB,GAAgBhb,EAAO3R,EAChC,EA+rRA6c,GAAO2sB,cApqRP,SAAuB73B,EAAO3R,EAAO6R,GACnC,OAAOmb,GAAkBrb,EAAO3R,EAAO0qB,GAAY7Y,EAAU,GAC/D,EAmqRAgL,GAAO4sB,cAjpRP,SAAuB93B,EAAO3R,GAC5B,IAAIwR,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,GAAIA,EAAQ,CACV,IAAIO,EAAQ4a,GAAgBhb,EAAO3R,GACnC,GAAI+R,EAAQP,GAAUqO,GAAGlO,EAAMI,GAAQ/R,GACrC,OAAO+R,CAEX,CACA,OAAQ,CACV,EAyoRA8K,GAAO6sB,gBArnRP,SAAyB/3B,EAAO3R,GAC9B,OAAO2sB,GAAgBhb,EAAO3R,GAAO,EACvC,EAonRA6c,GAAO8sB,kBAzlRP,SAA2Bh4B,EAAO3R,EAAO6R,GACvC,OAAOmb,GAAkBrb,EAAO3R,EAAO0qB,GAAY7Y,EAAU,IAAI,EACnE,EAwlRAgL,GAAO+sB,kBAtkRP,SAA2Bj4B,EAAO3R,GAEhC,GADsB,MAAT2R,GAAoBA,EAAMH,OAC3B,CACV,IAAIO,EAAQ4a,GAAgBhb,EAAO3R,GAAO,GAAQ,EAClD,GAAI6f,GAAGlO,EAAMI,GAAQ/R,GACnB,OAAO+R,CAEX,CACA,OAAQ,CACV,EA8jRA8K,GAAOwiB,UAAYA,GACnBxiB,GAAOgtB,WA3oEP,SAAoBp1B,EAAQvR,EAAQmjC,GAOlC,OANA5xB,EAASyD,GAASzD,GAClB4xB,EAAuB,MAAZA,EACP,EACA3mB,GAAUoV,GAAUuR,GAAW,EAAG5xB,EAAOjD,QAE7CtO,EAAS0qB,GAAa1qB,GACfuR,EAAOC,MAAM2xB,EAAUA,EAAWnjC,EAAOsO,SAAWtO,CAC7D,EAooEA2Z,GAAOskB,SAAWA,GAClBtkB,GAAOitB,IAzUP,SAAan4B,GACX,OAAQA,GAASA,EAAMH,OACnByC,GAAQtC,EAAOqX,IACf,CACN,EAsUAnM,GAAOktB,MA7SP,SAAep4B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnByC,GAAQtC,EAAO+Y,GAAY7Y,EAAU,IACrC,CACN,EA0SAgL,GAAOmtB,SA7hEP,SAAkBv1B,EAAQpT,EAASqvB,GAIjC,IAAI7tB,EAAWga,GAAO6G,iBAElBgN,GAASC,GAAelc,EAAQpT,EAASqvB,KAC3CrvB,EAAUuG,GAEZ6M,EAASyD,GAASzD,GAClBpT,EAAUm8B,GAAa,CAAC,EAAGn8B,EAASwB,EAAU8yB,IAE9C,IAIIsU,EACAC,EALAC,EAAU3M,GAAa,CAAC,EAAGn8B,EAAQ8oC,QAAStnC,EAASsnC,QAASxU,IAC9DyU,EAAc7xB,GAAK4xB,GACnBE,EAAgBv1B,GAAWq1B,EAASC,GAIpCr4B,EAAQ,EACRu4B,EAAcjpC,EAAQipC,aAAen+B,GACrC1B,EAAS,WAGT8/B,EAAe//B,IAChBnJ,EAAQilC,QAAUn6B,IAAW1B,OAAS,IACvC6/B,EAAY7/B,OAAS,KACpB6/B,IAAgBz/B,EAAgBc,GAAeQ,IAAW1B,OAAS,KACnEpJ,EAAQmpC,UAAYr+B,IAAW1B,OAAS,KACzC,KAMEggC,EAAY,kBACbtyB,GAAe1G,KAAKpQ,EAAS,cACzBA,EAAQopC,UAAY,IAAI71B,QAAQ,MAAO,KACvC,6BAA+B/F,GAAmB,KACnD,KAEN4F,EAAOG,QAAQ21B,GAAc,SAAS5zB,EAAO+zB,EAAaC,EAAkBC,EAAiBC,EAAe93B,GAsB1G,OArBA43B,IAAqBA,EAAmBC,GAGxCngC,GAAUgK,EAAOC,MAAM3C,EAAOgB,GAAQ6B,QAAQxI,GAAmBoJ,IAG7Dk1B,IACFT,GAAa,EACbx/B,GAAU,YAAcigC,EAAc,UAEpCG,IACFX,GAAe,EACfz/B,GAAU,OAASogC,EAAgB,eAEjCF,IACFlgC,GAAU,iBAAmBkgC,EAAmB,+BAElD54B,EAAQgB,EAAS4D,EAAMnF,OAIhBmF,CACT,IAEAlM,GAAU,OAIV,IAAIqgC,EAAW3yB,GAAe1G,KAAKpQ,EAAS,aAAeA,EAAQypC,SACnE,GAAKA,GAKA,GAAIr/B,GAA2BkK,KAAKm1B,GACvC,MAAM,IAAItzB,GA3idmB,2DAsid7B/M,EAAS,iBAAmBA,EAAS,QASvCA,GAAUy/B,EAAez/B,EAAOmK,QAAQ1K,EAAsB,IAAMO,GACjEmK,QAAQzK,EAAqB,MAC7ByK,QAAQxK,EAAuB,OAGlCK,EAAS,aAAeqgC,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJz/B,EACA,gBAEF,IAAI6H,EAASstB,IAAQ,WACnB,OAAOjwB,GAASy6B,EAAaK,EAAY,UAAYhgC,GAClD2G,MAAMxJ,EAAWyiC,EACtB,IAKA,GADA/3B,EAAO7H,OAASA,EACZgyB,GAAQnqB,GACV,MAAMA,EAER,OAAOA,CACT,EA26DAuK,GAAOkuB,MApsBP,SAAex2B,EAAG1C,GAEhB,IADA0C,EAAIugB,GAAUvgB,IACN,GAAKA,EAAIpM,EACf,MAAO,GAET,IAAI4J,EAAQ1J,EACRmJ,EAAS2J,GAAU5G,EAAGlM,GAE1BwJ,EAAW6Y,GAAY7Y,GACvB0C,GAAKlM,EAGL,IADA,IAAIiK,EAASgC,GAAU9C,EAAQK,KACtBE,EAAQwC,GACf1C,EAASE,GAEX,OAAOO,CACT,EAqrBAuK,GAAOsX,SAAWA,GAClBtX,GAAOiY,UAAYA,GACnBjY,GAAOugB,SAAWA,GAClBvgB,GAAOmuB,QAx5DP,SAAiBhrC,GACf,OAAOkY,GAASlY,GAAO++B,aACzB,EAu5DAliB,GAAOyX,SAAWA,GAClBzX,GAAOouB,cApuIP,SAAuBjrC,GACrB,OAAOA,EACH0f,GAAUoV,GAAU90B,IAAQ,iBAAmBmI,GACpC,IAAVnI,EAAcA,EAAQ,CAC7B,EAiuIA6c,GAAO3E,SAAWA,GAClB2E,GAAOquB,QAn4DP,SAAiBlrC,GACf,OAAOkY,GAASlY,GAAOu/B,aACzB,EAk4DA1iB,GAAOsuB,KA12DP,SAAc12B,EAAQsf,EAAOrD,GAE3B,IADAjc,EAASyD,GAASzD,MACHic,GAASqD,IAAUnsB,GAChC,OAAO4M,GAASC,GAElB,IAAKA,KAAYsf,EAAQnG,GAAamG,IACpC,OAAOtf,EAET,IAAIU,EAAauB,GAAcjC,GAC3BW,EAAasB,GAAcqd,GAI/B,OAAOhF,GAAU5Z,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETjH,KAAK,GAChD,EA61DA0O,GAAOuuB,QAx0DP,SAAiB32B,EAAQsf,EAAOrD,GAE9B,IADAjc,EAASyD,GAASzD,MACHic,GAASqD,IAAUnsB,GAChC,OAAO6M,EAAOC,MAAM,EAAGC,GAAgBF,GAAU,GAEnD,IAAKA,KAAYsf,EAAQnG,GAAamG,IACpC,OAAOtf,EAET,IAAIU,EAAauB,GAAcjC,GAG/B,OAAOsa,GAAU5Z,EAAY,EAFnBE,GAAcF,EAAYuB,GAAcqd,IAAU,GAEvB5lB,KAAK,GAC5C,EA6zDA0O,GAAOwuB,UAxyDP,SAAmB52B,EAAQsf,EAAOrD,GAEhC,IADAjc,EAASyD,GAASzD,MACHic,GAASqD,IAAUnsB,GAChC,OAAO6M,EAAOG,QAAQzJ,GAAa,IAErC,IAAKsJ,KAAYsf,EAAQnG,GAAamG,IACpC,OAAOtf,EAET,IAAIU,EAAauB,GAAcjC,GAG/B,OAAOsa,GAAU5Z,EAFLD,GAAgBC,EAAYuB,GAAcqd,KAElB5lB,KAAK,GAC3C,EA6xDA0O,GAAOyuB,SAtvDP,SAAkB72B,EAAQpT,GACxB,IAAImQ,EAnvdmB,GAovdnB+5B,EAnvdqB,MAqvdzB,GAAIluB,GAAShc,GAAU,CACrB,IAAI+iC,EAAY,cAAe/iC,EAAUA,EAAQ+iC,UAAYA,EAC7D5yB,EAAS,WAAYnQ,EAAUyzB,GAAUzzB,EAAQmQ,QAAUA,EAC3D+5B,EAAW,aAAclqC,EAAUusB,GAAavsB,EAAQkqC,UAAYA,CACtE,CAGA,IAAI3C,GAFJn0B,EAASyD,GAASzD,IAEKjD,OACvB,GAAIkE,GAAWjB,GAAS,CACtB,IAAIU,EAAauB,GAAcjC,GAC/Bm0B,EAAYzzB,EAAW3D,MACzB,CACA,GAAIA,GAAUo3B,EACZ,OAAOn0B,EAET,IAAIgY,EAAMjb,EAAS+E,GAAWg1B,GAC9B,GAAI9e,EAAM,EACR,OAAO8e,EAET,IAAIj5B,EAAS6C,EACT4Z,GAAU5Z,EAAY,EAAGsX,GAAKte,KAAK,IACnCsG,EAAOC,MAAM,EAAG+X,GAEpB,GAAI2X,IAAcx8B,EAChB,OAAO0K,EAASi5B,EAKlB,GAHIp2B,IACFsX,GAAQna,EAAOd,OAASib,GAEtB1b,GAASqzB,IACX,GAAI3vB,EAAOC,MAAM+X,GAAK+e,OAAOpH,GAAY,CACvC,IAAIztB,EACA80B,EAAYn5B,EAMhB,IAJK8xB,EAAUsH,SACbtH,EAAY55B,GAAO45B,EAAU35B,OAAQyN,GAAStM,GAAQ0M,KAAK8rB,IAAc,MAE3EA,EAAU5tB,UAAY,EACdG,EAAQytB,EAAU9rB,KAAKmzB,IAC7B,IAAIE,EAASh1B,EAAM5E,MAErBO,EAASA,EAAOoC,MAAM,EAAGi3B,IAAW/jC,EAAY6kB,EAAMkf,EACxD,OACK,GAAIl3B,EAAO8W,QAAQqC,GAAawW,GAAY3X,IAAQA,EAAK,CAC9D,IAAI1a,EAAQO,EAAO01B,YAAY5D,GAC3BryB,GAAS,IACXO,EAASA,EAAOoC,MAAM,EAAG3C,GAE7B,CACA,OAAOO,EAASi5B,CAClB,EAisDA1uB,GAAO+uB,SA5qDP,SAAkBn3B,GAEhB,OADAA,EAASyD,GAASzD,KACAlK,EAAiBoL,KAAKlB,GACpCA,EAAOG,QAAQvK,EAAe2M,IAC9BvC,CACN,EAwqDAoI,GAAOgvB,SAvpBP,SAAkBC,GAChB,IAAInkC,IAAOyQ,GACX,OAAOF,GAAS4zB,GAAUnkC,CAC5B,EAqpBAkV,GAAOyiB,UAAYA,GACnBziB,GAAOoiB,WAAaA,GAGpBpiB,GAAOkvB,KAAOh2B,GACd8G,GAAOmvB,UAAYpS,GACnB/c,GAAOovB,MAAQ/T,GAEfiI,GAAMtjB,IACApS,GAAS,CAAC,EACduZ,GAAWnH,IAAQ,SAASxL,EAAMyf,GAC3B3Y,GAAe1G,KAAKoL,GAAOhF,UAAWiZ,KACzCrmB,GAAOqmB,GAAczf,EAEzB,IACO5G,IACH,CAAE,OAAS,IAWjBoS,GAAOqvB,QA/ihBK,UAkjhBZl6B,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS8e,GACxFjU,GAAOiU,GAAY1a,YAAcyG,EACnC,IAGA7K,GAAU,CAAC,OAAQ,SAAS,SAAS8e,EAAY/e,GAC/CiL,GAAYnF,UAAUiZ,GAAc,SAASvc,GAC3CA,EAAIA,IAAM3M,EAAY,EAAIqT,GAAU6Z,GAAUvgB,GAAI,GAElD,IAAIjC,EAAUzQ,KAAKic,eAAiB/L,EAChC,IAAIiL,GAAYnb,MAChBA,KAAK+1B,QAUT,OARItlB,EAAOwL,aACTxL,EAAO0L,cAAgB7C,GAAU5G,EAAGjC,EAAO0L,eAE3C1L,EAAO2L,UAAUxW,KAAK,CACpB,KAAQ0T,GAAU5G,EAAGlM,GACrB,KAAQyoB,GAAcxe,EAAOuL,QAAU,EAAI,QAAU,MAGlDvL,CACT,EAEA0K,GAAYnF,UAAUiZ,EAAa,SAAW,SAASvc,GACrD,OAAO1S,KAAK6Z,UAAUoV,GAAYvc,GAAGmH,SACvC,CACF,IAGA1J,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS8e,EAAY/e,GAC7D,IAAI9R,EAAO8R,EAAQ,EACfo6B,EAjihBe,GAiihBJlsC,GA/hhBG,GA+hhByBA,EAE3C+c,GAAYnF,UAAUiZ,GAAc,SAASjf,GAC3C,IAAIS,EAASzQ,KAAK+1B,QAMlB,OALAtlB,EAAOyL,cAActW,KAAK,CACxB,SAAYijB,GAAY7Y,EAAU,GAClC,KAAQ5R,IAEVqS,EAAOwL,aAAexL,EAAOwL,cAAgBquB,EACtC75B,CACT,CACF,IAGAN,GAAU,CAAC,OAAQ,SAAS,SAAS8e,EAAY/e,GAC/C,IAAIq6B,EAAW,QAAUr6B,EAAQ,QAAU,IAE3CiL,GAAYnF,UAAUiZ,GAAc,WAClC,OAAOjvB,KAAKuqC,GAAU,GAAGpsC,QAAQ,EACnC,CACF,IAGAgS,GAAU,CAAC,UAAW,SAAS,SAAS8e,EAAY/e,GAClD,IAAIs6B,EAAW,QAAUt6B,EAAQ,GAAK,SAEtCiL,GAAYnF,UAAUiZ,GAAc,WAClC,OAAOjvB,KAAKic,aAAe,IAAId,GAAYnb,MAAQA,KAAKwqC,GAAU,EACpE,CACF,IAEArvB,GAAYnF,UAAU4pB,QAAU,WAC9B,OAAO5/B,KAAKygC,OAAOtZ,GACrB,EAEAhM,GAAYnF,UAAU6hB,KAAO,SAASvnB,GACpC,OAAOtQ,KAAKygC,OAAOnwB,GAAW+lB,MAChC,EAEAlb,GAAYnF,UAAU8hB,SAAW,SAASxnB,GACxC,OAAOtQ,KAAK6Z,UAAUge,KAAKvnB,EAC7B,EAEA6K,GAAYnF,UAAUiiB,UAAYjO,IAAS,SAAS5G,EAAM1T,GACxD,MAAmB,mBAAR0T,EACF,IAAIjI,GAAYnb,MAElBA,KAAKgU,KAAI,SAAS7V,GACvB,OAAOwmB,GAAWxmB,EAAOilB,EAAM1T,EACjC,GACF,IAEAyL,GAAYnF,UAAU+rB,OAAS,SAASzxB,GACtC,OAAOtQ,KAAKygC,OAAOtG,GAAOtR,GAAYvY,IACxC,EAEA6K,GAAYnF,UAAUnD,MAAQ,SAASoX,EAAOW,GAC5CX,EAAQgJ,GAAUhJ,GAElB,IAAIxZ,EAASzQ,KACb,OAAIyQ,EAAOwL,eAAiBgO,EAAQ,GAAKW,EAAM,GACtC,IAAIzP,GAAY1K,IAErBwZ,EAAQ,EACVxZ,EAASA,EAAOmyB,WAAW3Y,GAClBA,IACTxZ,EAASA,EAAO0vB,KAAKlW,IAEnBW,IAAQ7kB,IAEV0K,GADAma,EAAMqI,GAAUrI,IACD,EAAIna,EAAO2vB,WAAWxV,GAAOna,EAAOkyB,KAAK/X,EAAMX,IAEzDxZ,EACT,EAEA0K,GAAYnF,UAAU6sB,eAAiB,SAASvyB,GAC9C,OAAOtQ,KAAK6Z,UAAUipB,UAAUxyB,GAAWuJ,SAC7C,EAEAsB,GAAYnF,UAAUklB,QAAU,WAC9B,OAAOl7B,KAAK2iC,KAAKn8B,EACnB,EAGA2b,GAAWhH,GAAYnF,WAAW,SAASxG,EAAMyf,GAC/C,IAAIwb,EAAgB,qCAAqC32B,KAAKmb,GAC1Dyb,EAAU,kBAAkB52B,KAAKmb,GACjC0b,EAAa3vB,GAAO0vB,EAAW,QAAwB,QAAdzb,EAAuB,QAAU,IAAOA,GACjF2b,EAAeF,GAAW,QAAQ52B,KAAKmb,GAEtC0b,IAGL3vB,GAAOhF,UAAUiZ,GAAc,WAC7B,IAAI9wB,EAAQ6B,KAAK2b,YACbjM,EAAOg7B,EAAU,CAAC,GAAKnb,UACvBsb,EAAS1sC,aAAiBgd,GAC1BnL,EAAWN,EAAK,GAChBo7B,EAAUD,GAAU3vB,GAAQ/c,GAE5Bu5B,EAAc,SAASv5B,GACzB,IAAIsS,EAASk6B,EAAWp7B,MAAMyL,GAAQhK,GAAU,CAAC7S,GAAQuR,IACzD,OAAQg7B,GAAWhvB,EAAYjL,EAAO,GAAKA,CAC7C,EAEIq6B,GAAWL,GAAoC,mBAAZz6B,GAA6C,GAAnBA,EAASL,SAExEk7B,EAASC,GAAU,GAErB,IAAIpvB,EAAW1b,KAAK6b,UAChBkvB,IAAa/qC,KAAK4b,YAAYjM,OAC9Bq7B,EAAcJ,IAAiBlvB,EAC/BuvB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5B3sC,EAAQ8sC,EAAW9sC,EAAQ,IAAIgd,GAAYnb,MAC3C,IAAIyQ,EAASjB,EAAKD,MAAMpR,EAAOuR,GAE/B,OADAe,EAAOmL,YAAYhW,KAAK,CAAE,KAAQmqB,GAAM,KAAQ,CAAC2H,GAAc,QAAW3xB,IACnE,IAAIqV,GAAc3K,EAAQiL,EACnC,CACA,OAAIsvB,GAAeC,EACVz7B,EAAKD,MAAMvP,KAAM0P,IAE1Be,EAASzQ,KAAK+vB,KAAK2H,GACZsT,EAAeN,EAAUj6B,EAAOtS,QAAQ,GAAKsS,EAAOtS,QAAWsS,EACxE,EACF,IAGAN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS8e,GACxE,IAAIzf,EAAOuG,GAAWkZ,GAClBic,EAAY,0BAA0Bp3B,KAAKmb,GAAc,MAAQ,OACjE2b,EAAe,kBAAkB92B,KAAKmb,GAE1CjU,GAAOhF,UAAUiZ,GAAc,WAC7B,IAAIvf,EAAO6f,UACX,GAAIqb,IAAiB5qC,KAAK6b,UAAW,CACnC,IAAI1d,EAAQ6B,KAAK7B,QACjB,OAAOqR,EAAKD,MAAM2L,GAAQ/c,GAASA,EAAQ,GAAIuR,EACjD,CACA,OAAO1P,KAAKkrC,IAAW,SAAS/sC,GAC9B,OAAOqR,EAAKD,MAAM2L,GAAQ/c,GAASA,EAAQ,GAAIuR,EACjD,GACF,CACF,IAGAyS,GAAWhH,GAAYnF,WAAW,SAASxG,EAAMyf,GAC/C,IAAI0b,EAAa3vB,GAAOiU,GACxB,GAAI0b,EAAY,CACd,IAAI/4B,EAAM+4B,EAAW5sC,KAAO,GACvBuY,GAAe1G,KAAKyK,GAAWzI,KAClCyI,GAAUzI,GAAO,IAEnByI,GAAUzI,GAAKhM,KAAK,CAAE,KAAQqpB,EAAY,KAAQ0b,GACpD,CACF,IAEAtwB,GAAUiW,GAAavqB,EAlthBA,GAkthB+BhI,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQgI,IAIVoV,GAAYnF,UAAU+f,MAh9dtB,WACE,IAAItlB,EAAS,IAAI0K,GAAYnb,KAAK2b,aAOlC,OANAlL,EAAOmL,YAAcgC,GAAU5d,KAAK4b,aACpCnL,EAAOuL,QAAUhc,KAAKgc,QACtBvL,EAAOwL,aAAejc,KAAKic,aAC3BxL,EAAOyL,cAAgB0B,GAAU5d,KAAKkc,eACtCzL,EAAO0L,cAAgBnc,KAAKmc,cAC5B1L,EAAO2L,UAAYwB,GAAU5d,KAAKoc,WAC3B3L,CACT,EAw8dA0K,GAAYnF,UAAU6D,QA97dtB,WACE,GAAI7Z,KAAKic,aAAc,CACrB,IAAIxL,EAAS,IAAI0K,GAAYnb,MAC7ByQ,EAAOuL,SAAW,EAClBvL,EAAOwL,cAAe,CACxB,MACExL,EAASzQ,KAAK+1B,SACP/Z,UAAY,EAErB,OAAOvL,CACT,EAq7dA0K,GAAYnF,UAAU7X,MA36dtB,WACE,IAAI2R,EAAQ9P,KAAK2b,YAAYxd,QACzBgtC,EAAMnrC,KAAKgc,QACXiB,EAAQ/B,GAAQpL,GAChBs7B,EAAUD,EAAM,EAChB7Z,EAAYrU,EAAQnN,EAAMH,OAAS,EACnC07B,EA8pIN,SAAiBphB,EAAOW,EAAKyP,GAI3B,IAHA,IAAInqB,GAAS,EACTP,EAAS0qB,EAAW1qB,SAEfO,EAAQP,GAAQ,CACvB,IAAInR,EAAO67B,EAAWnqB,GAClB+D,EAAOzV,EAAKyV,KAEhB,OAAQzV,EAAKJ,MACX,IAAK,OAAa6rB,GAAShW,EAAM,MACjC,IAAK,YAAa2W,GAAO3W,EAAM,MAC/B,IAAK,OAAa2W,EAAMtR,GAAUsR,EAAKX,EAAQhW,GAAO,MACtD,IAAK,YAAagW,EAAQ7Q,GAAU6Q,EAAOW,EAAM3W,GAErD,CACA,MAAO,CAAE,MAASgW,EAAO,IAAOW,EAClC,CA9qIa0gB,CAAQ,EAAGha,EAAWtxB,KAAKoc,WAClC6N,EAAQohB,EAAKphB,MACbW,EAAMygB,EAAKzgB,IACXjb,EAASib,EAAMX,EACf/Z,EAAQk7B,EAAUxgB,EAAOX,EAAQ,EACjCtB,EAAY3oB,KAAKkc,cACjBqvB,EAAa5iB,EAAUhZ,OACvBa,EAAW,EACXg7B,EAAYlyB,GAAU3J,EAAQ3P,KAAKmc,eAEvC,IAAKc,IAAWmuB,GAAW9Z,GAAa3hB,GAAU67B,GAAa77B,EAC7D,OAAO4c,GAAiBzc,EAAO9P,KAAK4b,aAEtC,IAAInL,EAAS,GAEbkR,EACA,KAAOhS,KAAYa,EAAWg7B,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbttC,EAAQ2R,EAHZI,GAASi7B,KAKAM,EAAYF,GAAY,CAC/B,IAAI/sC,EAAOmqB,EAAU8iB,GACjBz7B,EAAWxR,EAAKwR,SAChB5R,EAAOI,EAAKJ,KACZS,EAAWmR,EAAS7R,GAExB,GA7zDY,GA6zDRC,EACFD,EAAQU,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DTT,EACF,SAASujB,EAET,MAAMA,CAEV,CACF,CACAlR,EAAOD,KAAcrS,CACvB,CACA,OAAOsS,CACT,EA+3dAuK,GAAOhF,UAAU6lB,GAAKlE,GACtB3c,GAAOhF,UAAUyhB,MA1iQjB,WACE,OAAOA,GAAMz3B,KACf,EAyiQAgb,GAAOhF,UAAU01B,OA7gQjB,WACE,OAAO,IAAItwB,GAAcpb,KAAK7B,QAAS6B,KAAK6b,UAC9C,EA4gQAb,GAAOhF,UAAUmlB,KAp/PjB,WACMn7B,KAAK+b,aAAehW,IACtB/F,KAAK+b,WAAamf,GAAQl7B,KAAK7B,UAEjC,IAAIi9B,EAAOp7B,KAAK8b,WAAa9b,KAAK+b,WAAWpM,OAG7C,MAAO,CAAE,KAAQyrB,EAAM,MAFXA,EAAOr1B,EAAY/F,KAAK+b,WAAW/b,KAAK8b,aAGtD,EA6+PAd,GAAOhF,UAAUqa,MA77PjB,SAAsBlyB,GAIpB,IAHA,IAAIsS,EACAmU,EAAS5kB,KAEN4kB,aAAkBnJ,IAAY,CACnC,IAAIsa,EAAQ1a,GAAauJ,GACzBmR,EAAMja,UAAY,EAClBia,EAAMha,WAAahW,EACf0K,EACFoZ,EAASlO,YAAcoa,EAEvBtlB,EAASslB,EAEX,IAAIlM,EAAWkM,EACfnR,EAASA,EAAOjJ,WAClB,CAEA,OADAkO,EAASlO,YAAcxd,EAChBsS,CACT,EA46PAuK,GAAOhF,UAAU6D,QAt5PjB,WACE,IAAI1b,EAAQ6B,KAAK2b,YACjB,GAAIxd,aAAiBgd,GAAa,CAChC,IAAIwwB,EAAUxtC,EAUd,OATI6B,KAAK4b,YAAYjM,SACnBg8B,EAAU,IAAIxwB,GAAYnb,QAE5B2rC,EAAUA,EAAQ9xB,WACV+B,YAAYhW,KAAK,CACvB,KAAQmqB,GACR,KAAQ,CAAClW,IACT,QAAW9T,IAEN,IAAIqV,GAAcuwB,EAAS3rC,KAAK6b,UACzC,CACA,OAAO7b,KAAK+vB,KAAKlW,GACnB,EAu4PAmB,GAAOhF,UAAU41B,OAAS5wB,GAAOhF,UAAU8E,QAAUE,GAAOhF,UAAU7X,MAv3PtE,WACE,OAAOouB,GAAiBvsB,KAAK2b,YAAa3b,KAAK4b,YACjD,EAw3PAZ,GAAOhF,UAAUo0B,MAAQpvB,GAAOhF,UAAUqgB,KAEtCze,KACFoD,GAAOhF,UAAU4B,IAj+PnB,WACE,OAAO5X,IACT,GAi+POgb,EACR,CAKO3F,GAQNxH,GAAKuH,EAAIA,IAIT,aACE,OAAOA,EACR,mCAaL,EAAExF,KAAK5P,iwEC/rhBW,IACK,IACJ,IACC,IACH,IACD,IACC,IACC,IACG,IACL,IACQ,IACX,IACG,IACO,IACH,EAAA6rC,EACD,IACO,IACG,IACN,IACA,IACD,IACI,IACC,IACF,IACF,IACC,IACR,IACG,IACK,KACZ,IACI,IACC,IACL,IACa,IACR,IACJ,IACM,IACE,IACI,IACX,IACM,IACM,IACd,IACM,IACD,IACC,IACA,IACF,IACD,IACK,IACN,IACI,IACD,KACE,KACR,KACG,KACK,KACN,KACI,KACU,KACF,KACX,GAAAC,EACW,KACb,KACI,KACO,KACF,KACI,KACX,KACC,KACK,KACJ,KACI,KACjB70B,OAAOc,YA8CD,KACE,KACA,MACRd,OAAOc,cClPNg0B,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBlmC,IAAjBmmC,EACH,OAAOA,EAAal+B,QAGrB,IAAInI,EAASkmC,EAAyBE,GAAY,CACjDnmC,GAAImmC,EACJE,QAAQ,EACRn+B,QAAS,CAAC,GAUX,OANAo+B,EAAoBH,GAAUr8B,KAAK/J,EAAOmI,QAASnI,EAAQA,EAAOmI,QAASg+B,GAG3EnmC,EAAOsmC,QAAS,EAGTtmC,EAAOmI,OACf,CAGAg+B,EAAoBK,EAAID,ElB5BpBzuC,EAAW,GACfquC,EAAoBM,EAAI,CAAC77B,EAAQ87B,EAAUlb,EAAImb,KAC9C,IAAGD,EAAH,CAMA,IAAIE,EAAehoB,IACnB,IAASioB,EAAI,EAAGA,EAAI/uC,EAASgS,OAAQ+8B,IAAK,CACrCH,EAAW5uC,EAAS+uC,GAAG,GACvBrb,EAAK1zB,EAAS+uC,GAAG,GACjBF,EAAW7uC,EAAS+uC,GAAG,GAE3B,IAJA,IAGIC,GAAY,EACPC,EAAI,EAAGA,EAAIL,EAAS58B,OAAQi9B,MACpB,EAAXJ,GAAsBC,GAAgBD,IAAa9+B,OAAOgJ,KAAKs1B,EAAoBM,GAAG3H,OAAO/yB,GAASo6B,EAAoBM,EAAE16B,GAAK26B,EAASK,MAC9IL,EAAS90B,OAAOm1B,IAAK,IAErBD,GAAY,EACTH,EAAWC,IAAcA,EAAeD,IAG7C,GAAGG,EAAW,CACbhvC,EAAS8Z,OAAOi1B,IAAK,GACrB,IAAIG,EAAIxb,SACEtrB,IAAN8mC,IAAiBp8B,EAASo8B,EAC/B,CACD,CACA,OAAOp8B,CArBP,CAJC+7B,EAAWA,GAAY,EACvB,IAAI,IAAIE,EAAI/uC,EAASgS,OAAQ+8B,EAAI,GAAK/uC,EAAS+uC,EAAI,GAAG,GAAKF,EAAUE,IAAK/uC,EAAS+uC,GAAK/uC,EAAS+uC,EAAI,GACrG/uC,EAAS+uC,GAAK,CAACH,EAAUlb,EAAImb,EAuBjB,EmB3BdR,EAAoBt5B,EAAK7M,IACxB,IAAIinC,EAASjnC,GAAUA,EAAOknC,WAC7B,IAAOlnC,EAAiB,QACxB,IAAM,EAEP,OADAmmC,EAAoBgB,EAAEF,EAAQ,CAAEG,EAAGH,IAC5BA,CAAM,ECLdd,EAAoBgB,EAAI,CAACh/B,EAASk/B,KACjC,IAAI,IAAIt7B,KAAOs7B,EACXlB,EAAoBmB,EAAED,EAAYt7B,KAASo6B,EAAoBmB,EAAEn/B,EAAS4D,IAC5ElE,OAAOsK,eAAehK,EAAS4D,EAAK,CAAEw7B,YAAY,EAAMhsC,IAAK8rC,EAAWt7B,IAE1E,ECNDo6B,EAAoBqB,EAAI,CAAC,EAGzBrB,EAAoBt9B,EAAK4+B,GACjBtzB,QAAQuzB,IAAI7/B,OAAOgJ,KAAKs1B,EAAoBqB,GAAGhG,QAAO,CAACmG,EAAU57B,KACvEo6B,EAAoBqB,EAAEz7B,GAAK07B,EAASE,GAC7BA,IACL,KCNJxB,EAAoByB,EAAKH,GAEZA,EAAU,IAAMA,EAAU,SAAW,CAAC,KAAO,uBAAuB,KAAO,wBAAwBA,GCHhHtB,EAAoBv+B,EAAI,WACvB,GAA0B,iBAAfigC,WAAyB,OAAOA,WAC3C,IACC,OAAO1tC,MAAQ,IAAI8N,SAAS,cAAb,EAChB,CAAE,MAAOY,GACR,GAAsB,iBAAX5M,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBkqC,EAAoBmB,EAAI,CAACQ,EAAK9Q,IAAUnvB,OAAOsI,UAAUM,eAAe1G,KAAK+9B,EAAK9Q,GvBA9Ej/B,EAAa,CAAC,EACdC,EAAoB,aAExBmuC,EAAoB4B,EAAI,CAACC,EAAKzS,EAAMxpB,EAAK07B,KACxC,GAAG1vC,EAAWiwC,GAAQjwC,EAAWiwC,GAAKjoC,KAAKw1B,OAA3C,CACA,IAAI0S,EAAQC,EACZ,QAAWhoC,IAAR6L,EAEF,IADA,IAAIo8B,EAAUC,SAASC,qBAAqB,UACpCxB,EAAI,EAAGA,EAAIsB,EAAQr+B,OAAQ+8B,IAAK,CACvC,IAAIyB,EAAIH,EAAQtB,GAChB,GAAGyB,EAAEC,aAAa,QAAUP,GAAOM,EAAEC,aAAa,iBAAmBvwC,EAAoB+T,EAAK,CAAEk8B,EAASK,EAAG,KAAO,CACpH,CAEGL,IACHC,GAAa,GACbD,EAASG,SAASI,cAAc,WAEzBC,QAAU,QACjBR,EAAOS,QAAU,IACbvC,EAAoBwC,IACvBV,EAAOW,aAAa,QAASzC,EAAoBwC,IAElDV,EAAOW,aAAa,eAAgB5wC,EAAoB+T,GAExDk8B,EAAOY,IAAMb,GAEdjwC,EAAWiwC,GAAO,CAACzS,GACnB,IAAIuT,EAAmB,CAACC,EAAMC,KAE7Bf,EAAOgB,QAAUhB,EAAOiB,OAAS,KACjC52B,aAAao2B,GACb,IAAIS,EAAUpxC,EAAWiwC,GAIzB,UAHOjwC,EAAWiwC,GAClBC,EAAOmB,YAAcnB,EAAOmB,WAAWC,YAAYpB,GACnDkB,GAAWA,EAAQ96B,SAASmd,GAAQA,EAAGwd,KACpCD,EAAM,OAAOA,EAAKC,EAAM,EAExBN,EAAUh2B,WAAWo2B,EAAiBrW,KAAK,UAAMvyB,EAAW,CAAE3H,KAAM,UAAWiD,OAAQysC,IAAW,MACtGA,EAAOgB,QAAUH,EAAiBrW,KAAK,KAAMwV,EAAOgB,SACpDhB,EAAOiB,OAASJ,EAAiBrW,KAAK,KAAMwV,EAAOiB,QACnDhB,GAAcE,SAAS5X,KAAK8Y,YAAYrB,EApCkB,CAoCX,EwBvChD9B,EAAoBa,EAAK7+B,IACH,oBAAXiJ,QAA0BA,OAAOc,aAC1CrK,OAAOsK,eAAehK,EAASiJ,OAAOc,YAAa,CAAE5Z,MAAO,WAE7DuP,OAAOsK,eAAehK,EAAS,aAAc,CAAE7P,OAAO,GAAO,ECL9D6tC,EAAoBoD,IAAOvpC,IAC1BA,EAAO6Y,MAAQ,GACV7Y,EAAOwpC,WAAUxpC,EAAOwpC,SAAW,IACjCxpC,GCHRmmC,EAAoBY,EAAI,WCAxB,IAAI0C,EACAtD,EAAoBv+B,EAAE8hC,gBAAeD,EAAYtD,EAAoBv+B,EAAE+hC,SAAW,IACtF,IAAIvB,EAAWjC,EAAoBv+B,EAAEwgC,SACrC,IAAKqB,GAAarB,IACbA,EAASwB,gBACZH,EAAYrB,EAASwB,cAAcf,MAC/BY,GAAW,CACf,IAAItB,EAAUC,EAASC,qBAAqB,UAC5C,GAAGF,EAAQr+B,OAEV,IADA,IAAI+8B,EAAIsB,EAAQr+B,OAAS,EAClB+8B,GAAK,KAAO4C,IAAc,aAAax7B,KAAKw7B,KAAaA,EAAYtB,EAAQtB,KAAKgC,GAE3F,CAID,IAAKY,EAAW,MAAM,IAAI35B,MAAM,yDAChC25B,EAAYA,EAAUv8B,QAAQ,OAAQ,IAAIA,QAAQ,QAAS,IAAIA,QAAQ,YAAa,KACpFi5B,EAAoB0D,EAAIJ,YClBxBtD,EAAoB2D,EAAI1B,SAAS2B,SAAWhiC,KAAK4hC,SAASK,KAK1D,IAAIC,EAAkB,CACrB,KAAM,GAGP9D,EAAoBqB,EAAET,EAAI,CAACU,EAASE,KAElC,IAAIuC,EAAqB/D,EAAoBmB,EAAE2C,EAAiBxC,GAAWwC,EAAgBxC,QAAWvnC,EACtG,GAA0B,IAAvBgqC,EAGF,GAAGA,EACFvC,EAAS5nC,KAAKmqC,EAAmB,QAC3B,CAGL,IAAIC,EAAU,IAAIh2B,SAAQ,CAAC2a,EAASoN,IAAYgO,EAAqBD,EAAgBxC,GAAW,CAAC3Y,EAASoN,KAC1GyL,EAAS5nC,KAAKmqC,EAAmB,GAAKC,GAGtC,IAAInC,EAAM7B,EAAoB0D,EAAI1D,EAAoByB,EAAEH,GAEpD9qC,EAAQ,IAAImT,MAgBhBq2B,EAAoB4B,EAAEC,GAfFgB,IACnB,GAAG7C,EAAoBmB,EAAE2C,EAAiBxC,KAEf,KAD1ByC,EAAqBD,EAAgBxC,MACRwC,EAAgBxC,QAAWvnC,GACrDgqC,GAAoB,CACtB,IAAIE,EAAYpB,IAAyB,SAAfA,EAAMzwC,KAAkB,UAAYywC,EAAMzwC,MAChE8xC,EAAUrB,GAASA,EAAMxtC,QAAUwtC,EAAMxtC,OAAOqtC,IACpDlsC,EAAMijB,QAAU,iBAAmB6nB,EAAU,cAAgB2C,EAAY,KAAOC,EAAU,IAC1F1tC,EAAMzE,KAAO,iBACbyE,EAAMpE,KAAO6xC,EACbztC,EAAM2tC,QAAUD,EAChBH,EAAmB,GAAGvtC,EACvB,CACD,GAEwC,SAAW8qC,EAASA,EAE/D,CACD,EAWFtB,EAAoBM,EAAEM,EAAKU,GAA0C,IAA7BwC,EAAgBxC,GAGxD,IAAI8C,EAAuB,CAACC,EAA4B7xC,KACvD,IAKIytC,EAAUqB,EALVf,EAAW/tC,EAAK,GAChB8xC,EAAc9xC,EAAK,GACnB+xC,EAAU/xC,EAAK,GAGIkuC,EAAI,EAC3B,GAAGH,EAAS9E,MAAM3hC,GAAgC,IAAxBgqC,EAAgBhqC,KAAa,CACtD,IAAImmC,KAAYqE,EACZtE,EAAoBmB,EAAEmD,EAAarE,KACrCD,EAAoBK,EAAEJ,GAAYqE,EAAYrE,IAGhD,GAAGsE,EAAS,IAAI9/B,EAAS8/B,EAAQvE,EAClC,CAEA,IADGqE,GAA4BA,EAA2B7xC,GACrDkuC,EAAIH,EAAS58B,OAAQ+8B,IACzBY,EAAUf,EAASG,GAChBV,EAAoBmB,EAAE2C,EAAiBxC,IAAYwC,EAAgBxC,IACrEwC,EAAgBxC,GAAS,KAE1BwC,EAAgBxC,GAAW,EAE5B,OAAOtB,EAAoBM,EAAE77B,EAAO,EAGjC+/B,EAAqB5iC,KAA4B,sBAAIA,KAA4B,uBAAK,GAC1F4iC,EAAmBt8B,QAAQk8B,EAAqB9X,KAAK,KAAM,IAC3DkY,EAAmB5qC,KAAOwqC,EAAqB9X,KAAK,KAAMkY,EAAmB5qC,KAAK0yB,KAAKkY,QCvFvFxE,EAAoBwC,QAAKzoC,ECGzB,IAAI0qC,EAAsBzE,EAAoBM,OAAEvmC,EAAW,CAAC,OAAO,IAAOimC,EAAoB,QAC9FyE,EAAsBzE,EAAoBM,EAAEmE","sources":["webpack:///nextcloud/webpack/runtime/chunk loaded","webpack:///nextcloud/webpack/runtime/load script","webpack:///nextcloud/apps/settings/src/components/SelectSharingPermissions.vue","webpack:///nextcloud/apps/settings/src/components/SelectSharingPermissions.vue?vue&type=script&lang=ts","webpack://nextcloud/./apps/settings/src/components/SelectSharingPermissions.vue?3aef","webpack://nextcloud/./apps/settings/src/components/SelectSharingPermissions.vue?0492","webpack:///nextcloud/apps/settings/src/components/AdminSettingsSharingForm.vue","webpack:///nextcloud/apps/settings/src/components/AdminSettingsSharingForm.vue?vue&type=script&lang=ts","webpack://nextcloud/./apps/settings/src/components/AdminSettingsSharingForm.vue?bc1a","webpack://nextcloud/./apps/settings/src/components/AdminSettingsSharingForm.vue?8936","webpack:///nextcloud/apps/settings/src/views/AdminSettingsSharing.vue?vue&type=script&lang=ts","webpack:///nextcloud/apps/settings/src/views/AdminSettingsSharing.vue","webpack://nextcloud/./apps/settings/src/views/AdminSettingsSharing.vue?a501","webpack:///nextcloud/apps/settings/src/admin-settings-sharing.ts","webpack:///nextcloud/apps/settings/src/components/AdminSettingsSharingForm.vue?vue&type=style&index=0&id=965ea99a&prod&scoped=true&lang=scss","webpack:///nextcloud/apps/settings/src/components/SelectSharingPermissions.vue?vue&type=style&index=0&id=54c0ce93&prod&scoped=true&lang=css","webpack:///nextcloud/node_modules/lodash/lodash.js","webpack:///nextcloud/node_modules/@nextcloud/vue/dist/index.mjs","webpack:///nextcloud/webpack/bootstrap","webpack:///nextcloud/webpack/runtime/compat get default export","webpack:///nextcloud/webpack/runtime/define property getters","webpack:///nextcloud/webpack/runtime/ensure chunk","webpack:///nextcloud/webpack/runtime/get javascript chunk filename","webpack:///nextcloud/webpack/runtime/global","webpack:///nextcloud/webpack/runtime/hasOwnProperty shorthand","webpack:///nextcloud/webpack/runtime/make namespace object","webpack:///nextcloud/webpack/runtime/node module decorator","webpack:///nextcloud/webpack/runtime/runtimeId","webpack:///nextcloud/webpack/runtime/publicPath","webpack:///nextcloud/webpack/runtime/jsonp chunk loading","webpack:///nextcloud/webpack/runtime/nonce","webpack:///nextcloud/webpack/startup"],"sourcesContent":["var deferred = [];\n__webpack_require__.O = (result, chunkIds, fn, priority) => {\n\tif(chunkIds) {\n\t\tpriority = priority || 0;\n\t\tfor(var i = deferred.length; i > 0 && deferred[i - 1][2] > priority; i--) deferred[i] = deferred[i - 1];\n\t\tdeferred[i] = [chunkIds, fn, priority];\n\t\treturn;\n\t}\n\tvar notFulfilled = Infinity;\n\tfor (var i = 0; i < deferred.length; i++) {\n\t\tvar chunkIds = deferred[i][0];\n\t\tvar fn = deferred[i][1];\n\t\tvar priority = deferred[i][2];\n\t\tvar fulfilled = true;\n\t\tfor (var j = 0; j < chunkIds.length; j++) {\n\t\t\tif ((priority & 1 === 0 || notFulfilled >= priority) && Object.keys(__webpack_require__.O).every((key) => (__webpack_require__.O[key](chunkIds[j])))) {\n\t\t\t\tchunkIds.splice(j--, 1);\n\t\t\t} else {\n\t\t\t\tfulfilled = false;\n\t\t\t\tif(priority < notFulfilled) notFulfilled = priority;\n\t\t\t}\n\t\t}\n\t\tif(fulfilled) {\n\t\t\tdeferred.splice(i--, 1)\n\t\t\tvar r = fn();\n\t\t\tif (r !== undefined) result = r;\n\t\t}\n\t}\n\treturn result;\n};","var inProgress = {};\nvar dataWebpackPrefix = \"nextcloud:\";\n// loadScript function to load a script via script tag\n__webpack_require__.l = (url, done, key, chunkId) => {\n\tif(inProgress[url]) { inProgress[url].push(done); return; }\n\tvar script, needAttach;\n\tif(key !== undefined) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tfor(var i = 0; i < scripts.length; i++) {\n\t\t\tvar s = scripts[i];\n\t\t\tif(s.getAttribute(\"src\") == url || s.getAttribute(\"data-webpack\") == dataWebpackPrefix + key) { script = s; break; }\n\t\t}\n\t}\n\tif(!script) {\n\t\tneedAttach = true;\n\t\tscript = document.createElement('script');\n\n\t\tscript.charset = 'utf-8';\n\t\tscript.timeout = 120;\n\t\tif (__webpack_require__.nc) {\n\t\t\tscript.setAttribute(\"nonce\", __webpack_require__.nc);\n\t\t}\n\t\tscript.setAttribute(\"data-webpack\", dataWebpackPrefix + key);\n\n\t\tscript.src = url;\n\t}\n\tinProgress[url] = [done];\n\tvar onScriptComplete = (prev, event) => {\n\t\t// avoid mem leaks in IE.\n\t\tscript.onerror = script.onload = null;\n\t\tclearTimeout(timeout);\n\t\tvar doneFns = inProgress[url];\n\t\tdelete inProgress[url];\n\t\tscript.parentNode && script.parentNode.removeChild(script);\n\t\tdoneFns && doneFns.forEach((fn) => (fn(event)));\n\t\tif(prev) return prev(event);\n\t}\n\tvar timeout = setTimeout(onScriptComplete.bind(null, undefined, { type: 'timeout', target: script }), 120000);\n\tscript.onerror = onScriptComplete.bind(null, script.onerror);\n\tscript.onload = onScriptComplete.bind(null, script.onload);\n\tneedAttach && document.head.appendChild(script);\n};","var render = function render(){var _vm=this,_c=_vm._self._c,_setup=_vm._self._setupProxy;return _c('fieldset',{staticClass:\"permissions-select\"},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.canCreate},on:{\"update:checked\":function($event){return _vm.toggle(_vm.PERMISSION_CREATE)}}},[_vm._v(\"\\n\\t\\t\"+_vm._s(_vm.t('settings', 'Create'))+\"\\n\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.canUpdate},on:{\"update:checked\":function($event){return _vm.toggle(_vm.PERMISSION_UPDATE)}}},[_vm._v(\"\\n\\t\\t\"+_vm._s(_vm.t('settings', 'Change'))+\"\\n\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.canDelete},on:{\"update:checked\":function($event){return _vm.toggle(_vm.PERMISSION_DELETE)}}},[_vm._v(\"\\n\\t\\t\"+_vm._s(_vm.t('settings', 'Delete'))+\"\\n\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.canShare},on:{\"update:checked\":function($event){return _vm.toggle(_vm.PERMISSION_SHARE)}}},[_vm._v(\"\\n\\t\\t\"+_vm._s(_vm.t('settings', 'Reshare'))+\"\\n\\t\")])],1)\n}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","import mod from \"-!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/ts-loader/index.js??clonedRuleSet-4.use[1]!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./SelectSharingPermissions.vue?vue&type=script&lang=ts\"; export default mod; export * from \"-!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/ts-loader/index.js??clonedRuleSet-4.use[1]!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./SelectSharingPermissions.vue?vue&type=script&lang=ts\"","\n import API from \"!../../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js\";\n import domAPI from \"!../../../../node_modules/style-loader/dist/runtime/styleDomAPI.js\";\n import insertFn from \"!../../../../node_modules/style-loader/dist/runtime/insertBySelector.js\";\n import setAttributes from \"!../../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js\";\n import insertStyleElement from \"!../../../../node_modules/style-loader/dist/runtime/insertStyleElement.js\";\n import styleTagTransformFn from \"!../../../../node_modules/style-loader/dist/runtime/styleTagTransform.js\";\n import content, * as namedExport from \"!!../../../../node_modules/css-loader/dist/cjs.js!../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./SelectSharingPermissions.vue?vue&type=style&index=0&id=54c0ce93&prod&scoped=true&lang=css\";\n \n \n\nvar options = {};\n\noptions.styleTagTransform = styleTagTransformFn;\noptions.setAttributes = setAttributes;\n\n options.insert = insertFn.bind(null, \"head\");\n \noptions.domAPI = domAPI;\noptions.insertStyleElement = insertStyleElement;\n\nvar update = API(content, options);\n\n\n\nexport * from \"!!../../../../node_modules/css-loader/dist/cjs.js!../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./SelectSharingPermissions.vue?vue&type=style&index=0&id=54c0ce93&prod&scoped=true&lang=css\";\n export default content && content.locals ? content.locals : undefined;\n","import { render, staticRenderFns } from \"./SelectSharingPermissions.vue?vue&type=template&id=54c0ce93&scoped=true\"\nimport script from \"./SelectSharingPermissions.vue?vue&type=script&lang=ts\"\nexport * from \"./SelectSharingPermissions.vue?vue&type=script&lang=ts\"\nimport style0 from \"./SelectSharingPermissions.vue?vue&type=style&index=0&id=54c0ce93&prod&scoped=true&lang=css\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n \"54c0ce93\",\n null\n \n)\n\nexport default component.exports","var render = function render(){var _vm=this,_c=_vm._self._c,_setup=_vm._self._setupProxy;return _c('form',{staticClass:\"sharing\"},[_c('NcCheckboxRadioSwitch',{attrs:{\"aria-controls\":\"settings-sharing-api settings-sharing-api-settings settings-sharing-default-permissions settings-sharing-privary-related\",\"type\":\"switch\",\"checked\":_vm.settings.enabled},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"enabled\", $event)}}},[_vm._v(\"\\n\\t\\t\"+_vm._s(_vm.t('settings', 'Allow apps to use the Share API'))+\"\\n\\t\")]),_vm._v(\" \"),_c('div',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.enabled),expression:\"settings.enabled\"}],staticClass:\"sharing__sub-section\",attrs:{\"id\":\"settings-sharing-api-settings\"}},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.allowResharing},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"allowResharing\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow resharing'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.allowGroupSharing},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"allowGroupSharing\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow sharing with groups'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.onlyShareWithGroupMembers},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"onlyShareWithGroupMembers\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Restrict users to only share with users in their groups'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('div',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.onlyShareWithGroupMembers),expression:\"settings.onlyShareWithGroupMembers\"}],staticClass:\"sharing__labeled-entry sharing__input\",attrs:{\"id\":\"settings-sharing-api-excluded-groups\"}},[_c('label',{attrs:{\"for\":\"settings-sharing-only-group-members-excluded-groups\"}},[_vm._v(_vm._s(_vm.t('settings', 'Ignore the following groups when checking group membership')))]),_vm._v(\" \"),_c('NcSettingsSelectGroup',{staticStyle:{\"width\":\"100%\"},attrs:{\"id\":\"settings-sharing-only-group-members-excluded-groups\",\"label\":_vm.t('settings', 'Ignore the following groups when checking group membership')},model:{value:(_vm.settings.onlyShareWithGroupMembersExcludeGroupList),callback:function ($$v) {_vm.$set(_vm.settings, \"onlyShareWithGroupMembersExcludeGroupList\", $$v)},expression:\"settings.onlyShareWithGroupMembersExcludeGroupList\"}})],1)],1),_vm._v(\" \"),_c('div',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.enabled),expression:\"settings.enabled\"}],staticClass:\"sharing__section\",attrs:{\"id\":\"settings-sharing-api\"}},[_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"aria-controls\":\"settings-sharing-api-public-link\",\"checked\":_vm.settings.allowLinks},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"allowLinks\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow users to share via link and emails'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('fieldset',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.allowLinks),expression:\"settings.allowLinks\"}],staticClass:\"sharing__sub-section\",attrs:{\"id\":\"settings-sharing-api-public-link\"}},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.allowPublicUpload},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"allowPublicUpload\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow public uploads'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.enableLinkPasswordByDefault},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"enableLinkPasswordByDefault\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Always ask for a password'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.enforceLinksPassword,\"disabled\":!_vm.settings.enableLinkPasswordByDefault},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"enforceLinksPassword\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Enforce password protection'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),(_vm.settings.passwordExcludedGroupsFeatureEnabled)?_c('label',{staticClass:\"sharing__labeled-entry sharing__input\"},[_c('span',[_vm._v(_vm._s(_vm.t('settings', 'Exclude groups from password requirements')))]),_vm._v(\" \"),_c('NcSettingsSelectGroup',{staticStyle:{\"width\":\"100%\"},attrs:{\"disabled\":!_vm.settings.enforceLinksPassword || !_vm.settings.enableLinkPasswordByDefault},model:{value:(_vm.settings.passwordExcludedGroups),callback:function ($$v) {_vm.$set(_vm.settings, \"passwordExcludedGroups\", $$v)},expression:\"settings.passwordExcludedGroups\"}})],1):_vm._e(),_vm._v(\" \"),_c('label',{staticClass:\"sharing__labeled-entry sharing__input\"},[_c('span',[_vm._v(_vm._s(_vm.t('settings', 'Exclude groups from creating link shares')))]),_vm._v(\" \"),_c('NcSettingsSelectGroup',{staticStyle:{\"width\":\"100%\"},attrs:{\"label\":_vm.t('settings', 'Exclude groups from creating link shares')},model:{value:(_vm.settings.allowLinksExcludeGroups),callback:function ($$v) {_vm.$set(_vm.settings, \"allowLinksExcludeGroups\", $$v)},expression:\"settings.allowLinksExcludeGroups\"}})],1)],1),_vm._v(\" \"),_c('label',[_vm._v(_vm._s(_vm.t('settings', 'Limit sharing based on groups')))]),_vm._v(\" \"),_c('div',{staticClass:\"sharing__sub-section\"},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.excludeGroups,\"name\":\"excludeGroups\",\"value\":\"no\",\"type\":\"radio\"},on:{\"update:checked\":[function($event){return _vm.$set(_vm.settings, \"excludeGroups\", $event)},_vm.onUpdateExcludeGroups]}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow sharing for everyone (default)'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.excludeGroups,\"name\":\"excludeGroups\",\"value\":\"yes\",\"type\":\"radio\"},on:{\"update:checked\":[function($event){return _vm.$set(_vm.settings, \"excludeGroups\", $event)},_vm.onUpdateExcludeGroups]}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Exclude some groups from sharing'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.excludeGroups,\"name\":\"excludeGroups\",\"value\":\"allow\",\"type\":\"radio\"},on:{\"update:checked\":[function($event){return _vm.$set(_vm.settings, \"excludeGroups\", $event)},_vm.onUpdateExcludeGroups]}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Limit sharing to some groups'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('div',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.excludeGroups !== 'no'),expression:\"settings.excludeGroups !== 'no'\"}],staticClass:\"sharing__labeled-entry sharing__input\"},[_c('NcSettingsSelectGroup',{staticStyle:{\"width\":\"100%\"},attrs:{\"id\":\"settings-sharing-excluded-groups\",\"aria-describedby\":\"settings-sharing-excluded-groups-desc\",\"label\":_vm.settings.excludeGroups === 'allow' ? _vm.t('settings', 'Groups allowed to share') : _vm.t('settings', 'Groups excluded from sharing'),\"disabled\":_vm.settings.excludeGroups === 'no'},model:{value:(_vm.settings.excludeGroupsList),callback:function ($$v) {_vm.$set(_vm.settings, \"excludeGroupsList\", $$v)},expression:\"settings.excludeGroupsList\"}}),_vm._v(\" \"),_c('em',{attrs:{\"id\":\"settings-sharing-excluded-groups-desc\"}},[_vm._v(_vm._s(_vm.t('settings', 'Not allowed groups will still be able to receive shares, but not to initiate them.')))])],1)],1),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"aria-controls\":\"settings-sharing-api-expiration\",\"checked\":_vm.settings.defaultInternalExpireDate},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"defaultInternalExpireDate\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Set default expiration date for shares'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('fieldset',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.defaultInternalExpireDate),expression:\"settings.defaultInternalExpireDate\"}],staticClass:\"sharing__sub-section\",attrs:{\"id\":\"settings-sharing-api-expiration\"}},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.enforceInternalExpireDate},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"enforceInternalExpireDate\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Enforce expiration date'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcTextField',{staticClass:\"sharing__input\",attrs:{\"type\":\"number\",\"label\":_vm.t('settings', 'Default expiration time of new shares in days'),\"placeholder\":_vm.t('settings', 'Expire shares after x days'),\"value\":_vm.settings.internalExpireAfterNDays},on:{\"update:value\":function($event){return _vm.$set(_vm.settings, \"internalExpireAfterNDays\", $event)}}})],1),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"aria-controls\":\"settings-sharing-remote-api-expiration\",\"checked\":_vm.settings.defaultRemoteExpireDate},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"defaultRemoteExpireDate\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Set default expiration date for shares to other servers'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('fieldset',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.defaultRemoteExpireDate),expression:\"settings.defaultRemoteExpireDate\"}],staticClass:\"sharing__sub-section\",attrs:{\"id\":\"settings-sharing-remote-api-expiration\"}},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.enforceRemoteExpireDate},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"enforceRemoteExpireDate\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Enforce expiration date for remote shares'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcTextField',{staticClass:\"sharing__input\",attrs:{\"type\":\"number\",\"label\":_vm.t('settings', 'Default expiration time of remote shares in days'),\"placeholder\":_vm.t('settings', 'Expire remote shares after x days'),\"value\":_vm.settings.remoteExpireAfterNDays},on:{\"update:value\":function($event){return _vm.$set(_vm.settings, \"remoteExpireAfterNDays\", $event)}}})],1),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"aria-controls\":\"settings-sharing-api-api-expiration\",\"checked\":_vm.settings.defaultExpireDate,\"disabled\":!_vm.settings.allowLinks},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"defaultExpireDate\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Set default expiration date for shares via link or mail'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('fieldset',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.allowLinks && _vm.settings.defaultExpireDate),expression:\"settings.allowLinks && settings.defaultExpireDate\"}],staticClass:\"sharing__sub-section\",attrs:{\"id\":\"settings-sharing-api-api-expiration\"}},[_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.enforceExpireDate},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"enforceExpireDate\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Enforce expiration date for remote shares'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcTextField',{staticClass:\"sharing__input\",attrs:{\"type\":\"number\",\"label\":_vm.t('settings', 'Default expiration time of shares in days'),\"placeholder\":_vm.t('settings', 'Expire shares after x days'),\"value\":_vm.settings.expireAfterNDays},on:{\"update:value\":function($event){return _vm.$set(_vm.settings, \"expireAfterNDays\", $event)}}})],1)],1),_vm._v(\" \"),_c('div',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.enabled),expression:\"settings.enabled\"}],staticClass:\"sharing__section\",attrs:{\"id\":\"settings-sharing-privary-related\"}},[_c('h3',[_vm._v(_vm._s(_vm.t('settings', 'Privacy settings for sharing')))]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"aria-controls\":\"settings-sharing-privacy-user-enumeration\",\"checked\":_vm.settings.allowShareDialogUserEnumeration},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"allowShareDialogUserEnumeration\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow account name autocompletion in share dialog and allow access to the system address book'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('fieldset',{directives:[{name:\"show\",rawName:\"v-show\",value:(_vm.settings.allowShareDialogUserEnumeration),expression:\"settings.allowShareDialogUserEnumeration\"}],staticClass:\"sharing__sub-section\",attrs:{\"id\":\"settings-sharing-privacy-user-enumeration\"}},[_c('em',[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'If autocompletion \"same group\" and \"phone number integration\" are enabled a match in either is enough to show the user.'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.restrictUserEnumerationToGroup},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"restrictUserEnumerationToGroup\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow account name autocompletion to users within the same groups and limit system address books to users in the same groups'))+\"\\n\\t\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"checked\":_vm.settings.restrictUserEnumerationToPhone},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"restrictUserEnumerationToPhone\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow account name autocompletion to users based on phone number integration'))+\"\\n\\t\\t\\t\")])],1),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"checked\":_vm.settings.restrictUserEnumerationFullMatch},on:{\"update:checked\":function($event){return _vm.$set(_vm.settings, \"restrictUserEnumerationFullMatch\", $event)}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Allow autocompletion when entering the full name or email address (ignoring missing phonebook match and being in the same group)'))+\"\\n\\t\\t\")]),_vm._v(\" \"),_c('NcCheckboxRadioSwitch',{attrs:{\"type\":\"switch\",\"checked\":_vm.publicShareDisclaimerEnabled},on:{\"update:checked\":function($event){_vm.publicShareDisclaimerEnabled=$event}}},[_vm._v(\"\\n\\t\\t\\t\"+_vm._s(_vm.t('settings', 'Show disclaimer text on the public link upload page (only shown when the file list is hidden)'))+\"\\n\\t\\t\")]),_vm._v(\" \"),(typeof _vm.settings.publicShareDisclaimerText === 'string')?_c('div',{staticClass:\"sharing__sub-section\",attrs:{\"aria-describedby\":\"settings-sharing-privary-related-disclaimer-hint\"}},[_c('NcTextArea',{staticClass:\"sharing__input\",attrs:{\"label\":_vm.t('settings', 'Disclaimer text'),\"aria-describedby\":\"settings-sharing-privary-related-disclaimer-hint\",\"value\":_vm.settings.publicShareDisclaimerText},on:{\"update:value\":_vm.onUpdateDisclaimer}}),_vm._v(\" \"),_c('em',{staticClass:\"sharing__input\",attrs:{\"id\":\"settings-sharing-privary-related-disclaimer-hint\"}},[_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.t('settings', 'This text will be shown on the public link upload page when the file list is hidden.'))+\"\\n\\t\\t\\t\")])],1):_vm._e()],1),_vm._v(\" \"),_c('div',{staticClass:\"sharing__section\",attrs:{\"id\":\"settings-sharing-default-permissions\"}},[_c('h3',[_vm._v(_vm._s(_vm.t('settings', 'Default share permissions')))]),_vm._v(\" \"),_c('SelectSharingPermissions',{attrs:{\"value\":_vm.settings.defaultPermissions},on:{\"update:value\":function($event){return _vm.$set(_vm.settings, \"defaultPermissions\", $event)}}})],1)],1)\n}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","import mod from \"-!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/ts-loader/index.js??clonedRuleSet-4.use[1]!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./AdminSettingsSharingForm.vue?vue&type=script&lang=ts\"; export default mod; export * from \"-!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/ts-loader/index.js??clonedRuleSet-4.use[1]!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./AdminSettingsSharingForm.vue?vue&type=script&lang=ts\"","\n import API from \"!../../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js\";\n import domAPI from \"!../../../../node_modules/style-loader/dist/runtime/styleDomAPI.js\";\n import insertFn from \"!../../../../node_modules/style-loader/dist/runtime/insertBySelector.js\";\n import setAttributes from \"!../../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js\";\n import insertStyleElement from \"!../../../../node_modules/style-loader/dist/runtime/insertStyleElement.js\";\n import styleTagTransformFn from \"!../../../../node_modules/style-loader/dist/runtime/styleTagTransform.js\";\n import content, * as namedExport from \"!!../../../../node_modules/css-loader/dist/cjs.js!../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../node_modules/sass-loader/dist/cjs.js!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./AdminSettingsSharingForm.vue?vue&type=style&index=0&id=965ea99a&prod&scoped=true&lang=scss\";\n \n \n\nvar options = {};\n\noptions.styleTagTransform = styleTagTransformFn;\noptions.setAttributes = setAttributes;\n\n options.insert = insertFn.bind(null, \"head\");\n \noptions.domAPI = domAPI;\noptions.insertStyleElement = insertStyleElement;\n\nvar update = API(content, options);\n\n\n\nexport * from \"!!../../../../node_modules/css-loader/dist/cjs.js!../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../node_modules/sass-loader/dist/cjs.js!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./AdminSettingsSharingForm.vue?vue&type=style&index=0&id=965ea99a&prod&scoped=true&lang=scss\";\n export default content && content.locals ? content.locals : undefined;\n","import { render, staticRenderFns } from \"./AdminSettingsSharingForm.vue?vue&type=template&id=965ea99a&scoped=true\"\nimport script from \"./AdminSettingsSharingForm.vue?vue&type=script&lang=ts\"\nexport * from \"./AdminSettingsSharingForm.vue?vue&type=script&lang=ts\"\nimport style0 from \"./AdminSettingsSharingForm.vue?vue&type=style&index=0&id=965ea99a&prod&scoped=true&lang=scss\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n \"965ea99a\",\n null\n \n)\n\nexport default component.exports","import mod from \"-!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/ts-loader/index.js??clonedRuleSet-4.use[1]!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./AdminSettingsSharing.vue?vue&type=script&lang=ts\"; export default mod; export * from \"-!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/ts-loader/index.js??clonedRuleSet-4.use[1]!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./AdminSettingsSharing.vue?vue&type=script&lang=ts\"","var render = function render(){var _vm=this,_c=_vm._self._c,_setup=_vm._self._setupProxy;return _c('NcSettingsSection',{attrs:{\"data-cy-settings-sharing-section\":\"\",\"limit-width\":true,\"doc-url\":_vm.documentationLink,\"name\":_vm.t('settings', 'Sharing'),\"description\":_vm.t('settings', 'As admin you can fine-tune the sharing behavior. Please see the documentation for more information.')}},[(!_vm.sharingAppEnabled)?_c('NcNoteCard',{attrs:{\"type\":\"warning\"}},[_vm._v(\"\\n\\t\\t\"+_vm._s(_vm.t('settings', 'You need to enable the File sharing App.'))+\"\\n\\t\")]):_c('AdminSettingsSharingForm')],1)\n}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","import { render, staticRenderFns } from \"./AdminSettingsSharing.vue?vue&type=template&id=4dd263b2\"\nimport script from \"./AdminSettingsSharing.vue?vue&type=script&lang=ts\"\nexport * from \"./AdminSettingsSharing.vue?vue&type=script&lang=ts\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","/**\n * @copyright Copyright (c) 2023 Ferdinand Thiessen <opensource@fthiessen.de>\n *\n * @author Ferdinand Thiessen <opensource@fthiessen.de>\n *\n * @license AGPL-3.0-or-later\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http://www.gnu.org/licenses/>.\n *\n */\nimport Vue from 'vue';\nimport AdminSettingsSharing from './views/AdminSettingsSharing.vue';\nexport default new Vue({\n name: 'AdminSettingsSharingSection',\n el: '#vue-admin-settings-sharing',\n render: (h) => h(AdminSettingsSharing),\n});\n","// Imports\nimport ___CSS_LOADER_API_SOURCEMAP_IMPORT___ from \"../../../../node_modules/css-loader/dist/runtime/sourceMaps.js\";\nimport ___CSS_LOADER_API_IMPORT___ from \"../../../../node_modules/css-loader/dist/runtime/api.js\";\nvar ___CSS_LOADER_EXPORT___ = ___CSS_LOADER_API_IMPORT___(___CSS_LOADER_API_SOURCEMAP_IMPORT___);\n// Module\n___CSS_LOADER_EXPORT___.push([module.id, `.sharing[data-v-965ea99a]{display:flex;flex-direction:column;gap:12px}.sharing__labeled-entry[data-v-965ea99a]{display:flex;flex:1 0;flex-direction:column;gap:4px}.sharing__section[data-v-965ea99a]{display:flex;flex-direction:column;gap:4px;margin-block-end:12px}.sharing__sub-section[data-v-965ea99a]{display:flex;flex-direction:column;gap:4px;margin-inline-start:44px;margin-block-end:12px}.sharing__input[data-v-965ea99a]{max-width:500px;margin-inline-start:14px}.sharing__input[data-v-965ea99a] .v-select.select{width:100%}@media only screen and (max-width: 350px){.sharing__sub-section[data-v-965ea99a]{margin-inline-start:14px}}`, \"\",{\"version\":3,\"sources\":[\"webpack://./apps/settings/src/components/AdminSettingsSharingForm.vue\"],\"names\":[],\"mappings\":\"AACA,0BACC,YAAA,CACA,qBAAA,CACA,QAAA,CAEA,yCACC,YAAA,CACA,QAAA,CACA,qBAAA,CACA,OAAA,CAGD,mCACC,YAAA,CACA,qBAAA,CACA,OAAA,CACA,qBAAA,CAGD,uCACC,YAAA,CACA,qBAAA,CACA,OAAA,CAEA,wBAAA,CACA,qBAAA,CAGD,iCACC,eAAA,CAEA,wBAAA,CAEA,kDACC,UAAA,CAKH,0CAGE,uCACC,wBAAA,CAAA\",\"sourcesContent\":[\"\\n.sharing {\\n\\tdisplay: flex;\\n\\tflex-direction: column;\\n\\tgap: 12px;\\n\\n\\t&__labeled-entry {\\n\\t\\tdisplay: flex;\\n\\t\\tflex: 1 0;\\n\\t\\tflex-direction: column;\\n\\t\\tgap: 4px;\\n\\t}\\n\\n\\t&__section {\\n\\t\\tdisplay: flex;\\n\\t\\tflex-direction: column;\\n\\t\\tgap: 4px;\\n\\t\\tmargin-block-end: 12px\\n\\t}\\n\\n\\t&__sub-section {\\n\\t\\tdisplay: flex;\\n\\t\\tflex-direction: column;\\n\\t\\tgap: 4px;\\n\\n\\t\\tmargin-inline-start: 44px;\\n\\t\\tmargin-block-end: 12px\\n\\t}\\n\\n\\t&__input {\\n\\t\\tmax-width: 500px;\\n\\t\\t// align with checkboxes\\n\\t\\tmargin-inline-start: 14px;\\n\\n\\t\\t:deep(.v-select.select) {\\n\\t\\t\\twidth: 100%;\\n\\t\\t}\\n\\t}\\n}\\n\\n@media only screen and (max-width: 350px) {\\n\\t// ensure no overflow happens on small devices (required for WCAG)\\n\\t.sharing {\\n\\t\\t&__sub-section {\\n\\t\\t\\tmargin-inline-start: 14px;\\n\\t\\t}\\n\\t}\\n}\\n\"],\"sourceRoot\":\"\"}]);\n// Exports\nexport default ___CSS_LOADER_EXPORT___;\n","// Imports\nimport ___CSS_LOADER_API_SOURCEMAP_IMPORT___ from \"../../../../node_modules/css-loader/dist/runtime/sourceMaps.js\";\nimport ___CSS_LOADER_API_IMPORT___ from \"../../../../node_modules/css-loader/dist/runtime/api.js\";\nvar ___CSS_LOADER_EXPORT___ = ___CSS_LOADER_API_IMPORT___(___CSS_LOADER_API_SOURCEMAP_IMPORT___);\n// Module\n___CSS_LOADER_EXPORT___.push([module.id, `\n.permissions-select[data-v-54c0ce93] {\n\tdisplay: flex;\n\tflex-wrap: wrap;\n\tgap: 4px;\n}\n`, \"\",{\"version\":3,\"sources\":[\"webpack://./apps/settings/src/components/SelectSharingPermissions.vue\"],\"names\":[],\"mappings\":\";AA8FA;CACA,aAAA;CACA,eAAA;CACA,QAAA;AACA\",\"sourcesContent\":[\"<!--\\n\\t- @copyright 2023 Ferdinand Thiessen <opensource@fthiessen.de>\\n\\t-\\n\\t- @author Ferdinand Thiessen <opensource@fthiessen.de>\\n\\t-\\n\\t- @license AGPL-3.0-or-later\\n\\t-\\n\\t- This program is free software: you can redistribute it and/or modify\\n\\t- it under the terms of the GNU Affero General Public License as\\n\\t- published by the Free Software Foundation, either version 3 of the\\n\\t- License, or (at your option) any later version.\\n\\t-\\n\\t- This program is distributed in the hope that it will be useful,\\n\\t- but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\t- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\t- GNU Affero General Public License for more details.\\n\\t-\\n\\t- You should have received a copy of the GNU Affero General Public License\\n\\t- along with this program. If not, see <http://www.gnu.org/licenses/>.\\n\\t-\\n-->\\n<template>\\n\\t<fieldset class=\\\"permissions-select\\\">\\n\\t\\t<NcCheckboxRadioSwitch :checked=\\\"canCreate\\\" @update:checked=\\\"toggle(PERMISSION_CREATE)\\\">\\n\\t\\t\\t{{ t('settings', 'Create') }}\\n\\t\\t</NcCheckboxRadioSwitch>\\n\\t\\t<NcCheckboxRadioSwitch :checked=\\\"canUpdate\\\" @update:checked=\\\"toggle(PERMISSION_UPDATE)\\\">\\n\\t\\t\\t{{ t('settings', 'Change') }}\\n\\t\\t</NcCheckboxRadioSwitch>\\n\\t\\t<NcCheckboxRadioSwitch :checked=\\\"canDelete\\\" @update:checked=\\\"toggle(PERMISSION_DELETE)\\\">\\n\\t\\t\\t{{ t('settings', 'Delete') }}\\n\\t\\t</NcCheckboxRadioSwitch>\\n\\t\\t<NcCheckboxRadioSwitch :checked=\\\"canShare\\\" @update:checked=\\\"toggle(PERMISSION_SHARE)\\\">\\n\\t\\t\\t{{ t('settings', 'Reshare') }}\\n\\t\\t</NcCheckboxRadioSwitch>\\n\\t</fieldset>\\n</template>\\n\\n<script lang=\\\"ts\\\">\\nimport { translate } from '@nextcloud/l10n'\\nimport { NcCheckboxRadioSwitch } from '@nextcloud/vue'\\nimport { defineComponent } from 'vue'\\n\\nexport default defineComponent({\\n\\tname: 'SelectSharingPermissions',\\n\\tcomponents: {\\n\\t\\tNcCheckboxRadioSwitch,\\n\\t},\\n\\tprops: {\\n\\t\\tvalue: {\\n\\t\\t\\ttype: Number,\\n\\t\\t\\trequired: true,\\n\\t\\t},\\n\\t},\\n\\temits: {\\n\\t\\t'update:value': (value: number) => typeof value === 'number',\\n\\t},\\n\\tdata() {\\n\\t\\treturn {\\n\\t\\t\\tPERMISSION_UPDATE: 2,\\n\\t\\t\\tPERMISSION_CREATE: 4,\\n\\t\\t\\tPERMISSION_DELETE: 8,\\n\\t\\t\\tPERMISSION_SHARE: 16,\\n\\t\\t}\\n\\t},\\n\\tcomputed: {\\n\\t\\tcanCreate() {\\n\\t\\t\\treturn (this.value & this.PERMISSION_CREATE) !== 0\\n\\t\\t},\\n\\t\\tcanUpdate() {\\n\\t\\t\\treturn (this.value & this.PERMISSION_UPDATE) !== 0\\n\\t\\t},\\n\\t\\tcanDelete() {\\n\\t\\t\\treturn (this.value & this.PERMISSION_DELETE) !== 0\\n\\t\\t},\\n\\t\\tcanShare() {\\n\\t\\t\\treturn (this.value & this.PERMISSION_SHARE) !== 0\\n\\t\\t},\\n\\t},\\n\\tmethods: {\\n\\t\\tt: translate,\\n\\t\\t/**\\n\\t\\t * Toggle a permission\\n\\t\\t * @param permission The permission (bit) to toggle\\n\\t\\t */\\n\\t\\ttoggle(permission: number) {\\n\\t\\t\\t// xor to toggle the bit\\n\\t\\t\\tthis.$emit('update:value', this.value ^ permission)\\n\\t\\t},\\n\\t},\\n})\\n</script>\\n\\n<style scoped>\\n.permissions-select {\\n\\tdisplay: flex;\\n\\tflex-wrap: wrap;\\n\\tgap: 4px;\\n}\\n</style>\\n\"],\"sourceRoot\":\"\"}]);\n// Exports\nexport default ___CSS_LOADER_EXPORT___;\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.21';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function',\n INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\s/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '<p>' + func(text) + '</p>';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '<p>fred, barney, & pebbles</p>'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\n\n /**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\n /**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\n\n /**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\n /**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n /**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\n\n /**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\n\n /**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('<body>');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\n\n /**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\n function isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag || tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\n\n /**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\n function isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n }\n\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\n\n /**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\n /**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\n\n /**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\n\n /**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n /**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\n\n /**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\n\n /**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n /**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\n\n /**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\n function toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n }\n\n /**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\n\n /**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\n function toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n }\n\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\n\n /**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\n var assign = createAssigner(function(object, source) {\n if (isPrototype(source) || isArrayLike(source)) {\n copyObject(source, keys(source), object);\n return;\n }\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n assignValue(object, key, source[key]);\n }\n }\n });\n\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\n\n /**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined ||\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n });\n\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\n\n /**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\n\n /**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\n\n /**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\n\n /**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\n\n /**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\n\n /**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\n\n /**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\n\n /**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\n\n /**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<b><%- value %></b>');\n * compiled({ 'value': '<script>' });\n * // => '<b><script></b>'\n *\n * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the internal `print` function in \"evaluate\" delimiters.\n * var compiled = _.template('<% print(\"hello \" + user); %>!');\n * compiled({ 'user': 'barney' });\n * // => 'hello barney!'\n *\n * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n * // Disable support by replacing the \"interpolate\" delimiter.\n * var compiled = _.template('hello ${ user }!');\n * compiled({ 'user': 'pebbles' });\n * // => 'hello pebbles!'\n *\n * // Use backslashes to treat delimiters as plain text.\n * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n * compiled({ 'value': 'ignored' });\n * // => '<%- value %>'\n *\n * // Use the `imports` option to import `jQuery` as `jq`.\n * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n * compiled(data);\n * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n *\n * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n * compiled.source;\n * // => function(data) {\n * // var __t, __p = '';\n * // __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n * // return __p;\n * // }\n *\n * // Use custom template delimiters.\n * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n * var compiled = _.template('hello {{ user }}!');\n * compiled({ 'user': 'mustache' });\n * // => 'hello mustache!'\n *\n * // Use the `source` property to inline compiled templates for meaningful\n * // line numbers in error messages and stack traces.\n * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n * var JST = {\\\n * \"main\": ' + _.template(mainText).source + '\\\n * };\\\n * ');\n */\n function template(string, options, guard) {\n // Based on John Resig's `tmpl` implementation\n // (http://ejohn.org/blog/javascript-micro-templating/)\n // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n var settings = lodash.templateSettings;\n\n if (guard && isIterateeCall(string, options, guard)) {\n options = undefined;\n }\n string = toString(string);\n options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n importsKeys = keys(imports),\n importsValues = baseValues(imports, importsKeys);\n\n var isEscaping,\n isEvaluating,\n index = 0,\n interpolate = options.interpolate || reNoMatch,\n source = \"__p += '\";\n\n // Compile the regexp to match each delimiter.\n var reDelimiters = RegExp(\n (options.escape || reNoMatch).source + '|' +\n interpolate.source + '|' +\n (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n (options.evaluate || reNoMatch).source + '|$'\n , 'g');\n\n // Use a sourceURL for easier debugging.\n // The sourceURL gets injected into the source that's eval-ed, so be careful\n // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n // and escape the comment, thus injecting code that gets evaled.\n var sourceURL = '//# sourceURL=' +\n (hasOwnProperty.call(options, 'sourceURL')\n ? (options.sourceURL + '').replace(/\\s/g, ' ')\n : ('lodash.templateSources[' + (++templateCounter) + ']')\n ) + '\\n';\n\n string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n interpolateValue || (interpolateValue = esTemplateValue);\n\n // Escape characters that can't be included in string literals.\n source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n // Replace delimiters with snippets.\n if (escapeValue) {\n isEscaping = true;\n source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n }\n if (evaluateValue) {\n isEvaluating = true;\n source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n }\n if (interpolateValue) {\n source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n }\n index = offset + match.length;\n\n // The JS engine embedded in Adobe products needs `match` returned in\n // order to produce the correct `offset` value.\n return match;\n });\n\n source += \"';\\n\";\n\n // If `variable` is not specified wrap a with-statement around the generated\n // code to add the data object to the top of the scope chain.\n var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n if (!variable) {\n source = 'with (obj) {\\n' + source + '\\n}\\n';\n }\n // Throw an error if a forbidden character was found in `variable`, to prevent\n // potential command injection attacks.\n else if (reForbiddenIdentifierChars.test(variable)) {\n throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n }\n\n // Cleanup code by stripping empty strings.\n source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n .replace(reEmptyStringMiddle, '$1')\n .replace(reEmptyStringTrailing, '$1;');\n\n // Frame code as the function body.\n source = 'function(' + (variable || 'obj') + ') {\\n' +\n (variable\n ? ''\n : 'obj || (obj = {});\\n'\n ) +\n \"var __t, __p = ''\" +\n (isEscaping\n ? ', __e = _.escape'\n : ''\n ) +\n (isEvaluating\n ? ', __j = Array.prototype.join;\\n' +\n \"function print() { __p += __j.call(arguments, '') }\\n\"\n : ';\\n'\n ) +\n source +\n 'return __p\\n}';\n\n var result = attempt(function() {\n return Function(importsKeys, sourceURL + 'return ' + source)\n .apply(undefined, importsValues);\n });\n\n // Provide the compiled function's source by its `toString` method or\n // the `source` property as a convenience for inlining compiled templates.\n result.source = source;\n if (isError(result)) {\n throw result;\n }\n return result;\n }\n\n /**\n * Converts `string`, as a whole, to lower case just like\n * [String#toLowerCase](https://mdn.io/toLowerCase).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.toLower('--Foo-Bar--');\n * // => '--foo-bar--'\n *\n * _.toLower('fooBar');\n * // => 'foobar'\n *\n * _.toLower('__FOO_BAR__');\n * // => '__foo_bar__'\n */\n function toLower(value) {\n return toString(value).toLowerCase();\n }\n\n /**\n * Converts `string`, as a whole, to upper case just like\n * [String#toUpperCase](https://mdn.io/toUpperCase).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the upper cased string.\n * @example\n *\n * _.toUpper('--foo-bar--');\n * // => '--FOO-BAR--'\n *\n * _.toUpper('fooBar');\n * // => 'FOOBAR'\n *\n * _.toUpper('__foo_bar__');\n * // => '__FOO_BAR__'\n */\n function toUpper(value) {\n return toString(value).toUpperCase();\n }\n\n /**\n * Removes leading and trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trim(' abc ');\n * // => 'abc'\n *\n * _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n *\n * _.map([' foo ', ' bar '], _.trim);\n * // => ['foo', 'bar']\n */\n function trim(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return baseTrim(string);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n chrSymbols = stringToArray(chars),\n start = charsStartIndex(strSymbols, chrSymbols),\n end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n return castSlice(strSymbols, start, end).join('');\n }\n\n /**\n * Removes trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimEnd(' abc ');\n * // => ' abc'\n *\n * _.trimEnd('-_-abc-_-', '_-');\n * // => '-_-abc'\n */\n function trimEnd(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.slice(0, trimmedEndIndex(string) + 1);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n return castSlice(strSymbols, 0, end).join('');\n }\n\n /**\n * Removes leading whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimStart(' abc ');\n * // => 'abc '\n *\n * _.trimStart('-_-abc-_-', '_-');\n * // => 'abc-_-'\n */\n function trimStart(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.replace(reTrimStart, '');\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n start = charsStartIndex(strSymbols, stringToArray(chars));\n\n return castSlice(strSymbols, start).join('');\n }\n\n /**\n * Truncates `string` if it's longer than the given maximum string length.\n * The last characters of the truncated string are replaced with the omission\n * string which defaults to \"...\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to truncate.\n * @param {Object} [options={}] The options object.\n * @param {number} [options.length=30] The maximum string length.\n * @param {string} [options.omission='...'] The string to indicate text is omitted.\n * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n * @returns {string} Returns the truncated string.\n * @example\n *\n * _.truncate('hi-diddly-ho there, neighborino');\n * // => 'hi-diddly-ho there, neighbo...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': ' '\n * });\n * // => 'hi-diddly-ho there,...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': /,? +/\n * });\n * // => 'hi-diddly-ho there...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'omission': ' [...]'\n * });\n * // => 'hi-diddly-ho there, neig [...]'\n */\n function truncate(string, options) {\n var length = DEFAULT_TRUNC_LENGTH,\n omission = DEFAULT_TRUNC_OMISSION;\n\n if (isObject(options)) {\n var separator = 'separator' in options ? options.separator : separator;\n length = 'length' in options ? toInteger(options.length) : length;\n omission = 'omission' in options ? baseToString(options.omission) : omission;\n }\n string = toString(string);\n\n var strLength = string.length;\n if (hasUnicode(string)) {\n var strSymbols = stringToArray(string);\n strLength = strSymbols.length;\n }\n if (length >= strLength) {\n return string;\n }\n var end = length - stringSize(omission);\n if (end < 1) {\n return omission;\n }\n var result = strSymbols\n ? castSlice(strSymbols, 0, end).join('')\n : string.slice(0, end);\n\n if (separator === undefined) {\n return result + omission;\n }\n if (strSymbols) {\n end += (result.length - end);\n }\n if (isRegExp(separator)) {\n if (string.slice(end).search(separator)) {\n var match,\n substring = result;\n\n if (!separator.global) {\n separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n }\n separator.lastIndex = 0;\n while ((match = separator.exec(substring))) {\n var newEnd = match.index;\n }\n result = result.slice(0, newEnd === undefined ? end : newEnd);\n }\n } else if (string.indexOf(baseToString(separator), end) != end) {\n var index = result.lastIndexOf(separator);\n if (index > -1) {\n result = result.slice(0, index);\n }\n }\n return result + omission;\n }\n\n /**\n * The inverse of `_.escape`; this method converts the HTML entities\n * `&`, `<`, `>`, `"`, and `'` in `string` to\n * their corresponding characters.\n *\n * **Note:** No other HTML entities are unescaped. To unescape additional\n * HTML entities use a third-party library like [_he_](https://mths.be/he).\n *\n * @static\n * @memberOf _\n * @since 0.6.0\n * @category String\n * @param {string} [string=''] The string to unescape.\n * @returns {string} Returns the unescaped string.\n * @example\n *\n * _.unescape('fred, barney, & pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function unescape(string) {\n string = toString(string);\n return (string && reHasEscapedHtml.test(string))\n ? string.replace(reEscapedHtml, unescapeHtmlChar)\n : string;\n }\n\n /**\n * Converts `string`, as space separated words, to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the upper cased string.\n * @example\n *\n * _.upperCase('--foo-bar');\n * // => 'FOO BAR'\n *\n * _.upperCase('fooBar');\n * // => 'FOO BAR'\n *\n * _.upperCase('__foo_bar__');\n * // => 'FOO BAR'\n */\n var upperCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toUpperCase();\n });\n\n /**\n * Converts the first character of `string` to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.upperFirst('fred');\n * // => 'Fred'\n *\n * _.upperFirst('FRED');\n * // => 'FRED'\n */\n var upperFirst = createCaseFirst('toUpperCase');\n\n /**\n * Splits `string` into an array of its words.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {RegExp|string} [pattern] The pattern to match words.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the words of `string`.\n * @example\n *\n * _.words('fred, barney, & pebbles');\n * // => ['fred', 'barney', 'pebbles']\n *\n * _.words('fred, barney, & pebbles', /[^, ]+/g);\n * // => ['fred', 'barney', '&', 'pebbles']\n */\n function words(string, pattern, guard) {\n string = toString(string);\n pattern = guard ? undefined : pattern;\n\n if (pattern === undefined) {\n return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n }\n return string.match(pattern) || [];\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Attempts to invoke `func`, returning either the result or the caught error\n * object. Any additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Function} func The function to attempt.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {*} Returns the `func` result or error object.\n * @example\n *\n * // Avoid throwing errors for invalid selectors.\n * var elements = _.attempt(function(selector) {\n * return document.querySelectorAll(selector);\n * }, '>_>');\n *\n * if (_.isError(elements)) {\n * elements = [];\n * }\n */\n var attempt = baseRest(function(func, args) {\n try {\n return apply(func, undefined, args);\n } catch (e) {\n return isError(e) ? e : new Error(e);\n }\n });\n\n /**\n * Binds methods of an object to the object itself, overwriting the existing\n * method.\n *\n * **Note:** This method doesn't set the \"length\" property of bound functions.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Object} object The object to bind and assign the bound methods to.\n * @param {...(string|string[])} methodNames The object method names to bind.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var view = {\n * 'label': 'docs',\n * 'click': function() {\n * console.log('clicked ' + this.label);\n * }\n * };\n *\n * _.bindAll(view, ['click']);\n * jQuery(element).on('click', view.click);\n * // => Logs 'clicked docs' when clicked.\n */\n var bindAll = flatRest(function(object, methodNames) {\n arrayEach(methodNames, function(key) {\n key = toKey(key);\n baseAssignValue(object, key, bind(object[key], object));\n });\n return object;\n });\n\n /**\n * Creates a function that iterates over `pairs` and invokes the corresponding\n * function of the first predicate to return truthy. The predicate-function\n * pairs are invoked with the `this` binding and arguments of the created\n * function.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Array} pairs The predicate-function pairs.\n * @returns {Function} Returns the new composite function.\n * @example\n *\n * var func = _.cond([\n * [_.matches({ 'a': 1 }), _.constant('matches A')],\n * [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n * [_.stubTrue, _.constant('no match')]\n * ]);\n *\n * func({ 'a': 1, 'b': 2 });\n * // => 'matches A'\n *\n * func({ 'a': 0, 'b': 1 });\n * // => 'matches B'\n *\n * func({ 'a': '1', 'b': '2' });\n * // => 'no match'\n */\n function cond(pairs) {\n var length = pairs == null ? 0 : pairs.length,\n toIteratee = getIteratee();\n\n pairs = !length ? [] : arrayMap(pairs, function(pair) {\n if (typeof pair[1] != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return [toIteratee(pair[0]), pair[1]];\n });\n\n return baseRest(function(args) {\n var index = -1;\n while (++index < length) {\n var pair = pairs[index];\n if (apply(pair[0], this, args)) {\n return apply(pair[1], this, args);\n }\n }\n });\n }\n\n /**\n * Creates a function that invokes the predicate properties of `source` with\n * the corresponding property values of a given object, returning `true` if\n * all predicates return truthy, else `false`.\n *\n * **Note:** The created function is equivalent to `_.conformsTo` with\n * `source` partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 2, 'b': 1 },\n * { 'a': 1, 'b': 2 }\n * ];\n *\n * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n * // => [{ 'a': 1, 'b': 2 }]\n */\n function conforms(source) {\n return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\n function constant(value) {\n return function() {\n return value;\n };\n }\n\n /**\n * Checks `value` to determine whether a default value should be returned in\n * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n * or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Util\n * @param {*} value The value to check.\n * @param {*} defaultValue The default value.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * _.defaultTo(1, 10);\n * // => 1\n *\n * _.defaultTo(undefined, 10);\n * // => 10\n */\n function defaultTo(value, defaultValue) {\n return (value == null || value !== value) ? defaultValue : value;\n }\n\n /**\n * Creates a function that returns the result of invoking the given functions\n * with the `this` binding of the created function, where each successive\n * invocation is supplied the return value of the previous.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flowRight\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flow([_.add, square]);\n * addSquare(1, 2);\n * // => 9\n */\n var flow = createFlow();\n\n /**\n * This method is like `_.flow` except that it creates a function that\n * invokes the given functions from right to left.\n *\n * @static\n * @since 3.0.0\n * @memberOf _\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flow\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flowRight([square, _.add]);\n * addSquare(1, 2);\n * // => 9\n */\n var flowRight = createFlow(true);\n\n /**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\n function identity(value) {\n return value;\n }\n\n /**\n * Creates a function that invokes `func` with the arguments of the created\n * function. If `func` is a property name, the created function returns the\n * property value for a given element. If `func` is an array or object, the\n * created function returns `true` for elements that contain the equivalent\n * source properties, otherwise it returns `false`.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Util\n * @param {*} [func=_.identity] The value to convert to a callback.\n * @returns {Function} Returns the callback.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, _.iteratee(['user', 'fred']));\n * // => [{ 'user': 'fred', 'age': 40 }]\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, _.iteratee('user'));\n * // => ['barney', 'fred']\n *\n * // Create custom iteratee shorthands.\n * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n * return !_.isRegExp(func) ? iteratee(func) : function(string) {\n * return func.test(string);\n * };\n * });\n *\n * _.filter(['abc', 'def'], /ef/);\n * // => ['def']\n */\n function iteratee(func) {\n return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between a given\n * object and `source`, returning `true` if the given object has equivalent\n * property values, else `false`.\n *\n * **Note:** The created function is equivalent to `_.isMatch` with `source`\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matches(source) {\n return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between the\n * value at `path` of a given object to `srcValue`, returning `true` if the\n * object value is equivalent, else `false`.\n *\n * **Note:** Partial comparisons will match empty array and empty object\n * `srcValue` values against any array or object value, respectively. See\n * `_.isEqual` for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.find(objects, _.matchesProperty('a', 4));\n * // => { 'a': 4, 'b': 5, 'c': 6 }\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matchesProperty(path, srcValue) {\n return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that invokes the method at `path` of a given object.\n * Any additional arguments are provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': _.constant(2) } },\n * { 'a': { 'b': _.constant(1) } }\n * ];\n *\n * _.map(objects, _.method('a.b'));\n * // => [2, 1]\n *\n * _.map(objects, _.method(['a', 'b']));\n * // => [2, 1]\n */\n var method = baseRest(function(path, args) {\n return function(object) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * The opposite of `_.method`; this method creates a function that invokes\n * the method at a given path of `object`. Any additional arguments are\n * provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Object} object The object to query.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var array = _.times(3, _.constant),\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n * // => [2, 0]\n */\n var methodOf = baseRest(function(object, args) {\n return function(path) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * Adds all own enumerable string keyed function properties of a source\n * object to the destination object. If `object` is a function, then methods\n * are added to its prototype as well.\n *\n * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n * avoid conflicts caused by modifying the original.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Function|Object} [object=lodash] The destination object.\n * @param {Object} source The object of functions to add.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n * @returns {Function|Object} Returns `object`.\n * @example\n *\n * function vowels(string) {\n * return _.filter(string, function(v) {\n * return /[aeiou]/i.test(v);\n * });\n * }\n *\n * _.mixin({ 'vowels': vowels });\n * _.vowels('fred');\n * // => ['e']\n *\n * _('fred').vowels().value();\n * // => ['e']\n *\n * _.mixin({ 'vowels': vowels }, { 'chain': false });\n * _('fred').vowels();\n * // => ['e']\n */\n function mixin(object, source, options) {\n var props = keys(source),\n methodNames = baseFunctions(source, props);\n\n if (options == null &&\n !(isObject(source) && (methodNames.length || !props.length))) {\n options = source;\n source = object;\n object = this;\n methodNames = baseFunctions(source, keys(source));\n }\n var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n isFunc = isFunction(object);\n\n arrayEach(methodNames, function(methodName) {\n var func = source[methodName];\n object[methodName] = func;\n if (isFunc) {\n object.prototype[methodName] = function() {\n var chainAll = this.__chain__;\n if (chain || chainAll) {\n var result = object(this.__wrapped__),\n actions = result.__actions__ = copyArray(this.__actions__);\n\n actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n result.__chain__ = chainAll;\n return result;\n }\n return func.apply(object, arrayPush([this.value()], arguments));\n };\n }\n });\n\n return object;\n }\n\n /**\n * Reverts the `_` variable to its previous value and returns a reference to\n * the `lodash` function.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @returns {Function} Returns the `lodash` function.\n * @example\n *\n * var lodash = _.noConflict();\n */\n function noConflict() {\n if (root._ === this) {\n root._ = oldDash;\n }\n return this;\n }\n\n /**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\n function noop() {\n // No operation performed.\n }\n\n /**\n * Creates a function that gets the argument at index `n`. If `n` is negative,\n * the nth argument from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [n=0] The index of the argument to return.\n * @returns {Function} Returns the new pass-thru function.\n * @example\n *\n * var func = _.nthArg(1);\n * func('a', 'b', 'c', 'd');\n * // => 'b'\n *\n * var func = _.nthArg(-2);\n * func('a', 'b', 'c', 'd');\n * // => 'c'\n */\n function nthArg(n) {\n n = toInteger(n);\n return baseRest(function(args) {\n return baseNth(args, n);\n });\n }\n\n /**\n * Creates a function that invokes `iteratees` with the arguments it receives\n * and returns their results.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to invoke.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.over([Math.max, Math.min]);\n *\n * func(1, 2, 3, 4);\n * // => [4, 1]\n */\n var over = createOver(arrayMap);\n\n /**\n * Creates a function that checks if **all** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overEvery([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => false\n *\n * func(NaN);\n * // => false\n */\n var overEvery = createOver(arrayEvery);\n\n /**\n * Creates a function that checks if **any** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overSome([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => true\n *\n * func(NaN);\n * // => false\n *\n * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n */\n var overSome = createOver(arraySome);\n\n /**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': 2 } },\n * { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\n function property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n }\n\n /**\n * The opposite of `_.property`; this method creates a function that returns\n * the value at a given path of `object`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var array = [0, 1, 2],\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n * // => [2, 0]\n */\n function propertyOf(object) {\n return function(path) {\n return object == null ? undefined : baseGet(object, path);\n };\n }\n\n /**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\n var range = createRange();\n\n /**\n * This method is like `_.range` except that it populates values in\n * descending order.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.range\n * @example\n *\n * _.rangeRight(4);\n * // => [3, 2, 1, 0]\n *\n * _.rangeRight(-4);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 5);\n * // => [4, 3, 2, 1]\n *\n * _.rangeRight(0, 20, 5);\n * // => [15, 10, 5, 0]\n *\n * _.rangeRight(0, -4, -1);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.rangeRight(0);\n * // => []\n */\n var rangeRight = createRange(true);\n\n /**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\n function stubArray() {\n return [];\n }\n\n /**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\n function stubFalse() {\n return false;\n }\n\n /**\n * This method returns a new empty object.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Object} Returns the new empty object.\n * @example\n *\n * var objects = _.times(2, _.stubObject);\n *\n * console.log(objects);\n * // => [{}, {}]\n *\n * console.log(objects[0] === objects[1]);\n * // => false\n */\n function stubObject() {\n return {};\n }\n\n /**\n * This method returns an empty string.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {string} Returns the empty string.\n * @example\n *\n * _.times(2, _.stubString);\n * // => ['', '']\n */\n function stubString() {\n return '';\n }\n\n /**\n * This method returns `true`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `true`.\n * @example\n *\n * _.times(2, _.stubTrue);\n * // => [true, true]\n */\n function stubTrue() {\n return true;\n }\n\n /**\n * Invokes the iteratee `n` times, returning an array of the results of\n * each invocation. The iteratee is invoked with one argument; (index).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.times(3, String);\n * // => ['0', '1', '2']\n *\n * _.times(4, _.constant(0));\n * // => [0, 0, 0, 0]\n */\n function times(n, iteratee) {\n n = toInteger(n);\n if (n < 1 || n > MAX_SAFE_INTEGER) {\n return [];\n }\n var index = MAX_ARRAY_LENGTH,\n length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n iteratee = getIteratee(iteratee);\n n -= MAX_ARRAY_LENGTH;\n\n var result = baseTimes(length, iteratee);\n while (++index < n) {\n iteratee(index);\n }\n return result;\n }\n\n /**\n * Converts `value` to a property path array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {*} value The value to convert.\n * @returns {Array} Returns the new property path array.\n * @example\n *\n * _.toPath('a.b.c');\n * // => ['a', 'b', 'c']\n *\n * _.toPath('a[0].b.c');\n * // => ['a', '0', 'b', 'c']\n */\n function toPath(value) {\n if (isArray(value)) {\n return arrayMap(value, toKey);\n }\n return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n }\n\n /**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\n function uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Adds two numbers.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {number} augend The first number in an addition.\n * @param {number} addend The second number in an addition.\n * @returns {number} Returns the total.\n * @example\n *\n * _.add(6, 4);\n * // => 10\n */\n var add = createMathOperation(function(augend, addend) {\n return augend + addend;\n }, 0);\n\n /**\n * Computes `number` rounded up to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round up.\n * @param {number} [precision=0] The precision to round up to.\n * @returns {number} Returns the rounded up number.\n * @example\n *\n * _.ceil(4.006);\n * // => 5\n *\n * _.ceil(6.004, 2);\n * // => 6.01\n *\n * _.ceil(6040, -2);\n * // => 6100\n */\n var ceil = createRound('ceil');\n\n /**\n * Divide two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} dividend The first number in a division.\n * @param {number} divisor The second number in a division.\n * @returns {number} Returns the quotient.\n * @example\n *\n * _.divide(6, 4);\n * // => 1.5\n */\n var divide = createMathOperation(function(dividend, divisor) {\n return dividend / divisor;\n }, 1);\n\n /**\n * Computes `number` rounded down to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round down.\n * @param {number} [precision=0] The precision to round down to.\n * @returns {number} Returns the rounded down number.\n * @example\n *\n * _.floor(4.006);\n * // => 4\n *\n * _.floor(0.046, 2);\n * // => 0.04\n *\n * _.floor(4060, -2);\n * // => 4000\n */\n var floor = createRound('floor');\n\n /**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\n function max(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseGt)\n : undefined;\n }\n\n /**\n * This method is like `_.max` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.maxBy(objects, function(o) { return o.n; });\n * // => { 'n': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.maxBy(objects, 'n');\n * // => { 'n': 2 }\n */\n function maxBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n : undefined;\n }\n\n /**\n * Computes the mean of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the mean.\n * @example\n *\n * _.mean([4, 2, 8, 6]);\n * // => 5\n */\n function mean(array) {\n return baseMean(array, identity);\n }\n\n /**\n * This method is like `_.mean` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be averaged.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the mean.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.meanBy(objects, function(o) { return o.n; });\n * // => 5\n *\n * // The `_.property` iteratee shorthand.\n * _.meanBy(objects, 'n');\n * // => 5\n */\n function meanBy(array, iteratee) {\n return baseMean(array, getIteratee(iteratee, 2));\n }\n\n /**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\n function min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n }\n\n /**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\n function minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n : undefined;\n }\n\n /**\n * Multiply two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} multiplier The first number in a multiplication.\n * @param {number} multiplicand The second number in a multiplication.\n * @returns {number} Returns the product.\n * @example\n *\n * _.multiply(6, 4);\n * // => 24\n */\n var multiply = createMathOperation(function(multiplier, multiplicand) {\n return multiplier * multiplicand;\n }, 1);\n\n /**\n * Computes `number` rounded to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round.\n * @param {number} [precision=0] The precision to round to.\n * @returns {number} Returns the rounded number.\n * @example\n *\n * _.round(4.006);\n * // => 4\n *\n * _.round(4.006, 2);\n * // => 4.01\n *\n * _.round(4060, -2);\n * // => 4100\n */\n var round = createRound('round');\n\n /**\n * Subtract two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {number} minuend The first number in a subtraction.\n * @param {number} subtrahend The second number in a subtraction.\n * @returns {number} Returns the difference.\n * @example\n *\n * _.subtract(6, 4);\n * // => 2\n */\n var subtract = createMathOperation(function(minuend, subtrahend) {\n return minuend - subtrahend;\n }, 0);\n\n /**\n * Computes the sum of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the sum.\n * @example\n *\n * _.sum([4, 2, 8, 6]);\n * // => 20\n */\n function sum(array) {\n return (array && array.length)\n ? baseSum(array, identity)\n : 0;\n }\n\n /**\n * This method is like `_.sum` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be summed.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the sum.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.sumBy(objects, function(o) { return o.n; });\n * // => 20\n *\n * // The `_.property` iteratee shorthand.\n * _.sumBy(objects, 'n');\n * // => 20\n */\n function sumBy(array, iteratee) {\n return (array && array.length)\n ? baseSum(array, getIteratee(iteratee, 2))\n : 0;\n }\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return wrapped values in chain sequences.\n lodash.after = after;\n lodash.ary = ary;\n lodash.assign = assign;\n lodash.assignIn = assignIn;\n lodash.assignInWith = assignInWith;\n lodash.assignWith = assignWith;\n lodash.at = at;\n lodash.before = before;\n lodash.bind = bind;\n lodash.bindAll = bindAll;\n lodash.bindKey = bindKey;\n lodash.castArray = castArray;\n lodash.chain = chain;\n lodash.chunk = chunk;\n lodash.compact = compact;\n lodash.concat = concat;\n lodash.cond = cond;\n lodash.conforms = conforms;\n lodash.constant = constant;\n lodash.countBy = countBy;\n lodash.create = create;\n lodash.curry = curry;\n lodash.curryRight = curryRight;\n lodash.debounce = debounce;\n lodash.defaults = defaults;\n lodash.defaultsDeep = defaultsDeep;\n lodash.defer = defer;\n lodash.delay = delay;\n lodash.difference = difference;\n lodash.differenceBy = differenceBy;\n lodash.differenceWith = differenceWith;\n lodash.drop = drop;\n lodash.dropRight = dropRight;\n lodash.dropRightWhile = dropRightWhile;\n lodash.dropWhile = dropWhile;\n lodash.fill = fill;\n lodash.filter = filter;\n lodash.flatMap = flatMap;\n lodash.flatMapDeep = flatMapDeep;\n lodash.flatMapDepth = flatMapDepth;\n lodash.flatten = flatten;\n lodash.flattenDeep = flattenDeep;\n lodash.flattenDepth = flattenDepth;\n lodash.flip = flip;\n lodash.flow = flow;\n lodash.flowRight = flowRight;\n lodash.fromPairs = fromPairs;\n lodash.functions = functions;\n lodash.functionsIn = functionsIn;\n lodash.groupBy = groupBy;\n lodash.initial = initial;\n lodash.intersection = intersection;\n lodash.intersectionBy = intersectionBy;\n lodash.intersectionWith = intersectionWith;\n lodash.invert = invert;\n lodash.invertBy = invertBy;\n lodash.invokeMap = invokeMap;\n lodash.iteratee = iteratee;\n lodash.keyBy = keyBy;\n lodash.keys = keys;\n lodash.keysIn = keysIn;\n lodash.map = map;\n lodash.mapKeys = mapKeys;\n lodash.mapValues = mapValues;\n lodash.matches = matches;\n lodash.matchesProperty = matchesProperty;\n lodash.memoize = memoize;\n lodash.merge = merge;\n lodash.mergeWith = mergeWith;\n lodash.method = method;\n lodash.methodOf = methodOf;\n lodash.mixin = mixin;\n lodash.negate = negate;\n lodash.nthArg = nthArg;\n lodash.omit = omit;\n lodash.omitBy = omitBy;\n lodash.once = once;\n lodash.orderBy = orderBy;\n lodash.over = over;\n lodash.overArgs = overArgs;\n lodash.overEvery = overEvery;\n lodash.overSome = overSome;\n lodash.partial = partial;\n lodash.partialRight = partialRight;\n lodash.partition = partition;\n lodash.pick = pick;\n lodash.pickBy = pickBy;\n lodash.property = property;\n lodash.propertyOf = propertyOf;\n lodash.pull = pull;\n lodash.pullAll = pullAll;\n lodash.pullAllBy = pullAllBy;\n lodash.pullAllWith = pullAllWith;\n lodash.pullAt = pullAt;\n lodash.range = range;\n lodash.rangeRight = rangeRight;\n lodash.rearg = rearg;\n lodash.reject = reject;\n lodash.remove = remove;\n lodash.rest = rest;\n lodash.reverse = reverse;\n lodash.sampleSize = sampleSize;\n lodash.set = set;\n lodash.setWith = setWith;\n lodash.shuffle = shuffle;\n lodash.slice = slice;\n lodash.sortBy = sortBy;\n lodash.sortedUniq = sortedUniq;\n lodash.sortedUniqBy = sortedUniqBy;\n lodash.split = split;\n lodash.spread = spread;\n lodash.tail = tail;\n lodash.take = take;\n lodash.takeRight = takeRight;\n lodash.takeRightWhile = takeRightWhile;\n lodash.takeWhile = takeWhile;\n lodash.tap = tap;\n lodash.throttle = throttle;\n lodash.thru = thru;\n lodash.toArray = toArray;\n lodash.toPairs = toPairs;\n lodash.toPairsIn = toPairsIn;\n lodash.toPath = toPath;\n lodash.toPlainObject = toPlainObject;\n lodash.transform = transform;\n lodash.unary = unary;\n lodash.union = union;\n lodash.unionBy = unionBy;\n lodash.unionWith = unionWith;\n lodash.uniq = uniq;\n lodash.uniqBy = uniqBy;\n lodash.uniqWith = uniqWith;\n lodash.unset = unset;\n lodash.unzip = unzip;\n lodash.unzipWith = unzipWith;\n lodash.update = update;\n lodash.updateWith = updateWith;\n lodash.values = values;\n lodash.valuesIn = valuesIn;\n lodash.without = without;\n lodash.words = words;\n lodash.wrap = wrap;\n lodash.xor = xor;\n lodash.xorBy = xorBy;\n lodash.xorWith = xorWith;\n lodash.zip = zip;\n lodash.zipObject = zipObject;\n lodash.zipObjectDeep = zipObjectDeep;\n lodash.zipWith = zipWith;\n\n // Add aliases.\n lodash.entries = toPairs;\n lodash.entriesIn = toPairsIn;\n lodash.extend = assignIn;\n lodash.extendWith = assignInWith;\n\n // Add methods to `lodash.prototype`.\n mixin(lodash, lodash);\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return unwrapped values in chain sequences.\n lodash.add = add;\n lodash.attempt = attempt;\n lodash.camelCase = camelCase;\n lodash.capitalize = capitalize;\n lodash.ceil = ceil;\n lodash.clamp = clamp;\n lodash.clone = clone;\n lodash.cloneDeep = cloneDeep;\n lodash.cloneDeepWith = cloneDeepWith;\n lodash.cloneWith = cloneWith;\n lodash.conformsTo = conformsTo;\n lodash.deburr = deburr;\n lodash.defaultTo = defaultTo;\n lodash.divide = divide;\n lodash.endsWith = endsWith;\n lodash.eq = eq;\n lodash.escape = escape;\n lodash.escapeRegExp = escapeRegExp;\n lodash.every = every;\n lodash.find = find;\n lodash.findIndex = findIndex;\n lodash.findKey = findKey;\n lodash.findLast = findLast;\n lodash.findLastIndex = findLastIndex;\n lodash.findLastKey = findLastKey;\n lodash.floor = floor;\n lodash.forEach = forEach;\n lodash.forEachRight = forEachRight;\n lodash.forIn = forIn;\n lodash.forInRight = forInRight;\n lodash.forOwn = forOwn;\n lodash.forOwnRight = forOwnRight;\n lodash.get = get;\n lodash.gt = gt;\n lodash.gte = gte;\n lodash.has = has;\n lodash.hasIn = hasIn;\n lodash.head = head;\n lodash.identity = identity;\n lodash.includes = includes;\n lodash.indexOf = indexOf;\n lodash.inRange = inRange;\n lodash.invoke = invoke;\n lodash.isArguments = isArguments;\n lodash.isArray = isArray;\n lodash.isArrayBuffer = isArrayBuffer;\n lodash.isArrayLike = isArrayLike;\n lodash.isArrayLikeObject = isArrayLikeObject;\n lodash.isBoolean = isBoolean;\n lodash.isBuffer = isBuffer;\n lodash.isDate = isDate;\n lodash.isElement = isElement;\n lodash.isEmpty = isEmpty;\n lodash.isEqual = isEqual;\n lodash.isEqualWith = isEqualWith;\n lodash.isError = isError;\n lodash.isFinite = isFinite;\n lodash.isFunction = isFunction;\n lodash.isInteger = isInteger;\n lodash.isLength = isLength;\n lodash.isMap = isMap;\n lodash.isMatch = isMatch;\n lodash.isMatchWith = isMatchWith;\n lodash.isNaN = isNaN;\n lodash.isNative = isNative;\n lodash.isNil = isNil;\n lodash.isNull = isNull;\n lodash.isNumber = isNumber;\n lodash.isObject = isObject;\n lodash.isObjectLike = isObjectLike;\n lodash.isPlainObject = isPlainObject;\n lodash.isRegExp = isRegExp;\n lodash.isSafeInteger = isSafeInteger;\n lodash.isSet = isSet;\n lodash.isString = isString;\n lodash.isSymbol = isSymbol;\n lodash.isTypedArray = isTypedArray;\n lodash.isUndefined = isUndefined;\n lodash.isWeakMap = isWeakMap;\n lodash.isWeakSet = isWeakSet;\n lodash.join = join;\n lodash.kebabCase = kebabCase;\n lodash.last = last;\n lodash.lastIndexOf = lastIndexOf;\n lodash.lowerCase = lowerCase;\n lodash.lowerFirst = lowerFirst;\n lodash.lt = lt;\n lodash.lte = lte;\n lodash.max = max;\n lodash.maxBy = maxBy;\n lodash.mean = mean;\n lodash.meanBy = meanBy;\n lodash.min = min;\n lodash.minBy = minBy;\n lodash.stubArray = stubArray;\n lodash.stubFalse = stubFalse;\n lodash.stubObject = stubObject;\n lodash.stubString = stubString;\n lodash.stubTrue = stubTrue;\n lodash.multiply = multiply;\n lodash.nth = nth;\n lodash.noConflict = noConflict;\n lodash.noop = noop;\n lodash.now = now;\n lodash.pad = pad;\n lodash.padEnd = padEnd;\n lodash.padStart = padStart;\n lodash.parseInt = parseInt;\n lodash.random = random;\n lodash.reduce = reduce;\n lodash.reduceRight = reduceRight;\n lodash.repeat = repeat;\n lodash.replace = replace;\n lodash.result = result;\n lodash.round = round;\n lodash.runInContext = runInContext;\n lodash.sample = sample;\n lodash.size = size;\n lodash.snakeCase = snakeCase;\n lodash.some = some;\n lodash.sortedIndex = sortedIndex;\n lodash.sortedIndexBy = sortedIndexBy;\n lodash.sortedIndexOf = sortedIndexOf;\n lodash.sortedLastIndex = sortedLastIndex;\n lodash.sortedLastIndexBy = sortedLastIndexBy;\n lodash.sortedLastIndexOf = sortedLastIndexOf;\n lodash.startCase = startCase;\n lodash.startsWith = startsWith;\n lodash.subtract = subtract;\n lodash.sum = sum;\n lodash.sumBy = sumBy;\n lodash.template = template;\n lodash.times = times;\n lodash.toFinite = toFinite;\n lodash.toInteger = toInteger;\n lodash.toLength = toLength;\n lodash.toLower = toLower;\n lodash.toNumber = toNumber;\n lodash.toSafeInteger = toSafeInteger;\n lodash.toString = toString;\n lodash.toUpper = toUpper;\n lodash.trim = trim;\n lodash.trimEnd = trimEnd;\n lodash.trimStart = trimStart;\n lodash.truncate = truncate;\n lodash.unescape = unescape;\n lodash.uniqueId = uniqueId;\n lodash.upperCase = upperCase;\n lodash.upperFirst = upperFirst;\n\n // Add aliases.\n lodash.each = forEach;\n lodash.eachRight = forEachRight;\n lodash.first = head;\n\n mixin(lodash, (function() {\n var source = {};\n baseForOwn(lodash, function(func, methodName) {\n if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n source[methodName] = func;\n }\n });\n return source;\n }()), { 'chain': false });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The semantic version number.\n *\n * @static\n * @memberOf _\n * @type {string}\n */\n lodash.VERSION = VERSION;\n\n // Assign default placeholders.\n arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n lodash[methodName].placeholder = lodash;\n });\n\n // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n arrayEach(['drop', 'take'], function(methodName, index) {\n LazyWrapper.prototype[methodName] = function(n) {\n n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n var result = (this.__filtered__ && !index)\n ? new LazyWrapper(this)\n : this.clone();\n\n if (result.__filtered__) {\n result.__takeCount__ = nativeMin(n, result.__takeCount__);\n } else {\n result.__views__.push({\n 'size': nativeMin(n, MAX_ARRAY_LENGTH),\n 'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n });\n }\n return result;\n };\n\n LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n return this.reverse()[methodName](n).reverse();\n };\n });\n\n // Add `LazyWrapper` methods that accept an `iteratee` value.\n arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n var type = index + 1,\n isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n LazyWrapper.prototype[methodName] = function(iteratee) {\n var result = this.clone();\n result.__iteratees__.push({\n 'iteratee': getIteratee(iteratee, 3),\n 'type': type\n });\n result.__filtered__ = result.__filtered__ || isFilter;\n return result;\n };\n });\n\n // Add `LazyWrapper` methods for `_.head` and `_.last`.\n arrayEach(['head', 'last'], function(methodName, index) {\n var takeName = 'take' + (index ? 'Right' : '');\n\n LazyWrapper.prototype[methodName] = function() {\n return this[takeName](1).value()[0];\n };\n });\n\n // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n arrayEach(['initial', 'tail'], function(methodName, index) {\n var dropName = 'drop' + (index ? '' : 'Right');\n\n LazyWrapper.prototype[methodName] = function() {\n return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n };\n });\n\n LazyWrapper.prototype.compact = function() {\n return this.filter(identity);\n };\n\n LazyWrapper.prototype.find = function(predicate) {\n return this.filter(predicate).head();\n };\n\n LazyWrapper.prototype.findLast = function(predicate) {\n return this.reverse().find(predicate);\n };\n\n LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n if (typeof path == 'function') {\n return new LazyWrapper(this);\n }\n return this.map(function(value) {\n return baseInvoke(value, path, args);\n });\n });\n\n LazyWrapper.prototype.reject = function(predicate) {\n return this.filter(negate(getIteratee(predicate)));\n };\n\n LazyWrapper.prototype.slice = function(start, end) {\n start = toInteger(start);\n\n var result = this;\n if (result.__filtered__ && (start > 0 || end < 0)) {\n return new LazyWrapper(result);\n }\n if (start < 0) {\n result = result.takeRight(-start);\n } else if (start) {\n result = result.drop(start);\n }\n if (end !== undefined) {\n end = toInteger(end);\n result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n }\n return result;\n };\n\n LazyWrapper.prototype.takeRightWhile = function(predicate) {\n return this.reverse().takeWhile(predicate).reverse();\n };\n\n LazyWrapper.prototype.toArray = function() {\n return this.take(MAX_ARRAY_LENGTH);\n };\n\n // Add `LazyWrapper` methods to `lodash.prototype`.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n isTaker = /^(?:head|last)$/.test(methodName),\n lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n retUnwrapped = isTaker || /^find/.test(methodName);\n\n if (!lodashFunc) {\n return;\n }\n lodash.prototype[methodName] = function() {\n var value = this.__wrapped__,\n args = isTaker ? [1] : arguments,\n isLazy = value instanceof LazyWrapper,\n iteratee = args[0],\n useLazy = isLazy || isArray(value);\n\n var interceptor = function(value) {\n var result = lodashFunc.apply(lodash, arrayPush([value], args));\n return (isTaker && chainAll) ? result[0] : result;\n };\n\n if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n isLazy = useLazy = false;\n }\n var chainAll = this.__chain__,\n isHybrid = !!this.__actions__.length,\n isUnwrapped = retUnwrapped && !chainAll,\n onlyLazy = isLazy && !isHybrid;\n\n if (!retUnwrapped && useLazy) {\n value = onlyLazy ? value : new LazyWrapper(this);\n var result = func.apply(value, args);\n result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n return new LodashWrapper(result, chainAll);\n }\n if (isUnwrapped && onlyLazy) {\n return func.apply(this, args);\n }\n result = this.thru(interceptor);\n return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n };\n });\n\n // Add `Array` methods to `lodash.prototype`.\n arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n var func = arrayProto[methodName],\n chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n lodash.prototype[methodName] = function() {\n var args = arguments;\n if (retUnwrapped && !this.__chain__) {\n var value = this.value();\n return func.apply(isArray(value) ? value : [], args);\n }\n return this[chainName](function(value) {\n return func.apply(isArray(value) ? value : [], args);\n });\n };\n });\n\n // Map minified method names to their real names.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var lodashFunc = lodash[methodName];\n if (lodashFunc) {\n var key = lodashFunc.name + '';\n if (!hasOwnProperty.call(realNames, key)) {\n realNames[key] = [];\n }\n realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n }\n });\n\n realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n 'name': 'wrapper',\n 'func': undefined\n }];\n\n // Add methods to `LazyWrapper`.\n LazyWrapper.prototype.clone = lazyClone;\n LazyWrapper.prototype.reverse = lazyReverse;\n LazyWrapper.prototype.value = lazyValue;\n\n // Add chain sequence methods to the `lodash` wrapper.\n lodash.prototype.at = wrapperAt;\n lodash.prototype.chain = wrapperChain;\n lodash.prototype.commit = wrapperCommit;\n lodash.prototype.next = wrapperNext;\n lodash.prototype.plant = wrapperPlant;\n lodash.prototype.reverse = wrapperReverse;\n lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n // Add lazy aliases.\n lodash.prototype.first = lodash.prototype.head;\n\n if (symIterator) {\n lodash.prototype[symIterator] = wrapperToIterator;\n }\n return lodash;\n });\n\n /*--------------------------------------------------------------------------*/\n\n // Export lodash.\n var _ = runInContext();\n\n // Some AMD build optimizers, like r.js, check for condition patterns like:\n if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n // Expose Lodash on the global object to prevent errors when Lodash is\n // loaded by a script tag in the presence of an AMD loader.\n // See http://requirejs.org/docs/errors.html#mismatch for more details.\n // Use `_.noConflict` to remove Lodash from the global object.\n root._ = _;\n\n // Define as an anonymous module so, through path mapping, it can be\n // referenced as the \"underscore\" module.\n define(function() {\n return _;\n });\n }\n // Check for `exports` after `define` in case a build optimizer adds it.\n else if (freeModule) {\n // Export for Node.js.\n (freeModule.exports = _)._ = _;\n // Export for CommonJS support.\n freeExports._ = _;\n }\n else {\n // Export to the global object.\n root._ = _;\n }\n}.call(this));\n","import './assets/NcRichText-DNXuHl34.css';\nimport i from \"./Components/NcActionButton.mjs\";\nimport { N as e } from \"./chunks/NcActionButtonGroup-DU1taycQ.mjs\";\nimport m from \"./Components/NcActionCaption.mjs\";\nimport a from \"./Components/NcActionCheckbox.mjs\";\nimport { N as p } from \"./chunks/NcActionInput-53RB9uQe.mjs\";\nimport c from \"./Components/NcActionLink.mjs\";\nimport s from \"./Components/NcActionRadio.mjs\";\nimport N from \"./Components/NcActionRouter.mjs\";\nimport { N as n } from \"./chunks/NcActions-DiFslXqv.mjs\";\nimport f from \"./Components/NcActionSeparator.mjs\";\nimport l from \"./Components/NcActionText.mjs\";\nimport u from \"./Components/NcActionTextEditable.mjs\";\nimport { N as d } from \"./chunks/NcAppContent-BDhK1rUf.mjs\";\nimport g from \"./Components/NcAppContentDetails.mjs\";\nimport A from \"./Components/NcAppContentList.mjs\";\nimport { N as S } from \"./chunks/NcAppNavigation-CElLRpH-.mjs\";\nimport { N as b } from \"./chunks/NcAppNavigationCaption-DI7SIPdI.mjs\";\nimport v from \"./Components/NcAppNavigationIconBullet.mjs\";\nimport { N as T } from \"./chunks/NcAppNavigationItem-Djfc0DPY.mjs\";\nimport k from \"./Components/NcAppNavigationList.mjs\";\nimport P from \"./Components/NcAppNavigationNew.mjs\";\nimport { N as x } from \"./chunks/NcAppNavigationNewItem-CN3vYnc_.mjs\";\nimport { N as C } from \"./chunks/NcAppNavigationSettings-LmpAoM-x.mjs\";\nimport I from \"./Components/NcAppNavigationSpacer.mjs\";\nimport { N as h } from \"./chunks/NcAppSettingsDialog-BLOgrVCz.mjs\";\nimport E from \"./Components/NcAppSettingsSection.mjs\";\nimport { N as B } from \"./chunks/NcAppSidebar-CqER6-dl.mjs\";\nimport R from \"./Components/NcAppSidebarTab.mjs\";\nimport { N as L } from \"./chunks/NcAvatar-BBhoG-za.mjs\";\nimport { u as ct } from \"./chunks/NcAvatar-BBhoG-za.mjs\";\nimport { N as y } from \"./chunks/NcBreadcrumb-BxCf2hEA.mjs\";\nimport { N as M } from \"./chunks/NcBreadcrumbs-BmK-6Q-n.mjs\";\nimport O from \"./Components/NcButton.mjs\";\nimport { N as D } from \"./chunks/NcCheckboxRadioSwitch-BOl1O2zi.mjs\";\nimport { N as _ } from \"./chunks/NcColorPicker-CeoImUTC.mjs\";\nimport { N as j } from \"./chunks/NcContent-BPA0KfuT.mjs\";\nimport F from \"./Components/NcCounterBubble.mjs\";\nimport { N as W } from \"./chunks/NcDashboardWidget-2-nW7dII.mjs\";\nimport { N as w } from \"./chunks/NcDashboardWidgetItem-D2yoF9Oo.mjs\";\nimport { N as z } from \"./chunks/NcDateTime-CeOdKcvC.mjs\";\nimport { u as Nt } from \"./chunks/NcDateTime-CeOdKcvC.mjs\";\nimport G from \"./Components/NcDateTimePicker.mjs\";\nimport V from \"./Components/NcDateTimePickerNative.mjs\";\nimport { N as H } from \"./chunks/NcDialog-C_1rhUHk.mjs\";\nimport { N as K } from \"./chunks/NcDialogButton-DQFoaN7q.mjs\";\nimport { N as U } from \"./chunks/NcEmojiPicker-Cie30NYK.mjs\";\nimport $ from \"./Components/NcEmptyContent.mjs\";\nimport q from \"./Components/NcGuestContent.mjs\";\nimport { N as J } from \"./chunks/NcHeaderMenu-DOGXti7v.mjs\";\nimport { N as Q } from \"./chunks/index-CnpswYi6.mjs\";\nimport { N as X } from \"./chunks/NcIconSvgWrapper-BTdzvQGV.mjs\";\nimport { N as Y } from \"./chunks/NcListItem-BopkGRDs.mjs\";\nimport { N as Z } from \"./chunks/NcListItemIcon-CI23iFQz.mjs\";\nimport oo from \"./Components/NcLoadingIcon.mjs\";\nimport ro from \"./Components/NcModal.mjs\";\nimport to from \"./Components/NcNoteCard.mjs\";\nimport { N as io } from \"./chunks/NcPasswordField-BgSp7dK4.mjs\";\nimport { N as eo } from \"./chunks/NcPopover--V3R3EKV.mjs\";\nimport { N as mo } from \"./chunks/NcProgressBar-DDAeXyp8.mjs\";\nimport { N as ao } from \"./chunks/NcRelatedResourcesPanel-Ch1b_Gl3.mjs\";\nimport { N as po } from \"./chunks/index-uiNhPYvS.mjs\";\nimport { r as ft } from \"./chunks/index-uiNhPYvS.mjs\";\nimport { N as co, a as so } from \"./chunks/NcRichContenteditable-CEqdmoem.mjs\";\nimport { N as No } from \"./chunks/NcRichText-CUKFkHQg.mjs\";\nimport { N as ut, h as dt, d as gt, i as At, b as St, r as bt, c as vt, a as Tt } from \"./chunks/index-CU14QsCg.mjs\";\nimport \"@vueuse/core\";\nimport \"vue\";\nimport { a as Pt, g as xt, b as Ct, c as It, d as ht, s as Et } from \"./chunks/referencePickerModal-AvSHyw1b.mjs\";\nimport \"unist-util-visit\";\nimport \"unist-builder\";\nimport \"@nextcloud/router\";\nimport \"@nextcloud/axios\";\n/* empty css */\nimport { N as no } from \"./chunks/NcSelect-Bo71Yd6L.mjs\";\nimport { N as fo } from \"./chunks/NcTextField-D_eUEl2B.mjs\";\nimport \"@nextcloud/event-bus\";\nimport { N as lo } from \"./chunks/NcSavingIndicatorIcon-Bf0SEmgS.mjs\";\nimport { N as uo } from \"./chunks/NcSelectTags-9aCrLRT0.mjs\";\nimport { N as go } from \"./chunks/NcSettingsInputText-JboV8u2l.mjs\";\nimport { N as Ao } from \"./chunks/NcSettingsSection-Lgwm3w2e.mjs\";\nimport { N as So } from \"./chunks/NcSettingsSelectGroup-DUzmbtZx.mjs\";\nimport { N as bo } from \"./chunks/NcTimezonePicker-CH1lkCMF.mjs\";\nimport { N as vo } from \"./chunks/NcUserBubble-C0HbPO9p.mjs\";\nimport { N as To } from \"./chunks/NcUserStatusIcon-HOUdT_MR.mjs\";\nimport ko from \"./Components/NcTextArea.mjs\";\nimport { isFullscreenState as Rt, useIsFullscreen as Lt } from \"./Composables/useIsFullscreen.mjs\";\nimport { MOBILE_BREAKPOINT as Mt, MOBILE_SMALL_BREAKPOINT as Ot, isMobileState as Dt, useIsMobile as _t, useIsSmallMobile as jt } from \"./Composables/useIsMobile.mjs\";\nimport { E as Wt, a as wt, e as zt, g as Gt, s as Vt } from \"./chunks/emoji-k4gWHxrE.mjs\";\nimport { u as Kt } from \"./chunks/usernameToColor-BHkzj1tb.mjs\";\nimport { directive as Po } from \"./Directives/Focus.mjs\";\nimport { directive as xo } from \"./Directives/Linkify.mjs\";\nimport \"./Directives/Tooltip.mjs\";\nimport { default as $t } from \"./Mixins/clickOutsideOptions.mjs\";\nimport { default as Jt } from \"./Mixins/isFullscreen.mjs\";\nimport { default as Xt } from \"./Mixins/isMobile.mjs\";\nimport { VTooltip as Co } from \"floating-vue\";\nimport { VTooltip as Zt } from \"floating-vue\";\n/**\n * @copyright Copyright (c) 2018 John Molakvoæ <skjnldsv@protonmail.com>\n *\n * @author John Molakvoæ <skjnldsv@protonmail.com>\n *\n * @license AGPL-3.0-or-later\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http://www.gnu.org/licenses/>.\n *\n */\nconst Io = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({\n __proto__: null,\n NcActionButton: i,\n NcActionButtonGroup: e,\n NcActionCaption: m,\n NcActionCheckbox: a,\n NcActionInput: p,\n NcActionLink: c,\n NcActionRadio: s,\n NcActionRouter: N,\n NcActionSeparator: f,\n NcActionText: l,\n NcActionTextEditable: u,\n NcActions: n,\n NcAppContent: d,\n NcAppContentDetails: g,\n NcAppContentList: A,\n NcAppNavigation: S,\n NcAppNavigationCaption: b,\n NcAppNavigationIconBullet: v,\n NcAppNavigationItem: T,\n NcAppNavigationList: k,\n NcAppNavigationNew: P,\n NcAppNavigationNewItem: x,\n NcAppNavigationSettings: C,\n NcAppNavigationSpacer: I,\n NcAppSettingsDialog: h,\n NcAppSettingsSection: E,\n NcAppSidebar: B,\n NcAppSidebarTab: R,\n NcAutoCompleteResult: co,\n NcAvatar: L,\n NcBreadcrumb: y,\n NcBreadcrumbs: M,\n NcButton: O,\n NcCheckboxRadioSwitch: D,\n NcColorPicker: _,\n NcContent: j,\n NcCounterBubble: F,\n NcDashboardWidget: W,\n NcDashboardWidgetItem: w,\n NcDateTime: z,\n NcDateTimePicker: G,\n NcDateTimePickerNative: V,\n NcDialog: H,\n NcDialogButton: K,\n NcEmojiPicker: U,\n NcEmptyContent: $,\n NcGuestContent: q,\n NcHeaderMenu: J,\n NcHighlight: Q,\n NcIconSvgWrapper: X,\n NcListItem: Y,\n NcListItemIcon: Z,\n NcLoadingIcon: oo,\n NcMentionBubble: po,\n NcModal: ro,\n NcNoteCard: to,\n NcPasswordField: io,\n NcPopover: eo,\n NcProgressBar: mo,\n NcRelatedResourcesPanel: ao,\n NcRichContenteditable: so,\n NcRichText: No,\n NcSavingIndicatorIcon: lo,\n NcSelect: no,\n NcSelectTags: uo,\n NcSettingsInputText: go,\n NcSettingsSection: Ao,\n NcSettingsSelectGroup: So,\n NcTextArea: ko,\n NcTextField: fo,\n NcTimezonePicker: bo,\n NcUserBubble: vo,\n NcUserStatusIcon: To\n}, Symbol.toStringTag, { value: \"Module\" }));\n/**\n * @copyright 2022 Christopher Ng <chrng8@gmail.com>\n *\n * @author Christopher Ng <chrng8@gmail.com>\n *\n * @license AGPL-3.0-or-later\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http://www.gnu.org/licenses/>.\n *\n */\nconst et = (o) => o.type === \"click\" || o.type === \"keydown\" && o.key === \"Enter\";\n/**\n * @copyright Copyright (c) 2018 John Molakvoæ <skjnldsv@protonmail.com>\n *\n * @author John Molakvoæ <skjnldsv@protonmail.com>\n *\n * @license AGPL-3.0-or-later\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http://www.gnu.org/licenses/>.\n *\n */\nconst ho = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({\n __proto__: null,\n Focus: Po,\n Linkify: xo,\n Tooltip: Co\n}, Symbol.toStringTag, { value: \"Module\" })), mt = {\n install(o) {\n Object.entries(Io).forEach(([t, r]) => {\n o.component(r.name || t, r);\n }), Object.entries(ho).forEach(([t, r]) => {\n o.directive(t, r);\n });\n }\n};\nexport {\n Wt as EmojiSkinTone,\n Po as Focus,\n xo as Linkify,\n Mt as MOBILE_BREAKPOINT,\n Ot as MOBILE_SMALL_BREAKPOINT,\n i as NcActionButton,\n e as NcActionButtonGroup,\n m as NcActionCaption,\n a as NcActionCheckbox,\n p as NcActionInput,\n c as NcActionLink,\n s as NcActionRadio,\n N as NcActionRouter,\n f as NcActionSeparator,\n l as NcActionText,\n u as NcActionTextEditable,\n n as NcActions,\n d as NcAppContent,\n g as NcAppContentDetails,\n A as NcAppContentList,\n S as NcAppNavigation,\n b as NcAppNavigationCaption,\n v as NcAppNavigationIconBullet,\n T as NcAppNavigationItem,\n k as NcAppNavigationList,\n P as NcAppNavigationNew,\n x as NcAppNavigationNewItem,\n C as NcAppNavigationSettings,\n I as NcAppNavigationSpacer,\n h as NcAppSettingsDialog,\n E as NcAppSettingsSection,\n B as NcAppSidebar,\n R as NcAppSidebarTab,\n co as NcAutoCompleteResult,\n L as NcAvatar,\n y as NcBreadcrumb,\n M as NcBreadcrumbs,\n O as NcButton,\n D as NcCheckboxRadioSwitch,\n _ as NcColorPicker,\n j as NcContent,\n F as NcCounterBubble,\n ut as NcCustomPickerRenderResult,\n W as NcDashboardWidget,\n w as NcDashboardWidgetItem,\n z as NcDateTime,\n G as NcDateTimePicker,\n V as NcDateTimePickerNative,\n H as NcDialog,\n K as NcDialogButton,\n U as NcEmojiPicker,\n $ as NcEmptyContent,\n q as NcGuestContent,\n J as NcHeaderMenu,\n Q as NcHighlight,\n X as NcIconSvgWrapper,\n Y as NcListItem,\n Z as NcListItemIcon,\n oo as NcLoadingIcon,\n po as NcMentionBubble,\n ro as NcModal,\n to as NcNoteCard,\n io as NcPasswordField,\n eo as NcPopover,\n mo as NcProgressBar,\n ao as NcRelatedResourcesPanel,\n so as NcRichContenteditable,\n No as NcRichText,\n lo as NcSavingIndicatorIcon,\n no as NcSelect,\n uo as NcSelectTags,\n go as NcSettingsInputText,\n Ao as NcSettingsSection,\n So as NcSettingsSelectGroup,\n ko as NcTextArea,\n fo as NcTextField,\n bo as NcTimezonePicker,\n vo as NcUserBubble,\n To as NcUserStatusIcon,\n mt as NextcloudVuePlugin,\n Zt as Tooltip,\n Pt as anyLinkProviderId,\n $t as clickOutsideOptions,\n wt as emojiAddRecent,\n zt as emojiSearch,\n Gt as getCurrentSkinTone,\n xt as getLinkWithPicker,\n Ct as getProvider,\n It as getProviders,\n dt as hasInteractiveView,\n et as isA11yActivation,\n gt as isCustomPickerElementRegistered,\n Jt as isFullscreen,\n Rt as isFullscreenState,\n Xt as isMobile,\n Dt as isMobileState,\n At as isWidgetRegistered,\n St as registerCustomPickerElement,\n bt as registerWidget,\n vt as renderCustomPickerElement,\n Tt as renderWidget,\n ft as richEditor,\n ht as searchProvider,\n Vt as setCurrentSkinTone,\n Et as sortProviders,\n Nt as useFormatDateTime,\n Lt as useIsFullscreen,\n _t as useIsMobile,\n jt as useIsSmallMobile,\n ct as userStatus,\n Kt as usernameToColor\n};\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n// expose the modules object (__webpack_modules__)\n__webpack_require__.m = __webpack_modules__;\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.f = {};\n// This file contains only the entry chunk.\n// The chunk loading function for additional chunks\n__webpack_require__.e = (chunkId) => {\n\treturn Promise.all(Object.keys(__webpack_require__.f).reduce((promises, key) => {\n\t\t__webpack_require__.f[key](chunkId, promises);\n\t\treturn promises;\n\t}, []));\n};","// This function allow to reference async chunks\n__webpack_require__.u = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"\" + chunkId + \"-\" + chunkId + \".js?v=\" + {\"1110\":\"a5d6e6f59aa058840a1e\",\"5455\":\"8915a218db5b7bc90f34\"}[chunkId] + \"\";\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","__webpack_require__.j = 3674;","var scriptUrl;\nif (__webpack_require__.g.importScripts) scriptUrl = __webpack_require__.g.location + \"\";\nvar document = __webpack_require__.g.document;\nif (!scriptUrl && document) {\n\tif (document.currentScript)\n\t\tscriptUrl = document.currentScript.src;\n\tif (!scriptUrl) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tif(scripts.length) {\n\t\t\tvar i = scripts.length - 1;\n\t\t\twhile (i > -1 && (!scriptUrl || !/^http(s?):/.test(scriptUrl))) scriptUrl = scripts[i--].src;\n\t\t}\n\t}\n}\n// When supporting browsers where an automatic publicPath is not supported you must specify an output.publicPath manually via configuration\n// or pass an empty string (\"\") and set the __webpack_public_path__ variable from your code to use your own logic.\nif (!scriptUrl) throw new Error(\"Automatic publicPath is not supported in this browser\");\nscriptUrl = scriptUrl.replace(/#.*$/, \"\").replace(/\\?.*$/, \"\").replace(/\\/[^\\/]+$/, \"/\");\n__webpack_require__.p = scriptUrl;","__webpack_require__.b = document.baseURI || self.location.href;\n\n// object to store loaded and loading chunks\n// undefined = chunk not loaded, null = chunk preloaded/prefetched\n// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded\nvar installedChunks = {\n\t3674: 0\n};\n\n__webpack_require__.f.j = (chunkId, promises) => {\n\t\t// JSONP chunk loading for javascript\n\t\tvar installedChunkData = __webpack_require__.o(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;\n\t\tif(installedChunkData !== 0) { // 0 means \"already installed\".\n\n\t\t\t// a Promise means \"currently loading\".\n\t\t\tif(installedChunkData) {\n\t\t\t\tpromises.push(installedChunkData[2]);\n\t\t\t} else {\n\t\t\t\tif(true) { // all chunks have JS\n\t\t\t\t\t// setup Promise in chunk cache\n\t\t\t\t\tvar promise = new Promise((resolve, reject) => (installedChunkData = installedChunks[chunkId] = [resolve, reject]));\n\t\t\t\t\tpromises.push(installedChunkData[2] = promise);\n\n\t\t\t\t\t// start chunk loading\n\t\t\t\t\tvar url = __webpack_require__.p + __webpack_require__.u(chunkId);\n\t\t\t\t\t// create error before stack unwound to get useful stacktrace later\n\t\t\t\t\tvar error = new Error();\n\t\t\t\t\tvar loadingEnded = (event) => {\n\t\t\t\t\t\tif(__webpack_require__.o(installedChunks, chunkId)) {\n\t\t\t\t\t\t\tinstalledChunkData = installedChunks[chunkId];\n\t\t\t\t\t\t\tif(installedChunkData !== 0) installedChunks[chunkId] = undefined;\n\t\t\t\t\t\t\tif(installedChunkData) {\n\t\t\t\t\t\t\t\tvar errorType = event && (event.type === 'load' ? 'missing' : event.type);\n\t\t\t\t\t\t\t\tvar realSrc = event && event.target && event.target.src;\n\t\t\t\t\t\t\t\terror.message = 'Loading chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';\n\t\t\t\t\t\t\t\terror.name = 'ChunkLoadError';\n\t\t\t\t\t\t\t\terror.type = errorType;\n\t\t\t\t\t\t\t\terror.request = realSrc;\n\t\t\t\t\t\t\t\tinstalledChunkData[1](error);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t};\n\t\t\t\t\t__webpack_require__.l(url, loadingEnded, \"chunk-\" + chunkId, chunkId);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n};\n\n// no prefetching\n\n// no preloaded\n\n// no HMR\n\n// no HMR manifest\n\n__webpack_require__.O.j = (chunkId) => (installedChunks[chunkId] === 0);\n\n// install a JSONP callback for chunk loading\nvar webpackJsonpCallback = (parentChunkLoadingFunction, data) => {\n\tvar chunkIds = data[0];\n\tvar moreModules = data[1];\n\tvar runtime = data[2];\n\t// add \"moreModules\" to the modules object,\n\t// then flag all \"chunkIds\" as loaded and fire callback\n\tvar moduleId, chunkId, i = 0;\n\tif(chunkIds.some((id) => (installedChunks[id] !== 0))) {\n\t\tfor(moduleId in moreModules) {\n\t\t\tif(__webpack_require__.o(moreModules, moduleId)) {\n\t\t\t\t__webpack_require__.m[moduleId] = moreModules[moduleId];\n\t\t\t}\n\t\t}\n\t\tif(runtime) var result = runtime(__webpack_require__);\n\t}\n\tif(parentChunkLoadingFunction) parentChunkLoadingFunction(data);\n\tfor(;i < chunkIds.length; i++) {\n\t\tchunkId = chunkIds[i];\n\t\tif(__webpack_require__.o(installedChunks, chunkId) && installedChunks[chunkId]) {\n\t\t\tinstalledChunks[chunkId][0]();\n\t\t}\n\t\tinstalledChunks[chunkId] = 0;\n\t}\n\treturn __webpack_require__.O(result);\n}\n\nvar chunkLoadingGlobal = self[\"webpackChunknextcloud\"] = self[\"webpackChunknextcloud\"] || [];\nchunkLoadingGlobal.forEach(webpackJsonpCallback.bind(null, 0));\nchunkLoadingGlobal.push = webpackJsonpCallback.bind(null, chunkLoadingGlobal.push.bind(chunkLoadingGlobal));","__webpack_require__.nc = undefined;","// startup\n// Load entry module and return exports\n// This entry module depends on other loaded chunks and execution need to be delayed\nvar __webpack_exports__ = __webpack_require__.O(undefined, [4208], () => (__webpack_require__(1614)))\n__webpack_exports__ = __webpack_require__.O(__webpack_exports__);\n"],"names":["deferred","inProgress","dataWebpackPrefix","defineComponent","name","components","NcCheckboxRadioSwitch","props","value","type","Number","required","emits","data","PERMISSION_UPDATE","PERMISSION_CREATE","PERMISSION_DELETE","PERMISSION_SHARE","computed","canCreate","canUpdate","canDelete","canShare","methods","t","translate","toggle","permission","$emit","options","styleTagTransform","setAttributes","insert","domAPI","insertStyleElement","locals","_vm","this","_c","_self","_setupProxy","staticClass","attrs","on","$event","_v","_s","NcSettingsSelectGroup","NcTextArea","NcTextField","SelectSharingPermissions","settingsData","loadState","settings","console","warn","Proxy","get","target","property","set","newValue","configName","concat","snakeCase","JSON","stringify","window","OCP","AppConfig","setValue","publicShareDisclaimerEnabled","publicShareDisclaimerText","onUpdateDisclaimer","debounce","success","showSuccess","error","showError","deleteKey","onUpdateExcludeGroups","excludeGroups","enabled","$set","directives","rawName","expression","allowResharing","allowGroupSharing","onlyShareWithGroupMembers","staticStyle","model","onlyShareWithGroupMembersExcludeGroupList","callback","$$v","allowLinks","allowPublicUpload","enableLinkPasswordByDefault","enforceLinksPassword","passwordExcludedGroupsFeatureEnabled","passwordExcludedGroups","_e","allowLinksExcludeGroups","excludeGroupsList","defaultInternalExpireDate","enforceInternalExpireDate","internalExpireAfterNDays","defaultRemoteExpireDate","enforceRemoteExpireDate","remoteExpireAfterNDays","defaultExpireDate","enforceExpireDate","expireAfterNDays","allowShareDialogUserEnumeration","restrictUserEnumerationToGroup","restrictUserEnumerationToPhone","restrictUserEnumerationFullMatch","defaultPermissions","AdminSettingsSharingForm","NcNoteCard","NcSettingsSection","documentationLink","sharingAppEnabled","Vue","el","render","h","AdminSettingsSharing","___CSS_LOADER_EXPORT___","push","module","id","undefined","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","WRAP_PARTIAL_FLAG","WRAP_ARY_FLAG","INFINITY","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboRange","rsComboMarksRange","rsDingbatRange","rsLowerRange","rsUpperRange","rsVarRange","rsBreakRange","rsMathOpRange","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsModifier","rsOptVar","rsSeq","join","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","parseFloat","freeParseInt","parseInt","freeGlobal","g","Object","freeSelf","self","root","Function","freeExports","exports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","require","types","binding","e","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","length","call","arrayAggregator","array","setter","iteratee","accumulator","index","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","key","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","current","baseTimes","n","baseTrim","string","slice","trimmedEndIndex","replace","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","test","mapToArray","map","size","forEach","overArg","transform","arg","replaceHolders","placeholder","setToArray","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","match","unicodeToArray","split","asciiToArray","charAt","unescapeHtmlChar","_","runInContext","context","uid","defaults","pick","Date","Error","Math","String","TypeError","arrayProto","prototype","funcProto","objectProto","coreJsData","funcToString","toString","hasOwnProperty","idCounter","maskSrcKey","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","iterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","clearTimeout","ctxNow","now","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","max","nativeMin","min","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entries","clear","entry","ListCache","MapCache","SetCache","__data__","add","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","constructor","input","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","symbol","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","outer","valuesIndex","templateSettings","pop","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","parent","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","message","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","baseKeys","isPrototype","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","criteria","comparer","sort","objCriteria","othCriteria","ordersLength","compareAscending","compareMultiple","baseSortBy","basePickBy","baseSet","basePullAll","indexOf","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","start","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","copy","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","trailing","createCompounder","words","deburr","createCtor","arguments","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","countHolders","newHolders","createRecurry","fn","arrLength","oldArray","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrStacked","arrValue","flatten","otherFunc","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","count","lastCalled","stamp","remaining","rand","memoize","charCodeAt","quote","subString","clone","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","find","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bind","bindKey","WRAP_BIND_FLAG","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","leadingEdge","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","toArray","next","done","iteratorToArray","remainder","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","nativeKeysIn","isProto","baseKeysIn","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","prop","toPairs","toPairsIn","camelCase","word","toLowerCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","startCase","upperCase","toUpperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","method","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","after","castArray","chunk","compact","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","filter","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","reject","remove","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extend","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","position","escape","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isMatch","isMatchWith","isNaN","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduce","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sum","sumBy","template","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","global","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","toJSON","A","N","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","m","O","chunkIds","priority","notFulfilled","i","fulfilled","j","r","getter","__esModule","d","a","definition","o","enumerable","f","chunkId","all","promises","u","globalThis","obj","l","url","script","needAttach","scripts","document","getElementsByTagName","s","getAttribute","createElement","charset","timeout","nc","setAttribute","src","onScriptComplete","prev","event","onerror","onload","doneFns","parentNode","removeChild","appendChild","nmd","children","scriptUrl","importScripts","location","currentScript","p","b","baseURI","href","installedChunks","installedChunkData","promise","errorType","realSrc","request","webpackJsonpCallback","parentChunkLoadingFunction","moreModules","runtime","chunkLoadingGlobal","__webpack_exports__"],"sourceRoot":""} |