| 1 | {"version":3,"sources":["../source/leemon.js"],"names":["bpe","mask","radix","digitsStr","one","int2bigInt","t","Array","ss","s0","s1","s2","s3","s4","s5","s6","s7","T","sa","mr_x1","mr_r","mr_a","eg_v","eg_u","eg_A","eg_B","eg_C","eg_D","md_q1","md_q2","md_q3","md_r","md_r1","md_r2","md_tt","primes","pows","s_i","s_i2","s_R","s_rm","s_q","s_n1","s_a","s_r2","s_n","s_b","s_d","s_x1","s_x2","s_aa","rpprb","k","buff","findPrimes","n","i","s","p","ans","millerRabinInt","x","b","length","dup","copyInt_","millerRabin","j","copy_","addInt_","rightShift_","powMod_","equalsInt","equals","squareMod_","bitSize","z","w","expand","randTruePrime","randTruePrime_","trim","randProbPrime","randProbPrimeRounds","divisible","B","randBigInt_","modInt","greater","mod","mod_","addInt","mult","y","mult_","powMod","sub","sub_","add","add_","inverseMod","inverseMod_","multMod","multMod_","c","m","pm","dd","r","zz","recSize","Math","pow","recLimit","floor","random","carry_","divide_","multInt_","isZero","GCD_","randBigInt","a","GCD","xc","yc","xp","yp","A","C","D","q","sing","qp","linComb_","max","halve_","negative","inverseModInt","inverseModInt_","eGCD_","v","g","leftShift_","greaterShift","shift","kx","ky","y1","y2","subShift_","linCombShift_","addShift_","bits","minSize","ceil","str2bigInt","base","d","kk","parseInt","indexOf","substring","bigInt2str","divInt_","ys","kn","k1","k2","np","mont_","ui","ks"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,OAAO,IAAIA,MAAI,CAAR,C,CAAmB;AAC1B,IAAIC,OAAK,CAAT,C,CAAmB;AACnB,IAAIC,QAAMD,OAAK,CAAf,C,CAAmB;;AAEnB;AACA,IAAIE,YAAU,oGAAd;;AAEA;AACA,KAAKH,MAAI,CAAT,EAAa,KAAIA,MAAI,CAAT,GAAgB,KAAGA,GAA/B,EAAqCA,KAArC,CAA2C,C,CAAG;AAC9CA,QAAM,CAAN,C,CAA2B;AAC3BC,OAAK,CAAC,KAAGD,GAAJ,IAAS,CAAd,C,CAA2B;AAC3BE,QAAMD,OAAK,CAAX,C,CAA2B;AAC3B,OAAO,IAAIG,MAAIC,WAAW,CAAX,EAAa,CAAb,EAAe,CAAf,CAAR,C,CAA+B;;AAEtC;AACA;AACA,IAAIC,IAAE,IAAIC,KAAJ,CAAU,CAAV,CAAN;AACA,IAAIC,KAAGF,CAAP,C,CAAgB;AAChB,IAAIG,KAAGH,CAAP,C,CAAgB;AAChB,IAAII,KAAGJ,CAAP,C,CAAgB;AAChB,IAAIK,KAAGL,CAAP,C,CAAgB;AAChB,IAAIM,KAAGN,CAAP,C,CAAgB;AAChB,IAAIO,KAAGP,CAAP;AAAA,IAAUQ,KAAGR,CAAb,C,CAAgB;AAChB,IAAIS,KAAGT,CAAP,C,CAAgB;AAChB,IAAIU,KAAGV,CAAP,C,CAAgB;AAChB,IAAIW,IAAEX,CAAN,C,CAAgB;AAChB,IAAIY,KAAGZ,CAAP,C,CAAgB;AAChB,IAAIa,QAAMb,CAAV;AAAA,IAAac,OAAKd,CAAlB;AAAA,IAAqBe,OAAKf,CAA1B;AAAA,IAAkE;AAClEgB,OAAKhB,CADL;AAAA,IACQiB,OAAKjB,CADb;AAAA,IACgBkB,OAAKlB,CADrB;AAAA,IACwBmB,OAAKnB,CAD7B;AAAA,IACgCoB,OAAKpB,CADrC;AAAA,IACwCqB,OAAKrB,CAD7C;AAAA,IAC8D;AAC9DsB,QAAMtB,CAFN;AAAA,IAESuB,QAAMvB,CAFf;AAAA,IAEkBwB,QAAMxB,CAFxB;AAAA,IAE2ByB,OAAKzB,CAFhC;AAAA,IAEmC0B,QAAM1B,CAFzC;AAAA,IAE4C2B,QAAM3B,CAFlD;AAAA,IAEqD4B,QAAM5B,CAF3D;AAAA,IAE8D;;AAE9D6B,SAAO7B,CAJP;AAAA,IAIU8B,OAAK9B,CAJf;AAAA,IAIkB+B,MAAI/B,CAJtB;AAAA,IAIyBgC,OAAKhC,CAJ9B;AAAA,IAIiCiC,MAAIjC,CAJrC;AAAA,IAIwCkC,OAAKlC,CAJ7C;AAAA,IAIgDmC,MAAInC,CAJpD;AAAA,IAIuDoC,OAAKpC,CAJ5D;AAAA,IAKEqC,MAAIrC,CALN;AAAA,IAKSsC,OAAKtC,CALd;AAAA,IAKiBuC,MAAIvC,CALrB;AAAA,IAKwBwC,MAAIxC,CAL5B;AAAA,IAK+ByC,MAAIzC,CALnC;AAAA,IAKsC0C,OAAK1C,CAL3C;AAAA,IAK8C2C,OAAK3C,CALnD;AAAA,IAKsD4C,OAAK5C,CAL3D;AAAA,IAK8D;;AAE9D6C,QAAM7C,CAPN,C,CAOS;;AAET;;AAEA,IAAI8C,CAAJ,EAAOC,IAAP;;AAEA;AACA,SAASC,UAAT,CAAoBC,CAApB,EAAuB;AACrB,MAAIC,CAAJ,EAAMC,CAAN,EAAQC,CAAR,EAAUC,GAAV;AACAF,MAAE,IAAIlD,KAAJ,CAAUgD,CAAV,CAAF;AACA,OAAKC,IAAE,CAAP,EAASA,IAAED,CAAX,EAAaC,GAAb,EACEC,EAAED,CAAF,IAAK,CAAL;AACFC,IAAE,CAAF,IAAK,CAAL;AACAC,MAAE,CAAF,CANqB,CAMb;AACR,SAAKD,EAAEC,CAAF,IAAKH,CAAV,GAAc;AAAmB;AAC/B,SAAIC,IAAEC,EAAEC,CAAF,IAAKD,EAAEC,CAAF,CAAX,EAAiBF,IAAED,CAAnB,EAAsBC,KAAGC,EAAEC,CAAF,CAAzB,EAA+B;AAC7BD,MAAED,CAAF,IAAK,CAAL;AACFE;AACAD,MAAEC,CAAF,IAAKD,EAAEC,IAAE,CAAJ,IAAO,CAAZ;AACA,WAAMD,EAAEC,CAAF,IAAKH,CAAL,IAAUE,EAAEA,EAAEC,CAAF,CAAF,CAAhB,EAAyBD,EAAEC,CAAF,GAAzB,CAAgC,CALpB,CAKsB;AACnC;AACDC,QAAI,IAAIpD,KAAJ,CAAUmD,CAAV,CAAJ;AACA,OAAIF,IAAE,CAAN,EAAQA,IAAEE,CAAV,EAAYF,GAAZ,EACEG,IAAIH,CAAJ,IAAOC,EAAED,CAAF,CAAP;AACF,SAAOG,GAAP;AACD;;AAGD;AACA;AACA,SAASC,cAAT,CAAwBC,CAAxB,EAA0BC,CAA1B,EAA6B;AAC3B,MAAI3C,MAAM4C,MAAN,IAAcF,EAAEE,MAApB,EAA4B;AAC1B5C,YAAM6C,IAAIH,CAAJ,CAAN;AACAzC,WAAK4C,IAAIH,CAAJ,CAAL;AACAxC,WAAK2C,IAAIH,CAAJ,CAAL;AACD;;AAEDI,WAAS5C,IAAT,EAAcyC,CAAd;AACA,SAAOI,YAAYL,CAAZ,EAAcxC,IAAd,CAAP;AACD;;AAED;AACA;AACA,SAAS6C,WAAT,CAAqBL,CAArB,EAAuBC,CAAvB,EAA0B;AACxB,MAAIN,CAAJ,EAAMW,CAAN,EAAQf,CAAR,EAAUK,CAAV;;AAEA,MAAItC,MAAM4C,MAAN,IAAcF,EAAEE,MAApB,EAA4B;AAC1B5C,YAAM6C,IAAIH,CAAJ,CAAN;AACAzC,WAAK4C,IAAIH,CAAJ,CAAL;AACAxC,WAAK2C,IAAIH,CAAJ,CAAL;AACD;;AAEDO,QAAM/C,IAAN,EAAWyC,CAAX;AACAM,QAAMhD,IAAN,EAAWyC,CAAX;AACAO,QAAMjD,KAAN,EAAY0C,CAAZ;;AAEAQ,UAAQjD,IAAR,EAAa,CAAC,CAAd;AACAiD,UAAQlD,KAAR,EAAc,CAAC,CAAf;;AAEA;AACAiC,MAAE,CAAF;AACA,OAAKI,IAAE,CAAP,EAASA,IAAEpC,KAAK2C,MAAhB,EAAuBP,GAAvB,EACE,KAAKW,IAAE,CAAP,EAASA,IAAElE,IAAX,EAAgBkE,MAAI,CAApB,EACE,IAAIN,EAAEL,CAAF,IAAOW,CAAX,EAAc;AACZV,QAAGL,IAAEhC,KAAK2C,MAAL,GAAY/D,GAAd,GAAoBoD,CAApB,GAAwB,CAA3B;AACCI,QAAEpC,KAAK2C,MAAP;AACAI,QAAElE,IAAF;AACF,GAJD,MAKEmD;;AAEN,MAAIK,CAAJ,EACEa,YAAYlD,IAAZ,EAAiBqC,CAAjB;;AAEFc,UAAQlD,IAAR,EAAaD,IAAb,EAAkByC,CAAlB;;AAEA,MAAI,CAACW,UAAUnD,IAAV,EAAe,CAAf,CAAD,IAAsB,CAACoD,OAAOpD,IAAP,EAAYF,KAAZ,CAA3B,EAA+C;AAC7CgD,QAAE,CAAF;AACA,WAAOA,KAAGV,IAAE,CAAL,IAAU,CAACgB,OAAOpD,IAAP,EAAYF,KAAZ,CAAlB,EAAsC;AACpCuD,iBAAWrD,IAAX,EAAgBwC,CAAhB;AACA,UAAIW,UAAUnD,IAAV,EAAe,CAAf,CAAJ,EAAuB;AACrB,eAAO,CAAP;AACD;AACD8C;AACD;AACD,QAAI,CAACM,OAAOpD,IAAP,EAAYF,KAAZ,CAAL,EAAyB;AACvB,aAAO,CAAP;AACD;AACF;AACD,SAAO,CAAP;AACD;;AAED;AACA,SAASwD,OAAT,CAAiBd,CAAjB,EAAoB;AAClB,MAAIM,CAAJ,EAAMS,CAAN,EAAQC,CAAR;AACA,OAAKV,IAAEN,EAAEE,MAAF,GAAS,CAAhB,EAAoBF,EAAEM,CAAF,KAAM,CAAP,IAAcA,IAAE,CAAnC,EAAuCA,GAAvC,CAA2C;AAC3C,OAAKS,IAAE,CAAF,EAAIC,IAAEhB,EAAEM,CAAF,CAAX,EAAiBU,CAAjB,EAAqBA,MAAI,CAAL,EAAQD,GAA5B,CAAgC;AAChCA,OAAG5E,MAAImE,CAAP;AACA,SAAOS,CAAP;AACD;;AAED;AACA,SAASE,MAAT,CAAgBjB,CAAhB,EAAkBN,CAAlB,EAAqB;AACnB,MAAII,MAAItD,WAAW,CAAX,EAAa,CAACwD,EAAEE,MAAF,GAASR,CAAT,GAAaM,EAAEE,MAAf,GAAwBR,CAAzB,IAA4BvD,GAAzC,EAA6C,CAA7C,CAAR;AACAoE,QAAMT,GAAN,EAAUE,CAAV;AACA,SAAOF,GAAP;AACD;;AAED;AACA,SAASoB,aAAT,CAAuB3B,CAAvB,EAA0B;AACxB,MAAIO,MAAItD,WAAW,CAAX,EAAa+C,CAAb,EAAe,CAAf,CAAR;AACA4B,iBAAerB,GAAf,EAAmBP,CAAnB;AACA,SAAO6B,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,SAASuB,aAAT,CAAuB9B,CAAvB,EAA0B;AACxB,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,CAAtB,CAAP,CADY,CACqB;AAC7C,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,CAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,CAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,CAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,CAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,CAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,EAAtB,CAAP,CAPY,CAOsB;AAC9C,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,EAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,EAAtB,CAAP;AACZ,MAAIA,KAAG,GAAP,EAAY,OAAO+B,oBAAoB/B,CAApB,EAAsB,EAAtB,CAAP;AACA,SAAO+B,oBAAoB/B,CAApB,EAAsB,EAAtB,CAAP,CAXY,CAWsB;AAC/C;;AAED;AACA,SAAS+B,mBAAT,CAA6B/B,CAA7B,EAA+BG,CAA/B,EAAkC;AAChC,MAAII,GAAJ,EAASH,CAAT,EAAY4B,SAAZ,EAAuBC,CAAvB;AACAA,MAAE,KAAF,CAFgC,CAEtB;AACV1B,QAAItD,WAAW,CAAX,EAAa+C,CAAb,EAAe,CAAf,CAAJ;;AAEA;;AAEA,MAAIjB,OAAO4B,MAAP,IAAe,CAAnB,EACE5B,SAAOmB,WAAW,KAAX,CAAP,CAR8B,CAQH;;AAE7B,MAAIH,MAAMY,MAAN,IAAcJ,IAAII,MAAtB,EACEZ,QAAMa,IAAIL,GAAJ,CAAN;;AAEF,WAAS;AAAE;AACT;AACA;AACA;;AAEA2B,gBAAY3B,GAAZ,EAAgBP,CAAhB,EAAkB,CAAlB,EALO,CAKe;AACtBO,QAAI,CAAJ,KAAU,CAAV;AACAyB,gBAAU,CAAV;;AAEA;AACA,SAAK5B,IAAE,CAAP,EAAWA,IAAErB,OAAO4B,MAAV,IAAsB5B,OAAOqB,CAAP,KAAW6B,CAA3C,EAA+C7B,GAA/C,EACE,IAAI+B,OAAO5B,GAAP,EAAWxB,OAAOqB,CAAP,CAAX,KAAuB,CAAvB,IAA4B,CAACgB,UAAUb,GAAV,EAAcxB,OAAOqB,CAAP,CAAd,CAAjC,EAA2D;AACzD4B,kBAAU,CAAV;AACA;AACD;;AAEH;;AAEA;AACA,SAAK5B,IAAE,CAAP,EAAUA,IAAED,CAAF,IAAO,CAAC6B,SAAlB,EAA6B5B,GAA7B,EAAkC;AAChC8B,kBAAYnC,KAAZ,EAAkBC,CAAlB,EAAoB,CAApB;AACA,aAAM,CAACoC,QAAQ7B,GAAR,EAAYR,KAAZ,CAAP,EAA2B;AACzBmC,kBAAYnC,KAAZ,EAAkBC,CAAlB,EAAoB,CAApB;AACF,UAAI,CAACc,YAAYP,GAAZ,EAAgBR,KAAhB,CAAL,EACEiC,YAAU,CAAV;AACH;;AAED,QAAG,CAACA,SAAJ,EACE,OAAOzB,GAAP;AACH;AACF;;AAED;AACA,SAAS8B,GAAT,CAAa5B,CAAb,EAAeN,CAAf,EAAkB;AAChB,MAAII,MAAIK,IAAIH,CAAJ,CAAR;AACA6B,OAAK/B,GAAL,EAASJ,CAAT;AACA,SAAO0B,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,SAASgC,MAAT,CAAgB9B,CAAhB,EAAkBN,CAAlB,EAAqB;AACnB,MAAII,MAAImB,OAAOjB,CAAP,EAASA,EAAEE,MAAF,GAAS,CAAlB,CAAR;AACAM,UAAQV,GAAR,EAAYJ,CAAZ;AACA,SAAO0B,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,SAASiC,IAAT,CAAc/B,CAAd,EAAgBgC,CAAhB,EAAmB;AACjB,MAAIlC,MAAImB,OAAOjB,CAAP,EAASA,EAAEE,MAAF,GAAS8B,EAAE9B,MAApB,CAAR;AACA+B,QAAMnC,GAAN,EAAUkC,CAAV;AACA,SAAOZ,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,OAAO,SAASoC,MAAT,CAAgBlC,CAAhB,EAAkBgC,CAAlB,EAAoBtC,CAApB,EAAuB;AAC5B,MAAII,MAAImB,OAAOjB,CAAP,EAASN,EAAEQ,MAAX,CAAR;AACAQ,UAAQZ,GAAR,EAAYsB,KAAKY,CAAL,EAAO,CAAP,CAAZ,EAAsBZ,KAAK1B,CAAL,EAAO,CAAP,CAAtB,EAAgC,CAAhC,EAF4B,CAES;AACrC,SAAO0B,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,SAASqC,GAAT,CAAanC,CAAb,EAAegC,CAAf,EAAkB;AAChB,MAAIlC,MAAImB,OAAOjB,CAAP,EAAUA,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAF,GAAS,CAA7B,GAAiC8B,EAAE9B,MAAF,GAAS,CAApD,CAAR;AACAkC,OAAKtC,GAAL,EAASkC,CAAT;AACA,SAAOZ,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,SAASuC,GAAT,CAAarC,CAAb,EAAegC,CAAf,EAAkB;AAChB,MAAIlC,MAAImB,OAAOjB,CAAP,EAAUA,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAF,GAAS,CAA7B,GAAiC8B,EAAE9B,MAAF,GAAS,CAApD,CAAR;AACAoC,OAAKxC,GAAL,EAASkC,CAAT;AACA,SAAOZ,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA,SAASyC,UAAT,CAAoBvC,CAApB,EAAsBN,CAAtB,EAAyB;AACvB,MAAII,MAAImB,OAAOjB,CAAP,EAASN,EAAEQ,MAAX,CAAR;AACA,MAAIN,CAAJ;AACAA,MAAE4C,YAAY1C,GAAZ,EAAgBJ,CAAhB,CAAF;AACA,SAAOE,IAAIwB,KAAKtB,GAAL,EAAS,CAAT,CAAJ,GAAkB,IAAzB;AACD;;AAED;AACA,SAAS2C,OAAT,CAAiBzC,CAAjB,EAAmBgC,CAAnB,EAAqBtC,CAArB,EAAwB;AACtB,MAAII,MAAImB,OAAOjB,CAAP,EAASN,EAAEQ,MAAX,CAAR;AACAwC,WAAS5C,GAAT,EAAakC,CAAb,EAAetC,CAAf;AACA,SAAO0B,KAAKtB,GAAL,EAAS,CAAT,CAAP;AACD;;AAED;AACA;AACA,SAASqB,cAAT,CAAwBrB,GAAxB,EAA4BP,CAA5B,EAA+B;AAC7B,MAAIoD,CAAJ,EAAMC,CAAN,EAAQC,EAAR,EAAWC,EAAX,EAAcxC,CAAd,EAAgByC,CAAhB,EAAkBvB,CAAlB,EAAoBD,SAApB,EAA8BR,CAA9B,EAAgCiC,EAAhC,EAAmCC,OAAnC;;AAEA,MAAI3E,OAAO4B,MAAP,IAAe,CAAnB,EACE5B,SAAOmB,WAAW,KAAX,CAAP,CAJ2B,CAIA;;AAE7B,MAAIlB,KAAK2B,MAAL,IAAa,CAAjB,EAAoB;AAClB3B,WAAK,IAAI7B,KAAJ,CAAU,GAAV,CAAL;AACA,SAAK4D,IAAE,CAAP,EAASA,IAAE,GAAX,EAAeA,GAAf,EAAoB;AAClB/B,WAAK+B,CAAL,IAAQ4C,KAAKC,GAAL,CAAS,CAAT,EAAW7C,IAAE,IAAF,GAAO,EAAlB,CAAR;AACD;AACF;;AAED;AACAqC,MAAE,GAAF,CAd6B,CAcrB;AACRC,MAAE,EAAF,CAf6B,CAerB;AACRQ,aAAS,EAAT,CAhB6B,CAgBhB;;AAEb,MAAI3E,KAAKyB,MAAL,IAAaJ,IAAII,MAArB,EAA6B;AAC3BzB,WAAK0B,IAAIL,GAAJ,CAAL;AACApB,UAAKyB,IAAIL,GAAJ,CAAL;AACAjB,WAAKsB,IAAIL,GAAJ,CAAL;AACAf,WAAKoB,IAAIL,GAAJ,CAAL;AACAZ,UAAKiB,IAAIL,GAAJ,CAAL;AACAX,WAAKgB,IAAIL,GAAJ,CAAL;AACAV,WAAKe,IAAIL,GAAJ,CAAL;AACAb,UAAKkB,IAAIL,GAAJ,CAAL;AACAd,UAAKmB,IAAIL,GAAJ,CAAL;AACAtB,UAAK2B,IAAIL,GAAJ,CAAL;AACAnB,WAAKwB,IAAIL,GAAJ,CAAL;AACAlB,UAAKuB,IAAIL,GAAJ,CAAL;AACAhB,UAAKqB,IAAIL,GAAJ,CAAL;AACAT,WAAKc,IAAIL,GAAJ,CAAL;AACD;;AAED,MAAIP,KAAK6D,QAAT,EAAmB;AAAG;AACpBP,SAAG,CAAC,MAAKtD,IAAE,CAAH,IAAO,CAAX,CAAD,IAAgB,CAAnB,CADiB,CACK;AACtBa,aAASN,GAAT,EAAa,CAAb;AACA,SAAKgD,KAAG,CAAR,EAAUA,EAAV,GAAe;AACbA,WAAG,CAAH;AACAhD,UAAI,CAAJ,IAAQ,IAAK,KAAIP,IAAE,CAAX,GAAiB2D,KAAKG,KAAL,CAAWH,KAAKI,MAAL,MAAe,KAAG/D,CAAlB,CAAX,CAAzB,CAFa,CAE+C;AAC5D,WAAKe,IAAE,CAAP,EAAUA,IAAEhC,OAAO4B,MAAV,IAAsB,CAAC5B,OAAOgC,CAAP,IAAUuC,EAAX,KAAgBvE,OAAOgC,CAAP,CAA/C,EAA0DA,GAA1D,EAA+D;AAAE;AAC/D,YAAI,KAAIR,IAAI,CAAJ,IAAOxB,OAAOgC,CAAP,CAAf,EAA2B;AACzBwC,eAAG,CAAH;AACA;AACD;AACF;AACF;AACDS,WAAOzD,GAAP;AACA;AACD;;AAED0B,MAAEmB,IAAEpD,CAAF,GAAIA,CAAN,CApD6B,CAoDjB;AACZ,MAAIA,IAAE,IAAEqD,CAAR,EAAY;AACV,SAAKG,IAAE,CAAP,EAAUxD,IAAEA,IAAEwD,CAAJ,IAAOH,CAAjB,GACEG,IAAExE,KAAK2E,KAAKG,KAAL,CAAWH,KAAKI,MAAL,KAAc,GAAzB,CAAL,CAAF,CAFJ,CAE6C;AAF7C,OAIEP,IAAE,EAAF;;AAEF;;AAEAE,YAAQC,KAAKG,KAAL,CAAWN,IAAExD,CAAb,IAAgB,CAAxB;;AAEA4B,iBAAevC,GAAf,EAAmBqE,OAAnB;AACA7C,WAAS3B,IAAT,EAAc,CAAd;AACAA,OAAKyE,KAAKG,KAAL,CAAW,CAAC9D,IAAE,CAAH,IAAMpD,GAAjB,CAAL,KAAgC,KAAI,CAACoD,IAAE,CAAH,IAAMpD,GAA1C,CAjE6B,CAiEsB;AACnDqH,UAAQ/E,IAAR,EAAaG,GAAb,EAAiBJ,GAAjB,EAAqBG,IAArB,EAlE6B,CAkEsB;;AAEnDoC,MAAED,QAAQtC,GAAR,CAAF;;AAEA,WAAS;AACP,aAAS;AAAG;AACViD,kBAAY/C,GAAZ,EAAgBqC,CAAhB,EAAkB,CAAlB;AACA,UAAIY,QAAQnD,GAAR,EAAYE,GAAZ,CAAJ,EACE;AACH,KALM,CAKU;AACjB8B,YAAQ9B,GAAR,EAAY,CAAZ,EANO,CAMU;AACjB4D,SAAK5D,GAAL,EAASF,GAAT,EAPO,CAOU;;AAEjB+B,UAAMvB,GAAN,EAAUJ,GAAV;AACAqD,UAAMjD,GAAN,EAAUN,GAAV;AACA+E,aAASzE,GAAT,EAAa,CAAb;AACAwB,YAAQxB,GAAR,EAAY,CAAZ,EAZO,CAYY;;AAEnBuB,UAAMxB,IAAN,EAAWL,GAAX;AACA+E,aAAS1E,IAAT,EAAc,CAAd,EAfO,CAeY;;AAEnB;AACA,SAAKwC,YAAU,CAAV,EAAYjB,IAAE,CAAnB,EAAuBA,IAAEhC,OAAO4B,MAAV,IAAsB5B,OAAOgC,CAAP,IAAUkB,CAAtD,EAA0DlB,GAA1D,EACE,IAAIoB,OAAO1C,GAAP,EAAWV,OAAOgC,CAAP,CAAX,KAAuB,CAAvB,IAA4B,CAACK,UAAU3B,GAAV,EAAcV,OAAOgC,CAAP,CAAd,CAAjC,EAA2D;AACzDiB,kBAAU,CAAV;AACA;AACD;;AAEH,QAAI,CAACA,SAAL,EAAmB;AACjB,UAAI,CAACxB,eAAef,GAAf,EAAmB,CAAnB,CAAL,EAA4B;AAC1BuC,oBAAU,CAAV;;AAEJ,QAAI,CAACA,SAAL,EAAgB;AAAG;AACjBf,cAAQxB,GAAR,EAAY,CAAC,CAAb;AACA,WAAKsB,IAAEtB,IAAIkB,MAAJ,GAAW,CAAlB,EAAqBlB,IAAIsB,CAAJ,KAAQ,CAAT,IAAgBA,IAAE,CAAtC,EAA0CA,GAA1C,CAA8C,CAFhC,CAEmC;AACjD,WAAK0C,KAAG,CAAH,EAAKhC,IAAEhC,IAAIsB,CAAJ,CAAZ,EAAoBU,CAApB,EAAwBA,MAAI,CAAL,EAAQgC,IAA/B,CAAoC;AACpCA,YAAI7G,MAAImE,CAAR,CAJc,CAIyB;AACvC,eAAS;AAAG;AACVmB,oBAAY3C,GAAZ,EAAgBkE,EAAhB,EAAmB,CAAnB;AACA,YAAIrB,QAAQ3C,GAAR,EAAYF,GAAZ,CAAJ,EACE;AACH,OATa,CASG;AACjB0B,cAAQxB,GAAR,EAAY,CAAZ,EAVc,CAUG;AACjBwB,cAAQ1B,GAAR,EAAY,CAAZ,EAXc,CAWG;AACjByB,YAAMtB,GAAN,EAAUH,GAAV;AACAyB,YAAM1B,IAAN,EAAWG,GAAX;AACAwB,cAAQ3B,IAAR,EAAa,CAAC,CAAd;AACA6B,cAAQzB,GAAR,EAAYJ,IAAZ,EAAiBG,GAAjB,EAfc,CAeW;AACzBwB,cAAQvB,GAAR,EAAY,CAAC,CAAb;AACA,UAAIyE,OAAOzE,GAAP,CAAJ,EAAiB;AACfsB,cAAMtB,GAAN,EAAUH,GAAV;AACA4B,gBAAQzB,GAAR,EAAYF,IAAZ,EAAiBC,GAAjB;AACAwB,gBAAQvB,GAAR,EAAY,CAAC,CAAb;AACAsB,cAAMlB,IAAN,EAAWL,GAAX;AACAuB,cAAMrB,GAAN,EAAUD,GAAV;AACA0E,aAAKzE,GAAL,EAASF,GAAT,EANe,CAMC;AAChB,YAAI2B,UAAUzB,GAAV,EAAc,CAAd,CAAJ,EAAsB;AACpBqB,gBAAMT,GAAN,EAAUT,IAAV;AACA,iBAFoB,CAER;AACb;AACF;AACF;AACF;AACF;;AAED;AACA,SAASuE,UAAT,CAAoBlE,CAApB,EAAsBE,CAAtB,EAAyB;AACvB,MAAIiE,CAAJ,EAAM5D,CAAN;AACA4D,MAAEX,KAAKG,KAAL,CAAW,CAAC3D,IAAE,CAAH,IAAMvD,GAAjB,IAAsB,CAAxB,CAFuB,CAEI;AAC3B8D,MAAEzD,WAAW,CAAX,EAAa,CAAb,EAAeqH,CAAf,CAAF;AACApC,cAAYxB,CAAZ,EAAcP,CAAd,EAAgBE,CAAhB;AACA,SAAOK,CAAP;AACD;;AAED;AACA;AACA,SAASwB,WAAT,CAAqBxB,CAArB,EAAuBP,CAAvB,EAAyBE,CAAzB,EAA4B;AAC1B,MAAID,CAAJ,EAAMkE,CAAN;AACA,OAAKlE,IAAE,CAAP,EAASA,IAAEM,EAAEC,MAAb,EAAoBP,GAApB,EACEM,EAAEN,CAAF,IAAK,CAAL;AACFkE,MAAEX,KAAKG,KAAL,CAAW,CAAC3D,IAAE,CAAH,IAAMvD,GAAjB,IAAsB,CAAxB,CAJ0B,CAIC;AAC3B,OAAKwD,IAAE,CAAP,EAASA,IAAEkE,CAAX,EAAalE,GAAb,EAAkB;AAChBM,MAAEN,CAAF,IAAKuD,KAAKG,KAAL,CAAWH,KAAKI,MAAL,MAAe,KAAInH,MAAI,CAAvB,CAAX,CAAL;AACD;AACD8D,IAAE4D,IAAE,CAAJ,KAAU,CAAC,KAAI,CAACnE,IAAE,CAAH,IAAMvD,GAAX,IAAiB,CAA3B;AACA,MAAIyD,KAAG,CAAP,EACEK,EAAE4D,IAAE,CAAJ,KAAW,KAAI,CAACnE,IAAE,CAAH,IAAMvD,GAArB;AACH;;AAED;AACA,SAAS2H,GAAT,CAAa9D,CAAb,EAAegC,CAAf,EAAkB;AAChB,MAAI+B,EAAJ,EAAOC,EAAP;AACAD,OAAG5D,IAAIH,CAAJ,CAAH;AACAgE,OAAG7D,IAAI6B,CAAJ,CAAH;AACA2B,OAAKI,EAAL,EAAQC,EAAR;AACA,SAAOD,EAAP;AACD;;AAED;AACA;AACA,SAASJ,IAAT,CAAc3D,CAAd,EAAgBgC,CAAhB,EAAmB;AACjB,MAAIrC,CAAJ,EAAMsE,EAAN,EAASC,EAAT,EAAYC,CAAZ,EAAc3C,CAAd,EAAgB4C,CAAhB,EAAkBC,CAAlB,EAAoBC,CAApB,EAAsBC,IAAtB;AACA,MAAInH,EAAE8C,MAAF,IAAUF,EAAEE,MAAhB,EACE9C,IAAE+C,IAAIH,CAAJ,CAAF;;AAEFuE,SAAK,CAAL;AACA,SAAOA,IAAP,EAAa;AAAE;AACbA,WAAK,CAAL;AACA,SAAK5E,IAAE,CAAP,EAASA,IAAEqC,EAAE9B,MAAb,EAAoBP,GAApB,EAAyB;AACvB,QAAIqC,EAAErC,CAAF,CAAJ,EAAU;AACR4E,aAAK,CAAL;AACA;AACD;AACH,QAAI,CAACA,IAAL,EAAW,MAPA,CAOO;;AAElB,SAAK5E,IAAEK,EAAEE,MAAT,EAAgB,CAACF,EAAEL,CAAF,CAAD,IAASA,KAAG,CAA5B,EAA8BA,GAA9B,CAAkC,CATvB,CAS0B;AACrCsE,SAAGjE,EAAEL,CAAF,CAAH;AACAuE,SAAGlC,EAAErC,CAAF,CAAH;AACAwE,QAAE,CAAF,CAAK3C,IAAE,CAAF,CAAK4C,IAAE,CAAF,CAAKC,IAAE,CAAF;AACf,WAAQH,KAAGE,CAAJ,IAAWF,KAAGG,CAArB,EAAyB;AACvBC,UAAGpB,KAAKG,KAAL,CAAW,CAACY,KAAGE,CAAJ,KAAQD,KAAGE,CAAX,CAAX,CAAH;AACAI,WAAGtB,KAAKG,KAAL,CAAW,CAACY,KAAGzC,CAAJ,KAAQ0C,KAAGG,CAAX,CAAX,CAAH;AACA,UAAIC,KAAGE,EAAP,EACE;AACF/H,UAAG0H,IAAEG,IAAEF,CAAP,CAAYD,IAAEC,CAAF,CAAOA,IAAE3H,CAAF,CALI,CAKI;AAC3BA,UAAG+E,IAAE8C,IAAED,CAAP,CAAY7C,IAAE6C,CAAF,CAAOA,IAAE5H,CAAF;AACnBA,UAAEwH,KAAGK,IAAEJ,EAAP,CAAWD,KAAGC,EAAH,CAAOA,KAAGzH,CAAH;AACnB;AACD,QAAI+E,CAAJ,EAAO;AACLjB,YAAMnD,CAAN,EAAQ4C,CAAR;AACAyE,eAASzE,CAAT,EAAWgC,CAAX,EAAamC,CAAb,EAAe3C,CAAf,EAFK,CAEc;AACnBiD,eAASzC,CAAT,EAAW5E,CAAX,EAAaiH,CAAb,EAAeD,CAAf,EAHK,CAGc;AACpB,KAJD,MAIO;AACLvC,WAAK7B,CAAL,EAAOgC,CAAP;AACAzB,YAAMnD,CAAN,EAAQ4C,CAAR;AACAO,YAAMP,CAAN,EAAQgC,CAAR;AACAzB,YAAMyB,CAAN,EAAQ5E,CAAR;AACD;AACF;AACD,MAAI4E,EAAE,CAAF,KAAM,CAAV,EACE;AACFvF,MAAEiF,OAAO1B,CAAP,EAASgC,EAAE,CAAF,CAAT,CAAF;AACA5B,WAASJ,CAAT,EAAWgC,EAAE,CAAF,CAAX;AACAA,IAAE,CAAF,IAAKvF,CAAL;AACA,SAAOuF,EAAE,CAAF,CAAP,EAAa;AACXhC,MAAE,CAAF,KAAMgC,EAAE,CAAF,CAAN;AACAvF,QAAEuD,EAAE,CAAF,CAAF,CAAQA,EAAE,CAAF,IAAKgC,EAAE,CAAF,CAAL,CAAWA,EAAE,CAAF,IAAKvF,CAAL;AACpB;AACF;;AAED;AACA;AACA;AACA,SAAS+F,WAAT,CAAqBxC,CAArB,EAAuBN,CAAvB,EAA0B;AACxB,MAAIH,IAAE,IAAE,IAAE2D,KAAKwB,GAAL,CAAS1E,EAAEE,MAAX,EAAkBR,EAAEQ,MAApB,CAAV;;AAEA,MAAG,EAAEF,EAAE,CAAF,IAAK,CAAP,KAAc,EAAEN,EAAE,CAAF,IAAK,CAAP,CAAjB,EAA4B;AAAG;AAC7BU,aAASJ,CAAT,EAAW,CAAX;AACA,WAAO,CAAP;AACD;;AAED,MAAItC,KAAKwC,MAAL,IAAaX,CAAjB,EAAoB;AAClB7B,WAAK,IAAIhB,KAAJ,CAAU6C,CAAV,CAAL;AACA9B,WAAK,IAAIf,KAAJ,CAAU6C,CAAV,CAAL;AACA5B,WAAK,IAAIjB,KAAJ,CAAU6C,CAAV,CAAL;AACA3B,WAAK,IAAIlB,KAAJ,CAAU6C,CAAV,CAAL;AACA1B,WAAK,IAAInB,KAAJ,CAAU6C,CAAV,CAAL;AACAzB,WAAK,IAAIpB,KAAJ,CAAU6C,CAAV,CAAL;AACD;;AAEDgB,QAAM7C,IAAN,EAAWsC,CAAX;AACAO,QAAM9C,IAAN,EAAWiC,CAAX;AACAU,WAASzC,IAAT,EAAc,CAAd;AACAyC,WAASxC,IAAT,EAAc,CAAd;AACAwC,WAASvC,IAAT,EAAc,CAAd;AACAuC,WAAStC,IAAT,EAAc,CAAd;AACA,WAAS;AACP,WAAM,EAAEJ,KAAK,CAAL,IAAQ,CAAV,CAAN,EAAoB;AAAG;AACrBiH,aAAOjH,IAAP;AACA,UAAI,EAAEC,KAAK,CAAL,IAAQ,CAAV,KAAgB,EAAEC,KAAK,CAAL,IAAQ,CAAV,CAApB,EAAkC;AAAE;AAClC+G,eAAOhH,IAAP;AACAgH,eAAO/G,IAAP;AACD,OAHD,MAGO;AACL0E,aAAK3E,IAAL,EAAU+B,CAAV,EAAeiF,OAAOhH,IAAP;AACfyE,aAAKxE,IAAL,EAAUoC,CAAV,EAAe2E,OAAO/G,IAAP;AAChB;AACF;;AAED,WAAO,EAAEH,KAAK,CAAL,IAAQ,CAAV,CAAP,EAAqB;AAAG;AACtBkH,aAAOlH,IAAP;AACA,UAAI,EAAEI,KAAK,CAAL,IAAQ,CAAV,KAAgB,EAAEC,KAAK,CAAL,IAAQ,CAAV,CAApB,EAAkC;AAAE;AAClC6G,eAAO9G,IAAP;AACA8G,eAAO7G,IAAP;AACD,OAHD,MAGO;AACLwE,aAAKzE,IAAL,EAAU6B,CAAV,EAAeiF,OAAO9G,IAAP;AACfuE,aAAKtE,IAAL,EAAUkC,CAAV,EAAe2E,OAAO7G,IAAP;AAChB;AACF;;AAED,QAAI,CAAC6D,QAAQlE,IAAR,EAAaC,IAAb,CAAL,EAAyB;AAAE;AACzB0E,WAAK1E,IAAL,EAAUD,IAAV;AACA2E,WAAKzE,IAAL,EAAUE,IAAV;AACAuE,WAAKxE,IAAL,EAAUE,IAAV;AACD,KAJD,MAIO;AAAoB;AACzBsE,WAAK3E,IAAL,EAAUC,IAAV;AACA0E,WAAKvE,IAAL,EAAUF,IAAV;AACAyE,WAAKtE,IAAL,EAAUF,IAAV;AACD;;AAED,QAAI+C,UAAUjD,IAAV,EAAe,CAAf,CAAJ,EAAuB;AACrB,aAAOkH,SAAS/G,IAAT,CAAP,EAAuB;AACrByE,WAAKzE,IAAL,EAAU6B,CAAV;AACFa,YAAMP,CAAN,EAAQnC,IAAR;;AAEA,UAAI,CAAC8C,UAAUlD,IAAV,EAAe,CAAf,CAAL,EAAwB;AAAE;AACxB2C,iBAASJ,CAAT,EAAW,CAAX;AACA,eAAO,CAAP;AACD;AACD,aAAO,CAAP;AACD;AACF;AACF;;AAED;AACA,SAAS6E,aAAT,CAAuB7E,CAAvB,EAAyBN,CAAzB,EAA4B;AAC1B,MAAImE,IAAE,CAAN;AAAA,MAAQ5D,IAAE,CAAV;AAAA,MAAYxD,CAAZ;AACA,WAAS;AACP,QAAIuD,KAAG,CAAP,EAAU,OAAO6D,CAAP;AACV,QAAI7D,KAAG,CAAP,EAAU,OAAO,CAAP;AACVC,SAAG4D,IAAEX,KAAKG,KAAL,CAAW3D,IAAEM,CAAb,CAAL;AACAN,SAAGM,CAAH;;AAEA,QAAIN,KAAG,CAAP,EAAU,OAAOO,CAAP,CANH,CAMa;AACpB,QAAIP,KAAG,CAAP,EAAU,OAAO,CAAP;AACVmE,SAAG5D,IAAEiD,KAAKG,KAAL,CAAWrD,IAAEN,CAAb,CAAL;AACAM,SAAGN,CAAH;AACD;AACF;;AAED;AACA,SAASoF,cAAT,CAAwB9E,CAAxB,EAA0BN,CAA1B,EAA6B;AAC1B,SAAOmF,cAAc7E,CAAd,EAAgBN,CAAhB,CAAP;AACF;;AAGD;AACA;AACA;AACA,OAAO,SAASqF,KAAT,CAAe/E,CAAf,EAAiBgC,CAAjB,EAAmBgD,CAAnB,EAAqBnB,CAArB,EAAuB5D,CAAvB,EAA0B;AAC/B,MAAIgF,IAAE,CAAN;AACA,MAAI1F,IAAE2D,KAAKwB,GAAL,CAAS1E,EAAEE,MAAX,EAAkB8B,EAAE9B,MAApB,CAAN;AACA,MAAIxC,KAAKwC,MAAL,IAAaX,CAAjB,EAAoB;AAClB7B,WAAK,IAAIhB,KAAJ,CAAU6C,CAAV,CAAL;AACA5B,WAAK,IAAIjB,KAAJ,CAAU6C,CAAV,CAAL;AACA3B,WAAK,IAAIlB,KAAJ,CAAU6C,CAAV,CAAL;AACA1B,WAAK,IAAInB,KAAJ,CAAU6C,CAAV,CAAL;AACAzB,WAAK,IAAIpB,KAAJ,CAAU6C,CAAV,CAAL;AACD;AACD,SAAM,EAAES,EAAE,CAAF,IAAK,CAAP,KAAc,EAAEgC,EAAE,CAAF,IAAK,CAAP,CAApB,EAA+B;AAAG;AAChC2C,WAAO3E,CAAP;AACA2E,WAAO3C,CAAP;AACAiD;AACD;AACD1E,QAAM7C,IAAN,EAAWsC,CAAX;AACAO,QAAMyE,CAAN,EAAQhD,CAAR;AACA5B,WAASzC,IAAT,EAAc,CAAd;AACAyC,WAASxC,IAAT,EAAc,CAAd;AACAwC,WAASvC,IAAT,EAAc,CAAd;AACAuC,WAAStC,IAAT,EAAc,CAAd;AACA,WAAS;AACP,WAAM,EAAEJ,KAAK,CAAL,IAAQ,CAAV,CAAN,EAAoB;AAAG;AACrBiH,aAAOjH,IAAP;AACA,UAAI,EAAEC,KAAK,CAAL,IAAQ,CAAV,KAAgB,EAAEC,KAAK,CAAL,IAAQ,CAAV,CAApB,EAAkC;AAAE;AAClC+G,eAAOhH,IAAP;AACAgH,eAAO/G,IAAP;AACD,OAHD,MAGO;AACL0E,aAAK3E,IAAL,EAAUqE,CAAV,EAAe2C,OAAOhH,IAAP;AACfyE,aAAKxE,IAAL,EAAUoC,CAAV,EAAe2E,OAAO/G,IAAP;AAChB;AACF;;AAED,WAAO,EAAEoH,EAAE,CAAF,IAAK,CAAP,CAAP,EAAkB;AAAG;AACnBL,aAAOK,CAAP;AACA,UAAI,EAAEnH,KAAK,CAAL,IAAQ,CAAV,KAAgB,EAAEC,KAAK,CAAL,IAAQ,CAAV,CAApB,EAAkC;AAAE;AAClC6G,eAAO9G,IAAP;AACA8G,eAAO7G,IAAP;AACD,OAHD,MAGO;AACLwE,aAAKzE,IAAL,EAAUmE,CAAV,EAAe2C,OAAO9G,IAAP;AACfuE,aAAKtE,IAAL,EAAUkC,CAAV,EAAe2E,OAAO7G,IAAP;AAChB;AACF;;AAED,QAAI,CAAC6D,QAAQqD,CAAR,EAAUtH,IAAV,CAAL,EAAsB;AAAE;AACtB0E,WAAK1E,IAAL,EAAUsH,CAAV;AACA5C,WAAKzE,IAAL,EAAUE,IAAV;AACAuE,WAAKxE,IAAL,EAAUE,IAAV;AACD,KAJD,MAIO;AAAiB;AACtBsE,WAAK4C,CAAL,EAAOtH,IAAP;AACA0E,WAAKvE,IAAL,EAAUF,IAAV;AACAyE,WAAKtE,IAAL,EAAUF,IAAV;AACD;AACD,QAAI+C,UAAUjD,IAAV,EAAe,CAAf,CAAJ,EAAuB;AACrB,aAAOkH,SAAS/G,IAAT,CAAP,EAAuB;AAAI;AACzByE,aAAKzE,IAAL,EAAUmE,CAAV;AACAI,aAAKtE,IAAL,EAAUkC,CAAV;AACD;AACDyD,eAAS3F,IAAT,EAAc,CAAC,CAAf,EALqB,CAKD;AACpByC,YAAMsD,CAAN,EAAQhG,IAAR;AACA0C,YAAMN,CAAN,EAAQnC,IAAR;AACAoH,iBAAWF,CAAX,EAAaC,CAAb;AACA;AACD;AACF;AACF;;AAGD;AACA,SAASL,QAAT,CAAkB5E,CAAlB,EAAqB;AACnB,SAASA,EAAEA,EAAEE,MAAF,GAAS,CAAX,KAAgB/D,MAAI,CAArB,GAAyB,CAAjC;AACD;;AAGD;AACA;AACA;AACA,SAASgJ,YAAT,CAAsBnF,CAAtB,EAAwBgC,CAAxB,EAA0BoD,KAA1B,EAAiC;AAC/B,MAAIzF,CAAJ;AAAA,MAAO0F,KAAGrF,EAAEE,MAAZ;AAAA,MAAoBoF,KAAGtD,EAAE9B,MAAzB;AACAX,MAAI8F,KAAGD,KAAJ,GAAWE,EAAZ,GAAmBD,KAAGD,KAAtB,GAA+BE,EAAjC;AACA,OAAK3F,IAAE2F,KAAG,CAAH,GAAKF,KAAZ,EAAmBzF,IAAE0F,EAAF,IAAQ1F,KAAG,CAA9B,EAAiCA,GAAjC,EACE,IAAIK,EAAEL,CAAF,IAAK,CAAT,EACE,OAAO,CAAP,CAL2B,CAKjB;AACd,OAAKA,IAAE0F,KAAG,CAAH,GAAKD,KAAZ,EAAmBzF,IAAE2F,EAArB,EAAyB3F,GAAzB,EACE,IAAIqC,EAAErC,CAAF,IAAK,CAAT,EACE,OAAO,CAAP,CAR2B,CAQjB;AACd,OAAKA,IAAEJ,IAAE,CAAT,EAAYI,KAAGyF,KAAf,EAAsBzF,GAAtB,EACE,IAASK,EAAEL,IAAEyF,KAAJ,IAAWpD,EAAErC,CAAF,CAApB,EAA0B,OAAO,CAAP,CAA1B,KACK,IAAIK,EAAEL,IAAEyF,KAAJ,IAAWpD,EAAErC,CAAF,CAAf,EAAqB,OAAO,CAAP;AAC5B,SAAO,CAAP;AACD;;AAED;AACA,OAAO,SAASgC,OAAT,CAAiB3B,CAAjB,EAAmBgC,CAAnB,EAAsB;AAC3B,MAAIrC,CAAJ;AACA,MAAIJ,IAAGS,EAAEE,MAAF,GAAS8B,EAAE9B,MAAZ,GAAsBF,EAAEE,MAAxB,GAAiC8B,EAAE9B,MAAzC;;AAEA,OAAKP,IAAEK,EAAEE,MAAT,EAAgBP,IAAEqC,EAAE9B,MAApB,EAA2BP,GAA3B,EACE,IAAIqC,EAAErC,CAAF,CAAJ,EACE,OAAO,CAAP,CANuB,CAMZ;;AAEf,OAAKA,IAAEqC,EAAE9B,MAAT,EAAgBP,IAAEK,EAAEE,MAApB,EAA2BP,GAA3B,EACE,IAAIK,EAAEL,CAAF,CAAJ,EACE,OAAO,CAAP,CAVuB,CAUZ;;AAEf,OAAKA,IAAEJ,IAAE,CAAT,EAAWI,KAAG,CAAd,EAAgBA,GAAhB,EACE,IAAIK,EAAEL,CAAF,IAAKqC,EAAErC,CAAF,CAAT,EACE,OAAO,CAAP,CADF,KAEK,IAAIK,EAAEL,CAAF,IAAKqC,EAAErC,CAAF,CAAT,EACH,OAAO,CAAP;AACJ,SAAO,CAAP;AACD;;AAED;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS6D,OAAT,CAAiBxD,CAAjB,EAAmBgC,CAAnB,EAAqBsC,CAArB,EAAuBvB,CAAvB,EAA0B;AAC/B,MAAIsC,EAAJ,EAAQC,EAAR;AACA,MAAI3F,CAAJ,EAAMW,CAAN,EAAQiF,EAAR,EAAWC,EAAX,EAAc7C,CAAd,EAAgBkB,CAAhB,EAAkB5D,CAAlB;AACAM,QAAMwC,CAAN,EAAQ/C,CAAR;AACA,OAAKsF,KAAGtD,EAAE9B,MAAV,EAAiB8B,EAAEsD,KAAG,CAAL,KAAS,CAA1B,EAA4BA,IAA5B,CAAiC,CAJF,CAII;;AAEnC;AACArF,MAAE+B,EAAEsD,KAAG,CAAL,CAAF;AACA,OAAKzB,IAAE,CAAP,EAAU5D,CAAV,EAAa4D,GAAb,EACE5D,MAAI,CAAJ;AACF4D,MAAE1H,MAAI0H,CAAN,CAV+B,CAUrB;AACVqB,aAAWlD,CAAX,EAAa6B,CAAb,EAX+B,CAWb;AAClBqB,aAAWnC,CAAX,EAAac,CAAb;;AAEA;AACA,OAAKwB,KAAGtC,EAAE7C,MAAV,EAAiB6C,EAAEsC,KAAG,CAAL,KAAS,CAAT,IAAcA,KAAGC,EAAlC,EAAqCD,IAArC,CAA0C,CAfX,CAea;;AAE5CjF,WAASkE,CAAT,EAAW,CAAX,EAjB+B,CAiBK;AACpC,SAAO,CAACa,aAAanD,CAAb,EAAee,CAAf,EAAiBsC,KAAGC,EAApB,CAAR,EAAiC;AAAG;AAClCG,cAAU1C,CAAV,EAAYf,CAAZ,EAAcqD,KAAGC,EAAjB,EAD+B,CACG;AAClChB,MAAEe,KAAGC,EAAL,IAF+B,CAEG;AACnC,GArB8B,CAqBK;;AAEpC,OAAK3F,IAAE0F,KAAG,CAAV,EAAa1F,KAAG2F,EAAhB,EAAoB3F,GAApB,EAAyB;AACvB,QAAIoD,EAAEpD,CAAF,KAAMqC,EAAEsD,KAAG,CAAL,CAAV,EACEhB,EAAE3E,IAAE2F,EAAJ,IAAQlJ,IAAR,CADF,KAGEkI,EAAE3E,IAAE2F,EAAJ,IAAQpC,KAAKG,KAAL,CAAW,CAACN,EAAEpD,CAAF,IAAKtD,KAAL,GAAW0G,EAAEpD,IAAE,CAAJ,CAAZ,IAAoBqC,EAAEsD,KAAG,CAAL,CAA/B,CAAR;;AAEF;AACA;AACA;AACA;AACA;AACA,aAAS;AACPE,WAAG,CAACF,KAAG,CAAH,GAAOtD,EAAEsD,KAAG,CAAL,CAAP,GAAiB,CAAlB,IAAqBhB,EAAE3E,IAAE2F,EAAJ,CAAxB;AACA3C,UAAE6C,MAAIrJ,GAAN;AACAqJ,WAAGA,KAAKpJ,IAAR;AACAmJ,WAAG5C,IAAE2B,EAAE3E,IAAE2F,EAAJ,IAAQtD,EAAEsD,KAAG,CAAL,CAAb;AACA3C,UAAE4C,MAAIpJ,GAAN;AACAoJ,WAAGA,KAAKnJ,IAAR;;AAEA,UAAIuG,KAAGI,EAAEpD,CAAF,CAAH,GAAU4F,MAAIxC,EAAEpD,IAAE,CAAJ,CAAJ,GAAa6F,MAAI7F,IAAE,CAAF,GAAMoD,EAAEpD,IAAE,CAAJ,CAAN,GAAe,CAAnB,CAAb,GAAqC4F,KAAGxC,EAAEpD,IAAE,CAAJ,CAAlD,GAA2DgD,IAAEI,EAAEpD,CAAF,CAAjE,EACE2E,EAAE3E,IAAE2F,EAAJ,IADF,KAGE;AACH;;AAEDI,kBAAc3C,CAAd,EAAgBf,CAAhB,EAAkB,CAACsC,EAAE3E,IAAE2F,EAAJ,CAAnB,EAA2B3F,IAAE2F,EAA7B,EAzBuB,CAyBc;AACrC,QAAIV,SAAS7B,CAAT,CAAJ,EAAiB;AACf4C,gBAAU5C,CAAV,EAAYf,CAAZ,EAAcrC,IAAE2F,EAAhB,EADe,CACc;AAC7BhB,QAAE3E,IAAE2F,EAAJ;AACD;AACF;;AAED7E,cAAYuB,CAAZ,EAAc6B,CAAd,EAvD+B,CAuDZ;AACnBpD,cAAYsC,CAAZ,EAAcc,CAAd,EAxD+B,CAwDZ;AACpB;;AAED;AACA,SAASN,MAAT,CAAgBvD,CAAhB,EAAmB;AACjB,MAAIL,CAAJ,EAAMJ,CAAN,EAAQoD,CAAR,EAAU1C,CAAV;AACAV,MAAES,EAAEE,MAAJ;AACAyC,MAAE,CAAF;AACA,OAAKhD,IAAE,CAAP,EAASA,IAAEJ,CAAX,EAAaI,GAAb,EAAkB;AAChBgD,SAAG3C,EAAEL,CAAF,CAAH;AACAM,QAAE,CAAF;AACA,QAAI0C,IAAE,CAAN,EAAS;AACP1C,UAAE,EAAE0C,KAAGxG,GAAL,CAAF;AACAwG,WAAG1C,IAAE5D,KAAL;AACD;AACD2D,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,QAAE,CAACA,KAAGxG,GAAJ,IAAS8D,CAAX;AACD;AACF;;AAED;AACA,SAASyB,MAAT,CAAgB1B,CAAhB,EAAkBN,CAAlB,EAAqB;AACnB,MAAIC,CAAJ;AAAA,MAAMgD,IAAE,CAAR;AACA,OAAKhD,IAAEK,EAAEE,MAAF,GAAS,CAAhB,EAAmBP,KAAG,CAAtB,EAAyBA,GAAzB,EACEgD,IAAE,CAACA,IAAEtG,KAAF,GAAQ2D,EAAEL,CAAF,CAAT,IAAeD,CAAjB;AACF,SAAOiD,CAAP;AACD;;AAED;AACA;AACA;AACA;AACA,SAASnG,UAAT,CAAoBC,CAApB,EAAsBmJ,IAAtB,EAA2BC,OAA3B,EAAoC;AAClC,MAAIlG,CAAJ,EAAMJ,CAAN;AACAA,MAAE2D,KAAK4C,IAAL,CAAUF,OAAKzJ,GAAf,IAAoB,CAAtB;AACAoD,MAAEsG,UAAQtG,CAAR,GAAYsG,OAAZ,GAAsBtG,CAAxB;AACA,MAAIC,OAAK,IAAI9C,KAAJ,CAAU6C,CAAV,CAAT;AACAa,WAASZ,IAAT,EAAc/C,CAAd;AACA,SAAO+C,IAAP;AACD;;AAED;AACA;AACA;AACA;AACA,OAAO,SAASuG,UAAT,CAAoBnG,CAApB,EAAsBoG,IAAtB,EAA2BH,OAA3B,EAAoC;AACzC,MAAII,CAAJ,EAAOtG,CAAP,EAAUW,CAAV,EAAaN,CAAb,EAAgBgC,CAAhB,EAAmBkE,EAAnB;AACA,MAAI3G,IAAEK,EAAEM,MAAR;AACA,MAAI8F,QAAM,CAAC,CAAX,EAAc;AAAE;AACdhG,QAAE,IAAItD,KAAJ,CAAU,CAAV,CAAF;AACA,aAAS;AACPsF,UAAE,IAAItF,KAAJ,CAAUsD,EAAEE,MAAF,GAAS,CAAnB,CAAF;AACA,WAAKP,IAAE,CAAP,EAASA,IAAEK,EAAEE,MAAb,EAAoBP,GAApB,EACEqC,EAAErC,IAAE,CAAJ,IAAOK,EAAEL,CAAF,CAAP;AACFqC,QAAE,CAAF,IAAKmE,SAASvG,CAAT,EAAW,EAAX,CAAL;AACAI,UAAEgC,CAAF;AACAiE,UAAErG,EAAEwG,OAAF,CAAU,GAAV,EAAc,CAAd,CAAF;AACA,UAAIH,IAAE,CAAN,EACE;AACFrG,UAAEA,EAAEyG,SAAF,CAAYJ,IAAE,CAAd,CAAF;AACA,UAAIrG,EAAEM,MAAF,IAAU,CAAd,EACE;AACH;AACD,QAAIF,EAAEE,MAAF,GAAS2F,OAAb,EAAsB;AACpB7D,UAAE,IAAItF,KAAJ,CAAUmJ,OAAV,CAAF;AACAtF,YAAMyB,CAAN,EAAQhC,CAAR;AACA,aAAOgC,CAAP;AACD;AACD,WAAOhC,CAAP;AACD;;AAEDA,MAAExD,WAAW,CAAX,EAAawJ,OAAKzG,CAAlB,EAAoB,CAApB,CAAF;AACA,OAAKI,IAAE,CAAP,EAASA,IAAEJ,CAAX,EAAaI,GAAb,EAAkB;AAChBsG,QAAE3J,UAAU8J,OAAV,CAAkBxG,EAAEyG,SAAF,CAAY1G,CAAZ,EAAcA,IAAE,CAAhB,CAAlB,EAAqC,CAArC,CAAF;AACA,QAAIqG,QAAM,EAAN,IAAYC,KAAG,EAAnB,EAAwB;AACtBA,WAAG,EAAH;AACF,QAAIA,KAAGD,IAAH,IAAWC,IAAE,CAAjB,EAAoB;AAAI;AACtB;AACD;AACDxC,aAASzD,CAAT,EAAWgG,IAAX;AACAxF,YAAQR,CAAR,EAAUiG,CAAV;AACD;;AAED,OAAK1G,IAAES,EAAEE,MAAT,EAAgBX,IAAE,CAAF,IAAO,CAACS,EAAET,IAAE,CAAJ,CAAxB,EAA+BA,GAA/B,CAAmC,CAtCM,CAsCJ;AACrCA,MAAEsG,UAAQtG,IAAE,CAAV,GAAcsG,OAAd,GAAwBtG,IAAE,CAA5B;AACAyC,MAAE,IAAItF,KAAJ,CAAU6C,CAAV,CAAF;AACA2G,OAAG3G,IAAES,EAAEE,MAAJ,GAAaX,CAAb,GAAiBS,EAAEE,MAAtB;AACA,OAAKP,IAAE,CAAP,EAASA,IAAEuG,EAAX,EAAcvG,GAAd,EACEqC,EAAErC,CAAF,IAAKK,EAAEL,CAAF,CAAL;AACF,SAAMA,IAAEJ,CAAR,EAAUI,GAAV,EACEqC,EAAErC,CAAF,IAAK,CAAL;AACF,SAAOqC,CAAP;AACD;;AAED;AACA;AACA,OAAO,SAASrB,SAAT,CAAmBX,CAAnB,EAAqBgC,CAArB,EAAwB;AAC7B,MAAIrC,CAAJ;AACA,MAAIK,EAAE,CAAF,KAAMgC,CAAV,EACE,OAAO,CAAP;AACF,OAAKrC,IAAE,CAAP,EAASA,IAAEK,EAAEE,MAAb,EAAoBP,GAApB,EACE,IAAIK,EAAEL,CAAF,CAAJ,EACE,OAAO,CAAP;AACJ,SAAO,CAAP;AACD;;AAED;AACA;AACA,SAASiB,MAAT,CAAgBZ,CAAhB,EAAkBgC,CAAlB,EAAqB;AACnB,MAAIrC,CAAJ;AACA,MAAIJ,IAAES,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAtB,GAA+B8B,EAAE9B,MAAvC;AACA,OAAKP,IAAE,CAAP,EAASA,IAAEJ,CAAX,EAAaI,GAAb,EACE,IAAIK,EAAEL,CAAF,KAAMqC,EAAErC,CAAF,CAAV,EACE,OAAO,CAAP;AACJ,MAAIK,EAAEE,MAAF,GAAS8B,EAAE9B,MAAf,EAAuB;AACrB,WAAMP,IAAEK,EAAEE,MAAV,EAAiBP,GAAjB,EACE,IAAIK,EAAEL,CAAF,CAAJ,EACE,OAAO,CAAP;AACL,GAJD,MAIO;AACL,WAAMA,IAAEqC,EAAE9B,MAAV,EAAiBP,GAAjB,EACE,IAAIqC,EAAErC,CAAF,CAAJ,EACE,OAAO,CAAP;AACL;AACD,SAAO,CAAP;AACD;;AAED;AACA,OAAO,SAAS+D,MAAT,CAAgB1D,CAAhB,EAAmB;AACxB,MAAIL,CAAJ;AACA,OAAKA,IAAE,CAAP,EAASA,IAAEK,EAAEE,MAAb,EAAoBP,GAApB,EACE,IAAIK,EAAEL,CAAF,CAAJ,EACE,OAAO,CAAP;AACJ,SAAO,CAAP;AACD;;AAED;AACA;AACA,OAAO,SAAS2G,UAAT,CAAoBtG,CAApB,EAAsBgG,IAAtB,EAA4B;AACjC,MAAIrG,CAAJ;AAAA,MAAMlD,CAAN;AAAA,MAAQmD,IAAE,EAAV;;AAEA,MAAI1C,GAAGgD,MAAH,IAAWF,EAAEE,MAAjB,EACEhD,KAAGiD,IAAIH,CAAJ,CAAH,CADF,KAGEO,MAAMrD,EAAN,EAAS8C,CAAT;;AAEF,MAAIgG,QAAM,CAAC,CAAX,EAAc;AAAE;AACd,SAAKrG,IAAEK,EAAEE,MAAF,GAAS,CAAhB,EAAkBP,IAAE,CAApB,EAAsBA,GAAtB,EACEC,KAAGI,EAAEL,CAAF,IAAK,GAAR;AACFC,SAAGI,EAAE,CAAF,CAAH;AACD,GAJD,MAKK;AAAE;AACL,WAAO,CAAC0D,OAAOxG,EAAP,CAAR,EAAoB;AAClBT,UAAE8J,QAAQrJ,EAAR,EAAW8I,IAAX,CAAF,CADkB,CACG;AACrBpG,UAAEtD,UAAU+J,SAAV,CAAoB5J,CAApB,EAAsBA,IAAE,CAAxB,IAA2BmD,CAA7B;AACD;AACF;AACD,MAAIA,EAAEM,MAAF,IAAU,CAAd,EACEN,IAAE,GAAF;AACF,SAAOA,CAAP;AACD;;AAED;AACA,SAASO,GAAT,CAAaH,CAAb,EAAgB;AACd,MAAIL,CAAJ;AACAH,SAAK,IAAI9C,KAAJ,CAAUsD,EAAEE,MAAZ,CAAL;AACAK,QAAMf,IAAN,EAAWQ,CAAX;AACA,SAAOR,IAAP;AACD;;AAED;AACA,OAAO,SAASe,KAAT,CAAeP,CAAf,EAAiBgC,CAAjB,EAAoB;AACzB,MAAIrC,CAAJ;AACA,MAAIJ,IAAES,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAtB,GAA+B8B,EAAE9B,MAAvC;AACA,OAAKP,IAAE,CAAP,EAASA,IAAEJ,CAAX,EAAaI,GAAb,EACEK,EAAEL,CAAF,IAAKqC,EAAErC,CAAF,CAAL;AACF,OAAKA,IAAEJ,CAAP,EAASI,IAAEK,EAAEE,MAAb,EAAoBP,GAApB,EACEK,EAAEL,CAAF,IAAK,CAAL;AACH;;AAED;AACA,OAAO,SAASS,QAAT,CAAkBJ,CAAlB,EAAoBN,CAApB,EAAuB;AAC5B,MAAIC,CAAJ,EAAMgD,CAAN;AACA,OAAKA,IAAEjD,CAAF,EAAIC,IAAE,CAAX,EAAaA,IAAEK,EAAEE,MAAjB,EAAwBP,GAAxB,EAA6B;AAC3BK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA;AACA,SAASqE,OAAT,CAAiBR,CAAjB,EAAmBN,CAAnB,EAAsB;AACpB,MAAIC,CAAJ,EAAMJ,CAAN,EAAQoD,CAAR,EAAU1C,CAAV;AACAD,IAAE,CAAF,KAAMN,CAAN;AACAH,MAAES,EAAEE,MAAJ;AACAyC,MAAE,CAAF;AACA,OAAKhD,IAAE,CAAP,EAASA,IAAEJ,CAAX,EAAaI,GAAb,EAAkB;AAChBgD,SAAG3C,EAAEL,CAAF,CAAH;AACAM,QAAE,CAAF;AACA,QAAI0C,IAAE,CAAN,EAAS;AACP1C,UAAE,EAAE0C,KAAGxG,GAAL,CAAF;AACAwG,WAAG1C,IAAE5D,KAAL;AACD;AACD2D,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,QAAE,CAACA,KAAGxG,GAAJ,IAAS8D,CAAX;AACA,QAAI,CAAC0C,CAAL,EAAQ,OATQ,CASA;AACjB;AACF;;AAED;AACA,OAAO,SAASlC,WAAT,CAAqBT,CAArB,EAAuBN,CAAvB,EAA0B;AAC/B,MAAIC,CAAJ;AACA,MAAIJ,IAAE2D,KAAKG,KAAL,CAAW3D,IAAEvD,GAAb,CAAN;AACA,MAAIoD,CAAJ,EAAO;AACL,SAAKI,IAAE,CAAP,EAASA,IAAEK,EAAEE,MAAF,GAASX,CAApB,EAAsBI,GAAtB,EAA2B;AACzBK,MAAEL,CAAF,IAAKK,EAAEL,IAAEJ,CAAJ,CAAL;AACF,WAAMI,IAAEK,EAAEE,MAAV,EAAiBP,GAAjB,EACEK,EAAEL,CAAF,IAAK,CAAL;AACFD,SAAGvD,GAAH;AACD;AACD,OAAKwD,IAAE,CAAP,EAASA,IAAEK,EAAEE,MAAF,GAAS,CAApB,EAAsBP,GAAtB,EAA2B;AACzBK,MAAEL,CAAF,IAAKvD,QAAS4D,EAAEL,IAAE,CAAJ,KAASxD,MAAIuD,CAAd,GAAqBM,EAAEL,CAAF,KAAMD,CAAnC,CAAL;AACD;AACDM,IAAEL,CAAF,MAAOD,CAAP;AACD;;AAED;AACA,SAASiF,MAAT,CAAgB3E,CAAhB,EAAmB;AACjB,MAAIL,CAAJ;AACA,OAAKA,IAAE,CAAP,EAASA,IAAEK,EAAEE,MAAF,GAAS,CAApB,EAAsBP,GAAtB,EAA2B;AACzBK,MAAEL,CAAF,IAAKvD,QAAS4D,EAAEL,IAAE,CAAJ,KAASxD,MAAI,CAAd,GAAqB6D,EAAEL,CAAF,KAAM,CAAnC,CAAL;AACD;AACDK,IAAEL,CAAF,IAAMK,EAAEL,CAAF,KAAM,CAAP,GAAaK,EAAEL,CAAF,IAAQtD,SAAO,CAAjC,CALiB,CAKsB;AACxC;;AAED;AACA,SAAS6I,UAAT,CAAoBlF,CAApB,EAAsBN,CAAtB,EAAyB;AACvB,MAAIC,CAAJ;AACA,MAAIJ,IAAE2D,KAAKG,KAAL,CAAW3D,IAAEvD,GAAb,CAAN;AACA,MAAIoD,CAAJ,EAAO;AACL,SAAKI,IAAEK,EAAEE,MAAT,EAAiBP,KAAGJ,CAApB,EAAuBI,GAAvB,EAA4B;AAC1BK,MAAEL,CAAF,IAAKK,EAAEL,IAAEJ,CAAJ,CAAL;AACF,WAAMI,KAAG,CAAT,EAAWA,GAAX,EACEK,EAAEL,CAAF,IAAK,CAAL;AACFD,SAAGvD,GAAH;AACD;AACD,MAAI,CAACuD,CAAL,EACE;AACF,OAAKC,IAAEK,EAAEE,MAAF,GAAS,CAAhB,EAAkBP,IAAE,CAApB,EAAsBA,GAAtB,EAA2B;AACzBK,MAAEL,CAAF,IAAKvD,QAAS4D,EAAEL,CAAF,KAAMD,CAAP,GAAaM,EAAEL,IAAE,CAAJ,KAASxD,MAAIuD,CAAlC,CAAL;AACD;AACDM,IAAEL,CAAF,IAAKvD,OAAQ4D,EAAEL,CAAF,KAAMD,CAAnB;AACD;;AAED;AACA;AACA,SAAS+D,QAAT,CAAkBzD,CAAlB,EAAoBN,CAApB,EAAuB;AACrB,MAAIC,CAAJ,EAAMJ,CAAN,EAAQoD,CAAR,EAAU1C,CAAV;AACA,MAAI,CAACP,CAAL,EACE;AACFH,MAAES,EAAEE,MAAJ;AACAyC,MAAE,CAAF;AACA,OAAKhD,IAAE,CAAP,EAASA,IAAEJ,CAAX,EAAaI,GAAb,EAAkB;AAChBgD,SAAG3C,EAAEL,CAAF,IAAKD,CAAR;AACAO,QAAE,CAAF;AACA,QAAI0C,IAAE,CAAN,EAAS;AACP1C,UAAE,EAAE0C,KAAGxG,GAAL,CAAF;AACAwG,WAAG1C,IAAE5D,KAAL;AACD;AACD2D,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,QAAE,CAACA,KAAGxG,GAAJ,IAAS8D,CAAX;AACD;AACF;;AAED;AACA,SAASsG,OAAT,CAAiBvG,CAAjB,EAAmBN,CAAnB,EAAsB;AACpB,MAAIC,CAAJ;AAAA,MAAMoD,IAAE,CAAR;AAAA,MAAUnD,CAAV;AACA,OAAKD,IAAEK,EAAEE,MAAF,GAAS,CAAhB,EAAkBP,KAAG,CAArB,EAAuBA,GAAvB,EAA4B;AAC1BC,QAAEmD,IAAE1G,KAAF,GAAQ2D,EAAEL,CAAF,CAAV;AACAK,MAAEL,CAAF,IAAKuD,KAAKG,KAAL,CAAWzD,IAAEF,CAAb,CAAL;AACAqD,QAAEnD,IAAEF,CAAJ;AACD;AACD,SAAOqD,CAAP;AACD;;AAED;AACA;AACA,SAAS0B,QAAT,CAAkBzE,CAAlB,EAAoBgC,CAApB,EAAsB6B,CAAtB,EAAwB5D,CAAxB,EAA2B;AACzB,MAAIN,CAAJ,EAAMgD,CAAN,EAAQpD,CAAR,EAAU2G,EAAV;AACA3G,MAAES,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAtB,GAA+B8B,EAAE9B,MAAnC;AACAgG,OAAGlG,EAAEE,MAAL;AACA,OAAKyC,IAAE,CAAF,EAAIhD,IAAE,CAAX,EAAaA,IAAEJ,CAAf,EAAiBI,GAAjB,EAAsB;AACpBgD,SAAGkB,IAAE7D,EAAEL,CAAF,CAAF,GAAOM,IAAE+B,EAAErC,CAAF,CAAZ;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACD,OAAKwD,IAAEJ,CAAP,EAASI,IAAEuG,EAAX,EAAcvG,GAAd,EAAmB;AACjBgD,SAAGkB,IAAE7D,EAAEL,CAAF,CAAL;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA;AACA,SAASuJ,aAAT,CAAuB1F,CAAvB,EAAyBgC,CAAzB,EAA2B/B,CAA3B,EAA6BuG,EAA7B,EAAiC;AAC/B,MAAI7G,CAAJ,EAAMgD,CAAN,EAAQpD,CAAR,EAAU2G,EAAV;AACA3G,MAAES,EAAEE,MAAF,GAASsG,KAAGxE,EAAE9B,MAAd,GAAuBF,EAAEE,MAAzB,GAAkCsG,KAAGxE,EAAE9B,MAAzC;AACAgG,OAAGlG,EAAEE,MAAL;AACA,OAAKyC,IAAE,CAAF,EAAIhD,IAAE6G,EAAX,EAAc7G,IAAEJ,CAAhB,EAAkBI,GAAlB,EAAuB;AACrBgD,SAAG3C,EAAEL,CAAF,IAAKM,IAAE+B,EAAErC,IAAE6G,EAAJ,CAAV;AACAxG,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACD,OAAKwD,IAAEJ,CAAP,EAASoD,KAAKhD,IAAEuG,EAAhB,EAAmBvG,GAAnB,EAAwB;AACtBgD,SAAG3C,EAAEL,CAAF,CAAH;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA;AACA,SAASwJ,SAAT,CAAmB3F,CAAnB,EAAqBgC,CAArB,EAAuBwE,EAAvB,EAA2B;AACzB,MAAI7G,CAAJ,EAAMgD,CAAN,EAAQpD,CAAR,EAAU2G,EAAV;AACA3G,MAAES,EAAEE,MAAF,GAASsG,KAAGxE,EAAE9B,MAAd,GAAuBF,EAAEE,MAAzB,GAAkCsG,KAAGxE,EAAE9B,MAAzC;AACAgG,OAAGlG,EAAEE,MAAL;AACA,OAAKyC,IAAE,CAAF,EAAIhD,IAAE6G,EAAX,EAAc7G,IAAEJ,CAAhB,EAAkBI,GAAlB,EAAuB;AACrBgD,SAAG3C,EAAEL,CAAF,IAAKqC,EAAErC,IAAE6G,EAAJ,CAAR;AACAxG,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACD,OAAKwD,IAAEJ,CAAP,EAASoD,KAAKhD,IAAEuG,EAAhB,EAAmBvG,GAAnB,EAAwB;AACtBgD,SAAG3C,EAAEL,CAAF,CAAH;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA;AACA,SAASsJ,SAAT,CAAmBzF,CAAnB,EAAqBgC,CAArB,EAAuBwE,EAAvB,EAA2B;AACzB,MAAI7G,CAAJ,EAAMgD,CAAN,EAAQpD,CAAR,EAAU2G,EAAV;AACA3G,MAAES,EAAEE,MAAF,GAASsG,KAAGxE,EAAE9B,MAAd,GAAuBF,EAAEE,MAAzB,GAAkCsG,KAAGxE,EAAE9B,MAAzC;AACAgG,OAAGlG,EAAEE,MAAL;AACA,OAAKyC,IAAE,CAAF,EAAIhD,IAAE6G,EAAX,EAAc7G,IAAEJ,CAAhB,EAAkBI,GAAlB,EAAuB;AACrBgD,SAAG3C,EAAEL,CAAF,IAAKqC,EAAErC,IAAE6G,EAAJ,CAAR;AACAxG,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACD,OAAKwD,IAAEJ,CAAP,EAASoD,KAAKhD,IAAEuG,EAAhB,EAAmBvG,GAAnB,EAAwB;AACtBgD,SAAG3C,EAAEL,CAAF,CAAH;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA;AACA;AACA,OAAO,SAASiG,IAAT,CAAcpC,CAAd,EAAgBgC,CAAhB,EAAmB;AACxB,MAAIrC,CAAJ,EAAMgD,CAAN,EAAQpD,CAAR,EAAU2G,EAAV;AACA3G,MAAES,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAtB,GAA+B8B,EAAE9B,MAAnC;AACA,OAAKyC,IAAE,CAAF,EAAIhD,IAAE,CAAX,EAAaA,IAAEJ,CAAf,EAAiBI,GAAjB,EAAsB;AACpBgD,SAAG3C,EAAEL,CAAF,IAAKqC,EAAErC,CAAF,CAAR;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACD,OAAKwD,IAAEJ,CAAP,EAASoD,KAAKhD,IAAEK,EAAEE,MAAlB,EAAyBP,GAAzB,EAA8B;AAC5BgD,SAAG3C,EAAEL,CAAF,CAAH;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA;AACA,OAAO,SAASmG,IAAT,CAActC,CAAd,EAAgBgC,CAAhB,EAAmB;AACxB,MAAIrC,CAAJ,EAAMgD,CAAN,EAAQpD,CAAR,EAAU2G,EAAV;AACA3G,MAAES,EAAEE,MAAF,GAAS8B,EAAE9B,MAAX,GAAoBF,EAAEE,MAAtB,GAA+B8B,EAAE9B,MAAnC;AACA,OAAKyC,IAAE,CAAF,EAAIhD,IAAE,CAAX,EAAaA,IAAEJ,CAAf,EAAiBI,GAAjB,EAAsB;AACpBgD,SAAG3C,EAAEL,CAAF,IAAKqC,EAAErC,CAAF,CAAR;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACD,OAAKwD,IAAEJ,CAAP,EAASoD,KAAKhD,IAAEK,EAAEE,MAAlB,EAAyBP,GAAzB,EAA8B;AAC5BgD,SAAG3C,EAAEL,CAAF,CAAH;AACAK,MAAEL,CAAF,IAAKgD,IAAIvG,IAAT;AACAuG,UAAIxG,GAAJ;AACD;AACF;;AAED;AACA,SAAS8F,KAAT,CAAejC,CAAf,EAAiBgC,CAAjB,EAAoB;AAClB,MAAIrC,CAAJ;AACA,MAAIhD,GAAGuD,MAAH,IAAW,IAAEF,EAAEE,MAAnB,EACEvD,KAAG,IAAID,KAAJ,CAAU,IAAEsD,EAAEE,MAAd,CAAH;AACFE,WAASzD,EAAT,EAAY,CAAZ;AACA,OAAKgD,IAAE,CAAP,EAASA,IAAEqC,EAAE9B,MAAb,EAAoBP,GAApB,EACE,IAAIqC,EAAErC,CAAF,CAAJ,EACE+F,cAAc/I,EAAd,EAAiBqD,CAAjB,EAAmBgC,EAAErC,CAAF,CAAnB,EAAwBA,CAAxB,EAPc,CAOgB;AAClCY,QAAMP,CAAN,EAAQrD,EAAR;AACD;;AAED;AACA,SAASkF,IAAT,CAAc7B,CAAd,EAAgBN,CAAhB,EAAmB;AACjB,MAAI1C,GAAGkD,MAAH,IAAWF,EAAEE,MAAjB,EACElD,KAAGmD,IAAIH,CAAJ,CAAH,CADF,KAGEO,MAAMvD,EAAN,EAASgD,CAAT;AACF,MAAI/C,GAAGiD,MAAH,IAAWF,EAAEE,MAAjB,EACEjD,KAAGkD,IAAIH,CAAJ,CAAH;AACFwD,UAAQxG,EAAR,EAAW0C,CAAX,EAAazC,EAAb,EAAgB+C,CAAhB,EAPiB,CAOI;AACtB;;AAED;AACA;AACA,SAAS0C,QAAT,CAAkB1C,CAAlB,EAAoBgC,CAApB,EAAsBtC,CAAtB,EAAyB;AACvB,MAAIC,CAAJ;AACA,MAAI/C,GAAGsD,MAAH,IAAW,IAAEF,EAAEE,MAAnB,EACEtD,KAAG,IAAIF,KAAJ,CAAU,IAAEsD,EAAEE,MAAd,CAAH;AACFE,WAASxD,EAAT,EAAY,CAAZ;AACA,OAAK+C,IAAE,CAAP,EAASA,IAAEqC,EAAE9B,MAAb,EAAoBP,GAApB,EACE,IAAIqC,EAAErC,CAAF,CAAJ,EACE+F,cAAc9I,EAAd,EAAiBoD,CAAjB,EAAmBgC,EAAErC,CAAF,CAAnB,EAAwBA,CAAxB,EAPmB,CAOW;AAClCkC,OAAKjF,EAAL,EAAQ8C,CAAR;AACAa,QAAMP,CAAN,EAAQpD,EAAR;AACD;;AAED;AACA,SAASiE,UAAT,CAAoBb,CAApB,EAAsBN,CAAtB,EAAyB;AACvB,MAAIC,CAAJ,EAAMW,CAAN,EAAQ2F,CAAR,EAAUtD,CAAV,EAAY0C,EAAZ,EAAeoB,EAAf,EAAkBlH,CAAlB;AACA,OAAK8F,KAAGrF,EAAEE,MAAV,EAAkBmF,KAAG,CAAH,IAAQ,CAACrF,EAAEqF,KAAG,CAAL,CAA3B,EAAoCA,IAApC,CAAyC,CAFlB,CAEqB;AAC5C9F,MAAE8F,KAAG3F,EAAEQ,MAAL,GAAc,IAAEmF,EAAhB,GAAqB,IAAE3F,EAAEQ,MAA3B,CAHuB,CAGY;AACnC,MAAItD,GAAGsD,MAAH,IAAWX,CAAf,EACE3C,KAAG,IAAIF,KAAJ,CAAU6C,CAAV,CAAH;AACFa,WAASxD,EAAT,EAAY,CAAZ;AACA,OAAK+C,IAAE,CAAP,EAASA,IAAE0F,EAAX,EAAc1F,GAAd,EAAmB;AACjBgD,QAAE/F,GAAG,IAAE+C,CAAL,IAAQK,EAAEL,CAAF,IAAKK,EAAEL,CAAF,CAAf;AACA/C,OAAG,IAAE+C,CAAL,IAAQgD,IAAIvG,IAAZ;AACAuG,UAAIxG,GAAJ;AACA,SAAKmE,IAAEX,IAAE,CAAT,EAAWW,IAAE+E,EAAb,EAAgB/E,GAAhB,EAAqB;AACnBqC,UAAE/F,GAAG+C,IAAEW,CAAL,IAAQ,IAAEN,EAAEL,CAAF,CAAF,GAAOK,EAAEM,CAAF,CAAf,GAAoBqC,CAAtB;AACA/F,SAAG+C,IAAEW,CAAL,IAASqC,IAAIvG,IAAb;AACAuG,YAAIxG,GAAJ;AACD;AACDS,OAAG+C,IAAE0F,EAAL,IAAS1C,CAAT;AACD;AACDd,OAAKjF,EAAL,EAAQ8C,CAAR;AACAa,QAAMP,CAAN,EAAQpD,EAAR;AACD;;AAED;AACA,SAASwE,IAAT,CAAcpB,CAAd,EAAgBT,CAAhB,EAAmB;AACjB,MAAII,CAAJ,EAAMqC,CAAN;AACA,OAAKrC,IAAEK,EAAEE,MAAT,EAAiBP,IAAE,CAAF,IAAO,CAACK,EAAEL,IAAE,CAAJ,CAAzB,EAAiCA,GAAjC,CAAqC;AACrCqC,MAAE,IAAItF,KAAJ,CAAUiD,IAAEJ,CAAZ,CAAF;AACAgB,QAAMyB,CAAN,EAAQhC,CAAR;AACA,SAAOgC,CAAP;AACD;;AAED;AACA;AACA,SAAStB,OAAT,CAAiBV,CAAjB,EAAmBgC,CAAnB,EAAqBtC,CAArB,EAAwB;AACtB,MAAIgH,EAAJ,EAAOC,EAAP,EAAUF,EAAV,EAAaG,EAAb;AACA,MAAGzJ,GAAG+C,MAAH,IAAWR,EAAEQ,MAAhB,EACE/C,KAAGgD,IAAIT,CAAJ,CAAH;;AAEF;AACA;AACA,MAAI,CAACA,EAAE,CAAF,IAAK,CAAN,KAAU,CAAd,EAAiB;AACfa,UAAMpD,EAAN,EAAS6C,CAAT;AACAI,aAASJ,CAAT,EAAW,CAAX;AACA,WAAM,CAACW,UAAUqB,CAAV,EAAY,CAAZ,CAAP,EAAuB;AACrB,UAAIA,EAAE,CAAF,IAAK,CAAT,EACEU,SAAS1C,CAAT,EAAW7C,EAAX,EAAcuC,CAAd;AACF6G,cAAQvE,CAAR,EAAU,CAAV;AACAnB,iBAAW1D,EAAX,EAAcuC,CAAd;AACD;AACD;AACD;;AAED;AACAU,WAASjD,EAAT,EAAY,CAAZ;AACA,OAAKsJ,KAAG/G,EAAEQ,MAAV,EAAiBuG,KAAG,CAAH,IAAQ,CAAC/G,EAAE+G,KAAG,CAAL,CAA1B,EAAkCA,IAAlC,CAAuC;AACvCG,OAAGvK,QAAMwI,cAAcnD,OAAOhC,CAAP,EAASrD,KAAT,CAAd,EAA8BA,KAA9B,CAAT;AACAc,KAAGsJ,EAAH,IAAO,CAAP;AACA/D,WAAS1C,CAAT,EAAY7C,EAAZ,EAAeuC,CAAf,EAxBsB,CAwBD;;AAErB,MAAI3C,GAAGmD,MAAH,IAAWF,EAAEE,MAAjB,EACEnD,KAAGoD,IAAIH,CAAJ,CAAH,CADF,KAGEO,MAAMxD,EAAN,EAASiD,CAAT;;AAEF,OAAK0G,KAAG1E,EAAE9B,MAAF,GAAS,CAAjB,EAAmBwG,KAAG,CAAH,GAAO,CAAC1E,EAAE0E,EAAF,CAA3B,EAAkCA,IAAlC,CAAuC,CA/BjB,CA+BoB;AAC1C,MAAI1E,EAAE0E,EAAF,KAAO,CAAX,EAAc;AAAG;AACftG,aAASJ,CAAT,EAAW,CAAX;AACA;AACD;AACD,OAAK2G,KAAG,KAAIxK,MAAI,CAAhB,EAAmBwK,MAAM,EAAE3E,EAAE0E,EAAF,IAAQC,EAAV,CAAzB,EAAwCA,OAAK,CAA7C,CAA+C,CApCzB,CAoC4B;AAClD,WAAS;AACP,QAAI,EAAEA,OAAK,CAAP,CAAJ,EAAe;AAAG;AAChBD;AACA,UAAIA,KAAG,CAAP,EAAU;AACRG,cAAM7G,CAAN,EAAQzD,GAAR,EAAYmD,CAAZ,EAAckH,EAAd;AACA;AACD;AACDD,WAAG,KAAIxK,MAAI,CAAX;AACD;AACD0K,UAAM7G,CAAN,EAAQA,CAAR,EAAUN,CAAV,EAAYkH,EAAZ;;AAEA,QAAID,KAAK3E,EAAE0E,EAAF,CAAT,EAAgB;AACdG,YAAM7G,CAAN,EAAQjD,EAAR,EAAW2C,CAAX,EAAakH,EAAb;AACH;AACF;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,KAAT,CAAe7G,CAAf,EAAiBgC,CAAjB,EAAmBtC,CAAnB,EAAqBkH,EAArB,EAAyB;AACvB,MAAIjH,CAAJ,EAAMW,CAAN,EAAQqC,CAAR,EAAUmE,EAAV,EAAarK,CAAb,EAAesK,EAAf;AACA,MAAIN,KAAG/G,EAAEQ,MAAT;AACA,MAAIoF,KAAGtD,EAAE9B,MAAT;;AAEA,MAAI7C,GAAG6C,MAAH,IAAWuG,EAAf,EACEpJ,KAAG,IAAIX,KAAJ,CAAU+J,EAAV,CAAH;;AAEFrG,WAAS/C,EAAT,EAAY,CAAZ;;AAEA,SAAMoJ,KAAG,CAAH,IAAQ/G,EAAE+G,KAAG,CAAL,KAAS,CAAvB,EAAyBA,IAAzB,CAA8B,CAVP,CAUS;AAChC,SAAMnB,KAAG,CAAH,IAAQtD,EAAEsD,KAAG,CAAL,KAAS,CAAvB,EAAyBA,IAAzB,CAA8B,CAXP,CAWS;AAChCyB,OAAG1J,GAAG6C,MAAH,GAAU,CAAb,CAZuB,CAYP;;AAEhB;AACA,OAAKP,IAAE,CAAP,EAAUA,IAAE8G,EAAZ,EAAgB9G,GAAhB,EAAqB;AACnBlD,QAAEY,GAAG,CAAH,IAAM2C,EAAEL,CAAF,IAAKqC,EAAE,CAAF,CAAb;AACA8E,SAAI,CAACrK,IAAIL,IAAL,IAAawK,EAAd,GAAoBxK,IAAvB,CAFmB,CAEW;AAC9BuG,QAAGlG,IAAEqK,KAAGpH,EAAE,CAAF,CAAN,IAAevD,GAAjB;AACAM,QAAEuD,EAAEL,CAAF,CAAF;;AAEA;AACAW,QAAE,CAAF;AACA,WAAMA,IAAEgF,KAAG,CAAX,GAAe;AAAE3C,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAT,GAAc7D,IAAEuF,EAAE1B,CAAF,CAAnB,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAT,GAAc7D,IAAEuF,EAAE1B,CAAF,CAAnB,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAT,GAAc7D,IAAEuF,EAAE1B,CAAF,CAAnB,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAT,GAAc7D,IAAEuF,EAAE1B,CAAF,CAAnB,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAT,GAAc7D,IAAEuF,EAAE1B,CAAF,CAAnB,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAAM;AACjF,WAAMA,IAAEgF,EAAR,GAAe;AAAE3C,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAT,GAAc7D,IAAEuF,EAAE1B,CAAF,CAAnB,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAAM;AACjF,WAAMA,IAAEmG,KAAG,CAAX,GAAe;AAAE9D,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAZ,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAZ,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAZ,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAZ,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAC1DqC,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAZ,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAAM;AACjF,WAAMA,IAAEmG,EAAR,GAAe;AAAE9D,WAAGtF,GAAGiD,CAAH,IAAMwG,KAAGpH,EAAEY,CAAF,CAAZ,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAAM;AACjF,WAAMA,IAAEyG,EAAR,GAAe;AAAEpE,WAAGtF,GAAGiD,CAAH,CAAH,CAA2BjD,GAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ,CAAoBuG,MAAIxG,GAAJ,CAAWmE;AAAM;AACjFjD,OAAGiD,IAAE,CAAL,IAAQqC,IAAIvG,IAAZ;AACD;;AAED,MAAI,CAACuF,QAAQjC,CAAR,EAAUrC,EAAV,CAAL,EACE+E,KAAK/E,EAAL,EAAQqC,CAAR;AACFa,QAAMP,CAAN,EAAQ3C,EAAR;AACD","file":"leemon.js","sourcesContent":["////////////////////////////////////////////////////////////////////////////////////////\r\n// Big Integer Library v. 5.5\r\n// Created 2000, last modified 2013\r\n// Leemon Baird\r\n// www.leemon.com\r\n//\r\n// Version history:\r\n// v 5.5 17 Mar 2013\r\n// - two lines of a form like \"if (x<0) x+=n\" had the \"if\" changed to \"while\" to\r\n// handle the case when x<-n. (Thanks to James Ansell for finding that bug)\r\n// v 5.4 3 Oct 2009\r\n// - added \"var i\" to greaterShift() so i is not global. (Thanks to PŽter Szab— for finding that bug)\r\n//\r\n// v 5.3 21 Sep 2009\r\n// - added randProbPrime(k) for probable primes\r\n// - unrolled loop in mont_ (slightly faster)\r\n// - millerRabin now takes a bigInt parameter rather than an int\r\n//\r\n// v 5.2 15 Sep 2009\r\n// - fixed capitalization in call to int2bigInt in randBigInt\r\n// (thanks to Emili Evripidou, Reinhold Behringer, and Samuel Macaleese for finding that bug)\r\n//\r\n// v 5.1 8 Oct 2007\r\n// - renamed inverseModInt_ to inverseModInt since it doesn't change its parameters\r\n// - added functions GCD and randBigInt, which call GCD_ and randBigInt_\r\n// - fixed a bug found by Rob Visser (see comment with his name below)\r\n// - improved comments\r\n//\r\n// This file is public domain. You can use it for any purpose without restriction.\r\n// I do not guarantee that it is correct, so use it at your own risk. If you use\r\n// it for something interesting, I'd appreciate hearing about it. If you find\r\n// any bugs or make any improvements, I'd appreciate hearing about those too.\r\n// It would also be nice if my name and URL were left in the comments. But none\r\n// of that is required.\r\n//\r\n// This code defines a bigInt library for arbitrary-precision integers.\r\n// A bigInt is an array of integers storing the value in chunks of bpe bits,\r\n// little endian (buff[0] is the least significant word).\r\n// Negative bigInts are stored two's complement. Almost all the functions treat\r\n// bigInts as nonnegative. The few that view them as two's complement say so\r\n// in their comments. Some functions assume their parameters have at least one\r\n// leading zero element. Functions with an underscore at the end of the name put\r\n// their answer into one of the arrays passed in, and have unpredictable behavior\r\n// in case of overflow, so the caller must make sure the arrays are big enough to\r\n// hold the answer. But the average user should never have to call any of the\r\n// underscored functions. Each important underscored function has a wrapper function\r\n// of the same name without the underscore that takes care of the details for you.\r\n// For each underscored function where a parameter is modified, that same variable\r\n// must not be used as another argument too. So, you cannot square x by doing\r\n// multMod_(x,x,n). You must use squareMod_(x,n) instead, or do y=dup(x); multMod_(x,y,n).\r\n// Or simply use the multMod(x,x,n) function without the underscore, where\r\n// such issues never arise, because non-underscored functions never change\r\n// their parameters; they always allocate new memory for the answer that is returned.\r\n//\r\n// These functions are designed to avoid frequent dynamic memory allocation in the inner loop.\r\n// For most functions, if it needs a BigInt as a local variable it will actually use\r\n// a global, and will only allocate to it only when it's not the right size. This ensures\r\n// that when a function is called repeatedly with same-sized parameters, it only allocates\r\n// memory on the first call.\r\n//\r\n// Note that for cryptographic purposes, the calls to Math.random() must\r\n// be replaced with calls to a better pseudorandom number generator.\r\n//\r\n// In the following, \"bigInt\" means a bigInt with at least one leading zero element,\r\n// and \"integer\" means a nonnegative integer less than radix. In some cases, integer\r\n// can be negative. Negative bigInts are 2s complement.\r\n//\r\n// The following functions do not modify their inputs.\r\n// Those returning a bigInt, string, or Array will dynamically allocate memory for that value.\r\n// Those returning a boolean will return the integer 0 (false) or 1 (true).\r\n// Those returning boolean or int will not allocate memory except possibly on the first\r\n// time they're called with a given parameter size.\r\n//\r\n// bigInt add(x,y) //return (x+y) for bigInts x and y.\r\n// bigInt addInt(x,n) //return (x+n) where x is a bigInt and n is an integer.\r\n// string bigInt2str(x,base) //return a string form of bigInt x in a given base, with 2 <= base <= 95\r\n// int bitSize(x) //return how many bits long the bigInt x is, not counting leading zeros\r\n// bigInt dup(x) //return a copy of bigInt x\r\n// boolean equals(x,y) //is the bigInt x equal to the bigint y?\r\n// boolean equalsInt(x,y) //is bigint x equal to integer y?\r\n// bigInt expand(x,n) //return a copy of x with at least n elements, adding leading zeros if needed\r\n// Array findPrimes(n) //return array of all primes less than integer n\r\n// bigInt GCD(x,y) //return greatest common divisor of bigInts x and y (each with same number of elements).\r\n// boolean greater(x,y) //is x>y? (x and y are nonnegative bigInts)\r\n// boolean greaterShift(x,y,shift)//is (x <<(shift*bpe)) > y?\r\n// bigInt int2bigInt(t,n,m) //return a bigInt equal to integer t, with at least n bits and m array elements\r\n// bigInt inverseMod(x,n) //return (x**(-1) mod n) for bigInts x and n. If no inverse exists, it returns null\r\n// int inverseModInt(x,n) //return x**(-1) mod n, for integers x and n. Return 0 if there is no inverse\r\n// boolean isZero(x) //is the bigInt x equal to zero?\r\n// boolean millerRabin(x,b) //does one round of Miller-Rabin base integer b say that bigInt x is possibly prime? (b is bigInt, 1<b<x)\r\n// boolean millerRabinInt(x,b) //does one round of Miller-Rabin base integer b say that bigInt x is possibly prime? (b is int, 1<b<x)\r\n// bigInt mod(x,n) //return a new bigInt equal to (x mod n) for bigInts x and n.\r\n// int modInt(x,n) //return x mod n for bigInt x and integer n.\r\n// bigInt mult(x,y) //return x*y for bigInts x and y. This is faster when y<x.\r\n// bigInt multMod(x,y,n) //return (x*y mod n) for bigInts x,y,n. For greater speed, let y<x.\r\n// boolean negative(x) //is bigInt x negative?\r\n// bigInt powMod(x,y,n) //return (x**y mod n) where x,y,n are bigInts and ** is exponentiation. 0**0=1. Faster for odd n.\r\n// bigInt randBigInt(n,s) //return an n-bit random BigInt (n>=1). If s=1, then the most significant of those n bits is set to 1.\r\n// bigInt randTruePrime(k) //return a new, random, k-bit, true prime bigInt using Maurer's algorithm.\r\n// bigInt randProbPrime(k) //return a new, random, k-bit, probable prime bigInt (probability it's composite less than 2^-80).\r\n// bigInt str2bigInt(s,b,n,m) //return a bigInt for number represented in string s in base b with at least n bits and m array elements\r\n// bigInt sub(x,y) //return (x-y) for bigInts x and y. Negative answers will be 2s complement\r\n// bigInt trim(x,k) //return a copy of x with exactly k leading zero elements\r\n//\r\n//\r\n// The following functions each have a non-underscored version, which most users should call instead.\r\n// These functions each write to a single parameter, and the caller is responsible for ensuring the array\r\n// passed in is large enough to hold the result.\r\n//\r\n// void addInt_(x,n) //do x=x+n where x is a bigInt and n is an integer\r\n// void add_(x,y) //do x=x+y for bigInts x and y\r\n// void copy_(x,y) //do x=y on bigInts x and y\r\n// void copyInt_(x,n) //do x=n on bigInt x and integer n\r\n// void GCD_(x,y) //set x to the greatest common divisor of bigInts x and y, (y is destroyed). (This never overflows its array).\r\n// boolean inverseMod_(x,n) //do x=x**(-1) mod n, for bigInts x and n. Returns 1 (0) if inverse does (doesn't) exist\r\n// void mod_(x,n) //do x=x mod n for bigInts x and n. (This never overflows its array).\r\n// void mult_(x,y) //do x=x*y for bigInts x and y.\r\n// void multMod_(x,y,n) //do x=x*y mod n for bigInts x,y,n.\r\n// void powMod_(x,y,n) //do x=x**y mod n, where x,y,n are bigInts (n is odd) and ** is exponentiation. 0**0=1.\r\n// void randBigInt_(b,n,s) //do b = an n-bit random BigInt. if s=1, then nth bit (most significant bit) is set to 1. n>=1.\r\n// void randTruePrime_(ans,k) //do ans = a random k-bit true random prime (not just probable prime) with 1 in the msb.\r\n// void sub_(x,y) //do x=x-y for bigInts x and y. Negative answers will be 2s complement.\r\n//\r\n// The following functions do NOT have a non-underscored version.\r\n// They each write a bigInt result to one or more parameters. The caller is responsible for\r\n// ensuring the arrays passed in are large enough to hold the results.\r\n//\r\n// void addShift_(x,y,ys) //do x=x+(y<<(ys*bpe))\r\n// void carry_(x) //do carries and borrows so each element of the bigInt x fits in bpe bits.\r\n// void divide_(x,y,q,r) //divide x by y giving quotient q and remainder r\r\n// int divInt_(x,n) //do x=floor(x/n) for bigInt x and integer n, and return the remainder. (This never overflows its array).\r\n// int eGCD_(x,y,d,a,b) //sets a,b,d to positive bigInts such that d = GCD_(x,y) = a*x-b*y\r\n// void halve_(x) //do x=floor(|x|/2)*sgn(x) for bigInt x in 2's complement. (This never overflows its array).\r\n// void leftShift_(x,n) //left shift bigInt x by n bits. n<bpe.\r\n// void linComb_(x,y,a,b) //do x=a*x+b*y for bigInts x and y and integers a and b\r\n// void linCombShift_(x,y,b,ys) //do x=x+b*(y<<(ys*bpe)) for bigInts x and y, and integers b and ys\r\n// void mont_(x,y,n,np) //Montgomery multiplication (see comments where the function is defined)\r\n// void multInt_(x,n) //do x=x*n where x is a bigInt and n is an integer.\r\n// void rightShift_(x,n) //right shift bigInt x by n bits. 0 <= n < bpe. (This never overflows its array).\r\n// void squareMod_(x,n) //do x=x*x mod n for bigInts x,n\r\n// void subShift_(x,y,ys) //do x=x-(y<<(ys*bpe)). Negative answers will be 2s complement.\r\n//\r\n// The following functions are based on algorithms from the _Handbook of Applied Cryptography_\r\n// powMod_() = algorithm 14.94, Montgomery exponentiation\r\n// eGCD_,inverseMod_() = algorithm 14.61, Binary extended GCD_\r\n// GCD_() = algorothm 14.57, Lehmer's algorithm\r\n// mont_() = algorithm 14.36, Montgomery multiplication\r\n// divide_() = algorithm 14.20 Multiple-precision division\r\n// squareMod_() = algorithm 14.16 Multiple-precision squaring\r\n// randTruePrime_() = algorithm 4.62, Maurer's algorithm\r\n// millerRabin() = algorithm 4.24, Miller-Rabin algorithm\r\n//\r\n// Profiling shows:\r\n// randTruePrime_() spends:\r\n// 10% of its time in calls to powMod_()\r\n// 85% of its time in calls to millerRabin()\r\n// millerRabin() spends:\r\n// 99% of its time in calls to powMod_() (always with a base of 2)\r\n// powMod_() spends:\r\n// 94% of its time in calls to mont_() (almost always with x==y)\r\n//\r\n// This suggests there are several ways to speed up this library slightly:\r\n// - convert powMod_ to use a Montgomery form of k-ary window (or maybe a Montgomery form of sliding window)\r\n// -- this should especially focus on being fast when raising 2 to a power mod n\r\n// - convert randTruePrime_() to use a minimum r of 1/3 instead of 1/2 with the appropriate change to the test\r\n// - tune the parameters in randTruePrime_(), including c, m, and recLimit\r\n// - speed up the single loop in mont_() that takes 95% of the runtime, perhaps by reducing checking\r\n// within the loop when all the parameters are the same length.\r\n//\r\n// There are several ideas that look like they wouldn't help much at all:\r\n// - replacing trial division in randTruePrime_() with a sieve (that speeds up something taking almost no time anyway)\r\n// - increase bpe from 15 to 30 (that would help if we had a 32*32->64 multiplier, but not with JavaScript's 32*32->32)\r\n// - speeding up mont_(x,y,n,np) when x==y by doing a non-modular, non-Montgomery square\r\n// followed by a Montgomery reduction. The intermediate answer will be twice as long as x, so that\r\n// method would be slower. This is unfortunate because the code currently spends almost all of its time\r\n// doing mont_(x,x,...), both for randTruePrime_() and powMod_(). A faster method for Montgomery squaring\r\n// would have a large impact on the speed of randTruePrime_() and powMod_(). HAC has a couple of poorly-worded\r\n// sentences that seem to imply it's faster to do a non-modular square followed by a single\r\n// Montgomery reduction, but that's obviously wrong.\r\n////////////////////////////////////////////////////////////////////////////////////////\r\n\r\n//globals\r\nexport var bpe=0; //bits stored per array element\r\nvar mask=0; //AND this with an array element to chop it down to bpe bits\r\nvar radix=mask+1; //equals 2^bpe. A single 1 bit to the left of the last bit of mask.\r\n\r\n//the digits for converting to different bases\r\nvar digitsStr='0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_=!@#$%^&*()[]{}|;:,.<>/?`~ \\\\\\'\\\"+-';\r\n\r\n//initialize the global variables\r\nfor (bpe=0; (1<<(bpe+1)) > (1<<bpe); bpe++); //bpe=number of bits in the mantissa on this platform\r\nbpe>>=1; //bpe=number of bits in one element of the array representing the bigInt\r\nmask=(1<<bpe)-1; //AND the mask with an integer to get its bpe least significant bits\r\nradix=mask+1; //2^bpe. a single 1 bit to the left of the first bit of mask\r\nexport var one=int2bigInt(1,1,1); //constant used in powMod_()\r\n\r\n//the following global variables are scratchpad memory to\r\n//reduce dynamic memory allocation in the inner loop\r\nvar t=new Array(0);\r\nvar ss=t; //used in mult_()\r\nvar s0=t; //used in multMod_(), squareMod_()\r\nvar s1=t; //used in powMod_(), multMod_(), squareMod_()\r\nvar s2=t; //used in powMod_(), multMod_()\r\nvar s3=t; //used in powMod_()\r\nvar s4=t, s5=t; //used in mod_()\r\nvar s6=t; //used in bigInt2str()\r\nvar s7=t; //used in powMod_()\r\nvar T=t; //used in GCD_()\r\nvar sa=t; //used in mont_()\r\nvar mr_x1=t, mr_r=t, mr_a=t, //used in millerRabin()\r\neg_v=t, eg_u=t, eg_A=t, eg_B=t, eg_C=t, eg_D=t, //used in eGCD_(), inverseMod_()\r\nmd_q1=t, md_q2=t, md_q3=t, md_r=t, md_r1=t, md_r2=t, md_tt=t, //used in mod_()\r\n\r\nprimes=t, pows=t, s_i=t, s_i2=t, s_R=t, s_rm=t, s_q=t, s_n1=t,\r\n s_a=t, s_r2=t, s_n=t, s_b=t, s_d=t, s_x1=t, s_x2=t, s_aa=t, //used in randTruePrime_()\r\n\r\nrpprb=t; //used in randProbPrimeRounds() (which also uses \"primes\")\r\n\r\n////////////////////////////////////////////////////////////////////////////////////////\r\n\r\nvar k, buff\r\n\r\n//return array of all primes less than integer n\r\nfunction findPrimes(n) {\r\n var i,s,p,ans;\r\n s=new Array(n);\r\n for (i=0;i<n;i++)\r\n s[i]=0;\r\n s[0]=2;\r\n p=0; //first p elements of s are primes, the rest are a sieve\r\n for(;s[p]<n;) { //s[p] is the pth prime\r\n for(i=s[p]*s[p]; i<n; i+=s[p]) //mark multiples of s[p]\r\n s[i]=1;\r\n p++;\r\n s[p]=s[p-1]+1;\r\n for(; s[p]<n && s[s[p]]; s[p]++); //find next prime (where s[p]==0)\r\n }\r\n ans=new Array(p);\r\n for(i=0;i<p;i++)\r\n ans[i]=s[i];\r\n return ans;\r\n}\r\n\r\n\r\n//does a single round of Miller-Rabin base b consider x to be a possible prime?\r\n//x is a bigInt, and b is an integer, with b<x\r\nfunction millerRabinInt(x,b) {\r\n if (mr_x1.length!=x.length) {\r\n mr_x1=dup(x);\r\n mr_r=dup(x);\r\n mr_a=dup(x);\r\n }\r\n\r\n copyInt_(mr_a,b);\r\n return millerRabin(x,mr_a);\r\n}\r\n\r\n//does a single round of Miller-Rabin base b consider x to be a possible prime?\r\n//x and b are bigInts with b<x\r\nfunction millerRabin(x,b) {\r\n var i,j,k,s;\r\n\r\n if (mr_x1.length!=x.length) {\r\n mr_x1=dup(x);\r\n mr_r=dup(x);\r\n mr_a=dup(x);\r\n }\r\n\r\n copy_(mr_a,b);\r\n copy_(mr_r,x);\r\n copy_(mr_x1,x);\r\n\r\n addInt_(mr_r,-1);\r\n addInt_(mr_x1,-1);\r\n\r\n //s=the highest power of two that divides mr_r\r\n k=0;\r\n for (i=0;i<mr_r.length;i++)\r\n for (j=1;j<mask;j<<=1)\r\n if (x[i] & j) {\r\n s=(k<mr_r.length+bpe ? k : 0);\r\n i=mr_r.length;\r\n j=mask;\r\n } else\r\n k++;\r\n\r\n if (s)\r\n rightShift_(mr_r,s);\r\n\r\n powMod_(mr_a,mr_r,x);\r\n\r\n if (!equalsInt(mr_a,1) && !equals(mr_a,mr_x1)) {\r\n j=1;\r\n while (j<=s-1 && !equals(mr_a,mr_x1)) {\r\n squareMod_(mr_a,x);\r\n if (equalsInt(mr_a,1)) {\r\n return 0;\r\n }\r\n j++;\r\n }\r\n if (!equals(mr_a,mr_x1)) {\r\n return 0;\r\n }\r\n }\r\n return 1;\r\n}\r\n\r\n//returns how many bits long the bigInt is, not counting leading zeros.\r\nfunction bitSize(x) {\r\n var j,z,w;\r\n for (j=x.length-1; (x[j]==0) && (j>0); j--);\r\n for (z=0,w=x[j]; w; (w>>=1),z++);\r\n z+=bpe*j;\r\n return z;\r\n}\r\n\r\n//return a copy of x with at least n elements, adding leading zeros if needed\r\nfunction expand(x,n) {\r\n var ans=int2bigInt(0,(x.length>n ? x.length : n)*bpe,0);\r\n copy_(ans,x);\r\n return ans;\r\n}\r\n\r\n//return a k-bit true random prime using Maurer's algorithm.\r\nfunction randTruePrime(k) {\r\n var ans=int2bigInt(0,k,0);\r\n randTruePrime_(ans,k);\r\n return trim(ans,1);\r\n}\r\n\r\n//return a k-bit random probable prime with probability of error < 2^-80\r\nfunction randProbPrime(k) {\r\n if (k>=600) return randProbPrimeRounds(k,2); //numbers from HAC table 4.3\r\n if (k>=550) return randProbPrimeRounds(k,4);\r\n if (k>=500) return randProbPrimeRounds(k,5);\r\n if (k>=400) return randProbPrimeRounds(k,6);\r\n if (k>=350) return randProbPrimeRounds(k,7);\r\n if (k>=300) return randProbPrimeRounds(k,9);\r\n if (k>=250) return randProbPrimeRounds(k,12); //numbers from HAC table 4.4\r\n if (k>=200) return randProbPrimeRounds(k,15);\r\n if (k>=150) return randProbPrimeRounds(k,18);\r\n if (k>=100) return randProbPrimeRounds(k,27);\r\n return randProbPrimeRounds(k,40); //number from HAC remark 4.26 (only an estimate)\r\n}\r\n\r\n//return a k-bit probable random prime using n rounds of Miller Rabin (after trial division with small primes)\r\nfunction randProbPrimeRounds(k,n) {\r\n var ans, i, divisible, B;\r\n B=30000; //B is largest prime to use in trial division\r\n ans=int2bigInt(0,k,0);\r\n\r\n //optimization: try larger and smaller B to find the best limit.\r\n\r\n if (primes.length==0)\r\n primes=findPrimes(30000); //check for divisibility by primes <=30000\r\n\r\n if (rpprb.length!=ans.length)\r\n rpprb=dup(ans);\r\n\r\n for (;;) { //keep trying random values for ans until one appears to be prime\r\n //optimization: pick a random number times L=2*3*5*...*p, plus a\r\n // random element of the list of all numbers in [0,L) not divisible by any prime up to p.\r\n // This can reduce the amount of random number generation.\r\n\r\n randBigInt_(ans,k,0); //ans = a random odd number to check\r\n ans[0] |= 1;\r\n divisible=0;\r\n\r\n //check ans for divisibility by small primes up to B\r\n for (i=0; (i<primes.length) && (primes[i]<=B); i++)\r\n if (modInt(ans,primes[i])==0 && !equalsInt(ans,primes[i])) {\r\n divisible=1;\r\n break;\r\n }\r\n\r\n //optimization: change millerRabin so the base can be bigger than the number being checked, then eliminate the while here.\r\n\r\n //do n rounds of Miller Rabin, with random bases less than ans\r\n for (i=0; i<n && !divisible; i++) {\r\n randBigInt_(rpprb,k,0);\r\n while(!greater(ans,rpprb)) //pick a random rpprb that's < ans\r\n randBigInt_(rpprb,k,0);\r\n if (!millerRabin(ans,rpprb))\r\n divisible=1;\r\n }\r\n\r\n if(!divisible)\r\n return ans;\r\n }\r\n}\r\n\r\n//return a new bigInt equal to (x mod n) for bigInts x and n.\r\nfunction mod(x,n) {\r\n var ans=dup(x);\r\n mod_(ans,n);\r\n return trim(ans,1);\r\n}\r\n\r\n//return (x+n) where x is a bigInt and n is an integer.\r\nfunction addInt(x,n) {\r\n var ans=expand(x,x.length+1);\r\n addInt_(ans,n);\r\n return trim(ans,1);\r\n}\r\n\r\n//return x*y for bigInts x and y. This is faster when y<x.\r\nfunction mult(x,y) {\r\n var ans=expand(x,x.length+y.length);\r\n mult_(ans,y);\r\n return trim(ans,1);\r\n}\r\n\r\n//return (x**y mod n) where x,y,n are bigInts and ** is exponentiation. 0**0=1. Faster for odd n.\r\nexport function powMod(x,y,n) {\r\n var ans=expand(x,n.length);\r\n powMod_(ans,trim(y,2),trim(n,2),0); //this should work without the trim, but doesn't\r\n return trim(ans,1);\r\n}\r\n\r\n//return (x-y) for bigInts x and y. Negative answers will be 2s complement\r\nfunction sub(x,y) {\r\n var ans=expand(x,(x.length>y.length ? x.length+1 : y.length+1));\r\n sub_(ans,y);\r\n return trim(ans,1);\r\n}\r\n\r\n//return (x+y) for bigInts x and y.\r\nfunction add(x,y) {\r\n var ans=expand(x,(x.length>y.length ? x.length+1 : y.length+1));\r\n add_(ans,y);\r\n return trim(ans,1);\r\n}\r\n\r\n//return (x**(-1) mod n) for bigInts x and n. If no inverse exists, it returns null\r\nfunction inverseMod(x,n) {\r\n var ans=expand(x,n.length);\r\n var s;\r\n s=inverseMod_(ans,n);\r\n return s ? trim(ans,1) : null;\r\n}\r\n\r\n//return (x*y mod n) for bigInts x,y,n. For greater speed, let y<x.\r\nfunction multMod(x,y,n) {\r\n var ans=expand(x,n.length);\r\n multMod_(ans,y,n);\r\n return trim(ans,1);\r\n}\r\n\r\n//generate a k-bit true random prime using Maurer's algorithm,\r\n//and put it into ans. The bigInt ans must be large enough to hold it.\r\nfunction randTruePrime_(ans,k) {\r\n var c,m,pm,dd,j,r,B,divisible,z,zz,recSize;\r\n\r\n if (primes.length==0)\r\n primes=findPrimes(30000); //check for divisibility by primes <=30000\r\n\r\n if (pows.length==0) {\r\n pows=new Array(512);\r\n for (j=0;j<512;j++) {\r\n pows[j]=Math.pow(2,j/511.-1.);\r\n }\r\n }\r\n\r\n //c and m should be tuned for a particular machine and value of k, to maximize speed\r\n c=0.1; //c=0.1 in HAC\r\n m=20; //generate this k-bit number by first recursively generating a number that has between k/2 and k-m bits\r\n recLimit=20; //stop recursion when k <=recLimit. Must have recLimit >= 2\r\n\r\n if (s_i2.length!=ans.length) {\r\n s_i2=dup(ans);\r\n s_R =dup(ans);\r\n s_n1=dup(ans);\r\n s_r2=dup(ans);\r\n s_d =dup(ans);\r\n s_x1=dup(ans);\r\n s_x2=dup(ans);\r\n s_b =dup(ans);\r\n s_n =dup(ans);\r\n s_i =dup(ans);\r\n s_rm=dup(ans);\r\n s_q =dup(ans);\r\n s_a =dup(ans);\r\n s_aa=dup(ans);\r\n }\r\n\r\n if (k <= recLimit) { //generate small random primes by trial division up to its square root\r\n pm=(1<<((k+2)>>1))-1; //pm is binary number with all ones, just over sqrt(2^k)\r\n copyInt_(ans,0);\r\n for (dd=1;dd;) {\r\n dd=0;\r\n ans[0]= 1 | (1<<(k-1)) | Math.floor(Math.random()*(1<<k)); //random, k-bit, odd integer, with msb 1\r\n for (j=1;(j<primes.length) && ((primes[j]&pm)==primes[j]);j++) { //trial division by all primes 3...sqrt(2^k)\r\n if (0==(ans[0]%primes[j])) {\r\n dd=1;\r\n break;\r\n }\r\n }\r\n }\r\n carry_(ans);\r\n return;\r\n }\r\n\r\n B=c*k*k; //try small primes up to B (or all the primes[] array if the largest is less than B).\r\n if (k>2*m) //generate this k-bit number by first recursively generating a number that has between k/2 and k-m bits\r\n for (r=1; k-k*r<=m; )\r\n r=pows[Math.floor(Math.random()*512)]; //r=Math.pow(2,Math.random()-1);\r\n else\r\n r=.5;\r\n\r\n //simulation suggests the more complex algorithm using r=.333 is only slightly faster.\r\n\r\n recSize=Math.floor(r*k)+1;\r\n\r\n randTruePrime_(s_q,recSize);\r\n copyInt_(s_i2,0);\r\n s_i2[Math.floor((k-2)/bpe)] |= (1<<((k-2)%bpe)); //s_i2=2^(k-2)\r\n divide_(s_i2,s_q,s_i,s_rm); //s_i=floor((2^(k-1))/(2q))\r\n\r\n z=bitSize(s_i);\r\n\r\n for (;;) {\r\n for (;;) { //generate z-bit numbers until one falls in the range [0,s_i-1]\r\n randBigInt_(s_R,z,0);\r\n if (greater(s_i,s_R))\r\n break;\r\n } //now s_R is in the range [0,s_i-1]\r\n addInt_(s_R,1); //now s_R is in the range [1,s_i]\r\n add_(s_R,s_i); //now s_R is in the range [s_i+1,2*s_i]\r\n\r\n copy_(s_n,s_q);\r\n mult_(s_n,s_R);\r\n multInt_(s_n,2);\r\n addInt_(s_n,1); //s_n=2*s_R*s_q+1\r\n\r\n copy_(s_r2,s_R);\r\n multInt_(s_r2,2); //s_r2=2*s_R\r\n\r\n //check s_n for divisibility by small primes up to B\r\n for (divisible=0,j=0; (j<primes.length) && (primes[j]<B); j++)\r\n if (modInt(s_n,primes[j])==0 && !equalsInt(s_n,primes[j])) {\r\n divisible=1;\r\n break;\r\n }\r\n\r\n if (!divisible) //if it passes small primes check, then try a single Miller-Rabin base 2\r\n if (!millerRabinInt(s_n,2)) //this line represents 75% of the total runtime for randTruePrime_\r\n divisible=1;\r\n\r\n if (!divisible) { //if it passes that test, continue checking s_n\r\n addInt_(s_n,-3);\r\n for (j=s_n.length-1;(s_n[j]==0) && (j>0); j--); //strip leading zeros\r\n for (zz=0,w=s_n[j]; w; (w>>=1),zz++);\r\n zz+=bpe*j; //zz=number of bits in s_n, ignoring leading zeros\r\n for (;;) { //generate z-bit numbers until one falls in the range [0,s_n-1]\r\n randBigInt_(s_a,zz,0);\r\n if (greater(s_n,s_a))\r\n break;\r\n } //now s_a is in the range [0,s_n-1]\r\n addInt_(s_n,3); //now s_a is in the range [0,s_n-4]\r\n addInt_(s_a,2); //now s_a is in the range [2,s_n-2]\r\n copy_(s_b,s_a);\r\n copy_(s_n1,s_n);\r\n addInt_(s_n1,-1);\r\n powMod_(s_b,s_n1,s_n); //s_b=s_a^(s_n-1) modulo s_n\r\n addInt_(s_b,-1);\r\n if (isZero(s_b)) {\r\n copy_(s_b,s_a);\r\n powMod_(s_b,s_r2,s_n);\r\n addInt_(s_b,-1);\r\n copy_(s_aa,s_n);\r\n copy_(s_d,s_b);\r\n GCD_(s_d,s_n); //if s_b and s_n are relatively prime, then s_n is a prime\r\n if (equalsInt(s_d,1)) {\r\n copy_(ans,s_aa);\r\n return; //if we've made it this far, then s_n is absolutely guaranteed to be prime\r\n }\r\n }\r\n }\r\n }\r\n}\r\n\r\n//Return an n-bit random BigInt (n>=1). If s=1, then the most significant of those n bits is set to 1.\r\nfunction randBigInt(n,s) {\r\n var a,b;\r\n a=Math.floor((n-1)/bpe)+2; //# array elements to hold the BigInt with a leading 0 element\r\n b=int2bigInt(0,0,a);\r\n randBigInt_(b,n,s);\r\n return b;\r\n}\r\n\r\n//Set b to an n-bit random BigInt. If s=1, then the most significant of those n bits is set to 1.\r\n//Array b must be big enough to hold the result. Must have n>=1\r\nfunction randBigInt_(b,n,s) {\r\n var i,a;\r\n for (i=0;i<b.length;i++)\r\n b[i]=0;\r\n a=Math.floor((n-1)/bpe)+1; //# array elements to hold the BigInt\r\n for (i=0;i<a;i++) {\r\n b[i]=Math.floor(Math.random()*(1<<(bpe-1)));\r\n }\r\n b[a-1] &= (2<<((n-1)%bpe))-1;\r\n if (s==1)\r\n b[a-1] |= (1<<((n-1)%bpe));\r\n}\r\n\r\n//Return the greatest common divisor of bigInts x and y (each with same number of elements).\r\nfunction GCD(x,y) {\r\n var xc,yc;\r\n xc=dup(x);\r\n yc=dup(y);\r\n GCD_(xc,yc);\r\n return xc;\r\n}\r\n\r\n//set x to the greatest common divisor of bigInts x and y (each with same number of elements).\r\n//y is destroyed.\r\nfunction GCD_(x,y) {\r\n var i,xp,yp,A,B,C,D,q,sing;\r\n if (T.length!=x.length)\r\n T=dup(x);\r\n\r\n sing=1;\r\n while (sing) { //while y has nonzero elements other than y[0]\r\n sing=0;\r\n for (i=1;i<y.length;i++) //check if y has nonzero elements other than 0\r\n if (y[i]) {\r\n sing=1;\r\n break;\r\n }\r\n if (!sing) break; //quit when y all zero elements except possibly y[0]\r\n\r\n for (i=x.length;!x[i] && i>=0;i--); //find most significant element of x\r\n xp=x[i];\r\n yp=y[i];\r\n A=1; B=0; C=0; D=1;\r\n while ((yp+C) && (yp+D)) {\r\n q =Math.floor((xp+A)/(yp+C));\r\n qp=Math.floor((xp+B)/(yp+D));\r\n if (q!=qp)\r\n break;\r\n t= A-q*C; A=C; C=t; // do (A,B,xp, C,D,yp) = (C,D,yp, A,B,xp) - q*(0,0,0, C,D,yp)\r\n t= B-q*D; B=D; D=t;\r\n t=xp-q*yp; xp=yp; yp=t;\r\n }\r\n if (B) {\r\n copy_(T,x);\r\n linComb_(x,y,A,B); //x=A*x+B*y\r\n linComb_(y,T,D,C); //y=D*y+C*T\r\n } else {\r\n mod_(x,y);\r\n copy_(T,x);\r\n copy_(x,y);\r\n copy_(y,T);\r\n }\r\n }\r\n if (y[0]==0)\r\n return;\r\n t=modInt(x,y[0]);\r\n copyInt_(x,y[0]);\r\n y[0]=t;\r\n while (y[0]) {\r\n x[0]%=y[0];\r\n t=x[0]; x[0]=y[0]; y[0]=t;\r\n }\r\n}\r\n\r\n//do x=x**(-1) mod n, for bigInts x and n.\r\n//If no inverse exists, it sets x to zero and returns 0, else it returns 1.\r\n//The x array must be at least as large as the n array.\r\nfunction inverseMod_(x,n) {\r\n var k=1+2*Math.max(x.length,n.length);\r\n\r\n if(!(x[0]&1) && !(n[0]&1)) { //if both inputs are even, then inverse doesn't exist\r\n copyInt_(x,0);\r\n return 0;\r\n }\r\n\r\n if (eg_u.length!=k) {\r\n eg_u=new Array(k);\r\n eg_v=new Array(k);\r\n eg_A=new Array(k);\r\n eg_B=new Array(k);\r\n eg_C=new Array(k);\r\n eg_D=new Array(k);\r\n }\r\n\r\n copy_(eg_u,x);\r\n copy_(eg_v,n);\r\n copyInt_(eg_A,1);\r\n copyInt_(eg_B,0);\r\n copyInt_(eg_C,0);\r\n copyInt_(eg_D,1);\r\n for (;;) {\r\n while(!(eg_u[0]&1)) { //while eg_u is even\r\n halve_(eg_u);\r\n if (!(eg_A[0]&1) && !(eg_B[0]&1)) { //if eg_A==eg_B==0 mod 2\r\n halve_(eg_A);\r\n halve_(eg_B);\r\n } else {\r\n add_(eg_A,n); halve_(eg_A);\r\n sub_(eg_B,x); halve_(eg_B);\r\n }\r\n }\r\n\r\n while (!(eg_v[0]&1)) { //while eg_v is even\r\n halve_(eg_v);\r\n if (!(eg_C[0]&1) && !(eg_D[0]&1)) { //if eg_C==eg_D==0 mod 2\r\n halve_(eg_C);\r\n halve_(eg_D);\r\n } else {\r\n add_(eg_C,n); halve_(eg_C);\r\n sub_(eg_D,x); halve_(eg_D);\r\n }\r\n }\r\n\r\n if (!greater(eg_v,eg_u)) { //eg_v <= eg_u\r\n sub_(eg_u,eg_v);\r\n sub_(eg_A,eg_C);\r\n sub_(eg_B,eg_D);\r\n } else { //eg_v > eg_u\r\n sub_(eg_v,eg_u);\r\n sub_(eg_C,eg_A);\r\n sub_(eg_D,eg_B);\r\n }\r\n\r\n if (equalsInt(eg_u,0)) {\r\n while (negative(eg_C)) //make sure answer is nonnegative\r\n add_(eg_C,n);\r\n copy_(x,eg_C);\r\n\r\n if (!equalsInt(eg_v,1)) { //if GCD_(x,n)!=1, then there is no inverse\r\n copyInt_(x,0);\r\n return 0;\r\n }\r\n return 1;\r\n }\r\n }\r\n}\r\n\r\n//return x**(-1) mod n, for integers x and n. Return 0 if there is no inverse\r\nfunction inverseModInt(x,n) {\r\n var a=1,b=0,t;\r\n for (;;) {\r\n if (x==1) return a;\r\n if (x==0) return 0;\r\n b-=a*Math.floor(n/x);\r\n n%=x;\r\n\r\n if (n==1) return b; //to avoid negatives, change this b to n-b, and each -= to +=\r\n if (n==0) return 0;\r\n a-=b*Math.floor(x/n);\r\n x%=n;\r\n }\r\n}\r\n\r\n//this deprecated function is for backward compatibility only.\r\nfunction inverseModInt_(x,n) {\r\n return inverseModInt(x,n);\r\n}\r\n\r\n\r\n//Given positive bigInts x and y, change the bigints v, a, and b to positive bigInts such that:\r\n// v = GCD_(x,y) = a*x-b*y\r\n//The bigInts v, a, b, must have exactly as many elements as the larger of x and y.\r\nexport function eGCD_(x,y,v,a,b) {\r\n var g=0;\r\n var k=Math.max(x.length,y.length);\r\n if (eg_u.length!=k) {\r\n eg_u=new Array(k);\r\n eg_A=new Array(k);\r\n eg_B=new Array(k);\r\n eg_C=new Array(k);\r\n eg_D=new Array(k);\r\n }\r\n while(!(x[0]&1) && !(y[0]&1)) { //while x and y both even\r\n halve_(x);\r\n halve_(y);\r\n g++;\r\n }\r\n copy_(eg_u,x);\r\n copy_(v,y);\r\n copyInt_(eg_A,1);\r\n copyInt_(eg_B,0);\r\n copyInt_(eg_C,0);\r\n copyInt_(eg_D,1);\r\n for (;;) {\r\n while(!(eg_u[0]&1)) { //while u is even\r\n halve_(eg_u);\r\n if (!(eg_A[0]&1) && !(eg_B[0]&1)) { //if A==B==0 mod 2\r\n halve_(eg_A);\r\n halve_(eg_B);\r\n } else {\r\n add_(eg_A,y); halve_(eg_A);\r\n sub_(eg_B,x); halve_(eg_B);\r\n }\r\n }\r\n\r\n while (!(v[0]&1)) { //while v is even\r\n halve_(v);\r\n if (!(eg_C[0]&1) && !(eg_D[0]&1)) { //if C==D==0 mod 2\r\n halve_(eg_C);\r\n halve_(eg_D);\r\n } else {\r\n add_(eg_C,y); halve_(eg_C);\r\n sub_(eg_D,x); halve_(eg_D);\r\n }\r\n }\r\n\r\n if (!greater(v,eg_u)) { //v<=u\r\n sub_(eg_u,v);\r\n sub_(eg_A,eg_C);\r\n sub_(eg_B,eg_D);\r\n } else { //v>u\r\n sub_(v,eg_u);\r\n sub_(eg_C,eg_A);\r\n sub_(eg_D,eg_B);\r\n }\r\n if (equalsInt(eg_u,0)) {\r\n while (negative(eg_C)) { //make sure a (C) is nonnegative\r\n add_(eg_C,y);\r\n sub_(eg_D,x);\r\n }\r\n multInt_(eg_D,-1); ///make sure b (D) is nonnegative\r\n copy_(a,eg_C);\r\n copy_(b,eg_D);\r\n leftShift_(v,g);\r\n return;\r\n }\r\n }\r\n}\r\n\r\n\r\n//is bigInt x negative?\r\nfunction negative(x) {\r\n return ((x[x.length-1]>>(bpe-1))&1);\r\n}\r\n\r\n\r\n//is (x << (shift*bpe)) > y?\r\n//x and y are nonnegative bigInts\r\n//shift is a nonnegative integer\r\nfunction greaterShift(x,y,shift) {\r\n var i, kx=x.length, ky=y.length;\r\n k=((kx+shift)<ky) ? (kx+shift) : ky;\r\n for (i=ky-1-shift; i<kx && i>=0; i++)\r\n if (x[i]>0)\r\n return 1; //if there are nonzeros in x to the left of the first column of y, then x is bigger\r\n for (i=kx-1+shift; i<ky; i++)\r\n if (y[i]>0)\r\n return 0; //if there are nonzeros in y to the left of the first column of x, then x is not bigger\r\n for (i=k-1; i>=shift; i--)\r\n if (x[i-shift]>y[i]) return 1;\r\n else if (x[i-shift]<y[i]) return 0;\r\n return 0;\r\n}\r\n\r\n//is x > y? (x and y both nonnegative)\r\nexport function greater(x,y) {\r\n var i;\r\n var k=(x.length<y.length) ? x.length : y.length;\r\n\r\n for (i=x.length;i<y.length;i++)\r\n if (y[i])\r\n return 0; //y has more digits\r\n\r\n for (i=y.length;i<x.length;i++)\r\n if (x[i])\r\n return 1; //x has more digits\r\n\r\n for (i=k-1;i>=0;i--)\r\n if (x[i]>y[i])\r\n return 1;\r\n else if (x[i]<y[i])\r\n return 0;\r\n return 0;\r\n}\r\n\r\n//divide x by y giving quotient q and remainder r. (q=floor(x/y), r=x mod y). All 4 are bigints.\r\n//x must have at least one leading zero element.\r\n//y must be nonzero.\r\n//q and r must be arrays that are exactly the same length as x. (Or q can have more).\r\n//Must have x.length >= y.length >= 2.\r\nexport function divide_(x,y,q,r) {\r\n var kx, ky;\r\n var i,j,y1,y2,c,a,b;\r\n copy_(r,x);\r\n for (ky=y.length;y[ky-1]==0;ky--); //ky is number of elements in y, not including leading zeros\r\n\r\n //normalize: ensure the most significant element of y has its highest bit set\r\n b=y[ky-1];\r\n for (a=0; b; a++)\r\n b>>=1;\r\n a=bpe-a; //a is how many bits to shift so that the high order bit of y is leftmost in its array element\r\n leftShift_(y,a); //multiply both by 1<<a now, then divide both by that at the end\r\n leftShift_(r,a);\r\n\r\n //Rob Visser discovered a bug: the following line was originally just before the normalization.\r\n for (kx=r.length;r[kx-1]==0 && kx>ky;kx--); //kx is number of elements in normalized x, not including leading zeros\r\n\r\n copyInt_(q,0); // q=0\r\n while (!greaterShift(y,r,kx-ky)) { // while (leftShift_(y,kx-ky) <= r) {\r\n subShift_(r,y,kx-ky); // r=r-leftShift_(y,kx-ky)\r\n q[kx-ky]++; // q[kx-ky]++;\r\n } // }\r\n\r\n for (i=kx-1; i>=ky; i--) {\r\n if (r[i]==y[ky-1])\r\n q[i-ky]=mask;\r\n else\r\n q[i-ky]=Math.floor((r[i]*radix+r[i-1])/y[ky-1]);\r\n\r\n //The following for(;;) loop is equivalent to the commented while loop,\r\n //except that the uncommented version avoids overflow.\r\n //The commented loop comes from HAC, which assumes r[-1]==y[-1]==0\r\n // while (q[i-ky]*(y[ky-1]*radix+y[ky-2]) > r[i]*radix*radix+r[i-1]*radix+r[i-2])\r\n // q[i-ky]--;\r\n for (;;) {\r\n y2=(ky>1 ? y[ky-2] : 0)*q[i-ky];\r\n c=y2>>bpe;\r\n y2=y2 & mask;\r\n y1=c+q[i-ky]*y[ky-1];\r\n c=y1>>bpe;\r\n y1=y1 & mask;\r\n\r\n if (c==r[i] ? y1==r[i-1] ? y2>(i>1 ? r[i-2] : 0) : y1>r[i-1] : c>r[i])\r\n q[i-ky]--;\r\n else\r\n break;\r\n }\r\n\r\n linCombShift_(r,y,-q[i-ky],i-ky); //r=r-q[i-ky]*leftShift_(y,i-ky)\r\n if (negative(r)) {\r\n addShift_(r,y,i-ky); //r=r+leftShift_(y,i-ky)\r\n q[i-ky]--;\r\n }\r\n }\r\n\r\n rightShift_(y,a); //undo the normalization step\r\n rightShift_(r,a); //undo the normalization step\r\n}\r\n\r\n//do carries and borrows so each element of the bigInt x fits in bpe bits.\r\nfunction carry_(x) {\r\n var i,k,c,b;\r\n k=x.length;\r\n c=0;\r\n for (i=0;i<k;i++) {\r\n c+=x[i];\r\n b=0;\r\n if (c<0) {\r\n b=-(c>>bpe);\r\n c+=b*radix;\r\n }\r\n x[i]=c & mask;\r\n c=(c>>bpe)-b;\r\n }\r\n}\r\n\r\n//return x mod n for bigInt x and integer n.\r\nfunction modInt(x,n) {\r\n var i,c=0;\r\n for (i=x.length-1; i>=0; i--)\r\n c=(c*radix+x[i])%n;\r\n return c;\r\n}\r\n\r\n//convert the integer t into a bigInt with at least the given number of bits.\r\n//the returned array stores the bigInt in bpe-bit chunks, little endian (buff[0] is least significant word)\r\n//Pad the array with leading zeros so that it has at least minSize elements.\r\n//There will always be at least one leading 0 element.\r\nfunction int2bigInt(t,bits,minSize) {\r\n var i,k;\r\n k=Math.ceil(bits/bpe)+1;\r\n k=minSize>k ? minSize : k;\r\n var buff=new Array(k);\r\n copyInt_(buff,t);\r\n return buff;\r\n}\r\n\r\n//return the bigInt given a string representation in a given base.\r\n//Pad the array with leading zeros so that it has at least minSize elements.\r\n//If base=-1, then it reads in a space-separated list of array elements in decimal.\r\n//The array will always have at least one leading zero, unless base=-1.\r\nexport function str2bigInt(s,base,minSize) {\r\n var d, i, j, x, y, kk;\r\n var k=s.length;\r\n if (base==-1) { //comma-separated list of array elements in decimal\r\n x=new Array(0);\r\n for (;;) {\r\n y=new Array(x.length+1);\r\n for (i=0;i<x.length;i++)\r\n y[i+1]=x[i];\r\n y[0]=parseInt(s,10);\r\n x=y;\r\n d=s.indexOf(',',0);\r\n if (d<1)\r\n break;\r\n s=s.substring(d+1);\r\n if (s.length==0)\r\n break;\r\n }\r\n if (x.length<minSize) {\r\n y=new Array(minSize);\r\n copy_(y,x);\r\n return y;\r\n }\r\n return x;\r\n }\r\n\r\n x=int2bigInt(0,base*k,0);\r\n for (i=0;i<k;i++) {\r\n d=digitsStr.indexOf(s.substring(i,i+1),0);\r\n if (base<=36 && d>=36) //convert lowercase to uppercase if base<=36\r\n d-=26;\r\n if (d>=base || d<0) { //stop at first illegal character\r\n break;\r\n }\r\n multInt_(x,base);\r\n addInt_(x,d);\r\n }\r\n\r\n for (k=x.length;k>0 && !x[k-1];k--); //strip off leading zeros\r\n k=minSize>k+1 ? minSize : k+1;\r\n y=new Array(k);\r\n kk=k<x.length ? k : x.length;\r\n for (i=0;i<kk;i++)\r\n y[i]=x[i];\r\n for (;i<k;i++)\r\n y[i]=0;\r\n return y;\r\n}\r\n\r\n//is bigint x equal to integer y?\r\n//y must have less than bpe bits\r\nexport function equalsInt(x,y) {\r\n var i;\r\n if (x[0]!=y)\r\n return 0;\r\n for (i=1;i<x.length;i++)\r\n if (x[i])\r\n return 0;\r\n return 1;\r\n}\r\n\r\n//are bigints x and y equal?\r\n//this works even if x and y are different lengths and have arbitrarily many leading zeros\r\nfunction equals(x,y) {\r\n var i;\r\n var k=x.length<y.length ? x.length : y.length;\r\n for (i=0;i<k;i++)\r\n if (x[i]!=y[i])\r\n return 0;\r\n if (x.length>y.length) {\r\n for (;i<x.length;i++)\r\n if (x[i])\r\n return 0;\r\n } else {\r\n for (;i<y.length;i++)\r\n if (y[i])\r\n return 0;\r\n }\r\n return 1;\r\n}\r\n\r\n//is the bigInt x equal to zero?\r\nexport function isZero(x) {\r\n var i;\r\n for (i=0;i<x.length;i++)\r\n if (x[i])\r\n return 0;\r\n return 1;\r\n}\r\n\r\n//convert a bigInt into a string in a given base, from base 2 up to base 95.\r\n//Base -1 prints the contents of the array representing the number.\r\nexport function bigInt2str(x,base) {\r\n var i,t,s=\"\";\r\n\r\n if (s6.length!=x.length)\r\n s6=dup(x);\r\n else\r\n copy_(s6,x);\r\n\r\n if (base==-1) { //return the list of array contents\r\n for (i=x.length-1;i>0;i--)\r\n s+=x[i]+',';\r\n s+=x[0];\r\n }\r\n else { //return it in the given base\r\n while (!isZero(s6)) {\r\n t=divInt_(s6,base); //t=s6 % base; s6=floor(s6/base);\r\n s=digitsStr.substring(t,t+1)+s;\r\n }\r\n }\r\n if (s.length==0)\r\n s=\"0\";\r\n return s;\r\n}\r\n\r\n//returns a duplicate of bigInt x\r\nfunction dup(x) {\r\n var i;\r\n buff=new Array(x.length);\r\n copy_(buff,x);\r\n return buff;\r\n}\r\n\r\n//do x=y on bigInts x and y. x must be an array at least as big as y (not counting the leading zeros in y).\r\nexport function copy_(x,y) {\r\n var i;\r\n var k=x.length<y.length ? x.length : y.length;\r\n for (i=0;i<k;i++)\r\n x[i]=y[i];\r\n for (i=k;i<x.length;i++)\r\n x[i]=0;\r\n}\r\n\r\n//do x=y on bigInt x and integer y.\r\nexport function copyInt_(x,n) {\r\n var i,c;\r\n for (c=n,i=0;i<x.length;i++) {\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do x=x+n where x is a bigInt and n is an integer.\r\n//x must be large enough to hold the result.\r\nfunction addInt_(x,n) {\r\n var i,k,c,b;\r\n x[0]+=n;\r\n k=x.length;\r\n c=0;\r\n for (i=0;i<k;i++) {\r\n c+=x[i];\r\n b=0;\r\n if (c<0) {\r\n b=-(c>>bpe);\r\n c+=b*radix;\r\n }\r\n x[i]=c & mask;\r\n c=(c>>bpe)-b;\r\n if (!c) return; //stop carrying as soon as the carry is zero\r\n }\r\n}\r\n\r\n//right shift bigInt x by n bits. 0 <= n < bpe.\r\nexport function rightShift_(x,n) {\r\n var i;\r\n var k=Math.floor(n/bpe);\r\n if (k) {\r\n for (i=0;i<x.length-k;i++) //right shift x by k elements\r\n x[i]=x[i+k];\r\n for (;i<x.length;i++)\r\n x[i]=0;\r\n n%=bpe;\r\n }\r\n for (i=0;i<x.length-1;i++) {\r\n x[i]=mask & ((x[i+1]<<(bpe-n)) | (x[i]>>n));\r\n }\r\n x[i]>>=n;\r\n}\r\n\r\n//do x=floor(|x|/2)*sgn(x) for bigInt x in 2's complement\r\nfunction halve_(x) {\r\n var i;\r\n for (i=0;i<x.length-1;i++) {\r\n x[i]=mask & ((x[i+1]<<(bpe-1)) | (x[i]>>1));\r\n }\r\n x[i]=(x[i]>>1) | (x[i] & (radix>>1)); //most significant bit stays the same\r\n}\r\n\r\n//left shift bigInt x by n bits.\r\nfunction leftShift_(x,n) {\r\n var i;\r\n var k=Math.floor(n/bpe);\r\n if (k) {\r\n for (i=x.length; i>=k; i--) //left shift x by k elements\r\n x[i]=x[i-k];\r\n for (;i>=0;i--)\r\n x[i]=0;\r\n n%=bpe;\r\n }\r\n if (!n)\r\n return;\r\n for (i=x.length-1;i>0;i--) {\r\n x[i]=mask & ((x[i]<<n) | (x[i-1]>>(bpe-n)));\r\n }\r\n x[i]=mask & (x[i]<<n);\r\n}\r\n\r\n//do x=x*n where x is a bigInt and n is an integer.\r\n//x must be large enough to hold the result.\r\nfunction multInt_(x,n) {\r\n var i,k,c,b;\r\n if (!n)\r\n return;\r\n k=x.length;\r\n c=0;\r\n for (i=0;i<k;i++) {\r\n c+=x[i]*n;\r\n b=0;\r\n if (c<0) {\r\n b=-(c>>bpe);\r\n c+=b*radix;\r\n }\r\n x[i]=c & mask;\r\n c=(c>>bpe)-b;\r\n }\r\n}\r\n\r\n//do x=floor(x/n) for bigInt x and integer n, and return the remainder\r\nfunction divInt_(x,n) {\r\n var i,r=0,s;\r\n for (i=x.length-1;i>=0;i--) {\r\n s=r*radix+x[i];\r\n x[i]=Math.floor(s/n);\r\n r=s%n;\r\n }\r\n return r;\r\n}\r\n\r\n//do the linear combination x=a*x+b*y for bigInts x and y, and integers a and b.\r\n//x must be large enough to hold the answer.\r\nfunction linComb_(x,y,a,b) {\r\n var i,c,k,kk;\r\n k=x.length<y.length ? x.length : y.length;\r\n kk=x.length;\r\n for (c=0,i=0;i<k;i++) {\r\n c+=a*x[i]+b*y[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n for (i=k;i<kk;i++) {\r\n c+=a*x[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do the linear combination x=a*x+b*(y<<(ys*bpe)) for bigInts x and y, and integers a, b and ys.\r\n//x must be large enough to hold the answer.\r\nfunction linCombShift_(x,y,b,ys) {\r\n var i,c,k,kk;\r\n k=x.length<ys+y.length ? x.length : ys+y.length;\r\n kk=x.length;\r\n for (c=0,i=ys;i<k;i++) {\r\n c+=x[i]+b*y[i-ys];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n for (i=k;c && i<kk;i++) {\r\n c+=x[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do x=x+(y<<(ys*bpe)) for bigInts x and y, and integers a,b and ys.\r\n//x must be large enough to hold the answer.\r\nfunction addShift_(x,y,ys) {\r\n var i,c,k,kk;\r\n k=x.length<ys+y.length ? x.length : ys+y.length;\r\n kk=x.length;\r\n for (c=0,i=ys;i<k;i++) {\r\n c+=x[i]+y[i-ys];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n for (i=k;c && i<kk;i++) {\r\n c+=x[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do x=x-(y<<(ys*bpe)) for bigInts x and y, and integers a,b and ys.\r\n//x must be large enough to hold the answer.\r\nfunction subShift_(x,y,ys) {\r\n var i,c,k,kk;\r\n k=x.length<ys+y.length ? x.length : ys+y.length;\r\n kk=x.length;\r\n for (c=0,i=ys;i<k;i++) {\r\n c+=x[i]-y[i-ys];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n for (i=k;c && i<kk;i++) {\r\n c+=x[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do x=x-y for bigInts x and y.\r\n//x must be large enough to hold the answer.\r\n//negative answers will be 2s complement\r\nexport function sub_(x,y) {\r\n var i,c,k,kk;\r\n k=x.length<y.length ? x.length : y.length;\r\n for (c=0,i=0;i<k;i++) {\r\n c+=x[i]-y[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n for (i=k;c && i<x.length;i++) {\r\n c+=x[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do x=x+y for bigInts x and y.\r\n//x must be large enough to hold the answer.\r\nexport function add_(x,y) {\r\n var i,c,k,kk;\r\n k=x.length<y.length ? x.length : y.length;\r\n for (c=0,i=0;i<k;i++) {\r\n c+=x[i]+y[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n for (i=k;c && i<x.length;i++) {\r\n c+=x[i];\r\n x[i]=c & mask;\r\n c>>=bpe;\r\n }\r\n}\r\n\r\n//do x=x*y for bigInts x and y. This is faster when y<x.\r\nfunction mult_(x,y) {\r\n var i;\r\n if (ss.length!=2*x.length)\r\n ss=new Array(2*x.length);\r\n copyInt_(ss,0);\r\n for (i=0;i<y.length;i++)\r\n if (y[i])\r\n linCombShift_(ss,x,y[i],i); //ss=1*ss+y[i]*(x<<(i*bpe))\r\n copy_(x,ss);\r\n}\r\n\r\n//do x=x mod n for bigInts x and n.\r\nfunction mod_(x,n) {\r\n if (s4.length!=x.length)\r\n s4=dup(x);\r\n else\r\n copy_(s4,x);\r\n if (s5.length!=x.length)\r\n s5=dup(x);\r\n divide_(s4,n,s5,x); //x = remainder of s4 / n\r\n}\r\n\r\n//do x=x*y mod n for bigInts x,y,n.\r\n//for greater speed, let y<x.\r\nfunction multMod_(x,y,n) {\r\n var i;\r\n if (s0.length!=2*x.length)\r\n s0=new Array(2*x.length);\r\n copyInt_(s0,0);\r\n for (i=0;i<y.length;i++)\r\n if (y[i])\r\n linCombShift_(s0,x,y[i],i); //s0=1*s0+y[i]*(x<<(i*bpe))\r\n mod_(s0,n);\r\n copy_(x,s0);\r\n}\r\n\r\n//do x=x*x mod n for bigInts x,n.\r\nfunction squareMod_(x,n) {\r\n var i,j,d,c,kx,kn,k;\r\n for (kx=x.length; kx>0 && !x[kx-1]; kx--); //ignore leading zeros in x\r\n k=kx>n.length ? 2*kx : 2*n.length; //k=# elements in the product, which is twice the elements in the larger of x and n\r\n if (s0.length!=k)\r\n s0=new Array(k);\r\n copyInt_(s0,0);\r\n for (i=0;i<kx;i++) {\r\n c=s0[2*i]+x[i]*x[i];\r\n s0[2*i]=c & mask;\r\n c>>=bpe;\r\n for (j=i+1;j<kx;j++) {\r\n c=s0[i+j]+2*x[i]*x[j]+c;\r\n s0[i+j]=(c & mask);\r\n c>>=bpe;\r\n }\r\n s0[i+kx]=c;\r\n }\r\n mod_(s0,n);\r\n copy_(x,s0);\r\n}\r\n\r\n//return x with exactly k leading zero elements\r\nfunction trim(x,k) {\r\n var i,y;\r\n for (i=x.length; i>0 && !x[i-1]; i--);\r\n y=new Array(i+k);\r\n copy_(y,x);\r\n return y;\r\n}\r\n\r\n//do x=x**y mod n, where x,y,n are bigInts and ** is exponentiation. 0**0=1.\r\n//this is faster when n is odd. x usually needs to have as many elements as n.\r\nfunction powMod_(x,y,n) {\r\n var k1,k2,kn,np;\r\n if(s7.length!=n.length)\r\n s7=dup(n);\r\n\r\n //for even modulus, use a simple square-and-multiply algorithm,\r\n //rather than using the more complex Montgomery algorithm.\r\n if ((n[0]&1)==0) {\r\n copy_(s7,x);\r\n copyInt_(x,1);\r\n while(!equalsInt(y,0)) {\r\n if (y[0]&1)\r\n multMod_(x,s7,n);\r\n divInt_(y,2);\r\n squareMod_(s7,n);\r\n }\r\n return;\r\n }\r\n\r\n //calculate np from n for the Montgomery multiplications\r\n copyInt_(s7,0);\r\n for (kn=n.length;kn>0 && !n[kn-1];kn--);\r\n np=radix-inverseModInt(modInt(n,radix),radix);\r\n s7[kn]=1;\r\n multMod_(x ,s7,n); // x = x * 2**(kn*bp) mod n\r\n\r\n if (s3.length!=x.length)\r\n s3=dup(x);\r\n else\r\n copy_(s3,x);\r\n\r\n for (k1=y.length-1;k1>0 & !y[k1]; k1--); //k1=first nonzero element of y\r\n if (y[k1]==0) { //anything to the 0th power is 1\r\n copyInt_(x,1);\r\n return;\r\n }\r\n for (k2=1<<(bpe-1);k2 && !(y[k1] & k2); k2>>=1); //k2=position of first 1 bit in y[k1]\r\n for (;;) {\r\n if (!(k2>>=1)) { //look at next bit of y\r\n k1--;\r\n if (k1<0) {\r\n mont_(x,one,n,np);\r\n return;\r\n }\r\n k2=1<<(bpe-1);\r\n }\r\n mont_(x,x,n,np);\r\n\r\n if (k2 & y[k1]) //if next bit is a 1\r\n mont_(x,s3,n,np);\r\n }\r\n}\r\n\r\n\r\n//do x=x*y*Ri mod n for bigInts x,y,n,\r\n// where Ri = 2**(-kn*bpe) mod n, and kn is the\r\n// number of elements in the n array, not\r\n// counting leading zeros.\r\n//x array must have at least as many elemnts as the n array\r\n//It's OK if x and y are the same variable.\r\n//must have:\r\n// x,y < n\r\n// n is odd\r\n// np = -(n^(-1)) mod radix\r\nfunction mont_(x,y,n,np) {\r\n var i,j,c,ui,t,ks;\r\n var kn=n.length;\r\n var ky=y.length;\r\n\r\n if (sa.length!=kn)\r\n sa=new Array(kn);\r\n\r\n copyInt_(sa,0);\r\n\r\n for (;kn>0 && n[kn-1]==0;kn--); //ignore leading zeros of n\r\n for (;ky>0 && y[ky-1]==0;ky--); //ignore leading zeros of y\r\n ks=sa.length-1; //sa will never have more than this many nonzero elements.\r\n\r\n //the following loop consumes 95% of the runtime for randTruePrime_() and powMod_() for large numbers\r\n for (i=0; i<kn; i++) {\r\n t=sa[0]+x[i]*y[0];\r\n ui=((t & mask) * np) & mask; //the inner \"& mask\" was needed on Safari (but not MSIE) at one time\r\n c=(t+ui*n[0]) >> bpe;\r\n t=x[i];\r\n\r\n //do sa=(sa+x[i]*y+ui*n)/b where b=2**bpe. Loop is unrolled 5-fold for speed\r\n j=1;\r\n for (;j<ky-4;) { c+=sa[j]+ui*n[j]+t*y[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]+t*y[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]+t*y[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]+t*y[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]+t*y[j]; sa[j-1]=c & mask; c>>=bpe; j++; }\r\n for (;j<ky;) { c+=sa[j]+ui*n[j]+t*y[j]; sa[j-1]=c & mask; c>>=bpe; j++; }\r\n for (;j<kn-4;) { c+=sa[j]+ui*n[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]; sa[j-1]=c & mask; c>>=bpe; j++;\r\n c+=sa[j]+ui*n[j]; sa[j-1]=c & mask; c>>=bpe; j++; }\r\n for (;j<kn;) { c+=sa[j]+ui*n[j]; sa[j-1]=c & mask; c>>=bpe; j++; }\r\n for (;j<ks;) { c+=sa[j]; sa[j-1]=c & mask; c>>=bpe; j++; }\r\n sa[j-1]=c & mask;\r\n }\r\n\r\n if (!greater(n,sa))\r\n sub_(sa,n);\r\n copy_(x,sa);\r\n}\r\n\r\n"]} |