{"version":3,"file":"npm.ramda.js","mappings":"qJAAA,IAAIA,QAEJ,oBAAQ,MAEJC,QAEJ,oBAAQ,MAEJC,OAEJ,oBAAQ,MA2BJC,SAEJF,SAAQ,SAASE,SAASC,IACxB,OAAOF,OAAOE,GAAGC,QAAQ,WACvB,IAAIC,IAAM,EACNC,OAASC,UAAU,GACnBC,KAAOD,UAAUA,UAAUH,OAAS,GACpCK,KAAOC,MAAMC,UAAUC,MAAMC,KAAKN,UAAW,GAQjD,OANAE,KAAK,GAAK,WACR,IAAIK,OAASR,OAAOS,MAAMC,KAAMjB,QAAQQ,UAAW,CAACF,IAAKG,QAEzD,OADAH,KAAO,EACAS,QAGFX,GAAGY,MAAMC,KAAMP,YAI1BQ,OAAOC,QAAUhB,U,mECxDjB,IAAIiB,OAEJ,oBAAQ,MA6BJC,KAzBJ,oBAAQ,KA2BRC,EAAQ,SAASD,KAAKjB,GAAImB,SACxB,OAAOH,OAAOhB,GAAGC,QAAQ,WACvB,OAAOD,GAAGY,MAAMO,QAASf,iBAI7BU,OAAOC,QAAUE,M,mECvCjB,IAAID,OAEJ,oBAAQ,MAEJnB,QAEJ,oBAAQ,MAEJqB,QAEJ,oBAAQ,MAEJE,QAEJ,oBAAQ,MA6CJtB,OAEJoB,SAAQ,SAASpB,OAAOG,OAAQD,IAC9B,OAAe,IAAXC,OACKJ,QAAQG,IAGVgB,OAAOf,OAAQmB,QAAQnB,OAAQ,GAAID,QAG5Cc,OAAOC,QAAUjB,Q,mECrEjB,IAAIoB,QAEJ,oBAAQ,MAEJG,QAEJ,oBAAQ,MA4BJC,OAEJJ,SAAQ,SAASI,OAAOC,EAAGC,GACzB,OAAOH,QAAQE,EAAGC,EAAG,GAAI,OAG3BV,OAAOC,QAAUO,Q,mECxCjB,IAAIJ,QAEJ,oBAAQ,MAEJO,cAEJ,oBAAQ,MAEJC,QAEJ,oBAAQ,MAEJC,UAEJ,oBAAQ,MAEJC,QAEJ,oBAAQ,MAEJC,SAEJ,oBAAQ,KAEJC,KAEJ,oBAAQ,KA8BJC,OAEJb,QAEAO,cAAc,CAAC,UAAWI,UAAU,SAAUG,KAAMC,YAClD,OAAON,UAAUM,YAAcL,SAAQ,SAAUM,IAAKC,KAKpD,OAJIH,KAAKC,WAAWE,QAClBD,IAAIC,KAAOF,WAAWE,MAGjBD,MACN,GAAIJ,KAAKG,aACZP,QAAQM,KAAMC,gBAGhBnB,OAAOC,QAAUgB,Q,mECvEjB,IAqCIK,KAnCJ,oBAAQ,KAqCRlB,CAjCA,oBAAQ,KAmCRO,CAAc,CAAC,QA/Bf,oBAAQ,OA+BwB,SAASW,KAAKpC,GAAIK,MAIhD,IAHA,IAAIH,IAAM,EACNmC,IAAMhC,KAAKJ,OAERC,IAAMmC,KAAK,CAChB,GAAIrC,GAAGK,KAAKH,MACV,OAAOG,KAAKH,KAGdA,KAAO,OAIXY,OAAOC,QAAUqB,M,mECtDjB,IAAIE,gBAEJ,oBAAQ,MAyCJC,QArCJ,oBAAQ,KAuCRrB,CAEAoB,gBAAgB,WAAW,SAASC,QAAQvC,GAAIK,MAI9C,IAHA,IAAIgC,IAAMhC,KAAKJ,OACXC,IAAM,EAEHA,IAAMmC,KACXrC,GAAGK,KAAKH,MACRA,KAAO,EAGT,OAAOG,SAGTS,OAAOC,QAAUwB,S,mEC3DjB,IAAIC,UAEJ,oBAAQ,MA6BJC,SAzBJ,oBAAQ,KA2BRvB,CAAQsB,WAER1B,OAAOC,QAAU0B,U,sBC4BjB3B,OAAOC,QA/DP,SAASC,OAAO0B,EAAG1C,IAEjB,OAAQ0C,GACN,KAAK,EACH,OAAO,WACL,OAAO1C,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,IACf,OAAO3C,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,IACnB,OAAO5C,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,IACvB,OAAO7C,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,IAC3B,OAAO9C,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,GAAIC,IAC/B,OAAO/C,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,IACnC,OAAOhD,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,IACvC,OAAOjD,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,IAC3C,OAAOlD,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,EACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,IAC/C,OAAOnD,GAAGY,MAAMC,KAAMT,YAG1B,KAAK,GACH,OAAO,SAAUuC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,IACnD,OAAOpD,GAAGY,MAAMC,KAAMT,YAG1B,QACE,MAAM,IAAIiD,MAAM,kF,sBChDtBvC,OAAOC,QAXP,SAASuC,mBAAmBC,MAI1B,IAHA,IACIC,KADAnD,KAAO,KAGFmD,KAAOD,KAAKC,QAAQC,MAC3BpD,KAAKqD,KAAKF,KAAKG,OAGjB,OAAOtD,O,mECRT,IAAIuD,SAEJ,oBAAQ,KA0BR9C,OAAOC,QAbP,SAASuB,gBAAgBuB,WAAY7D,IACnC,OAAO,WACL,IAAIC,OAASG,UAAUH,OAEvB,GAAe,IAAXA,OACF,OAAOD,KAGT,IAAI8D,IAAM1D,UAAUH,OAAS,GAC7B,OAAO2D,SAASE,MAAmC,mBAApBA,IAAID,YAA6B7D,GAAGY,MAAMC,KAAMT,WAAa0D,IAAID,YAAYjD,MAAMkD,IAAKvD,MAAMC,UAAUC,MAAMC,KAAKN,UAAW,EAAGH,OAAS,O,sBClB7Ka,OAAOC,QANP,SAASgD,YAAYC,GACnB,OAAO,WACL,OAAQA,EAAEpD,MAAMC,KAAMT,c,sBCiC1BU,OAAOC,QAxBP,SAASnB,QAAQqE,KAAMC,MAGrB,IAAIhE,IADJgE,KAAOA,MAAQ,GAEf,IAAIC,MAHJF,KAAOA,MAAQ,IAGChE,OACZmE,KAAOF,KAAKjE,OACZU,OAAS,GAGb,IAFAT,IAAM,EAECA,IAAMiE,MACXxD,OAAOA,OAAOV,QAAUgE,KAAK/D,KAC7BA,KAAO,EAKT,IAFAA,IAAM,EAECA,IAAMkE,MACXzD,OAAOA,OAAOV,QAAUiE,KAAKhE,KAC7BA,KAAO,EAGT,OAAOS,S,mEChCT,IAAI0D,eAEJ,oBAAQ,MAqBRvD,OAAOC,QAVP,SAASlB,QAAQG,IACf,OAAO,SAASsE,GAAG/C,GACjB,OAAyB,IAArBnB,UAAUH,QAAgBoE,eAAe9C,GACpC+C,GAEAtE,GAAGY,MAAMC,KAAMT,c,mEClB5B,IAAIP,QAEJ,oBAAQ,MAEJwE,eAEJ,oBAAQ,MAgCRvD,OAAOC,QArBP,SAASG,QAAQlB,IACf,OAAO,SAASuE,GAAGhD,EAAGC,GACpB,OAAQpB,UAAUH,QAChB,KAAK,EACH,OAAOsE,GAET,KAAK,EACH,OAAOF,eAAe9C,GAAKgD,GAAK1E,SAAQ,SAAU2E,IAChD,OAAOxE,GAAGuB,EAAGiD,OAGjB,QACE,OAAOH,eAAe9C,IAAM8C,eAAe7C,GAAK+C,GAAKF,eAAe9C,GAAK1B,SAAQ,SAAU4E,IACzF,OAAOzE,GAAGyE,GAAIjD,MACX6C,eAAe7C,GAAK3B,SAAQ,SAAU2E,IACzC,OAAOxE,GAAGuB,EAAGiD,OACVxE,GAAGuB,EAAGC,O,mECjCnB,IAAI3B,QAEJ,oBAAQ,MAEJqB,QAEJ,oBAAQ,MAEJmD,eAEJ,oBAAQ,MAiDRvD,OAAOC,QAtCP,SAAS2D,QAAQ1E,IACf,OAAO,SAAS2E,GAAGpD,EAAGC,EAAGoD,GACvB,OAAQxE,UAAUH,QAChB,KAAK,EACH,OAAO0E,GAET,KAAK,EACH,OAAON,eAAe9C,GAAKoD,GAAKzD,SAAQ,SAAUsD,GAAIK,IACpD,OAAO7E,GAAGuB,EAAGiD,GAAIK,OAGrB,KAAK,EACH,OAAOR,eAAe9C,IAAM8C,eAAe7C,GAAKmD,GAAKN,eAAe9C,GAAKL,SAAQ,SAAUuD,GAAII,IAC7F,OAAO7E,GAAGyE,GAAIjD,EAAGqD,OACdR,eAAe7C,GAAKN,SAAQ,SAAUsD,GAAIK,IAC7C,OAAO7E,GAAGuB,EAAGiD,GAAIK,OACdhF,SAAQ,SAAUgF,IACrB,OAAO7E,GAAGuB,EAAGC,EAAGqD,OAGpB,QACE,OAAOR,eAAe9C,IAAM8C,eAAe7C,IAAM6C,eAAeO,GAAKD,GAAKN,eAAe9C,IAAM8C,eAAe7C,GAAKN,SAAQ,SAAUuD,GAAID,IACvI,OAAOxE,GAAGyE,GAAID,GAAII,MACfP,eAAe9C,IAAM8C,eAAeO,GAAK1D,SAAQ,SAAUuD,GAAII,IAClE,OAAO7E,GAAGyE,GAAIjD,EAAGqD,OACdR,eAAe7C,IAAM6C,eAAeO,GAAK1D,SAAQ,SAAUsD,GAAIK,IAClE,OAAO7E,GAAGuB,EAAGiD,GAAIK,OACdR,eAAe9C,GAAK1B,SAAQ,SAAU4E,IACzC,OAAOzE,GAAGyE,GAAIjD,EAAGoD,MACdP,eAAe7C,GAAK3B,SAAQ,SAAU2E,IACzC,OAAOxE,GAAGuB,EAAGiD,GAAII,MACdP,eAAeO,GAAK/E,SAAQ,SAAUgF,IACzC,OAAO7E,GAAGuB,EAAGC,EAAGqD,OACb7E,GAAGuB,EAAGC,EAAGoD,O,mECtDtB,IAAI5D,OAEJ,oBAAQ,MAEJqD,eAEJ,oBAAQ,MA2CRvD,OAAOC,QA9BP,SAASK,QAAQnB,OAAQ6E,SAAU9E,IACjC,OAAO,WAML,IALA,IAAI+E,SAAW,GACXC,QAAU,EACVC,KAAOhF,OACPiF,YAAc,EAEXA,YAAcJ,SAAS7E,QAAU+E,QAAU5E,UAAUH,QAAQ,CAClE,IAAIU,OAEAuE,YAAcJ,SAAS7E,UAAYoE,eAAeS,SAASI,eAAiBF,SAAW5E,UAAUH,QACnGU,OAASmE,SAASI,cAElBvE,OAASP,UAAU4E,SACnBA,SAAW,GAGbD,SAASG,aAAevE,OAEnB0D,eAAe1D,UAClBsE,MAAQ,GAGVC,aAAe,EAGjB,OAAOD,MAAQ,EAAIjF,GAAGY,MAAMC,KAAMkE,UAAY/D,OAAOiE,KAAM7D,QAAQnB,OAAQ8E,SAAU/E,Q,mEC7CzF,IAAI4D,SAEJ,oBAAQ,KAEJuB,eAEJ,oBAAQ,MA+CRrE,OAAOC,QA9BP,SAASU,cAAc2D,YAAaC,GAAIrF,IACtC,OAAO,WACL,GAAyB,IAArBI,UAAUH,OACZ,OAAOD,KAGT,IAAIM,KAAOC,MAAMC,UAAUC,MAAMC,KAAKN,UAAW,GAC7C0D,IAAMxD,KAAKgF,MAEf,IAAK1B,SAASE,KAAM,CAGlB,IAFA,IAAI5D,IAAM,EAEHA,IAAMkF,YAAYnF,QAAQ,CAC/B,GAAqC,mBAA1B6D,IAAIsB,YAAYlF,MACzB,OAAO4D,IAAIsB,YAAYlF,MAAMU,MAAMkD,IAAKxD,MAG1CJ,KAAO,EAGT,GAAIiF,eAAerB,KAAM,CACvB,IAAIyB,WAAaF,GAAGzE,MAAM,KAAMN,MAChC,OAAOiF,WAAWzB,MAItB,OAAO9D,GAAGY,MAAMC,KAAMT,c,mECjD1B,IAAIkD,mBAEJ,oBAAQ,MAEJkC,cAEJ,oBAAQ,MAEJC,cAEJ,oBAAQ,MAEJC,KAEJ,oBAAQ,MAEJC,UAEJ,oBAAQ,MAEJ7D,KAEJ,oBAAQ,KAEJ8D,KAEJ,oBAAQ,MAaR,SAASC,mBAAmBC,UAAWC,UAAWC,OAAQC,QACxD,IAAI1E,EAAI+B,mBAAmBwC,WAEvBtE,EAAI8B,mBAAmByC,WAE3B,SAASG,GAAGzB,GAAID,IACd,OAAOnD,QAAQoD,GAAID,GAAIwB,OAAOvF,QAASwF,OAAOxF,SAIhD,OAAQ+E,eAAc,SAAUhE,EAAG2E,OACjC,OAAQX,cAAcU,GAAIC,MAAO3E,KAChCA,EAAGD,GAGR,SAASF,QAAQE,EAAGC,EAAGwE,OAAQC,QAC7B,GAAIN,UAAUpE,EAAGC,GACf,OAAO,EAGT,IAAI4E,MAAQR,KAAKrE,GAEjB,GAAI6E,QAAUR,KAAKpE,GACjB,OAAO,EAGT,GAAS,MAALD,GAAkB,MAALC,EACf,OAAO,EAGT,GAAwC,mBAA7BD,EAAE,wBAA6E,mBAA7BC,EAAE,uBAC7D,MAA2C,mBAA7BD,EAAE,wBAAyCA,EAAE,uBAAuBC,IAA0C,mBAA7BA,EAAE,wBAAyCA,EAAE,uBAAuBD,GAGrK,GAAwB,mBAAbA,EAAED,QAA6C,mBAAbE,EAAEF,OAC7C,MAA2B,mBAAbC,EAAED,QAAyBC,EAAED,OAAOE,IAA0B,mBAAbA,EAAEF,QAAyBE,EAAEF,OAAOC,GAGrG,OAAQ6E,OACN,IAAK,YACL,IAAK,QACL,IAAK,SACH,GAA6B,mBAAlB7E,EAAE8E,aAA+D,YAAjCZ,cAAclE,EAAE8E,aACzD,OAAO9E,IAAMC,EAGf,MAEF,IAAK,UACL,IAAK,SACL,IAAK,SACH,UAAaD,UAAaC,IAAKmE,UAAUpE,EAAE+E,UAAW9E,EAAE8E,WACtD,OAAO,EAGT,MAEF,IAAK,OACH,IAAKX,UAAUpE,EAAE+E,UAAW9E,EAAE8E,WAC5B,OAAO,EAGT,MAEF,IAAK,QACH,OAAO/E,EAAEgF,OAAS/E,EAAE+E,MAAQhF,EAAEiF,UAAYhF,EAAEgF,QAE9C,IAAK,SACH,GAAMjF,EAAEkF,SAAWjF,EAAEiF,QAAUlF,EAAEmF,SAAWlF,EAAEkF,QAAUnF,EAAEoF,aAAenF,EAAEmF,YAAcpF,EAAEqF,YAAcpF,EAAEoF,WAAarF,EAAEsF,SAAWrF,EAAEqF,QAAUtF,EAAEuF,UAAYtF,EAAEsF,QAC/J,OAAO,EAQb,IAFA,IAAI5G,IAAM8F,OAAO/F,OAAS,EAEnBC,KAAO,GAAG,CACf,GAAI8F,OAAO9F,OAASqB,EAClB,OAAO0E,OAAO/F,OAASsB,EAGzBtB,KAAO,EAGT,OAAQkG,OACN,IAAK,MACH,OAAI7E,EAAEwF,OAASvF,EAAEuF,MAIVlB,mBAAmBtE,EAAEyF,UAAWxF,EAAEwF,UAAWhB,OAAOiB,OAAO,CAAC1F,IAAK0E,OAAOgB,OAAO,CAACzF,KAEzF,IAAK,MACH,OAAID,EAAEwF,OAASvF,EAAEuF,MAIVlB,mBAAmBtE,EAAE2F,SAAU1F,EAAE0F,SAAUlB,OAAOiB,OAAO,CAAC1F,IAAK0E,OAAOgB,OAAO,CAACzF,KAEvF,IAAK,YACL,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,SACL,IAAK,YACL,IAAK,aACL,IAAK,oBACL,IAAK,aACL,IAAK,cACL,IAAK,aACL,IAAK,cACL,IAAK,eACL,IAAK,eACL,IAAK,cACH,MAEF,QAEE,OAAO,EAGX,IAAI2F,MAAQrF,KAAKP,GAEjB,GAAI4F,MAAMlH,SAAW6B,KAAKN,GAAGvB,OAC3B,OAAO,EAGT,IAAImH,eAAiBpB,OAAOiB,OAAO,CAAC1F,IAChC8F,eAAiBpB,OAAOgB,OAAO,CAACzF,IAGpC,IAFAtB,IAAMiH,MAAMlH,OAAS,EAEdC,KAAO,GAAG,CACf,IAAIiC,IAAMgF,MAAMjH,KAEhB,IAAMwF,KAAKvD,IAAKX,KAAMH,QAAQG,EAAEW,KAAMZ,EAAEY,KAAMiF,eAAgBC,gBAC5D,OAAO,EAGTnH,KAAO,EAGT,OAAO,EAGTY,OAAOC,QAAUM,S,sBC5KjBP,OAAOC,QAhBP,SAASW,QAAQ1B,GAAIK,MAKnB,IAJA,IAAIH,IAAM,EACNmC,IAAMhC,KAAKJ,OACXU,OAAS,GAENT,IAAMmC,KACPrC,GAAGK,KAAKH,QACVS,OAAOA,OAAOV,QAAUI,KAAKH,MAG/BA,KAAO,EAGT,OAAOS,S,sBCPTG,OAAOC,QANP,SAAS0E,cAAczB,GAErB,IAAIsD,MAAQC,OAAOvD,GAAGsD,MAAM,mBAC5B,OAAgB,MAATA,MAAgB,GAAKA,MAAM,K,sBCCpCxG,OAAOC,QAJP,SAAS2E,KAAK8B,KAAM1D,KAClB,OAAO2D,OAAOjH,UAAUkH,eAAehH,KAAKoD,IAAK0D,Q,mECDnD,IAAIG,SAEJ,oBAAQ,MAMR7G,OAAOC,QAJP,SAASyB,UAAUjB,EAAGlB,MACpB,OAAOsH,SAAStH,KAAMkB,EAAG,IAAM,I,sBCUjCT,OAAOC,QAfP,SAASyE,cAAcxD,KAAM4F,EAAGvH,MAI9B,IAHA,IAAIH,IAAM,EACNmC,IAAMhC,KAAKJ,OAERC,IAAMmC,KAAK,CAChB,GAAIL,KAAK4F,EAAGvH,KAAKH,MACf,OAAO,EAGTA,KAAO,EAGT,OAAO,I,mECZT,IAAIoB,OAEJ,oBAAQ,MAqERR,OAAOC,QAnEP,SAAS4G,SAAStH,KAAMkB,EAAGrB,KACzB,IAAI2H,IAAKC,KAET,GAA4B,mBAAjBzH,KAAK0H,QACd,cAAexG,GACb,IAAK,SACH,GAAU,IAANA,EAAS,CAIX,IAFAsG,IAAM,EAAItG,EAEHrB,IAAMG,KAAKJ,QAAQ,CAGxB,GAAa,KAFb6H,KAAOzH,KAAKH,OAEM,EAAI4H,OAASD,IAC7B,OAAO3H,IAGTA,KAAO,EAGT,OAAQ,EACH,GAAIqB,GAAMA,EAAG,CAElB,KAAOrB,IAAMG,KAAKJ,QAAQ,CAGxB,GAAoB,iBAFpB6H,KAAOzH,KAAKH,OAEoB4H,MAASA,KACvC,OAAO5H,IAGTA,KAAO,EAGT,OAAQ,EAIV,OAAOG,KAAK0H,QAAQxG,EAAGrB,KAGzB,IAAK,SACL,IAAK,UACL,IAAK,WACL,IAAK,YACH,OAAOG,KAAK0H,QAAQxG,EAAGrB,KAEzB,IAAK,SACH,GAAU,OAANqB,EAEF,OAAOlB,KAAK0H,QAAQxG,EAAGrB,KAO/B,KAAOA,IAAMG,KAAKJ,QAAQ,CACxB,GAAIqB,OAAOjB,KAAKH,KAAMqB,GACpB,OAAOrB,IAGTA,KAAO,EAGT,OAAQ,I,mECpEV,IAAIwF,KAEJ,oBAAQ,MAEJsC,SAAWP,OAAOjH,UAAUwH,SAE5BC,aAEJ,WACE,MAAoC,uBAA7BD,SAAStH,KAAKN,WAAsC,SAAS6H,aAAaL,GAC/E,MAA4B,uBAArBI,SAAStH,KAAKkH,IACnB,SAASK,aAAaL,GACxB,OAAOlC,KAAK,SAAUkC,IAJ1B,GAQA9G,OAAOC,QAAUkH,c,qBCJjBnH,OAAOC,QAAUR,MAAM2H,SAAW,SAAStE,SAASuE,KAClD,OAAc,MAAPA,KAAeA,IAAIlI,QAAU,GAA6C,mBAAxCwH,OAAOjH,UAAUwH,SAAStH,KAAKyH,O,mECb1E,IAAItI,QAEJ,oBAAQ,MAEJ+D,SAEJ,oBAAQ,KAEJwE,UAEJ,oBAAQ,KAoBJC,aAEJxI,SAAQ,SAASyI,YAAYV,GAC3B,QAAIhE,SAASgE,MAIRA,IAIY,iBAANA,KAIPQ,UAAUR,KAIK,IAAfA,EAAEW,WACKX,EAAE3H,OAGI,IAAb2H,EAAE3H,QAIF2H,EAAE3H,OAAS,IACN2H,EAAEF,eAAe,IAAME,EAAEF,eAAeE,EAAE3H,OAAS,UAM9Da,OAAOC,QAAUsH,c,sBC5DjBvH,OAAOC,QAJP,SAASY,UAAUiG,GACjB,MAA6C,oBAAtCH,OAAOjH,UAAUwH,SAAStH,KAAKkH,K,sBCGxC9G,OAAOC,QAJP,SAASsD,eAAe9C,GACtB,OAAY,MAALA,GAA0B,iBAANA,IAAoD,IAAlCA,EAAE,8B,qBCGjDT,OAAOC,QAJP,SAASqH,UAAUR,GACjB,MAA6C,oBAAtCH,OAAOjH,UAAUwH,SAAStH,KAAKkH,K,sBCGxC9G,OAAOC,QAJP,SAASoE,eAAerB,KACtB,OAAc,MAAPA,KAAmD,mBAA7BA,IAAI,uB,sBCYnChD,OAAOC,QAbP,SAASyH,KAAKxI,GAAIyI,SAKhB,IAJA,IAAIvI,IAAM,EACNmC,IAAMoG,QAAQxI,OACdU,OAASJ,MAAM8B,KAEZnC,IAAMmC,KACX1B,OAAOT,KAAOF,GAAGyI,QAAQvI,MACzBA,KAAO,EAGT,OAAOS,S,sBCGTG,OAAOC,QAA+B,mBAAd0G,OAAOiB,GAAoBjB,OAAOiB,GAZ1D,SAAS/C,UAAUpE,EAAGC,GAEpB,OAAID,IAAMC,EAGK,IAAND,GAAW,EAAIA,GAAM,EAAIC,EAGzBD,GAAMA,GAAKC,GAAMA,I,mECT5B,IAAI6G,aAEJ,oBAAQ,MAEJM,OAEJ,oBAAQ,MAEJ1H,KAEJ,oBAAQ,MAoBR,SAAS2H,gBAAgBvD,GAAInD,IAAKqB,MAGhC,IAFA,IAAIsF,KAAOtF,KAAKC,QAERqF,KAAKpF,MAAM,CAGjB,IAFAvB,IAAMmD,GAAG,qBAAqBnD,IAAK2G,KAAKlF,SAE7BzB,IAAI,wBAAyB,CACtCA,IAAMA,IAAI,sBACV,MAGF2G,KAAOtF,KAAKC,OAGd,OAAO6B,GAAG,uBAAuBnD,KAGnC,SAAS4G,cAAczD,GAAInD,IAAK4B,IAAKiF,YACnC,OAAO1D,GAAG,uBAAuBvB,IAAIiF,YAAY9H,KAAKoE,GAAG,qBAAsBA,IAAKnD,MAGtF,IAAI8G,YAAgC,oBAAXC,OAAyBA,OAAOC,SAAW,aA8BpEpI,OAAOC,QA5BP,SAASa,QAAQ5B,GAAIkC,IAAK7B,MAKxB,GAJkB,mBAAPL,KACTA,GAAK2I,OAAO3I,KAGVqI,aAAahI,MACf,OA/CJ,SAAS8I,aAAa9D,GAAInD,IAAK7B,MAI7B,IAHA,IAAIH,IAAM,EACNmC,IAAMhC,KAAKJ,OAERC,IAAMmC,KAAK,CAGhB,IAFAH,IAAMmD,GAAG,qBAAqBnD,IAAK7B,KAAKH,QAE7BgC,IAAI,wBAAyB,CACtCA,IAAMA,IAAI,sBACV,MAGFhC,KAAO,EAGT,OAAOmF,GAAG,uBAAuBnD,KAgCxBiH,CAAanJ,GAAIkC,IAAK7B,MAG/B,GAA2C,mBAAhCA,KAAK,uBACd,OAAOyI,cAAc9I,GAAIkC,IAAK7B,KAAM,uBAGtC,GAAyB,MAArBA,KAAK2I,aACP,OAAOJ,gBAAgB5I,GAAIkC,IAAK7B,KAAK2I,gBAGvC,GAAyB,mBAAd3I,KAAKmD,KACd,OAAOoF,gBAAgB5I,GAAIkC,IAAK7B,MAGlC,GAA2B,mBAAhBA,KAAK+I,OACd,OAAON,cAAc9I,GAAIkC,IAAK7B,KAAM,UAGtC,MAAM,IAAIgJ,UAAU,4C,sBCvEtBvI,OAAOC,QAPP,SAASuI,SAAS1B,GAChB,OAAOA,GAAKA,EAAE,wBAA0BA,EAAI,CAC1C,qBAAsBA,EACtB,wBAAwB,K,sBCH5B9G,OAAOC,QAAU,CACfwI,KAAM,WACJ,OAAO1I,KAAKwE,GAAG,wBAEjB1E,OAAQ,SAAUA,QAChB,OAAOE,KAAKwE,GAAG,uBAAuB1E,W,kECL1C,IAAIO,QAEJ,oBAAQ,MAEJsI,QAEJ,oBAAQ,MAEJC,QAEJ,WACE,SAASA,QAAQzF,EAAGqB,IAClBxE,KAAKwE,GAAKA,GACVxE,KAAKmD,EAAIA,EAUX,OAPAyF,QAAQjJ,UAAU,qBAAuBgJ,QAAQD,KACjDE,QAAQjJ,UAAU,uBAAyBgJ,QAAQ7I,OAEnD8I,QAAQjJ,UAAU,qBAAuB,SAAUG,OAAQ+I,OACzD,OAAO7I,KAAKmD,EAAE0F,OAAS7I,KAAKwE,GAAG,qBAAqB1E,OAAQ+I,OAAS/I,QAGhE8I,QAbT,GAgBI5H,SAEJX,SAAQ,SAASW,SAASmC,EAAGqB,IAC3B,OAAO,IAAIoE,QAAQzF,EAAGqB,OAGxBvE,OAAOC,QAAUc,U,mEChCjB,IAAIX,QAEJ,oBAAQ,MAEJoI,SAEJ,oBAAQ,MAEJE,QAEJ,oBAAQ,MAEJG,MAEJ,WACE,SAASA,MAAM3F,EAAGqB,IAChBxE,KAAKwE,GAAKA,GACVxE,KAAKmD,EAAIA,EACTnD,KAAK+I,OAAQ,EAsBf,OAnBAD,MAAMnJ,UAAU,qBAAuBgJ,QAAQD,KAE/CI,MAAMnJ,UAAU,uBAAyB,SAAUG,QAKjD,OAJKE,KAAK+I,QACRjJ,OAASE,KAAKwE,GAAG,qBAAqB1E,YAAQ,IAGzCE,KAAKwE,GAAG,uBAAuB1E,SAGxCgJ,MAAMnJ,UAAU,qBAAuB,SAAUG,OAAQ+I,OAMvD,OALI7I,KAAKmD,EAAE0F,SACT7I,KAAK+I,OAAQ,EACbjJ,OAAS2I,SAASzI,KAAKwE,GAAG,qBAAqB1E,OAAQ+I,SAGlD/I,QAGFgJ,MA1BT,GA6BIE,OAEJ3I,SAAQ,SAAS2I,OAAO7F,EAAGqB,IACzB,OAAO,IAAIsE,MAAM3F,EAAGqB,OAGtBvE,OAAOC,QAAU8I,Q,mECjDjB,IAAI3I,QAEJ,oBAAQ,MAEJsI,QAEJ,oBAAQ,MAEJM,KAEJ,WACE,SAASA,KAAK9F,EAAGqB,IACfxE,KAAKwE,GAAKA,GACVxE,KAAKmD,EAAIA,EAUX,OAPA8F,KAAKtJ,UAAU,qBAAuBgJ,QAAQD,KAC9CO,KAAKtJ,UAAU,uBAAyBgJ,QAAQ7I,OAEhDmJ,KAAKtJ,UAAU,qBAAuB,SAAUG,OAAQ+I,OACtD,OAAO7I,KAAKwE,GAAG,qBAAqB1E,OAAQE,KAAKmD,EAAE0F,SAG9CI,KAbT,GAgBIC,MAEJ7I,SAAQ,SAAS6I,MAAM/F,EAAGqB,IACxB,OAAO,IAAIyE,KAAK9F,EAAGqB,OAGrBvE,OAAOC,QAAUgJ,O,sBChCjB,IAAIC,MAEJ,WACE,SAASA,MAAMhK,IACba,KAAKmD,EAAIhE,GAeX,OAZAgK,MAAMxJ,UAAU,qBAAuB,WACrC,MAAM,IAAI6C,MAAM,kCAGlB2G,MAAMxJ,UAAU,uBAAyB,SAAU0B,KACjD,OAAOA,KAGT8H,MAAMxJ,UAAU,qBAAuB,SAAU0B,IAAK0F,GACpD,OAAO/G,KAAKmD,EAAE9B,IAAK0F,IAGdoC,MAjBT,GAwBAlJ,OAAOC,QAJP,SAAS4H,OAAO3I,IACd,OAAO,IAAIgK,MAAMhK,M,kECvBnB,IAAIH,QAEJ,oBAAQ,MAEJ6F,KAEJ,oBAAQ,MAEJuC,aAEJ,oBAAQ,MAGJgC,YAEJ,CACEjC,SAAU,MACVkC,qBAAqB,YACnBC,mBAAqB,CAAC,cAAe,UAAW,gBAAiB,WAAY,uBAAwB,iBAAkB,kBAEvHC,eAEJ,WACE,aAEA,OAAOhK,UAAU8J,qBAAqB,UAHxC,GAMIG,SAAW,SAASA,SAAShK,KAAMyH,MAGrC,IAFA,IAAI5H,IAAM,EAEHA,IAAMG,KAAKJ,QAAQ,CACxB,GAAII,KAAKH,OAAS4H,KAChB,OAAO,EAGT5H,KAAO,EAGT,OAAO,GAsBL4B,KAA8B,mBAAhB2F,OAAO3F,MAAwBsI,eAMjDvK,SAAQ,SAASiC,KAAKgC,KACpB,GAAI2D,OAAO3D,OAASA,IAClB,MAAO,GAGT,IAAI0D,KAAM8C,KACNC,GAAK,GAELC,gBAAkBJ,gBAAkBnC,aAAanE,KAErD,IAAK0D,QAAQ1D,KACP4B,KAAK8B,KAAM1D,MAAU0G,iBAA4B,WAAThD,OAC1C+C,GAAGA,GAAGtK,QAAUuH,MAIpB,GAAIyC,WAGF,IAFAK,KAAOH,mBAAmBlK,OAAS,EAE5BqK,MAAQ,GAGT5E,KAFJ8B,KAAO2C,mBAAmBG,MAEXxG,OAASuG,SAASE,GAAI/C,QACnC+C,GAAGA,GAAGtK,QAAUuH,MAGlB8C,MAAQ,EAIZ,OAAOC,MAlCT1K,SAAQ,SAASiC,KAAKgC,KACpB,OAAO2D,OAAO3D,OAASA,IAAM,GAAK2D,OAAO3F,KAAKgC,QAmChDhD,OAAOC,QAAUe,M,mECnGjB,IAAIZ,QAEJ,oBAAQ,MAEJO,cAEJ,oBAAQ,MAEJ+G,KAEJ,oBAAQ,MAEJ5G,QAEJ,oBAAQ,MAEJmI,MAEJ,oBAAQ,MAEJjK,OAEJ,oBAAQ,MAEJgC,KAEJ,oBAAQ,KAsCJ2I,IAEJvJ,QAEAO,cAAc,CAAC,mBAAoB,OAAQsI,OAAO,SAASU,IAAIzK,GAAIyI,SACjE,OAAQhB,OAAOjH,UAAUwH,SAAStH,KAAK+H,UACrC,IAAK,oBACH,OAAO3I,OAAO2I,QAAQxI,QAAQ,WAC5B,OAAOD,GAAGU,KAAKG,KAAM4H,QAAQ7H,MAAMC,KAAMT,eAG7C,IAAK,kBACH,OAAOwB,SAAQ,SAAUM,IAAKC,KAE5B,OADAD,IAAIC,KAAOnC,GAAGyI,QAAQtG,MACfD,MACN,GAAIJ,KAAK2G,UAEd,QACE,OAAOD,KAAKxI,GAAIyI,cAItB3H,OAAOC,QAAU0J,K,kECtFjB,IAuDIrB,OArDJ,oBAAQ,KAuDR1E,CAnDA,oBAAQ,OAqDR5D,OAAOC,QAAUqI,Q,mEC3DjB,IAAIrF,YAEJ,oBAAQ,MAEJ7C,QAEJ,oBAAQ,MAEJa,OAEJ,oBAAQ,MA2BJ2I,OAEJxJ,SAAQ,SAASwJ,OAAO1I,KAAMC,YAC5B,OAAOF,OAAOgC,YAAY/B,MAAOC,eAGnCnB,OAAOC,QAAU2J,Q,mEC3CjB,IAAI7K,QAEJ,oBAAQ,MAEJ6F,KAEJ,oBAAQ,MAqBJiF,QAEJ9K,SAAQ,SAAS8K,QAAQ7G,KACvB,IAAI8G,MAAQ,GAEZ,IAAK,IAAIpD,QAAQ1D,IACX4B,KAAK8B,KAAM1D,OACb8G,MAAMA,MAAM3K,QAAU,CAACuH,KAAM1D,IAAI0D,QAIrC,OAAOoD,SAGT9J,OAAOC,QAAU4J,S,mECzCjB,IA8BI/E,KA5BJ,oBAAQ,KA8BR/F,EAAQ,SAAS+F,KAAKuC,KACpB,OAAe,OAARA,IAAe,OAASA,MAAQ0C,UAAY,YAAcpD,OAAOjH,UAAUwH,SAAStH,KAAKyH,KAAK1H,MAAM,GAAI,MAGjHK,OAAOC,QAAU6E","sources":["webpack://giveeasy.cloud/./node_modules/ramda/src/addIndex.js","webpack://giveeasy.cloud/./node_modules/ramda/src/bind.js","webpack://giveeasy.cloud/./node_modules/ramda/src/curryN.js","webpack://giveeasy.cloud/./node_modules/ramda/src/equals.js","webpack://giveeasy.cloud/./node_modules/ramda/src/filter.js","webpack://giveeasy.cloud/./node_modules/ramda/src/find.js","webpack://giveeasy.cloud/./node_modules/ramda/src/forEach.js","webpack://giveeasy.cloud/./node_modules/ramda/src/includes.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_arity.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_arrayFromIterator.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_checkForMethod.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_complement.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_concat.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_curry1.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_curry2.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_curry3.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_curryN.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_dispatchable.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_equals.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_filter.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_functionName.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_has.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_includes.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_includesWith.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_indexOf.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isArguments.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isArray.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isArrayLike.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isObject.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isPlaceholder.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isString.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_isTransformer.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_map.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_objectIs.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_reduce.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_reduced.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_xfBase.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_xfilter.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_xfind.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_xmap.js","webpack://giveeasy.cloud/./node_modules/ramda/src/internal/_xwrap.js","webpack://giveeasy.cloud/./node_modules/ramda/src/keys.js","webpack://giveeasy.cloud/./node_modules/ramda/src/map.js","webpack://giveeasy.cloud/./node_modules/ramda/src/reduce.js","webpack://giveeasy.cloud/./node_modules/ramda/src/reject.js","webpack://giveeasy.cloud/./node_modules/ramda/src/toPairs.js","webpack://giveeasy.cloud/./node_modules/ramda/src/type.js"],"sourcesContent":["var _concat =\n/*#__PURE__*/\nrequire(\"./internal/_concat\");\n\nvar _curry1 =\n/*#__PURE__*/\nrequire(\"./internal/_curry1\");\n\nvar curryN =\n/*#__PURE__*/\nrequire(\"./curryN\");\n/**\n * Creates a new list iteration function from an existing one by adding two new\n * parameters to its callback function: the current index, and the entire list.\n *\n * This would turn, for instance, [`R.map`](#map) function into one that\n * more closely resembles `Array.prototype.map`. Note that this will only work\n * for functions in which the iteration callback function is the first\n * parameter, and where the list is the last parameter. (This latter might be\n * unimportant if the list parameter is not used.)\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Function\n * @category List\n * @sig ((a ... -> b) ... -> [a] -> *) -> ((a ..., Int, [a] -> b) ... -> [a] -> *)\n * @param {Function} fn A list iteration function that does not pass index or list to its callback\n * @return {Function} An altered list iteration function that passes (item, index, list) to its callback\n * @example\n *\n * const mapIndexed = R.addIndex(R.map);\n * mapIndexed((val, idx) => idx + '-' + val, ['f', 'o', 'o', 'b', 'a', 'r']);\n * //=> ['0-f', '1-o', '2-o', '3-b', '4-a', '5-r']\n */\n\n\nvar addIndex =\n/*#__PURE__*/\n_curry1(function addIndex(fn) {\n return curryN(fn.length, function () {\n var idx = 0;\n var origFn = arguments[0];\n var list = arguments[arguments.length - 1];\n var args = Array.prototype.slice.call(arguments, 0);\n\n args[0] = function () {\n var result = origFn.apply(this, _concat(arguments, [idx, list]));\n idx += 1;\n return result;\n };\n\n return fn.apply(this, args);\n });\n});\n\nmodule.exports = addIndex;","var _arity =\n/*#__PURE__*/\nrequire(\"./internal/_arity\");\n\nvar _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n/**\n * Creates a function that is bound to a context.\n * Note: `R.bind` does not provide the additional argument-binding capabilities of\n * [Function.prototype.bind](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/bind).\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @category Object\n * @sig (* -> *) -> {*} -> (* -> *)\n * @param {Function} fn The function to bind to context\n * @param {Object} thisObj The context to bind `fn` to\n * @return {Function} A function that will execute in the context of `thisObj`.\n * @see R.partial\n * @example\n *\n * const log = R.bind(console.log, console);\n * R.pipe(R.assoc('a', 2), R.tap(log), R.assoc('a', 3))({a: 1}); //=> {a: 3}\n * // logs {a: 2}\n * @symb R.bind(f, o)(a, b) = f.call(o, a, b)\n */\n\n\nvar bind =\n/*#__PURE__*/\n_curry2(function bind(fn, thisObj) {\n return _arity(fn.length, function () {\n return fn.apply(thisObj, arguments);\n });\n});\n\nmodule.exports = bind;","var _arity =\n/*#__PURE__*/\nrequire(\"./internal/_arity\");\n\nvar _curry1 =\n/*#__PURE__*/\nrequire(\"./internal/_curry1\");\n\nvar _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n\nvar _curryN =\n/*#__PURE__*/\nrequire(\"./internal/_curryN\");\n/**\n * Returns a curried equivalent of the provided function, with the specified\n * arity. The curried function has two unusual capabilities. First, its\n * arguments needn't be provided one at a time. If `g` is `R.curryN(3, f)`, the\n * following are equivalent:\n *\n * - `g(1)(2)(3)`\n * - `g(1)(2, 3)`\n * - `g(1, 2)(3)`\n * - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value [`R.__`](#__) may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is [`R.__`](#__),\n * the following are equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curry\n * @example\n *\n * const sumArgs = (...args) => R.sum(args);\n *\n * const curriedAddFourNumbers = R.curryN(4, sumArgs);\n * const f = curriedAddFourNumbers(1, 2);\n * const g = f(3);\n * g(4); //=> 10\n */\n\n\nvar curryN =\n/*#__PURE__*/\n_curry2(function curryN(length, fn) {\n if (length === 1) {\n return _curry1(fn);\n }\n\n return _arity(length, _curryN(length, [], fn));\n});\n\nmodule.exports = curryN;","var _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n\nvar _equals =\n/*#__PURE__*/\nrequire(\"./internal/_equals\");\n/**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * R.equals(1, 1); //=> true\n * R.equals(1, '1'); //=> false\n * R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n * const a = {}; a.v = a;\n * const b = {}; b.v = b;\n * R.equals(a, b); //=> true\n */\n\n\nvar equals =\n/*#__PURE__*/\n_curry2(function equals(a, b) {\n return _equals(a, b, [], []);\n});\n\nmodule.exports = equals;","var _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n\nvar _dispatchable =\n/*#__PURE__*/\nrequire(\"./internal/_dispatchable\");\n\nvar _filter =\n/*#__PURE__*/\nrequire(\"./internal/_filter\");\n\nvar _isObject =\n/*#__PURE__*/\nrequire(\"./internal/_isObject\");\n\nvar _reduce =\n/*#__PURE__*/\nrequire(\"./internal/_reduce\");\n\nvar _xfilter =\n/*#__PURE__*/\nrequire(\"./internal/_xfilter\");\n\nvar keys =\n/*#__PURE__*/\nrequire(\"./keys\");\n/**\n * Takes a predicate and a `Filterable`, and returns a new filterable of the\n * same type containing the members of the given filterable which satisfy the\n * given predicate. Filterable objects include plain objects or any object\n * that has a filter method such as `Array`.\n *\n * Dispatches to the `filter` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array} Filterable\n * @see R.reject, R.transduce, R.addIndex\n * @example\n *\n * const isEven = n => n % 2 === 0;\n *\n * R.filter(isEven, [1, 2, 3, 4]); //=> [2, 4]\n *\n * R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\n\n\nvar filter =\n/*#__PURE__*/\n_curry2(\n/*#__PURE__*/\n_dispatchable(['filter'], _xfilter, function (pred, filterable) {\n return _isObject(filterable) ? _reduce(function (acc, key) {\n if (pred(filterable[key])) {\n acc[key] = filterable[key];\n }\n\n return acc;\n }, {}, keys(filterable)) : // else\n _filter(pred, filterable);\n}));\n\nmodule.exports = filter;","var _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n\nvar _dispatchable =\n/*#__PURE__*/\nrequire(\"./internal/_dispatchable\");\n\nvar _xfind =\n/*#__PURE__*/\nrequire(\"./internal/_xfind\");\n/**\n * Returns the first element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `find` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n * const xs = [{a: 1}, {a: 2}, {a: 3}];\n * R.find(R.propEq('a', 2))(xs); //=> {a: 2}\n * R.find(R.propEq('a', 4))(xs); //=> undefined\n */\n\n\nvar find =\n/*#__PURE__*/\n_curry2(\n/*#__PURE__*/\n_dispatchable(['find'], _xfind, function find(fn, list) {\n var idx = 0;\n var len = list.length;\n\n while (idx < len) {\n if (fn(list[idx])) {\n return list[idx];\n }\n\n idx += 1;\n }\n}));\n\nmodule.exports = find;","var _checkForMethod =\n/*#__PURE__*/\nrequire(\"./internal/_checkForMethod\");\n\nvar _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n/**\n * Iterate over an input `list`, calling a provided function `fn` for each\n * element in the list.\n *\n * `fn` receives one argument: *(value)*.\n *\n * Note: `R.forEach` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.forEach` method. For more\n * details on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach#Description\n *\n * Also note that, unlike `Array.prototype.forEach`, Ramda's `forEach` returns\n * the original array. In some libraries this function is named `each`.\n *\n * Dispatches to the `forEach` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> *) -> [a] -> [a]\n * @param {Function} fn The function to invoke. Receives one argument, `value`.\n * @param {Array} list The list to iterate over.\n * @return {Array} The original list.\n * @see R.addIndex\n * @example\n *\n * const printXPlusFive = x => console.log(x + 5);\n * R.forEach(printXPlusFive, [1, 2, 3]); //=> [1, 2, 3]\n * // logs 6\n * // logs 7\n * // logs 8\n * @symb R.forEach(f, [a, b, c]) = [a, b, c]\n */\n\n\nvar forEach =\n/*#__PURE__*/\n_curry2(\n/*#__PURE__*/\n_checkForMethod('forEach', function forEach(fn, list) {\n var len = list.length;\n var idx = 0;\n\n while (idx < len) {\n fn(list[idx]);\n idx += 1;\n }\n\n return list;\n}));\n\nmodule.exports = forEach;","var _includes =\n/*#__PURE__*/\nrequire(\"./internal/_includes\");\n\nvar _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n/**\n * Returns `true` if the specified value is equal, in [`R.equals`](#equals)\n * terms, to at least one element of the given list; `false` otherwise.\n * Works also with strings.\n *\n * @func\n * @memberOf R\n * @since v0.26.0\n * @category List\n * @sig a -> [a] -> Boolean\n * @param {Object} a The item to compare against.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if an equivalent item is in the list, `false` otherwise.\n * @see R.any\n * @example\n *\n * R.includes(3, [1, 2, 3]); //=> true\n * R.includes(4, [1, 2, 3]); //=> false\n * R.includes({ name: 'Fred' }, [{ name: 'Fred' }]); //=> true\n * R.includes([42], [[42]]); //=> true\n * R.includes('ba', 'banana'); //=>true\n */\n\n\nvar includes =\n/*#__PURE__*/\n_curry2(_includes);\n\nmodule.exports = includes;","function _arity(n, fn) {\n /* eslint-disable no-unused-vars */\n switch (n) {\n case 0:\n return function () {\n return fn.apply(this, arguments);\n };\n\n case 1:\n return function (a0) {\n return fn.apply(this, arguments);\n };\n\n case 2:\n return function (a0, a1) {\n return fn.apply(this, arguments);\n };\n\n case 3:\n return function (a0, a1, a2) {\n return fn.apply(this, arguments);\n };\n\n case 4:\n return function (a0, a1, a2, a3) {\n return fn.apply(this, arguments);\n };\n\n case 5:\n return function (a0, a1, a2, a3, a4) {\n return fn.apply(this, arguments);\n };\n\n case 6:\n return function (a0, a1, a2, a3, a4, a5) {\n return fn.apply(this, arguments);\n };\n\n case 7:\n return function (a0, a1, a2, a3, a4, a5, a6) {\n return fn.apply(this, arguments);\n };\n\n case 8:\n return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n return fn.apply(this, arguments);\n };\n\n case 9:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n return fn.apply(this, arguments);\n };\n\n case 10:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n return fn.apply(this, arguments);\n };\n\n default:\n throw new Error('First argument to _arity must be a non-negative integer no greater than ten');\n }\n}\n\nmodule.exports = _arity;","function _arrayFromIterator(iter) {\n var list = [];\n var next;\n\n while (!(next = iter.next()).done) {\n list.push(next.value);\n }\n\n return list;\n}\n\nmodule.exports = _arrayFromIterator;","var _isArray =\n/*#__PURE__*/\nrequire(\"./_isArray\");\n/**\n * This checks whether a function has a [methodname] function. If it isn't an\n * array it will execute that function otherwise it will default to the ramda\n * implementation.\n *\n * @private\n * @param {Function} fn ramda implemtation\n * @param {String} methodname property to check for a custom implementation\n * @return {Object} Whatever the return value of the method is.\n */\n\n\nfunction _checkForMethod(methodname, fn) {\n return function () {\n var length = arguments.length;\n\n if (length === 0) {\n return fn();\n }\n\n var obj = arguments[length - 1];\n return _isArray(obj) || typeof obj[methodname] !== 'function' ? fn.apply(this, arguments) : obj[methodname].apply(obj, Array.prototype.slice.call(arguments, 0, length - 1));\n };\n}\n\nmodule.exports = _checkForMethod;","function _complement(f) {\n return function () {\n return !f.apply(this, arguments);\n };\n}\n\nmodule.exports = _complement;","/**\n * Private `concat` function to merge two array-like objects.\n *\n * @private\n * @param {Array|Arguments} [set1=[]] An array-like object.\n * @param {Array|Arguments} [set2=[]] An array-like object.\n * @return {Array} A new, merged array.\n * @example\n *\n * _concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n */\nfunction _concat(set1, set2) {\n set1 = set1 || [];\n set2 = set2 || [];\n var idx;\n var len1 = set1.length;\n var len2 = set2.length;\n var result = [];\n idx = 0;\n\n while (idx < len1) {\n result[result.length] = set1[idx];\n idx += 1;\n }\n\n idx = 0;\n\n while (idx < len2) {\n result[result.length] = set2[idx];\n idx += 1;\n }\n\n return result;\n}\n\nmodule.exports = _concat;","var _isPlaceholder =\n/*#__PURE__*/\nrequire(\"./_isPlaceholder\");\n/**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n\n\nfunction _curry1(fn) {\n return function f1(a) {\n if (arguments.length === 0 || _isPlaceholder(a)) {\n return f1;\n } else {\n return fn.apply(this, arguments);\n }\n };\n}\n\nmodule.exports = _curry1;","var _curry1 =\n/*#__PURE__*/\nrequire(\"./_curry1\");\n\nvar _isPlaceholder =\n/*#__PURE__*/\nrequire(\"./_isPlaceholder\");\n/**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n\n\nfunction _curry2(fn) {\n return function f2(a, b) {\n switch (arguments.length) {\n case 0:\n return f2;\n\n case 1:\n return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n return fn(a, _b);\n });\n\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b);\n }) : fn(a, b);\n }\n };\n}\n\nmodule.exports = _curry2;","var _curry1 =\n/*#__PURE__*/\nrequire(\"./_curry1\");\n\nvar _curry2 =\n/*#__PURE__*/\nrequire(\"./_curry2\");\n\nvar _isPlaceholder =\n/*#__PURE__*/\nrequire(\"./_isPlaceholder\");\n/**\n * Optimized internal three-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n\n\nfunction _curry3(fn) {\n return function f3(a, b, c) {\n switch (arguments.length) {\n case 0:\n return f3;\n\n case 1:\n return _isPlaceholder(a) ? f3 : _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n });\n\n case 2:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f3 : _isPlaceholder(a) ? _curry2(function (_a, _c) {\n return fn(_a, b, _c);\n }) : _isPlaceholder(b) ? _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n }) : _curry1(function (_c) {\n return fn(a, b, _c);\n });\n\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) && _isPlaceholder(c) ? f3 : _isPlaceholder(a) && _isPlaceholder(b) ? _curry2(function (_a, _b) {\n return fn(_a, _b, c);\n }) : _isPlaceholder(a) && _isPlaceholder(c) ? _curry2(function (_a, _c) {\n return fn(_a, b, _c);\n }) : _isPlaceholder(b) && _isPlaceholder(c) ? _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n }) : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b, c);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b, c);\n }) : _isPlaceholder(c) ? _curry1(function (_c) {\n return fn(a, b, _c);\n }) : fn(a, b, c);\n }\n };\n}\n\nmodule.exports = _curry3;","var _arity =\n/*#__PURE__*/\nrequire(\"./_arity\");\n\nvar _isPlaceholder =\n/*#__PURE__*/\nrequire(\"./_isPlaceholder\");\n/**\n * Internal curryN function.\n *\n * @private\n * @category Function\n * @param {Number} length The arity of the curried function.\n * @param {Array} received An array of arguments received thus far.\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n\n\nfunction _curryN(length, received, fn) {\n return function () {\n var combined = [];\n var argsIdx = 0;\n var left = length;\n var combinedIdx = 0;\n\n while (combinedIdx < received.length || argsIdx < arguments.length) {\n var result;\n\n if (combinedIdx < received.length && (!_isPlaceholder(received[combinedIdx]) || argsIdx >= arguments.length)) {\n result = received[combinedIdx];\n } else {\n result = arguments[argsIdx];\n argsIdx += 1;\n }\n\n combined[combinedIdx] = result;\n\n if (!_isPlaceholder(result)) {\n left -= 1;\n }\n\n combinedIdx += 1;\n }\n\n return left <= 0 ? fn.apply(this, combined) : _arity(left, _curryN(length, combined, fn));\n };\n}\n\nmodule.exports = _curryN;","var _isArray =\n/*#__PURE__*/\nrequire(\"./_isArray\");\n\nvar _isTransformer =\n/*#__PURE__*/\nrequire(\"./_isTransformer\");\n/**\n * Returns a function that dispatches with different strategies based on the\n * object in list position (last argument). If it is an array, executes [fn].\n * Otherwise, if it has a function with one of the given method names, it will\n * execute that function (functor case). Otherwise, if it is a transformer,\n * uses transducer [xf] to return a new transformer (transducer case).\n * Otherwise, it will default to executing [fn].\n *\n * @private\n * @param {Array} methodNames properties to check for a custom implementation\n * @param {Function} xf transducer to initialize if object is transformer\n * @param {Function} fn default ramda implementation\n * @return {Function} A function that dispatches on object in list position\n */\n\n\nfunction _dispatchable(methodNames, xf, fn) {\n return function () {\n if (arguments.length === 0) {\n return fn();\n }\n\n var args = Array.prototype.slice.call(arguments, 0);\n var obj = args.pop();\n\n if (!_isArray(obj)) {\n var idx = 0;\n\n while (idx < methodNames.length) {\n if (typeof obj[methodNames[idx]] === 'function') {\n return obj[methodNames[idx]].apply(obj, args);\n }\n\n idx += 1;\n }\n\n if (_isTransformer(obj)) {\n var transducer = xf.apply(null, args);\n return transducer(obj);\n }\n }\n\n return fn.apply(this, arguments);\n };\n}\n\nmodule.exports = _dispatchable;","var _arrayFromIterator =\n/*#__PURE__*/\nrequire(\"./_arrayFromIterator\");\n\nvar _includesWith =\n/*#__PURE__*/\nrequire(\"./_includesWith\");\n\nvar _functionName =\n/*#__PURE__*/\nrequire(\"./_functionName\");\n\nvar _has =\n/*#__PURE__*/\nrequire(\"./_has\");\n\nvar _objectIs =\n/*#__PURE__*/\nrequire(\"./_objectIs\");\n\nvar keys =\n/*#__PURE__*/\nrequire(\"../keys\");\n\nvar type =\n/*#__PURE__*/\nrequire(\"../type\");\n/**\n * private _uniqContentEquals function.\n * That function is checking equality of 2 iterator contents with 2 assumptions\n * - iterators lengths are the same\n * - iterators values are unique\n *\n * false-positive result will be returned for comparision of, e.g.\n * - [1,2,3] and [1,2,3,4]\n * - [1,1,1] and [1,2,3]\n * */\n\n\nfunction _uniqContentEquals(aIterator, bIterator, stackA, stackB) {\n var a = _arrayFromIterator(aIterator);\n\n var b = _arrayFromIterator(bIterator);\n\n function eq(_a, _b) {\n return _equals(_a, _b, stackA.slice(), stackB.slice());\n } // if *a* array contains any element that is not included in *b*\n\n\n return !_includesWith(function (b, aItem) {\n return !_includesWith(eq, aItem, b);\n }, b, a);\n}\n\nfunction _equals(a, b, stackA, stackB) {\n if (_objectIs(a, b)) {\n return true;\n }\n\n var typeA = type(a);\n\n if (typeA !== type(b)) {\n return false;\n }\n\n if (a == null || b == null) {\n return false;\n }\n\n if (typeof a['fantasy-land/equals'] === 'function' || typeof b['fantasy-land/equals'] === 'function') {\n return typeof a['fantasy-land/equals'] === 'function' && a['fantasy-land/equals'](b) && typeof b['fantasy-land/equals'] === 'function' && b['fantasy-land/equals'](a);\n }\n\n if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n }\n\n switch (typeA) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n return a === b;\n }\n\n break;\n\n case 'Boolean':\n case 'Number':\n case 'String':\n if (!(typeof a === typeof b && _objectIs(a.valueOf(), b.valueOf()))) {\n return false;\n }\n\n break;\n\n case 'Date':\n if (!_objectIs(a.valueOf(), b.valueOf())) {\n return false;\n }\n\n break;\n\n case 'Error':\n return a.name === b.name && a.message === b.message;\n\n case 'RegExp':\n if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n return false;\n }\n\n break;\n }\n\n var idx = stackA.length - 1;\n\n while (idx >= 0) {\n if (stackA[idx] === a) {\n return stackB[idx] === b;\n }\n\n idx -= 1;\n }\n\n switch (typeA) {\n case 'Map':\n if (a.size !== b.size) {\n return false;\n }\n\n return _uniqContentEquals(a.entries(), b.entries(), stackA.concat([a]), stackB.concat([b]));\n\n case 'Set':\n if (a.size !== b.size) {\n return false;\n }\n\n return _uniqContentEquals(a.values(), b.values(), stackA.concat([a]), stackB.concat([b]));\n\n case 'Arguments':\n case 'Array':\n case 'Object':\n case 'Boolean':\n case 'Number':\n case 'String':\n case 'Date':\n case 'Error':\n case 'RegExp':\n case 'Int8Array':\n case 'Uint8Array':\n case 'Uint8ClampedArray':\n case 'Int16Array':\n case 'Uint16Array':\n case 'Int32Array':\n case 'Uint32Array':\n case 'Float32Array':\n case 'Float64Array':\n case 'ArrayBuffer':\n break;\n\n default:\n // Values of other types are only equal if identical.\n return false;\n }\n\n var keysA = keys(a);\n\n if (keysA.length !== keys(b).length) {\n return false;\n }\n\n var extendedStackA = stackA.concat([a]);\n var extendedStackB = stackB.concat([b]);\n idx = keysA.length - 1;\n\n while (idx >= 0) {\n var key = keysA[idx];\n\n if (!(_has(key, b) && _equals(b[key], a[key], extendedStackA, extendedStackB))) {\n return false;\n }\n\n idx -= 1;\n }\n\n return true;\n}\n\nmodule.exports = _equals;","function _filter(fn, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n\n while (idx < len) {\n if (fn(list[idx])) {\n result[result.length] = list[idx];\n }\n\n idx += 1;\n }\n\n return result;\n}\n\nmodule.exports = _filter;","function _functionName(f) {\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var match = String(f).match(/^function (\\w*)/);\n return match == null ? '' : match[1];\n}\n\nmodule.exports = _functionName;","function _has(prop, obj) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = _has;","var _indexOf =\n/*#__PURE__*/\nrequire(\"./_indexOf\");\n\nfunction _includes(a, list) {\n return _indexOf(list, a, 0) >= 0;\n}\n\nmodule.exports = _includes;","function _includesWith(pred, x, list) {\n var idx = 0;\n var len = list.length;\n\n while (idx < len) {\n if (pred(x, list[idx])) {\n return true;\n }\n\n idx += 1;\n }\n\n return false;\n}\n\nmodule.exports = _includesWith;","var equals =\n/*#__PURE__*/\nrequire(\"../equals\");\n\nfunction _indexOf(list, a, idx) {\n var inf, item; // Array.prototype.indexOf doesn't exist below IE9\n\n if (typeof list.indexOf === 'function') {\n switch (typeof a) {\n case 'number':\n if (a === 0) {\n // manually crawl the list to distinguish between +0 and -0\n inf = 1 / a;\n\n while (idx < list.length) {\n item = list[idx];\n\n if (item === 0 && 1 / item === inf) {\n return idx;\n }\n\n idx += 1;\n }\n\n return -1;\n } else if (a !== a) {\n // NaN\n while (idx < list.length) {\n item = list[idx];\n\n if (typeof item === 'number' && item !== item) {\n return idx;\n }\n\n idx += 1;\n }\n\n return -1;\n } // non-zero numbers can utilise Set\n\n\n return list.indexOf(a, idx);\n // all these types can utilise Set\n\n case 'string':\n case 'boolean':\n case 'function':\n case 'undefined':\n return list.indexOf(a, idx);\n\n case 'object':\n if (a === null) {\n // null can utilise Set\n return list.indexOf(a, idx);\n }\n\n }\n } // anything else not covered above, defer to R.equals\n\n\n while (idx < list.length) {\n if (equals(list[idx], a)) {\n return idx;\n }\n\n idx += 1;\n }\n\n return -1;\n}\n\nmodule.exports = _indexOf;","var _has =\n/*#__PURE__*/\nrequire(\"./_has\");\n\nvar toString = Object.prototype.toString;\n\nvar _isArguments =\n/*#__PURE__*/\nfunction () {\n return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n return toString.call(x) === '[object Arguments]';\n } : function _isArguments(x) {\n return _has('callee', x);\n };\n}();\n\nmodule.exports = _isArguments;","/**\n * Tests whether or not an object is an array.\n *\n * @private\n * @param {*} val The object to test.\n * @return {Boolean} `true` if `val` is an array, `false` otherwise.\n * @example\n *\n * _isArray([]); //=> true\n * _isArray(null); //=> false\n * _isArray({}); //=> false\n */\nmodule.exports = Array.isArray || function _isArray(val) {\n return val != null && val.length >= 0 && Object.prototype.toString.call(val) === '[object Array]';\n};","var _curry1 =\n/*#__PURE__*/\nrequire(\"./_curry1\");\n\nvar _isArray =\n/*#__PURE__*/\nrequire(\"./_isArray\");\n\nvar _isString =\n/*#__PURE__*/\nrequire(\"./_isString\");\n/**\n * Tests whether or not an object is similar to an array.\n *\n * @private\n * @category Type\n * @category List\n * @sig * -> Boolean\n * @param {*} x The object to test.\n * @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.\n * @example\n *\n * _isArrayLike([]); //=> true\n * _isArrayLike(true); //=> false\n * _isArrayLike({}); //=> false\n * _isArrayLike({length: 10}); //=> false\n * _isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true\n */\n\n\nvar _isArrayLike =\n/*#__PURE__*/\n_curry1(function isArrayLike(x) {\n if (_isArray(x)) {\n return true;\n }\n\n if (!x) {\n return false;\n }\n\n if (typeof x !== 'object') {\n return false;\n }\n\n if (_isString(x)) {\n return false;\n }\n\n if (x.nodeType === 1) {\n return !!x.length;\n }\n\n if (x.length === 0) {\n return true;\n }\n\n if (x.length > 0) {\n return x.hasOwnProperty(0) && x.hasOwnProperty(x.length - 1);\n }\n\n return false;\n});\n\nmodule.exports = _isArrayLike;","function _isObject(x) {\n return Object.prototype.toString.call(x) === '[object Object]';\n}\n\nmodule.exports = _isObject;","function _isPlaceholder(a) {\n return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n}\n\nmodule.exports = _isPlaceholder;","function _isString(x) {\n return Object.prototype.toString.call(x) === '[object String]';\n}\n\nmodule.exports = _isString;","function _isTransformer(obj) {\n return obj != null && typeof obj['@@transducer/step'] === 'function';\n}\n\nmodule.exports = _isTransformer;","function _map(fn, functor) {\n var idx = 0;\n var len = functor.length;\n var result = Array(len);\n\n while (idx < len) {\n result[idx] = fn(functor[idx]);\n idx += 1;\n }\n\n return result;\n}\n\nmodule.exports = _map;","// Based on https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\nfunction _objectIs(a, b) {\n // SameValue algorithm\n if (a === b) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n return a !== 0 || 1 / a === 1 / b;\n } else {\n // Step 6.a: NaN == NaN\n return a !== a && b !== b;\n }\n}\n\nmodule.exports = typeof Object.is === 'function' ? Object.is : _objectIs;","var _isArrayLike =\n/*#__PURE__*/\nrequire(\"./_isArrayLike\");\n\nvar _xwrap =\n/*#__PURE__*/\nrequire(\"./_xwrap\");\n\nvar bind =\n/*#__PURE__*/\nrequire(\"../bind\");\n\nfunction _arrayReduce(xf, acc, list) {\n var idx = 0;\n var len = list.length;\n\n while (idx < len) {\n acc = xf['@@transducer/step'](acc, list[idx]);\n\n if (acc && acc['@@transducer/reduced']) {\n acc = acc['@@transducer/value'];\n break;\n }\n\n idx += 1;\n }\n\n return xf['@@transducer/result'](acc);\n}\n\nfunction _iterableReduce(xf, acc, iter) {\n var step = iter.next();\n\n while (!step.done) {\n acc = xf['@@transducer/step'](acc, step.value);\n\n if (acc && acc['@@transducer/reduced']) {\n acc = acc['@@transducer/value'];\n break;\n }\n\n step = iter.next();\n }\n\n return xf['@@transducer/result'](acc);\n}\n\nfunction _methodReduce(xf, acc, obj, methodName) {\n return xf['@@transducer/result'](obj[methodName](bind(xf['@@transducer/step'], xf), acc));\n}\n\nvar symIterator = typeof Symbol !== 'undefined' ? Symbol.iterator : '@@iterator';\n\nfunction _reduce(fn, acc, list) {\n if (typeof fn === 'function') {\n fn = _xwrap(fn);\n }\n\n if (_isArrayLike(list)) {\n return _arrayReduce(fn, acc, list);\n }\n\n if (typeof list['fantasy-land/reduce'] === 'function') {\n return _methodReduce(fn, acc, list, 'fantasy-land/reduce');\n }\n\n if (list[symIterator] != null) {\n return _iterableReduce(fn, acc, list[symIterator]());\n }\n\n if (typeof list.next === 'function') {\n return _iterableReduce(fn, acc, list);\n }\n\n if (typeof list.reduce === 'function') {\n return _methodReduce(fn, acc, list, 'reduce');\n }\n\n throw new TypeError('reduce: list must be array or iterable');\n}\n\nmodule.exports = _reduce;","function _reduced(x) {\n return x && x['@@transducer/reduced'] ? x : {\n '@@transducer/value': x,\n '@@transducer/reduced': true\n };\n}\n\nmodule.exports = _reduced;","module.exports = {\n init: function () {\n return this.xf['@@transducer/init']();\n },\n result: function (result) {\n return this.xf['@@transducer/result'](result);\n }\n};","var _curry2 =\n/*#__PURE__*/\nrequire(\"./_curry2\");\n\nvar _xfBase =\n/*#__PURE__*/\nrequire(\"./_xfBase\");\n\nvar XFilter =\n/*#__PURE__*/\nfunction () {\n function XFilter(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n\n XFilter.prototype['@@transducer/init'] = _xfBase.init;\n XFilter.prototype['@@transducer/result'] = _xfBase.result;\n\n XFilter.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.xf['@@transducer/step'](result, input) : result;\n };\n\n return XFilter;\n}();\n\nvar _xfilter =\n/*#__PURE__*/\n_curry2(function _xfilter(f, xf) {\n return new XFilter(f, xf);\n});\n\nmodule.exports = _xfilter;","var _curry2 =\n/*#__PURE__*/\nrequire(\"./_curry2\");\n\nvar _reduced =\n/*#__PURE__*/\nrequire(\"./_reduced\");\n\nvar _xfBase =\n/*#__PURE__*/\nrequire(\"./_xfBase\");\n\nvar XFind =\n/*#__PURE__*/\nfunction () {\n function XFind(f, xf) {\n this.xf = xf;\n this.f = f;\n this.found = false;\n }\n\n XFind.prototype['@@transducer/init'] = _xfBase.init;\n\n XFind.prototype['@@transducer/result'] = function (result) {\n if (!this.found) {\n result = this.xf['@@transducer/step'](result, void 0);\n }\n\n return this.xf['@@transducer/result'](result);\n };\n\n XFind.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.found = true;\n result = _reduced(this.xf['@@transducer/step'](result, input));\n }\n\n return result;\n };\n\n return XFind;\n}();\n\nvar _xfind =\n/*#__PURE__*/\n_curry2(function _xfind(f, xf) {\n return new XFind(f, xf);\n});\n\nmodule.exports = _xfind;","var _curry2 =\n/*#__PURE__*/\nrequire(\"./_curry2\");\n\nvar _xfBase =\n/*#__PURE__*/\nrequire(\"./_xfBase\");\n\nvar XMap =\n/*#__PURE__*/\nfunction () {\n function XMap(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n\n XMap.prototype['@@transducer/init'] = _xfBase.init;\n XMap.prototype['@@transducer/result'] = _xfBase.result;\n\n XMap.prototype['@@transducer/step'] = function (result, input) {\n return this.xf['@@transducer/step'](result, this.f(input));\n };\n\n return XMap;\n}();\n\nvar _xmap =\n/*#__PURE__*/\n_curry2(function _xmap(f, xf) {\n return new XMap(f, xf);\n});\n\nmodule.exports = _xmap;","var XWrap =\n/*#__PURE__*/\nfunction () {\n function XWrap(fn) {\n this.f = fn;\n }\n\n XWrap.prototype['@@transducer/init'] = function () {\n throw new Error('init not implemented on XWrap');\n };\n\n XWrap.prototype['@@transducer/result'] = function (acc) {\n return acc;\n };\n\n XWrap.prototype['@@transducer/step'] = function (acc, x) {\n return this.f(acc, x);\n };\n\n return XWrap;\n}();\n\nfunction _xwrap(fn) {\n return new XWrap(fn);\n}\n\nmodule.exports = _xwrap;","var _curry1 =\n/*#__PURE__*/\nrequire(\"./internal/_curry1\");\n\nvar _has =\n/*#__PURE__*/\nrequire(\"./internal/_has\");\n\nvar _isArguments =\n/*#__PURE__*/\nrequire(\"./internal/_isArguments\"); // cover IE < 9 keys issues\n\n\nvar hasEnumBug = !\n/*#__PURE__*/\n{\n toString: null\n}.propertyIsEnumerable('toString');\nvar nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString']; // Safari bug\n\nvar hasArgsEnumBug =\n/*#__PURE__*/\nfunction () {\n 'use strict';\n\n return arguments.propertyIsEnumerable('length');\n}();\n\nvar contains = function contains(list, item) {\n var idx = 0;\n\n while (idx < list.length) {\n if (list[idx] === item) {\n return true;\n }\n\n idx += 1;\n }\n\n return false;\n};\n/**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @see R.keysIn, R.values\n * @example\n *\n * R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\n\n\nvar keys = typeof Object.keys === 'function' && !hasArgsEnumBug ?\n/*#__PURE__*/\n_curry1(function keys(obj) {\n return Object(obj) !== obj ? [] : Object.keys(obj);\n}) :\n/*#__PURE__*/\n_curry1(function keys(obj) {\n if (Object(obj) !== obj) {\n return [];\n }\n\n var prop, nIdx;\n var ks = [];\n\n var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n\n for (prop in obj) {\n if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n ks[ks.length] = prop;\n }\n }\n\n if (hasEnumBug) {\n nIdx = nonEnumerableProps.length - 1;\n\n while (nIdx >= 0) {\n prop = nonEnumerableProps[nIdx];\n\n if (_has(prop, obj) && !contains(ks, prop)) {\n ks[ks.length] = prop;\n }\n\n nIdx -= 1;\n }\n }\n\n return ks;\n});\nmodule.exports = keys;","var _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n\nvar _dispatchable =\n/*#__PURE__*/\nrequire(\"./internal/_dispatchable\");\n\nvar _map =\n/*#__PURE__*/\nrequire(\"./internal/_map\");\n\nvar _reduce =\n/*#__PURE__*/\nrequire(\"./internal/_reduce\");\n\nvar _xmap =\n/*#__PURE__*/\nrequire(\"./internal/_xmap\");\n\nvar curryN =\n/*#__PURE__*/\nrequire(\"./curryN\");\n\nvar keys =\n/*#__PURE__*/\nrequire(\"./keys\");\n/**\n * Takes a function and\n * a [functor](https://github.com/fantasyland/fantasy-land#functor),\n * applies the function to each of the functor's values, and returns\n * a functor of the same shape.\n *\n * Ramda provides suitable `map` implementations for `Array` and `Object`,\n * so this function may be applied to `[1, 2, 3]` or `{x: 1, y: 2, z: 3}`.\n *\n * Dispatches to the `map` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * Also treats functions as functors and will compose them together.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => (a -> b) -> f a -> f b\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {Array} list The list to be iterated over.\n * @return {Array} The new list.\n * @see R.transduce, R.addIndex\n * @example\n *\n * const double = x => x * 2;\n *\n * R.map(double, [1, 2, 3]); //=> [2, 4, 6]\n *\n * R.map(double, {x: 1, y: 2, z: 3}); //=> {x: 2, y: 4, z: 6}\n * @symb R.map(f, [a, b]) = [f(a), f(b)]\n * @symb R.map(f, { x: a, y: b }) = { x: f(a), y: f(b) }\n * @symb R.map(f, functor_o) = functor_o.map(f)\n */\n\n\nvar map =\n/*#__PURE__*/\n_curry2(\n/*#__PURE__*/\n_dispatchable(['fantasy-land/map', 'map'], _xmap, function map(fn, functor) {\n switch (Object.prototype.toString.call(functor)) {\n case '[object Function]':\n return curryN(functor.length, function () {\n return fn.call(this, functor.apply(this, arguments));\n });\n\n case '[object Object]':\n return _reduce(function (acc, key) {\n acc[key] = fn(functor[key]);\n return acc;\n }, {}, keys(functor));\n\n default:\n return _map(fn, functor);\n }\n}));\n\nmodule.exports = map;","var _curry3 =\n/*#__PURE__*/\nrequire(\"./internal/_curry3\");\n\nvar _reduce =\n/*#__PURE__*/\nrequire(\"./internal/_reduce\");\n/**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It may use\n * [`R.reduced`](#reduced) to shortcut the iteration.\n *\n * The arguments' order of [`reduceRight`](#reduceRight)'s iterator function\n * is *(value, acc)*.\n *\n * Note: `R.reduce` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce#Description\n *\n * Dispatches to the `reduce` method of the third argument, if present. When\n * doing so, it is up to the user to handle the [`R.reduced`](#reduced)\n * shortcuting, as this is not implemented by `reduce`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduced, R.addIndex, R.reduceRight\n * @example\n *\n * R.reduce(R.subtract, 0, [1, 2, 3, 4]) // => ((((0 - 1) - 2) - 3) - 4) = -10\n * // - -10\n * // / \\ / \\\n * // - 4 -6 4\n * // / \\ / \\\n * // - 3 ==> -3 3\n * // / \\ / \\\n * // - 2 -1 2\n * // / \\ / \\\n * // 0 1 0 1\n *\n * @symb R.reduce(f, a, [b, c, d]) = f(f(f(a, b), c), d)\n */\n\n\nvar reduce =\n/*#__PURE__*/\n_curry3(_reduce);\n\nmodule.exports = reduce;","var _complement =\n/*#__PURE__*/\nrequire(\"./internal/_complement\");\n\nvar _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n\nvar filter =\n/*#__PURE__*/\nrequire(\"./filter\");\n/**\n * The complement of [`filter`](#filter).\n *\n * Acts as a transducer if a transformer is given in list position. Filterable\n * objects include plain objects or any object that has a filter method such\n * as `Array`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.filter, R.transduce, R.addIndex\n * @example\n *\n * const isOdd = (n) => n % 2 === 1;\n *\n * R.reject(isOdd, [1, 2, 3, 4]); //=> [2, 4]\n *\n * R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\n\n\nvar reject =\n/*#__PURE__*/\n_curry2(function reject(pred, filterable) {\n return filter(_complement(pred), filterable);\n});\n\nmodule.exports = reject;","var _curry1 =\n/*#__PURE__*/\nrequire(\"./internal/_curry1\");\n\nvar _has =\n/*#__PURE__*/\nrequire(\"./internal/_has\");\n/**\n * Converts an object into an array of key, value arrays. Only the object's\n * own properties are used.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own properties.\n * @see R.fromPairs\n * @example\n *\n * R.toPairs({a: 1, b: 2, c: 3}); //=> [['a', 1], ['b', 2], ['c', 3]]\n */\n\n\nvar toPairs =\n/*#__PURE__*/\n_curry1(function toPairs(obj) {\n var pairs = [];\n\n for (var prop in obj) {\n if (_has(prop, obj)) {\n pairs[pairs.length] = [prop, obj[prop]];\n }\n }\n\n return pairs;\n});\n\nmodule.exports = toPairs;","var _curry1 =\n/*#__PURE__*/\nrequire(\"./internal/_curry1\");\n/**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n * R.type({}); //=> \"Object\"\n * R.type(1); //=> \"Number\"\n * R.type(false); //=> \"Boolean\"\n * R.type('s'); //=> \"String\"\n * R.type(null); //=> \"Null\"\n * R.type([]); //=> \"Array\"\n * R.type(/[A-z]/); //=> \"RegExp\"\n * R.type(() => {}); //=> \"Function\"\n * R.type(undefined); //=> \"Undefined\"\n */\n\n\nvar type =\n/*#__PURE__*/\n_curry1(function type(val) {\n return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n});\n\nmodule.exports = type;"],"names":["_concat","_curry1","curryN","addIndex","fn","length","idx","origFn","arguments","list","args","Array","prototype","slice","call","result","apply","this","module","exports","_arity","bind","_curry2","thisObj","_curryN","_equals","equals","a","b","_dispatchable","_filter","_isObject","_reduce","_xfilter","keys","filter","pred","filterable","acc","key","find","len","_checkForMethod","forEach","_includes","includes","n","a0","a1","a2","a3","a4","a5","a6","a7","a8","a9","Error","_arrayFromIterator","iter","next","done","push","value","_isArray","methodname","obj","_complement","f","set1","set2","len1","len2","_isPlaceholder","f1","f2","_b","_a","_curry3","f3","c","_c","received","combined","argsIdx","left","combinedIdx","_isTransformer","methodNames","xf","pop","transducer","_includesWith","_functionName","_has","_objectIs","type","_uniqContentEquals","aIterator","bIterator","stackA","stackB","eq","aItem","typeA","constructor","valueOf","name","message","source","global","ignoreCase","multiline","sticky","unicode","size","entries","concat","values","keysA","extendedStackA","extendedStackB","match","String","prop","Object","hasOwnProperty","_indexOf","x","inf","item","indexOf","toString","_isArguments","isArray","val","_isString","_isArrayLike","isArrayLike","nodeType","_map","functor","is","_xwrap","_iterableReduce","step","_methodReduce","methodName","symIterator","Symbol","iterator","_arrayReduce","reduce","TypeError","_reduced","init","_xfBase","XFilter","input","XFind","found","_xfind","XMap","_xmap","XWrap","hasEnumBug","propertyIsEnumerable","nonEnumerableProps","hasArgsEnumBug","contains","nIdx","ks","checkArgsLength","map","reject","toPairs","pairs","undefined"],"sourceRoot":""}