{"version":3,"file":"465.6b02c286f5a35c16.js","mappings":"qNASA,MAEMA,GAAW,MACbC,YAAYC,KACRC,OAAiBC,KAAMF,IACvBE,KAAKC,qBAAoBC,KAAYF,KAAM,oBAAqB,GAChEA,KAAKG,sBAAqBD,KAAYF,KAAM,qBAAsB,GAClEA,KAAKI,iBAAkB,EACvBJ,KAAKK,yBAA2B,GAChCL,KAAKM,cAAgB,GACrBN,KAAKO,kBAAoB,GACzBP,KAAKQ,SAAW,GAChBR,KAAKS,cAAgB,GACrBT,KAAKU,WAAa,KAClBV,KAAKW,SAAW,KAChBX,KAAKY,OAAQ,EACbZ,KAAKa,oBAAqB,EAC1Bb,KAAKc,oBAAqB,EAC1Bd,KAAKe,2BAA4B,EACjCf,KAAKgB,yBAA0B,EAC/BhB,KAAKiB,wBAAyB,EAC9BjB,KAAKkB,sBAAuB,EAC5BlB,KAAKmB,0DAA2D,EAChEnB,KAAKoB,mBAAgBC,EACrBrB,KAAKsB,mBAAgBD,EACrBrB,KAAKuB,iBAAkB,EACvBvB,KAAKwB,iBAAmB,wBACxBxB,KAAKyB,kBAAoB,yBACzBzB,KAAK0B,mBAAgBL,EACrBrB,KAAK2B,cAAe,EACpB3B,KAAK4B,cAAe,EACpB5B,KAAK6B,kBAAeR,CACxB,CACAS,oBACI9B,KAAK+B,yBAA2BC,KAAaC,SAASC,OAAOC,UAAWC,IAAWpC,KAAK6B,aAAeO,GAC3G,CACAC,uBACIrC,KAAK+B,yBAAyBO,aAClC,CACAC,cACIP,KAAaC,SAASM,aAC1B,CACAC,cAAcC,IACVC,KAAeC,SAAS3C,KAAK4C,cAAeH,GAAGzC,KAAKoB,cAAepB,KAAKsB,cAC5E,CACAsB,cACI,SAAOC,WAAQ7C,KAAKQ,WAAQ,EAAKqC,WAAQ7C,KAAKO,mBAAqB,IAAMP,KAAKO,kBAAqBP,KAAKQ,QAC5G,CACAsC,mBACI,SAAOD,WAAQ7C,KAAKS,eAAiB,OAAST,KAAKS,aACvD,CACAsC,wBACI/C,KAAKgD,WAAahD,KAAKiD,GAAGC,cAAc,gBACxClD,KAAKmD,SAAW,IAAIC,iBAAkBC,KAClC,QAASC,MAAYD,GACK,eAAlBC,GAASC,MAAoD,WAA3BD,GAASE,eAC1BxD,KAAKgD,WAAWS,aAAa,WAE1CzD,KAAKgD,WAAWU,gBAAgB,SAAQ,GAKxD1D,KAAKmD,SAASQ,QAAQ3D,KAAKgD,WAAY,CACnCY,YAAY,EACZC,WAAW,EACXC,SAAS,GAEjB,CACAC,mBACI/D,KAAK+C,uBACT,CACAiB,sBACIhE,KAAKmD,SAASc,YAClB,CACAC,SACI,MAAMC,GAAc,IAChBC,KAAE,MAAO,CAAEC,IAAK,2CAA4CC,MAAO,WAAS,EAAGF,KAAE,MAAO,CAAEC,IAAK,2CAA4CC,MAAO,iBAAe,EAAGF,KAAE,IAAK,CAAEC,IAAK,2CAA4CE,KAAMvE,KAAK4C,cAAe0B,MAAO,iBAAkBE,QAAU/B,IAAMzC,KAAKwC,cAAcC,IAAI,aAAczC,KAAK8C,qBAAmB,EAAGsB,KAAE,OAAQ,CAAEC,IAAK,2CAA4CI,KAAM,SAAO,EAAGL,KAAE,MAAO,CAAEC,IAAK,2CAA4CK,OAAKC,KAAqB,qDAAsD3E,KAAK0B,eAAgB4C,MAAO,aAAcM,IAAK,gCAAkC5E,KAAK2B,eAAiB3B,KAAK4B,gBAAgBwC,KAAE,MAAO,CAAEE,MAAO,8BAA4B,EAAGF,KAAE,OAAQ,CAAEE,MAAO,+BAAiC,YAAUjD,EAAWrB,KAAK4B,eAAiB5B,KAAK2B,gBAAgByC,KAAE,MAAO,CAAEE,MAAO,8BAA4B,EAAGF,KAAE,OAAQ,CAAEE,MAAO,+BAAiC,YAAUjD,IAAS,EACn9B+C,KAAE,SAAU,CAAEC,IAAK,2CAA4CC,MAAO,iBAAkBf,KAAM,SAAU,cAAe,WAAY,cAAe,iBAAkB,gBAAiB,gBAAiB,gBAAiB,QAAS,aAAc,sBAAoB,EAAGa,KAAE,OAAQ,CAAEC,IAAK,2CAA4CC,MAAO,aAAc,cAAe,WAAS,EAC/WF,KAAE,MAAO,CAAEC,IAAK,2CAA4CC,MAAO,2BAA4BO,GAAI,kBAAgB,EAAGT,KAAE,MAAO,CAAEC,IAAK,2CAA4CC,MAAO,YAAU,EAAGF,KAAE,OAAQ,CAAEC,IAAK,2CAA4CI,KAAM,eAAa,EAAGL,KAAE,OAAQ,CAAEC,IAAK,2CAA4CI,KAAM,wBAAsB,EAAGL,KAAE,OAAQ,CAAEC,IAAK,2CAA4CI,KAAM,oBAAsBzE,KAAKc,sBAAsBsD,KAAE,SAAU,CAAEE,MAAO,+BAAgCE,QAASA,IAAMxE,KAAKuC,cAAe,aAAe,aAAkC,SAAtBvC,KAAK6B,aAA0B,QAAU,eAAgBiD,MAAQ,aAAkC,SAAtB9E,KAAK6B,aAA0B,QAAU,iBAAe,EAAGuC,KAAE,OAAQ,CAAEE,MAA6B,SAAtBtE,KAAK6B,aAA0B,cAAgB,uBAAsBR,EAAWrB,KAAKiB,0BAA0BmD,KAAE,2BAA4B,CAAEhE,gBAAiBJ,KAAKI,gBAAiBC,yBAA0BL,KAAKK,yBAA0BO,MAAOZ,KAAKY,MAAOC,mBAAoBb,KAAKa,mBAAoBF,SAAUX,KAAKW,SAAUD,WAAYV,KAAKU,WAAYqE,kCAAmCA,IAAM/E,KAAKC,kBAAkB+E,OAAQC,mCAAoCA,IAAMjF,KAAKG,mBAAmB6E,OAAQhE,wBAAyBhB,KAAKgB,wBAAyBE,qBAAsBlB,KAAKkB,qBAAsBM,iBAAkBxB,KAAKwB,iBAAkBC,kBAAmBzB,KAAKyB,oBAAkB,EAAG2C,KAAE,OAAQ,CAAEK,KAAM,mBAAoBS,KAAM,sBAAoB,EAAGd,KAAE,OAAQ,CAAEK,KAAM,gCAAiCS,KAAM,wCAAuC7D,KAEnlD,SAAQ+C,KAAE,MAAO,CAAEC,IAAK,2CAA4CC,MAAO,8DAAgEtE,KAAKuB,gBAAkB,eAAiB,KAAOvB,KAAKe,0BAA4BoD,GAAcnE,KAAKmB,4DAA2DiD,KAAE,MAAO,CAAEE,MAAO,aAAeH,IAAeA,GAC7V,CACA,MAAIlB,GAAO,SAAOkC,KAAWnF,KAAO,GAExCJ,GAASwF,MAtFW,iZCRpB,IAAAC,gBAQE,WAGA,IAAIhE,EAUAiE,EAAkB,sBAIlBC,GAAiB,4BAMjBC,GAAc,yBAqCdC,GAAW,IACXC,GAAmB,iBAKnBC,GAAmB,WAKnBC,GAAY,CACd,CAAC,MA9BiB,KA+BlB,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAtCqB,IAuCtB,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBC,GAAU,qBACVC,GAAW,iBAEXC,GAAU,mBACVC,GAAU,gBAEVC,GAAW,iBACXC,GAAU,oBACVC,GAAS,6BACTC,GAAS,eACTC,GAAY,kBAEZC,GAAY,kBACZC,GAAa,mBAEbC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAY,kBAEZC,GAAa,mBAGbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAuB,iBACvBC,GAAsB,qBACtBC,GAAwB,gCAGxBC,GAAgB,4BAChBC,GAAkB,WAClBC,GAAmBC,OAAOH,GAAcI,QACxCC,GAAqBF,OAAOF,GAAgBG,QAG5CE,GAAW,mBACXC,GAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,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,IAI/BgB,GAAc,MAAQP,GAAU,IAAMC,GAAS,IAC/CO,GAAc,MAAQF,GAAU,IAAML,GAAS,IAC/CQ,GAAkB,qCAClBC,GAAkB,qCAClBC,GAZa,MAAQd,GAAU,IAAMK,GAY1BU,KACXC,GAAW,IAAMrB,GAAa,KAI9BsB,GAAQD,GAAWF,GAHP,gBAAwB,CAACR,GAAaC,GAAYC,IAAYU,KAAK,KAAO,IAAMF,GAAWF,GAAW,KAIlHK,GAAU,MAAQ,CAACjB,GAAWK,GAAYC,IAAYU,KAAK,KAAO,IAAMD,GACxEG,GAAW,MAAQ,CAACd,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUoB,KAAK,KAAO,IAGxGG,GAAS7D,OA/BA,YA+Be,KAMxB8D,GAAc9D,OAAOwC,GAAS,KAG9BuB,GAAY/D,OAAO6C,GAAS,MAAQA,GAAS,KAAOe,GAAWH,GAAO,KAGtEO,GAAgBhE,OAAO,CACzBiD,GAAU,IAAMN,GAAU,IAAMS,GAAkB,MAAQ,CAACb,GAASU,GAAS,KAAKS,KAAK,KAAO,IAC9FP,GAAc,IAAME,GAAkB,MAAQ,CAACd,GAASU,GAAUC,GAAa,KAAKQ,KAAK,KAAO,IAChGT,GAAU,IAAMC,GAAc,IAAME,GACpCH,GAAU,IAAMI,GAtBD,mDADA,mDA0BfZ,GACAkB,IACAD,KAAK,KAAM,KAGTO,GAAejE,OAAO,WAAc6B,GAAiBC,GAAeK,GAAa,KAGjF+B,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,IAAkB,EAGlBC,EAAiB,CAAC,EACtBA,EAAepF,IAAcoF,EAAenF,IAC5CmF,EAAelF,IAAWkF,EAAejF,IACzCiF,EAAehF,IAAYgF,EAAe/E,IAC1C+E,EAAe9E,IAAmB8E,EAAe7E,IACjD6E,EAAe5E,KAAa,EAC5B4E,EAAetG,IAAWsG,EAAerG,IACzCqG,EAAetF,IAAkBsF,EAAepG,IAChDoG,EAAerF,IAAeqF,EAAenG,IAC7CmG,EAAelG,IAAYkG,EAAejG,IAC1CiG,EAAe/F,IAAU+F,EAAe9F,IACxC8F,EAAe7F,IAAa6F,EAAe3F,IAC3C2F,EAAe1F,IAAU0F,EAAezF,IACxCyF,EAAevF,KAAc,EAG7B,IAAIwF,EAAgB,CAAC,EACrBA,EAAcvG,IAAWuG,EAActG,IACvCsG,EAAcvF,IAAkBuF,EAActF,IAC9CsF,EAAcrG,IAAWqG,EAAcpG,IACvCoG,EAAcrF,IAAcqF,EAAcpF,IAC1CoF,EAAcnF,IAAWmF,EAAclF,IACvCkF,EAAcjF,IAAYiF,EAAchG,IACxCgG,EAAc/F,IAAa+F,EAAc9F,IACzC8F,EAAc5F,IAAa4F,EAAc3F,IACzC2F,EAAc1F,IAAa0F,EAAczF,IACzCyF,EAAchF,IAAYgF,EAAc/E,IACxC+E,EAAc9E,IAAa8E,EAAc7E,KAAa,EACtD6E,EAAcnG,IAAYmG,EAAclG,IACxCkG,EAAcxF,KAAc,EAG5B,IA4EIyF,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfC,GAA8B,iBAAVC,QAAsBA,QAAUA,OAAOC,SAAWA,QAAUD,OAGhFE,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,EAAOL,IAAcG,IAAYG,SAAS,cAATA,GAGjCC,GAA4CC,KAAYA,GAAQC,UAAYD,GAG5EE,GAAaH,IAA4CI,KAAWA,GAAOF,UAAYE,GAGvFC,GAAgBF,IAAcA,GAAWF,UAAYD,GAGrDM,GAAcD,IAAiBZ,GAAWc,QAG1CC,GAAY,WACd,IAIE,OAFYL,IAAcA,GAAWM,SAAWN,GAAWM,QAAQ,QAAQC,OAOpEJ,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,OACnE,OAAa,CACf,CAZgB,GAeZC,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,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,QAHIC,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GAClBH,EAAOE,EAAaE,EAAOH,EAASG,GAAQL,EAC9C,CACA,OAAOG,CACT,CAWA,SAASG,GAAUN,EAAOE,GAIxB,QAHIE,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,IAC8B,IAAzCK,EAASF,EAAMI,GAAQA,EAAOJ,KAIpC,OAAOA,CACT,CAWA,SAASO,GAAeP,EAAOE,GAG7B,QAFIL,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEhCA,MAC0C,IAA3CK,EAASF,EAAMH,GAASA,EAAQG,KAItC,OAAOA,CACT,CAYA,SAASQ,GAAWR,EAAOS,GAIzB,QAHIL,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GACf,IAAKY,EAAUT,EAAMI,GAAQA,EAAOJ,GAClC,OAAO,EAGX,OAAO,CACT,CAWA,SAASU,GAAYV,EAAOS,GAM1B,QALIL,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCc,EAAW,EACXC,EAAS,KAEJR,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdK,EAAUJ,EAAOD,EAAOJ,KAC1BY,EAAOD,KAAcN,EAEzB,CACA,OAAOO,CACT,CAWA,SAASC,GAAcb,EAAOK,GAE5B,QADsB,MAATL,IAAoBA,EAAMH,SACpBiB,GAAYd,EAAOK,EAAO,IAAK,CACpD,CAWA,SAASU,GAAkBf,EAAOK,EAAOW,GAIvC,QAHIZ,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GACf,GAAImB,EAAWX,EAAOL,EAAMI,IAC1B,OAAO,EAGX,OAAO,CACT,CAWA,SAASa,EAASjB,EAAOE,GAKvB,QAJIE,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCe,EAASM,MAAMrB,KAEVO,EAAQP,GACfe,EAAOR,GAASF,EAASF,EAAMI,GAAQA,EAAOJ,GAEhD,OAAOY,CACT,CAUA,SAASO,GAAUnB,EAAOoB,GAKxB,QAJIhB,GAAQ,EACRP,EAASuB,EAAOvB,OAChBwB,EAASrB,EAAMH,SAEVO,EAAQP,GACfG,EAAMqB,EAASjB,GAASgB,EAAOhB,GAEjC,OAAOJ,CACT,CAcA,SAASsB,GAAYtB,EAAOE,EAAUC,EAAaoB,GACjD,IAAInB,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAKvC,IAHI0B,GAAa1B,IACfM,EAAcH,IAAQI,MAEfA,EAAQP,GACfM,EAAcD,EAASC,EAAaH,EAAMI,GAAQA,EAAOJ,GAE3D,OAAOG,CACT,CAcA,SAASqB,GAAiBxB,EAAOE,EAAUC,EAAaoB,GACtD,IAAI1B,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAIvC,IAHI0B,GAAa1B,IACfM,EAAcH,IAAQH,IAEjBA,KACLM,EAAcD,EAASC,EAAaH,EAAMH,GAASA,EAAQG,GAE7D,OAAOG,CACT,CAYA,SAASsB,GAAUzB,EAAOS,GAIxB,QAHIL,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,SAE9BO,EAAQP,GACf,GAAIY,EAAUT,EAAMI,GAAQA,EAAOJ,GACjC,OAAO,EAGX,OAAO,CACT,CASA,IAAI0B,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYpB,EAAWqB,GAC1C,IAAIlB,EACJkB,SAASD,EAAY,SAASxB,EAAOhL,EAAKwM,GACxC,GAAIpB,EAAUJ,EAAOhL,EAAKwM,GACxBjB,SAASvL,GACF,CAEX,GACOuL,CACT,CAaA,SAASmB,GAAc/B,EAAOS,EAAWuB,EAAWC,GAIlD,QAHIpC,EAASG,EAAMH,OACfO,EAAQ4B,GAAaC,EAAY,GAAI,GAEjCA,EAAY7B,MAAYA,EAAQP,GACtC,GAAIY,EAAUT,EAAMI,GAAQA,EAAOJ,GACjC,OAAOI,EAGX,OAAO,CACT,CAWA,SAASU,GAAYd,EAAOK,EAAO2B,GACjC,OAAO3B,GAAUA,EAidnB,SAAS6B,GAAclC,EAAOK,EAAO2B,GAInC,QAHI5B,EAAQ4B,EAAY,EACpBnC,EAASG,EAAMH,SAEVO,EAAQP,GACf,GAAIG,EAAMI,KAAWC,EACnB,OAAOD,EAGX,OAAO,CACT,CA1dM8B,CAAclC,EAAOK,EAAO2B,GAC5BD,GAAc/B,EAAOmC,GAAWH,EACtC,CAYA,SAASI,GAAgBpC,EAAOK,EAAO2B,EAAWhB,GAIhD,QAHIZ,EAAQ4B,EAAY,EACpBnC,EAASG,EAAMH,SAEVO,EAAQP,GACf,GAAImB,EAAWhB,EAAMI,GAAQC,GAC3B,OAAOD,EAGX,OAAO,CACT,CASA,SAAS+B,GAAU9B,GACjB,OAAOA,GAAUA,CACnB,CAWA,SAASgC,GAASrC,EAAOE,GACvB,IAAIL,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAAUyC,GAAQtC,EAAOE,GAAYL,EA1yBpC0C,GA2yBV,CASA,SAASZ,GAAatM,GACpB,OAAO,SAASmN,GACd,OAAiB,MAAVA,EAAiBnQ,EAAYmQ,EAAOnN,EAC7C,CACF,CASA,SAASoN,GAAeD,GACtB,OAAO,SAASnN,GACd,OAAiB,MAAVmN,EAAiBnQ,EAAYmQ,EAAOnN,EAC7C,CACF,CAeA,SAASqN,GAAWb,EAAY3B,EAAUC,EAAaoB,EAAWO,GAChEA,SAASD,EAAY,SAASxB,EAAOD,EAAOyB,GAC1C1B,EAAcoB,GACTA,GAAY,EAAOlB,GACpBH,EAASC,EAAaE,EAAOD,EAAOyB,EAC1C,GACO1B,CACT,CA+BA,SAASmC,GAAQtC,EAAOE,GAKtB,QAJIU,EACAR,GAAQ,EACRP,EAASG,EAAMH,SAEVO,EAAQP,GAAQ,CACvB,IAAI8C,EAAUzC,EAASF,EAAMI,IACzBuC,IAAYtQ,IACduO,EAASA,IAAWvO,EAAYsQ,EAAW/B,EAAS+B,EAExD,CACA,OAAO/B,CACT,CAWA,SAASgC,GAAUC,EAAG3C,GAIpB,QAHIE,GAAQ,EACRQ,EAASM,MAAM2B,KAEVzC,EAAQyC,GACfjC,EAAOR,GAASF,EAASE,GAE3B,OAAOQ,CACT,CAwBA,SAASkC,GAASC,GAChB,OAAOA,GACHA,EAAOC,MAAM,EAAGC,GAAgBF,GAAU,GAAGG,QAAQzJ,GAAa,GAExE,CASA,SAAS0J,GAAUzD,GACjB,OAAO,SAASW,GACd,OAAOX,EAAKW,EACd,CACF,CAYA,SAAS+C,GAAWZ,EAAQa,GAC1B,OAAOpC,EAASoC,EAAO,SAAShO,GAC9B,OAAOmN,EAAOnN,EAChB,EACF,CAUA,SAASiO,GAASC,EAAOlO,GACvB,OAAOkO,EAAMC,IAAInO,EACnB,CAWA,SAASoO,GAAgBC,EAAYC,GAInC,QAHIvD,GAAQ,EACRP,EAAS6D,EAAW7D,SAEfO,EAAQP,GAAUiB,GAAY6C,EAAYD,EAAWtD,GAAQ,IAAK,IAC3E,OAAOA,CACT,CAWA,SAASwD,GAAcF,EAAYC,GAGjC,QAFIvD,EAAQsD,EAAW7D,OAEhBO,KAAWU,GAAY6C,EAAYD,EAAWtD,GAAQ,IAAK,IAClE,OAAOA,CACT,CA8BA,IAAIyD,GAAepB,GAjxBG,CAEpB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IACnC,OAAQ,KAAM,OAAQ,KACtB,OAAQ,KAAM,OAAQ,KACtB,OAAQ,KAER,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAC1B,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACtF,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACtF,OAAU,IAAM,OAAU,IAC1B,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,KAAM,OAAU,KAC1B,OAAU,KAAM,OAAU,KAC1B,OAAU,KAAM,OAAU,MAouBxBqB,GAAiBrB,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASsB,GAAiBC,GACxB,MAAO,KAAO3G,GAAc2G,EAC9B,CAqBA,SAASC,GAAWlB,GAClB,OAAOhG,GAAamH,KAAKnB,EAC3B,CAqCA,SAASoB,GAAWC,GAClB,IAAIhE,GAAQ,EACRQ,EAASM,MAAMkD,EAAIC,MAEvBD,SAAIE,QAAQ,SAASjE,EAAOhL,GAC1BuL,IAASR,GAAS,CAAC/K,EAAKgL,EAC1B,GACOO,CACT,CAUA,SAAS2D,GAAQ7E,EAAM8E,GACrB,OAAO,SAASC,GACd,OAAO/E,EAAK8E,EAAUC,GACxB,CACF,CAWA,SAASC,GAAe1E,EAAO2E,GAM7B,QALIvE,GAAQ,EACRP,EAASG,EAAMH,OACfc,EAAW,EACXC,EAAS,KAEJR,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,IACdC,IAAUsE,GAAetE,IAAU7J,MACrCwJ,EAAMI,GAAS5J,GACfoK,EAAOD,KAAcP,EAEzB,CACA,OAAOQ,CACT,CASA,SAASgE,GAAWC,GAClB,IAAIzE,GAAQ,EACRQ,EAASM,MAAM2D,EAAIR,MAEvBQ,SAAIP,QAAQ,SAASjE,GACnBO,IAASR,GAASC,CACpB,GACOO,CACT,CAoEA,SAASkE,GAAW/B,GAClB,OAAOkB,GAAWlB,GAiDpB,SAASgC,GAAYhC,GAEnB,QADInC,EAAS/D,GAAUmI,UAAY,EAC5BnI,GAAUqH,KAAKnB,MAClBnC,EAEJ,OAAOA,CACT,CAtDMmE,CAAYhC,GACZrB,GAAUqB,EAChB,CASA,SAASkC,GAAclC,GACrB,OAAOkB,GAAWlB,GAmDpB,SAASmC,GAAenC,GACtB,OAAOA,EAAOoC,MAAMtI,KAAc,EACpC,CApDMqI,CAAenC,GA7kBrB,SAASqC,GAAarC,GACpB,OAAOA,EAAOsC,MAAM,GACtB,CA4kBMD,CAAarC,EACnB,CAUA,SAASE,GAAgBF,GAGvB,QAFI3C,EAAQ2C,EAAOlD,OAEZO,KAAW1G,GAAawK,KAAKnB,EAAOuC,OAAOlF,MAClD,OAAOA,CACT,CASA,IAAImF,GAAmB9C,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MAk4gBP+C,GAt3egB,SAASC,EAAaC,GAIxC,IA6BMC,EA7BFzE,GAHJwE,EAAqB,MAAXA,EAAkB3H,EAAOyH,GAAEI,SAAS7H,EAAKH,SAAU8H,EAASF,GAAEK,KAAK9H,EAAMd,MAG/DiE,MAChB4E,EAAOJ,EAAQI,KACfC,EAAQL,EAAQK,MAChB/H,EAAW0H,EAAQ1H,SACnBgI,EAAON,EAAQM,KACfpI,EAAS8H,EAAQ9H,OACjB9E,GAAS4M,EAAQ5M,OACjBmN,GAASP,EAAQO,OACjBC,GAAYR,EAAQQ,UAGpBC,GAAajF,EAAMkF,UAEnBC,GAAczI,EAAOwI,UAGrBE,GAAaZ,EAAQ,sBAGrBa,GAPYvI,EAASoI,UAOII,SAGzBC,EAAiBJ,GAAYI,eAG7BC,GAAY,EAGZC,IACEhB,EAAM,SAASiB,KAAKN,IAAcA,GAAWO,MAAQP,GAAWO,KAAKC,UAAY,KACvE,iBAAmBnB,EAAO,GAQtCoB,GAAuBV,GAAYG,SAGnCQ,GAAmBT,GAAazG,KAAKlC,GAGrCqJ,GAAUlJ,EAAKyH,EAGf0B,GAAapO,GAAO,IACtByN,GAAazG,KAAK2G,GAAgBvD,QAAQ3J,GAAc,QACvD2J,QAAQ,yDAA0D,SAAW,KAI5EiE,GAAS7I,GAAgBoH,EAAQyB,OAAS9U,EAC1C+U,GAAS1B,EAAQ0B,OACjBC,GAAa3B,EAAQ2B,WACrBC,GAAcH,GAASA,GAAOG,YAAcjV,EAC5CkV,GAAehD,GAAQ3G,EAAO4J,eAAgB5J,GAC9C6J,GAAe7J,EAAO8J,OACtBC,GAAuBtB,GAAYsB,qBACnCC,GAASzB,GAAWyB,OACpBC,GAAmBT,GAASA,GAAOU,mBAAqBzV,EACxD0V,GAAcX,GAASA,GAAOY,SAAW3V,EACzC4V,GAAiBb,GAASA,GAAOc,YAAc7V,EAE/C8V,GAAkB,WACpB,IACE,IAAIzI,EAAO0I,GAAUxK,EAAQ,kBAC7B8B,SAAK,CAAC,EAAG,GAAI,CAAC,GACPA,CACT,OAAa,CACf,CANsB,GASlB2I,GAAkB3C,EAAQ4C,eAAiBvK,EAAKuK,cAAgB5C,EAAQ4C,aACxEC,GAASzC,GAAQA,EAAK0C,MAAQzK,EAAK+H,KAAK0C,KAAO1C,EAAK0C,IACpDC,GAAgB/C,EAAQgD,aAAe3K,EAAK2K,YAAchD,EAAQgD,WAGlEC,GAAa3C,EAAK4C,KAClBC,GAAc7C,EAAK8C,MACnBC,GAAmBnL,EAAOoL,sBAC1BC,GAAiB9B,GAASA,GAAO+B,SAAW7W,EAC5C8W,GAAiBzD,EAAQ0D,SACzBC,GAAalD,GAAW3J,KACxB8M,GAAa/E,GAAQ3G,EAAOiJ,KAAMjJ,GAClC2L,EAAYvD,EAAKwD,IACjBC,EAAYzD,EAAK0D,IACjBC,GAAY7D,EAAK0C,IACjBoB,GAAiBlE,EAAQjI,SACzBoM,GAAe7D,EAAK8D,OACpBC,GAAgB5D,GAAW6D,QAG3BC,GAAW7B,GAAU1C,EAAS,YAC9BwE,GAAM9B,GAAU1C,EAAS,OACzByE,GAAU/B,GAAU1C,EAAS,WAC7B0E,GAAMhC,GAAU1C,EAAS,OACzB2E,GAAUjC,GAAU1C,EAAS,WAC7B4E,GAAelC,GAAUxK,EAAQ,UAGjC2M,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,CAAC,EAGbC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAc3D,GAASA,GAAOhB,UAAY/T,EAC1C2Y,GAAgBD,GAAcA,GAAYE,QAAU5Y,EACpD6Y,GAAiBH,GAAcA,GAAYvE,SAAWnU,EAyH1D,SAAS8Y,EAAO9K,GACd,GAAI+K,EAAa/K,KAAWgL,EAAQhL,MAAYA,aAAiBiL,GAAc,CAC7E,GAAIjL,aAAiBkL,GACnB,OAAOlL,EAET,GAAIoG,EAAe3G,KAAKO,EAAO,eAC7B,OAAOmL,GAAanL,EAExB,CACA,OAAO,IAAIkL,GAAclL,EAC3B,CAUA,IAAIoL,GAAc,WAChB,SAASjJ,IAAU,CACnB,OAAO,SAASkJ,GACd,IAAKC,EAASD,GACZ,MAAO,CAAC,EAEV,GAAIjE,GACF,OAAOA,GAAaiE,GAEtBlJ,EAAO4D,UAAYsF,EACnB,IAAI9K,EAAS,IAAI4B,EACjBA,SAAO4D,UAAY/T,EACZuO,CACT,CACF,CAdkB,GAqBlB,SAASgL,KACP,CAUF,SAASL,GAAclL,EAAOwL,GAC5B7a,KAAK8a,YAAczL,EACnBrP,KAAK+a,YAAc,GACnB/a,KAAKgb,YAAcH,EACnB7a,KAAKib,UAAY,EACjBjb,KAAKkb,WAAa7Z,CACpB,CA+EA,SAASiZ,EAAYjL,GACnBrP,KAAK8a,YAAczL,EACnBrP,KAAK+a,YAAc,GACnB/a,KAAKmb,QAAU,EACfnb,KAAKob,cAAe,EACpBpb,KAAKqb,cAAgB,GACrBrb,KAAKsb,cAAgB3V,GACrB3F,KAAKub,UAAY,EACnB,CA+GA,SAASC,GAAKC,GACZ,IAAIrM,GAAQ,EACRP,EAAoB,MAAX4M,EAAkB,EAAIA,EAAQ5M,OAG3C,IADA7O,KAAK0b,UACItM,EAAQP,GAAQ,CACvB,IAAI8M,EAAQF,EAAQrM,GACpBpP,KAAK6T,IAAI8H,EAAM,GAAIA,EAAM,GAC3B,CACF,CA+FA,SAASC,GAAUH,GACjB,IAAIrM,GAAQ,EACRP,EAAoB,MAAX4M,EAAkB,EAAIA,EAAQ5M,OAG3C,IADA7O,KAAK0b,UACItM,EAAQP,GAAQ,CACvB,IAAI8M,EAAQF,EAAQrM,GACpBpP,KAAK6T,IAAI8H,EAAM,GAAIA,EAAM,GAC3B,CACF,CA4GA,SAASE,GAASJ,GAChB,IAAIrM,GAAQ,EACRP,EAAoB,MAAX4M,EAAkB,EAAIA,EAAQ5M,OAG3C,IADA7O,KAAK0b,UACItM,EAAQP,GAAQ,CACvB,IAAI8M,EAAQF,EAAQrM,GACpBpP,KAAK6T,IAAI8H,EAAM,GAAIA,EAAM,GAC3B,CACF,CA+FA,SAASG,GAAS1L,GAChB,IAAIhB,GAAQ,EACRP,EAAmB,MAAVuB,EAAiB,EAAIA,EAAOvB,OAGzC,IADA7O,KAAK+b,SAAW,IAAIF,KACXzM,EAAQP,GACf7O,KAAKgc,IAAI5L,EAAOhB,GAEpB,CA2CA,SAAS6M,GAAMR,GACb,IAAIS,EAAOlc,KAAK+b,SAAW,IAAIH,GAAUH,GACzCzb,KAAKqT,KAAO6I,EAAK7I,IACnB,CAoGA,SAAS8I,GAAc9M,EAAO+M,GAC5B,IAAIC,EAAQhC,EAAQhL,GAChBiN,GAASD,GAASE,GAAYlN,GAC9BmN,GAAUH,IAAUC,GAASpE,GAAS7I,GACtCoN,GAAUJ,IAAUC,IAAUE,GAAUhO,GAAaa,GACrDqN,EAAcL,GAASC,GAASE,GAAUC,EAC1C7M,EAAS8M,EAAc9K,GAAUvC,EAAMR,OAAQoG,IAAU,GACzDpG,EAASe,EAAOf,OAEpB,QAASxK,KAAOgL,GACT+M,GAAa3G,EAAe3G,KAAKO,EAAOhL,OACvCqY,KAEQ,UAAPrY,GAECmY,IAAkB,UAAPnY,GAA0B,UAAPA,IAE9BoY,IAAkB,UAAPpY,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDsY,GAAQtY,EAAKwK,MAElBe,EAAOgN,KAAKvY,GAGhB,OAAOuL,CACT,CASA,SAASiN,GAAY7N,GACnB,IAAIH,EAASG,EAAMH,OACnB,OAAOA,EAASG,EAAM8N,GAAW,EAAGjO,EAAS,IAAMxN,CACrD,CAUA,SAAS0b,GAAgB/N,EAAO6C,GAC9B,OAAOmL,GAAYC,GAAUjO,GAAQkO,GAAUrL,EAAG,EAAG7C,EAAMH,QAC7D,CASA,SAASsO,GAAanO,GACpB,OAAOgO,GAAYC,GAAUjO,GAC/B,CAWA,SAASoO,GAAiB5L,EAAQnN,EAAKgL,IAChCA,IAAUhO,IAAcgc,GAAG7L,EAAOnN,GAAMgL,IACxCA,IAAUhO,KAAegD,KAAOmN,KACnC8L,GAAgB9L,EAAQnN,EAAKgL,EAEjC,CAYA,SAASkO,GAAY/L,EAAQnN,EAAKgL,GAChC,IAAImO,EAAWhM,EAAOnN,KAChBoR,EAAe3G,KAAK0C,EAAQnN,KAAQgZ,GAAGG,EAAUnO,IAClDA,IAAUhO,KAAegD,KAAOmN,KACnC8L,GAAgB9L,EAAQnN,EAAKgL,EAEjC,CAUA,SAASoO,GAAazO,EAAO3K,GAE3B,QADIwK,EAASG,EAAMH,OACZA,KACL,GAAIwO,GAAGrO,EAAMH,GAAQ,GAAIxK,GACvB,OAAOwK,EAGX,OAAO,CACT,CAaA,SAAS6O,GAAe7M,EAAY5B,EAAQC,EAAUC,GACpDwO,UAAS9M,EAAY,SAASxB,EAAOhL,EAAKwM,GACxC5B,EAAOE,EAAaE,EAAOH,EAASG,GAAQwB,EAC9C,GACO1B,CACT,CAWA,SAASyO,GAAWpM,EAAQzJ,GAC1B,OAAOyJ,GAAUqM,GAAW9V,EAAQ8N,EAAK9N,GAASyJ,EACpD,CAwBA,SAAS8L,GAAgB9L,EAAQnN,EAAKgL,GACzB,aAAPhL,GAAsB8S,GACxBA,GAAe3F,EAAQnN,EAAK,CAC1ByZ,cAAgB,EAChBC,YAAc,EACd1O,MAASA,EACT2O,UAAY,IAGdxM,EAAOnN,GAAOgL,CAElB,CAUA,SAAS4O,GAAOzM,EAAQ0M,GAMtB,QALI9O,GAAQ,EACRP,EAASqP,EAAMrP,OACfe,EAASM,EAAMrB,GACfsP,EAAiB,MAAV3M,IAEFpC,EAAQP,GACfe,EAAOR,GAAS+O,EAAO9c,EAAY+c,GAAI5M,EAAQ0M,EAAM9O,IAEvD,OAAOQ,CACT,CAWA,SAASsN,GAAUmB,EAAQC,EAAOC,GAChC,OAAIF,GAAWA,IACTE,IAAUld,IACZgd,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUjd,IACZgd,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,CACT,CAkBA,SAASG,GAAUnP,EAAOoP,EAASC,EAAYra,EAAKmN,EAAQmN,GAC1D,IAAI/O,EACAgP,EArkFc,EAqkFLH,EACTI,EArkFc,EAqkFLJ,EACTK,EArkFiB,EAqkFRL,EAKb,GAHIC,IACF9O,EAAS4B,EAASkN,EAAWrP,EAAOhL,EAAKmN,EAAQmN,GAASD,EAAWrP,IAEnEO,IAAWvO,EACb,OAAOuO,EAET,IAAK+K,EAAStL,GACZ,OAAOA,EAET,IAAIgN,EAAQhC,EAAQhL,GACpB,GAAIgN,GAEF,GADAzM,EA68GJ,SAASmP,GAAe/P,GACtB,IAAIH,EAASG,EAAMH,OACfe,EAAS,IAAIZ,EAAMnP,YAAYgP,GAGnC,OAAIA,GAA6B,iBAAZG,EAAM,IAAkByG,EAAe3G,KAAKE,EAAO,WACtEY,EAAOR,MAAQJ,EAAMI,MACrBQ,EAAOoP,MAAQhQ,EAAMgQ,OAEhBpP,CACT,CAv9GamP,CAAe1P,IACnBuP,EACH,OAAO3B,GAAU5N,EAAOO,OAErB,CACL,IAAIqP,EAAMC,EAAO7P,GACb8P,EAASF,GAAO/Y,IAAW+Y,GAAO9Y,GAEtC,GAAI+R,GAAS7I,GACX,OAAO+P,GAAY/P,EAAOuP,GAE5B,GAAIK,GAAO3Y,IAAa2Y,GAAOpZ,IAAYsZ,IAAW3N,GAEpD,GADA5B,EAAUiP,GAAUM,EAAU,CAAC,EAAIE,GAAgBhQ,IAC9CuP,EACH,OAAOC,EA+nEf,SAASS,GAAcvX,EAAQyJ,GAC7B,OAAOqM,GAAW9V,EAAQwX,GAAaxX,GAASyJ,EAClD,CAhoEY8N,CAAcjQ,EAnH1B,SAASmQ,GAAahO,EAAQzJ,GAC5B,OAAOyJ,GAAUqM,GAAW9V,EAAQ0X,GAAO1X,GAASyJ,EACtD,CAiHiCgO,CAAa5P,EAAQP,IAknEtD,SAASqQ,GAAY3X,EAAQyJ,GAC3B,OAAOqM,GAAW9V,EAAQ4X,GAAW5X,GAASyJ,EAChD,CAnnEYkO,CAAYrQ,EAAOuO,GAAWhO,EAAQP,QAEvC,CACL,IAAKjD,EAAc6S,GACjB,OAAOzN,EAASnC,EAAQ,CAAC,EAE3BO,EA49GN,SAASgQ,GAAepO,EAAQyN,EAAKL,GACnC,IAAIiB,EAAOrO,EAAO3R,YAClB,OAAQof,GACN,KAAKpY,GACH,OAAOiZ,GAAiBtO,GAE1B,KAAKzL,GACL,KAAKC,GACH,OAAO,IAAI6Z,GAAMrO,GAEnB,KAAK1K,GACH,OA5nDN,SAASiZ,GAAcC,EAAUpB,GAC/B,IAAIqB,EAASrB,EAASkB,GAAiBE,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASngB,YAAYogB,EAAQD,EAASE,WAAYF,EAASG,WACxE,CAynDaJ,CAAcvO,EAAQoN,GAE/B,KAAK7X,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAO6Y,GAAgB5O,EAAQoN,GAEjC,KAAKxY,GACH,OAAO,IAAIyZ,EAEb,KAAKxZ,GACL,KAAKK,GACH,OAAO,IAAImZ,EAAKrO,GAElB,KAAKhL,GACH,OA/nDN,SAAS6Z,GAAYC,GACnB,IAAI1Q,EAAS,IAAI0Q,EAAOzgB,YAAYygB,EAAOvY,OAAQmB,GAAQ0M,KAAK0K,IAChE1Q,SAAOoE,UAAYsM,EAAOtM,UACnBpE,CACT,CA2nDayQ,CAAY7O,GAErB,KAAK/K,GACH,OAAO,IAAIoZ,EAEb,KAAKlZ,GACH,OAxnDN,SAAS4Z,GAAYC,GACnB,OAAOxG,GAAgBpN,EAAOoN,GAAclL,KAAK0R,IAAW,CAAC,CAC/D,CAsnDaD,CAAY/O,GAEzB,CA9/GeoO,CAAevQ,EAAO4P,EAAKL,EACtC,CACF,CAEAD,IAAUA,EAAQ,IAAI1C,IACtB,IAAIwE,EAAU9B,EAAMP,IAAI/O,GACxB,GAAIoR,EACF,OAAOA,EAET9B,EAAM9K,IAAIxE,EAAOO,GAEbtB,GAAMe,GACRA,EAAMiE,QAAQ,SAASoN,GACrB9Q,EAAOoM,IAAIwC,GAAUkC,EAAUjC,EAASC,EAAYgC,EAAUrR,EAAOsP,GACvE,GACSzQ,GAAMmB,IACfA,EAAMiE,QAAQ,SAASoN,EAAUrc,GAC/BuL,EAAOiE,IAAIxP,EAAKma,GAAUkC,EAAUjC,EAASC,EAAYra,EAAKgL,EAAOsP,GACvE,GAGF,IAIItM,EAAQgK,EAAQhb,GAJLyd,EACVD,EAAS8B,GAAeC,GACxB/B,EAASY,GAAS5J,GAEkBxG,GACzCC,UAAU+C,GAAShD,EAAO,SAASqR,EAAUrc,GACvCgO,IAEFqO,EAAWrR,EADXhL,EAAMqc,IAIRnD,GAAY3N,EAAQvL,EAAKma,GAAUkC,EAAUjC,EAASC,EAAYra,EAAKgL,EAAOsP,GAChF,GACO/O,CACT,CAwBA,SAASiR,GAAerP,EAAQzJ,EAAQsK,GACtC,IAAIxD,EAASwD,EAAMxD,OACnB,GAAc,MAAV2C,EACF,OAAQ3C,EAGV,IADA2C,EAAS5E,EAAO4E,GACT3C,KAAU,CACf,IAAIxK,EAAMgO,EAAMxD,GAEZQ,EAAQmC,EAAOnN,GAEnB,GAAKgL,IAAUhO,KAAegD,KAAOmN,MAAa/B,EAHlC1H,EAAO1D,IAGqCgL,GAC1D,OAAO,CAEX,CACA,OAAO,CACT,CAYA,SAASyR,GAAUpS,EAAMqS,EAAMnS,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAIwG,GAAU5P,GAEtB,OAAOoS,GAAW,WAAahJ,EAAKD,MAAMpN,EAAWuN,EAAO,EAAGmS,EACjE,CAaA,SAASC,GAAehS,EAAOoB,EAAQlB,EAAUc,GAC/C,IAAIZ,GAAQ,EACR6R,EAAWpR,GACXqR,GAAW,EACXrS,EAASG,EAAMH,OACfe,EAAS,GACTuR,EAAe/Q,EAAOvB,OAE1B,IAAKA,EACH,OAAOe,EAELV,IACFkB,EAASH,EAASG,EAAQ+B,GAAUjD,KAElCc,GACFiR,EAAWlR,GACXmR,GAAW,GAEJ9Q,EAAOvB,QAtvFG,MAuvFjBoS,EAAW3O,GACX4O,GAAW,EACX9Q,EAAS,IAAI0L,GAAS1L,IAExBgR,EACA,OAAShS,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdiS,EAAuB,MAAZnS,EAAmBG,EAAQH,EAASG,GAGnD,GADAA,EAASW,GAAwB,IAAVX,EAAeA,EAAQ,EAC1C6R,GAAYG,GAAaA,EAAU,CAErC,QADIC,EAAcH,EACXG,KACL,GAAIlR,EAAOkR,KAAiBD,EAC1B,SAASD,EAGbxR,EAAOgN,KAAKvN,EACd,MACU4R,EAAS7Q,EAAQiR,EAAUrR,IACnCJ,EAAOgN,KAAKvN,EAEhB,CACA,OAAOO,CACT,CAlkCAuK,EAAOoH,iBAAmB,CAQxBC,OAAUvZ,GAQVwZ,SAAYvZ,GAQZwZ,YAAevZ,GAQfwZ,SAAY,GAQZC,QAAW,CAQTpN,EAAK2F,KAKTA,EAAO/E,UAAYwF,GAAWxF,WACbvV,YAAcsa,GAE/BI,GAAcnF,UAAYqF,GAAWG,GAAWxF,YACxBvV,YAAc0a,IAsHtCD,EAAYlF,UAAYqF,GAAWG,GAAWxF,YACxBvV,YAAcya,EAoGpCkB,GAAKpG,UAAUsG,MAvEf,SAASmG,KACP7hB,KAAK+b,SAAWzC,GAAeA,GAAa,MAAQ,CAAC,EACrDtZ,KAAKqT,KAAO,CACd,EAqEAmI,GAAKpG,UAAU0M,OAzDf,SAASC,GAAW1d,GAClB,IAAIuL,EAAS5P,KAAKwS,IAAInO,WAAerE,KAAK+b,SAAS1X,GACnD,OAAArE,KAAKqT,MAAQzD,EAAS,EAAI,EACnBA,CACT,EAsDA4L,GAAKpG,UAAUgJ,IA3Cf,SAAS4D,GAAQ3d,GACf,IAAI6X,EAAOlc,KAAK+b,SAChB,GAAIzC,GAAc,CAChB,IAAI1J,EAASsM,EAAK7X,GAClB,OAAOuL,IAAWrK,GAAiBlE,EAAYuO,CACjD,CACA,OAAO6F,EAAe3G,KAAKoN,EAAM7X,GAAO6X,EAAK7X,GAAOhD,CACtD,EAqCAma,GAAKpG,UAAU5C,IA1Bf,SAASyP,GAAQ5d,GACf,IAAI6X,EAAOlc,KAAK+b,SAChB,OAAOzC,GAAgB4C,EAAK7X,KAAShD,EAAaoU,EAAe3G,KAAKoN,EAAM7X,EAC9E,EAwBAmX,GAAKpG,UAAUvB,IAZf,SAASqO,GAAQ7d,EAAKgL,GACpB,IAAI6M,EAAOlc,KAAK+b,SAChB,OAAA/b,KAAKqT,MAAQrT,KAAKwS,IAAInO,GAAO,EAAI,EACjC6X,EAAK7X,GAAQiV,IAAgBjK,IAAUhO,EAAakE,GAAiB8J,EAC9DrP,IACT,EAwHA4b,GAAUxG,UAAUsG,MApFpB,SAASyG,KACPniB,KAAK+b,SAAW,GAChB/b,KAAKqT,KAAO,CACd,EAkFAuI,GAAUxG,UAAU0M,OAvEpB,SAASM,GAAgB/d,GACvB,IAAI6X,EAAOlc,KAAK+b,SACZ3M,EAAQqO,GAAavB,EAAM7X,GAE/B,QAAI+K,EAAQ,IAIRA,GADY8M,EAAKrN,OAAS,EAE5BqN,EAAKmG,MAELzL,GAAO9H,KAAKoN,EAAM9M,EAAO,KAEzBpP,KAAKqT,KACA,GACT,EAyDAuI,GAAUxG,UAAUgJ,IA9CpB,SAASkE,GAAaje,GACpB,IAAI6X,EAAOlc,KAAK+b,SACZ3M,EAAQqO,GAAavB,EAAM7X,GAE/B,OAAO+K,EAAQ,EAAI/N,EAAY6a,EAAK9M,GAAO,EAC7C,EA0CAwM,GAAUxG,UAAU5C,IA/BpB,SAAS+P,GAAale,GACpB,OAAOoZ,GAAazd,KAAK+b,SAAU1X,IAAO,CAC5C,EA8BAuX,GAAUxG,UAAUvB,IAlBpB,SAAS2O,GAAane,EAAKgL,GACzB,IAAI6M,EAAOlc,KAAK+b,SACZ3M,EAAQqO,GAAavB,EAAM7X,GAE/B,OAAI+K,EAAQ,KACRpP,KAAKqT,KACP6I,EAAKU,KAAK,CAACvY,EAAKgL,KAEhB6M,EAAK9M,GAAO,GAAKC,EAEZrP,IACT,EA0GA6b,GAASzG,UAAUsG,MAtEnB,SAAS+G,KACPziB,KAAKqT,KAAO,EACZrT,KAAK+b,SAAW,CACd2G,KAAQ,IAAIlH,GACZpI,IAAO,IAAK8F,IAAO0C,IACnB7J,OAAU,IAAIyJ,GAElB,EAgEAK,GAASzG,UAAU0M,OArDnB,SAASa,GAAete,GACtB,IAAIuL,EAASgT,GAAW5iB,KAAMqE,GAAKyd,OAAUzd,GAC7C,OAAArE,KAAKqT,MAAQzD,EAAS,EAAI,EACnBA,CACT,EAkDAiM,GAASzG,UAAUgJ,IAvCnB,SAASyE,GAAYxe,GACnB,OAAOue,GAAW5iB,KAAMqE,GAAK+Z,IAAI/Z,EACnC,EAsCAwX,GAASzG,UAAU5C,IA3BnB,SAASsQ,GAAYze,GACnB,OAAOue,GAAW5iB,KAAMqE,GAAKmO,IAAInO,EACnC,EA0BAwX,GAASzG,UAAUvB,IAdnB,SAASkP,GAAY1e,EAAKgL,GACxB,IAAI6M,EAAO0G,GAAW5iB,KAAMqE,GACxBgP,EAAO6I,EAAK7I,KAEhB6I,SAAKrI,IAAIxP,EAAKgL,GACdrP,KAAKqT,MAAQ6I,EAAK7I,MAAQA,EAAO,EAAI,EAC9BrT,IACT,EA0DA8b,GAAS1G,UAAU4G,IAAMF,GAAS1G,UAAUwH,KAnB5C,SAASoG,GAAY3T,GACnB,OAAArP,KAAK+b,SAASlI,IAAIxE,EAAO9J,IAClBvF,IACT,EAiBA8b,GAAS1G,UAAU5C,IANnB,SAASyQ,GAAY5T,GACnB,OAAOrP,KAAK+b,SAASvJ,IAAInD,EAC3B,EAsGA4M,GAAM7G,UAAUsG,MA3EhB,SAASwH,KACPljB,KAAK+b,SAAW,IAAIH,GACpB5b,KAAKqT,KAAO,CACd,EAyEA4I,GAAM7G,UAAU0M,OA9DhB,SAASqB,GAAY9e,GACnB,IAAI6X,EAAOlc,KAAK+b,SACZnM,EAASsM,EAAK4F,OAAUzd,GAE5B,OAAArE,KAAKqT,KAAO6I,EAAK7I,KACVzD,CACT,EAyDAqM,GAAM7G,UAAUgJ,IA9ChB,SAASgF,GAAS/e,GAChB,OAAOrE,KAAK+b,SAASqC,IAAI/Z,EAC3B,EA6CA4X,GAAM7G,UAAU5C,IAlChB,SAAS6Q,GAAShf,GAChB,OAAOrE,KAAK+b,SAASvJ,IAAInO,EAC3B,EAiCA4X,GAAM7G,UAAUvB,IArBhB,SAASyP,GAASjf,EAAKgL,GACrB,IAAI6M,EAAOlc,KAAK+b,SAChB,GAAIG,aAAgBN,GAAW,CAC7B,IAAI2H,EAAQrH,EAAKH,SACjB,IAAK7C,IAAQqK,EAAM1U,OAAS2U,IAC1BD,SAAM3G,KAAK,CAACvY,EAAKgL,IACjBrP,KAAKqT,OAAS6I,EAAK7I,KACZrT,KAETkc,EAAOlc,KAAK+b,SAAW,IAAIF,GAAS0H,EACtC,CACArH,SAAKrI,IAAIxP,EAAKgL,GACdrP,KAAKqT,KAAO6I,EAAK7I,KACVrT,IACT,EAqcA,IAAI2d,GAAW8F,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUhT,EAAYpB,GAC7B,IAAIG,GAAS,EACb+N,UAAS9M,EAAY,SAASxB,EAAOD,EAAOyB,GAC1CjB,WAAWH,EAAUJ,EAAOD,EAAOyB,EAErC,GACOjB,CACT,CAYA,SAASkU,GAAa9U,EAAOE,EAAUc,GAIrC,QAHIZ,GAAQ,EACRP,EAASG,EAAMH,SAEVO,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACduC,EAAUzC,EAASG,GAEvB,GAAe,MAAXsC,IAAoB0P,IAAahgB,EAC5BsQ,GAAYA,IAAYoS,GAASpS,GAClC3B,EAAW2B,EAAS0P,IAE1B,IAAIA,EAAW1P,EACX/B,EAASP,CAEjB,CACA,OAAOO,CACT,CAsCA,SAASoU,GAAWnT,EAAYpB,GAC9B,IAAIG,EAAS,GACb+N,UAAS9M,EAAY,SAASxB,EAAOD,EAAOyB,GACtCpB,EAAUJ,EAAOD,EAAOyB,IAC1BjB,EAAOgN,KAAKvN,EAEhB,GACOO,CACT,CAaA,SAASqU,EAAYjV,EAAOkV,EAAOzU,EAAW0U,EAAUvU,GACtD,IAAIR,GAAQ,EACRP,EAASG,EAAMH,OAKnB,IAHAY,IAAcA,EAAY2U,IAC1BxU,IAAWA,EAAS,MAEXR,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACd8U,EAAQ,GAAKzU,EAAUJ,GACrB6U,EAAQ,EAEVD,EAAY5U,EAAO6U,EAAQ,EAAGzU,EAAW0U,EAAUvU,GAEnDO,GAAUP,EAAQP,GAEV8U,IACVvU,EAAOA,EAAOf,QAAUQ,EAE5B,CACA,OAAOO,CACT,CAaA,IAAIyU,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAWlS,EAAQtC,GAC1B,OAAOsC,GAAU6S,GAAQ7S,EAAQtC,EAAU2G,EAC7C,CAUA,SAAS+N,GAAgBpS,EAAQtC,GAC/B,OAAOsC,GAAU+S,GAAa/S,EAAQtC,EAAU2G,EAClD,CAWA,SAAS2O,GAAchT,EAAQa,GAC7B,OAAO3C,GAAY2C,EAAO,SAAShO,GACjC,OAAOogB,GAAWjT,EAAOnN,GAC3B,EACF,CAUA,SAASqgB,GAAQlT,EAAQmT,GAMvB,QAHIvV,EAAQ,EACRP,GAHJ8V,EAAOC,GAASD,EAAMnT,IAGJ3C,OAED,MAAV2C,GAAkBpC,EAAQP,GAC/B2C,EAASA,EAAOqT,GAAMF,EAAKvV,OAE7B,OAAQA,GAASA,GAASP,EAAU2C,EAASnQ,CAC/C,CAaA,SAASyjB,GAAetT,EAAQuT,EAAUC,GACxC,IAAIpV,EAASmV,EAASvT,GACtB,OAAO6I,EAAQ7I,GAAU5B,EAASO,GAAUP,EAAQoV,EAAYxT,GAClE,CASA,SAASyT,EAAW5V,GAClB,OAAa,MAATA,EACKA,IAAUhO,EAn7FJ,qBARL,gBA67FF4V,IAAkBA,MAAkBrK,EAAOyC,GA23FrD,SAAS6V,GAAU7V,GACjB,IAAI8V,EAAQ1P,EAAe3G,KAAKO,EAAO4H,IACnCgI,EAAM5P,EAAM4H,IAEhB,IACE5H,EAAM4H,IAAkB5V,EACxB,IAAI+jB,GAAW,CACjB,OAAa,CAEb,IAAIxV,EAASmG,GAAqBjH,KAAKO,GACvC,OAAI+V,IACED,EACF9V,EAAM4H,IAAkBgI,SAEjB5P,EAAM4H,KAGVrH,CACT,CA54FMsV,CAAU7V,GA+5GhB,SAASgW,GAAehW,GACtB,OAAO0G,GAAqBjH,KAAKO,EACnC,CAh6GMgW,CAAehW,EACrB,CAWA,SAASiW,GAAOjW,EAAOkW,GACrB,OAAOlW,EAAQkW,CACjB,CAUA,SAASC,GAAQhU,EAAQnN,GACvB,OAAiB,MAAVmN,GAAkBiE,EAAe3G,KAAK0C,EAAQnN,EACvD,CAUA,SAASohB,GAAUjU,EAAQnN,GACzB,OAAiB,MAAVmN,GAAkBnN,KAAOuI,EAAO4E,EACzC,CAyBA,SAASkU,GAAiBC,EAAQzW,EAAUc,GAS1C,QARIiR,EAAWjR,EAAaD,GAAoBF,GAC5ChB,EAAS8W,EAAO,GAAG9W,OACnB+W,EAAYD,EAAO9W,OACnBgX,EAAWD,EACXE,EAAS5V,EAAM0V,GACfG,EAAYC,IACZpW,EAAS,GAENiW,KAAY,CACjB,IAAI7W,EAAQ2W,EAAOE,GACfA,GAAY3W,IACdF,EAAQiB,EAASjB,EAAOmD,GAAUjD,KAEpC6W,EAAYtN,EAAUzJ,EAAMH,OAAQkX,GACpCD,EAAOD,IAAa7V,IAAed,GAAaL,GAAU,KAAOG,EAAMH,QAAU,KAC7E,IAAIiN,GAAS+J,GAAY7W,GACzB3N,CACN,CACA2N,EAAQ2W,EAAO,GAEf,IAAIvW,GAAQ,EACR6W,EAAOH,EAAO,GAElB1E,EACA,OAAShS,EAAQP,GAAUe,EAAOf,OAASkX,GAAW,CACpD,IAAI1W,EAAQL,EAAMI,GACdiS,EAAWnS,EAAWA,EAASG,GAASA,EAG5C,GADAA,EAASW,GAAwB,IAAVX,EAAeA,EAAQ,IACxC4W,EACE3T,GAAS2T,EAAM5E,GACfJ,EAASrR,EAAQyR,EAAUrR,IAC5B,CAEL,IADA6V,EAAWD,IACFC,GAAU,CACjB,IAAItT,EAAQuT,EAAOD,GACnB,KAAMtT,EACED,GAASC,EAAO8O,GAChBJ,EAAS0E,EAAOE,GAAWxE,EAAUrR,IAE3C,SAASoR,CAEb,CACI6E,GACFA,EAAKrJ,KAAKyE,GAEZzR,EAAOgN,KAAKvN,EACd,CACF,CACA,OAAOO,CACT,CA8BA,SAASsW,GAAW1U,EAAQmT,EAAM/V,GAGhC,IAAIF,EAAiB,OADrB8C,EAAS2U,GAAO3U,EADhBmT,EAAOC,GAASD,EAAMnT,KAEMA,EAASA,EAAOqT,GAAMuB,GAAKzB,KACvD,OAAe,MAARjW,EAAerN,EAAYoN,GAAMC,EAAM8C,EAAQ5C,EACxD,CASA,SAASyX,GAAgBhX,GACvB,OAAO+K,EAAa/K,IAAU4V,EAAW5V,IAAUxJ,EACrD,CAsCA,SAASygB,GAAYjX,EAAOkW,EAAO9G,EAASC,EAAYC,GACtD,OAAItP,IAAUkW,IAGD,MAATlW,GAA0B,MAATkW,IAAmBnL,EAAa/K,KAAW+K,EAAamL,GACpElW,GAAUA,GAASkW,GAAUA,EAmBxC,SAASgB,GAAgB/U,EAAQ+T,EAAO9G,EAASC,EAAY8H,EAAW7H,GACtE,IAAI8H,EAAWpM,EAAQ7I,GACnBkV,EAAWrM,EAAQkL,GACnBoB,EAASF,EAAW3gB,GAAWoZ,EAAO1N,GACtCoV,EAASF,EAAW5gB,GAAWoZ,EAAOqG,GAKtCsB,GAHJF,EAASA,GAAU9gB,GAAUS,GAAYqgB,IAGhBrgB,GACrBwgB,GAHJF,EAASA,GAAU/gB,GAAUS,GAAYsgB,IAGhBtgB,GACrBygB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa7O,GAAS1G,GAAS,CACjC,IAAK0G,GAASqN,GACZ,OAAO,EAETkB,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAChBlI,WAAUA,EAAQ,IAAI1C,IACdwK,GAAYjY,GAAagD,GAC7BwV,GAAYxV,EAAQ+T,EAAO9G,EAASC,EAAY8H,EAAW7H,GA81EnE,SAASsI,GAAWzV,EAAQ+T,EAAOtG,EAAKR,EAASC,EAAY8H,EAAW7H,GACtE,OAAQM,GACN,KAAKnY,GACH,GAAK0K,EAAO2O,YAAcoF,EAAMpF,YAC3B3O,EAAO0O,YAAcqF,EAAMrF,WAC9B,OAAO,EAET1O,EAASA,EAAOyO,OAChBsF,EAAQA,EAAMtF,OAEhB,KAAKpZ,GACH,QAAK2K,EAAO2O,YAAcoF,EAAMpF,aAC3BqG,EAAU,IAAInQ,GAAW7E,GAAS,IAAI6E,GAAWkP,KAKxD,KAAKxf,GACL,KAAKC,GACL,KAAKK,GAGH,OAAOgX,IAAI7L,GAAS+T,GAEtB,KAAKtf,GACH,OAAOuL,EAAO/M,MAAQ8gB,EAAM9gB,MAAQ+M,EAAO0V,SAAW3B,EAAM2B,QAE9D,KAAK1gB,GACL,KAAKE,GAIH,OAAO8K,GAAW+T,EAAQ,GAE5B,KAAKnf,GACH,IAAI+gB,EAAUhU,GAEhB,KAAK1M,GAIH,GAFA0gB,IAAYA,EAAUvT,IAElBpC,EAAO6B,MAAQkS,EAAMlS,QA3nLN,EAwnLHoL,GAId,OAAO,EAGT,IAAIgC,EAAU9B,EAAMP,IAAI5M,GACxB,GAAIiP,EACF,OAAOA,GAAW8E,EAEpB9G,GAloLqB,EAqoLrBE,EAAM9K,IAAIrC,EAAQ+T,GAClB,IAAI3V,EAASoX,GAAYG,EAAQ3V,GAAS2V,EAAQ5B,GAAQ9G,EAASC,EAAY8H,EAAW7H,GAC1FA,SAAMmD,OAAUtQ,GACT5B,EAET,KAAKjJ,GACH,GAAIqT,GACF,OAAOA,GAAclL,KAAK0C,IAAWwI,GAAclL,KAAKyW,GAG9D,OAAO,CACT,CA55EQ0B,CAAWzV,EAAQ+T,EAAOoB,EAAQlI,EAASC,EAAY8H,EAAW7H,GAExE,KAvvGuB,EAuvGjBF,GAAiC,CACrC,IAAI2I,EAAeP,GAAYpR,EAAe3G,KAAK0C,EAAQ,eACvD6V,EAAeP,GAAYrR,EAAe3G,KAAKyW,EAAO,eAE1D,GAAI6B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe5V,EAAOnC,QAAUmC,EAC/C+V,EAAeF,EAAe9B,EAAMlW,QAAUkW,EAElD5G,WAAUA,EAAQ,IAAI1C,IACfuK,EAAUc,EAAcC,EAAc9I,EAASC,EAAYC,EACpE,CACF,CACA,QAAKoI,IAGLpI,IAAUA,EAAQ,IAAI1C,IA05ExB,SAASuL,GAAahW,EAAQ+T,EAAO9G,EAASC,EAAY8H,EAAW7H,GACnE,IAAI8I,EAjqLmB,EAiqLPhJ,EACZiJ,EAAW9G,GAAWpP,GACtBmW,EAAYD,EAAS7Y,OAIzB,GAAI8Y,GAHW/G,GAAW2E,GACD1W,SAEM4Y,EAC7B,OAAO,EAGT,QADIrY,EAAQuY,EACLvY,KAAS,CACd,IAAI/K,EAAMqjB,EAAStY,GACnB,KAAMqY,EAAYpjB,KAAOkhB,EAAQ9P,EAAe3G,KAAKyW,EAAOlhB,IAC1D,OAAO,CAEX,CAEA,IAAIujB,EAAajJ,EAAMP,IAAI5M,GACvBqW,EAAalJ,EAAMP,IAAImH,GAC3B,GAAIqC,GAAcC,EAChB,OAAOD,GAAcrC,GAASsC,GAAcrW,EAE9C,IAAI5B,GAAS,EACb+O,EAAM9K,IAAIrC,EAAQ+T,GAClB5G,EAAM9K,IAAI0R,EAAO/T,GAGjB,QADIsW,EAAWL,IACNrY,EAAQuY,GAAW,CAE1B,IAAInK,EAAWhM,EADfnN,EAAMqjB,EAAStY,IAEX2Y,EAAWxC,EAAMlhB,GAErB,GAAIqa,EACF,IAAIsJ,GAAWP,EACX/I,EAAWqJ,EAAUvK,EAAUnZ,EAAKkhB,EAAO/T,EAAQmN,GACnDD,EAAWlB,EAAUuK,EAAU1jB,EAAKmN,EAAQ+T,EAAO5G,GAGzD,KAAMqJ,KAAa3mB,EACVmc,IAAauK,GAAYvB,EAAUhJ,EAAUuK,EAAUtJ,EAASC,EAAYC,GAC7EqJ,IACD,CACLpY,GAAS,EACT,KACF,CACAkY,IAAaA,EAAkB,eAAPzjB,EAC1B,CACA,GAAIuL,IAAWkY,EAAU,CACvB,IAAIG,EAAUzW,EAAO3R,YACjBqoB,GAAU3C,EAAM1lB,YAGhBooB,GAAWC,IACV,gBAAiB1W,GAAU,gBAAiB+T,KACzB,mBAAX0C,GAAyBA,aAAmBA,GACjC,mBAAXC,IAAyBA,cAAmBA,MACvDtY,GAAS,EAEb,CACA+O,SAAMmD,OAAUtQ,GAChBmN,EAAMmD,OAAUyD,GACT3V,CACT,CAx9ES4X,CAAahW,EAAQ+T,EAAO9G,EAASC,EAAY8H,EAAW7H,GACrE,CA5DS4H,CAAgBlX,EAAOkW,EAAO9G,EAASC,EAAY4H,GAAa3H,GACzE,CAkFA,SAASwJ,GAAY3W,EAAQzJ,EAAQqgB,EAAW1J,GAC9C,IAAItP,EAAQgZ,EAAUvZ,OAClBA,EAASO,EACTiZ,GAAgB3J,EAEpB,GAAc,MAAVlN,EACF,OAAQ3C,EAGV,IADA2C,EAAS5E,EAAO4E,GACTpC,KAAS,CACd,IAAI8M,EAAOkM,EAAUhZ,GACrB,GAAKiZ,GAAgBnM,EAAK,GAClBA,EAAK,KAAO1K,EAAO0K,EAAK,MACtBA,EAAK,KAAM1K,GAEnB,OAAO,CAEX,CACA,OAASpC,EAAQP,GAAQ,CAEvB,IAAIxK,GADJ6X,EAAOkM,EAAUhZ,IACF,GACXoO,EAAWhM,EAAOnN,GAClBikB,EAAWpM,EAAK,GAEpB,GAAImM,GAAgBnM,EAAK,IACvB,GAAIsB,IAAanc,KAAegD,KAAOmN,GACrC,OAAO,MAEJ,CACL,IAAImN,EAAQ,IAAI1C,GAChB,GAAIyC,EACF,IAAI9O,EAAS8O,EAAWlB,EAAU8K,EAAUjkB,EAAKmN,EAAQzJ,EAAQ4W,GAEnE,KAAM/O,IAAWvO,EACTilB,GAAYgC,EAAU9K,EAAU+K,EAA+C7J,EAAYC,GAC3F/O,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,CAUA,SAAS4Y,GAAanZ,GACpB,SAAKsL,EAAStL,IA05FhB,SAASoZ,GAAS/Z,GAChB,QAASiH,IAAeA,MAAcjH,CACxC,CA55F0B+Z,CAASpZ,MAGnBoV,GAAWpV,GAAS6G,GAAa7M,IAChC6J,KAAKwG,GAASrK,GAC/B,CA2CA,SAASqZ,GAAarZ,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKsZ,GAEW,iBAATtZ,EACFgL,EAAQhL,GACXuZ,GAAoBvZ,EAAM,GAAIA,EAAM,IACpCwZ,GAAYxZ,GAEXyZ,GAASzZ,EAClB,CASA,SAAS0Z,GAASvX,GAChB,IAAKwX,GAAYxX,GACf,OAAO8G,GAAW9G,GAEpB,IAAI5B,EAAS,GACb,QAASvL,KAAOuI,EAAO4E,GACjBiE,EAAe3G,KAAK0C,EAAQnN,IAAe,eAAPA,GACtCuL,EAAOgN,KAAKvY,GAGhB,OAAOuL,CACT,CAiCA,SAASqZ,GAAO5Z,EAAOkW,GACrB,OAAOlW,EAAQkW,CACjB,CAUA,SAAS2D,GAAQrY,EAAY3B,GAC3B,IAAIE,GAAQ,EACRQ,EAASuZ,GAAYtY,GAAcX,EAAMW,EAAWhC,QAAU,GAElE8O,UAAS9M,EAAY,SAASxB,EAAOhL,EAAKwM,GACxCjB,IAASR,GAASF,EAASG,EAAOhL,EAAKwM,EACzC,GACOjB,CACT,CASA,SAASiZ,GAAY9gB,GACnB,IAAIqgB,EAAYgB,GAAarhB,GAC7B,OAAwB,GAApBqgB,EAAUvZ,QAAeuZ,EAAU,GAAG,GACjCiB,GAAwBjB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAS5W,GACd,OAAOA,IAAWzJ,GAAUogB,GAAY3W,EAAQzJ,EAAQqgB,EAC1D,CACF,CAUA,SAASQ,GAAoBjE,EAAM2D,GACjC,OAAIgB,GAAM3E,IAAS4E,GAAmBjB,GAC7Be,GAAwBxE,GAAMF,GAAO2D,GAEvC,SAAS9W,GACd,IAAIgM,EAAWY,GAAI5M,EAAQmT,GAC3B,OAAQnH,IAAanc,GAAamc,IAAa8K,EAC3CkB,GAAMhY,EAAQmT,GACd2B,GAAYgC,EAAU9K,EAAU+K,EACtC,CACF,CAaA,SAASkB,GAAUjY,EAAQzJ,EAAQ2hB,EAAUhL,EAAYC,GACnDnN,IAAWzJ,GAGfsc,GAAQtc,EAAQ,SAASugB,EAAUjkB,GAEjC,GADAsa,IAAUA,EAAQ,IAAI1C,IAClBtB,EAAS2N,IA+BjB,SAASqB,GAAcnY,EAAQzJ,EAAQ1D,EAAKqlB,EAAUE,EAAWlL,EAAYC,GAC3E,IAAInB,EAAWqM,GAAQrY,EAAQnN,GAC3BikB,EAAWuB,GAAQ9hB,EAAQ1D,GAC3Boc,EAAU9B,EAAMP,IAAIkK,GAExB,GAAI7H,EACFrD,GAAiB5L,EAAQnN,EAAKoc,OADhC,CAIA,IAAIqJ,EAAWpL,EACXA,EAAWlB,EAAU8K,EAAWjkB,EAAM,GAAKmN,EAAQzJ,EAAQ4W,GAC3Dtd,EAEA6f,EAAW4I,IAAazoB,EAE5B,GAAI6f,EAAU,CACZ,IAAI7E,EAAQhC,EAAQiO,GAChB9L,GAAUH,GAASnE,GAASoQ,GAC5ByB,GAAW1N,IAAUG,GAAUhO,GAAa8Z,GAEhDwB,EAAWxB,EACPjM,GAASG,GAAUuN,EACjB1P,EAAQmD,GACVsM,EAAWtM,EAEJwM,EAAkBxM,GACzBsM,EAAW7M,GAAUO,GAEdhB,GACP0E,GAAW,EACX4I,EAAW1K,GAAYkJ,GAAU,IAE1ByB,GACP7I,GAAW,EACX4I,EAAW1J,GAAgBkI,GAAU,IAGrCwB,EAAW,GAGNG,GAAc3B,IAAa/L,GAAY+L,IAC9CwB,EAAWtM,EACPjB,GAAYiB,GACdsM,EAAWI,GAAc1M,KAEjB7C,EAAS6C,IAAaiH,GAAWjH,MACzCsM,EAAWzK,GAAgBiJ,KAI7BpH,GAAW,CAEf,CACIA,IAEFvC,EAAM9K,IAAIyU,EAAUwB,GACpBF,EAAUE,EAAUxB,EAAUoB,EAAUhL,EAAYC,GACpDA,EAAMmD,OAAUwG,IAElBlL,GAAiB5L,EAAQnN,EAAKylB,EAnD9B,CAoDF,CA1FMH,CAAcnY,EAAQzJ,EAAQ1D,EAAKqlB,EAAUD,GAAW/K,EAAYC,OAEjE,CACH,IAAImL,EAAWpL,EACXA,EAAWmL,GAAQrY,EAAQnN,GAAMikB,EAAWjkB,EAAM,GAAKmN,EAAQzJ,EAAQ4W,GACvEtd,EAEAyoB,IAAazoB,IACfyoB,EAAWxB,GAEblL,GAAiB5L,EAAQnN,EAAKylB,EAChC,CACF,EAAGrK,GACL,CAuFA,SAAS0K,GAAQnb,EAAO6C,GACtB,IAAIhD,EAASG,EAAMH,OACnB,GAAKA,EAGLgD,OACO8K,GADP9K,GAAKA,EAAI,EAAIhD,EAAS,EACJA,GAAUG,EAAM6C,GAAKxQ,CACzC,CAWA,SAAS+oB,GAAYvZ,EAAYwZ,EAAWC,GAExCD,EADEA,EAAUxb,OACAoB,EAASoa,EAAW,SAASnb,GACvC,OAAImL,EAAQnL,GACH,SAASG,GACd,OAAOqV,GAAQrV,EAA2B,IAApBH,EAASL,OAAeK,EAAS,GAAKA,EAC9D,EAEKA,CACT,GAEY,CAACyZ,IAGf,IAAIvZ,GAAQ,EAUZ,OATAib,EAAYpa,EAASoa,EAAWlY,GAAUoY,MAnxF9C,SAASC,GAAWxb,EAAOyb,GACzB,IAAI5b,EAASG,EAAMH,OAGnB,IADAG,EAAM0b,KAAKD,GACJ5b,KACLG,EAAMH,GAAUG,EAAMH,GAAQQ,MAEhC,OAAOL,CACT,CAoxFWwb,CAPMtB,GAAQrY,EAAY,SAASxB,EAAOhL,EAAKwM,GAIpD,MAAO,CAAE8Z,SAHM1a,EAASoa,EAAW,SAASnb,GAC1C,OAAOA,EAASG,EAClB,GAC+BD,QAAWA,EAAOC,MAASA,EAC5D,GAE0B,SAASmC,EAAQ+T,GACzC,OA04BJ,SAASqF,GAAgBpZ,EAAQ+T,EAAO+E,GAOtC,QANIlb,GAAQ,EACRyb,EAAcrZ,EAAOmZ,SACrBG,EAAcvF,EAAMoF,SACpB9b,EAASgc,EAAYhc,OACrBkc,EAAeT,EAAOzb,SAEjBO,EAAQP,GAAQ,CACvB,IAAIe,EAASob,GAAiBH,EAAYzb,GAAQ0b,EAAY1b,IAC9D,GAAIQ,EACF,OAAIR,GAAS2b,EACJnb,EAGFA,GAAmB,QADd0a,EAAOlb,IACgB,EAAK,EAE5C,CAQA,OAAOoC,EAAOpC,MAAQmW,EAAMnW,KAC9B,CAn6BWwb,CAAgBpZ,EAAQ+T,EAAO+E,EACxC,EACF,CA0BA,SAASW,GAAWzZ,EAAQ0M,EAAOzO,GAKjC,QAJIL,GAAQ,EACRP,EAASqP,EAAMrP,OACfe,EAAS,CAAC,IAELR,EAAQP,GAAQ,CACvB,IAAI8V,EAAOzG,EAAM9O,GACbC,EAAQqV,GAAQlT,EAAQmT,GAExBlV,EAAUJ,EAAOsV,IACnBuG,GAAQtb,EAAQgV,GAASD,EAAMnT,GAASnC,EAE5C,CACA,OAAOO,CACT,CA0BA,SAASub,GAAYnc,EAAOoB,EAAQlB,EAAUc,GAC5C,IAAIob,EAAUpb,EAAaoB,GAAkBtB,GACzCV,GAAQ,EACRP,EAASuB,EAAOvB,OAChBoX,EAAOjX,EAQX,IANIA,IAAUoB,IACZA,EAAS6M,GAAU7M,IAEjBlB,IACF+W,EAAOhW,EAASjB,EAAOmD,GAAUjD,OAE1BE,EAAQP,GAKf,QAJImC,EAAY,EACZ3B,EAAQe,EAAOhB,GACfiS,EAAWnS,EAAWA,EAASG,GAASA,GAEpC2B,EAAYoa,EAAQnF,EAAM5E,EAAUrQ,EAAWhB,KAAe,GAChEiW,IAASjX,GACX4H,GAAO9H,KAAKmX,EAAMjV,EAAW,GAE/B4F,GAAO9H,KAAKE,EAAOgC,EAAW,GAGlC,OAAOhC,CACT,CAWA,SAASqc,GAAWrc,EAAOsc,GAIzB,QAHIzc,EAASG,EAAQsc,EAAQzc,OAAS,EAClCmF,EAAYnF,EAAS,EAElBA,KAAU,CACf,IAAIO,EAAQkc,EAAQzc,GACpB,GAAIA,GAAUmF,GAAa5E,IAAUmc,EAAU,CAC7C,IAAIA,EAAWnc,EACXuN,GAAQvN,GACVwH,GAAO9H,KAAKE,EAAOI,EAAO,GAE1Boc,GAAUxc,EAAOI,EAErB,CACF,CACA,OAAOJ,CACT,CAWA,SAAS8N,GAAWwB,EAAOC,GACzB,OAAOD,EAAQzG,GAAYgB,MAAkB0F,EAAQD,EAAQ,GAC/D,CAiCA,SAASmN,GAAW1Z,EAAQF,GAC1B,IAAIjC,EAAS,GACb,IAAKmC,GAAUF,EAAI,GAAKA,EAAInM,GAC1B,OAAOkK,EAIT,GACMiC,EAAI,IACNjC,GAAUmC,IAEZF,EAAIgG,GAAYhG,EAAI,MAElBE,GAAUA,SAELF,GAET,OAAOjC,CACT,CAUA,SAAS8b,EAAShd,EAAMid,GACtB,OAAOC,GAAYC,GAASnd,EAAMid,EAAOhD,IAAWja,EAAO,GAC7D,CASA,SAASod,GAAWjb,GAClB,OAAOgM,GAAYzM,GAAOS,GAC5B,CAUA,SAASkb,GAAelb,EAAYgB,GAClC,IAAI7C,EAAQoB,GAAOS,GACnB,OAAOmM,GAAYhO,EAAOkO,GAAUrL,EAAG,EAAG7C,EAAMH,QAClD,CAYA,SAASqc,GAAQ1Z,EAAQmT,EAAMtV,EAAOqP,GACpC,IAAK/D,EAASnJ,GACZ,OAAOA,EAST,QALIpC,GAAQ,EACRP,GAHJ8V,EAAOC,GAASD,EAAMnT,IAGJ3C,OACdmF,EAAYnF,EAAS,EACrBmd,EAASxa,EAEI,MAAVwa,KAAoB5c,EAAQP,GAAQ,CACzC,IAAIxK,EAAMwgB,GAAMF,EAAKvV,IACjB0a,EAAWza,EAEf,GAAY,cAARhL,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOmN,EAGT,GAAIpC,GAAS4E,EAAW,CACtB,IAAIwJ,EAAWwO,EAAO3nB,IACtBylB,EAAWpL,EAAaA,EAAWlB,EAAUnZ,EAAK2nB,GAAU3qB,KAC3CA,IACfyoB,EAAWnP,EAAS6C,GAChBA,EACCb,GAAQgI,EAAKvV,EAAQ,IAAM,GAAK,CAAC,EAE1C,CACAmO,GAAYyO,EAAQ3nB,EAAKylB,GACzBkC,EAASA,EAAO3nB,EAClB,CACA,OAAOmN,CACT,CAUA,IAAIya,GAAe1S,GAAqB,SAAS7K,EAAMwN,GACrD3C,UAAQ1F,IAAInF,EAAMwN,GACXxN,CACT,EAH6Bia,GAazBuD,GAAmB/U,GAA4B,SAASzI,EAAMqD,GAChE,OAAOoF,GAAezI,EAAM,WAAY,CACtCoP,cAAgB,EAChBC,YAAc,EACd1O,MAAS8c,GAASpa,GAClBiM,UAAY,GAEhB,EAPwC2K,GAgBxC,SAASyD,GAAYvb,GACnB,OAAOmM,GAAY5M,GAAOS,GAC5B,CAWA,SAASwb,GAAUrd,EAAO2c,EAAOW,GAC/B,IAAIld,GAAQ,EACRP,EAASG,EAAMH,OAEf8c,EAAQ,IACVA,GAASA,EAAQ9c,EAAS,EAAKA,EAAS8c,IAE1CW,EAAMA,EAAMzd,EAASA,EAASyd,GACpB,IACRA,GAAOzd,GAETA,EAAS8c,EAAQW,EAAM,EAAMA,EAAMX,IAAW,EAC9CA,KAAW,EAGX,QADI/b,EAASM,EAAMrB,KACVO,EAAQP,GACfe,EAAOR,GAASJ,EAAMI,EAAQuc,GAEhC,OAAO/b,CACT,CAWA,SAAS2c,GAAS1b,EAAYpB,GAC5B,IAAIG,EAEJ+N,UAAS9M,EAAY,SAASxB,EAAOD,EAAOyB,GAC1CjB,UAASH,EAAUJ,EAAOD,EAAOyB,GAEnC,KACSjB,CACX,CAcA,SAAS4c,GAAgBxd,EAAOK,EAAOod,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAAT3d,EAAgB0d,EAAM1d,EAAMH,OAEvC,GAAoB,iBAATQ,GAAqBA,GAAUA,GAASsd,GAn/H3BhnB,WAm/H0D,CAChF,KAAO+mB,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvBtL,EAAWrS,EAAM4d,GAEJ,OAAbvL,IAAsB0C,GAAS1C,KAC9BoL,EAAcpL,GAAYhS,EAAUgS,EAAWhS,GAClDqd,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACA,OAAOD,CACT,CACA,OAAOE,GAAkB7d,EAAOK,EAAOsZ,GAAU8D,EACnD,CAeA,SAASI,GAAkB7d,EAAOK,EAAOH,EAAUud,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAAT3d,EAAgB,EAAIA,EAAMH,OACrC,GAAa,IAAT8d,EACF,OAAO,EAST,QALIG,GADJzd,EAAQH,EAASG,KACQA,EACrB0d,EAAsB,OAAV1d,EACZ2d,EAAcjJ,GAAS1U,GACvB4d,EAAiB5d,IAAUhO,EAExBqrB,EAAMC,GAAM,CACjB,IAAIC,EAAM/U,IAAa6U,EAAMC,GAAQ,GACjCtL,EAAWnS,EAASF,EAAM4d,IAC1BM,EAAe7L,IAAahgB,EAC5B8rB,EAAyB,OAAb9L,EACZ+L,EAAiB/L,GAAaA,EAC9BgM,EAActJ,GAAS1C,GAE3B,GAAIyL,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAcpL,GAAYhS,EAAUgS,EAAWhS,GAEtDie,EACFZ,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACA,OAAOnU,EAAUkU,EA1jIChnB,WA2jIpB,CAWA,SAAS4nB,GAAeve,EAAOE,GAM7B,QALIE,GAAQ,EACRP,EAASG,EAAMH,OACfc,EAAW,EACXC,EAAS,KAEJR,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdiS,EAAWnS,EAAWA,EAASG,GAASA,EAE5C,IAAKD,IAAUiO,GAAGgE,EAAU4E,GAAO,CACjC,IAAIA,EAAO5E,EACXzR,EAAOD,KAAwB,IAAVN,EAAc,EAAIA,CACzC,CACF,CACA,OAAOO,CACT,CAUA,SAAS4d,GAAane,GACpB,MAAoB,iBAATA,EACFA,EAEL0U,GAAS1U,GAxmIPkC,KA2mIElC,CACV,CAUA,SAASoe,GAAape,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIgL,EAAQhL,GAEV,OAAOY,EAASZ,EAAOoe,IAAgB,GAEzC,GAAI1J,GAAS1U,GACX,OAAO6K,GAAiBA,GAAepL,KAAKO,GAAS,GAEvD,IAAIO,EAAUP,EAAQ,GACtB,MAAkB,KAAVO,GAAkB,EAAIP,IAAW5J,GAAY,KAAOmK,CAC9D,CAWA,SAAS8d,GAAS1e,EAAOE,EAAUc,GACjC,IAAIZ,GAAQ,EACR6R,EAAWpR,GACXhB,EAASG,EAAMH,OACfqS,GAAW,EACXtR,EAAS,GACTqW,EAAOrW,EAEX,GAAII,EACFkR,GAAW,EACXD,EAAWlR,WAEJlB,GAjtIU,IAitIkB,CACnC,IAAIgF,EAAM3E,EAAW,KAAOye,GAAU3e,GACtC,GAAI6E,EACF,OAAOD,GAAWC,GAEpBqN,GAAW,EACXD,EAAW3O,GACX2T,EAAO,IAAInK,EACb,MAEEmK,EAAO/W,EAAW,GAAKU,EAEzBwR,EACA,OAAShS,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdiS,EAAWnS,EAAWA,EAASG,GAASA,EAG5C,GADAA,EAASW,GAAwB,IAAVX,EAAeA,EAAQ,EAC1C6R,GAAYG,GAAaA,EAAU,CAErC,QADIuM,EAAY3H,EAAKpX,OACd+e,KACL,GAAI3H,EAAK2H,KAAevM,EACtB,SAASD,EAGTlS,GACF+W,EAAKrJ,KAAKyE,GAEZzR,EAAOgN,KAAKvN,EACd,MACU4R,EAASgF,EAAM5E,EAAUrR,KAC7BiW,IAASrW,GACXqW,EAAKrJ,KAAKyE,GAEZzR,EAAOgN,KAAKvN,GAEhB,CACA,OAAOO,CACT,CAUA,SAAS4b,GAAUha,EAAQmT,GACzBA,OAEiB,OADjBnT,EAAS2U,GAAO3U,EADhBmT,EAAOC,GAASD,EAAMnT,aAEUA,EAAOqT,GAAMuB,GAAKzB,IACpD,CAYA,SAASkJ,GAAWrc,EAAQmT,EAAMmJ,EAASpP,GACzC,OAAOwM,GAAQ1Z,EAAQmT,EAAMmJ,EAAQpJ,GAAQlT,EAAQmT,IAAQjG,EAC/D,CAaA,SAASqP,GAAU/e,EAAOS,EAAWue,EAAQ/c,GAI3C,QAHIpC,EAASG,EAAMH,OACfO,EAAQ6B,EAAYpC,GAAS,GAEzBoC,EAAY7B,MAAYA,EAAQP,IACtCY,EAAUT,EAAMI,GAAQA,EAAOJ,KAEjC,OAAOgf,EACH3B,GAAUrd,EAAQiC,EAAY,EAAI7B,EAAS6B,EAAY7B,EAAQ,EAAIP,GACnEwd,GAAUrd,EAAQiC,EAAY7B,EAAQ,EAAI,EAAK6B,EAAYpC,EAASO,EAC1E,CAYA,SAAS6e,GAAiB5e,EAAO6e,GAC/B,IAAIte,EAASP,EACb,OAAIO,aAAkB0K,IACpB1K,EAASA,EAAOP,SAEXiB,GAAY4d,EAAS,SAASte,EAAQue,GAC3C,OAAOA,EAAOzf,KAAKD,MAAM0f,EAAOxf,QAASwB,GAAU,CAACP,GAASue,EAAOvf,MACtE,EAAGgB,EACL,CAYA,SAASwe,GAAQzI,EAAQzW,EAAUc,GACjC,IAAInB,EAAS8W,EAAO9W,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS6e,GAAS/H,EAAO,IAAM,GAKxC,QAHIvW,GAAQ,EACRQ,EAASM,EAAMrB,KAEVO,EAAQP,GAIf,QAHIG,EAAQ2W,EAAOvW,GACfyW,GAAW,IAENA,EAAWhX,GACdgX,GAAYzW,IACdQ,EAAOR,GAAS4R,GAAepR,EAAOR,IAAUJ,EAAO2W,EAAOE,GAAW3W,EAAUc,IAIzF,OAAO0d,GAASzJ,EAAYrU,EAAQ,GAAIV,EAAUc,EACpD,CAWA,SAASqe,GAAchc,EAAOjC,EAAQke,GAMpC,QALIlf,GAAQ,EACRP,EAASwD,EAAMxD,OACf0f,EAAane,EAAOvB,OACpBe,EAAS,CAAC,IAELR,EAAQP,GAEfyf,EAAW1e,EAAQyC,EAAMjD,GADbA,EAAQmf,EAAane,EAAOhB,GAAS/N,GAGnD,OAAOuO,CACT,CASA,SAAS4e,GAAoBnf,GAC3B,OAAO2a,EAAkB3a,GAASA,EAAQ,EAC5C,CASA,SAASof,GAAapf,GACpB,MAAuB,mBAATA,EAAsBA,EAAQsZ,EAC9C,CAUA,SAAS/D,GAASvV,EAAOmC,GACvB,OAAI6I,EAAQhL,GACHA,EAEFia,GAAMja,EAAOmC,GAAU,CAACnC,GAASqf,GAAalZ,EAASnG,GAChE,CAWA,IAAIsf,GAAWjD,EAWf,SAASkD,GAAU5f,EAAO2c,EAAOW,GAC/B,IAAIzd,EAASG,EAAMH,OACnByd,SAAMA,IAAQjrB,EAAYwN,EAASyd,GAC1BX,GAASW,GAAOzd,EAAUG,EAAQqd,GAAUrd,EAAO2c,EAAOW,EACrE,CAQA,IAAIhV,GAAeD,IAAmB,SAASxS,GAC7C,OAAOkI,EAAKuK,aAAazS,EAC3B,EAUA,SAASua,GAAYa,EAAQrB,GAC3B,GAAIA,EACF,OAAOqB,EAAOjO,QAEhB,IAAInD,EAASoR,EAAOpR,OAChBe,EAAS0G,GAAcA,GAAYzH,GAAU,IAAIoR,EAAOpgB,YAAYgP,GAExEoR,SAAO4O,KAAKjf,GACLA,CACT,CASA,SAASkQ,GAAiBgP,GACxB,IAAIlf,EAAS,IAAIkf,EAAYjvB,YAAYivB,EAAY3O,YACrD,WAAI9J,GAAWzG,GAAQiE,IAAI,IAAIwC,GAAWyY,IACnClf,CACT,CA+CA,SAASwQ,GAAgB2O,EAAYnQ,GACnC,IAAIqB,EAASrB,EAASkB,GAAiBiP,EAAW9O,QAAU8O,EAAW9O,OACvE,OAAO,IAAI8O,EAAWlvB,YAAYogB,EAAQ8O,EAAW7O,WAAY6O,EAAWlgB,OAC9E,CAUA,SAASmc,GAAiB3b,EAAOkW,GAC/B,GAAIlW,IAAUkW,EAAO,CACnB,IAAIyJ,EAAe3f,IAAUhO,EACzB0rB,EAAsB,OAAV1d,EACZ4f,EAAiB5f,GAAUA,EAC3B2d,EAAcjJ,GAAS1U,GAEvB6d,EAAe3H,IAAUlkB,EACzB8rB,EAAsB,OAAV5H,EACZ6H,EAAiB7H,GAAUA,EAC3B8H,EAActJ,GAASwB,GAE3B,IAAM4H,IAAcE,IAAgBL,GAAe3d,EAAQkW,GACtDyH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B4B,GAAgB5B,IACjB6B,EACH,OAAO,EAET,IAAMlC,IAAcC,IAAgBK,GAAehe,EAAQkW,GACtD8H,GAAe2B,GAAgBC,IAAmBlC,IAAcC,GAChEG,GAAa6B,GAAgBC,IAC5B/B,GAAgB+B,IACjB7B,EACH,OAAO,CAEX,CACA,OAAO,CACT,CAsDA,SAAS8B,GAAYtgB,EAAMugB,EAAUC,EAASC,GAU5C,QATIC,GAAY,EACZC,EAAa3gB,EAAKC,OAClB2gB,EAAgBJ,EAAQvgB,OACxB4gB,GAAY,EACZC,EAAaP,EAAStgB,OACtB8gB,EAAcpX,EAAUgX,EAAaC,EAAe,GACpD5f,EAASM,EAAMwf,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnB9f,EAAO6f,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7B3f,EAAOwf,EAAQE,IAAc1gB,EAAK0gB,IAGtC,KAAOK,KACL/f,EAAO6f,KAAe7gB,EAAK0gB,KAE7B,OAAO1f,CACT,CAaA,SAASigB,GAAiBjhB,EAAMugB,EAAUC,EAASC,GAWjD,QAVIC,GAAY,EACZC,EAAa3gB,EAAKC,OAClBihB,GAAe,EACfN,EAAgBJ,EAAQvgB,OACxBkhB,GAAa,EACbC,EAAcb,EAAStgB,OACvB8gB,EAAcpX,EAAUgX,EAAaC,EAAe,GACpD5f,EAASM,EAAMyf,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnB/f,EAAO0f,GAAa1gB,EAAK0gB,GAG3B,QADIjf,EAASif,IACJS,EAAaC,GACpBpgB,EAAOS,EAAS0f,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7B3f,EAAOS,EAAS+e,EAAQU,IAAiBlhB,EAAK0gB,MAGlD,OAAO1f,CACT,CAUA,SAASqN,GAAUlV,EAAQiH,GACzB,IAAII,GAAQ,EACRP,EAAS9G,EAAO8G,OAGpB,IADAG,IAAUA,EAAQkB,EAAMrB,MACfO,EAAQP,GACfG,EAAMI,GAASrH,EAAOqH,GAExB,OAAOJ,CACT,CAYA,SAAS6O,GAAW9V,EAAQsK,EAAOb,EAAQkN,GACzC,IAAIuR,GAASze,EACbA,IAAWA,EAAS,CAAC,GAKrB,QAHIpC,GAAQ,EACRP,EAASwD,EAAMxD,SAEVO,EAAQP,GAAQ,CACvB,IAAIxK,EAAMgO,EAAMjD,GAEZ0a,EAAWpL,EACXA,EAAWlN,EAAOnN,GAAM0D,EAAO1D,GAAMA,EAAKmN,EAAQzJ,GAClD1G,EAEAyoB,IAAazoB,IACfyoB,EAAW/hB,EAAO1D,IAEhB4rB,EACF3S,GAAgB9L,EAAQnN,EAAKylB,GAE7BvM,GAAY/L,EAAQnN,EAAKylB,EAE7B,CACA,OAAOtY,CACT,CAkCA,SAAS0e,GAAiBjhB,EAAQkhB,GAChC,OAAO,SAAStf,EAAY3B,GAC1B,IAAIR,EAAO2L,EAAQxJ,GAAc9B,GAAkB2O,GAC/CvO,EAAcghB,EAAcA,IAAgB,CAAC,EAEjD,OAAOzhB,EAAKmC,EAAY5B,EAAQsb,EAAYrb,EAAU,GAAIC,EAC5D,CACF,CASA,SAASihB,GAAeC,GACtB,OAAO3E,EAAS,SAASla,EAAQ8e,GAC/B,IAAIlhB,GAAQ,EACRP,EAASyhB,EAAQzhB,OACjB6P,EAAa7P,EAAS,EAAIyhB,EAAQzhB,EAAS,GAAKxN,EAChDkvB,EAAQ1hB,EAAS,EAAIyhB,EAAQ,GAAKjvB,EAWtC,IATAqd,EAAc2R,EAASxhB,OAAS,GAA0B,mBAAd6P,GACvC7P,IAAU6P,GACXrd,EAEAkvB,GAASC,EAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD7R,EAAa7P,EAAS,EAAIxN,EAAYqd,EACtC7P,EAAS,GAEX2C,EAAS5E,EAAO4E,KACPpC,EAAQP,GAAQ,CACvB,IAAI9G,EAASuoB,EAAQlhB,GACjBrH,GACFsoB,EAAS7e,EAAQzJ,EAAQqH,EAAOsP,EAEpC,CACA,OAAOlN,CACT,EACF,CAUA,SAASiS,GAAe3S,EAAUG,GAChC,OAAO,SAASJ,EAAY3B,GAC1B,GAAkB,MAAd2B,EACF,OAAOA,EAET,IAAKsY,GAAYtY,GACf,OAAOC,EAASD,EAAY3B,GAM9B,QAJIL,EAASgC,EAAWhC,OACpBO,EAAQ6B,EAAYpC,GAAS,EAC7B4hB,EAAW7jB,EAAOiE,IAEdI,EAAY7B,MAAYA,EAAQP,KACa,IAA/CK,EAASuhB,EAASrhB,GAAQA,EAAOqhB,KAIvC,OAAO5f,CACT,CACF,CASA,SAASyT,GAAcrT,GACrB,OAAO,SAASO,EAAQtC,EAAU6V,GAMhC,QALI3V,GAAQ,EACRqhB,EAAW7jB,EAAO4E,GAClBa,EAAQ0S,EAASvT,GACjB3C,EAASwD,EAAMxD,OAEZA,KAAU,CACf,IAAIxK,EAAMgO,EAAMpB,EAAYpC,IAAWO,GACvC,IAA+C,IAA3CF,EAASuhB,EAASpsB,GAAMA,EAAKosB,GAC/B,KAEJ,CACA,OAAOjf,CACT,CACF,CA8BA,SAASkf,GAAgBC,GACvB,OAAO,SAAS5e,GAGd,IAAIW,EAAaO,GAFjBlB,EAASyD,EAASzD,IAGdkC,GAAclC,GACd1Q,EAEA2R,EAAMN,EACNA,EAAW,GACXX,EAAOuC,OAAO,GAEdsc,EAAWle,EACXkc,GAAUlc,EAAY,GAAGlH,KAAK,IAC9BuG,EAAOC,MAAM,GAEjB,OAAOgB,EAAI2d,KAAgBC,CAC7B,CACF,CASA,SAASC,GAAiBC,GACxB,OAAO,SAAS/e,GACd,OAAOzB,GAAYygB,GAAMC,GAAOjf,GAAQG,QAAQvG,GAAQ,KAAMmlB,EAAU,GAC1E,CACF,CAUA,SAASG,GAAWpR,GAClB,OAAO,WAIL,IAAIjR,EAAOsiB,UACX,OAAQtiB,EAAKC,QACX,KAAK,EAAG,OAAO,IAAIgR,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAKjR,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAIiR,EAAKjR,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAIiR,EAAKjR,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAIiR,EAAKjR,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAIiR,EAAKjR,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAIiR,EAAKjR,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAIiR,EAAKjR,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIuiB,EAAc1W,GAAWoF,EAAKzK,WAC9BxF,EAASiQ,EAAKpR,MAAM0iB,EAAaviB,GAIrC,OAAO+L,EAAS/K,GAAUA,EAASuhB,CACrC,CACF,CA8CA,SAASC,GAAWC,GAClB,OAAO,SAASxgB,EAAYpB,EAAWuB,GACrC,IAAIyf,EAAW7jB,EAAOiE,GACtB,IAAKsY,GAAYtY,GAAa,CAC5B,IAAI3B,EAAWqb,EAAY9a,EAAW,GACtCoB,EAAagF,EAAKhF,GAClBpB,EAAY,SAASpL,GAAO,OAAO6K,EAASuhB,EAASpsB,GAAMA,EAAKosB,EAAW,CAC7E,CACA,IAAIrhB,EAAQiiB,EAAcxgB,EAAYpB,EAAWuB,GACjD,OAAO5B,GAAQ,EAAKqhB,EAASvhB,EAAW2B,EAAWzB,GAASA,GAAS/N,CACvE,CACF,CASA,SAASiwB,GAAWrgB,GAClB,OAAOsgB,GAAS,SAASC,GACvB,IAAI3iB,EAAS2iB,EAAM3iB,OACfO,EAAQP,EACR4iB,EAASlX,GAAcnF,UAAUsc,KAKrC,IAHIzgB,GACFugB,EAAMxY,UAED5J,KAAS,CACd,IAAIV,EAAO8iB,EAAMpiB,GACjB,GAAmB,mBAARV,EACT,MAAM,IAAIwG,GAAU5P,GAEtB,GAAImsB,IAAWE,GAAgC,WAArBC,GAAYljB,GACpC,IAAIijB,EAAU,IAAIpX,GAAc,IAAI,EAExC,CAEA,IADAnL,EAAQuiB,EAAUviB,EAAQP,IACjBO,EAAQP,GAAQ,CAGvB,IAAIgjB,EAAWD,GAFfljB,EAAO8iB,EAAMpiB,IAGT8M,EAAmB,WAAZ2V,EAAwBC,GAAQpjB,GAAQrN,EAMjDswB,EAJEzV,GAAQ6V,GAAW7V,EAAK,KAChB,KAANA,EAAK,KACJA,EAAK,GAAGrN,QAAqB,GAAXqN,EAAK,GAElByV,EAAQC,GAAY1V,EAAK,KAAKzN,MAAMkjB,EAASzV,EAAK,IAElC,GAAfxN,EAAKG,QAAekjB,GAAWrjB,GACtCijB,EAAQE,KACRF,EAAQD,KAAKhjB,EAErB,CACA,OAAO,WACL,IAAIE,EAAOsiB,UACP7hB,EAAQT,EAAK,GAEjB,GAAI+iB,GAA0B,GAAf/iB,EAAKC,QAAewL,EAAQhL,GACzC,OAAOsiB,EAAQK,MAAM3iB,GAAOA,QAK9B,QAHID,EAAQ,EACRQ,EAASf,EAAS2iB,EAAMpiB,GAAOX,MAAMzO,KAAM4O,GAAQS,IAE9CD,EAAQP,GACfe,EAAS4hB,EAAMpiB,GAAON,KAAK9O,KAAM4P,GAEnC,OAAOA,CACT,CACF,EACF,CAqBA,SAASqiB,GAAavjB,EAAM+P,EAAS9P,EAASwgB,EAAUC,EAAS8C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EApiKY,IAoiKJ9T,EACR+T,EA5iKa,EA4iKJ/T,EACTgU,EA5iKiB,EA4iKLhU,EACZ4Q,EAAY5Q,KACZiU,EAtiKa,IAsiKJjU,EACToB,EAAO4S,EAAYpxB,EAAY4vB,GAAWviB,GA6C9C,OA3CA,SAASijB,IAKP,QAJI9iB,EAASqiB,UAAUriB,OACnBD,EAAOsB,EAAMrB,GACbO,GAAQP,EAELO,MACLR,EAAKQ,IAAS8hB,UAAU9hB,IAE1B,GAAIigB,EACF,IAAI1b,EAAcgf,GAAUhB,GACxBiB,GAvhIZ,SAASC,GAAa7jB,EAAO2E,GAI3B,QAHI9E,EAASG,EAAMH,OACfe,EAAS,EAENf,KACDG,EAAMH,KAAY8E,KAClB/D,EAGN,OAAOA,CACT,CA6gI2BijB,CAAajkB,EAAM+E,GASxC,GAPIwb,IACFvgB,EAAOsgB,GAAYtgB,EAAMugB,EAAUC,EAASC,IAE1C6C,IACFtjB,EAAOihB,GAAiBjhB,EAAMsjB,EAAeC,EAAc9C,IAE7DxgB,GAAU+jB,GACNvD,GAAaxgB,EAASyjB,EAAO,CAC/B,IAAIQ,EAAapf,GAAe9E,EAAM+E,GACtC,OAAOof,GACLrkB,EAAM+P,EAASwT,GAAcN,EAAQhe,YAAahF,EAClDC,EAAMkkB,EAAYV,EAAQC,EAAKC,EAAQzjB,EAE3C,CACA,IAAIsiB,GAAcqB,EAAS7jB,EAAU3O,KACjCgzB,GAAKP,EAAYtB,GAAYziB,GAAQA,EAEzCG,SAASD,EAAKC,OACVujB,EACFxjB,EAg4CN,SAASqkB,GAAQjkB,EAAOsc,GAKtB,QAJI4H,EAAYlkB,EAAMH,OAClBA,EAAS4J,EAAU6S,EAAQzc,OAAQqkB,GACnCC,EAAWlW,GAAUjO,GAElBH,KAAU,CACf,IAAIO,EAAQkc,EAAQzc,GACpBG,EAAMH,GAAU8N,GAAQvN,EAAO8jB,GAAaC,EAAS/jB,GAAS/N,CAChE,CACA,OAAO2N,CACT,CA14CaikB,CAAQrkB,EAAMwjB,GACZM,GAAU7jB,EAAS,GAC5BD,EAAKoK,UAEHuZ,GAASF,EAAMxjB,IACjBD,EAAKC,OAASwjB,GAEZryB,MAAQA,OAAS+M,GAAQ/M,gBAAgB2xB,IAC3CqB,GAAKnT,GAAQoR,GAAW+B,KAEnBA,GAAGvkB,MAAM0iB,GAAaviB,EAC/B,CAEF,CAUA,SAASwkB,GAAenkB,EAAQokB,GAC9B,OAAO,SAAS7hB,EAAQtC,GACtB,OAh/DJ,SAASokB,GAAa9hB,EAAQvC,EAAQC,EAAUC,GAC9CuU,UAAWlS,EAAQ,SAASnC,EAAOhL,EAAKmN,GACtCvC,EAAOE,EAAaD,EAASG,GAAQhL,EAAKmN,EAC5C,GACOrC,CACT,CA2+DWmkB,CAAa9hB,EAAQvC,EAAQokB,EAAWnkB,GAAW,CAAC,EAC7D,CACF,CAUA,SAASqkB,GAAoBC,EAAUC,GACrC,OAAO,SAASpkB,EAAOkW,GACrB,IAAI3V,EACJ,GAAIP,IAAUhO,GAAakkB,IAAUlkB,EACnC,OAAOoyB,EAKT,GAHIpkB,IAAUhO,IACZuO,EAASP,GAEPkW,IAAUlkB,EAAW,CACvB,GAAIuO,IAAWvO,EACb,OAAOkkB,EAEW,iBAATlW,GAAqC,iBAATkW,GACrClW,EAAQoe,GAAape,GACrBkW,EAAQkI,GAAalI,KAErBlW,EAAQme,GAAane,GACrBkW,EAAQiI,GAAajI,IAEvB3V,EAAS4jB,EAASnkB,EAAOkW,EAC3B,CACA,OAAO3V,CACT,CACF,CASA,SAAS8jB,GAAWC,GAClB,OAAOpC,GAAS,SAASlH,GACvBA,SAAYpa,EAASoa,EAAWlY,GAAUoY,MACnCmB,EAAS,SAAS9c,GACvB,IAAID,EAAU3O,KACd,OAAO2zB,EAAUtJ,EAAW,SAASnb,GACnC,OAAOT,GAAMS,EAAUP,EAASC,EAClC,EACF,EACF,EACF,CAWA,SAASglB,GAAc/kB,EAAQglB,GAG7B,IAAIC,GAFJD,EAAQA,IAAUxyB,EAAY,IAAMosB,GAAaoG,IAEzBhlB,OACxB,GAAIilB,EAAc,EAChB,OAAOA,EAAcrI,GAAWoI,EAAOhlB,GAAUglB,EAEnD,IAAIjkB,EAAS6b,GAAWoI,EAAOlc,GAAW9I,EAASiF,GAAW+f,KAC9D,OAAO5gB,GAAW4gB,GACdjF,GAAU3a,GAAcrE,GAAS,EAAGf,GAAQrD,KAAK,IACjDoE,EAAOoC,MAAM,EAAGnD,EACtB,CA4CA,SAASklB,GAAY9iB,GACnB,OAAO,SAAS0a,EAAOW,EAAK0H,GAC1B,OAAIA,GAAuB,iBAARA,GAAoBxD,EAAe7E,EAAOW,EAAK0H,KAChE1H,EAAM0H,EAAO3yB,GAGfsqB,EAAQsI,GAAStI,GACbW,IAAQjrB,GACVirB,EAAMX,EACNA,EAAQ,GAERW,EAAM2H,GAAS3H,GA57CrB,SAAS4H,GAAUvI,EAAOW,EAAK0H,EAAM/iB,GAKnC,QAJI7B,GAAQ,EACRP,EAAS0J,EAAUZ,IAAY2U,EAAMX,IAAUqI,GAAQ,IAAK,GAC5DpkB,EAASM,EAAMrB,GAEZA,KACLe,EAAOqB,EAAYpC,IAAWO,GAASuc,EACvCA,GAASqI,EAEX,OAAOpkB,CACT,CAq7CWskB,CAAUvI,EAAOW,EADxB0H,EAAOA,IAAS3yB,EAAasqB,EAAQW,EAAM,GAAI,EAAM2H,GAASD,GAC3B/iB,EACrC,CACF,CASA,SAASkjB,GAA0BX,GACjC,OAAO,SAASnkB,EAAOkW,GACrB,MAAsB,iBAATlW,GAAqC,iBAATkW,IACvClW,EAAQ+kB,GAAS/kB,GACjBkW,EAAQ6O,GAAS7O,IAEZiO,EAASnkB,EAAOkW,EACzB,CACF,CAmBA,SAASwN,GAAcrkB,EAAM+P,EAAS4V,EAAU1gB,EAAahF,EAASwgB,EAAUC,EAASgD,EAAQC,EAAKC,GACpG,IAAIgC,EArxKc,EAqxKJ7V,EAMdA,GAAY6V,EAzxKQ,GACM,GAJF,GA6xKxB7V,KAAa6V,EAzxKa,GADN,OA6xKlB7V,IAAW,GAEb,IAAI8V,EAAU,CACZ7lB,EAAM+P,EAAS9P,EAVC2lB,EAAUnF,EAAW9tB,EAFtBizB,EAAUlF,EAAU/tB,EAGdizB,EAAUjzB,EAAY8tB,EAFvBmF,EAAUjzB,EAAY+tB,EAYzBgD,EAAQC,EAAKC,GAG5B1iB,EAASykB,EAAS5lB,MAAMpN,EAAWkzB,GACvC,OAAIxC,GAAWrjB,IACb8lB,GAAQ5kB,EAAQ2kB,GAElB3kB,EAAO+D,YAAcA,EACd8gB,GAAgB7kB,EAAQlB,EAAM+P,EACvC,CASA,SAASiW,GAAY/D,GACnB,IAAIjiB,EAAOsG,EAAK2b,GAChB,OAAO,SAAStS,EAAQsW,GAGtB,GAFAtW,EAAS+V,GAAS/V,IAClBsW,EAAyB,MAAbA,EAAoB,EAAIlc,EAAUmc,EAAUD,GAAY,OACnDxc,GAAekG,GAAS,CAGvC,IAAIwW,GAAQrf,EAAS6I,GAAU,KAAKhK,MAAM,KAG1CwgB,YAAQrf,EAFI9G,EAAKmmB,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKtgB,MAAM,MACvB,GAAK,MAAQwgB,EAAK,GAAKF,GACvC,CACA,OAAOjmB,EAAK2P,EACd,CACF,CASA,IAAIsP,GAAcvU,IAAQ,EAAIxF,GAAW,IAAIwF,GAAI,GAAE,KAAM,IAAO3T,GAAmB,SAAS2K,GAC1F,OAAO,IAAIgJ,GAAIhJ,EACjB,EAF4E0kB,GAW5E,SAASC,GAAchQ,GACrB,OAAO,SAASvT,GACd,IAAIyN,EAAMC,EAAO1N,GACjB,OAAIyN,GAAO7Y,GACF+M,GAAW3B,GAEhByN,GAAOxY,GAhpIjB,SAASuuB,GAAWnhB,GAClB,IAAIzE,GAAQ,EACRQ,EAASM,MAAM2D,EAAIR,MAEvBQ,SAAIP,QAAQ,SAASjE,GACnBO,IAASR,GAAS,CAACC,EAAOA,EAC5B,GACOO,CACT,CAyoIeolB,CAAWxjB,GAn6I1B,SAASyjB,GAAYzjB,EAAQa,GAC3B,OAAOpC,EAASoC,EAAO,SAAShO,GAC9B,MAAO,CAACA,EAAKmN,EAAOnN,GACtB,EACF,CAi6Ia4wB,CAAYzjB,EAAQuT,EAASvT,GACtC,CACF,CA2BA,SAAS0jB,GAAWxmB,EAAM+P,EAAS9P,EAASwgB,EAAUC,EAASgD,EAAQC,EAAKC,GAC1E,IAAIG,EAl4KiB,EAk4KLhU,EAChB,IAAKgU,GAA4B,mBAAR/jB,EACvB,MAAM,IAAIwG,GAAU5P,GAEtB,IAAIuJ,EAASsgB,EAAWA,EAAStgB,OAAS,EAS1C,GARKA,IACH4P,IAAW,GACX0Q,EAAWC,EAAU/tB,GAEvBgxB,EAAMA,IAAQhxB,EAAYgxB,EAAM9Z,EAAUqc,EAAUvC,GAAM,GAC1DC,EAAQA,IAAUjxB,EAAYixB,EAAQsC,EAAUtC,GAChDzjB,GAAUugB,EAAUA,EAAQvgB,OAAS,EAx4KX,GA04KtB4P,EAAmC,CACrC,IAAIyT,EAAgB/C,EAChBgD,EAAe/C,EAEnBD,EAAWC,EAAU/tB,CACvB,CACA,IAAI6a,EAAOuW,EAAYpxB,EAAYywB,GAAQpjB,GAEvC6lB,EAAU,CACZ7lB,EAAM+P,EAAS9P,EAASwgB,EAAUC,EAAS8C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfIpW,GA26BN,SAASiZ,GAAUjZ,EAAMnU,GACvB,IAAI0W,EAAUvC,EAAK,GACfkZ,EAAartB,EAAO,GACpBstB,EAAa5W,EAAU2W,EAS3B,KAReC,UAr0MC,KAw0MZD,GA50Mc,GA40MmB3W,GAx0MrB,KAy0MZ2W,GAx0Mc,KAw0MmB3W,GAAgCvC,EAAK,GAAGrN,QAAU9G,EAAO,IAC1FqtB,QAAqDrtB,EAAO,GAAG8G,QAAU9G,EAAO,IA90MlE,GA80M0E0W,GAI1F,OAAOvC,EAr1MQ,EAw1MbkZ,IACFlZ,EAAK,GAAKnU,EAAO,GAEjBstB,GA31Me,EA21MD5W,EAA2B,EAz1MnB,GA41MxB,IAAIpP,EAAQtH,EAAO,GACnB,GAAIsH,EAAO,CACT,IAAI8f,EAAWjT,EAAK,GACpBA,EAAK,GAAKiT,EAAWD,GAAYC,EAAU9f,EAAOtH,EAAO,IAAMsH,EAC/D6M,EAAK,GAAKiT,EAAWzb,GAAewI,EAAK,GAAI1W,IAAeuC,EAAO,EACrE,EAEAsH,EAAQtH,EAAO,MAGbmU,EAAK,IADLiT,EAAWjT,EAAK,IACK2T,GAAiBV,EAAU9f,EAAOtH,EAAO,IAAMsH,EACpE6M,EAAK,GAAKiT,EAAWzb,GAAewI,EAAK,GAAI1W,IAAeuC,EAAO,KAGrEsH,EAAQtH,EAAO,MAEbmU,EAAK,GAAK7M,GAv2MI,IA02MZ+lB,IACFlZ,EAAK,GAAgB,MAAXA,EAAK,GAAanU,EAAO,GAAK0Q,EAAUyD,EAAK,GAAInU,EAAO,KAGrD,MAAXmU,EAAK,KACPA,EAAK,GAAKnU,EAAO,IAGnBmU,EAAK,GAAKnU,EAAO,GACjBmU,EAAK,GAAKmZ,CAGZ,CA/9BIF,CAAUZ,EAASrY,GAErBxN,EAAO6lB,EAAQ,GACf9V,EAAU8V,EAAQ,GAClB5lB,EAAU4lB,EAAQ,GAClBpF,EAAWoF,EAAQ,GACnBnF,EAAUmF,EAAQ,KAClBjC,EAAQiC,EAAQ,GAAKA,EAAQ,KAAOlzB,EAC/BoxB,EAAY,EAAI/jB,EAAKG,OACtB0J,EAAUgc,EAAQ,GAAK1lB,EAAQ,KAErB4P,OACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGd7O,EA56KgB,GA26KP6O,GA16Ka,IA06KiBA,EApgB3C,SAAS6W,GAAY5mB,EAAM+P,EAAS6T,GAClC,IAAIzS,EAAOoR,GAAWviB,GAwBtB,OAtBA,SAASijB,IAMP,QALI9iB,EAASqiB,UAAUriB,OACnBD,EAAOsB,EAAMrB,GACbO,EAAQP,EACR8E,EAAcgf,GAAUhB,GAErBviB,KACLR,EAAKQ,GAAS8hB,UAAU9hB,GAE1B,IAAIggB,EAAWvgB,EAAS,GAAKD,EAAK,KAAO+E,GAAe/E,EAAKC,EAAS,KAAO8E,EACzE,GACAD,GAAe9E,EAAM+E,GAGzB,OADA9E,GAAUugB,EAAQvgB,QACLyjB,EACJS,GACLrkB,EAAM+P,EAASwT,GAAcN,EAAQhe,YAAatS,EAClDuN,EAAMwgB,EAAS/tB,EAAWA,EAAWixB,EAAQzjB,GAG1CJ,GADGzO,MAAQA,OAAS+M,GAAQ/M,gBAAgB2xB,EAAW9R,EAAOnR,EACpD1O,KAAM4O,EACzB,CAEF,CA2ea0mB,CAAY5mB,EAAM+P,EAAS6T,GA16KlB,IA26KR7T,GAAgCA,OAAqD2Q,EAAQvgB,OAG9FojB,GAAaxjB,MAAMpN,EAAWkzB,GA9O3C,SAASgB,GAAc7mB,EAAM+P,EAAS9P,EAASwgB,GAC7C,IAAIqD,EAtsKa,EAssKJ/T,EACToB,EAAOoR,GAAWviB,GAkBtB,OAhBA,SAASijB,IAQP,QAPIrC,GAAY,EACZC,EAAa2B,UAAUriB,OACvB4gB,GAAY,EACZC,EAAaP,EAAStgB,OACtBD,EAAOsB,EAAMwf,EAAaH,GAC1ByD,EAAMhzB,MAAQA,OAAS+M,GAAQ/M,gBAAgB2xB,EAAW9R,EAAOnR,IAE5D+gB,EAAYC,GACnB9gB,EAAK6gB,GAAaN,EAASM,GAE7B,KAAOF,KACL3gB,EAAK6gB,KAAeyB,YAAY5B,GAElC,OAAO7gB,GAAMukB,EAAIR,EAAS7jB,EAAU3O,KAAM4O,EAC5C,CAEF,CAuNa2mB,CAAc7mB,EAAM+P,EAAS9P,EAASwgB,QAJ/C,IAAIvf,EAhmBR,SAAS4lB,GAAW9mB,EAAM+P,EAAS9P,GACjC,IAAI6jB,EA90Ja,EA80JJ/T,EACToB,EAAOoR,GAAWviB,GAMtB,OAJA,SAASijB,IAEP,OADU3xB,MAAQA,OAAS+M,GAAQ/M,gBAAgB2xB,EAAW9R,EAAOnR,GAC3DD,MAAM+jB,EAAS7jB,EAAU3O,KAAMkxB,UAC3C,CAEF,CAulBiBsE,CAAW9mB,EAAM+P,EAAS9P,GASzC,OAAO8lB,IADMvY,EAAO+P,GAAcuI,IACJ5kB,EAAQ2kB,GAAU7lB,EAAM+P,EACxD,CAcA,SAASgX,GAAuBjY,EAAU8K,EAAUjkB,EAAKmN,GACvD,OAAIgM,IAAanc,GACZgc,GAAGG,EAAUnI,GAAYhR,MAAUoR,EAAe3G,KAAK0C,EAAQnN,GAC3DikB,EAEF9K,CACT,CAgBA,SAASkY,GAAoBlY,EAAU8K,EAAUjkB,EAAKmN,EAAQzJ,EAAQ4W,GACpE,OAAIhE,EAAS6C,IAAa7C,EAAS2N,KAEjC3J,EAAM9K,IAAIyU,EAAU9K,GACpBiM,GAAUjM,EAAU8K,EAAUjnB,EAAWq0B,GAAqB/W,GAC9DA,EAAMmD,OAAUwG,IAEX9K,CACT,CAWA,SAASmY,GAAgBtmB,GACvB,OAAO4a,GAAc5a,GAAShO,EAAYgO,CAC5C,CAeA,SAAS2X,GAAYhY,EAAOuW,EAAO9G,EAASC,EAAY8H,EAAW7H,GACjE,IAAI8I,EApgLmB,EAogLPhJ,EACZyU,EAAYlkB,EAAMH,OAClB+W,EAAYL,EAAM1W,OAEtB,GAAIqkB,GAAatN,KAAe6B,GAAa7B,EAAYsN,GACvD,OAAO,EAGT,IAAI0C,EAAajX,EAAMP,IAAIpP,GACvB6Y,EAAalJ,EAAMP,IAAImH,GAC3B,GAAIqQ,GAAc/N,EAChB,OAAO+N,GAAcrQ,GAASsC,GAAc7Y,EAE9C,IAAII,GAAQ,EACRQ,GAAS,EACTqW,EAlhLqB,EAkhLbxH,EAAoC,IAAI3C,GAAWza,EAM/D,IAJAsd,EAAM9K,IAAI7E,EAAOuW,GACjB5G,EAAM9K,IAAI0R,EAAOvW,KAGRI,EAAQ8jB,GAAW,CAC1B,IAAI2C,EAAW7mB,EAAMI,GACjB2Y,EAAWxC,EAAMnW,GAErB,GAAIsP,EACF,IAAIsJ,EAAWP,EACX/I,EAAWqJ,EAAU8N,EAAUzmB,EAAOmW,EAAOvW,EAAO2P,GACpDD,EAAWmX,EAAU9N,EAAU3Y,EAAOJ,EAAOuW,EAAO5G,GAE1D,GAAIqJ,IAAa3mB,EAAW,CAC1B,GAAI2mB,EACF,SAEFpY,GAAS,EACT,KACF,CAEA,GAAIqW,GACF,IAAKxV,GAAU8U,EAAO,SAASwC,EAAUlC,GACnC,IAAKvT,GAAS2T,EAAMJ,KACfgQ,IAAa9N,GAAYvB,EAAUqP,EAAU9N,EAAUtJ,EAASC,EAAYC,IAC/E,OAAOsH,EAAKrJ,KAAKiJ,EAErB,GAAI,CACNjW,GAAS,EACT,KACF,UAEIimB,IAAa9N,IACXvB,EAAUqP,EAAU9N,EAAUtJ,EAASC,EAAYC,GACpD,CACL/O,GAAS,EACT,KACF,CACF,CACA+O,SAAMmD,OAAU9S,GAChB2P,EAAMmD,OAAUyD,GACT3V,CACT,CAyKA,SAAS2hB,GAAS7iB,GAChB,OAAOkd,GAAYC,GAASnd,EAAMrN,EAAWy0B,IAAUpnB,EAAO,GAChE,CASA,SAASkS,GAAWpP,GAClB,OAAOsT,GAAetT,EAAQqE,EAAM8J,GACtC,CAUA,SAASgB,GAAanP,GACpB,OAAOsT,GAAetT,EAAQiO,GAAQF,GACxC,CASA,IAAIuS,GAAWvY,GAAiB,SAAS7K,GACvC,OAAO6K,GAAQ6E,IAAI1P,EACrB,EAFyBomB,GAWzB,SAASlD,GAAYljB,GAKnB,QAJIkB,EAAUlB,EAAKjK,KAAO,GACtBuK,EAAQwK,GAAU5J,GAClBf,EAAS4G,EAAe3G,KAAK0K,GAAW5J,GAAUZ,EAAMH,OAAS,EAE9DA,KAAU,CACf,IAAIqN,EAAOlN,EAAMH,GACbknB,EAAY7Z,EAAKxN,KACrB,GAAiB,MAAbqnB,GAAqBA,GAAarnB,EACpC,OAAOwN,EAAKzX,IAEhB,CACA,OAAOmL,CACT,CASA,SAAS+iB,GAAUjkB,GAEjB,OADa+G,EAAe3G,KAAKqL,EAAQ,eAAiBA,EAASzL,GACrDiF,WAChB,CAaA,SAAS4W,IACP,IAAI3a,EAASuK,EAAOjL,UAAYA,GAChCU,SAASA,IAAWV,GAAWwZ,GAAe9Y,EACvCshB,UAAUriB,OAASe,EAAOshB,UAAU,GAAIA,UAAU,IAAMthB,CACjE,CAUA,SAASgT,GAAWxP,EAAK/O,GACvB,IAAI6X,EAAO9I,EAAI2I,SACf,OA+XF,SAASia,GAAU3mB,GACjB,IAAI9L,SAAc8L,EAClB,MAAgB,UAAR9L,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV8L,EACU,OAAVA,CACP,CApYS2mB,CAAU3xB,GACb6X,EAAmB,iBAAP7X,EAAkB,SAAW,QACzC6X,EAAK9I,GACX,CASA,SAASgW,GAAa5X,GAIpB,QAHI5B,EAASiG,EAAKrE,GACd3C,EAASe,EAAOf,OAEbA,KAAU,CACf,IAAIxK,EAAMuL,EAAOf,GACbQ,EAAQmC,EAAOnN,GAEnBuL,EAAOf,GAAU,CAACxK,EAAKgL,EAAOka,GAAmBla,GACnD,CACA,OAAOO,CACT,CAUA,SAASwH,GAAU5F,EAAQnN,GACzB,IAAIgL,EAlxJR,SAAS4mB,GAASzkB,EAAQnN,GACxB,OAAiB,MAAVmN,EAAiBnQ,EAAYmQ,EAAOnN,EAC7C,CAgxJgB4xB,CAASzkB,EAAQnN,GAC7B,OAAOmkB,GAAanZ,GAASA,EAAQhO,CACvC,CAoCA,IAAIse,GAAc5H,GAA+B,SAASvG,GACxD,OAAc,MAAVA,EACK,IAETA,EAAS5E,EAAO4E,GACT9B,GAAYqI,GAAiBvG,GAAS,SAASgP,GACpD,OAAO7J,GAAqB7H,KAAK0C,EAAQgP,EAC3C,GACF,EARqC0V,GAiBjC3W,GAAgBxH,GAA+B,SAASvG,GAE1D,QADI5B,EAAS,GACN4B,GACLrB,GAAUP,EAAQ+P,GAAWnO,IAC7BA,EAAS+E,GAAa/E,GAExB,OAAO5B,CACT,EAPuCsmB,GAgBnChX,EAAS+F,EA2Eb,SAASkR,GAAQ3kB,EAAQmT,EAAMyR,GAO7B,QAJIhnB,GAAQ,EACRP,GAHJ8V,EAAOC,GAASD,EAAMnT,IAGJ3C,OACde,GAAS,IAEJR,EAAQP,GAAQ,CACvB,IAAIxK,EAAMwgB,GAAMF,EAAKvV,IACrB,KAAMQ,EAAmB,MAAV4B,GAAkB4kB,EAAQ5kB,EAAQnN,IAC/C,MAEFmN,EAASA,EAAOnN,EAClB,CACA,OAAIuL,KAAYR,GAASP,EAChBe,KAETf,EAAmB,MAAV2C,EAAiB,EAAIA,EAAO3C,SAClBwnB,GAASxnB,IAAW8N,GAAQtY,EAAKwK,KACjDwL,EAAQ7I,IAAW+K,GAAY/K,GACpC,CA4BA,SAAS6N,GAAgB7N,GACvB,MAAqC,mBAAtBA,EAAO3R,aAA8BmpB,GAAYxX,GAE5D,CAAC,EADDiJ,GAAWlE,GAAa/E,GAE9B,CA4EA,SAAS4S,GAAc/U,GACrB,OAAOgL,EAAQhL,IAAUkN,GAAYlN,OAChCwH,IAAoBxH,GAASA,EAAMwH,IAC1C,CAUA,SAAS8F,GAAQtN,EAAOR,GACtB,IAAItL,SAAc8L,EAClBR,WAASA,GAAiBnJ,MAGf,UAARnC,GACU,UAARA,GAAoBgG,GAAS2J,KAAK7D,KAChCA,GAAQ,GAAMA,EAAQ,GAAK,GAAKA,EAAQR,CACjD,CAYA,SAAS2hB,EAAenhB,EAAOD,EAAOoC,GACpC,IAAKmJ,EAASnJ,GACZ,OAAO,EAET,IAAIjO,SAAc6L,EAClB,SAAY,UAAR7L,EACK4lB,GAAY3X,IAAWmL,GAAQvN,EAAOoC,EAAO3C,QACrC,UAARtL,GAAoB6L,KAASoC,IAE7B6L,GAAG7L,EAAOpC,GAAQC,EAG7B,CAUA,SAASia,GAAMja,EAAOmC,GACpB,GAAI6I,EAAQhL,GACV,OAAO,EAET,IAAI9L,SAAc8L,EAClB,QAAY,UAAR9L,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAAT8L,IAAiB0U,GAAS1U,KAGvBhH,GAAc6K,KAAK7D,KAAWjH,GAAa8K,KAAK7D,IAC1C,MAAVmC,GAAkBnC,KAASzC,EAAO4E,EACvC,CAwBA,SAASugB,GAAWrjB,GAClB,IAAImjB,EAAWD,GAAYljB,GACvB6W,EAAQpL,EAAO0X,GAEnB,GAAoB,mBAATtM,KAAyBsM,KAAYvX,EAAYlF,WAC1D,OAAO,EAET,GAAI1G,IAAS6W,EACX,OAAO,EAET,IAAIrJ,EAAO4V,GAAQvM,GACnB,QAASrJ,GAAQxN,IAASwN,EAAK,EACjC,EA9SKjD,IAAYiG,EAAO,IAAIjG,GAAS,IAAIqd,YAAY,MAAQxvB,IACxDoS,IAAOgG,EAAO,IAAIhG,KAAQ9S,IAC1B+S,IAAW+F,EAAO/F,GAAQod,YAAchwB,IACxC6S,IAAO8F,EAAO,IAAI9F,KAAQ3S,IAC1B4S,IAAW6F,EAAO,IAAI7F,KAAYzS,MACrCsY,EAAS,SAAS7P,GAChB,IAAIO,EAASqV,EAAW5V,GACpBwQ,EAAOjQ,GAAUtJ,GAAY+I,EAAMxP,YAAcwB,EACjDm1B,EAAa3W,EAAOnG,GAASmG,GAAQ,GAEzC,GAAI2W,EACF,OAAQA,GACN,KAAK/c,GAAoB,OAAO3S,GAChC,KAAK6S,GAAe,OAAOvT,GAC3B,KAAKwT,GAAmB,OAAOrT,GAC/B,KAAKsT,GAAe,OAAOpT,GAC3B,KAAKqT,GAAmB,OAAOlT,GAGnC,OAAOgJ,CACT,GA8SF,IAAI6mB,GAAanhB,GAAamP,GAAaiS,GAS3C,SAAS1N,GAAY3Z,GACnB,IAAIwQ,EAAOxQ,GAASA,EAAMxP,YAG1B,OAAOwP,KAFqB,mBAARwQ,GAAsBA,EAAKzK,WAAcC,GAG/D,CAUA,SAASkU,GAAmBla,GAC1B,OAAOA,GAAUA,IAAUsL,EAAStL,EACtC,CAWA,SAASga,GAAwBhlB,EAAKikB,GACpC,OAAO,SAAS9W,GACd,OAAc,MAAVA,GAGGA,EAAOnN,KAASikB,IACpBA,IAAajnB,GAAcgD,KAAOuI,EAAO4E,GAC9C,CACF,CAoIA,SAASqa,GAASnd,EAAMid,EAAOnY,GAC7BmY,SAAQpT,EAAUoT,IAAUtqB,EAAaqN,EAAKG,OAAS,EAAK8c,EAAO,GAC5D,WAML,QALI/c,EAAOsiB,UACP9hB,GAAQ,EACRP,EAAS0J,EAAU3J,EAAKC,OAAS8c,EAAO,GACxC3c,EAAQkB,EAAMrB,KAETO,EAAQP,GACfG,EAAMI,GAASR,EAAK+c,EAAQvc,GAE9BA,GAAQ,EAER,QADIunB,EAAYzmB,EAAMyb,EAAQ,KACrBvc,EAAQuc,GACfgL,EAAUvnB,GAASR,EAAKQ,GAE1BunB,SAAUhL,GAASnY,EAAUxE,GACtBP,GAAMC,EAAM1O,KAAM22B,EAC3B,CACF,CAUA,SAASxQ,GAAO3U,EAAQmT,GACtB,OAAOA,EAAK9V,OAAS,EAAI2C,EAASkT,GAAQlT,EAAQ6a,GAAU1H,EAAM,GAAG,GACvE,CAgCA,SAASkF,GAAQrY,EAAQnN,GACvB,IAAY,gBAARA,GAAgD,mBAAhBmN,EAAOnN,KAIhC,aAAPA,EAIJ,OAAOmN,EAAOnN,EAChB,CAgBA,IAAImwB,GAAUoC,GAAS3K,IAUnBvU,GAAaD,IAAiB,SAAS/I,EAAMqS,GAC/C,OAAOhU,EAAK2K,WAAWhJ,EAAMqS,EAC/B,EAUI6K,GAAcgL,GAAS1K,IAY3B,SAASuI,GAAgB9C,EAASkF,EAAWpY,GAC3C,IAAI1W,EAAU8uB,EAAY,GAC1B,OAAOjL,GAAY+F,EA1brB,SAASmF,GAAkB/uB,EAAQgvB,GACjC,IAAIloB,EAASkoB,EAAQloB,OACrB,IAAKA,EACH,OAAO9G,EAET,IAAIiM,EAAYnF,EAAS,EACzBkoB,SAAQ/iB,IAAcnF,EAAS,EAAI,KAAO,IAAMkoB,EAAQ/iB,GACxD+iB,EAAUA,EAAQvrB,KAAKqD,EAAS,EAAI,KAAO,KACpC9G,EAAOmK,QAAQvJ,GAAe,uBAAyBouB,EAAU,SAC1E,CAib8BD,CAAkB/uB,EAqHhD,SAASivB,GAAkBD,EAAStY,GAClCnP,UAAU1J,GAAW,SAASivB,GAC5B,IAAIxlB,EAAQ,KAAOwlB,EAAK,GACnBpW,EAAUoW,EAAK,KAAQhlB,GAAcknB,EAAS1nB,IACjD0nB,EAAQna,KAAKvN,EAEjB,GACO0nB,EAAQrM,MACjB,CA7HwDsM,CAtjBxD,SAASC,GAAelvB,GACtB,IAAIoM,EAAQpM,EAAOoM,MAAMvL,IACzB,OAAOuL,EAAQA,EAAM,GAAGE,MAAMxL,IAAkB,EAClD,CAmjB0EouB,CAAelvB,GAAS0W,IAClG,CAWA,SAASmY,GAASloB,GAChB,IAAIwoB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQze,KACR0e,EApiNK,IAoiNmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAziNE,IA0iNN,OAAOhG,UAAU,QAGnBgG,EAAQ,EAEV,OAAOxoB,EAAKD,MAAMpN,EAAW6vB,UAC/B,CACF,CAUA,SAASlU,GAAYhO,EAAOqE,GAC1B,IAAIjE,GAAQ,EACRP,EAASG,EAAMH,OACfmF,EAAYnF,EAAS,EAGzB,IADAwE,EAAOA,IAAShS,EAAYwN,EAASwE,IAC5BjE,EAAQiE,GAAM,CACrB,IAAIikB,EAAOxa,GAAW1N,EAAO4E,GACzB3E,EAAQL,EAAMsoB,GAElBtoB,EAAMsoB,GAAQtoB,EAAMI,GACpBJ,EAAMI,GAASC,CACjB,CACAL,SAAMH,OAASwE,EACRrE,CACT,CASA,IAAI0f,GAvTJ,SAAS6I,GAAc7oB,GACrB,IAAIkB,EAAS4nB,GAAQ9oB,EAAM,SAASrK,GAClC,OA7zMiB,MA6zMbkO,EAAMc,MACRd,EAAMmJ,QAEDrX,CACT,GAEIkO,EAAQ3C,EAAO2C,MACnB,OAAO3C,CACT,CA6SmB2nB,CAAc,SAASxlB,GACxC,IAAInC,EAAS,GACb,OAA6B,KAAzBmC,EAAO0lB,WAAW,IACpB7nB,EAAOgN,KAAK,IAEd7K,EAAOG,QAAQ5J,GAAY,SAAS6L,EAAOkK,EAAQqZ,EAAOC,GACxD/nB,EAAOgN,KAAK8a,EAAQC,EAAUzlB,QAAQlJ,GAAc,MAASqV,GAAUlK,EACzE,GACOvE,CACT,GASA,SAASiV,GAAMxV,GACb,GAAoB,iBAATA,GAAqB0U,GAAS1U,GACvC,OAAOA,EAET,IAAIO,EAAUP,EAAQ,GACtB,MAAkB,KAAVO,GAAkB,EAAIP,IAAW5J,GAAY,KAAOmK,CAC9D,CASA,SAAS8J,GAAShL,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO6G,GAAazG,KAAKJ,EAC3B,OAAa,CACb,IACE,OAAQA,EAAO,EACjB,OAAa,CACf,CACA,MAAO,EACT,CA2BA,SAAS8L,GAAamX,GACpB,GAAIA,aAAmBrX,EACrB,OAAOqX,EAAQiG,QAEjB,IAAIhoB,EAAS,IAAI2K,GAAcoX,EAAQ7W,YAAa6W,EAAQ3W,WAC5DpL,SAAOmL,YAAckC,GAAU0U,EAAQ5W,aACvCnL,EAAOqL,UAAa0W,EAAQ1W,UAC5BrL,EAAOsL,WAAayW,EAAQzW,WACrBtL,CACT,CAqIA,IAAIioB,GAAanM,EAAS,SAAS1c,EAAOoB,GACxC,OAAO4Z,EAAkBhb,GACrBgS,GAAehS,EAAOiV,EAAY7T,EAAQ,EAAG4Z,GAAmB,IAChE,EACN,GA4BI8N,GAAepM,EAAS,SAAS1c,EAAOoB,GAC1C,IAAIlB,EAAWkX,GAAKhW,GACpB,OAAI4Z,EAAkB9a,KACpBA,EAAW7N,GAEN2oB,EAAkBhb,GACrBgS,GAAehS,EAAOiV,EAAY7T,EAAQ,EAAG4Z,GAAmB,GAAOO,EAAYrb,EAAU,IAC7F,EACN,GAyBI6oB,GAAiBrM,EAAS,SAAS1c,EAAOoB,GAC5C,IAAIJ,EAAaoW,GAAKhW,GACtB,OAAI4Z,EAAkBha,KACpBA,EAAa3O,GAER2oB,EAAkBhb,GACrBgS,GAAehS,EAAOiV,EAAY7T,EAAQ,EAAG4Z,GAAmB,GAAO3oB,EAAW2O,GAClF,EACN,GAqOA,SAASgoB,GAAUhpB,EAAOS,EAAWuB,GACnC,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAO,EAET,IAAIO,EAAqB,MAAb4B,EAAoB,EAAI4jB,EAAU5jB,GAC9C,OAAI5B,EAAQ,IACVA,EAAQmJ,EAAU1J,EAASO,EAAO,IAE7B2B,GAAc/B,EAAOub,EAAY9a,EAAW,GAAIL,EACzD,CAqCA,SAAS6oB,GAAcjpB,EAAOS,EAAWuB,GACvC,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAO,EAET,IAAIO,EAAQP,EAAS,EACrB,OAAImC,IAAc3P,IAChB+N,EAAQwlB,EAAU5jB,GAClB5B,EAAQ4B,EAAY,EAChBuH,EAAU1J,EAASO,EAAO,GAC1BqJ,EAAUrJ,EAAOP,EAAS,IAEzBkC,GAAc/B,EAAOub,EAAY9a,EAAW,GAAIL,GAAO,EAChE,CAgBA,SAAS0mB,GAAQ9mB,GAEf,OADsB,MAATA,GAAoBA,EAAMH,OACvBoV,EAAYjV,EAAO,GAAK,EAC1C,CA+FA,SAASkpB,GAAKlpB,GACZ,OAAQA,GAASA,EAAMH,OAAUG,EAAM,GAAK3N,CAC9C,CAyEA,IAAI82B,GAAezM,EAAS,SAAS/F,GACnC,IAAIyS,EAASnoB,EAAS0V,EAAQ6I,IAC9B,OAAQ4J,EAAOvpB,QAAUupB,EAAO,KAAOzS,EAAO,GAC1CD,GAAiB0S,GACjB,EACN,GAyBIC,GAAiB3M,EAAS,SAAS/F,GACrC,IAAIzW,EAAWkX,GAAKT,GAChByS,EAASnoB,EAAS0V,EAAQ6I,IAE9B,OAAItf,IAAakX,GAAKgS,GACpBlpB,EAAW7N,EAEX+2B,EAAO/V,MAED+V,EAAOvpB,QAAUupB,EAAO,KAAOzS,EAAO,GAC1CD,GAAiB0S,EAAQ7N,EAAYrb,EAAU,IAC/C,EACN,GAuBIopB,GAAmB5M,EAAS,SAAS/F,GACvC,IAAI3V,EAAaoW,GAAKT,GAClByS,EAASnoB,EAAS0V,EAAQ6I,IAE9Bxe,SAAkC,mBAAdA,EAA2BA,EAAa3O,IAE1D+2B,EAAO/V,MAED+V,EAAOvpB,QAAUupB,EAAO,KAAOzS,EAAO,GAC1CD,GAAiB0S,EAAQ/2B,EAAW2O,GACpC,EACN,GAmCA,SAASoW,GAAKpX,GACZ,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASG,EAAMH,EAAS,GAAKxN,CACtC,CAsFA,IAAIk3B,GAAO7M,EAAS8M,IAsBpB,SAASA,GAAQxpB,EAAOoB,GACtB,OAAQpB,GAASA,EAAMH,QAAUuB,GAAUA,EAAOvB,OAC9Csc,GAAYnc,EAAOoB,GACnBpB,CACN,CAoFA,IAAIypB,GAASlH,GAAS,SAASviB,EAAOsc,GACpC,IAAIzc,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCe,EAASqO,GAAOjP,EAAOsc,GAE3BD,UAAWrc,EAAOiB,EAASqb,EAAS,SAASlc,GAC3C,OAAOuN,GAAQvN,EAAOP,IAAWO,EAAQA,CAC3C,GAAGsb,KAAKM,KAEDpb,CACT,GA0EA,SAASoJ,GAAQhK,GACf,OAAgB,MAATA,EAAgBA,EAAQ+J,GAAcjK,KAAKE,EACpD,CAiaA,IAAI0pB,GAAQhN,EAAS,SAAS/F,GAC5B,OAAO+H,GAASzJ,EAAY0B,EAAQ,EAAGqE,GAAmB,GAC5D,GAyBI2O,GAAUjN,EAAS,SAAS/F,GAC9B,IAAIzW,EAAWkX,GAAKT,GACpB,OAAIqE,EAAkB9a,KACpBA,EAAW7N,GAENqsB,GAASzJ,EAAY0B,EAAQ,EAAGqE,GAAmB,GAAOO,EAAYrb,EAAU,GACzF,GAuBI0pB,GAAYlN,EAAS,SAAS/F,GAChC,IAAI3V,EAAaoW,GAAKT,GACtB3V,SAAkC,mBAAdA,EAA2BA,EAAa3O,EACrDqsB,GAASzJ,EAAY0B,EAAQ,EAAGqE,GAAmB,GAAO3oB,EAAW2O,EAC9E,GA+FA,SAAS6oB,GAAM7pB,GACb,IAAMA,IAASA,EAAMH,OACnB,MAAO,GAET,IAAIA,EAAS,EACbG,SAAQU,GAAYV,EAAO,SAAS8pB,GAClC,GAAI9O,EAAkB8O,GACpBjqB,SAAS0J,EAAUugB,EAAMjqB,OAAQA,IAC1B,CAEX,GACO+C,GAAU/C,EAAQ,SAASO,GAChC,OAAOa,EAASjB,EAAO2B,GAAavB,GACtC,EACF,CAuBA,SAAS2pB,GAAU/pB,EAAOE,GACxB,IAAMF,IAASA,EAAMH,OACnB,MAAO,GAET,IAAIe,EAASipB,GAAM7pB,GACnB,OAAgB,MAAZE,EACKU,EAEFK,EAASL,EAAQ,SAASkpB,GAC/B,OAAOrqB,GAAMS,EAAU7N,EAAWy3B,EACpC,EACF,CAsBA,IAAIE,GAAUtN,EAAS,SAAS1c,EAAOoB,GACrC,OAAO4Z,EAAkBhb,GACrBgS,GAAehS,EAAOoB,GACtB,EACN,GAoBI6oB,GAAMvN,EAAS,SAAS/F,GAC1B,OAAOyI,GAAQ1e,GAAYiW,EAAQqE,GACrC,GAyBIkP,GAAQxN,EAAS,SAAS/F,GAC5B,IAAIzW,EAAWkX,GAAKT,GACpB,OAAIqE,EAAkB9a,KACpBA,EAAW7N,GAEN+sB,GAAQ1e,GAAYiW,EAAQqE,GAAoBO,EAAYrb,EAAU,GAC/E,GAuBIiqB,GAAUzN,EAAS,SAAS/F,GAC9B,IAAI3V,EAAaoW,GAAKT,GACtB3V,SAAkC,mBAAdA,EAA2BA,EAAa3O,EACrD+sB,GAAQ1e,GAAYiW,EAAQqE,GAAoB3oB,EAAW2O,EACpE,GAkBIopB,GAAM1N,EAASmN,IA6DfQ,GAAU3N,EAAS,SAAS/F,GAC9B,IAAI9W,EAAS8W,EAAO9W,OAChBK,EAAWL,EAAS,EAAI8W,EAAO9W,EAAS,GAAKxN,EAEjD6N,SAA8B,mBAAZA,GAA0ByW,EAAOtD,MAAOnT,GAAY7N,EAC/D03B,GAAUpT,EAAQzW,EAC3B,GAiCA,SAASoqB,GAAMjqB,GACb,IAAIO,EAASuK,EAAO9K,GACpBO,SAAOoL,WAAY,EACZpL,CACT,CAqDA,SAAS8hB,GAAKriB,EAAOkqB,GACnB,OAAOA,EAAYlqB,EACrB,CAkBA,IAAImqB,GAAYjI,GAAS,SAASrT,GAChC,IAAIrP,EAASqP,EAAMrP,OACf8c,EAAQ9c,EAASqP,EAAM,GAAK,EAC5B7O,EAAQrP,KAAK8a,YACbye,EAAc,SAAS/nB,GAAU,OAAOyM,GAAOzM,EAAQ0M,EAAQ,EAEnE,QAAIrP,EAAS,GAAK7O,KAAK+a,YAAYlM,SAC7BQ,aAAiBiL,GAAiBqC,GAAQgP,KAGhDtc,EAAQA,EAAM2C,MAAM2Z,GAAQA,GAAS9c,EAAS,EAAI,KAC5CkM,YAAY6B,KAAK,CACrBlO,KAAQgjB,GACR9iB,KAAQ,CAAC2qB,GACT5qB,QAAWtN,IAEN,IAAIkZ,GAAclL,EAAOrP,KAAKgb,WAAW0W,KAAK,SAAS1iB,GAC5D,OAAIH,IAAWG,EAAMH,QACnBG,EAAM4N,KAAKvb,GAEN2N,CACT,IAbShP,KAAK0xB,KAAK6H,EAcrB,GAiPIE,GAAUvJ,GAAiB,SAAStgB,EAAQP,EAAOhL,GACjDoR,EAAe3G,KAAKc,EAAQvL,KAC5BuL,EAAOvL,GAETiZ,GAAgB1N,EAAQvL,EAAK,EAEjC,GAqIIq1B,GAAOtI,GAAW4G,IAqBlB2B,GAAWvI,GAAW6G,IA2G1B,SAAS3kB,GAAQzC,EAAY3B,GAE3B,OADWmL,EAAQxJ,GAAcvB,GAAYqO,IACjC9M,EAAY0Z,EAAYrb,EAAU,GAChD,CAsBA,SAAS0qB,GAAa/oB,EAAY3B,GAEhC,OADWmL,EAAQxJ,GAActB,GAAiBoU,IACtC9S,EAAY0Z,EAAYrb,EAAU,GAChD,CAyBA,IAAI2qB,GAAU3J,GAAiB,SAAStgB,EAAQP,EAAOhL,GACjDoR,EAAe3G,KAAKc,EAAQvL,GAC9BuL,EAAOvL,GAAKuY,KAAKvN,GAEjBiO,GAAgB1N,EAAQvL,EAAK,CAACgL,GAElC,GAoEIyqB,GAAYpO,EAAS,SAAS7a,EAAY8T,EAAM/V,GAClD,IAAIQ,GAAQ,EACR+P,EAAwB,mBAARwF,EAChB/U,EAASuZ,GAAYtY,GAAcX,EAAMW,EAAWhC,QAAU,GAElE8O,UAAS9M,EAAY,SAASxB,GAC5BO,IAASR,GAAS+P,EAAS1Q,GAAMkW,EAAMtV,EAAOT,GAAQsX,GAAW7W,EAAOsV,EAAM/V,EAChF,GACOgB,CACT,GA8BImqB,GAAQ7J,GAAiB,SAAStgB,EAAQP,EAAOhL,GACnDiZ,GAAgB1N,EAAQvL,EAAKgL,EAC/B,GA4CA,SAAS+D,GAAIvC,EAAY3B,GAEvB,OADWmL,EAAQxJ,GAAcZ,EAAWiZ,IAChCrY,EAAY0Z,EAAYrb,EAAU,GAChD,CAiFA,IAAI8qB,GAAY9J,GAAiB,SAAStgB,EAAQP,EAAOhL,GACvDuL,EAAOvL,EAAM,EAAI,GAAGuY,KAAKvN,EAC3B,EAAG,WAAa,MAAO,CAAC,GAAI,GAAK,GAmS7B4qB,GAASvO,EAAS,SAAS7a,EAAYwZ,GACzC,GAAkB,MAAdxZ,EACF,MAAO,GAET,IAAIhC,EAASwb,EAAUxb,OACvB,OAAIA,EAAS,GAAK2hB,EAAe3f,EAAYwZ,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHxb,EAAS,GAAK2hB,EAAenG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYvZ,EAAYoT,EAAYoG,EAAW,GAAI,GAC5D,GAoBI7S,GAAMD,IAAU,WAClB,OAAOxK,EAAK+H,KAAK0C,KACnB,EAyDA,SAAS6a,GAAI3jB,EAAMmD,EAAG0e,GACpB1e,SAAI0e,EAAQlvB,EAAYwQ,EAEjBqjB,GAAWxmB,EAvzTF,IAuzTuBrN,EAAWA,EAAWA,EAAWA,EADxEwQ,EAAKnD,GAAa,MAALmD,EAAanD,EAAKG,OAASgD,EAE1C,CAmBA,SAASqoB,GAAOroB,EAAGnD,GACjB,IAAIkB,EACJ,GAAmB,mBAARlB,EACT,MAAM,IAAIwG,GAAU5P,GAEtBuM,SAAI+iB,EAAU/iB,GACP,WACL,QAAMA,EAAI,IACRjC,EAASlB,EAAKD,MAAMzO,KAAMkxB,YAExBrf,GAAK,IACPnD,EAAOrN,GAEFuO,CACT,CACF,CAqCA,IAAIuqB,GAAOzO,EAAS,SAAShd,EAAMC,EAASwgB,GAC1C,IAAI1Q,EAv4Ta,EAw4TjB,GAAI0Q,EAAStgB,OAAQ,CACnB,IAAIugB,EAAU1b,GAAeyb,EAAUwD,GAAUwH,KACjD1b,GAr4TkB,EAs4TpB,CACA,OAAOyW,GAAWxmB,EAAM+P,EAAS9P,EAASwgB,EAAUC,EACtD,GA+CIgL,GAAU1O,EAAS,SAASla,EAAQnN,EAAK8qB,GAC3C,IAAI1Q,EAAU4b,EACd,GAAIlL,EAAStgB,OAAQ,CACnB,IAAIugB,EAAU1b,GAAeyb,EAAUwD,GAAUyH,KACjD3b,GA37TkB,EA47TpB,CACA,OAAOyW,GAAW7wB,EAAKoa,EAASjN,EAAQ2d,EAAUC,EACpD,GAqJA,SAASkL,GAAS5rB,EAAMqS,EAAMwZ,GAC5B,IAAIC,EACAC,EACAC,EACA9qB,EACA+qB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTnK,GAAW,EAEf,GAAmB,mBAARliB,EACT,MAAM,IAAIwG,GAAU5P,GAUtB,SAAS01B,EAAWC,GAClB,IAAIrsB,GAAO4rB,EACP7rB,GAAU8rB,EAEdD,SAAWC,EAAWp5B,EACtBw5B,EAAiBI,EACjBrrB,EAASlB,EAAKD,MAAME,GAASC,GAE/B,CAqBA,SAASssB,EAAaD,GACpB,IAAIE,GAAoBF,EAAOL,EAM/B,OAAQA,IAAiBv5B,GAAc85B,IAAqBpa,GACzDoa,GAAoB,GAAOJ,GANJE,EAAOJ,GAM8BH,CACjE,CAEA,SAASU,IACP,IAAIH,EAAOzjB,KACX,GAAI0jB,EAAaD,GACf,OAAOI,EAAaJ,GAGtBN,EAAUjjB,GAAW0jB,EA3BvB,SAASE,EAAcL,GACrB,IAEIM,GAAcxa,GAFMka,EAAOL,GAI/B,OAAOG,EACHtiB,EAAU8iB,GAAab,GAJDO,EAAOJ,IAK7BU,EACN,CAmBqCD,CAAcL,GACnD,CAEA,SAASI,EAAaJ,GAKpB,OAJAN,EAAUt5B,EAINuvB,GAAY4J,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWp5B,EACfuO,EACT,CAcA,SAAS4rB,KACP,IAAIP,EAAOzjB,KACPikB,GAAaP,EAAaD,GAM9B,GAJAT,EAAWtJ,UACXuJ,EAAWz6B,KACX46B,EAAeK,EAEXQ,GAAY,CACd,GAAId,IAAYt5B,EACd,OAzEN,SAASq6B,EAAYT,GAEnBJ,SAAiBI,EAEjBN,EAAUjjB,GAAW0jB,EAAcra,GAE5B+Z,EAAUE,EAAWC,GAAQrrB,CACtC,CAkEa8rB,CAAYd,GAErB,GAAIG,EAEFzjB,UAAaqjB,GACbA,EAAUjjB,GAAW0jB,EAAcra,GAC5Bia,EAAWJ,EAEtB,CACA,OAAID,IAAYt5B,IACds5B,EAAUjjB,GAAW0jB,EAAcra,IAE9BnR,CACT,CACA4rB,OAzGAza,EAAOqT,GAASrT,IAAS,EACrBpG,EAAS4f,KACXO,IAAYP,EAAQO,QAEpBJ,GADAK,EAAS,YAAaR,GACHhiB,EAAU6b,GAASmG,EAAQG,UAAY,EAAG3Z,GAAQ2Z,EACrE9J,EAAW,aAAc2J,IAAYA,EAAQ3J,SAAWA,GAoG1D4K,GAAUG,OApCV,SAASA,KACHhB,IAAYt5B,GACdiW,GAAaqjB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUt5B,CACjD,EA+BAm6B,GAAUI,MA7BV,SAASA,IACP,OAAOjB,IAAYt5B,EAAYuO,EAASyrB,EAAa7jB,KACvD,EA4BOgkB,EACT,CAoBA,IAAIK,GAAQnQ,EAAS,SAAShd,EAAME,GAClC,OAAOkS,GAAUpS,EAAM,EAAGE,EAC5B,GAqBIktB,GAAQpQ,EAAS,SAAShd,EAAMqS,EAAMnS,GACxC,OAAOkS,GAAUpS,EAAM0lB,GAASrT,IAAS,EAAGnS,EAC9C,GAoEA,SAAS4oB,GAAQ9oB,EAAMqtB,GACrB,GAAmB,mBAARrtB,GAAmC,MAAZqtB,GAAuC,mBAAZA,EAC3D,MAAM,IAAI7mB,GAAU5P,GAEtB,IAAI02B,EAAW,WACb,IAAIptB,EAAOsiB,UACP7sB,EAAM03B,EAAWA,EAASttB,MAAMzO,KAAM4O,GAAQA,EAAK,GACnD2D,EAAQypB,EAASzpB,MAErB,GAAIA,EAAMC,IAAInO,GACZ,OAAOkO,EAAM6L,IAAI/Z,GAEnB,IAAIuL,EAASlB,EAAKD,MAAMzO,KAAM4O,GAC9BotB,SAASzpB,MAAQA,EAAMsB,IAAIxP,EAAKuL,IAAW2C,EACpC3C,CACT,EACAosB,SAASzpB,MAAQ,IAAKilB,GAAQyE,OAASpgB,IAChCmgB,CACT,CAyBA,SAASE,GAAOzsB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIyF,GAAU5P,GAEtB,OAAO,WACL,IAAIsJ,EAAOsiB,UACX,OAAQtiB,EAAKC,QACX,KAAK,EAAG,OAAQY,EAAUX,KAAK9O,MAC/B,KAAK,EAAG,OAAQyP,EAAUX,KAAK9O,KAAM4O,EAAK,IAC1C,KAAK,EAAG,OAAQa,EAAUX,KAAK9O,KAAM4O,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQa,EAAUX,KAAK9O,KAAM4O,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQa,EAAUhB,MAAMzO,KAAM4O,EAChC,CACF,CApCA4oB,GAAQyE,MAAQpgB,GA2FhB,IAAIsgB,GAAWxN,GAAS,SAASjgB,EAAM0tB,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWvtB,QAAewL,EAAQ+hB,EAAW,IACvDnsB,EAASmsB,EAAW,GAAIjqB,GAAUoY,MAClCta,EAASgU,EAAYmY,EAAY,GAAIjqB,GAAUoY,OAEtB1b,OAC7B,OAAO6c,EAAS,SAAS9c,GAIvB,QAHIQ,GAAQ,EACRP,EAAS4J,EAAU7J,EAAKC,OAAQwtB,KAE3BjtB,EAAQP,GACfD,EAAKQ,GAASgtB,EAAWhtB,GAAON,KAAK9O,KAAM4O,EAAKQ,IAElD,OAAOX,GAAMC,EAAM1O,KAAM4O,EAC3B,EACF,GAmCI0tB,GAAU5Q,EAAS,SAAShd,EAAMygB,GACpC,IAAIC,EAAU1b,GAAeyb,EAAUwD,GAAU2J,KACjD,OAAOpH,GAAWxmB,EAn+UE,GAm+UuBrN,EAAW8tB,EAAUC,EAClE,GAkCImN,GAAe7Q,EAAS,SAAShd,EAAMygB,GACzC,IAAIC,EAAU1b,GAAeyb,EAAUwD,GAAU4J,KACjD,OAAOrH,GAAWxmB,EAvgVQ,GAugVuBrN,EAAW8tB,EAAUC,EACxE,GAwBIoN,GAAQjL,GAAS,SAAS7iB,EAAM4c,GAClC,OAAO4J,GAAWxmB,EA/hVA,IA+hVuBrN,EAAWA,EAAWA,EAAWiqB,EAC5E,GAgaA,SAASjO,GAAGhO,EAAOkW,GACjB,OAAOlW,IAAUkW,GAAUlW,GAAUA,GAASkW,GAAUA,CAC1D,CAyBA,IAAIkX,GAAKtI,GAA0B7O,IAyB/BoX,GAAMvI,GAA0B,SAAS9kB,EAAOkW,GAClD,OAAOlW,GAASkW,CAClB,GAoBIhJ,GAAc8J,GAAgB,WAAa,OAAO6K,SAAW,CAA/B,IAAsC7K,GAAkB,SAAShX,GACjG,OAAO+K,EAAa/K,IAAUoG,EAAe3G,KAAKO,EAAO,YACtDsH,GAAqB7H,KAAKO,EAAO,SACtC,EAyBIgL,EAAUnK,EAAMmK,QAmBhBvM,GAAgBD,GAAoBsE,GAAUtE,IA75PlD,SAAS8uB,GAAkBttB,GACzB,OAAO+K,EAAa/K,IAAU4V,EAAW5V,IAAUxI,EACrD,EAs7PA,SAASsiB,GAAY9Z,GACnB,OAAgB,MAATA,GAAiBgnB,GAAShnB,EAAMR,UAAY4V,GAAWpV,EAChE,CA2BA,SAAS2a,EAAkB3a,GACzB,OAAO+K,EAAa/K,IAAU8Z,GAAY9Z,EAC5C,CAyCA,IAAI6I,GAAWD,IAAkBye,GAmB7B1oB,GAASD,GAAaoE,GAAUpE,IAxgQpC,SAAS6uB,GAAWvtB,GAClB,OAAO+K,EAAa/K,IAAU4V,EAAW5V,IAAUrJ,EACrD,EA8qQA,SAAS62B,GAAQxtB,GACf,IAAK+K,EAAa/K,GAChB,OAAO,EAET,IAAI4P,EAAMgG,EAAW5V,GACrB,OAAO4P,GAAOhZ,IA9yWF,yBA8yWcgZ,GACC,iBAAjB5P,EAAM6X,SAA4C,iBAAd7X,EAAM5K,OAAqBwlB,GAAc5a,EACzF,CAiDA,SAASoV,GAAWpV,GAClB,IAAKsL,EAAStL,GACZ,OAAO,EAIT,IAAI4P,EAAMgG,EAAW5V,GACrB,OAAO4P,GAAO/Y,IAAW+Y,GAAO9Y,IA32WrB,0BA22W+B8Y,GA/1W/B,kBA+1WkDA,CAC/D,CA4BA,SAAS6d,GAAUztB,GACjB,MAAuB,iBAATA,GAAqBA,GAASulB,EAAUvlB,EACxD,CA4BA,SAASgnB,GAAShnB,GAChB,MAAuB,iBAATA,GACZA,GAAQ,GAAMA,EAAQ,GAAK,GAAKA,GAAS3J,EAC7C,CA2BA,SAASiV,EAAStL,GAChB,IAAI9L,SAAc8L,EAClB,OAAgB,MAATA,IAA0B,UAAR9L,GAA4B,YAARA,EAC/C,CA0BA,SAAS6W,EAAa/K,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAmBA,IAAInB,GAAQD,GAAYkE,GAAUlE,IA5xQlC,SAAS8uB,GAAU1tB,GACjB,OAAO+K,EAAa/K,IAAU6P,EAAO7P,IAAUjJ,EACjD,EA4+QA,SAAS42B,GAAS3tB,GAChB,MAAuB,iBAATA,GACX+K,EAAa/K,IAAU4V,EAAW5V,IAAUhJ,EACjD,CA8BA,SAAS4jB,GAAc5a,GACrB,IAAK+K,EAAa/K,IAAU4V,EAAW5V,IAAU/I,GAC/C,OAAO,EAET,IAAIoU,EAAQnE,GAAalH,GACzB,GAAc,OAAVqL,EACF,OAAO,EAET,IAAImF,EAAOpK,EAAe3G,KAAK4L,EAAO,gBAAkBA,EAAM7a,YAC9D,MAAsB,mBAARggB,GAAsBA,aAAgBA,GAClDtK,GAAazG,KAAK+Q,IAAS7J,EAC/B,CAmBA,IAAI5H,GAAWD,GAAegE,GAAUhE,IA59QxC,SAAS8uB,GAAa5tB,GACpB,OAAO+K,EAAa/K,IAAU4V,EAAW5V,IAAU7I,EACrD,EA4gRI8H,GAAQD,GAAY8D,GAAU9D,IAngRlC,SAAS6uB,GAAU7tB,GACjB,OAAO+K,EAAa/K,IAAU6P,EAAO7P,IAAU5I,EACjD,EAohRA,SAAS02B,GAAS9tB,GAChB,MAAuB,iBAATA,IACVgL,EAAQhL,IAAU+K,EAAa/K,IAAU4V,EAAW5V,IAAU3I,EACpE,CAmBA,SAASqd,GAAS1U,GAChB,MAAuB,iBAATA,GACX+K,EAAa/K,IAAU4V,EAAW5V,IAAU1I,EACjD,CAmBA,IAAI6H,GAAeD,GAAmB4D,GAAU5D,IAvjRhD,SAAS6uB,GAAiB/tB,GACxB,OAAO+K,EAAa/K,IAClBgnB,GAAShnB,EAAMR,WAAa1C,EAAe8Y,EAAW5V,GAC1D,EA4oRIguB,GAAKlJ,GAA0BlL,IAyB/BqU,GAAMnJ,GAA0B,SAAS9kB,EAAOkW,GAClD,OAAOlW,GAASkW,CAClB,GAyBA,SAASgY,GAAQluB,GACf,IAAKA,EACH,MAAO,GAET,GAAI8Z,GAAY9Z,GACd,OAAO8tB,GAAS9tB,GAAS4E,GAAc5E,GAAS4N,GAAU5N,GAE5D,GAAI0H,IAAe1H,EAAM0H,IACvB,OAv8VN,SAASymB,GAAgBxmB,GAIvB,QAHIkF,EACAtM,EAAS,KAEJsM,EAAOlF,EAASymB,QAAQC,MAC/B9tB,EAAOgN,KAAKV,EAAK7M,OAEnB,OAAOO,CACT,CA+7Va4tB,CAAgBnuB,EAAM0H,OAE/B,IAAIkI,EAAMC,EAAO7P,GAGjB,OAFW4P,GAAO7Y,GAAS+M,GAAc8L,GAAOxY,GAASmN,GAAaxD,IAE1Df,EACd,CAyBA,SAAS4kB,GAAS5kB,GAChB,OAAKA,GAGLA,EAAQ+kB,GAAS/kB,MACH5J,IAAY4J,KAAW5J,GAxkYvB,uBAykYA4J,EAAQ,GAAI,EAAK,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,CA4BA,SAASulB,EAAUvlB,GACjB,IAAIO,EAASqkB,GAAS5kB,GAClBsuB,EAAY/tB,EAAS,EAEzB,OAAOA,GAAWA,EAAU+tB,EAAY/tB,EAAS+tB,EAAY/tB,EAAU,CACzE,CA6BA,SAASguB,GAASvuB,GAChB,OAAOA,EAAQ6N,GAAU0X,EAAUvlB,GAAQ,EAAG1J,IAAoB,CACpE,CAyBA,SAASyuB,GAAS/kB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI0U,GAAS1U,GACX,OA1qYIkC,IA4qYN,GAAIoJ,EAAStL,GAAQ,CACnB,IAAIkW,EAAgC,mBAAjBlW,EAAM4K,QAAwB5K,EAAM4K,UAAY5K,EACnEA,EAAQsL,EAAS4K,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAATlW,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQyC,GAASzC,GACjB,IAAIwuB,EAAWz0B,GAAW8J,KAAK7D,GAC/B,OAAQwuB,GAAYv0B,GAAU4J,KAAK7D,GAC/B7C,GAAa6C,EAAM2C,MAAM,GAAI6rB,EAAW,EAAI,GAC3C10B,GAAW+J,KAAK7D,GAvrYfkC,KAurY+BlC,CACvC,CA0BA,SAAS6a,GAAc7a,GACrB,OAAOwO,GAAWxO,EAAOoQ,GAAOpQ,GAClC,CAqDA,SAASmG,EAASnG,GAChB,OAAgB,MAATA,EAAgB,GAAKoe,GAAape,EAC3C,CAoCA,IAAIyuB,GAAS1N,GAAe,SAAS5e,EAAQzJ,GAC3C,GAAIihB,GAAYjhB,IAAWohB,GAAYphB,GACrC8V,GAAW9V,EAAQ8N,EAAK9N,GAASyJ,QAGnC,QAASnN,KAAO0D,EACV0N,EAAe3G,KAAK/G,EAAQ1D,IAC9BkZ,GAAY/L,EAAQnN,EAAK0D,EAAO1D,GAGtC,GAiCI05B,GAAW3N,GAAe,SAAS5e,EAAQzJ,GAC7C8V,GAAW9V,EAAQ0X,GAAO1X,GAASyJ,EACrC,GA+BIwsB,GAAe5N,GAAe,SAAS5e,EAAQzJ,EAAQ2hB,EAAUhL,GACnEb,GAAW9V,EAAQ0X,GAAO1X,GAASyJ,EAAQkN,EAC7C,GA8BIuf,GAAa7N,GAAe,SAAS5e,EAAQzJ,EAAQ2hB,EAAUhL,GACjEb,GAAW9V,EAAQ8N,EAAK9N,GAASyJ,EAAQkN,EAC3C,GAmBIwf,GAAK3M,GAAStT,IA8DdrJ,GAAW8W,EAAS,SAASla,EAAQ8e,GACvC9e,EAAS5E,EAAO4E,GAEhB,IAAIpC,GAAQ,EACRP,EAASyhB,EAAQzhB,OACjB0hB,EAAQ1hB,EAAS,EAAIyhB,EAAQ,GAAKjvB,EAMtC,IAJIkvB,GAASC,EAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD1hB,EAAS,KAGFO,EAAQP,GAMf,QALI9G,EAASuoB,EAAQlhB,GACjBiD,EAAQoN,GAAO1X,GACfo2B,GAAa,EACbC,EAAc/rB,EAAMxD,SAEfsvB,EAAaC,GAAa,CACjC,IAAI/5B,EAAMgO,EAAM8rB,GACZ9uB,EAAQmC,EAAOnN,IAEfgL,IAAUhO,GACTgc,GAAGhO,EAAOgG,GAAYhR,MAAUoR,EAAe3G,KAAK0C,EAAQnN,MAC/DmN,EAAOnN,GAAO0D,EAAO1D,GAEzB,CAGF,OAAOmN,CACT,GAqBI6sB,GAAe3S,EAAS,SAAS9c,GACnCA,SAAKgO,KAAKvb,EAAWq0B,IACdjnB,GAAM6vB,GAAWj9B,EAAWuN,EACrC,GA+RA,SAASwP,GAAI5M,EAAQmT,EAAM8O,GACzB,IAAI7jB,EAAmB,MAAV4B,EAAiBnQ,EAAYqjB,GAAQlT,EAAQmT,GAC1D,OAAO/U,IAAWvO,EAAYoyB,EAAe7jB,CAC/C,CA2DA,SAAS4Z,GAAMhY,EAAQmT,GACrB,OAAiB,MAAVnT,GAAkB2kB,GAAQ3kB,EAAQmT,EAAMc,GACjD,CAoBA,IAAI8Y,GAASnL,GAAe,SAASxjB,EAAQP,EAAOhL,GACrC,MAATgL,GACyB,mBAAlBA,EAAMmG,WACfnG,EAAQ0G,GAAqBjH,KAAKO,IAGpCO,EAAOP,GAAShL,CAClB,EAAG8nB,GAASxD,KA4BR6V,GAAWpL,GAAe,SAASxjB,EAAQP,EAAOhL,GACvC,MAATgL,GACyB,mBAAlBA,EAAMmG,WACfnG,EAAQ0G,GAAqBjH,KAAKO,IAGhCoG,EAAe3G,KAAKc,EAAQP,GAC9BO,EAAOP,GAAOuN,KAAKvY,GAEnBuL,EAAOP,GAAS,CAAChL,EAErB,EAAGkmB,GAoBCkU,GAAS/S,EAASxF,IA8BtB,SAASrQ,EAAKrE,GACZ,OAAO2X,GAAY3X,GAAU2K,GAAc3K,GAAUuX,GAASvX,EAChE,CAyBA,SAASiO,GAAOjO,GACd,OAAO2X,GAAY3X,GAAU2K,GAAc3K,GAAQ,GAloTrD,SAASktB,GAAWltB,GAClB,IAAKmJ,EAASnJ,GACZ,OA09FJ,SAASmtB,GAAantB,GACpB,IAAI5B,EAAS,GACb,GAAc,MAAV4B,EACF,QAASnN,KAAOuI,EAAO4E,GACrB5B,EAAOgN,KAAKvY,GAGhB,OAAOuL,CACT,CAl+FW+uB,CAAantB,GAEtB,IAAIotB,EAAU5V,GAAYxX,GACtB5B,EAAS,GAEb,QAASvL,KAAOmN,EACD,eAAPnN,IAAyBu6B,IAAYnpB,EAAe3G,KAAK0C,EAAQnN,KACrEuL,EAAOgN,KAAKvY,GAGhB,OAAOuL,CACT,CAqnT6D8uB,CAAWltB,EACxE,CAsGA,IAAIqtB,GAAQzO,GAAe,SAAS5e,EAAQzJ,EAAQ2hB,GAClDD,GAAUjY,EAAQzJ,EAAQ2hB,EAC5B,GAiCI4U,GAAYlO,GAAe,SAAS5e,EAAQzJ,EAAQ2hB,EAAUhL,GAChE+K,GAAUjY,EAAQzJ,EAAQ2hB,EAAUhL,EACtC,GAsBIogB,GAAOvN,GAAS,SAAS/f,EAAQ0M,GACnC,IAAItO,EAAS,CAAC,EACd,GAAc,MAAV4B,EACF,OAAO5B,EAET,IAAIgP,GAAS,EACbV,EAAQjO,EAASiO,EAAO,SAASyG,GAC/BA,SAAOC,GAASD,EAAMnT,GACtBoN,IAAWA,EAAS+F,EAAK9V,OAAS,GAC3B8V,CACT,GACA9G,GAAWrM,EAAQmP,GAAanP,GAAS5B,GACrCgP,IACFhP,EAAS4O,GAAU5O,EAAQmvB,EAAwDpJ,KAGrF,QADI9mB,EAASqP,EAAMrP,OACZA,KACL2c,GAAU5b,EAAQsO,EAAMrP,IAE1B,OAAOe,CACT,GA2CIiF,GAAO0c,GAAS,SAAS/f,EAAQ0M,GACnC,OAAiB,MAAV1M,EAAiB,CAAC,EAnmT3B,SAASwtB,GAASxtB,EAAQ0M,GACxB,OAAO+M,GAAWzZ,EAAQ0M,EAAO,SAAS7O,EAAOsV,GAC/C,OAAO6E,GAAMhY,EAAQmT,EACvB,EACF,CA+lT+Bqa,CAASxtB,EAAQ0M,EAChD,GAoBA,SAAS+gB,GAAOztB,EAAQ/B,GACtB,GAAc,MAAV+B,EACF,MAAO,CAAC,EAEV,IAAIa,EAAQpC,EAAS0Q,GAAanP,GAAS,SAAS0tB,GAClD,MAAO,CAACA,EACV,GACAzvB,SAAY8a,EAAY9a,GACjBwb,GAAWzZ,EAAQa,EAAO,SAAShD,EAAOsV,GAC/C,OAAOlV,EAAUJ,EAAOsV,EAAK,GAC/B,EACF,CA0IA,IAAIwa,GAAUpK,GAAclf,GA0BxBupB,GAAYrK,GAActV,IA4K9B,SAASrP,GAAOoB,GACd,OAAiB,MAAVA,EAAiB,GAAKY,GAAWZ,EAAQqE,EAAKrE,GACvD,CAiNA,IAAI6tB,GAAYxO,GAAiB,SAASjhB,EAAQ0vB,EAAMlwB,GACtDkwB,SAAOA,EAAKC,cACL3vB,GAAUR,EAAQowB,GAAWF,GAAQA,EAC9C,GAiBA,SAASE,GAAWztB,GAClB,OAAO0tB,GAAWjqB,EAASzD,GAAQwtB,cACrC,CAoBA,SAASvO,GAAOjf,GACdA,SAASyD,EAASzD,KACDA,EAAOG,QAAQ1I,GAASqJ,IAAcX,QAAQtG,GAAa,GAC9E,CAqHA,IAAI8zB,GAAY7O,GAAiB,SAASjhB,EAAQ0vB,EAAMlwB,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMkwB,EAAKC,aAC5C,GAsBII,GAAY9O,GAAiB,SAASjhB,EAAQ0vB,EAAMlwB,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMkwB,EAAKC,aAC5C,GAmBIK,GAAalP,GAAgB,eA0N7BmP,GAAYhP,GAAiB,SAASjhB,EAAQ0vB,EAAMlwB,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMkwB,EAAKC,aAC5C,GA+DIO,GAAYjP,GAAiB,SAASjhB,EAAQ0vB,EAAMlwB,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMqwB,GAAWH,EAClD,GAqiBIS,GAAYlP,GAAiB,SAASjhB,EAAQ0vB,EAAMlwB,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMkwB,EAAKU,aAC5C,GAmBIP,GAAa/O,GAAgB,eAqBjC,SAASK,GAAMhf,EAAQkuB,EAAS1P,GAI9B,OAHAxe,EAASyD,EAASzD,IAClBkuB,EAAU1P,EAAQlvB,EAAY4+B,KAEd5+B,EArybpB,SAAS6+B,GAAenuB,GACtB,OAAO/F,GAAiBkH,KAAKnB,EAC/B,CAoybamuB,CAAenuB,GA1jb5B,SAASouB,GAAapuB,GACpB,OAAOA,EAAOoC,MAAMrI,KAAkB,EACxC,CAwjbsCq0B,CAAapuB,GAzrcnD,SAASquB,GAAWruB,GAClB,OAAOA,EAAOoC,MAAMrL,KAAgB,EACtC,CAurc6Ds3B,CAAWruB,GAE7DA,EAAOoC,MAAM8rB,IAAY,EAClC,CA0BA,IAAII,GAAU3U,EAAS,SAAShd,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMrN,EAAWuN,EAChC,OAASnM,GACP,OAAOo6B,GAAQp6B,GAAKA,EAAI,IAAIsS,EAAMtS,EACpC,CACF,GA4BI69B,GAAU/O,GAAS,SAAS/f,EAAQ+uB,GACtCjxB,UAAUixB,EAAa,SAASl8B,GAC9BA,EAAMwgB,GAAMxgB,GACZiZ,GAAgB9L,EAAQnN,EAAK81B,GAAK3oB,EAAOnN,GAAMmN,GACjD,GACOA,CACT,GAoGA,SAAS2a,GAAS9c,GAChB,OAAO,WACL,OAAOA,CACT,CACF,CAgDA,IAAImxB,GAAOlP,KAuBPmP,GAAYnP,IAAW,GAkB3B,SAAS3I,GAAStZ,GAChB,OAAOA,CACT,CA4CA,SAASH,GAASR,GAChB,OAAOga,GAA4B,mBAARha,EAAqBA,EAAO8P,GAAU9P,EAjte/C,GAktepB,CAsGA,IAAIgyB,GAAShV,EAAS,SAAS/G,EAAM/V,GACnC,OAAO,SAAS4C,GACd,OAAO0U,GAAW1U,EAAQmT,EAAM/V,EAClC,CACF,GAyBI+xB,GAAWjV,EAAS,SAASla,EAAQ5C,GACvC,OAAO,SAAS+V,GACd,OAAOuB,GAAW1U,EAAQmT,EAAM/V,EAClC,CACF,GAsCA,SAASgyB,GAAMpvB,EAAQzJ,EAAQwyB,GAC7B,IAAIloB,EAAQwD,EAAK9N,GACbw4B,EAAc/b,GAAczc,EAAQsK,GAEzB,MAAXkoB,KACE5f,EAAS5S,KAAYw4B,EAAY1xB,QAAWwD,EAAMxD,UACtD0rB,EAAUxyB,EACVA,EAASyJ,EACTA,EAASxR,KACTugC,EAAc/b,GAAczc,EAAQ8N,EAAK9N,KAE3C,IAAIuxB,IAAU3e,EAAS4f,IAAY,UAAWA,IAAcA,EAAQjB,OAChEna,EAASsF,GAAWjT,GAExBlC,UAAUixB,EAAa,SAAS5P,GAC9B,IAAIjiB,EAAO3G,EAAO4oB,GAClBnf,EAAOmf,GAAcjiB,EACjByQ,IACF3N,EAAO4D,UAAUub,GAAc,WAC7B,IAAI9V,EAAW7a,KAAKgb,UACpB,GAAIse,GAASze,EAAU,CACrB,IAAIjL,EAAS4B,EAAOxR,KAAK8a,aAGzBoT,OAFcte,EAAOmL,YAAckC,GAAUjd,KAAK+a,cAE1C6B,KAAK,CAAElO,KAAQA,EAAME,KAAQsiB,UAAWviB,QAAW6C,IAC3D5B,EAAOoL,UAAYH,EACZjL,CACT,CACA,OAAOlB,EAAKD,MAAM+C,EAAQrB,GAAU,CAACnQ,KAAKqP,SAAU6hB,WACtD,EAEJ,GAEO1f,CACT,CAkCA,SAASsjB,KACP,CAgDF,IAAI+L,GAAOnN,GAAWzjB,GA8BlB6wB,GAAYpN,GAAWlkB,IAiCvBuxB,GAAWrN,GAAWjjB,IAwB1B,SAASqY,GAASnE,GAChB,OAAO2E,GAAM3E,GAAQhU,GAAakU,GAAMF,IAh3X1C,SAASqc,GAAiBrc,GACxB,OAAO,SAASnT,GACd,OAAOkT,GAAQlT,EAAQmT,EACzB,CACF,CA42XmDqc,CAAiBrc,EACpE,CAsEA,IAAIsc,GAAQlN,KAsCRmN,GAAanN,IAAY,GAoB7B,SAASmC,KACP,MAAO,EACT,CAeA,SAASQ,KACP,OAAO,CACT,CA8JA,IAAI1a,GAAMuX,GAAoB,SAAS4N,EAAQC,GAC7C,OAAOD,EAASC,CAClB,EAAG,GAuBCxpB,GAAO8c,GAAY,QAiBnB2M,GAAS9N,GAAoB,SAAS+N,EAAUC,GAClD,OAAOD,EAAWC,CACpB,EAAG,GAuBCzpB,GAAQ4c,GAAY,SAwKpB8M,GAAWjO,GAAoB,SAASkO,EAAYC,GACtD,OAAOD,EAAaC,CACtB,EAAG,GAuBCC,GAAQjN,GAAY,SAiBpBkN,GAAWrO,GAAoB,SAASsO,EAASC,GACnD,OAAOD,EAAUC,CACnB,EAAG,GAsDH3nB,SAAO4nB,MAp6MP,SAASA,GAAMlwB,EAAGnD,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIwG,GAAU5P,GAEtBuM,SAAI+iB,EAAU/iB,GACP,WACL,KAAMA,EAAI,EACR,OAAOnD,EAAKD,MAAMzO,KAAMkxB,UAE5B,CACF,EA25MA/W,EAAOkY,IAAMA,GACblY,EAAO2jB,OAASA,GAChB3jB,EAAO4jB,SAAWA,GAClB5jB,EAAO6jB,aAAeA,GACtB7jB,EAAO8jB,WAAaA,GACpB9jB,EAAO+jB,GAAKA,GACZ/jB,EAAO+f,OAASA,GAChB/f,EAAOggB,KAAOA,GACdhgB,EAAOmmB,QAAUA,GACjBnmB,EAAOigB,QAAUA,GACjBjgB,EAAO6nB,UAl8KP,SAASA,KACP,IAAK9Q,UAAUriB,OACb,MAAO,GAET,IAAIQ,EAAQ6hB,UAAU,GACtB,OAAO7W,EAAQhL,GAASA,EAAQ,CAACA,EACnC,EA67KA8K,EAAOmf,MAAQA,GACfnf,EAAO8nB,MApgTP,SAASA,GAAMjzB,EAAOqE,EAAMkd,GAExBld,GADGkd,EAAQC,EAAexhB,EAAOqE,EAAMkd,GAASld,IAAShS,GAClD,EAEAkX,EAAUqc,EAAUvhB,GAAO,GAEpC,IAAIxE,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,GAAUwE,EAAO,EACpB,MAAO,GAMT,QAJIjE,EAAQ,EACRO,EAAW,EACXC,EAASM,EAAMyH,GAAW9I,EAASwE,IAEhCjE,EAAQP,GACbe,EAAOD,KAAc0c,GAAUrd,EAAOI,EAAQA,GAASiE,GAEzD,OAAOzD,CACT,EAm/SAuK,EAAO+nB,QAl+SP,SAASA,GAAQlzB,GAMf,QALII,GAAQ,EACRP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCc,EAAW,EACXC,EAAS,KAEJR,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdC,IACFO,EAAOD,KAAcN,EAEzB,CACA,OAAOO,CACT,EAs9SAuK,EAAOgoB,OA97SP,SAASA,KACP,IAAItzB,EAASqiB,UAAUriB,OACvB,IAAKA,EACH,MAAO,GAMT,QAJID,EAAOsB,EAAMrB,EAAS,GACtBG,EAAQkiB,UAAU,GAClB9hB,EAAQP,EAELO,KACLR,EAAKQ,EAAQ,GAAK8hB,UAAU9hB,GAE9B,OAAOe,GAAUkK,EAAQrL,GAASiO,GAAUjO,GAAS,CAACA,GAAQiV,EAAYrV,EAAM,GAClF,EAk7SAuL,EAAOioB,KA3tCP,SAASA,GAAK7e,GACZ,IAAI1U,EAAkB,MAAT0U,EAAgB,EAAIA,EAAM1U,OACnCwkB,EAAa9I,IAEjBhH,SAAS1U,EAAcoB,EAASsT,EAAO,SAASsR,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAI3f,GAAU5P,GAEtB,MAAO,CAAC+tB,EAAWwB,EAAK,IAAKA,EAAK,GACpC,GALkB,GAOXnJ,EAAS,SAAS9c,GAEvB,QADIQ,GAAQ,IACHA,EAAQP,GAAQ,CACvB,IAAIgmB,EAAOtR,EAAMnU,GACjB,GAAIX,GAAMomB,EAAK,GAAI70B,KAAM4O,GACvB,OAAOH,GAAMomB,EAAK,GAAI70B,KAAM4O,EAEhC,CACF,EACF,EAwsCAuL,EAAOkoB,SA9qCP,SAASA,GAASt6B,GAChB,OAz5YF,SAASu6B,GAAav6B,GACpB,IAAIsK,EAAQwD,EAAK9N,GACjB,OAAO,SAASyJ,GACd,OAAOqP,GAAerP,EAAQzJ,EAAQsK,EACxC,CACF,CAo5YSiwB,CAAa9jB,GAAUzW,EA/ieZ,GAgjepB,EA6qCAoS,EAAOgS,SAAWA,GAClBhS,EAAOsf,QAAUA,GACjBtf,EAAOzD,OAtuHP,SAASA,GAAOtB,EAAWmtB,GACzB,IAAI3yB,EAAS6K,GAAWrF,GACxB,OAAqB,MAAdmtB,EAAqB3yB,EAASgO,GAAWhO,EAAQ2yB,EAC1D,EAouHApoB,EAAOqoB,MAzuMP,SAASA,GAAM9zB,EAAM4jB,EAAO/B,GAE1B,IAAI3gB,EAASslB,GAAWxmB,EA7+TN,EA6+T6BrN,EAAWA,EAAWA,EAAWA,EAAWA,EAD3FixB,EAAQ/B,EAAQlvB,EAAYixB,GAE5B1iB,SAAO+D,YAAc6uB,GAAM7uB,YACpB/D,CACT,EAquMAuK,EAAOsoB,WA7rMP,SAASA,GAAW/zB,EAAM4jB,EAAO/B,GAE/B,IAAI3gB,EAASslB,GAAWxmB,EAzhUA,GAyhU6BrN,EAAWA,EAAWA,EAAWA,EAAWA,EADjGixB,EAAQ/B,EAAQlvB,EAAYixB,GAE5B1iB,SAAO+D,YAAc8uB,GAAW9uB,YACzB/D,CACT,EAyrMAuK,EAAOmgB,SAAWA,GAClBngB,EAAOvF,SAAWA,GAClBuF,EAAOkkB,aAAeA,GACtBlkB,EAAO0hB,MAAQA,GACf1hB,EAAO2hB,MAAQA,GACf3hB,EAAO0d,WAAaA,GACpB1d,EAAO2d,aAAeA,GACtB3d,EAAO4d,eAAiBA,GACxB5d,EAAOuoB,KAt0SP,SAASA,GAAK1zB,EAAO6C,EAAG0e,GACtB,IAAI1hB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,EAIEwd,GAAUrd,GADjB6C,EAAK0e,GAAS1e,IAAMxQ,EAAa,EAAIuzB,EAAU/iB,IACnB,EAAI,EAAIA,EAAGhD,GAH9B,EAIX,EAg0SAsL,EAAOwoB,UArySP,SAASA,GAAU3zB,EAAO6C,EAAG0e,GAC3B,IAAI1hB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,EAKEwd,GAAUrd,EAAO,GADxB6C,EAAIhD,GADJgD,EAAK0e,GAAS1e,IAAMxQ,EAAa,EAAIuzB,EAAU/iB,KAEhB,EAAI,EAAIA,GAJ9B,EAKX,EA8xSAsI,EAAOyoB,eAzvSP,SAASA,GAAe5zB,EAAOS,GAC7B,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAOub,EAAY9a,EAAW,IAAI,GAAM,GAClD,EACN,EAsvSA0K,EAAO0oB,UAjtSP,SAASA,GAAU7zB,EAAOS,GACxB,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAOub,EAAY9a,EAAW,IAAI,GAC5C,EACN,EA8sSA0K,EAAO2oB,KA/qSP,SAASA,GAAK9zB,EAAOK,EAAOsc,EAAOW,GACjC,IAAIzd,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGD8c,GAAyB,iBAATA,GAAqB6E,EAAexhB,EAAOK,EAAOsc,KACpEA,EAAQ,EACRW,EAAMzd,GAzvIV,SAASk0B,GAAS/zB,EAAOK,EAAOsc,EAAOW,GACrC,IAAIzd,EAASG,EAAMH,OAWnB,KATA8c,EAAQiJ,EAAUjJ,IACN,IACVA,GAASA,EAAQ9c,EAAS,EAAKA,EAAS8c,IAE1CW,EAAOA,IAAQjrB,GAAairB,EAAMzd,EAAUA,EAAS+lB,EAAUtI,IACrD,IACRA,GAAOzd,GAETyd,EAAMX,EAAQW,EAAM,EAAIsR,GAAStR,GAC1BX,EAAQW,GACbtd,EAAM2c,KAAWtc,EAEnB,OAAOL,CACT,CA2uIS+zB,CAAS/zB,EAAOK,EAAOsc,EAAOW,IAN5B,EAOX,EAsqSAnS,EAAO6oB,OA3vOP,SAASA,GAAOnyB,EAAYpB,GAE1B,OADW4K,EAAQxJ,GAAcnB,GAAcsU,IACnCnT,EAAY0Z,EAAY9a,EAAW,GACjD,EAyvOA0K,EAAO8oB,QAvqOP,SAASA,GAAQpyB,EAAY3B,GAC3B,OAAO+U,EAAY7Q,GAAIvC,EAAY3B,GAAW,EAChD,EAsqOAiL,EAAO+oB,YAhpOP,SAASA,GAAYryB,EAAY3B,GAC/B,OAAO+U,EAAY7Q,GAAIvC,EAAY3B,GAAWzJ,GAChD,EA+oOA0U,EAAOgpB,aAxnOP,SAASA,GAAatyB,EAAY3B,EAAUgV,GAC1CA,SAAQA,IAAU7iB,EAAY,EAAIuzB,EAAU1Q,GACrCD,EAAY7Q,GAAIvC,EAAY3B,GAAWgV,EAChD,EAsnOA/J,EAAO2b,QAAUA,GACjB3b,EAAOipB,YAviSP,SAASA,GAAYp0B,GAEnB,OADsB,MAATA,GAAoBA,EAAMH,OACvBoV,EAAYjV,EAAOvJ,IAAY,EACjD,EAqiSA0U,EAAOkpB,aA/gSP,SAASA,GAAar0B,EAAOkV,GAE3B,OADsB,MAATlV,GAAoBA,EAAMH,OAKhCoV,EAAYjV,EADnBkV,EAAQA,IAAU7iB,EAAY,EAAIuzB,EAAU1Q,IAFnC,EAIX,EAygSA/J,EAAOmpB,KAz9LP,SAASA,GAAK50B,GACZ,OAAOwmB,GAAWxmB,EA5wUD,IA6wUnB,EAw9LAyL,EAAOqmB,KAAOA,GACdrmB,EAAOsmB,UAAYA,GACnBtmB,EAAOopB,UA3/RP,SAASA,GAAUhgB,GAKjB,QAJInU,GAAQ,EACRP,EAAkB,MAAT0U,EAAgB,EAAIA,EAAM1U,OACnCe,EAAS,CAAC,IAELR,EAAQP,GAAQ,CACvB,IAAIgmB,EAAOtR,EAAMnU,GACjBQ,EAAOilB,EAAK,IAAMA,EAAK,EACzB,CACA,OAAOjlB,CACT,EAk/RAuK,EAAOqpB,UA38GP,SAASA,GAAUhyB,GACjB,OAAiB,MAAVA,EAAiB,GAAKgT,GAAchT,EAAQqE,EAAKrE,GAC1D,EA08GA2I,EAAOspB,YAj7GP,SAASA,GAAYjyB,GACnB,OAAiB,MAAVA,EAAiB,GAAKgT,GAAchT,EAAQiO,GAAOjO,GAC5D,EAg7GA2I,EAAO0f,QAAUA,GACjB1f,EAAOupB,QA56RP,SAASA,GAAQ10B,GAEf,OADsB,MAATA,GAAoBA,EAAMH,OACvBwd,GAAUrd,EAAO,GAAG,GAAM,EAC5C,EA06RAmL,EAAOge,aAAeA,GACtBhe,EAAOke,eAAiBA,GACxBle,EAAOme,iBAAmBA,GAC1Bne,EAAOokB,OAASA,GAChBpkB,EAAOqkB,SAAWA,GAClBrkB,EAAO2f,UAAYA,GACnB3f,EAAOjL,SAAWA,GAClBiL,EAAO4f,MAAQA,GACf5f,EAAOtE,KAAOA,EACdsE,EAAOsF,OAASA,GAChBtF,EAAO/G,IAAMA,GACb+G,EAAOwpB,QA1rGP,SAASA,GAAQnyB,EAAQtC,GACvB,IAAIU,EAAS,CAAC,EACdV,SAAWqb,EAAYrb,EAAU,GAEjCwU,GAAWlS,EAAQ,SAASnC,EAAOhL,EAAKmN,GACtC8L,GAAgB1N,EAAQV,EAASG,EAAOhL,EAAKmN,GAASnC,EACxD,GACOO,CACT,EAmrGAuK,EAAOypB,UArpGP,SAASA,GAAUpyB,EAAQtC,GACzB,IAAIU,EAAS,CAAC,EACdV,SAAWqb,EAAYrb,EAAU,GAEjCwU,GAAWlS,EAAQ,SAASnC,EAAOhL,EAAKmN,GACtC8L,GAAgB1N,EAAQvL,EAAK6K,EAASG,EAAOhL,EAAKmN,GACpD,GACO5B,CACT,EA8oGAuK,EAAO0pB,QAphCP,SAASA,GAAQ97B,GACf,OAAO8gB,GAAYrK,GAAUzW,EAxveX,GAyvepB,EAmhCAoS,EAAO2pB,gBAh/BP,SAASA,GAAgBnf,EAAM2D,GAC7B,OAAOM,GAAoBjE,EAAMnG,GAAU8J,EA7xezB,GA8xepB,EA++BAnO,EAAOqd,QAAUA,GACjBrd,EAAO0kB,MAAQA,GACf1kB,EAAOmkB,UAAYA,GACnBnkB,EAAOumB,OAASA,GAChBvmB,EAAOwmB,SAAWA,GAClBxmB,EAAOymB,MAAQA,GACfzmB,EAAO+hB,OAASA,GAChB/hB,EAAO4pB,OAzzBP,SAASA,GAAOlyB,GACdA,SAAI+iB,EAAU/iB,GACP6Z,EAAS,SAAS9c,GACvB,OAAOub,GAAQvb,EAAMiD,EACvB,EACF,EAqzBAsI,EAAO2kB,KAAOA,GACd3kB,EAAO6pB,OAnhGP,SAASA,GAAOxyB,EAAQ/B,GACtB,OAAOwvB,GAAOztB,EAAQ0qB,GAAO3R,EAAY9a,IAC3C,EAkhGA0K,EAAO8pB,KA73LP,SAASA,GAAKv1B,GACZ,OAAOwrB,GAAO,EAAGxrB,EACnB,EA43LAyL,EAAO+pB,QAr4NP,SAASA,GAAQrzB,EAAYwZ,EAAWC,EAAQiG,GAC9C,OAAkB,MAAd1f,EACK,IAEJwJ,EAAQgQ,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnChQ,EADLiQ,EAASiG,EAAQlvB,EAAYipB,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYvZ,EAAYwZ,EAAWC,GAC5C,EA03NAnQ,EAAO0mB,KAAOA,GACd1mB,EAAOgiB,SAAWA,GAClBhiB,EAAO2mB,UAAYA,GACnB3mB,EAAO4mB,SAAWA,GAClB5mB,EAAOmiB,QAAUA,GACjBniB,EAAOoiB,aAAeA,GACtBpiB,EAAO6f,UAAYA,GACnB7f,EAAOtF,KAAOA,GACdsF,EAAO8kB,OAASA,GAChB9kB,EAAO2O,SAAWA,GAClB3O,EAAOgqB,WA/rBP,SAASA,GAAW3yB,GAClB,OAAO,SAASmT,GACd,OAAiB,MAAVnT,EAAiBnQ,EAAYqjB,GAAQlT,EAAQmT,EACtD,CACF,EA4rBAxK,EAAOoe,KAAOA,GACdpe,EAAOqe,QAAUA,GACjBre,EAAOiqB,UApsRP,SAASA,GAAUp1B,EAAOoB,EAAQlB,GAChC,OAAQF,GAASA,EAAMH,QAAUuB,GAAUA,EAAOvB,OAC9Csc,GAAYnc,EAAOoB,EAAQma,EAAYrb,EAAU,IACjDF,CACN,EAisRAmL,EAAOkqB,YAxqRP,SAASA,GAAYr1B,EAAOoB,EAAQJ,GAClC,OAAQhB,GAASA,EAAMH,QAAUuB,GAAUA,EAAOvB,OAC9Csc,GAAYnc,EAAOoB,EAAQ/O,EAAW2O,GACtChB,CACN,EAqqRAmL,EAAOse,OAASA,GAChBte,EAAO8mB,MAAQA,GACf9mB,EAAO+mB,WAAaA,GACpB/mB,EAAOqiB,MAAQA,GACfriB,EAAOmqB,OAxvNP,SAASA,GAAOzzB,EAAYpB,GAE1B,OADW4K,EAAQxJ,GAAcnB,GAAcsU,IACnCnT,EAAYqrB,GAAO3R,EAAY9a,EAAW,IACxD,EAsvNA0K,EAAOoqB,OAzmRP,SAASA,GAAOv1B,EAAOS,GACrB,IAAIG,EAAS,GACb,IAAMZ,IAASA,EAAMH,OACnB,OAAOe,EAET,IAAIR,GAAQ,EACRkc,EAAU,GACVzc,EAASG,EAAMH,OAGnB,IADAY,EAAY8a,EAAY9a,EAAW,KAC1BL,EAAQP,GAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdK,EAAUJ,EAAOD,EAAOJ,KAC1BY,EAAOgN,KAAKvN,GACZic,EAAQ1O,KAAKxN,GAEjB,CACAic,UAAWrc,EAAOsc,GACX1b,CACT,EAulRAuK,EAAOqqB,KAluLP,SAASA,GAAK91B,EAAMid,GAClB,GAAmB,mBAARjd,EACT,MAAM,IAAIwG,GAAU5P,GAEtBqmB,OACOD,EAAShd,EADhBid,EAAQA,IAAUtqB,EAAYsqB,EAAQiJ,EAAUjJ,GAElD,EA6tLAxR,EAAOnB,QAAUA,GACjBmB,EAAOsqB,WAhtNP,SAASA,GAAW5zB,EAAYgB,EAAG0e,GAOjC,OALE1e,GADG0e,EAAQC,EAAe3f,EAAYgB,EAAG0e,GAAS1e,IAAMxQ,GACpD,EAEAuzB,EAAU/iB,IAELwI,EAAQxJ,GAAckM,GAAkBgP,IACvClb,EAAYgB,EAC1B,EAysNAsI,EAAOtG,IAv6FP,SAASA,GAAIrC,EAAQmT,EAAMtV,GACzB,OAAiB,MAAVmC,EAAiBA,EAAS0Z,GAAQ1Z,EAAQmT,EAAMtV,EACzD,EAs6FA8K,EAAOuqB,QA54FP,SAASA,GAAQlzB,EAAQmT,EAAMtV,EAAOqP,GACpCA,SAAkC,mBAAdA,EAA2BA,EAAard,EAC3C,MAAVmQ,EAAiBA,EAAS0Z,GAAQ1Z,EAAQmT,EAAMtV,EAAOqP,EAChE,EA04FAvE,EAAOwqB,QA1rNP,SAASA,GAAQ9zB,GAEf,OADWwJ,EAAQxJ,GAAcsM,GAAeiP,IACpCvb,EACd,EAwrNAsJ,EAAOnI,MAhjRP,SAASA,GAAMhD,EAAO2c,EAAOW,GAC3B,IAAIzd,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGDyd,GAAqB,iBAAPA,GAAmBkE,EAAexhB,EAAO2c,EAAOW,IAChEX,EAAQ,EACRW,EAAMzd,IAGN8c,EAAiB,MAATA,EAAgB,EAAIiJ,EAAUjJ,GACtCW,EAAMA,IAAQjrB,EAAYwN,EAAS+lB,EAAUtI,IAExCD,GAAUrd,EAAO2c,EAAOW,IAVtB,EAWX,EAmiRAnS,EAAO8f,OAASA,GAChB9f,EAAOyqB,WAx3QP,SAASA,GAAW51B,GAClB,OAAQA,GAASA,EAAMH,OACnB0e,GAAeve,GACf,EACN,EAq3QAmL,EAAO0qB,aAn2QP,SAASA,GAAa71B,EAAOE,GAC3B,OAAQF,GAASA,EAAMH,OACnB0e,GAAeve,EAAOub,EAAYrb,EAAU,IAC5C,EACN,EAg2QAiL,EAAO9F,MA5hEP,SAASA,GAAMtC,EAAQ+yB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBvU,EAAeze,EAAQ+yB,EAAWC,KACzED,EAAYC,EAAQ1jC,IAEtB0jC,EAAQA,IAAU1jC,EAAYsE,GAAmBo/B,IAAU,IAI3DhzB,EAASyD,EAASzD,MAEQ,iBAAb+yB,GACO,MAAbA,IAAsB12B,GAAS02B,OAEpCA,EAAYrX,GAAaqX,KACP7xB,GAAWlB,GACpB6c,GAAU3a,GAAclC,GAAS,EAAGgzB,GAGxChzB,EAAOsC,MAAMywB,EAAWC,GAZtB,EAaX,EA0gEA5qB,EAAO6qB,OAnsLP,SAASA,GAAOt2B,EAAMid,GACpB,GAAmB,mBAARjd,EACT,MAAM,IAAIwG,GAAU5P,GAEtBqmB,SAAiB,MAATA,EAAgB,EAAIpT,EAAUqc,EAAUjJ,GAAQ,GACjDD,EAAS,SAAS9c,GACvB,IAAII,EAAQJ,EAAK+c,GACbgL,EAAY/H,GAAUhgB,EAAM,EAAG+c,GAEnC,OAAI3c,GACFmB,GAAUwmB,EAAW3nB,GAEhBP,GAAMC,EAAM1O,KAAM22B,EAC3B,EACF,EAsrLAxc,EAAO8qB,KAl1QP,SAASA,GAAKj2B,GACZ,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASwd,GAAUrd,EAAO,EAAGH,GAAU,EAChD,EAg1QAsL,EAAO+qB,KArzQP,SAASA,GAAKl2B,EAAO6C,EAAG0e,GACtB,OAAMvhB,GAASA,EAAMH,OAIdwd,GAAUrd,EAAO,GADxB6C,EAAK0e,GAAS1e,IAAMxQ,EAAa,EAAIuzB,EAAU/iB,IAChB,EAAI,EAAIA,GAH9B,EAIX,EAgzQAsI,EAAOgrB,UArxQP,SAASA,GAAUn2B,EAAO6C,EAAG0e,GAC3B,IAAI1hB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,EAKEwd,GAAUrd,GADjB6C,EAAIhD,GADJgD,EAAK0e,GAAS1e,IAAMxQ,EAAa,EAAIuzB,EAAU/iB,KAEnB,EAAI,EAAIA,EAAGhD,GAJ9B,EAKX,EA8wQAsL,EAAOirB,eAzuQP,SAASA,GAAep2B,EAAOS,GAC7B,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAOub,EAAY9a,EAAW,IAAI,GAAO,GACnD,EACN,EAsuQA0K,EAAOkrB,UAjsQP,SAASA,GAAUr2B,EAAOS,GACxB,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAOub,EAAY9a,EAAW,IACxC,EACN,EA8rQA0K,EAAOmrB,IApuPP,SAASA,GAAIj2B,EAAOkqB,GAClBA,SAAYlqB,GACLA,CACT,EAkuPA8K,EAAOorB,SA9oLP,SAASA,GAAS72B,EAAMqS,EAAMwZ,GAC5B,IAAIO,GAAU,EACVlK,GAAW,EAEf,GAAmB,mBAARliB,EACT,MAAM,IAAIwG,GAAU5P,GAEtB,OAAIqV,EAAS4f,KACXO,EAAU,YAAaP,IAAYA,EAAQO,QAAUA,EACrDlK,EAAW,aAAc2J,IAAYA,EAAQ3J,SAAWA,GAEnD0J,GAAS5rB,EAAMqS,EAAM,CAC1B+Z,QAAWA,EACXJ,QAAW3Z,EACX6P,SAAYA,GAEhB,EA+nLAzW,EAAOuX,KAAOA,GACdvX,EAAOojB,QAAUA,GACjBpjB,EAAOglB,QAAUA,GACjBhlB,EAAOilB,UAAYA,GACnBjlB,EAAOqrB,OArfP,SAASA,GAAOn2B,GACd,OAAIgL,EAAQhL,GACHY,EAASZ,EAAOwV,IAElBd,GAAS1U,GAAS,CAACA,GAAS4N,GAAUyR,GAAalZ,EAASnG,IACrE,EAifA8K,EAAO+P,cAAgBA,GACvB/P,EAAO3G,UA10FP,SAASA,GAAUhC,EAAQtC,EAAUC,GACnC,IAAIkN,EAAQhC,EAAQ7I,GAChBi0B,EAAYppB,GAASnE,GAAS1G,IAAWhD,GAAagD,GAG1D,GADAtC,EAAWqb,EAAYrb,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAI0Q,EAAOrO,GAAUA,EAAO3R,YAE1BsP,EADEs2B,EACYppB,EAAQ,IAAIwD,EAAO,GAE1BlF,EAASnJ,IACFiT,GAAW5E,GAAQpF,GAAWlE,GAAa/E,IAG3C,CAAC,CAEnB,CACA,OAACi0B,EAAYn2B,GAAYoU,IAAYlS,EAAQ,SAASnC,EAAOD,EAAOoC,GAClE,OAAOtC,EAASC,EAAaE,EAAOD,EAAOoC,EAC7C,GACOrC,CACT,EAszFAgL,EAAOurB,MArnLP,SAASA,GAAMh3B,GACb,OAAO2jB,GAAI3jB,EAAM,EACnB,EAonLAyL,EAAOue,MAAQA,GACfve,EAAOwe,QAAUA,GACjBxe,EAAOye,UAAYA,GACnBze,EAAOwrB,KAzmQP,SAASA,GAAK32B,GACZ,OAAQA,GAASA,EAAMH,OAAU6e,GAAS1e,GAAS,EACrD,EAwmQAmL,EAAOyrB,OA/kQP,SAASA,GAAO52B,EAAOE,GACrB,OAAQF,GAASA,EAAMH,OAAU6e,GAAS1e,EAAOub,EAAYrb,EAAU,IAAM,EAC/E,EA8kQAiL,EAAO0rB,SAxjQP,SAASA,GAAS72B,EAAOgB,GACvBA,SAAkC,mBAAdA,EAA2BA,EAAa3O,EACpD2N,GAASA,EAAMH,OAAU6e,GAAS1e,EAAO3N,EAAW2O,GAAc,EAC5E,EAsjQAmK,EAAO2rB,MAhyFP,SAASA,GAAMt0B,EAAQmT,GACrB,OAAiB,MAAVnT,GAAwBga,GAAUha,EAAQmT,EACnD,EA+xFAxK,EAAO0e,MAAQA,GACf1e,EAAO4e,UAAYA,GACnB5e,EAAO4rB,OApwFP,SAASA,GAAOv0B,EAAQmT,EAAMmJ,GAC5B,OAAiB,MAAVtc,EAAiBA,EAASqc,GAAWrc,EAAQmT,EAAM8J,GAAaX,GACzE,EAmwFA3T,EAAO6rB,WAzuFP,SAASA,GAAWx0B,EAAQmT,EAAMmJ,EAASpP,GACzCA,SAAkC,mBAAdA,EAA2BA,EAAard,EAC3C,MAAVmQ,EAAiBA,EAASqc,GAAWrc,EAAQmT,EAAM8J,GAAaX,GAAUpP,EACnF,EAuuFAvE,EAAO/J,OAASA,GAChB+J,EAAO8rB,SAhrFP,SAASA,GAASz0B,GAChB,OAAiB,MAAVA,EAAiB,GAAKY,GAAWZ,EAAQiO,GAAOjO,GACzD,EA+qFA2I,EAAO6e,QAAUA,GACjB7e,EAAO4W,MAAQA,GACf5W,EAAO+rB,KA3mLP,SAASA,GAAK72B,EAAOsiB,GACnB,OAAO2K,GAAQ7N,GAAakD,GAAUtiB,EACxC,EA0mLA8K,EAAO8e,IAAMA,GACb9e,EAAO+e,MAAQA,GACf/e,EAAOgf,QAAUA,GACjBhf,EAAOif,IAAMA,GACbjf,EAAOgsB,UAj3PP,SAASA,GAAU9zB,EAAOjC,GACxB,OAAOie,GAAchc,GAAS,GAAIjC,GAAU,GAAImN,GAClD,EAg3PApD,EAAOisB,cA/1PP,SAASA,GAAc/zB,EAAOjC,GAC5B,OAAOie,GAAchc,GAAS,GAAIjC,GAAU,GAAI8a,GAClD,EA81PA/Q,EAAOkf,QAAUA,GAGjBlf,EAAOsB,QAAU0jB,GACjBhlB,EAAOksB,UAAYjH,GACnBjlB,EAAOmsB,OAASvI,GAChB5jB,EAAOosB,WAAavI,GAGpB4C,GAAMzmB,EAAQA,GAKdA,EAAO6B,IAAMA,GACb7B,EAAOkmB,QAAUA,GACjBlmB,EAAOklB,UAAYA,GACnBllB,EAAOqlB,WAAaA,GACpBrlB,EAAOvC,KAAOA,GACduC,EAAOqsB,MAprFP,SAASA,GAAMnoB,EAAQC,EAAOC,GAC5B,OAAIA,IAAUld,IACZkd,EAAQD,EACRA,EAAQjd,GAENkd,IAAUld,IAEZkd,GADAA,EAAQ6V,GAAS7V,KACCA,EAAQA,EAAQ,GAEhCD,IAAUjd,IAEZid,GADAA,EAAQ8V,GAAS9V,KACCA,EAAQA,EAAQ,GAE7BpB,GAAUkX,GAAS/V,GAASC,EAAOC,EAC5C,EAuqFApE,EAAOyd,MA7jLP,SAASA,GAAMvoB,GACb,OAAOmP,GAAUnP,EArzVI,EAszVvB,EA4jLA8K,EAAOssB,UApgLP,SAASA,GAAUp3B,GACjB,OAAOmP,GAAUnP,EAAO0vB,EAC1B,EAmgLA5kB,EAAOusB,cAr+KP,SAASA,GAAcr3B,EAAOqP,GAC5BA,OACOF,GAAUnP,EAAO0vB,EADxBrgB,EAAkC,mBAAdA,EAA2BA,EAAard,EAE9D,EAm+KA8Y,EAAOwsB,UA7hLP,SAASA,GAAUt3B,EAAOqP,GACxBA,OACOF,GAAUnP,EAz1VI,EAw1VrBqP,EAAkC,mBAAdA,EAA2BA,EAAard,EAE9D,EA2hLA8Y,EAAOysB,WA18KP,SAASA,GAAWp1B,EAAQzJ,GAC1B,OAAiB,MAAVA,GAAkB8Y,GAAerP,EAAQzJ,EAAQ8N,EAAK9N,GAC/D,EAy8KAoS,EAAO6W,OAASA,GAChB7W,EAAO0sB,UA1xCP,SAASA,GAAUx3B,EAAOokB,GACxB,OAAiB,MAATpkB,GAAiBA,GAAUA,EAASokB,EAAepkB,CAC7D,EAyxCA8K,EAAOknB,OAASA,GAChBlnB,EAAO2sB,SAz9EP,SAASA,GAAS/0B,EAAQg1B,EAAQC,GAChCj1B,EAASyD,EAASzD,GAClBg1B,EAAStZ,GAAasZ,GAEtB,IAAIl4B,EAASkD,EAAOlD,OAKhByd,EAJJ0a,EAAWA,IAAa3lC,EACpBwN,EACAqO,GAAU0X,EAAUoS,GAAW,EAAGn4B,GAGtCm4B,UAAYD,EAAOl4B,SACA,GAAKkD,EAAOC,MAAMg1B,EAAU1a,IAAQya,CACzD,EA88EA5sB,EAAOkD,GAAKA,GACZlD,EAAOqH,OAj7EP,SAASA,GAAOzP,GACdA,SAASyD,EAASzD,KACA/J,GAAmBkL,KAAKnB,GACtCA,EAAOG,QAAQtK,GAAiBkL,IAChCf,CACN,EA66EAoI,EAAO8sB,aA55EP,SAASA,GAAal1B,GACpBA,SAASyD,EAASzD,KACAvJ,GAAgB0K,KAAKnB,GACnCA,EAAOG,QAAQ3J,GAAc,QAC7BwJ,CACN,EAw5EAoI,EAAO+sB,MA57OP,SAASA,GAAMr2B,EAAYpB,EAAW8gB,GACpC,IAAI7hB,EAAO2L,EAAQxJ,GAAcrB,GAAaqU,GAC9C,OAAI0M,GAASC,EAAe3f,EAAYpB,EAAW8gB,KACjD9gB,EAAYpO,GAEPqN,EAAKmC,EAAY0Z,EAAY9a,EAAW,GACjD,EAu7OA0K,EAAOuf,KAAOA,GACdvf,EAAO6d,UAAYA,GACnB7d,EAAOgtB,QArxHP,SAASA,GAAQ31B,EAAQ/B,GACvB,OAAOmB,GAAYY,EAAQ+Y,EAAY9a,EAAW,GAAIiU,GACxD,EAoxHAvJ,EAAOwf,SAAWA,GAClBxf,EAAO8d,cAAgBA,GACvB9d,EAAOitB,YAjvHP,SAASA,GAAY51B,EAAQ/B,GAC3B,OAAOmB,GAAYY,EAAQ+Y,EAAY9a,EAAW,GAAImU,GACxD,EAgvHAzJ,EAAOrC,MAAQA,GACfqC,EAAO7G,QAAUA,GACjB6G,EAAOyf,aAAeA,GACtBzf,EAAOktB,MArtHP,SAASA,GAAM71B,EAAQtC,GACrB,OAAiB,MAAVsC,EACHA,EACA6S,GAAQ7S,EAAQ+Y,EAAYrb,EAAU,GAAIuQ,GAChD,EAktHAtF,EAAOmtB,WAtrHP,SAASA,GAAW91B,EAAQtC,GAC1B,OAAiB,MAAVsC,EACHA,EACA+S,GAAa/S,EAAQ+Y,EAAYrb,EAAU,GAAIuQ,GACrD,EAmrHAtF,EAAOotB,OArpHP,SAASA,GAAO/1B,EAAQtC,GACtB,OAAOsC,GAAUkS,GAAWlS,EAAQ+Y,EAAYrb,EAAU,GAC5D,EAopHAiL,EAAOqtB,YAxnHP,SAASA,GAAYh2B,EAAQtC,GAC3B,OAAOsC,GAAUoS,GAAgBpS,EAAQ+Y,EAAYrb,EAAU,GACjE,EAunHAiL,EAAOiE,IAAMA,GACbjE,EAAOsiB,GAAKA,GACZtiB,EAAOuiB,IAAMA,GACbviB,EAAO3H,IAzgHP,SAASA,GAAIhB,EAAQmT,GACnB,OAAiB,MAAVnT,GAAkB2kB,GAAQ3kB,EAAQmT,EAAMa,GACjD,EAwgHArL,EAAOqP,MAAQA,GACfrP,EAAO+d,KAAOA,GACd/d,EAAOwO,SAAWA,GAClBxO,EAAO8G,SA5pOP,SAASA,GAASpQ,EAAYxB,EAAO2B,EAAWuf,GAC9C1f,EAAasY,GAAYtY,GAAcA,EAAaT,GAAOS,GAC3DG,EAAaA,IAAcuf,EAASqE,EAAU5jB,GAAa,EAE3D,IAAInC,EAASgC,EAAWhC,OACxB,OAAImC,EAAY,IACdA,EAAYuH,EAAU1J,EAASmC,EAAW,IAErCmsB,GAAStsB,GACXG,GAAanC,GAAUgC,EAAWua,QAAQ/b,EAAO2B,IAAa,IAC5DnC,GAAUiB,GAAYe,EAAYxB,EAAO2B,IAAa,CAC/D,EAkpOAmJ,EAAOiR,QA9lSP,SAASA,GAAQpc,EAAOK,EAAO2B,GAC7B,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAO,EAET,IAAIO,EAAqB,MAAb4B,EAAoB,EAAI4jB,EAAU5jB,GAC9C,OAAI5B,EAAQ,IACVA,EAAQmJ,EAAU1J,EAASO,EAAO,IAE7BU,GAAYd,EAAOK,EAAOD,EACnC,EAqlSA+K,EAAOstB,QAlqFP,SAASA,GAAQppB,EAAQsN,EAAOW,GAC9BX,SAAQsI,GAAStI,GACbW,IAAQjrB,GACVirB,EAAMX,EACNA,EAAQ,GAERW,EAAM2H,GAAS3H,GArsVnB,SAASob,GAAYrpB,EAAQsN,EAAOW,GAClC,OAAOjO,GAAU5F,EAAUkT,EAAOW,IAAQjO,EAAS9F,EAAUoT,EAAOW,EACtE,CAssVSob,CADPrpB,EAAS+V,GAAS/V,GACSsN,EAAOW,EACpC,EAypFAnS,EAAOskB,OAASA,GAChBtkB,EAAOoC,YAAcA,GACrBpC,EAAOE,QAAUA,EACjBF,EAAOrM,cAAgBA,GACvBqM,EAAOgP,YAAcA,GACrBhP,EAAO6P,kBAAoBA,EAC3B7P,EAAOwtB,UAtwKP,SAASA,GAAUt4B,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB+K,EAAa/K,IAAU4V,EAAW5V,IAAUtJ,EACjD,EAowKAoU,EAAOjC,SAAWA,GAClBiC,EAAOnM,OAASA,GAChBmM,EAAOytB,UA7sKP,SAASA,GAAUv4B,GACjB,OAAO+K,EAAa/K,IAA6B,IAAnBA,EAAMlC,WAAmB8c,GAAc5a,EACvE,EA4sKA8K,EAAOtX,QAzqKP,SAASA,GAAQwM,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAI8Z,GAAY9Z,KACXgL,EAAQhL,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMuH,QAC1DsB,GAAS7I,IAAUb,GAAaa,IAAUkN,GAAYlN,IAC1D,OAAQA,EAAMR,OAEhB,IAAIoQ,EAAMC,EAAO7P,GACjB,GAAI4P,GAAO7Y,IAAU6Y,GAAOxY,GAC1B,OAAQ4I,EAAMgE,KAEhB,GAAI2V,GAAY3Z,GACd,OAAQ0Z,GAAS1Z,GAAOR,OAE1B,QAASxK,KAAOgL,EACd,GAAIoG,EAAe3G,KAAKO,EAAOhL,GAC7B,OAAO,EAGX,OAAO,CACT,EAopKA8V,EAAO0tB,QAtnKP,SAASA,GAAQx4B,EAAOkW,GACtB,OAAOe,GAAYjX,EAAOkW,EAC5B,EAqnKApL,EAAO2tB,YAnlKP,SAASA,GAAYz4B,EAAOkW,EAAO7G,GAEjC,IAAI9O,GADJ8O,EAAkC,mBAAdA,EAA2BA,EAAard,GAClCqd,EAAWrP,EAAOkW,GAASlkB,EACrD,OAAOuO,IAAWvO,EAAYilB,GAAYjX,EAAOkW,EAAOlkB,EAAWqd,KAAgB9O,CACrF,EAglKAuK,EAAO0iB,QAAUA,GACjB1iB,EAAO/B,SA1hKP,SAASA,GAAS/I,GAChB,MAAuB,iBAATA,GAAqB8I,GAAe9I,EACpD,EAyhKA8K,EAAOsK,WAAaA,GACpBtK,EAAO2iB,UAAYA,GACnB3iB,EAAOkc,SAAWA,GAClBlc,EAAOjM,MAAQA,GACfiM,EAAO4tB,QA11JP,SAASA,GAAQv2B,EAAQzJ,GACvB,OAAOyJ,IAAWzJ,GAAUogB,GAAY3W,EAAQzJ,EAAQqhB,GAAarhB,GACvE,EAy1JAoS,EAAO6tB,YAvzJP,SAASA,GAAYx2B,EAAQzJ,EAAQ2W,GACnCA,SAAkC,mBAAdA,EAA2BA,EAAard,EACrD8mB,GAAY3W,EAAQzJ,EAAQqhB,GAAarhB,GAAS2W,EAC3D,EAqzJAvE,EAAO8tB,MAvxJP,SAASA,GAAM54B,GAIb,OAAO2tB,GAAS3tB,IAAUA,IAAUA,CACtC,EAmxJA8K,EAAO+tB,SAvvJP,SAASA,GAAS74B,GAChB,GAAIonB,GAAWpnB,GACb,MAAM,IAAI0F,EAtsXM,mEAwsXlB,OAAOyT,GAAanZ,EACtB,EAmvJA8K,EAAOguB,MAxsJP,SAASA,GAAM94B,GACb,OAAgB,MAATA,CACT,EAusJA8K,EAAOiuB,OAjuJP,SAASA,GAAO/4B,GACd,OAAiB,OAAVA,CACT,EAguJA8K,EAAO6iB,SAAWA,GAClB7iB,EAAOQ,SAAWA,EAClBR,EAAOC,aAAeA,EACtBD,EAAO8P,cAAgBA,GACvB9P,EAAO/L,SAAWA,GAClB+L,EAAOkuB,cArlJP,SAASA,GAAch5B,GACrB,OAAOytB,GAAUztB,IAAUA,IAAU3J,IAAoB2J,GAAS3J,EACpE,EAolJAyU,EAAO7L,MAAQA,GACf6L,EAAOgjB,SAAWA,GAClBhjB,EAAO4J,SAAWA,GAClB5J,EAAO3L,aAAeA,GACtB2L,EAAOmuB,YAn/IP,SAASA,GAAYj5B,GACnB,OAAOA,IAAUhO,CACnB,EAk/IA8Y,EAAOouB,UA/9IP,SAASA,GAAUl5B,GACjB,OAAO+K,EAAa/K,IAAU6P,EAAO7P,IAAUzI,EACjD,EA89IAuT,EAAOquB,UA38IP,SAASA,GAAUn5B,GACjB,OAAO+K,EAAa/K,IAn6XP,oBAm6XiB4V,EAAW5V,EAC3C,EA08IA8K,EAAO3O,KAz/RP,SAASA,GAAKwD,EAAO81B,GACnB,OAAgB,MAAT91B,EAAgB,GAAKqJ,GAAWvJ,KAAKE,EAAO81B,EACrD,EAw/RA3qB,EAAOulB,UAAYA,GACnBvlB,EAAOiM,KAAOA,GACdjM,EAAOsuB,YAh9RP,SAASA,GAAYz5B,EAAOK,EAAO2B,GACjC,IAAInC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAO,EAET,IAAIO,EAAQP,EACZ,OAAImC,IAAc3P,IAEhB+N,GADAA,EAAQwlB,EAAU5jB,IACF,EAAIuH,EAAU1J,EAASO,EAAO,GAAKqJ,EAAUrJ,EAAOP,EAAS,IAExEQ,GAAUA,EArvMrB,SAASq5B,GAAkB15B,EAAOK,EAAO2B,GAEvC,QADI5B,EAAQ4B,EAAY,EACjB5B,KACL,GAAIJ,EAAMI,KAAWC,EACnB,OAAOD,EAGX,OAAOA,CACT,CA8uMQs5B,CAAkB15B,EAAOK,EAAOD,GAChC2B,GAAc/B,EAAOmC,GAAW/B,GAAO,EAC7C,EAo8RA+K,EAAOwlB,UAAYA,GACnBxlB,EAAOylB,WAAaA,GACpBzlB,EAAOkjB,GAAKA,GACZljB,EAAOmjB,IAAMA,GACbnjB,EAAO3B,IAhfP,SAASA,GAAIxJ,GACX,OAAQA,GAASA,EAAMH,OACnBiV,GAAa9U,EAAO2Z,GAAUrD,IAC9BjkB,CACN,EA6eA8Y,EAAOwuB,MApdP,SAASA,GAAM35B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnBiV,GAAa9U,EAAOub,EAAYrb,EAAU,GAAIoW,IAC9CjkB,CACN,EAidA8Y,EAAOyuB,KAjcP,SAASA,GAAK55B,GACZ,OAAOqC,GAASrC,EAAO2Z,GACzB,EAgcAxO,EAAO0uB,OAvaP,SAASA,GAAO75B,EAAOE,GACrB,OAAOmC,GAASrC,EAAOub,EAAYrb,EAAU,GAC/C,EAsaAiL,EAAOzB,IAlZP,SAASA,GAAI1J,GACX,OAAQA,GAASA,EAAMH,OACnBiV,GAAa9U,EAAO2Z,GAAUM,IAC9B5nB,CACN,EA+YA8Y,EAAO2uB,MAtXP,SAASA,GAAM95B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnBiV,GAAa9U,EAAOub,EAAYrb,EAAU,GAAI+Z,IAC9C5nB,CACN,EAmXA8Y,EAAO+b,UAAYA,GACnB/b,EAAOuc,UAAYA,GACnBvc,EAAO4uB,WAztBP,SAASA,KACP,MAAO,CAAC,CACV,EAwtBA5uB,EAAO6uB,WAzsBP,SAASA,KACP,MAAO,EACT,EAwsBA7uB,EAAO8uB,SAzrBP,SAASA,KACP,OAAO,CACT,EAwrBA9uB,EAAOqnB,SAAWA,GAClBrnB,EAAO+uB,IA77RP,SAASA,GAAIl6B,EAAO6C,GAClB,OAAQ7C,GAASA,EAAMH,OAAUsb,GAAQnb,EAAO4lB,EAAU/iB,IAAMxQ,CAClE,EA47RA8Y,EAAOgvB,WAliCP,SAASA,KACP,OAAIp8B,EAAKyH,IAAMxU,OACb+M,EAAKyH,EAAIyB,IAEJjW,IACT,EA8hCAma,EAAO2a,KAAOA,GACd3a,EAAO3C,IAAMA,GACb2C,EAAOivB,IAj5EP,SAASA,GAAIr3B,EAAQlD,EAAQglB,GAC3B9hB,EAASyD,EAASzD,GAGlB,IAAIs3B,GAFJx6B,EAAS+lB,EAAU/lB,IAEMiF,GAAW/B,GAAU,EAC9C,IAAKlD,GAAUw6B,GAAax6B,EAC1B,OAAOkD,EAET,IAAI6a,GAAO/d,EAASw6B,GAAa,EACjC,OACEzV,GAAc/b,GAAY+U,GAAMiH,GAChC9hB,EACA6hB,GAAcjc,GAAWiV,GAAMiH,EAEnC,EAo4EA1Z,EAAOmvB,OA32EP,SAASA,GAAOv3B,EAAQlD,EAAQglB,GAC9B9hB,EAASyD,EAASzD,GAGlB,IAAIs3B,GAFJx6B,EAAS+lB,EAAU/lB,IAEMiF,GAAW/B,GAAU,EAC9C,OAAQlD,GAAUw6B,EAAYx6B,EACzBkD,EAAS6hB,GAAc/kB,EAASw6B,EAAWxV,GAC5C9hB,CACN,EAo2EAoI,EAAOovB,SA30EP,SAASA,GAASx3B,EAAQlD,EAAQglB,GAChC9hB,EAASyD,EAASzD,GAGlB,IAAIs3B,GAFJx6B,EAAS+lB,EAAU/lB,IAEMiF,GAAW/B,GAAU,EAC9C,OAAQlD,GAAUw6B,EAAYx6B,EACzB+kB,GAAc/kB,EAASw6B,EAAWxV,GAAS9hB,EAC5CA,CACN,EAo0EAoI,EAAO1N,SA1yEP,SAASA,GAASsF,EAAQy3B,EAAOjZ,GAC/B,OAAIA,GAAkB,MAATiZ,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ5wB,GAAepD,EAASzD,GAAQG,QAAQzJ,GAAa,IAAK+gC,GAAS,EAC5E,EAoyEArvB,EAAOrB,OA1rFP,SAASA,GAAOwF,EAAOC,EAAOkrB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBjZ,EAAelS,EAAOC,EAAOkrB,KAC3ElrB,EAAQkrB,EAAWpoC,GAEjBooC,IAAapoC,IACK,kBAATkd,GACTkrB,EAAWlrB,EACXA,EAAQld,GAEe,kBAATid,IACdmrB,EAAWnrB,EACXA,EAAQjd,IAGRid,IAAUjd,GAAakd,IAAUld,GACnCid,EAAQ,EACRC,EAAQ,IAGRD,EAAQ2V,GAAS3V,GACbC,IAAUld,GACZkd,EAAQD,EACRA,EAAQ,GAERC,EAAQ0V,GAAS1V,IAGjBD,EAAQC,EAAO,CACjB,IAAImrB,EAAOprB,EACXA,EAAQC,EACRA,EAAQmrB,CACV,CACA,GAAID,GAAYnrB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI+Y,EAAOze,KACX,OAAOJ,EAAU6F,EAASgZ,GAAQ/Y,EAAQD,EAAQhS,GAAe,QAAUgrB,EAAO,IAAIzoB,OAAS,KAAO0P,EACxG,CACA,OAAOzB,GAAWwB,EAAOC,EAC3B,EAspFApE,EAAOwvB,OA5+NP,SAASA,GAAO94B,EAAY3B,EAAUC,GACpC,IAAIT,EAAO2L,EAAQxJ,GAAcP,GAAcoB,GAC3CnB,EAAY2gB,UAAUriB,OAAS,EAEnC,OAAOH,EAAKmC,EAAY0Z,EAAYrb,EAAU,GAAIC,EAAaoB,EAAWoN,GAC5E,EAw+NAxD,EAAOyvB,YAh9NP,SAASA,GAAY/4B,EAAY3B,EAAUC,GACzC,IAAIT,EAAO2L,EAAQxJ,GAAcL,GAAmBkB,GAChDnB,EAAY2gB,UAAUriB,OAAS,EAEnC,OAAOH,EAAKmC,EAAY0Z,EAAYrb,EAAU,GAAIC,EAAaoB,EAAWoT,GAC5E,EA48NAxJ,EAAO0vB,OA/wEP,SAASA,GAAO93B,EAAQF,EAAG0e,GACzB,OACE1e,GADG0e,EAAQC,EAAeze,EAAQF,EAAG0e,GAAS1e,IAAMxQ,GAChD,EAEAuzB,EAAU/iB,GAET4Z,GAAWjW,EAASzD,GAASF,EACtC,EAywEAsI,EAAOjI,QApvEP,SAASA,KACP,IAAItD,EAAOsiB,UACPnf,EAASyD,EAAS5G,EAAK,IAE3B,OAAOA,EAAKC,OAAS,EAAIkD,EAASA,EAAOG,QAAQtD,EAAK,GAAIA,EAAK,GACjE,EAgvEAuL,EAAOvK,OAtoGP,SAASA,GAAO4B,EAAQmT,EAAM8O,GAG5B,IAAIrkB,GAAQ,EACRP,GAHJ8V,EAAOC,GAASD,EAAMnT,IAGJ3C,OAOlB,IAJKA,IACHA,EAAS,EACT2C,EAASnQ,KAEF+N,EAAQP,GAAQ,CACvB,IAAIQ,EAAkB,MAAVmC,EAAiBnQ,EAAYmQ,EAAOqT,GAAMF,EAAKvV,KACvDC,IAAUhO,IACZ+N,EAAQP,EACRQ,EAAQokB,GAEVjiB,EAASiT,GAAWpV,GAASA,EAAMP,KAAK0C,GAAUnC,CACpD,CACA,OAAOmC,CACT,EAmnGA2I,EAAOwnB,MAAQA,GACfxnB,EAAO1F,aAAeA,EACtB0F,EAAO2vB,OA15NP,SAASA,GAAOj5B,GAEd,OADWwJ,EAAQxJ,GAAcgM,GAAciP,IACnCjb,EACd,EAw5NAsJ,EAAO9G,KA/0NP,SAASA,GAAKxC,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIsY,GAAYtY,GACd,OAAOssB,GAAStsB,GAAciD,GAAWjD,GAAcA,EAAWhC,OAEpE,IAAIoQ,EAAMC,EAAOrO,GACjB,OAAIoO,GAAO7Y,IAAU6Y,GAAOxY,GACnBoK,EAAWwC,KAEb0V,GAASlY,GAAYhC,MAC9B,EAo0NAsL,EAAO0lB,UAAYA,GACnB1lB,EAAO4vB,KA/xNP,SAASA,GAAKl5B,EAAYpB,EAAW8gB,GACnC,IAAI7hB,EAAO2L,EAAQxJ,GAAcJ,GAAY8b,GAC7C,OAAIgE,GAASC,EAAe3f,EAAYpB,EAAW8gB,KACjD9gB,EAAYpO,GAEPqN,EAAKmC,EAAY0Z,EAAY9a,EAAW,GACjD,EA0xNA0K,EAAO6vB,YAhsRP,SAASA,GAAYh7B,EAAOK,GAC1B,OAAOmd,GAAgBxd,EAAOK,EAChC,EA+rRA8K,EAAO8vB,cApqRP,SAASA,GAAcj7B,EAAOK,EAAOH,GACnC,OAAO2d,GAAkB7d,EAAOK,EAAOkb,EAAYrb,EAAU,GAC/D,EAmqRAiL,EAAO+vB,cAjpRP,SAASA,GAAcl7B,EAAOK,GAC5B,IAAIR,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,GAAIA,EAAQ,CACV,IAAIO,EAAQod,GAAgBxd,EAAOK,GACnC,GAAID,EAAQP,GAAUwO,GAAGrO,EAAMI,GAAQC,GACrC,OAAOD,CAEX,CACA,OAAO,CACT,EAyoRA+K,EAAOgwB,gBArnRP,SAASA,GAAgBn7B,EAAOK,GAC9B,OAAOmd,GAAgBxd,EAAOK,GAAO,EACvC,EAonRA8K,EAAOiwB,kBAzlRP,SAASA,GAAkBp7B,EAAOK,EAAOH,GACvC,OAAO2d,GAAkB7d,EAAOK,EAAOkb,EAAYrb,EAAU,IAAI,EACnE,EAwlRAiL,EAAOkwB,kBAtkRP,SAASA,GAAkBr7B,EAAOK,GAEhC,GADsB,MAATL,GAAoBA,EAAMH,OAC3B,CACV,IAAIO,EAAQod,GAAgBxd,EAAOK,GAAO,GAAQ,EAClD,GAAIgO,GAAGrO,EAAMI,GAAQC,GACnB,OAAOD,CAEX,CACA,OAAO,CACT,EA8jRA+K,EAAO2lB,UAAYA,GACnB3lB,EAAOmwB,WA3oEP,SAASA,GAAWv4B,EAAQg1B,EAAQC,GAClCj1B,SAASyD,EAASzD,GAClBi1B,EAAuB,MAAZA,EACP,EACA9pB,GAAU0X,EAAUoS,GAAW,EAAGj1B,EAAOlD,QAE7Ck4B,EAAStZ,GAAasZ,GACfh1B,EAAOC,MAAMg1B,EAAUA,EAAWD,EAAOl4B,SAAWk4B,CAC7D,EAooEA5sB,EAAOynB,SAAWA,GAClBznB,EAAOowB,IAzUP,SAASA,GAAIv7B,GACX,OAAQA,GAASA,EAAMH,OACnByC,GAAQtC,EAAO2Z,IACf,CACN,EAsUAxO,EAAOqwB,MA7SP,SAASA,GAAMx7B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnByC,GAAQtC,EAAOub,EAAYrb,EAAU,IACrC,CACN,EA0SAiL,EAAOswB,SA7hEP,SAASA,GAAS14B,EAAQwoB,EAAShK,GAIjC,IAAIma,EAAWvwB,EAAOoH,iBAElBgP,GAASC,EAAeze,EAAQwoB,EAAShK,KAC3CgK,EAAUl5B,GAEZ0Q,EAASyD,EAASzD,GAClBwoB,EAAUyD,GAAa,CAAC,EAAGzD,EAASmQ,EAAUjV,IAE9C,IAIIkV,EACAC,EALAhpB,EAAUoc,GAAa,CAAC,EAAGzD,EAAQ3Y,QAAS8oB,EAAS9oB,QAAS6T,IAC9DoV,EAAch1B,EAAK+L,GACnBkpB,EAAgB14B,GAAWwP,EAASipB,GAIpCz7B,EAAQ,EACRsS,EAAc6Y,EAAQ7Y,aAAejY,GACrC1B,EAAS,WAGTgjC,EAAejjC,IAChByyB,EAAQ/Y,QAAU/X,IAAW1B,OAAS,IACvC2Z,EAAY3Z,OAAS,KACpB2Z,IAAgBvZ,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEwyB,EAAQ9Y,UAAYhY,IAAW1B,OAAS,KACzC,KAMEijC,EAAY,kBACbv1B,EAAe3G,KAAKyrB,EAAS,cACzBA,EAAQyQ,UAAY,IAAI94B,QAAQ,MAAO,KACvC,6BAA+BhG,GAAmB,KACnD,KAEN6F,EAAOG,QAAQ64B,EAAc,SAAS52B,EAAO82B,EAAaC,EAAkBC,GAAiBC,EAAe/6B,IAC1G66B,WAAqBA,EAAmBC,IAGxCpjC,GAAUgK,EAAOC,MAAM5C,EAAOiB,IAAQ6B,QAAQxI,GAAmBqJ,IAG7Dk4B,IACFN,GAAa,EACb5iC,GAAU,YAAckjC,EAAc,UAEpCG,IACFR,GAAe,EACf7iC,GAAU,OAASqjC,EAAgB,eAEjCF,IACFnjC,GAAU,iBAAmBmjC,EAAmB,+BAElD97B,EAAQiB,GAAS8D,EAAMtF,OAIhBsF,CACT,GAEApM,GAAU,OAIV,IAAI4Z,EAAWlM,EAAe3G,KAAKyrB,EAAS,aAAeA,EAAQ5Y,SACnE,GAAKA,GACkC,GAI9B5Y,GAA2BmK,KAAKyO,GACvC,MAAM,IAAI5M,EA3idmB,2DAsid7BhN,EAAS,iBAAmBA,EAAS,QASvCA,GAAU6iC,EAAe7iC,EAAOmK,QAAQ1K,GAAsB,IAAMO,GACjEmK,QAAQzK,GAAqB,MAC7ByK,QAAQxK,GAAuB,OAGlCK,EAAS,aAAe4Z,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCgpB,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ7iC,EACA,gBAEF,IAAI6H,EAASywB,GAAQ,WACnB,OAAOrzB,EAAS69B,EAAaG,EAAY,UAAYjjC,GAClD0G,MAAMpN,EAAWypC,EACtB,GAKA,GADAl7B,EAAO7H,OAASA,EACZ80B,GAAQjtB,GACV,MAAMA,EAER,OAAOA,CACT,EA26DAuK,EAAOkxB,MApsBP,SAASA,GAAMx5B,EAAG3C,GAEhB,IADA2C,EAAI+iB,EAAU/iB,IACN,GAAKA,EAAInM,GACf,MAAO,GAET,IAAI0J,EAAQzJ,GACRkJ,EAAS4J,EAAU5G,EAAGlM,IAE1BuJ,EAAWqb,EAAYrb,GACvB2C,GAAKlM,GAGL,QADIiK,EAASgC,GAAU/C,EAAQK,KACtBE,EAAQyC,GACf3C,EAASE,GAEX,OAAOQ,CACT,EAqrBAuK,EAAO8Z,SAAWA,GAClB9Z,EAAOya,UAAYA,EACnBza,EAAOyjB,SAAWA,GAClBzjB,EAAOmxB,QAx5DP,SAASA,GAAQj8B,GACf,OAAOmG,EAASnG,GAAOkwB,aACzB,EAu5DAplB,EAAOia,SAAWA,GAClBja,EAAOoxB,cApuIP,SAASA,GAAcl8B,GACrB,OAAOA,EACH6N,GAAU0X,EAAUvlB,IAAS3J,GAAkBA,IACpC,IAAV2J,EAAcA,EAAQ,CAC7B,EAiuIA8K,EAAO3E,SAAWA,EAClB2E,EAAOqxB,QAn4DP,SAASA,GAAQn8B,GACf,OAAOmG,EAASnG,GAAO2wB,aACzB,EAk4DA7lB,EAAOsxB,KA12DP,SAASA,GAAK15B,EAAQ8hB,EAAOtD,GAE3B,IADAxe,EAASyD,EAASzD,MACHwe,GAASsD,IAAUxyB,GAChC,OAAOyQ,GAASC,GAElB,IAAKA,KAAY8hB,EAAQpG,GAAaoG,IACpC,OAAO9hB,EAET,IAAIW,EAAauB,GAAclC,GAC3BY,EAAasB,GAAc4f,GAI/B,OAAOjF,GAAUlc,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETnH,KAAK,GAChD,EA61DA2O,EAAOuxB,QAx0DP,SAASA,GAAQ35B,EAAQ8hB,EAAOtD,GAE9B,IADAxe,EAASyD,EAASzD,MACHwe,GAASsD,IAAUxyB,GAChC,OAAO0Q,EAAOC,MAAM,EAAGC,GAAgBF,GAAU,GAEnD,IAAKA,KAAY8hB,EAAQpG,GAAaoG,IACpC,OAAO9hB,EAET,IAAIW,EAAauB,GAAclC,GAG/B,OAAO6c,GAAUlc,EAAY,EAFnBE,GAAcF,EAAYuB,GAAc4f,IAAU,GAEvBroB,KAAK,GAC5C,EA6zDA2O,EAAOwxB,UAxyDP,SAASA,GAAU55B,EAAQ8hB,EAAOtD,GAEhC,IADAxe,EAASyD,EAASzD,MACHwe,GAASsD,IAAUxyB,GAChC,OAAO0Q,EAAOG,QAAQzJ,GAAa,IAErC,IAAKsJ,KAAY8hB,EAAQpG,GAAaoG,IACpC,OAAO9hB,EAET,IAAIW,EAAauB,GAAclC,GAG/B,OAAO6c,GAAUlc,EAFLD,GAAgBC,EAAYuB,GAAc4f,KAElBroB,KAAK,GAC3C,EA6xDA2O,EAAOyxB,SAtvDP,SAASA,GAAS75B,EAAQwoB,GACxB,IAAI1rB,EAnvdmB,GAovdnBg9B,EAnvdqB,MAqvdzB,GAAIlxB,EAAS4f,GAAU,CACrB,IAAIuK,EAAY,cAAevK,EAAUA,EAAQuK,UAAYA,EAC7Dj2B,EAAS,WAAY0rB,EAAU3F,EAAU2F,EAAQ1rB,QAAUA,EAC3Dg9B,EAAW,aAActR,EAAU9M,GAAa8M,EAAQsR,UAAYA,CACtE,CAGA,IAAIxC,GAFJt3B,EAASyD,EAASzD,IAEKlD,OACvB,GAAIoE,GAAWlB,GAAS,CACtB,IAAIW,EAAauB,GAAclC,GAC/Bs3B,EAAY32B,EAAW7D,MACzB,CACA,GAAIA,GAAUw6B,EACZ,OAAOt3B,EAET,IAAIua,EAAMzd,EAASiF,GAAW+3B,GAC9B,GAAIvf,EAAM,EACR,OAAOuf,EAET,IAAIj8B,EAAS8C,EACTkc,GAAUlc,EAAY,EAAG4Z,GAAK9gB,KAAK,IACnCuG,EAAOC,MAAM,EAAGsa,GAEpB,GAAIwY,IAAczjC,EAChB,OAAOuO,EAASi8B,EAKlB,GAHIn5B,IACF4Z,GAAQ1c,EAAOf,OAASyd,GAEtBle,GAAS02B,IACX,GAAI/yB,EAAOC,MAAMsa,GAAKwf,OAAOhH,GAAY,CACvC,IAAI3wB,EACA43B,EAAYn8B,EAMhB,IAJKk1B,EAAUn4B,SACbm4B,EAAYh9B,GAAOg9B,EAAU/8B,OAAQyN,EAAStM,GAAQ0M,KAAKkvB,IAAc,MAE3EA,EAAU9wB,UAAY,EACdG,EAAQ2wB,EAAUlvB,KAAKm2B,IAC7B,IAAIC,EAAS73B,EAAM/E,MAErBQ,EAASA,EAAOoC,MAAM,EAAGg6B,IAAW3qC,EAAYirB,EAAM0f,EACxD,UACSj6B,EAAOqZ,QAAQqC,GAAaqX,GAAYxY,IAAQA,EAAK,CAC9D,IAAIld,EAAQQ,EAAO64B,YAAY3D,GAC3B11B,GAAQ,IACVQ,EAASA,EAAOoC,MAAM,EAAG5C,GAE7B,CACA,OAAOQ,EAASi8B,CAClB,EAisDA1xB,EAAO8xB,SA5qDP,SAASA,GAASl6B,GAChBA,SAASyD,EAASzD,KACAlK,GAAiBqL,KAAKnB,GACpCA,EAAOG,QAAQvK,GAAe4M,IAC9BxC,CACN,EAwqDAoI,EAAO+xB,SAvpBP,SAASA,GAASC,GAChB,IAAItnC,IAAO6Q,GACX,OAAOF,EAAS22B,GAAUtnC,CAC5B,EAqpBAsV,EAAO4lB,UAAYA,GACnB5lB,EAAOslB,WAAaA,GAGpBtlB,EAAOiyB,KAAO94B,GACd6G,EAAOkyB,UAAYzS,GACnBzf,EAAOmyB,MAAQpU,GAEf0I,GAAMzmB,EAAS,WACb,IAAIpS,EAAS,CAAC,EACd2b,UAAWvJ,EAAQ,SAASzL,EAAMiiB,GAC3Blb,EAAe3G,KAAKqL,EAAO/E,UAAWub,KACzC5oB,EAAO4oB,GAAcjiB,EAEzB,GACO3G,CACT,CARe,GAQT,CAAEuxB,OAAS,IAWjBnf,EAAOoyB,QA/ihBK,UAkjhBZj9B,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,gBAAiB,SAASqhB,GACxFxW,EAAOwW,GAAYhd,YAAcwG,CACnC,GAGA7K,GAAU,CAAC,OAAQ,QAAS,SAASqhB,EAAYvhB,GAC/CkL,EAAYlF,UAAUub,GAAc,SAAS9e,GAC3CA,EAAIA,IAAMxQ,EAAY,EAAIkX,EAAUqc,EAAU/iB,GAAI,GAElD,IAAIjC,EAAU5P,KAAKob,eAAiBhM,EAChC,IAAIkL,EAAYta,MAChBA,KAAK43B,QAET,OAAIhoB,EAAOwL,aACTxL,EAAO0L,cAAgB7C,EAAU5G,EAAGjC,EAAO0L,eAE3C1L,EAAO2L,UAAUqB,KAAK,CACpBvJ,KAAQoF,EAAU5G,EAAGlM,IACrBpC,KAAQotB,GAAc/gB,EAAOuL,QAAU,EAAI,QAAU,MAGlDvL,CACT,EAEA0K,EAAYlF,UAAUub,EAAa,SAAW,SAAS9e,GACrD,OAAO7R,KAAKgZ,UAAU2X,GAAY9e,GAAGmH,SACvC,CACF,GAGA1J,GAAU,CAAC,SAAU,MAAO,aAAc,SAASqhB,EAAYvhB,GAC7D,IAAI7L,EAAO6L,EAAQ,EACfo9B,EAjihBe,GAiihBJjpC,GA/hhBG,GA+hhByBA,EAE3C+W,EAAYlF,UAAUub,GAAc,SAASzhB,GAC3C,IAAIU,EAAS5P,KAAK43B,QAClBhoB,SAAOyL,cAAcuB,KAAK,CACxB1N,SAAYqb,EAAYrb,EAAU,GAClC3L,KAAQA,IAEVqM,EAAOwL,aAAexL,EAAOwL,cAAgBoxB,EACtC58B,CACT,CACF,GAGAN,GAAU,CAAC,OAAQ,QAAS,SAASqhB,EAAYvhB,GAC/C,IAAIq9B,EAAW,QAAUr9B,EAAQ,QAAU,IAE3CkL,EAAYlF,UAAUub,GAAc,WAClC,OAAO3wB,KAAKysC,GAAU,GAAGp9B,QAAQ,EACnC,CACF,GAGAC,GAAU,CAAC,UAAW,QAAS,SAASqhB,EAAYvhB,GAClD,IAAIs9B,EAAW,QAAUt9B,EAAQ,GAAK,SAEtCkL,EAAYlF,UAAUub,GAAc,WAClC,OAAO3wB,KAAKob,aAAe,IAAId,EAAYta,MAAQA,KAAK0sC,GAAU,EACpE,CACF,GAEApyB,EAAYlF,UAAU8sB,QAAU,WAC9B,OAAOliC,KAAKgjC,OAAOra,GACrB,EAEArO,EAAYlF,UAAUskB,KAAO,SAASjqB,GACpC,OAAOzP,KAAKgjC,OAAOvzB,GAAWyoB,MAChC,EAEA5d,EAAYlF,UAAUukB,SAAW,SAASlqB,GACxC,OAAOzP,KAAKgZ,UAAU0gB,KAAKjqB,EAC7B,EAEA6K,EAAYlF,UAAU0kB,UAAYpO,EAAS,SAAS/G,EAAM/V,GACxD,MAAmB,mBAAR+V,EACF,IAAIrK,EAAYta,MAElBA,KAAKoT,IAAI,SAAS/D,GACvB,OAAO6W,GAAW7W,EAAOsV,EAAM/V,EACjC,EACF,GAEA0L,EAAYlF,UAAUkvB,OAAS,SAAS70B,GACtC,OAAOzP,KAAKgjC,OAAO9G,GAAO3R,EAAY9a,IACxC,EAEA6K,EAAYlF,UAAUpD,MAAQ,SAAS2Z,EAAOW,GAC5CX,EAAQiJ,EAAUjJ,GAElB,IAAI/b,EAAS5P,KACb,OAAI4P,EAAOwL,eAAiBuQ,EAAQ,GAAKW,EAAM,GACtC,IAAIhS,EAAY1K,IAErB+b,EAAQ,EACV/b,EAASA,EAAOu1B,WAAWxZ,GAClBA,IACT/b,EAASA,EAAO8yB,KAAK/W,IAEnBW,IAAQjrB,IAEVuO,GADA0c,EAAMsI,EAAUtI,IACD,EAAI1c,EAAO+yB,WAAWrW,GAAO1c,EAAOs1B,KAAK5Y,EAAMX,IAEzD/b,EACT,EAEA0K,EAAYlF,UAAUgwB,eAAiB,SAAS31B,GAC9C,OAAOzP,KAAKgZ,UAAUqsB,UAAU51B,GAAWuJ,SAC7C,EAEAsB,EAAYlF,UAAUmoB,QAAU,WAC9B,OAAOv9B,KAAKklC,KAAKv/B,GACnB,EAGA+d,GAAWpJ,EAAYlF,UAAW,SAAS1G,EAAMiiB,GAC/C,IAAIgc,EAAgB,qCAAqCz5B,KAAKyd,GAC1Dic,EAAU,kBAAkB15B,KAAKyd,GACjCkc,EAAa1yB,EAAOyyB,EAAW,QAAwB,QAAdjc,EAAuB,QAAU,IAAOA,GACjFmc,EAAeF,GAAW,QAAQ15B,KAAKyd,GAEtCkc,IAGL1yB,EAAO/E,UAAUub,GAAc,WAC7B,IAAIthB,EAAQrP,KAAK8a,YACblM,EAAOg+B,EAAU,CAAC,GAAK1b,UACvB6b,EAAS19B,aAAiBiL,EAC1BpL,EAAWN,EAAK,GAChBo+B,EAAUD,GAAU1yB,EAAQhL,GAE5BkqB,EAAc,SAASlqB,GACzB,IAAIO,EAASi9B,EAAWp+B,MAAM0L,EAAQhK,GAAU,CAACd,GAAQT,IACzD,OAAQg+B,GAAW/xB,EAAYjL,EAAO,GAAKA,CAC7C,EAEIo9B,GAAWL,GAAoC,mBAAZz9B,GAA6C,GAAnBA,EAASL,SAExEk+B,EAASC,GAAU,GAErB,IAAInyB,EAAW7a,KAAKgb,UAEhBiyB,EAAcH,IAAiBjyB,EAC/BqyB,EAAWH,IAFE/sC,KAAK+a,YAAYlM,OAIlC,IAAKi+B,GAAgBE,EAAS,CAC5B39B,EAAQ69B,EAAW79B,EAAQ,IAAIiL,EAAYta,MAC3C,IAAI4P,EAASlB,EAAKD,MAAMY,EAAOT,GAC/BgB,SAAOmL,YAAY6B,KAAK,CAAElO,KAAQgjB,GAAM9iB,KAAQ,CAAC2qB,GAAc5qB,QAAWtN,IACnE,IAAIkZ,GAAc3K,EAAQiL,EACnC,CACA,OAAIoyB,GAAeC,EACVx+B,EAAKD,MAAMzO,KAAM4O,IAE1BgB,EAAS5P,KAAK0xB,KAAK6H,GACZ0T,EAAeL,EAAUh9B,EAAOP,QAAQ,GAAKO,EAAOP,QAAWO,EACxE,EACF,GAGAN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,WAAY,SAASqhB,GACxE,IAAIjiB,EAAOyG,GAAWwb,GAClBwc,EAAY,0BAA0Bj6B,KAAKyd,GAAc,MAAQ,OACjEmc,EAAe,kBAAkB55B,KAAKyd,GAE1CxW,EAAO/E,UAAUub,GAAc,WAC7B,IAAI/hB,EAAOsiB,UACX,GAAI4b,IAAiB9sC,KAAKgb,UAAW,CACnC,IAAI3L,EAAQrP,KAAKqP,QACjB,OAAOX,EAAKD,MAAM4L,EAAQhL,GAASA,EAAQ,GAAIT,EACjD,CACA,OAAO5O,KAAKmtC,GAAW,SAAS99B,GAC9B,OAAOX,EAAKD,MAAM4L,EAAQhL,GAASA,EAAQ,GAAIT,EACjD,EACF,CACF,GAGA8U,GAAWpJ,EAAYlF,UAAW,SAAS1G,EAAMiiB,GAC/C,IAAIkc,EAAa1yB,EAAOwW,GACxB,GAAIkc,EAAY,CACd,IAAIxoC,EAAMwoC,EAAWpoC,KAAO,GACvBgR,EAAe3G,KAAK0K,GAAWnV,KAClCmV,GAAUnV,GAAO,IAEnBmV,GAAUnV,GAAKuY,KAAK,CAAEnY,KAAQksB,EAAYjiB,KAAQm+B,GACpD,CACF,GAEArzB,GAAUyY,GAAa5wB,EAlthBA,GAkthB+BoD,MAAQ,CAAC,CAC7DA,KAAQ,UACRiK,KAAQrN,IAIViZ,EAAYlF,UAAUwiB,MAh9dtB,SAASwV,KACP,IAAIx9B,EAAS,IAAI0K,EAAYta,KAAK8a,aAClClL,SAAOmL,YAAckC,GAAUjd,KAAK+a,aACpCnL,EAAOuL,QAAUnb,KAAKmb,QACtBvL,EAAOwL,aAAepb,KAAKob,aAC3BxL,EAAOyL,cAAgB4B,GAAUjd,KAAKqb,eACtCzL,EAAO0L,cAAgBtb,KAAKsb,cAC5B1L,EAAO2L,UAAY0B,GAAUjd,KAAKub,WAC3B3L,CACT,EAw8dA0K,EAAYlF,UAAU4D,QA97dtB,SAASq0B,KACP,GAAIrtC,KAAKob,aAAc,CACrB,IAAIxL,EAAS,IAAI0K,EAAYta,MAC7B4P,EAAOuL,SAAU,EACjBvL,EAAOwL,cAAe,CACxB,MACExL,EAAS5P,KAAK43B,SACPzc,UAAW,EAEpB,OAAOvL,CACT,EAq7dA0K,EAAYlF,UAAU/F,MA36dtB,SAASi+B,KACP,IAAIt+B,EAAQhP,KAAK8a,YAAYzL,QACzBk+B,EAAMvtC,KAAKmb,QACXkB,EAAQhC,EAAQrL,GAChBw+B,EAAUD,EAAM,EAChBra,EAAY7W,EAAQrN,EAAMH,OAAS,EACnC4+B,EA8pIN,SAASC,GAAQ/hB,EAAOW,EAAK8P,GAI3B,QAHIhtB,GAAQ,EACRP,EAASutB,EAAWvtB,SAEfO,EAAQP,GAAQ,CACvB,IAAIqN,EAAOkgB,EAAWhtB,GAClBiE,EAAO6I,EAAK7I,KAEhB,OAAQ6I,EAAK3Y,MACX,IAAK,OAAaooB,GAAStY,EAAM,MACjC,IAAK,YAAaiZ,GAAOjZ,EAAM,MAC/B,IAAK,OAAaiZ,EAAM7T,EAAU6T,EAAKX,EAAQtY,GAAO,MACtD,IAAK,YAAasY,EAAQpT,EAAUoT,EAAOW,EAAMjZ,GAErD,CACA,MAAO,CAAEsY,MAASA,EAAOW,IAAOA,EAClC,CA9qIaohB,CAAQ,EAAGxa,EAAWlzB,KAAKub,WAClCoQ,EAAQ8hB,EAAK9hB,MACbW,EAAMmhB,EAAKnhB,IACXzd,EAASyd,EAAMX,EACfvc,EAAQo+B,EAAUlhB,EAAOX,EAAQ,EACjCtB,EAAYrqB,KAAKqb,cACjBsyB,EAAatjB,EAAUxb,OACvBc,EAAW,EACXi+B,EAAYn1B,EAAU5J,EAAQ7O,KAAKsb,eAEvC,IAAKe,IAAWmxB,GAAWta,GAAarkB,GAAU++B,GAAa/+B,EAC7D,OAAOof,GAAiBjf,EAAOhP,KAAK+a,aAEtC,IAAInL,EAAS,GAEbwR,EACA,KAAOvS,KAAYc,EAAWi+B,GAAW,CAMvC,QAHIC,GAAY,EACZx+B,EAAQL,EAHZI,GAASm+B,KAKAM,EAAYF,GAAY,CAC/B,IAAIzxB,EAAOmO,EAAUwjB,GAEjBtqC,GAAO2Y,EAAK3Y,KACZ8d,GAAWnS,EAFAgN,EAAKhN,UAEIG,GAExB,GA7zDY,GA6zDR9L,GACF8L,EAAQgS,WACEA,EAAU,CACpB,GAj0Da,GAi0DT9d,GACF,SAAS6d,EAET,MAAMA,CAEV,CACF,CACAxR,EAAOD,KAAcN,CACvB,CACA,OAAOO,CACT,EA+3dAuK,EAAO/E,UAAU8oB,GAAK1E,GACtBrf,EAAO/E,UAAUkkB,MA1iQjB,SAASwU,KACP,OAAOxU,GAAMt5B,KACf,EAyiQAma,EAAO/E,UAAU24B,OA7gQjB,SAASC,KACP,OAAO,IAAIzzB,GAAcva,KAAKqP,QAASrP,KAAKgb,UAC9C,EA4gQAb,EAAO/E,UAAUqoB,KAp/PjB,SAASwQ,KACHjuC,KAAKkb,aAAe7Z,IACtBrB,KAAKkb,WAAaqiB,GAAQv9B,KAAKqP,UAEjC,IAAIquB,EAAO19B,KAAKib,WAAajb,KAAKkb,WAAWrM,OAG7C,MAAO,CAAE6uB,KAAQA,EAAMruB,MAFXquB,EAAOr8B,EAAYrB,KAAKkb,WAAWlb,KAAKib,aAGtD,EA6+PAd,EAAO/E,UAAU4c,MA77PjB,SAASkc,GAAa7+B,GAIpB,QAHIO,EACAuW,EAASnmB,KAENmmB,aAAkBvL,IAAY,CACnC,IAAIgd,EAAQpd,GAAa2L,GACzByR,EAAM3c,UAAY,EAClB2c,EAAM1c,WAAa7Z,EACfuO,EACF2b,EAASzQ,YAAc8c,EAEvBhoB,EAASgoB,EAEX,IAAIrM,EAAWqM,EACfzR,EAASA,EAAOrL,WAClB,CACAyQ,SAASzQ,YAAczL,EAChBO,CACT,EA46PAuK,EAAO/E,UAAU4D,QAt5PjB,SAASm1B,KACP,IAAI9+B,EAAQrP,KAAK8a,YACjB,GAAIzL,aAAiBiL,EAAa,CAChC,IAAI8zB,EAAU/+B,EACd,OAAIrP,KAAK+a,YAAYlM,SACnBu/B,EAAU,IAAI9zB,EAAYta,QAE5BouC,EAAUA,EAAQp1B,WACV+B,YAAY6B,KAAK,CACvBlO,KAAQgjB,GACR9iB,KAAQ,CAACoK,IACTrK,QAAWtN,IAEN,IAAIkZ,GAAc6zB,EAASpuC,KAAKgb,UACzC,CACA,OAAOhb,KAAK0xB,KAAK1Y,GACnB,EAu4PAmB,EAAO/E,UAAUi5B,OAASl0B,EAAO/E,UAAU6E,QAAUE,EAAO/E,UAAU/F,MAv3PtE,SAASi/B,KACP,OAAOrgB,GAAiBjuB,KAAK8a,YAAa9a,KAAK+a,YACjD,EAw3PAZ,EAAO/E,UAAUk3B,MAAQnyB,EAAO/E,UAAU8iB,KAEtCnhB,KACFoD,EAAO/E,UAAU2B,IAj+PnB,SAASw3B,KACP,OAAOvuC,IACT,GAi+POma,CACT,CAKQ1F,GAQN1H,EAAKyH,EAAIA,IAITg6B,EAAO,WACL,OAAOh6B,EACT,EAAC1F,KAAA5B,GAAAuhC,GAAAvhC,GAAAG,OAAAhM,IAAAgM,GAAAH,QAAA7H,EAaL,EAAEyJ,KAAK9O","names":["CosoMenu","constructor","hostRef","registerInstance","this","menuSignInClicked","createEvent","menuSignOutClicked","isAuthenticated","identityProviderEndpoint","shellEndpoint","dashboardEndpoint","logoHref","logoAriaLabel","tenantName","userName","isMvc","isIdentityProvider","supportsMultiTheme","supportsApplicationDrawer","supportsAccountCreation","supportsAuthentication","supportsTenantRename","wrapMenuWithContainerWhenApplicationDrawerIsNotSupported","angularRouter","undefined","angularNgZone","hasStickyNavbar","loginRedirectUrl","logoutRedirectUrl","baseAssetPath","dataCenterEU","dataCenterUS","currentTheme","connectedCallback","themeManagerSubscription","ThemeManager","instance","theme$","subscribe","theme","disconnectedCallback","unsubscribe","toggleTheme","onLogoClicked","e","RoutingHelpers","navigate","getLogoHref","isEmpty","getLogoAriaLabel","removeHiddenAttribute","navElement","el","querySelector","observer","MutationObserver","mutations","mutation","type","attributeName","hasAttribute","removeAttribute","observe","attributes","childList","subtree","componentDidLoad","componentWillUnload","disconnect","render","menuContent","h","key","class","href","onClick","name","src","getAssetRelativePath","alt","id","title","onAuthenticationMenuSignInClicked","emit","onAuthenticationMenuSignOutClicked","slot","getElement","style","__WEBPACK_AMD_DEFINE_RESULT__","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","INFINITY","MAX_SAFE_INTEGER","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","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","global","Object","freeSelf","self","root","Function","freeExports","exports","nodeType","freeModule","module","moduleExports","freeProcess","process","nodeUtil","require","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","length","call","arrayAggregator","array","setter","iteratee","accumulator","index","value","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","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","NaN","object","basePropertyOf","baseReduce","current","baseTimes","n","baseTrim","string","slice","trimmedEndIndex","replace","baseUnary","baseValues","props","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","test","mapToArray","map","size","forEach","overArg","transform","arg","replaceHolders","placeholder","setToArray","set","stringSize","unicodeSize","lastIndex","stringToArray","unicodeToArray","match","asciiToArray","split","charAt","unescapeHtmlChar","_","runInContext","context","uid","defaults","pick","Date","Error","Math","String","TypeError","arrayProto","prototype","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","data","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","push","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","configurable","enumerable","writable","baseAt","paths","skip","get","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","initCloneArray","input","tag","getTag","isFunc","cloneBuffer","initCloneObject","copySymbolsIn","getSymbolsIn","baseAssignIn","keysIn","copySymbols","getSymbols","initCloneByTag","Ctor","cloneArrayBuffer","cloneDataView","dataView","buffer","byteOffset","byteLength","cloneTypedArray","cloneRegExp","regexp","cloneSymbol","symbol","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","escape","evaluate","interpolate","variable","imports","hashClear","delete","hashDelete","hashGet","hashHas","hashSet","listCacheClear","listCacheDelete","pop","listCacheGet","listCacheHas","listCacheSet","mapCacheClear","hash","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","setCacheAdd","setCacheHas","stackClear","stackDelete","stackGet","stackHas","stackSet","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","getRawTag","isOwn","unmasked","objectToString","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","parent","last","baseIsArguments","baseIsEqual","baseIsEqualDeep","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","equalByTag","message","convert","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","equalObjects","isPartial","objProps","objLength","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","isMasked","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","baseMergeDeep","mergeFunc","safeGet","newValue","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseNth","baseOrderBy","iteratees","orders","getIteratee","baseSortBy","comparer","sort","criteria","compareMultiple","objCriteria","othCriteria","ordersLength","compareAscending","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","callback","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","reorder","arrLength","oldArray","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","setToPairs","baseToPairs","createWrap","mergeData","srcBitmask","newBitmask","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrStacked","arrValue","flatten","otherFunc","isKeyable","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","insertWrapDetails","details","updateWrapDetails","getWrapDetails","count","lastCalled","stamp","remaining","rand","memoizeCapped","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","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","remainingWait","timeWaiting","debounced","isInvoking","leadingEdge","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","baseIsArrayBuffer","baseIsDate","isError","isInteger","baseIsMap","isNumber","baseIsRegExp","baseIsSet","isString","baseIsTypedArray","lt","lte","toArray","iteratorToArray","next","done","remainder","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","baseKeysIn","nativeKeysIn","isProto","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","prop","toPairs","toPairsIn","camelCase","word","toLowerCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","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","concat","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","target","position","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","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","settings","isEscaping","isEvaluating","importsKeys","importsValues","reDelimiters","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isUnwrapped","onlyLazy","chainName","lazyClone","lazyReverse","lazyValue","dir","isRight","view","getView","iterLength","takeCount","iterIndex","wrapperChain","commit","wrapperCommit","wrapperNext","wrapperPlant","wrapperReverse","wrapped","toJSON","wrapperValue","wrapperToIterator","define","__webpack_require__"],"ignoreList":[],"sourceRoot":"webpack:///","sources":["./node_modules/@coso/layout/dist/esm/coso-menu.entry.js","./node_modules/lodash/lodash.js"],"sourcesContent":["import { r as registerInstance, c as createEvent, h, d as getElement } from './index-0859a102.js';\nimport { isEmpty } from 'lodash';\nimport { T as ThemeManager } from './theme-manager-3e7fd8c2.js';\nimport { R as RoutingHelpers } from './routing-helpers-c737a977.js';\nimport { g as getAssetRelativePath } from './relativepath-helper-948108b1.js';\nimport 'lodash/trim';\nimport 'rxjs';\n\nconst cosoMenuCss = \"button.btn.btn-primary.theme-button:focus-visible{outline:none !important;box-shadow:none !important;background-color:var(--focus-background-color) !important;color:var(--focus-color) !important}button.btn.btn-primary.theme-button{color:var(--navbar-dark-color)}.data-center-identifier{color:var(--white);border-left:var(--white) 1px solid;font-weight:600;margin-right:2em}\";\nconst CosoMenuStyle0 = cosoMenuCss;\n\nconst CosoMenu = class {\n constructor(hostRef) {\n registerInstance(this, hostRef);\n this.menuSignInClicked = createEvent(this, \"menuSignInClicked\", 7);\n this.menuSignOutClicked = createEvent(this, \"menuSignOutClicked\", 7);\n this.isAuthenticated = false;\n this.identityProviderEndpoint = \"\";\n this.shellEndpoint = \"\";\n this.dashboardEndpoint = \"\";\n this.logoHref = \"\";\n this.logoAriaLabel = \"\";\n this.tenantName = null;\n this.userName = null;\n this.isMvc = false;\n this.isIdentityProvider = false;\n this.supportsMultiTheme = true;\n this.supportsApplicationDrawer = true;\n this.supportsAccountCreation = true;\n this.supportsAuthentication = true;\n this.supportsTenantRename = false;\n this.wrapMenuWithContainerWhenApplicationDrawerIsNotSupported = true;\n this.angularRouter = undefined;\n this.angularNgZone = undefined;\n this.hasStickyNavbar = true;\n this.loginRedirectUrl = \"/Authentication/Login\";\n this.logoutRedirectUrl = \"/Authentication/Logout\";\n this.baseAssetPath = undefined;\n this.dataCenterEU = false;\n this.dataCenterUS = false;\n this.currentTheme = undefined;\n }\n connectedCallback() {\n this.themeManagerSubscription = ThemeManager.instance.theme$.subscribe((theme) => (this.currentTheme = theme));\n }\n disconnectedCallback() {\n this.themeManagerSubscription.unsubscribe();\n }\n toggleTheme() {\n ThemeManager.instance.toggleTheme();\n }\n onLogoClicked(e) {\n RoutingHelpers.navigate(this.getLogoHref(), e, this.angularRouter, this.angularNgZone);\n }\n getLogoHref() {\n return isEmpty(this.logoHref) ? (isEmpty(this.dashboardEndpoint) ? \"/\" : this.dashboardEndpoint) : this.logoHref;\n }\n getLogoAriaLabel() {\n return isEmpty(this.logoAriaLabel) ? \"Home\" : this.logoAriaLabel;\n }\n removeHiddenAttribute() {\n this.navElement = this.el.querySelector(\".visible-nav\");\n this.observer = new MutationObserver((mutations) => {\n for (let mutation of mutations) {\n if (mutation.type === \"attributes\" && mutation.attributeName === \"hidden\") {\n const isHidden = this.navElement.hasAttribute(\"hidden\");\n if (isHidden) {\n this.navElement.removeAttribute(\"hidden\");\n }\n }\n }\n });\n this.observer.observe(this.navElement, {\n attributes: true,\n childList: false,\n subtree: false,\n });\n }\n componentDidLoad() {\n this.removeHiddenAttribute();\n }\n componentWillUnload() {\n this.observer.disconnect();\n }\n render() {\n const menuContent = [\n h(\"div\", { key: 'b3a5f1ccc11abdf7b9846d1a4bbce7dab27d69a4', class: \"d-flex\" }, h(\"div\", { key: '424e869fe2e58d054d345bed8ebfe02d215f4e1b', class: \"navbar-brand\" }, h(\"a\", { key: '19c97845595dda2490b7c010538a1764430cf6d3', href: this.getLogoHref(), class: \"d-inline-block\", onClick: (e) => this.onLogoClicked(e), \"aria-label\": this.getLogoAriaLabel() }, h(\"slot\", { key: 'f383e101a26e43de0b21c40933adeb272dcca90f', name: \"logo\" }, h(\"img\", { key: 'ee961e89d20c2d2c9fdde2082f950d40f58d9bbd', src: getAssetRelativePath(\"./assets/images/connecting-software-white-logo.svg\", this.baseAssetPath), class: \"logo-scale\", alt: \"Connecting Software Logo\" })))), this.dataCenterEU && !this.dataCenterUS ? (h(\"div\", { class: \"d-flex align-items-center\" }, h(\"span\", { class: \"data-center-identifier pl-1\" }, \"EU\"))) : undefined, this.dataCenterUS && !this.dataCenterEU ? (h(\"div\", { class: \"d-flex align-items-center\" }, h(\"span\", { class: \"data-center-identifier pl-1\" }, \"US\"))) : undefined),\n h(\"button\", { key: 'b80a674af8799400910b25fb9cd9b50a0dbb6ba2', class: \"navbar-toggler\", type: \"button\", \"data-toggle\": \"collapse\", \"data-target\": \"#navbarColor01\", \"aria-controls\": \"navbarColor01\", \"aria-expanded\": \"false\", \"aria-label\": \"Toggle navigation\" }, h(\"span\", { key: '217c80f0453c08df325695ed948ff54f5464f069', class: \"fa fa-bars\", \"aria-hidden\": \"true\" })),\n h(\"div\", { key: '86bb3c8442a216a60fcfe4e3196331899c51d76c', class: \"collapse navbar-collapse\", id: \"navbarColor01\" }, h(\"div\", { key: 'a5c767d633b42a50e04d8a7733a0ae9e18c5e99e', class: \"mr-auto\" }, h(\"slot\", { key: '5f17df4df4d225ddd500ce36f0b68a7d64290535', name: \"mainMenu\" })), h(\"slot\", { key: '638444f4316fab37ceef6234f8785f3e63a903be', name: \"mainMenuRightNavbar\" }, h(\"slot\", { key: 'e72289cbb454b9e4da377341ee3b74b74fa0e4fc', name: \"extraNavigation\" }), this.supportsMultiTheme ? (h(\"button\", { class: \"btn btn-primary theme-button\", onClick: () => this.toggleTheme(), \"aria-label\": `Toggle to ${this.currentTheme === \"dark\" ? \"light\" : \"dark\"} theme`, title: `Toggle to ${this.currentTheme === \"dark\" ? \"light\" : \"dark\"} theme` }, h(\"span\", { class: this.currentTheme === \"dark\" ? \"fa fa-sun-o\" : \"fa fa-moon-o\" }))) : undefined, this.supportsAuthentication ? (h(\"coso-authentication-menu\", { isAuthenticated: this.isAuthenticated, identityProviderEndpoint: this.identityProviderEndpoint, isMvc: this.isMvc, isIdentityProvider: this.isIdentityProvider, userName: this.userName, tenantName: this.tenantName, onAuthenticationMenuSignInClicked: () => this.menuSignInClicked.emit(), onAuthenticationMenuSignOutClicked: () => this.menuSignOutClicked.emit(), supportsAccountCreation: this.supportsAccountCreation, supportsTenantRename: this.supportsTenantRename, loginRedirectUrl: this.loginRedirectUrl, logoutRedirectUrl: this.logoutRedirectUrl }, h(\"slot\", { name: \"antiForgeryToken\", slot: \"antiForgeryToken\" }), h(\"slot\", { name: \"dropdownMenuUserAuthenticated\", slot: \"dropdownMenuUserAuthenticated\" }))) : undefined)),\n ];\n return (h(\"nav\", { key: 'f7f5c6c8554accebfd36640f67db0b1dc6a70b2d', class: \"navbar navbar-expand-lg navbar-dark bg-primary visible-nav\" + (this.hasStickyNavbar ? \" sticky-top \" : \"\") }, this.supportsApplicationDrawer ? menuContent : this.wrapMenuWithContainerWhenApplicationDrawerIsNotSupported ? h(\"div\", { class: \"container\" }, menuContent) : menuContent));\n }\n get el() { return getElement(this); }\n};\nCosoMenu.style = CosoMenuStyle0;\n\nexport { CosoMenu as coso_menu };\n\n","/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \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 '

' + func(text) + '

';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '

fred, barney, & pebbles

'\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('');\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('<%- value %>');\n * compiled({ 'value': '