-40) ? 0. : (0.057*Math.exp(-(cS.v+80.)/6.8));\n BH = (cS.v > -40) ? (0.77/(0.13*(1.+Math.exp(-(cS.v+10.66)/11.1)))) \n : (2.7*Math.exp(0.079*cS.v)+(3.1e5)*Math.exp(0.3485*cS.v));\n TAU_H = 1.0/(AH+BH);\n exptauht_t = Math.exp(-cS.timestep/TAU_H);\n\n AJ = (cS.v > -40) ? 0. : (((-2.5428e4)*Math.exp(0.2444*cS.v)-(6.948e-6)*Math.exp(-0.04391*cS.v))*(cS.v+37.78)/(1.+Math.exp(0.311*(cS.v+79.23))));\n BJ = (cS.v > -40) ? (0.6*Math.exp((0.057)*cS.v)/(1.+Math.exp(-0.1*(cS.v+32.))))\n : (0.02424*Math.exp(-0.01052*cS.v)/(1.+Math.exp(-0.1378*(cS.v+40.14))));\n TAU_J = 1.0/(AJ+BJ);\n exptaujt_t = Math.exp(-cS.timestep/TAU_J);\n\n jinft_t = hinft_t;\n\n xr1inft_t = 1.0/(1.+Math.exp((-26.-cS.v)/7.));\n\n axr1 = 450.0/(1.+Math.exp((-45.-cS.v)/10.));\n bxr1 = 6.0/(1.+Math.exp((cS.v-(-30.))/11.5));\n TAU_Xr1 = axr1*bxr1;\n exptauxr1t_t = Math.exp(-cS.timestep/TAU_Xr1);\n\n\n xr2inft_t = 1.0/(1.+Math.exp((cS.v-(-88.))/24.));\n \n axr2 = 3.0/(1.+Math.exp((-60.-cS.v)/20.));\n bxr2 = 1.12/(1.+Math.exp((cS.v-60.)/20.));\n TAU_Xr2 = axr2*bxr2;\n exptauxr2t_t = Math.exp(-cS.timestep/TAU_Xr2);\n\n xsinft_t = 1.0/(1.+ Math.exp((-5.-cS.v)/14.));\n\n Axs = (1400.0/(Math.sqrt(1.+Math.exp((5.-cS.v)/6.))));\n Bxs = (1.0/(1.+ Math.exp((cS.v-35.)/15.)));\n TAU_Xs = Axs*Bxs+80.;\n exptauxst_t = Math.exp(-cS.timestep/TAU_Xs);\n\n rinft_t = ( cS.itype === 'epi') ? 1.0/(1.+ Math.exp((20.- cS.v)/6.)) \n : ( cS.itype === 'endo' ) ? 1.0/(1.+Math.exp((20.-cS.v)/6.))\n : 1.0/(1.+ Math.exp((20.-cS.v)/6.)) ; // (cS.itype === 'M')\n\n sinft_t = ( cS.itype === 'epi') ? 1.0/(1.+Math.exp((cS.v+20.)/5.))\n : ( cS.itype === 'endo' ) ? 1.0/(1.+ Math.exp((cS.v+28.)/5.))\n : 1.0/(1.+ Math.exp((cS.v+20.)/5.)); // (cS.itype === 'M')\n\n TAU_R = ( cS.itype === 'epi') ? 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8\n : ( cS.itype === 'endo' ) ? 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8\n : 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8; // (cS.itype === 'M')\n\n TAU_S = ( cS.itype === 'epi') ? 85.* Math.exp(-(cS.v+45.)*(cS.v+45.)/320.) +5.0/(1.+Math.exp((cS.v-20.)/5.))+3. \n : ( cS.itype === 'endo' ) ? 1000.*Math.exp(-(cS.v+67.)*(cS.v+67.)/1000.)+8.\n : 85.*Math.exp(-(cS.v+45.)*(cS.v+45.)/320.)+5.0/(1.+Math.exp((cS.v-20.)/5.))+3.; // (cS.itype === 'M')\n \n exptaurt_t = Math.exp(-cS.timestep/TAU_R);\n exptaust_t = Math.exp(-cS.timestep/TAU_S);\n \n dinft_t = 1.0/(1.+Math.exp((-8.-cS.v)/7.5));\n \n Ad = 1.4/(1.+Math.exp((-35.-cS.v)/13.))+0.25;\n Bd = 1.4/(1.+Math.exp((cS.v+5.)/5.));\n Cd = 1.0/(1.+Math.exp((50.-cS.v)/20.));\n TAU_D = Ad*Bd+Cd;\n exptaudt_t = Math.exp(-cS.timestep/TAU_D);\n\n finft_t = 1.0/(1.+Math.exp((cS.v+20.)/7.));\n\n Af = 1102.5*Math.exp(-(cS.v+27.)*(cS.v+27.)/225.);\n Bf = 200.0/(1.+Math.exp((13.-cS.v)/10.));\n Cf = (180.0/(1.+Math.exp((cS.v+30.)/10.)))+20.;\n TAU_F = Af+Bf+Cf;\n exptauft_t = Math.exp(-cS.timestep/TAU_F);\n\n f2inft_t = 0.67/(1.+Math.exp((cS.v+35.)/7.))+0.33;\n\n //original code had the following, but paper uses denom of 170**2, not 7**2\n\n Af2 = 600.*Math.exp(-(cS.v+25.)*(cS.v+25.)/49.);\n\n // paper value for Af2 is INCORRECT to match the figure\n //Af2=600.*exp(-(vv+25.)*(vv+25.)/(170.*170.))\n \n Bf2 = 31.0/(1.+Math.exp((25.-cS.v)/10.));\n Cf2 = 16.0/(1.+Math.exp((cS.v+30.)/10.));\n TAU_F2 = Af2+Bf2+Cf2\n exptauf2t_t = Math.exp(-cS.timestep/TAU_F2);\n\n inakcoefft_t = (1.0/(1.+0.1245*Math.exp(-0.1*cS.v*cC.fort)+0.0353*Math.exp(-cS.v*cC.fort)))*cS.knak*(cS.Ko/(cS.Ko+cS.KmK)); \n ipkcoefft_t = cS.GpK/(1.+Math.exp((25.-cS.v)/5.98)); \n temp = Math.exp(2*(cS.v-15)*cC.fort);\n\n if(!(Math.abs(cS.v-15.) < 1e-4)){\n // need implemented\n ical1t_t = cS.GCaL*4.*(cS.v-15.)*(cS.FF*cC.fort)* (0.25*temp)/(temp-1.);\n ical2t_t = cS.GCaL*4.*(cS.v-15.)*(cS.FF*cC.fort)*cS.Cao/(temp-1.);\n }\n \n temp = Math.exp((cS.n-1.)*cS.v*cC.fort);\n temp2 = cS.knaca/((cC.KmNai3+cC.Nao3)*(cS.KmCa+cS.Cao)*(1.+cS.ksat*temp));\n inaca1t_t = temp2*Math.exp(cS.n*cS.v*cC.fort)*cS.Cao;\n inaca2t_t = temp2*temp*cC.Nao3*cS.alphanaca; \n\n\n //reversal potentials\n Ek = cC.rtof*(Math.log((cS.Ko/cS.ki)));\n Ena = cC.rtof*(Math.log((cS.Nao/cS.nai)));\n Eks = cC.rtof*(Math.log((cS.Ko+cS.pKNa*cS.Nao)/(cS.ki+cS.pKNa*cS.nai)));\n Eca = 0.5*cC.rtof*(Math.log((cS.Cao/cS.cai)));\n \n // need to figure out vmek is (cS.v - Ek) \n Ak1 = 0.1/(1.+Math.exp(0.06*((cS.v - Ek)-200.)));\n Bk1 = (3.*Math.exp(0.0002*((cS.v - Ek)+100.))+Math.exp(0.1*((cS.v - Ek)-10.)))/(1.+Math.exp(-0.5*((cS.v - Ek)))); \n ik1coefft_t = cS.GK1*Ak1/(Ak1+Bk1); \n \n fcassinft_t = 0.6/(1+(cS.cass/0.05)*(cS.cass/0.05))+0.4;\n temp = 80.0/(1+(cS.cass/0.05)*(cS.cass/0.05))+2.;\n exptaufcasst_t = Math.exp(-cS.timestep/temp); \n\n //stimulus\n\n cS.Istim = _s1s2Stimulus(count, settings);\n \n //Compute currents\n\n cS.sm = minft_t - (minft_t-cS.sm)*exptaumt_t;\n cS.sh = hinft_t - (hinft_t-cS.sh)*exptauht_t;\n cS.sj = jinft_t - (jinft_t-cS.sj)*exptaujt_t;\n cS.ina = cS.GNa*cS.sm *cS.sm *cS.sm *cS.sh*cS.sj*(cS.v-Ena); \n\n cS.sxr1 = xr1inft_t-(xr1inft_t - cS.sxr1) * exptauxr1t_t;\n\n \n cS.sxr2 = xr2inft_t-(xr2inft_t - cS.sxr2) * exptauxr2t_t;\n \n cS.ikr = cS.Gkr*cC.Gkrfactor*cS.sxr1*cS.sxr2*(cS.v-Ek); \n \n cS.sxs = xsinft_t-(xsinft_t-cS.sxs)*exptauxst_t;\n\n cS.iks = cS.Gks*cS.sxs*cS.sxs*(cS.v-Eks);\n\n cS.sr = rinft_t-(rinft_t-cS.sr)*exptaurt_t;\n\n cS.ss = sinft_t-(sinft_t-cS.ss)*exptaust_t;\n\n cS.ito = cS.Gto*cS.sr*cS.ss*(cS.v-Ek);\n\n cS.sd = dinft_t-(dinft_t-cS.sd)*exptaudt_t;\n\n cS.sf = finft_t-(finft_t-cS.sf)*exptauft_t;\n\n cS.sf2 = f2inft_t-(f2inft_t-cS.sf2)*exptauf2t_t; \n\n FCaSS_INF = (cS.cass > cS.casshi) ? 0.4 : fcassinft_t ;\n\n exptaufcass = (cS.cass > cS.casshi) ? cC.exptaufcassinf : exptaufcasst_t;\n\n cS.sfcass = FCaSS_INF-(FCaSS_INF- cS.sfcass)*exptaufcass;\n\n cS.ical = cS.sd*cS.sf*cS.sf2*cS.sfcass*(ical1t_t* cS.cass - ical2t_t);\n\n cS.ik1 = ik1coefft_t*(cS.v-Ek);\n\n cS.ipk = ipkcoefft_t*(cS.v-Ek);\n\n cS.inaca = inaca1t_t*cS.nai*cS.nai*cS.nai-inaca2t_t*cS.cai;\n\n cS.inak = inakcoefft_t*(cS.nai/(cS.nai+cS.KmNa));\n\n cS.ipca = cS.GpCa*cS.cai/(cS.KpCa+cS.cai);\n\n cS.ibna = cS.GbNa*(cS.v-Ena);\n\n cS.ibca = cS.GbCa*(cS.v-Eca);\n\n //total current\n cS.sItot = cS.ikr+ cS.iks+ cS.ik1+ cS.ito+ cS.ina+ cS.ibna+ cS.ical+ cS.ibca+ cS.inak+ cS.inaca+ cS.ipca+ cS.ipk+ cS.Istim;\n\n //console.log(cS.ikr, cS.iks, cS.ik1, cS.ito, cS.ina, cS.ibna, cS.ical, cS.ibca, cS.inak, cS.inaca, cS.ipca, cS.ipk, cS.Istim);\n\n //update concentrations\n\n kCaSR = cS.maxsr-((cS.maxsr-cS.minsr)/(1+(cS.EC/cS.casr*(cS.EC/cS.casr))));\n k1 = cS.k1prime/kCaSR;\n k2 = cS.k2prime*kCaSR;\n dRR = cS.k4*(1.-cS.srr)-k2*cS.cass*cS.srr;\n cS.srr = cS.srr+cS.timestep*dRR;\n sOO = k1*cS.cass*cS.cass*cS.srr/(cS.k3+k1*cS.cass*cS.cass);\n\n //intracellular calcium currents\n\n cS.Irel = cS.Vrel*sOO*(cS.casr- cS.cass);\n cS.Ileak = cS.Vleak*(cS.casr-cS.cai);\n cS.Iup = cS.Vmaxup/(1.+((cS.Kup*cS.Kup)/(cS.cai*cS.cai)));\n cS.Ixfer = cS.Vxfer*(cS.cass - cS.cai);\n\n\n CaCSQN = cS.Bufsr*cS.casr/(cS.casr+cS.Kbufsr);\n dCaSR = cS.timestep*(cS.Iup-cS.Irel-cS.Ileak);\n bjsr = cS.Bufsr-CaCSQN-dCaSR-cS.casr+cS.Kbufsr;\n cjsr = cS.Kbufsr*(CaCSQN+dCaSR+cS.casr);\n cS.casr = (Math.sqrt(bjsr*bjsr+4.*cjsr)-bjsr)/2.;\n\n CaSSBuf = cS.Bufss * cS.cass/(cS.cass+cS.Kbufss);\n dCaSS = cS.timestep * (-cS.Ixfer*(cS.Vc/cS.Vss)+cS.Irel*(cS.Vsr/cS.Vss)+(-cS.ical*cC.inversevssF2*cS.CAPACITANCE)); \n bcss = cS.Bufss - CaSSBuf - dCaSS - cS.cass+cS.Kbufss;\n ccss = cS.Kbufss*(CaSSBuf+dCaSS+cS.cass);\n cS.cass = (Math.sqrt(bcss*bcss+4.*ccss)-bcss)/2.;\n\n CaBuf = cS.Bufc*cS.cai/(cS.cai+cS.Kbufc);\n dCai = cS.timestep *((-(cS.ibca+cS.ipca-2*cS.inaca)*cC.inverseVcF2*cS.CAPACITANCE)-(cS.Iup-cS.Ileak)*(cS.Vsr/cS.Vc)+cS.Ixfer); \n bc = cS.Bufc-CaBuf-dCai-cS.cai+cS.Kbufc;\n cc = cS.Kbufc*(CaBuf+dCai+cS.cai);\n cS.cai = (Math.sqrt(bc*bc+4.*cc)-bc)/2.;\n\n dNai = -(cS.ina+cS.ibna+3.*cS.inak+3.*cS.inaca)*cC.inverseVcF*cS.CAPACITANCE;\n cS.nai = cS.nai+cS.timestep*dNai;\n\n dKi = -(cS.Istim+cS.ik1+cS.ito+cS.ikr+cS.iks-2.*cS.inak+cS.ipk)*cC.inverseVcF*cS.CAPACITANCE; \n cS.ki = cS.ki+cS.timestep*dKi;\n cS.v = cS.v - cS.sItot * cS.timestep ;\n \n\n //cal ends\n // sets voltage variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\n \n // sets current variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\n \n // iterate the count\n count++;\n\n return data; \n }","function calculateNext(data) {\n \n\t\tvar yinft_t, exptauyt_t, xinft_t, exptauxt_t, ikcoefft_t, rinft_t, exptaurt_t, itoterm1t_t, itoterm2t_t, itoterm3t_t,\n\t\tinacaterm1t_t, inacaterm2t_t, minft_t, exptaumt_t, hinft_t, exptauht_t, dinft_t, exptaudt_t, finft_t, exptauft_t,\n\t\tisicaterm1t_t, isikterm1t_t, isikterm2t_t, pinft_t, exptaupt_t, ik1term1t_t, \n\n\t\tadum, bdum, ena, ek, emh, eca, vmek, yinf, exptauy, ikc, inac, ionc, xinf, exptaux, ikcoeff, ik1term1, rinf, exptaur,\n\t\titoterm1, itoterm2, itoterm3, icac, inacaterm1, inacaterm2, nai3, dum2, dum3, dum4, minf, exptaum, hinf, exptauh, \n\t\tdinf, exptaud, finf, exptauf, tvar, inf, isicaterm1, isikterm1, isikterm2, imk, imna, imca, iion,\n\t\tfactor, derv, pinf, exptaup, iup, itr, irel, dcaup, dcarel, dcai, dna, dk ;\n\n\t\tadum = 0.05 * Math.exp(-0.067 * (cS.v + 42.));\n bdum = (Math.abs(cS.v + 42.) <= 1e-6) ? 2.5 : (cS.v + 42.) / (1.- Math.exp(-0.2 * (cS.v + 42.)));\n cS.tau = adum + bdum;\n yinft_t = adum / cS.tau;\n exptauyt_t = Math.exp(-cS.timestep * cS.tau);\n adum = 0.5 * Math.exp(0.0826 * (cS.v + 50.)) / (1.0 + Math.exp(0.057 * (cS.v + 50.)));\n bdum = 1.3 * Math.exp(-0.06 * (cS.v + 20.)) / (1. + Math.exp(-0.04 * (cS.v + 20.)));\n cS.tau = adum + bdum;\n xinft_t = adum / cS.tau;\n exptauxt_t = Math.exp(-cS.timestep * cS.tau);\n ikcoefft_t = Math.exp(-cS.v * cC.fort);\n adum = 0.033 * Math.exp(-cS.v / 17.);\n bdum = 33. / (1. + Math.exp(-(cS.v + 10.) / 8.));\n cS.tau = adum + bdum;\n rinft_t = adum / cS.tau;\n exptaurt_t = Math.exp(-cS.timestep * cS.tau);\n itoterm1t_t = (Math.abs(cS.v + 10.) <= (10e-6)) ? 5. : (cS.v + 10.) / (1.-Math.exp(-2. * (cS.v + 10.)));\n itoterm2t_t = Math.exp(.02 * cS.v);\n itoterm3t_t = Math.exp(-.02 * cS.v);\n inacaterm1t_t = Math.exp(cS.gamma * cS.v * cC.fort);\n inacaterm2t_t = Math.exp((cS.gamma - 1.) * cS.v * cC.fort);\n adum = (Math.abs(cS.v + 41.) <= 1e-6) ? 2000 : 200. * (cS.v + 41.) / (1.-Math.exp(-0.1 * (cS.v + 41.)));\n bdum = 8000. * Math.exp(-0.056 * (cS.v + 66.));\n cS.tau = adum + bdum;\n minft_t = adum / cS.tau;\n exptaumt_t = Math.exp(-cS.timestep * cS.tau);\n adum = 20. * Math.exp(-0.125 * (cS.v + 75.));\n bdum = 2000. / (1. + 320. * Math.exp(-0.1 * (cS.v + 75.)));\n cS.tau = adum + bdum;\n hinft_t = adum / cS.tau;\n exptauht_t = Math.exp(-cS.timestep * cS.tau);\n if(Math.abs(cS.v + 19.) <= 1e-6){\n adum = 120.;\n bdum = 120.;\n }\n else{\n adum = 30. * (cS.v + 19.) / (1.-Math.exp(-(cS.v + 19.) / 4.));\n bdum = 12. * (cS.v + 19.) / (Math.exp((cS.v + 19.) / 10.)-1.);\n }\n cS.tau = adum + bdum;\n dinft_t = adum / cS.tau;\n exptaudt_t = Math.exp(-cS.timestep * cS.tau);\n adum = (Math.abs((cS.v + 34.)) <= 1e-6) ? 25. : 6.25 * (cS.v + 34.) / (Math.exp((cS.v + 34.) / 4.)-1.);\n bdum = 50. / (1. + Math.exp(-(cS.v + 34.) / 4.));\n cS.tau = adum + bdum;\n finft_t = adum / cS.tau;\n exptauft_t = Math.exp(-cS.timestep * cS.tau);\n isicaterm1t_t = Math.exp(-2. * (cS.v - 50.) * cC.fort);\n isikterm1t_t = (1.- Math.exp(-(cS.v - 50.) * cC.fort));\n isikterm2t_t = Math.exp((50. - cS.v) * cC.fort);\n adum = (Math.abs((cS.v + 34.)) <= 1e-6) ? 2.5 : .625 * (cS.v + 34.) / (Math.exp((cS.v + 34.) / 4.)-1.);\n bdum = 5.0 / (1. + Math.exp(-(cS.v + 34.) / 4.));\n cS.tau = adum + bdum;\n pinft_t = adum / cS.tau;\n exptaupt_t = Math.exp(-cS.timestep * cS.tau);\n\n // compute equilibrium potentials\n\t\t\n\t\tena = cC.rtof * Math.log(cS.nao / cS.nai);\n ek = cC.rtof * Math.log(cS.kc / cS.ki);\n emh = cC.rtof * Math.log((cS.nao + 0.12 * cS.kc) / (cS.nai + 0.12 * cS.ki));\n eca = 0.5 * cC.rtof * Math.log(cS.cao / cS.cai);\n \n vmek = cS.v - ek;\n ik1term1t_t = cS.gk1 * (vmek) / (1. + Math.exp(2. * (vmek + 10.) * cC.fort));\n\t\t\n\t\t// hyperpolarizing-activated current\n yinf = yinft_t;\n exptauy = exptauyt_t;\n cS.y = yinf - (yinf - cS.y) * exptauy;\n\n cS.ifk = cS.y * (cS.kc / (cS.kc + cS.kmf)) * cS.gfk * (cS.v - ek);\n cS.ifna = cS.y * (cS.kc / (cS.kc + cS.kmf)) * cS.gfna * (cS.v - ena);\n// cS.ifk = 0.0\n// cS.ifna = 0.0\n ikc = cS.ifk;\n inac = cS.ifna;\n ionc = cS.ifk + cS.ifna;\n\n// time-dependent (delayed K + current)\n xinf = xinft_t;\n exptaux = exptauxt_t;\n cS.x = xinf - (xinf - cS.x) * exptaux;\n\n ikcoeff = ikcoefft_t;\n cS.ik = cS.x * cS.ikmax * (cS.ki - cS.kc * ikcoeff) / 140.;\n ikc = ikc + cS.ik;\n ionc = ionc + cS.ik;\n\n// time-independent (background) K + current\n ik1term1 = ik1term1t_t;\n cS.ik1 = (cS.kc / (cS.kc + cS.km1)) * ik1term1;\n ikc = ikc + cS.ik1;\n ionc = ionc + cS.ik1;\n\n\t\t// transient outward current\n rinf = rinft_t;\n exptaur = exptaurt_t;\n cS.r = rinf - (rinf - cS.r) * exptaur;\n\n itoterm1 = itoterm1t_t;\n itoterm2 = itoterm2t_t;\n itoterm3 = itoterm3t_t;\n cS.ito = (cS.r * cS.gto * (0.2 + (cS.kc / (cS.kc + cS.kmt))) * (cS.cai / \n (cS.kact + cS.cai)) * itoterm1) * (cS.ki * itoterm2-cS.kc * itoterm3); // gto = 0.28\n ikc = ikc + cS.ito;\n ionc = ionc + cS.ito;\n\t\t \n// background sodium current\n cS.ibna = cS.gbna * (cS.v - ena);\n inac = inac + cS.ibna;\n ionc = ionc + cS.ibna;\n\n// background calcium current\n cS.ibca = cS.gbca * (cS.v - eca);\n icac = cS.ibca;\n ionc = ionc + cS.ibca;\n\n// na-k pump exchange current\n cS.inak = cS.ipmax * (cS.kc / (cS.kmk + cS.kc)) * (cS.nai / (cS.kmna + cS.nai));\n ikc = ikc - 2. * cS.inak;\n inac = inac + 3. * cS.inak;\n ionc = ionc + cS.inak;\n\n// na-ca pump exchange current\n inacaterm1 = inacaterm1t_t;\n inacaterm2 = inacaterm2t_t;\n nai3 = cS.nai * cS.nai * cS.nai;\n dum2 = nai3 * cS.cao * inacaterm1;\n dum3 = cC.nao3 * (cS.cai) * inacaterm2;\n dum4 = 1. + cS.dnaca * ((cS.cai) * cC.nao3 + cS.cao * nai3);\n cS.inaca = cS.knaca * (dum2 - dum3) / dum4;\n inac = inac + 3 * cS.inaca;\n icac = icac - 2. * cS.inaca;\n ionc = ionc + cS.inaca;\n\n// fast sodium current\n minf = minft_t;\n exptaum = exptaumt_t;\n cS.m = minf - (minf - cS.m) * exptaum;\n\n hinf = hinft_t;\n exptauh = exptauht_t;\n cS.h = hinf - (hinf - cS.h) * exptauh;\n\n cS.ina = cS.m * cS.m * cS.m * cS.h * cS.gna * (cS.v - emh);\n inac = inac + cS.ina;\n ionc = ionc + cS.ina; \n\n// fast second inward current (calcium)\n dinf = dinft_t;\n exptaud = exptaudt_t;\n cS.d = dinf - (dinf - cS.d) * exptaud;\n\n finf = finft_t;\n exptauf = exptauft_t;\n cS.f = finf - (finf - cS.f) * exptauf;\n\n adum = 5.;\n bdum = cS.cai * adum / cS.kmf2;\n tvar = adum + bdum;\n inf = adum / (adum + bdum);\n cS.f2 = inf - (inf - cS.f2) * Math.exp(-cS.timestep * tvar);\n\n dum2 = cS.d * cS.f * cS.f2 * (4. * cS.psi * (cS.v - 50.) * cC.fort);\n isicaterm1 = isicaterm1t_t;\n dum3 = (1. - isicaterm1);\n dum4 = cS.cai * cC.exp100fort - cS.cao * isicaterm1;\n cS.isica = dum2 * dum4 / dum3;\n icac = icac + cS.isica;\n ionc = ionc + cS.isica;\n\n// more fast inward current\n isikterm1 = isikterm1t_t;\n isikterm2 = isikterm2t_t;\n dum3 = isikterm1;\n dum4 = cS.ki * cC.exp50fort - cS.kc * isikterm2;\n cS.isik = dum2 * dum4 / (400. * dum3);\n ikc = ikc + cS.isik;\n ionc = ionc + cS.isik;\n\n// total currents used to update each ion concentration\n imk = ikc;\n imna = inac;\n imca = icac;\n\n// convert from nanoamperes to microampers per square cm\n\n// iion = 0.015 * ionc\n\n// derv = -1000. * iion / cm\n\n imna = cS.ifna + cS.ina + 3. * cS.inaca + 3. * cS.inak + cS.ibna;\n imk = cS.ifk + cS.ik + cS.ik1 + cS.ito + cS.isik - 2. * cS.inak;\n imca = cS.isica - 2. * cS.inaca + cS.ibca;\n iion = imna + imk + imca;\n\n\n// stimulus\n// if(ttim * 1000.0.le.1.0) then\n// if(mod(it,icycle).le.istimdur) then\n// if(ttim * 1000.0.le.1.0.or.\n// & (ttim * 1000.0.gt.500.0.and.ttim * 1000.0.le.501.0)) then\n// ionc = ionc-10000.0\n// endif\n// 1750 works, 1800 does not so use 1750 as diast. thresh, 3500 = 2 * \n // if(mod(ntime,icycle).le.istimdur) then\n factor = _s1s2Stimulus(count,data);\n iion = iion - factor;\n imk = imk - factor;\n \n derv = iion / cS.cm;\n\n \n// change in intracellular sodium \n dna = (-imna / (cC.vi * cS.fcon)) * cS.timestep;\n cS.nai = cS.nai + dna;\n\n// change in extracellular potassium\n dk = (-cS.prate * (cS.kc - cS.kb) + imk / (cC.ve * cS.fcon)) * cS.timestep;\n cS.kc = cS.kc + dk;\n\n// change in intracellular potassium\n dk = (-imk / (cC.vi * cS.fcon)) * cS.timestep;\n cS.ki = cS.ki + dk;\n\t\t\n// intracellular calcium handling\n pinf = pinft_t;\n exptaup = exptaupt_t;\n cS.p = pinf - (pinf - cS.p) * exptaup;\n\n iup = cC.aup * cS.cai * (cS.cabarup - cS.caup);\n itr = cC.atr * cS.p * (cS.caup - cS.carel);\n irel = cC.arel * cS.carel * (((cS.cai) * cS.cai) / ((cS.cai) * cS.cai + cS.kmca * cS.kmca));\n\n dcaup = ((iup - itr) / (2. * cC.vup * cS.fcon)) * cS.timestep;\n cS.caup = cS.caup + dcaup;\n\n dcarel = ((itr - irel) / (2. * cC.vrel * cS.fcon)) * cS.timestep;\n cS.carel = cS.carel + dcarel;\n\n dcai = (-(imca + iup - irel) / (2. * cC.vi * cS.fcon)) * cS.timestep;\n cS.cai = cS.cai + dcai;\n\n// update voltage\n cS.v = cS.v - cS.timestep * derv;\n\t\t\n // sets voltage variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\n \n // sets current variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\n \n // iterate the count\n count++;\n return data; \n }","function dft_direct (re, im) {\n let N = re.length;\n // is this necessary? should be able to do DFT with any N\n //if (N.toString(2) % 10) return; // check that N is a power of 2\n\n // array containing N evenly spaced points around the unit circle\n let W = discrete_circle(N);\n\n // debugger;\n // initialize imaginary values to zero if not provided\n im = im || re.map( a => 0 );\n\n // sum (x * W) over N points (0 to N-1), for all frequencies k in N\n return re.map( (_, k) =>\n re.map( (_, n) => cpx_mult([re[n], im[n]], W[n * k % N]) )\n .reduce( (a, b) => cpx_add(a, b) ));\n}","function fftRadix2(realVals, imagVals, size, inverse, cpuBackend) {\n if (size === 1) {\n return { real: realVals, imag: imagVals };\n }\n const data = backend_util.mergeRealAndImagArrays(realVals, imagVals);\n const half = size / 2;\n const evenComplex = backend_util.complexWithEvenIndex(data);\n const evenRealVals = evenComplex.real;\n const evenImagVals = evenComplex.imag;\n const evenShape = [evenRealVals.length];\n const evenRealInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenRealVals);\n const evenImagInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenImagVals);\n const evenTensorInfo = complex({ inputs: { real: evenRealInfo, imag: evenImagInfo }, backend: cpuBackend });\n const oddComplex = backend_util.complexWithOddIndex(data);\n const oddRealVals = oddComplex.real;\n const oddImagVals = oddComplex.imag;\n const oddShape = [oddRealVals.length];\n const oddRealInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddRealVals);\n const oddImagInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddImagVals);\n const oddTensorInfo = complex({ inputs: { real: oddRealInfo, imag: oddImagInfo }, backend: cpuBackend });\n // Recursive call for half part of original input.\n const $evenComplex = fftRadix2(evenRealVals, evenImagVals, half, inverse, cpuBackend);\n const $evenRealVals = $evenComplex.real;\n const $evenImagVals = $evenComplex.imag;\n const $evenShape = [$evenRealVals.length];\n const $evenRealInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenRealVals);\n const $evenImagInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenImagVals);\n const $evenTensorInfo = complex({\n inputs: { real: $evenRealInfo, imag: $evenImagInfo },\n backend: cpuBackend\n });\n const $oddComplex = fftRadix2(oddRealVals, oddImagVals, half, inverse, cpuBackend);\n const $oddRealVals = $oddComplex.real;\n const $oddImagVals = $oddComplex.imag;\n const $oddShape = [$oddRealVals.length];\n const $oddRealInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddRealVals);\n const $oddImagInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddImagVals);\n const $oddTensorInfo = complex({ inputs: { real: $oddRealInfo, imag: $oddImagInfo }, backend: cpuBackend });\n const e = backend_util.exponents(size, inverse);\n const eShape = [e.real.length];\n const eRealInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.real);\n const eImagInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.imag);\n const complexInfo = complex({ inputs: { real: eRealInfo, imag: eImagInfo }, backend: cpuBackend });\n const exponentInfo = multiply({ inputs: { a: complexInfo, b: $oddTensorInfo }, backend: cpuBackend });\n const addPart = add({\n inputs: { a: $evenTensorInfo, b: exponentInfo },\n backend: cpuBackend\n });\n const subPart = sub({\n inputs: { a: $evenTensorInfo, b: exponentInfo },\n backend: cpuBackend\n });\n const addPartReal = real({ inputs: { input: addPart }, backend: cpuBackend });\n const subPartReal = real({ inputs: { input: subPart }, backend: cpuBackend });\n const addPartImag = imag({ inputs: { input: addPart }, backend: cpuBackend });\n const subPartImag = imag({ inputs: { input: subPart }, backend: cpuBackend });\n const $real = concat({\n inputs: [addPartReal, subPartReal],\n backend: cpuBackend,\n attrs: { axis: 0 }\n });\n const $imag = concat({\n inputs: [addPartImag, subPartImag],\n backend: cpuBackend,\n attrs: { axis: 0 }\n });\n const $realVals = cpuBackend.data.get($real.dataId).values;\n const $imagVals = cpuBackend.data.get($imag.dataId).values;\n cpuBackend.disposeIntermediateTensorInfo(evenRealInfo);\n cpuBackend.disposeIntermediateTensorInfo(evenImagInfo);\n cpuBackend.disposeIntermediateTensorInfo(evenTensorInfo);\n cpuBackend.disposeIntermediateTensorInfo(oddRealInfo);\n cpuBackend.disposeIntermediateTensorInfo(oddImagInfo);\n cpuBackend.disposeIntermediateTensorInfo(oddTensorInfo);\n cpuBackend.disposeIntermediateTensorInfo($evenRealInfo);\n cpuBackend.disposeIntermediateTensorInfo($evenImagInfo);\n cpuBackend.disposeIntermediateTensorInfo($evenTensorInfo);\n cpuBackend.disposeIntermediateTensorInfo($oddRealInfo);\n cpuBackend.disposeIntermediateTensorInfo($oddImagInfo);\n cpuBackend.disposeIntermediateTensorInfo($oddTensorInfo);\n cpuBackend.disposeIntermediateTensorInfo(eRealInfo);\n cpuBackend.disposeIntermediateTensorInfo(eImagInfo);\n cpuBackend.disposeIntermediateTensorInfo(complexInfo);\n cpuBackend.disposeIntermediateTensorInfo(exponentInfo);\n cpuBackend.disposeIntermediateTensorInfo(addPart);\n cpuBackend.disposeIntermediateTensorInfo(subPart);\n cpuBackend.disposeIntermediateTensorInfo(addPartReal);\n cpuBackend.disposeIntermediateTensorInfo(addPartImag);\n cpuBackend.disposeIntermediateTensorInfo(subPartReal);\n cpuBackend.disposeIntermediateTensorInfo(subPartImag);\n cpuBackend.disposeIntermediateTensorInfo($real);\n cpuBackend.disposeIntermediateTensorInfo($imag);\n return { real: $realVals, imag: $imagVals };\n}","function doFFT(values) {\n\tvar data = new complex_array.ComplexArray(values.length);\n\tdata.real = new Float32Array(values);\n\tvar frequencies = data.FFT();\n\n\treturn frequencies;\n}","calculateLoudness(buffer) {\n\n // first call or after resetMemory\n if (this.copybuffer == undefined) {\n // how long should the copybuffer be at least? \n // --> at least maxT should fit in and length shall be an integer fraction of buffer length\n let length = Math.floor(this.sampleRate * this.loudnessprops.maxT / buffer.length + 1) * buffer.length;\n this.copybuffer = new CircularAudioBuffer(context, this.nChannels, length, this.sampleRate);\n }\n\n //accumulate buffer to previous call\n this.copybuffer.concat(buffer);\n\n // must be gt nSamplesPerInterval\n // or: wait at least one interval time T to be able to calculate loudness\n if (this.copybuffer.getLength() < this.nSamplesPerInterval) {\n console.log('buffer too small ... have to eat more data');\n return NaN;\n }\n\n // get array of meansquares from buffer of overlapping intervals\n let meanSquares = this.getBufferMeanSquares(this.copybuffer, this.nSamplesPerInterval, this.nStepsize);\n\n // first stage filter\n this.filterBlocks(meanSquares, this.gamma_a);\n\n // second stage filter\n let gamma_r = 0.;\n for (let chIdx = 0; chIdx < this.nChannels; chIdx++) {\n let mean = 0.;\n for (let idx = 0; idx < meanSquares[chIdx].length; idx++) {\n mean += meanSquares[chIdx][idx];\n }\n mean /= meanSquares[chIdx].length;\n gamma_r += (this.channelWeight[chIdx] * mean);\n }\n gamma_r = -0.691 + 10.0 * Math.log10(gamma_r) - 10.;\n\n this.filterBlocks(meanSquares, gamma_r);\n\n // gated loudness from filtered blocks\n let gatedLoudness = 0.;\n for (let chIdx = 0; chIdx < this.nChannels; chIdx++) {\n let mean = 0.;\n for (let idx = 0; idx < meanSquares[chIdx].length; idx++) {\n mean += meanSquares[chIdx][idx];\n }\n mean /= meanSquares[chIdx].length;\n\n gatedLoudness += (this.channelWeight[chIdx] * mean);\n }\n gatedLoudness = -0.691 + 10.0 * Math.log10(gatedLoudness);\n\n //console.log(this.id, '- gatedLoudness:', gatedLoudness);\n\n return gatedLoudness;\n }","function yt(t){var S,k,_,A,e,u=Math.floor,I=new Array(64),C=new Array(64),T=new Array(64),F=new Array(64),w=new Array(65535),y=new Array(65535),Q=new Array(64),v=new Array(64),P=[],E=0,q=7,O=new Array(64),B=new Array(64),R=new Array(64),n=new Array(256),j=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],D=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],M=[0,1,2,3,4,5,6,7,8,9,10,11],U=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],N=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],z=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],L=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function G(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),V(255&t)}function X(t,e,n,r,i){for(var o,a=i[0],s=i[240],h=function(t,e){var n,r,i,o,a,s,h,c,l,u,f=0;for(l=0;l<8;++l){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],h=t[f+6];var d=n+(c=t[f+7]),p=n-c,g=r+h,m=r-h,w=i+s,y=i-s,v=o+a,b=o-a,x=d+v,S=d-v,k=g+w,_=g-w;t[f]=x+k,t[f+4]=x-k;var A=.707106781*(_+S);t[f+2]=S+A,t[f+6]=S-A;var I=.382683433*((x=b+y)-(_=m+p)),C=.5411961*x+I,T=1.306562965*_+I,F=.707106781*(k=y+m),P=p+F,E=p-F;t[f+5]=E+C,t[f+3]=E-C,t[f+1]=P+T,t[f+7]=P-T,f+=8}for(l=f=0;l<8;++l){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],h=t[f+48];var q=n+(c=t[f+56]),O=n-c,B=r+h,R=r-h,j=i+s,D=i-s,M=o+a,U=o-a,N=q+M,z=q-M,L=B+j,H=B-j;t[f]=N+L,t[f+32]=N-L;var W=.707106781*(H+z);t[f+16]=z+W,t[f+48]=z-W;var G=.382683433*((N=U+D)-(H=R+O)),V=.5411961*N+G,Y=1.306562965*H+G,X=.707106781*(L=D+R),J=O+X,K=O-X;t[f+40]=K+V,t[f+24]=K-V,t[f+8]=J+Y,t[f+56]=J-Y,f++}for(l=0;l<64;++l)u=t[l]*e[l],Q[l]=0>4;for(var m=1;m<=f;++m)G(s);g&=15}o=32767+v[d],G(i[(g<<4)+y[o]]),G(w[o]),d++}return 63!=u&&G(a),n}function J(t){if(t<=0&&(t=1),100>3)*v+(d=4*(7&g)),y<=b+p&&(f-=v*(b+1+p-y)),v<=s+d&&(f-=s+d-v+4),h=m[f++],c=m[f++],l=m[f++],O[g]=(j[h]+j[c+256>>0]+j[l+512>>0]>>16)-128,B[g]=(j[h+768>>0]+j[c+1024>>0]+j[l+1280>>0]>>16)-128,R[g]=(j[h+1280>>0]+j[c+1536>>0]+j[l+1792>>0]>>16)-128;i=X(O,T,i,S,_),o=X(B,F,o,k,A),a=X(R,F,a,k,A),s+=32}b+=8}if(0<=q){var x=[];x[1]=q+1,x[0]=(1<>0]=38470*t,j[t+512>>0]=7471*t+32768,j[t+768>>0]=-11059*t,j[t+1024>>0]=-21709*t,j[t+1280>>0]=32768*t+8421375,j[t+1536>>0]=-27439*t,j[t+1792>>0]=-5329*t}(),J(t),(new Date).getTime()}()}","function _t(t) {\n var N,\n L,\n A,\n S,\n e,\n c = Math.floor,\n _ = new Array(64),\n F = new Array(64),\n P = new Array(64),\n k = new Array(64),\n y = new Array(65535),\n v = new Array(65535),\n Z = new Array(64),\n w = new Array(64),\n I = [],\n C = 0,\n B = 7,\n j = new Array(64),\n E = new Array(64),\n M = new Array(64),\n n = new Array(256),\n O = new Array(2048),\n b = [0, 1, 5, 6, 14, 15, 27, 28, 2, 4, 7, 13, 16, 26, 29, 42, 3, 8, 12, 17, 25, 30, 41, 43, 9, 11, 18, 24, 31, 40, 44, 53, 10, 19, 23, 32, 39, 45, 52, 54, 20, 22, 33, 38, 46, 51, 55, 60, 21, 34, 37, 47, 50, 56, 59, 61, 35, 36, 48, 49, 57, 58, 62, 63],\n q = [0, 0, 1, 5, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0],\n T = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11],\n R = [0, 0, 2, 1, 3, 3, 2, 4, 3, 5, 5, 4, 4, 0, 0, 1, 125],\n D = [1, 2, 3, 0, 4, 17, 5, 18, 33, 49, 65, 6, 19, 81, 97, 7, 34, 113, 20, 50, 129, 145, 161, 8, 35, 66, 177, 193, 21, 82, 209, 240, 36, 51, 98, 114, 130, 9, 10, 22, 23, 24, 25, 26, 37, 38, 39, 40, 41, 42, 52, 53, 54, 55, 56, 57, 58, 67, 68, 69, 70, 71, 72, 73, 74, 83, 84, 85, 86, 87, 88, 89, 90, 99, 100, 101, 102, 103, 104, 105, 106, 115, 116, 117, 118, 119, 120, 121, 122, 131, 132, 133, 134, 135, 136, 137, 138, 146, 147, 148, 149, 150, 151, 152, 153, 154, 162, 163, 164, 165, 166, 167, 168, 169, 170, 178, 179, 180, 181, 182, 183, 184, 185, 186, 194, 195, 196, 197, 198, 199, 200, 201, 202, 210, 211, 212, 213, 214, 215, 216, 217, 218, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250],\n U = [0, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0],\n z = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11],\n H = [0, 0, 2, 1, 2, 4, 4, 3, 4, 7, 5, 4, 4, 0, 1, 2, 119],\n W = [0, 1, 2, 3, 17, 4, 5, 33, 49, 6, 18, 65, 81, 7, 97, 113, 19, 34, 50, 129, 8, 20, 66, 145, 161, 177, 193, 9, 35, 51, 82, 240, 21, 98, 114, 209, 10, 22, 36, 52, 225, 37, 241, 23, 24, 25, 26, 38, 39, 40, 41, 42, 53, 54, 55, 56, 57, 58, 67, 68, 69, 70, 71, 72, 73, 74, 83, 84, 85, 86, 87, 88, 89, 90, 99, 100, 101, 102, 103, 104, 105, 106, 115, 116, 117, 118, 119, 120, 121, 122, 130, 131, 132, 133, 134, 135, 136, 137, 138, 146, 147, 148, 149, 150, 151, 152, 153, 154, 162, 163, 164, 165, 166, 167, 168, 169, 170, 178, 179, 180, 181, 182, 183, 184, 185, 186, 194, 195, 196, 197, 198, 199, 200, 201, 202, 210, 211, 212, 213, 214, 215, 216, 217, 218, 226, 227, 228, 229, 230, 231, 232, 233, 234, 242, 243, 244, 245, 246, 247, 248, 249, 250];\n\n function r(t, e) {\n for (var n = 0, r = 0, i = new Array(), o = 1; o <= 16; o++) {\n for (var a = 1; a <= t[o]; a++) i[e[r]] = [], i[e[r]][0] = n, i[e[r]][1] = o, r++, n++;\n\n n *= 2;\n }\n\n return i;\n }\n\n function V(t) {\n for (var e = t[0], n = t[1] - 1; 0 <= n;) e & 1 << n && (C |= 1 << B), n--, --B < 0 && (255 == C ? (G(255), G(0)) : G(C), B = 7, C = 0);\n }\n\n function G(t) {\n I.push(t);\n }\n\n function Y(t) {\n G(t >> 8 & 255), G(255 & t);\n }\n\n function J(t, e, n, r, i) {\n for (var o, a = i[0], s = i[240], l = function (t, e) {\n var n,\n r,\n i,\n o,\n a,\n s,\n l,\n h,\n u,\n c,\n f = 0;\n\n for (u = 0; u < 8; ++u) {\n n = t[f], r = t[f + 1], i = t[f + 2], o = t[f + 3], a = t[f + 4], s = t[f + 5], l = t[f + 6];\n var p = n + (h = t[f + 7]),\n d = n - h,\n g = r + l,\n m = r - l,\n y = i + s,\n v = i - s,\n w = o + a,\n b = o - a,\n x = p + w,\n N = p - w,\n L = g + y,\n A = g - y;\n t[f] = x + L, t[f + 4] = x - L;\n var S = .707106781 * (A + N);\n t[f + 2] = N + S, t[f + 6] = N - S;\n\n var _ = .382683433 * ((x = b + v) - (A = m + d)),\n F = .5411961 * x + _,\n P = 1.306562965 * A + _,\n k = .707106781 * (L = v + m),\n I = d + k,\n C = d - k;\n\n t[f + 5] = C + F, t[f + 3] = C - F, t[f + 1] = I + P, t[f + 7] = I - P, f += 8;\n }\n\n for (u = f = 0; u < 8; ++u) {\n n = t[f], r = t[f + 8], i = t[f + 16], o = t[f + 24], a = t[f + 32], s = t[f + 40], l = t[f + 48];\n var B = n + (h = t[f + 56]),\n j = n - h,\n E = r + l,\n M = r - l,\n O = i + s,\n q = i - s,\n T = o + a,\n R = o - a,\n D = B + T,\n U = B - T,\n z = E + O,\n H = E - O;\n t[f] = D + z, t[f + 32] = D - z;\n var W = .707106781 * (H + U);\n t[f + 16] = U + W, t[f + 48] = U - W;\n var V = .382683433 * ((D = R + q) - (H = M + j)),\n G = .5411961 * D + V,\n Y = 1.306562965 * H + V,\n J = .707106781 * (z = q + M),\n X = j + J,\n K = j - J;\n t[f + 40] = K + G, t[f + 24] = K - G, t[f + 8] = X + Y, t[f + 56] = X - Y, f++;\n }\n\n for (u = 0; u < 64; ++u) c = t[u] * e[u], Z[u] = 0 < c ? c + .5 | 0 : c - .5 | 0;\n\n return Z;\n }(t, e), h = 0; h < 64; ++h) w[b[h]] = l[h];\n\n var u = w[0] - n;\n n = w[0], 0 == u ? V(r[0]) : (V(r[v[o = 32767 + u]]), V(y[o]));\n\n for (var c = 63; 0 < c && 0 == w[c]; c--);\n\n if (0 == c) return V(a), n;\n\n for (var f, p = 1; p <= c;) {\n for (var d = p; 0 == w[p] && p <= c; ++p);\n\n var g = p - d;\n\n if (16 <= g) {\n f = g >> 4;\n\n for (var m = 1; m <= f; ++m) V(s);\n\n g &= 15;\n }\n\n o = 32767 + w[p], V(i[(g << 4) + v[o]]), V(y[o]), p++;\n }\n\n return 63 != c && V(a), n;\n }\n\n function X(t) {\n if (t <= 0 && (t = 1), 100 < t && (t = 100), e != t) {\n (function (t) {\n for (var e = [16, 11, 10, 16, 24, 40, 51, 61, 12, 12, 14, 19, 26, 58, 60, 55, 14, 13, 16, 24, 40, 57, 69, 56, 14, 17, 22, 29, 51, 87, 80, 62, 18, 22, 37, 56, 68, 109, 103, 77, 24, 35, 55, 64, 81, 104, 113, 92, 49, 64, 78, 87, 103, 121, 120, 101, 72, 92, 95, 98, 112, 100, 103, 99], n = 0; n < 64; n++) {\n var r = c((e[n] * t + 50) / 100);\n r < 1 ? r = 1 : 255 < r && (r = 255), _[b[n]] = r;\n }\n\n for (var i = [17, 18, 24, 47, 99, 99, 99, 99, 18, 21, 26, 66, 99, 99, 99, 99, 24, 26, 56, 99, 99, 99, 99, 99, 47, 66, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99], o = 0; o < 64; o++) {\n var a = c((i[o] * t + 50) / 100);\n a < 1 ? a = 1 : 255 < a && (a = 255), F[b[o]] = a;\n }\n\n for (var s = [1, 1.387039845, 1.306562965, 1.175875602, 1, .785694958, .5411961, .275899379], l = 0, h = 0; h < 8; h++) for (var u = 0; u < 8; u++) P[l] = 1 / (_[b[l]] * s[h] * s[u] * 8), k[l] = 1 / (F[b[l]] * s[h] * s[u] * 8), l++;\n })(t < 50 ? Math.floor(5e3 / t) : Math.floor(200 - 2 * t)), e = t;\n }\n }\n\n this.encode = function (t, e) {\n var n, r;\n new Date().getTime();\n e && X(e), I = new Array(), C = 0, B = 7, Y(65496), Y(65504), Y(16), G(74), G(70), G(73), G(70), G(0), G(1), G(1), G(0), Y(1), Y(1), G(0), G(0), function () {\n Y(65499), Y(132), G(0);\n\n for (var t = 0; t < 64; t++) G(_[t]);\n\n G(1);\n\n for (var e = 0; e < 64; e++) G(F[e]);\n }(), n = t.width, r = t.height, Y(65472), Y(17), G(8), Y(r), Y(n), G(3), G(1), G(17), G(0), G(2), G(17), G(1), G(3), G(17), G(1), function () {\n Y(65476), Y(418), G(0);\n\n for (var t = 0; t < 16; t++) G(q[t + 1]);\n\n for (var e = 0; e <= 11; e++) G(T[e]);\n\n G(16);\n\n for (var n = 0; n < 16; n++) G(R[n + 1]);\n\n for (var r = 0; r <= 161; r++) G(D[r]);\n\n G(1);\n\n for (var i = 0; i < 16; i++) G(U[i + 1]);\n\n for (var o = 0; o <= 11; o++) G(z[o]);\n\n G(17);\n\n for (var a = 0; a < 16; a++) G(H[a + 1]);\n\n for (var s = 0; s <= 161; s++) G(W[s]);\n }(), Y(65498), Y(12), G(3), G(1), G(0), G(2), G(17), G(3), G(17), G(0), G(63), G(0);\n var i = 0,\n o = 0,\n a = 0;\n C = 0, B = 7, this.encode.displayName = \"_encode_\";\n\n for (var s, l, h, u, c, f, p, d, g, m = t.data, y = t.width, v = t.height, w = 4 * y, b = 0; b < v;) {\n for (s = 0; s < w;) {\n for (f = c = w * b + s, p = -1, g = d = 0; g < 64; g++) f = c + (d = g >> 3) * w + (p = 4 * (7 & g)), v <= b + d && (f -= w * (b + 1 + d - v)), w <= s + p && (f -= s + p - w + 4), l = m[f++], h = m[f++], u = m[f++], j[g] = (O[l] + O[h + 256 >> 0] + O[u + 512 >> 0] >> 16) - 128, E[g] = (O[l + 768 >> 0] + O[h + 1024 >> 0] + O[u + 1280 >> 0] >> 16) - 128, M[g] = (O[l + 1280 >> 0] + O[h + 1536 >> 0] + O[u + 1792 >> 0] >> 16) - 128;\n\n i = J(j, P, i, N, A), o = J(E, k, o, L, S), a = J(M, k, a, L, S), s += 32;\n }\n\n b += 8;\n }\n\n if (0 <= B) {\n var x = [];\n x[1] = B + 1, x[0] = (1 << B + 1) - 1, V(x);\n }\n\n return Y(65497), new Uint8Array(I);\n }, function () {\n new Date().getTime();\n t || (t = 50), function () {\n for (var t = String.fromCharCode, e = 0; e < 256; e++) n[e] = t(e);\n }(), N = r(q, T), L = r(U, z), A = r(R, D), S = r(H, W), function () {\n for (var t = 1, e = 2, n = 1; n <= 15; n++) {\n for (var r = t; r < e; r++) v[32767 + r] = n, y[32767 + r] = [], y[32767 + r][1] = n, y[32767 + r][0] = r;\n\n for (var i = -(e - 1); i <= -t; i++) v[32767 + i] = n, y[32767 + i] = [], y[32767 + i][1] = n, y[32767 + i][0] = e - 1 + i;\n\n t <<= 1, e <<= 1;\n }\n }(), function () {\n for (var t = 0; t < 256; t++) O[t] = 19595 * t, O[t + 256 >> 0] = 38470 * t, O[t + 512 >> 0] = 7471 * t + 32768, O[t + 768 >> 0] = -11059 * t, O[t + 1024 >> 0] = -21709 * t, O[t + 1280 >> 0] = 32768 * t + 8421375, O[t + 1536 >> 0] = -27439 * t, O[t + 1792 >> 0] = -5329 * t;\n }(), X(t), new Date().getTime();\n }();\n }","twistMU() {\n this.fourCycle(this.edgeLoc, 1, 4, 7, 10, this.edgeOrient, 1, 1, 1, 1, 2);\n this.fourCycle(this.sideLoc, 3, 2, 0, 5, this.sideOrient, 2, 1, 2, 3, 4);\n }","function draw() {\n\t background(0);\n\t var spectrum = fft.analyze();// run the FFT analysis\n\n/*\nLocal Variable, fft.getEnergy maps the different \nfrequencies of the audio and returns values between 0 and 255\n*/\n var bass = fft.getEnergy( \"bass\" );\n var treble = fft.getEnergy( \"treble\" );\n var highMid = fft.getEnergy( \"highMid\" ); \n\n/* \nLocal variable which assigns values to the mapped frequencies\n*/\n var mapMid = map( highMid, 0, 255, -50, 255 );\n var mapTreble = map( treble, 0, 255, -140, 200 );\n\n var pieces = 60;//Local variable for the number of lines in the shape\n var radius = 350\n \t translate (width/2, height/2);// Moves origin to the centre of the canvas\n \t stroke (0);\n \tstrokeWeight(3);\n for( i = 0; i < pieces; i++ ) { // draws a shape of each piece\n \t\n stroke(219, 162, 188);\n rotate(frameCount * 0.0001);\n line(mapMid, mapMid, 10, bass ); \n stroke(17, 218, 211);\n point(mapTreble, 480);\n point(mapMid, 670);\n \n /* \n Push() adds a new item at the end of the array.\n Pop() removes the last item of an array\n */\n push();\n rotate(-frameCount * 0.01);\n stroke(17, 218, 211);\n point(120, bass) ;\n fill(17, 218, 211);\n point(bass,300) ;\n pop();\n \n push();\n rotate(-frameCount * 0.01);//negative framecount allows points to spin counter clockwise\n stroke(219, 162, 188);\n point(550, bass) ;\n point(430, mapTreble) ;\n line( bass, 740, mouseY, 740 );\n pop();\n\n }\n}","function FFTM(x,y){this.x=x;this.y=y;}","function FFTM(x,y){this.x=x;this.y=y;}","function initFourierImage() {\r\n //event listeners\r\n function loadImage(loc) {\r\n var start = +new Date();\r\n\r\n //placed in a callback so the UI has a chance to update\r\n disableButtons(function() {\r\n //draw the initial image\r\n var img = new Image();\r\n img.addEventListener('load', function() {\r\n //make each canvas the image's exact size\r\n dims[0] = img.width;\r\n dims[1] = img.height;\r\n for (var ai = 0; ai < 4; ai++) {\r\n canvases[ai] = $s('#canvas'+ai);\r\n canvases[ai].width = dims[0], canvases[ai].height = dims[1];\r\n ctxs[ai] = canvases[ai].getContext('2d');\r\n }\r\n\r\n //draw the image to the canvas\r\n ctxs[0].drawImage(img, 0, 0, img.width, img.height);\r\n\r\n //grab the pixels\r\n var imageData = ctxs[0].getImageData(0, 0, dims[0], dims[1]);\r\n var h_es = []; //the h values\r\n for (var ai = 0; ai < imageData.data.length; ai+=4) {\r\n //greyscale, so you only need every 4th value\r\n h_es.push(imageData.data[ai]);\r\n }\r\n\r\n //initialize the h values\r\n h = function(n, m) {\r\n if (arguments.length === 0) return h_es;\r\n\r\n var idx = n*dims[0] + m;\r\n return h_es[idx];\r\n }; //create it in function form to make the code match the math\r\n\r\n enableButtons();\r\n\r\n var duration = +new Date() - start;\r\n console.log('It took '+duration+'ms to draw the image.');\r\n });\r\n img.src = loc;\r\n });\r\n }\r\n $s('#draw-cs-btn').addEventListener('click', function() {\r\n loadImage('cs.png');\r\n });\r\n $s('#draw-circle-btn').addEventListener('click', function() {\r\n loadImage('circle.png');\r\n });\r\n $s('#draw-grace-btn').addEventListener('click', function() {\r\n loadImage('grace.png');\r\n });\r\n\r\n $s('#transform-btn').addEventListener('click', function() {\r\n var start = +new Date();\r\n\r\n if (!h()) return alert('You need to draw an image to canvas 1 first.');\r\n\r\n //placed in a callback so the UI has a chance to update\r\n disableButtons(function() {\r\n //compute the h hat values\r\n var h_hats = [];\r\n FFT(h_hats, h());\r\n h_hats = shiftFFT(h_hats);\r\n\r\n //get the largest magnitude\r\n var maxMagnitude = 0;\r\n for (var ai = 0; ai < h_hats.length; ai++) {\r\n var mag = h_hats[ai].magnitude();\r\n if (mag > maxMagnitude) {\r\n maxMagnitude = mag;\r\n }\r\n }\r\n\r\n //apply a low or high pass filter\r\n var lpr = parseInt($s('#low-freq-radius').value); //low pass radius\r\n var hpr = parseInt($s('#high-freq-radius').value); //high \" \"\r\n var N = dims[1], M = dims[0];\r\n for (var k = 0; k < N; k++) {\r\n for (var l = 0; l < M; l++) {\r\n var idx = k*M + l;\r\n var dist = Math.pow(k-M/2, 2) + Math.pow(l-N/2, 2);\r\n if (dist > lpr*lpr && isNaN(hpr) ||\r\n dist < hpr*hpr && isNaN(lpr) ||\r\n dist < lpr*lpr && !isNaN(lpr) && !isNaN(hpr) ||\r\n dist > hpr*hpr && !isNaN(lpr) && !isNaN(hpr)) {\r\n h_hats[idx] = new Complex(0, 0);\r\n }\r\n }\r\n }\r\n\r\n //store them in a nice function to match the math\r\n $h = function(k, l) {\r\n if (arguments.length === 0) return h_hats;\r\n \r\n var idx = k*dims[0] + l;\r\n return h_hats[idx];\r\n };\r\n\r\n //draw the pixels\r\n var currImageData = ctxs[1].getImageData(0, 0, dims[0], dims[1]);\r\n var logOfMaxMag = Math.log(cc*maxMagnitude+1);\r\n for (var k = 0; k < dims[1]; k++) {\r\n for (var l = 0; l < dims[0]; l++) {\r\n var idxInPixels = 4*(dims[0]*k + l);\r\n currImageData.data[idxInPixels+3] = 255; //full alpha\r\n var color = Math.log(cc*$h(k, l).magnitude()+1);\r\n color = Math.round(255*(color/logOfMaxMag));\r\n for (var c = 0; c < 3; c++) { //RGB are the same, lol c++\r\n currImageData.data[idxInPixels+c] = color;\r\n }\r\n }\r\n }\r\n ctxs[1].putImageData(currImageData, 0, 0);\r\n\r\n enableButtons();\r\n\r\n var duration = +new Date() - start;\r\n console.log('It took '+duration+'ms to compute the FT.');\r\n });\r\n });\r\n\r\n $s('#reconstruct-btn').addEventListener('click', function() {\r\n var start = +new Date();\r\n\r\n if (!$h()) {\r\n return alert('You first need to compute the Fourier transform.');\r\n }\r\n\r\n //placed in a callback so the UI has a chance to update\r\n disableButtons(function() {\r\n //compute the h prime values\r\n var h_primes = [];\r\n var h_hats = $h();\r\n h_hats = unshiftFFT(h_hats);\r\n invFFT(h_primes, h_hats);\r\n\r\n //store them in a nice function to match the math\r\n h_ = function(n, m) {\r\n if (arguments.length === 0) return h_primes;\r\n\r\n var idx = n*dims[0] + m;\r\n return round(h_primes[idx], 2);\r\n };\r\n\r\n //draw the pixels\r\n var currImageData = ctxs[2].getImageData(0, 0, dims[0], dims[1]);\r\n for (var n = 0; n < dims[1]; n++) {\r\n for (var m = 0; m < dims[0]; m++) {\r\n var idxInPixels = 4*(dims[0]*n + m);\r\n currImageData.data[idxInPixels+3] = 255; //full alpha\r\n for (var c = 0; c < 3; c++) { //RGB are the same, lol c++\r\n currImageData.data[idxInPixels+c] = h_(n, m);\r\n }\r\n }\r\n }\r\n ctxs[2].putImageData(currImageData, 0, 0);\r\n\r\n enableButtons();\r\n\r\n var duration = +new Date() - start;\r\n console.log('It took '+duration+'ms to reconstruct the image.');\r\n });\r\n });\r\n\r\n $s('#difference-btn').addEventListener('click', function() {\r\n var start = +new Date();\r\n\r\n if (!h_()) {\r\n return alert('You haven\\'t reconstructed an image yet.');\r\n }\r\n\r\n //placed in a callback so the UI has a chance to update\r\n disableButtons(function() {\r\n //find the range of the errors\r\n var minError = Infinity;\r\n var maxError = 0;\r\n for (var n = 0; n < dims[1]; n++) {\r\n for (var m = 0; m < dims[0]; m++) {\r\n var error = h_(n, m) - h(n, m);\r\n if (error < minError) minError = error;\r\n if (error > maxError) maxError = error;\r\n }\r\n }\r\n\r\n //draw the pixels\r\n var currImageData = ctxs[3].getImageData(0, 0, dims[0], dims[1]);\r\n for (var n = 0; n < dims[1]; n++) {\r\n for (var m = 0; m < dims[0]; m++) {\r\n var idxInPixels = 4*(dims[0]*n + m); //idx in the pixels array\r\n var error = h_(n, m) - h(n, m);\r\n var color = getCoolColor(error, [minError, maxError]);\r\n for (var c = 0; c < 3; c++) {\r\n currImageData.data[idxInPixels+c] = color[c];\r\n }\r\n currImageData.data[idxInPixels+3] = 255; // fullalpha\t\t\r\n }\r\n }\r\n ctxs[3].putImageData(currImageData, 0, 0);\r\n\r\n enableButtons();\r\n\r\n var duration = +new Date() - start;\r\n console.log('It took '+duration+'ms to compute the difference.');\r\n });\r\n });\r\n\r\n //initialize the working variables\r\n canvases = [], ctxs = [];\r\n h = $h = h_ = function() { return false; };\r\n}","function fDCTQuant(data, fdtbl)\n {\n var d0, d1, d2, d3, d4, d5, d6, d7;\n /* Pass 1: process rows. */\n var dataOff=0;\n var i;\n var I8 = 8;\n var I64 = 64;\n for (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n //outputfDCTQuant[i] = fround(fDCTQuant);\n \n }\n return outputfDCTQuant;\n }","function transformRadix2(real, imag) {\n\t // Initialization\n\t if (real.length != imag.length) throw \"Mismatched lengths\";\n\t var n = real.length;\n\t if (n == 1) // Trivial transform\n\t return;\n\t var levels = -1;\n\t for (var i = 0; i < 32; i++) {\n\t if (1 << i == n) levels = i; // Equal to log2(n)\n\t }\n\t if (levels == -1) throw \"Length is not a power of 2\";\n\t var cosTable = new Array(n / 2);\n\t var sinTable = new Array(n / 2);\n\t for (var i = 0; i < n / 2; i++) {\n\t cosTable[i] = Math.cos(2 * Math.PI * i / n);\n\t sinTable[i] = Math.sin(2 * Math.PI * i / n);\n\t }\n\n\t // Bit-reversed addressing permutation\n\t for (var i = 0; i < n; i++) {\n\t var j = reverseBits(i, levels);\n\t if (j > i) {\n\t var temp = real[i];\n\t real[i] = real[j];\n\t real[j] = temp;\n\t temp = imag[i];\n\t imag[i] = imag[j];\n\t imag[j] = temp;\n\t }\n\t }\n\n\t // Cooley-Tukey decimation-in-time radix-2 FFT\n\t for (var size = 2; size <= n; size *= 2) {\n\t var halfsize = size / 2;\n\t var tablestep = n / size;\n\t for (var i = 0; i < n; i += size) {\n\t for (var j = i, k = 0; j < i + halfsize; j++, k += tablestep) {\n\t var tpre = real[j + halfsize] * cosTable[k] + imag[j + halfsize] * sinTable[k];\n\t var tpim = -real[j + halfsize] * sinTable[k] + imag[j + halfsize] * cosTable[k];\n\t real[j + halfsize] = real[j] - tpre;\n\t imag[j + halfsize] = imag[j] - tpim;\n\t real[j] += tpre;\n\t imag[j] += tpim;\n\t }\n\t }\n\t }\n\n\t // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\n\t function reverseBits(x, bits) {\n\t var y = 0;\n\t for (var i = 0; i < bits; i++) {\n\t y = y << 1 | x & 1;\n\t x >>>= 1;\n\t }\n\t return y;\n\t }\n\t}","function calculateNext(data) {\n \n var hthv, hthw, hthso, hthsi, hthvm, htho, hthvinf, hthwinf,\n tvm, ts, to, twp, twm, tso, tsi, vinf, winf, dv, dw, ds;\n \n cS.istim = _s1s2Stimulus(count,data);\n\n // Step functions\n hthv = (cS.u >= cS.thv);\n hthw = (cS.u >= cS.thw);\n hthso = (cS.u >= cS.thw);\n hthsi = (cS.u >= cS.thw);\n hthvm = (cS.u >= cS.thvm);\n htho = (cS.u >= cS.tho);\n hthvinf = (cS.u >= cS.thvm);\n hthwinf = (cS.u >= cS.tho); //thwinf = tho.\n\n // Multi-part terms\n tvm = (1 - hthvm) * cS.tv1m + hthvm * cS.tv2m;\n ts = (1 - hthw) * cS.ts1 + hthw * cS.ts2;\n to = (1 - htho) * cS.to1 + htho * cS.to2;\n twp = cS.tw1p + (cS.tw2p - cS.tw1p) * (1 + Math.tanh((cS.w - cS.wcp) * cS.kwp)) / 2;\n twm = cS.tw1m + (cS.tw2m - cS.tw1m) * (1 + Math.tanh((cS.u - cS.uwm) * cS.kwm)) / 2;\n tso = cS.tso1 + (cS.tso2 - cS.tso1) * (1 + Math.tanh((cS.u - cS.uso) * cS.kso)) / 2;\n tsi = cS.tsi1 + (cS.tsi1 - cS.tsi1) * (1 + Math.tanh((cS.s - cS.sc) * cS.ksi)) / 2;\n vinf = 1 - hthvinf;\n winf = (1 - hthwinf) * (1 - cS.u / cS.twinf) + hthwinf * cS.winfstar;\n\n // Gate evolution\n dv = (1 - hthv) * (vinf - cS.v) / tvm - hthv * cS.v / cS.tvp;\n dw = (1 - hthw) * (winf - cS.w) / twm - hthw * cS.w / twp;\n ds = ((1 + Math.tanh((cS.u - cS.us) * cS.ks)) / 2 - cS.s) / ts;\n cS.v = cS.v + cS.timestep * dv;\n cS.w = cS.w + cS.timestep * dw;\n cS.s = cS.s + cS.timestep * ds;\n \n // Currents\n cS.xfi = -cS.v * hthv * (cS.u - cS.thv) * (cS.uu - cS.u) / cS.tfi;\n cS.xso = (cS.u - cS.uo) * (1 - hthso) / to + hthso / tso;\n cS.xsi = -hthsi * cS.w * cS.s / tsi;\n \n // update u using forward Euler\n cS.u = cS.u - cS.timestep * (cS.xfi + cS.xso + cS.xsi - cS.istim);\n \n // sets voltage variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\n \n // sets current variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\n \n // iterate the count\n count++;\n \n return data; \n }","function fDCTQuant(data, fdtbl)\n\t {\n\t var d0, d1, d2, d3, d4, d5, d6, d7;\n\t /* Pass 1: process rows. */\n\t var dataOff=0;\n\t var i;\n\t var I8 = 8;\n\t var I64 = 64;\n\t for (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t //outputfDCTQuant[i] = fround(fDCTQuant);\n\t \n\t }\n\t return outputfDCTQuant;\n\t }","function Poll_FFT_DTMF()\r\n{\r\n //44100 / 1024 = 43,06 Hz saltos 21,533203125 Hz\r\n try\r\n {\r\n if (gb_use_mic_dtmf === true)\r\n { \r\n if ((typeof gb_mic === 'undefined') || (typeof gb_fft === 'undefined'))\r\n {\r\n\treturn;\r\n }\r\n\t \r\n let spectrum = gb_fft.analyze();\r\n let row= -1;\r\n let col= -1; \r\n \r\n if (spectrum[31] > 250){row = 0;}\r\n else{\r\n if (spectrum[35] > 250){row = 1;}\r\n else{\r\n if (spectrum[39] > 250){row = 2;}\r\n else{\r\n if (spectrum[43] > 250){row = 3;}\r\n\t }\r\n }\r\n }\r\n \r\n if (spectrum[55] > 250){col = 0;}\r\n else{\r\n if (spectrum[61] > 250){col = 1;}\r\n else{\r\n if (spectrum[67] > 250){col = 2;}\r\n else{\r\n if (spectrum[76] > 250){col = 3;}\r\n\t }\r\n }\r\n }\r\n \t\t\r\n if ((row>-1) && (col>-1))\r\n {\r\n gb_fft_dtmf = RowColToDtmf(row,col);\r\n gb_cadDTMF = gb_fft_dtmf;\r\n if (gb_fft_dtmf_antes != gb_fft_dtmf)\r\n\t{\t\r\n gb_fft_dtmf_antes = gb_fft_dtmf;\r\n gb_cad_areaRX += gb_fft_dtmf;\t\r\n\t gb_buf_rcv_dtmf += gb_fft_dtmf;\r\n\t gb_event_new_data_dtmf = true;\r\n\t if (gb_fft_dtmf === '#')\r\n\t {\r\n\t gb_begin_sync_dtmf= true;\r\n }\r\n\t switch (gb_fft_dtmf)\r\n\t {\r\n\t case '#': gb_begin_sms = true; gb_end_sms = false; break;\r\n\t case '*': gb_end_sms = true; gb_begin_sms = false; break;\t \r\n\t }\r\n\t if (gb_fft_dtmf === '*')\r\n\t {\r\n\t \r\n\t }\r\n gb_forceDraw = true;\r\n }\r\n }\r\n else\r\n {\r\n gb_fft_dtmf= gb_fft_dtmf_antes= '';\r\n }\r\n }\r\n }\r\n catch(err)\r\n {\r\n DebugLog(err.message.toString());\r\n } \r\n}","function tone(hh, peak) {\n let spectrum = junco_fft.analyze();\n let hh_value = spectrum[hh]; //TODO:ersetzten durch eigenes highhead value \n debugValues += hh_value.toString()\n debugValues += \" - \"\n if (lastHHval > hh_value) { //vergleichen und schauen in welche Richtung der Track läuft \n if (direction_hh > 0 && lastHHval > peak) { //TODO: anderer Wert\n if (hh === 131) { \n if (spacer < 2 && timer < 5) {\n let step = new Step(hh * 6, Math.floor(peak * 0.5));\n stair.push(step);\n spacer++;\n if (spacer === 1) {\n timer = 10;\n } else if (spacer === 2) {\n timer = 10;\n }\n } else {\n return;\n }\n }\n }\n if (hh === 104) {\n if (spacer < 1 && timer === 0) {\n let step = new Step(hh * 6, Math.floor(peak * 0.5));\n stair.push(step);\n spacer++;\n console.log(spacer)\n timer = 15;\n } else {\n return;\n }\n }\n if (hh === 87) {\n if (spacer < 1 && timer === 0) {\n let step = new Step(hh * 6, Math.floor(peak * 0.4));\n stair.push(step);\n spacer++;\n console.log(spacer)\n timer = 15;\n } else {\n return;\n }\n }\n if (hh === 65) {\n if (spacer < 2 && timer < 5) {\n let step = new Step(hh * 6, Math.floor(peak));\n stair.push(step);\n spacer++;\n if (spacer === 1) {\n timer = 10;\n } else if (spacer === 2) {\n timer = 20;\n }\n } else {\n return;\n }\n }\n direction_hh = -1; //man schaut auf welcher Seite des Ausschlags man ist\n } else {\n direction_hh = 1;\n }\n lastHHval = hh_value;\n}","function workerThreadFn() {\n\n let that = {};\n\n that.n = 1024;\n that.inverse = true;\n\n that.fft = new FFT.complex(that.n, that.inverse);\n\n parentPort.on('message', (payloadIn)=>{\n // let a = msg.bufferInput;\n // console.log(msg);\n\n let chunkCopy = payloadIn.chunk;\n\n const ffttype = 'complex';\n\n const width = 8*2;\n\n // how many uint32's (how many samples) did we get\n const sz = 1024;\n\n\n var dataView = new DataView(chunkCopy);\n\n\n // it's possible that a proxy may be faster here instead of building bufferInput/fftInput\n // https://ponyfoo.com/articles/es6-proxies-in-depth\n \n let bufferInput = new ArrayBuffer(sz*width); // in bytes\n let bufferOutput = new ArrayBuffer(sz*width); // in bytes\n\n // this.w.postMessage(bufferInput,[bufferInput]);\n\n\n let fftInput = new Float64Array(bufferInput);\n let fftOutput = new Float64Array(bufferOutput);\n // let uint8_out_view = new Uint8Array(bufferOutput);\n\n\n // in place modify of the copy\n for(let i = 0; i < sz*2; i+=2) {\n let re = dataView.getFloat64(i*8, true);// * this.gain;\n let im = dataView.getFloat64((i*8)+8, true);// * this.gain;\n // console.log('re: ' + re + ' im: ' + im);\n fftInput[i] = re;\n fftInput[i+1] = im;\n }\n\n that.fft.simple(fftOutput, fftInput, ffttype);\n\n const payloadOut = {id:payloadIn.id, bufferOutput:bufferOutput};\n\n parentPort.postMessage(payloadOut, [payloadOut.bufferOutput]);\n // console.log('finished');\n\n\n });\n}","function fDCTQuant(data, fdtbl)\n {\n var d0, d1, d2, d3, d4, d5, d6, d7;\n /* Pass 1: process rows. */\n var dataOff=0;\n var i;\n var I8 = 8;\n var I64 = 64;\n for (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n //outputfDCTQuant[i] = fround(fDCTQuant);\n\n }\n return outputfDCTQuant;\n }","function TMhs(htma,sol,T_BaseFrame){\n var T0 = [];\n for(var i=0;i>8&255),V(255&t)}function X(t,e,n,r,i){for(var o,s=i[0],a=i[240],h=function(t,e){var n,r,i,o,s,a,h,c,l,u,f=0;for(l=0;l<8;++l){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],s=t[f+4],a=t[f+5],h=t[f+6];var d=n+(c=t[f+7]),p=n-c,g=r+h,m=r-h,y=i+a,w=i-a,v=o+s,b=o-s,x=d+v,S=d-v,I=g+y,k=g-y;t[f]=x+I,t[f+4]=x-I;var _=.707106781*(k+S);t[f+2]=S+_,t[f+6]=S-_;var C=.382683433*((x=b+w)-(k=m+p)),A=.5411961*x+C,T=1.306562965*k+C,F=.707106781*(I=w+m),P=p+F,O=p-F;t[f+5]=O+A,t[f+3]=O-A,t[f+1]=P+T,t[f+7]=P-T,f+=8}for(l=f=0;l<8;++l){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],s=t[f+32],a=t[f+40],h=t[f+48];var E=n+(c=t[f+56]),q=n-c,B=r+h,D=r-h,U=i+a,j=i-a,R=o+s,M=o-s,N=E+R,z=E-R,L=B+U,H=B-U;t[f]=N+L,t[f+32]=N-L;var W=.707106781*(H+z);t[f+16]=z+W,t[f+48]=z-W;var G=.382683433*((N=M+j)-(H=D+q)),V=.5411961*N+G,Y=1.306562965*H+G,X=.707106781*(L=j+D),K=q+X,J=q-X;t[f+40]=J+V,t[f+24]=J-V,t[f+8]=K+Y,t[f+56]=K-Y,f++}for(l=0;l<64;++l)u=t[l]*e[l],Q[l]=0>4;for(var m=1;m<=f;++m)G(a);g&=15}o=32767+v[d],G(i[(g<<4)+w[o]]),G(y[o]),d++}return 63!=u&&G(s),n}function K(t){if(t<=0&&(t=1),100>3)*v+(d=4*(7&g)),w<=b+p&&(f-=v*(b+1+p-w)),v<=a+d&&(f-=a+d-v+4),h=m[f++],c=m[f++],l=m[f++],q[g]=(U[h]+U[c+256>>0]+U[l+512>>0]>>16)-128,B[g]=(U[h+768>>0]+U[c+1024>>0]+U[l+1280>>0]>>16)-128,D[g]=(U[h+1280>>0]+U[c+1536>>0]+U[l+1792>>0]>>16)-128;i=X(q,T,i,S,k),o=X(B,F,o,I,_),s=X(D,F,s,I,_),a+=32}b+=8}if(0<=E){var x=[];x[1]=E+1,x[0]=(1<>0]=38470*t,U[t+512>>0]=7471*t+32768,U[t+768>>0]=-11059*t,U[t+1024>>0]=-21709*t,U[t+1280>>0]=32768*t+8421375,U[t+1536>>0]=-27439*t,U[t+1792>>0]=-5329*t}(),K(t),(new Date).getTime()}()}","calculateTCUs (initial_directions, initial_PCEs) {\r\n // Ensure that the TCU volumes are up to date. Here we are assuming the user movement volumes have already been converted to their PCE.\r\n if (initial_directions == -1) {\r\n var direction_array = PROJECT.getIntersectionByID(this._intersection_ID).getZoneByIndex(this._zone_ID - 1).getDirectionArray();\r\n var PCE_table = PROJECT.getIntersectionByID(this._intersection_ID).getZoneByIndex(this._zone_ID - 1).getZonePCEs().getPCEArray();\r\n } else {\r\n var direction_array = initial_directions;\r\n var PCE_table = initial_PCEs.getPCEArray();\r\n console.log(direction_array);\r\n console.log(PCE_table);\r\n }\r\n \r\n for (var direction = 0; direction < 4; direction++) {\r\n \r\n var right_vol = PCE_table[direction].getRight();\r\n var through_vol = PCE_table[direction].getThrough();\r\n var left_vol = PCE_table[direction].getLeft();\r\n \r\n var right_turn_lanes = direction_array[direction].getRightTurn();\r\n var through_lanes = direction_array[direction].getThrough();\r\n var left_turn_lanes = direction_array[direction].getLeftTurn();\r\n var shared_right = direction_array[direction].getSharedRight();\r\n var shared_left = direction_array[direction].getSharedLeft();\r\n var chan_right = direction_array[direction].getChannelizedRight();\r\n \r\n // Gets the direction exactly 2 away from 'direction'; masking by three returns only the 1s and 2s bits (0 - 3)\r\n var opposing_throughs_vol = PCE_table[(direction + 2) & 3].getThrough();\r\n var opposing_right_vol = PCE_table[(direction + 2) & 3].getRight();\r\n var opposing_through_lanes = direction_array[(direction + 2) & 3].getThrough();\r\n var opposing_right_lanes = direction_array[(direction + 2) & 3].getRightTurn();\r\n var opposing_chan_right = direction_array[(direction + 2) & 3].getChannelizedRight();\r\n var opposing_left_lanes = direction_array[(direction + 2) & 3].getLeftTurn();\r\n var opposing_shared_left = direction_array[(direction + 2) & 3].getSharedLeft();\r\n \r\n var this_phase_split;\r\n \r\n if (direction % 2 === 0 && !this._north_south_split_override) {\r\n this._north_south_split_phase = (left_turn_lanes > 0 && shared_left) ? true : \r\n (opposing_left_lanes > 0 && opposing_shared_left) ? true : false;\r\n this_phase_split = this._north_south_split_phase;\r\n } else if (!this._east_west_split_override) {\r\n this._east_west_split_phase = (left_turn_lanes > 0 && shared_left) ? true : \r\n (opposing_left_lanes > 0 && opposing_shared_left) ? true : false;\r\n this_phase_split = this._east_west_split_phase;\r\n }\r\n \r\n if (this_phase_split) {\r\n this._protected_lefts[direction] = false;\r\n } else {\r\n this._protected_lefts[direction] = left_turn_lanes > 1 ? true : \r\n (left_vol >= 240 && left_turn_lanes == 1) ? true : \r\n (opposing_through_lanes == 1 && (left_vol * ( opposing_throughs_vol + opposing_right_vol * (1 - opposing_chan_right) ) ) > 50000) ? true :\r\n (opposing_through_lanes == 2 && (left_vol * ( opposing_throughs_vol + opposing_right_vol * (1 - opposing_chan_right) ) ) > 90000) ? true :\r\n (opposing_through_lanes == 3 && (left_vol * ( opposing_throughs_vol + opposing_right_vol * (1 - opposing_chan_right) ) ) > 110000) ? true :\r\n (opposing_through_lanes > 3 && left_turn_lanes > 0) ? true:\r\n false;\r\n }\r\n \r\n var throughs = through_vol;\r\n var rights = 0;\r\n var lefts = 0;\r\n \r\n if (!chan_right) {\r\n // Calculates % of right-turn volume in exclusive right-turn lanes and shared through-right\r\n var right_vol_splitfrac = ( (1 + (right_turn_lanes - shared_right)) / (right_turn_lanes + 1) );\r\n\r\n // Add shared rights to through volume\r\n throughs = Math.round(throughs + ((right_vol / UNIVERSAL_RIGHT_TURN_ADJUSTMENT_FACTOR ) * (1 - right_vol_splitfrac) ) );\r\n\r\n // Will be zero if no exclusive lanes; = right_vol if no shared right; something between 0 and right_vol if shared and exclusive rights exist for this approach\r\n rights = Math.round(right_vol * right_vol_splitfrac / right_turn_lanes) * (1 - chan_right);\r\n // Old version of this line; allows rights to be channelized AND shared. Probably an unnecessary case\r\n // rights = Math.round(right_vol * (right_vol_splitfrac * (1 - chan_right)) / right_turn_lanes);\r\n }\r\n \r\n // This needs to be adjusted for phase effect.\r\n var left_turn_factor = 5;\r\n var left_vol_splitfrac = (1 + (left_turn_lanes - shared_left)) / (left_turn_lanes + 1);\r\n \r\n throughs = throughs + (((left_vol * left_turn_factor) / UNIVERSAL_LEFT_TURN_ADJUSTMENT_FACTOR ) * (1 - left_vol_splitfrac) );\r\n var lefts = Math.round(left_vol * left_vol_splitfrac / left_turn_lanes);\r\n \r\n // Convert through volume to a flow rate\r\n throughs = Math.round(throughs / through_lanes);\r\n \r\n /////// NOW SET THE VOLUMES IN this._TCUs\r\n this._TCUs.getDirectionByIndex(direction).setLeft(lefts);\r\n this._TCUs.getDirectionByIndex(direction).setThrough(throughs);\r\n this._TCUs.getDirectionByIndex(direction).setRight(rights);\r\n \r\n console.log(this);\r\n } \r\n this.calculateCapacities();\r\n }","function draw() {\n background(0, 0, 0, 0.031);\n translate(posX ? posX : 0, posY ? posY : 0)\n stroke(78, 255, 255)\n rect(0.9 * width, 0, 10, accumulator);\n// fill(0,255,0,0.05)\n // fft.smooth();\n // fft.log\n // noise.start();\n spectrum = fft.analyze();\n chunkSize = Math.floor(spectrum.length / population);\n reducedSpectrum = arrayChunk(spectrum, chunkSize);\n // con\n reducedSpectrum.map((cluster, index) => {\n let sum = cluster.reduce((accum, element) => {\n return accum + element;\n });\n // then((sum) => {\n let val = sum / cluster.length;\n // console.log(val)\n if (index < population) {\n var comp = map(index, 0, population, 360, 0);\n stroke(comp, 255, 255);\n var r = map(val, 0, 255, 0.1, 125);\n x = map(index, 0, population, 0, width);\n y = map(index, 0, population, height, 0);\n ellipse(width / 2 + ants[index].dist, y , r);\n random(1) < 0.13 ? ants[index].move() : null;\n } else {\n accumulator += val;\n }\n // })\n // })\n })\n\n // for (i = 0; i < spectrum.length; i++) {\n // if (i < population) {\n // var comp = map(i, 0, population, 360, 0);\n // stroke(comp, 255, 255);\n // var r = map(spectrum[i], 0, 255, 0.1, 125);\n // x = map(i, 0, population, 0, width);\n // y = map(i, 0, population, height, 0);\n // ellipse(width / 2 + ants[i].dist, y, r);\n // ants[i].move();\n // } else {\n // accumulator += spectrum[i];\n // }\n // }\n}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","twistU() {\n this.fourCycle(this.cornerLoc, 0, 2, 4, 6, this.cornerOrient, 0, 0, 0, 0, 3);\n this.fourCycle(this.edgeLoc, 0, 3, 6, 9, this.edgeOrient, 1, 1, 1, 1, 2);\n this.sideOrient[1] = (this.sideOrient[1] + 3) % 4;\n }","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tvar I8 = 8;\n\t\t\tvar I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tvar I8 = 8;\n\t\t\tvar I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function fft_rx2 (re, im) {\n let N = re.length;\n if (N.toString(2) % 10) // return immediately if N is not power of 2\n return;\n else if (N <= 32) // if N is sufficiently small, compute dft directly\n return dft_direct(re, im);\n\n let W = discrete_circle(N); // N evenly spaced points around the unit circle\n im = im || re.map( a => 0 ); // set imaginary values to zero if not provided\n\n // compute N/2-point DFT for even and odd samples of input array\n let S_1 = fft_rx2(...[re, im].map( a => a.filter( (_, i) => !(i % 2) ) ));\n let S_2 = fft_rx2(...[re, im].map( a => a.filter( (_, i) => i % 2 ) ));\n\n // mutiply by twiddle factor. later, exploit symmetry W[k+N/2] = -W[k]\n let G_2 = S_2.map( (a, k) => cpx_mult(a, W[k % N]) );\n\n // combine for all frequencies k in N/2-1\n let X = [];\n for (let k of xrange(N/2)) {\n X[k] = cpx_add(S_1[k], G_2[k]);\n X[k + N/2] = cpx_sub(S_1[k], G_2[k]);\n }\n\n return X;\n}","function FluidField(canvas) {\r\n\r\n function lin_solve2(x, x0, y, y0, a, c)\r\n {\r\n if (a === 0 && c === 1) {\r\n for (var j=1 ; j <= height; j++) {\r\n var currentRow = j * rowSize;\r\n ++currentRow;\r\n for (var i = 0; i < width; i++) {\r\n x[currentRow] = x0[currentRow];\r\n y[currentRow] = y0[currentRow];\r\n ++currentRow;\r\n }\r\n }\r\n } else {\r\n var invC = 1/c;\r\n for (var k=0 ; k 0 && res < 1000000 && (wRes != width || hRes != height)) {\r\n width = wRes;\r\n height = hRes;\r\n reset();\r\n return true;\r\n }\r\n return false;\r\n }\r\n this.setResolution(1, 1);\r\n}","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tconst I8 = 8;\n\t\t\tconst I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tconst I8 = 8;\n\t\t\tconst I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tconst I8 = 8;\n\t\t\tconst I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tconst I8 = 8;\n\t\t\tconst I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function fDCTQuant(data, fdtbl)\n\t\t{\n\t\t\tvar d0, d1, d2, d3, d4, d5, d6, d7;\n\t\t\t/* Pass 1: process rows. */\n\t\t\tvar dataOff=0;\n\t\t\tvar i;\n\t\t\tconst I8 = 8;\n\t\t\tconst I64 = 64;\n\t\t\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\n\t\t\t\t//outputfDCTQuant[i] = fround(fDCTQuant);\n\n\t\t\t}\n\t\t\treturn outputfDCTQuant;\n\t\t}","function createFFT(smoothing,bins){\n // remember to call this function in setup\n // creates new p5 FFT constructor\n fft = new p5.FFT(smoothing,bins);\n}","function each( x, F, i0, i1 )\n{\n var len = x.length, argslen = arguments.length;\n if ( argslen < 4 ) i1 = len-1;\n if ( 0 > i1 ) i1 += len;\n if ( argslen < 3 ) i0 = 0;\n if ( i0 > i1 ) return x;\n var i, k, l=i1-i0+1, l1, lr, r, q;\n r=l&15; q=r&1;\n if ( q ) F(x[i0], i0, x);\n for (i=q; i 0.001) ? 0.32*(cS.v+47.13)/(1.0 - Math.exp(-0.1*(cS.v+47.13)) ): 3.2;\n bm = 0.08*Math.exp(cS.v/(-11.0));\n hlp = am+bm;\n tau = 1.0/hlp;\n expm_t = Math.exp(-cS.timestep/tau);\n \n mi_t = am/hlp;\n zINa_t = cS.gNa*(cS.v - cC.ena);\n expv_t = Math.exp(-cS.timestep/tauv_t);\n \n \n /*CA gating variables */\n \n hlp = Math.sqrt(2.0*cC.pi);\n hlp2= (cS.v-22.36)/16.6813;\n ad = (14.9859/(16.6813*hlp))*Math.exp(-0.5*hlp2*hlp2);\n hlp2 = (cS.v-6.2744)/14.93;\n bd = 0.1471-((5.3/(14.93*hlp))*Math.exp(-0.5*hlp2*hlp2));\n hlp = ad+bd;\n Infi = ad/hlp;\n zICa_t = cS.gCa*cC.fCa*Infi*(cS.v-cC.eca);\n \n af = 0.006872/(1.0+Math.exp((cS.v-6.1546)/6.1223));\n hlp = 0.0687*Math.exp(-0.1081*(cS.v+9.8255)) + 0.0112;\n hlp2 = 1.0+Math.exp(-0.2779*(cS.v+9.8255));\n bf = hlp/hlp2 + 0.0005474;\n hlp = af+bf;\n tau = 1.0/hlp;\n expff_t = Math.exp(-cS.timestep/tau);\n fi_t = af/hlp;\n \n /*TO gating variables */\n hlp = cS.v-42.2912;\n hlp2 = 0.5266*Math.exp(-0.0166*hlp);\n hlp3 = 1.0 + Math.exp(-0.0943*hlp);\n ar = hlp2/hlp3;\n hlp = 0.5149*Math.exp(-0.1344*(cS.v-5.0027)) + 0.00005186*cS.v;\n hlp2 = 1.0 + Math.exp(-0.1348*(cS.v-0.00005186));\n br = hlp/hlp2;\n hlp = ar+br;\n Infi = ar/hlp;\n zIto_t= cS.gto*Infi*(cS.v-cC.eto);\n hlp = cS.v + 34.2531;\n hlp2 = 0.0721*Math.exp(-0.173*hlp)+0.00005612*cS.v;\n hlp3 = 1.0+Math.exp(-0.1732*hlp);\n ato = hlp2/hlp3;\n hlp = cS.v + 34.0235;\n hlp2 = 0.0767*Math.exp(-1.66E-9*hlp)+0.0001215*cS.v;\n hlp3 = 1.0+Math.exp(-0.1604*hlp);\n bto = hlp2/hlp3;\n hlp = ato+bto;\n tau = 1.0/hlp;\n expto_t = Math.exp(-cS.timestep/tau);\n toi_t = ato/hlp;\n \n /* IK gating variables */\n expxx_t= Math.exp(-cS.timestep/(taux_t+40.0*(1.0-(Math.exp(160.0+cS.v*2.0)- Math.exp(-(160.0+cS.v*2.0)))/(Math.exp(160.0+cS.v*2.0)+ Math.exp(-(160.0+cS.v*2.0)))) ));\n zIK_t = cS.gK*(cS.v- cC.ekr);\n \n cS.istim = _s1s2Stimulus(count, data);\n \n /* Gating variables */\n cS.m = mi_t + ( cS.m - mi_t ) * expm_t;\n cS.f = fi_t + ( cS.f - fi_t ) * expff_t;\n cS.xv = vi_t + ( cS.xv - vi_t ) * expv_t;\n cS.to = toi_t + ( cS.to - toi_t ) * expto_t;\n cS.xx = xi_t + ( cS.xx - xi_t ) * expxx_t;\n \n /* The membrane currents */\n cS.ica = cS.f*zICa_t;\n cS.icab= zICab_t;\n cS.ina = cS.gNa*cS.xv*cS.xv*cS.m*cS.m*cS.m*(cS.v - cC.ena);\n cS.inab= zINab_t;\n cS.ik = cS.xx*cS.xx*zIK_t;\n cS.ik1 = zIK1_t;\n cS.ito = cS.to*zIto_t;\n cS.inaca = zINaCa1_t - cS.Cai*zINaCa2_t;\n cS.inak = zINaK_t;\n Itot= cS.ica+cS.icab+cS.ik1+cS.ik+cS.ina+cS.inab+cS.inaca+cS.inak+cS.ito-cS.istim;\n \n // \n \n /*if(count == 1){\n xlap = cC.d_o_dx2*(2.0*v(i+1)-2.0*cS.v);\n }\n else if (count == 1){\n xlap = cC.d_o_dx2*(2.0*v(i-1)-2.0*cS.v)\n }\n else{\n xlap = cC.d_o_dx2*(v(i+1)-2.0*cS.v+v(i-1))\n }*/\n \n /* The membrane potential */\n \n //cS.v = cS.v - cS.timestep*Itot+xlap; \n cS.v = cS.v - cS.timestep*Itot;\n \n // sets voltage variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\n \n // sets current variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\n \n // iterate the count\n count++;\n return data; \n }","constructor({audioCtx, fftSize, carFreq, modAmpl, modFreq, visualCtx}) {\n this.audioCtx = audioCtx;\n this,fftSize = fftSize;\n this.carFreq = carFreq;\n this.modAmpl = modAmpl;\n this.modFreq = modFreq;\n this.visualCtx = visualCtx;\n this.play = false;\n\n\n this.animate;\n this.analyserNode = audioCtx.createAnalyser();\n this.analyserNode.smoothingTimeConstant = 0.0;\n this.analyserNode.fftSize = fftSize;\n\n // Create the array for the data values\n this.frequencyArray = new Uint8Array(this.analyserNode.frequencyBinCount);\n\n // Uses the chroma.js library by Gregor Aisch to create a color gradient\n // download from https://github.com/gka/chroma.js\n this.colorScale = new chroma.scale('Spectral').domain([1,0]);\n // Global Variables for Drawing\n this.column = 0;\n this.canvasWidth = 800;\n this.canvasHeight = 256;\n }","function Ku(t) {\n for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];\n for (var r = 0, i = e; r < i.length; r++) {\n var o = i[r];\n t = o.Yf(t);\n }\n return t;\n}","_precompute() {\n\t\t\tconst encTable = this._tables[0];\n\t\t\tconst decTable = this._tables[1];\n\t\t\tconst sbox = encTable[4];\n\t\t\tconst sboxInv = decTable[4];\n\t\t\tconst d = [];\n\t\t\tconst th = [];\n\t\t\tlet xInv, x2, x4, x8;\n\n\t\t\t// Compute double and third tables\n\t\t\tfor (let i = 0; i < 256; i++) {\n\t\t\t\tth[(d[i] = i << 1 ^ (i >> 7) * 283) ^ i] = i;\n\t\t\t}\n\n\t\t\tfor (let x = xInv = 0; !sbox[x]; x ^= x2 || 1, xInv = th[xInv] || 1) {\n\t\t\t\t// Compute sbox\n\t\t\t\tlet s = xInv ^ xInv << 1 ^ xInv << 2 ^ xInv << 3 ^ xInv << 4;\n\t\t\t\ts = s >> 8 ^ s & 255 ^ 99;\n\t\t\t\tsbox[x] = s;\n\t\t\t\tsboxInv[s] = x;\n\n\t\t\t\t// Compute MixColumns\n\t\t\t\tx8 = d[x4 = d[x2 = d[x]]];\n\t\t\t\tlet tDec = x8 * 0x1010101 ^ x4 * 0x10001 ^ x2 * 0x101 ^ x * 0x1010100;\n\t\t\t\tlet tEnc = d[s] * 0x101 ^ s * 0x1010100;\n\n\t\t\t\tfor (let i = 0; i < 4; i++) {\n\t\t\t\t\tencTable[i][x] = tEnc = tEnc << 24 ^ tEnc >>> 8;\n\t\t\t\t\tdecTable[i][s] = tDec = tDec << 24 ^ tDec >>> 8;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Compactify. Considerable speedup on Firefox.\n\t\t\tfor (let i = 0; i < 5; i++) {\n\t\t\t\tencTable[i] = encTable[i].slice(0);\n\t\t\t\tdecTable[i] = decTable[i].slice(0);\n\t\t\t}\n\t\t}","function setup() {\n createCanvas(700, 300);\n fft = new p5.FFT();\n \n basso=[50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46, 50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46, 50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46, 50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46]; // the Basso Continuo\n \n violino=[78, 78, 76, 76, 74, 74, 73, 73, 71, 71, 69, 69, 71, 71, 73, 73, 74, 74, 73, 73, 71, 71, 69, 69, 67, 67, 66, 66, 67, 67, 64, 64, 62, 66, 69, 67, 66, 62, 66, 64, 62, 61, 62, 69, 67, 71, 69, 67, 66, 62, 64, 73, 74, 78, 81, 69, 71, 67, 69, 66, 62, 74, 74, 74]; // the three violine voices are actually the same, just shifted by two bars.\n\ni=0;\ns=0;\nv=[];\nb=new Canon(basso,0); // the basso\n}","process(fft) {\n var dct = new DCT()\n if (fft.length != this.fftSize) {\n throw Error('Passed in FFT bins were incorrect size. Expected ' + this.fftSize + ' but was ' + fft.length);\n }\n var melSpec = this.filterBank.filter(fft),\n melSpecLog = melSpec.map(log),\n melCoef = dct.process(melSpecLog).slice(0, 13)\n return melCoef;\n }","function triangulate(){\n var tfs = arrTF.slice();\n for (var i = 0; i < tfs.length; i++) {\n var f = tfs[i];\n if(f.length <= 3)continue;\n while(f.length > 3){\n arrE.push([f[0],f[2]]);\n arrTF.push([f[0],f[1],f[2]]);\n f.splice(1, 1);\n }\n arrTF[i] = f;\n }\n}","triggerFreqShifter() {\n this.freqShifterActive = this.freqShifterActive ? this.freqShifterActive = false : this.freqShifterActive = true;\n\n if (this.freqShifterActive) {\n this.player.connect(this.freqShifter);\n this.freqShifter.wet.rampTo(1, 0.1);\n this.volOut.volume.rampTo(-20, 0.5);\n this.shifterLoop = new Tone.Loop((time) => this.shifterLFO(), 0.01); // calls below function every 0.01 seconds\n this.shifterLoop.start();\n /*\n this.player.connect(this.freqShifter);\n this.freqShifter.wet.rampTo(1, 0.1);\n this.freqShifterLFO.start();\n */\n }\n\n else {\n this.freqShifter.wet.rampTo(0, 0.1);\n this.player.disconnect(this.freqShifter);\n this.volOut.volume.rampTo(-0, 0.5);\n this.shifterLoop.stop();\n this.freqShifterGoingDown = true;\n\n this.freqShifter.pitch = 0;\n\n this.freqShifterParamTrackActive = false;\n this.freqShifterParamTrackActive_Y = false;\n /*\n this.freqShifter.wet.rampTo(0, 0.1);\n this.player.disconnect(this.freqShifter);\n this.freqShifterParamTrack.wet.rampTo(0, 0.1);\n this.freqShifterParamTrackActive = false;\n this.freqShifterParamTrackActive_Y = false;\n */\n }\n }","function xu(t) {\n t.Wh.forEach((function(t) {\n t.next();\n }));\n}","function mdct_short(inout, inoutPos) {\n\t\tfor (var l = 0; l < 3; l++) {\n\t\t\tvar tc0, tc1, tc2, ts0, ts1, ts2;\n\n\t\t\tts0 = inout[inoutPos + 2 * 3] * win[Encoder.SHORT_TYPE][0]\n\t\t\t\t\t- inout[inoutPos + 5 * 3];\n\t\t\ttc0 = inout[inoutPos + 0 * 3] * win[Encoder.SHORT_TYPE][2]\n\t\t\t\t\t- inout[inoutPos + 3 * 3];\n\t\t\ttc1 = ts0 + tc0;\n\t\t\ttc2 = ts0 - tc0;\n\n\t\t\tts0 = inout[inoutPos + 5 * 3] * win[Encoder.SHORT_TYPE][0]\n\t\t\t\t\t+ inout[inoutPos + 2 * 3];\n\t\t\ttc0 = inout[inoutPos + 3 * 3] * win[Encoder.SHORT_TYPE][2]\n\t\t\t\t\t+ inout[inoutPos + 0 * 3];\n\t\t\tts1 = ts0 + tc0;\n\t\t\tts2 = -ts0 + tc0;\n\n\t\t\ttc0 = (inout[inoutPos + 1 * 3] * win[Encoder.SHORT_TYPE][1] - inout[inoutPos + 4 * 3]) * 2.069978111953089e-11;\n\t\t\t/*\n\t\t\t * tritab_s [ 1 ]\n\t\t\t */\n\t\t\tts0 = (inout[inoutPos + 4 * 3] * win[Encoder.SHORT_TYPE][1] + inout[inoutPos + 1 * 3]) * 2.069978111953089e-11;\n\t\t\t/*\n\t\t\t * tritab_s [ 1 ]\n\t\t\t */\n\t\t\tinout[inoutPos + 3 * 0] = tc1 * 1.907525191737280e-11 + tc0;\n\t\t\t/*\n\t\t\t * tritab_s[ 2 ]\n\t\t\t */\n\t\t\tinout[inoutPos + 3 * 5] = -ts1 * 1.907525191737280e-11 + ts0;\n\t\t\t/*\n\t\t\t * tritab_s[0 ]\n\t\t\t */\n\t\t\ttc2 = tc2 * 0.86602540378443870761 * 1.907525191737281e-11;\n\t\t\t/*\n\t\t\t * tritab_s[ 2]\n\t\t\t */\n\t\t\tts1 = ts1 * 0.5 * 1.907525191737281e-11 + ts0;\n\t\t\tinout[inoutPos + 3 * 1] = tc2 - ts1;\n\t\t\tinout[inoutPos + 3 * 2] = tc2 + ts1;\n\n\t\t\ttc1 = tc1 * 0.5 * 1.907525191737281e-11 - tc0;\n\t\t\tts2 = ts2 * 0.86602540378443870761 * 1.907525191737281e-11;\n\t\t\t/*\n\t\t\t * tritab_s[ 0]\n\t\t\t */\n\t\t\tinout[inoutPos + 3 * 3] = tc1 + ts2;\n\t\t\tinout[inoutPos + 3 * 4] = tc1 - ts2;\n\n\t\t\tinoutPos++;\n\t\t}\n\t}","function mdct_short(inout, inoutPos) {\n\t\tfor (var l = 0; l < 3; l++) {\n\t\t\tvar tc0, tc1, tc2, ts0, ts1, ts2;\n\n\t\t\tts0 = inout[inoutPos + 2 * 3] * win[Encoder.SHORT_TYPE][0]\n\t\t\t\t\t- inout[inoutPos + 5 * 3];\n\t\t\ttc0 = inout[inoutPos + 0 * 3] * win[Encoder.SHORT_TYPE][2]\n\t\t\t\t\t- inout[inoutPos + 3 * 3];\n\t\t\ttc1 = ts0 + tc0;\n\t\t\ttc2 = ts0 - tc0;\n\n\t\t\tts0 = inout[inoutPos + 5 * 3] * win[Encoder.SHORT_TYPE][0]\n\t\t\t\t\t+ inout[inoutPos + 2 * 3];\n\t\t\ttc0 = inout[inoutPos + 3 * 3] * win[Encoder.SHORT_TYPE][2]\n\t\t\t\t\t+ inout[inoutPos + 0 * 3];\n\t\t\tts1 = ts0 + tc0;\n\t\t\tts2 = -ts0 + tc0;\n\n\t\t\ttc0 = (inout[inoutPos + 1 * 3] * win[Encoder.SHORT_TYPE][1] - inout[inoutPos + 4 * 3]) * 2.069978111953089e-11;\n\t\t\t/*\n\t\t\t * tritab_s [ 1 ]\n\t\t\t */\n\t\t\tts0 = (inout[inoutPos + 4 * 3] * win[Encoder.SHORT_TYPE][1] + inout[inoutPos + 1 * 3]) * 2.069978111953089e-11;\n\t\t\t/*\n\t\t\t * tritab_s [ 1 ]\n\t\t\t */\n\t\t\tinout[inoutPos + 3 * 0] = tc1 * 1.907525191737280e-11 + tc0;\n\t\t\t/*\n\t\t\t * tritab_s[ 2 ]\n\t\t\t */\n\t\t\tinout[inoutPos + 3 * 5] = -ts1 * 1.907525191737280e-11 + ts0;\n\t\t\t/*\n\t\t\t * tritab_s[0 ]\n\t\t\t */\n\t\t\ttc2 = tc2 * 0.86602540378443870761 * 1.907525191737281e-11;\n\t\t\t/*\n\t\t\t * tritab_s[ 2]\n\t\t\t */\n\t\t\tts1 = ts1 * 0.5 * 1.907525191737281e-11 + ts0;\n\t\t\tinout[inoutPos + 3 * 1] = tc2 - ts1;\n\t\t\tinout[inoutPos + 3 * 2] = tc2 + ts1;\n\n\t\t\ttc1 = tc1 * 0.5 * 1.907525191737281e-11 - tc0;\n\t\t\tts2 = ts2 * 0.86602540378443870761 * 1.907525191737281e-11;\n\t\t\t/*\n\t\t\t * tritab_s[ 0]\n\t\t\t */\n\t\t\tinout[inoutPos + 3 * 3] = tc1 + ts2;\n\t\t\tinout[inoutPos + 3 * 4] = tc1 - ts2;\n\n\t\t\tinoutPos++;\n\t\t}\n\t}","stepThyratrons() {\n let X2bPtr = this.Xptr[1]-1;\n if (X2bPtr===0) X2bPtr = ROTOR_SIZES.X2;\n let S1bPtr = this.Sptr[0]-1;\n if (S1bPtr===0) S1bPtr = ROTOR_SIZES.S1;\n\n // Get Chi rotor 5 two back to calculate plaintext (Z+Chi+Psi=Plain)\n let X5bPtr=this.Xptr[4]-1;\n if (X5bPtr===0) X5bPtr=ROTOR_SIZES.X5;\n X5bPtr=X5bPtr-1;\n if (X5bPtr===0) X5bPtr=ROTOR_SIZES.X5;\n // Get Psi rotor 5 two back to calculate plaintext (Z+Chi+Psi=Plain)\n let S5bPtr=this.Sptr[4]-1;\n if (S5bPtr===0) S5bPtr=ROTOR_SIZES.S5;\n S5bPtr=S5bPtr-1;\n if (S5bPtr===0) S5bPtr=ROTOR_SIZES.S5;\n\n const x2sw = this.limitations.X2;\n const s1sw = this.limitations.S1;\n const p5sw = this.limitations.P5;\n\n // Limitation calculations\n let lim=1;\n if (x2sw) lim = this.rings.X[2][X2bPtr-1];\n if (s1sw) lim = lim ^ this.rings.S[1][S1bPtr-1];\n\n // P5\n if (p5sw) {\n let p5lim = this.P5Zbit[1];\n p5lim = p5lim ^ this.rings.X[5][X5bPtr-1];\n p5lim = p5lim ^ this.rings.S[5][S5bPtr-1];\n lim = lim ^ p5lim;\n }\n\n const basicmotor = this.rings.M[2][this.Mptr[0]-1];\n this.totalmotor = basicmotor;\n\n if (x2sw || s1sw) {\n if (basicmotor===0 && lim===1) {\n this.totalmotor = 0;\n } else {\n this.totalmotor = 1;\n }\n }\n\n // Step Chi rotors\n for (let r=0; r<5; r++) {\n this.Xptr[r]++;\n if (this.Xptr[r] > ROTOR_SIZES[\"X\"+(r+1)]) this.Xptr[r] = 1;\n }\n\n if (this.totalmotor) {\n // Step Psi rotors\n for (let r=0; r<5; r++) {\n this.Sptr[r]++;\n if (this.Sptr[r] > ROTOR_SIZES[\"S\"+(r+1)]) this.Sptr[r] = 1;\n }\n }\n\n // Move M37 rotor if M61 set\n if (this.rings.M[1][this.Mptr[1]-1]===1) this.Mptr[0]++;\n if (this.Mptr[0] > ROTOR_SIZES.M37) this.Mptr[0]=1;\n\n // Always move M61 rotor\n this.Mptr[1]++;\n if (this.Mptr[1] > ROTOR_SIZES.M61) this.Mptr[1]=1;\n }","function ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function frameLooper() {\n window.requestAnimationFrame(frameLooper); // recursive yaaay, for looping\n // fbc_array is our actual frequency/amplitude array\n // having access to this will be key to split up later\n fbc_array = new Uint8Array(analyser.frequencyBinCount);\n\n analyser.getByteFrequencyData(fbc_array);\n ctx.clearRect(0, 0, canvas.width, canvas.height); // clear the canvas every loop\n ctx.fillStyle = '#00CCFF'; // color of the bars. I chose sky blue\n bars = 128; // how many bars to render. 128 might make the most sense.\n // fbc_array.length == 1024, so each bar represents 8 frequencies\n\n for(var i = 0; i < bars; i++){\n bar_x = i * 2; // each bar is 3 units apart on the x axis\n bar_width = 1; // each bar is 2 units wide. 0-1 is a bar, 2 is not, 3-4 is a bar, etc. But this is based on the width of the canvas\n bar_height = -(fbc_array[i] / 2); // frequency data, of the current index. The amplitude\n\n // amps[0].text = fbc_array[0]; // not working\n\n // here I'm finding out stuff about the bar_height\n // barH.innerHTML = fbc_array; // this is a simple trick for now, but I want to make a 32x32 grid, and loop over it and fill the number (amp) into each of them\n // Doing this at every frame makes everything lag, so idk if I'll have to comment out the *BAR* visualization for testing purposes. Then I'll make a grid of the array, change the color of the text as it increases, and that'll be my new visualisation.\n\n // fillRect(x, y, width, height) // explanation of the parameters below\n ctx.fillRect(bar_x, canvas.height, bar_width, bar_height); // this draws the bars themselves\n }\n\n\n // Table visualization\n for(var j = 0; j < fbc_array.length; j++){\n amps[j].innerHTML = fbc_array[j];\n // styling is gonna be difficult\n // amps[j].css({\"background-color\":`rgb(0,${j}, ${j})`});\n }\n\n}","_AMDF(buf, sampleRate) {\n var SIZE = buf.length; // set SIZE variable equal to buffer length 4096 => half a second\n var MAX_SAMPLES = Math.floor(SIZE / 2); // set MAX_SAMPLES = 4096/2 = 2048\n var best_offset = -1; // initialise best_offset to -1\n var best_correlation = 0; // initialise best_correlation to 0\n var rms = 0; // initialise rms to 0 (rms => root-mean-square)\n var foundGoodCorrelation = false; // initialise foundGoodCorrelation flag to false\n var correlations = new Array(MAX_SAMPLES); // create an array variable called correlations of size MAX_SAMPLES (2048)\n\n for (var i = 0; i < SIZE; i++) {\n var val = buf[i]; // val is equal to the (i)th value in the array\n rms += val * val; // rms is the summation of each value squared\n }\n rms = Math.sqrt(rms / SIZE); // set rms equal to the square root of rms/SIZE (square root of the average)\n if (rms < 0.01) // not enough signal\n return -1;\n\n var lastCorrelation = 1; // initialise lastCorrelation to 1 so that the first check won't be the best correlation\n for (var offset = 52; offset < 160; offset++) { // offset initialised to 52, goes through a for loop from 52 to 160, which will cover the notes that Singphony can render\n var correlation = 0; // re-set correlation to 0 at each offset value\n\n for (var i = 0; i < MAX_SAMPLES; i++) { // cycle through from 0 to 2048\n correlation += Math.abs((buf[i]) - (buf[i + offset])); // step through at each value and subtract the value at the offset from the value in the original buffer and keep adding that to the correlation value\n } // correlation will be a large enough positive float\n\n correlation = 1 - (correlation / MAX_SAMPLES); // set correlation to 1 - correlation/512\n correlations[offset] = correlation; // store it, for the tweaking we need to do below.\n if ((correlation > this.GOOD_ENOUGH_CORRELATION) && (correlation > lastCorrelation)) { // if the correlation value is higher than 0.9 and the previous correlation value\n foundGoodCorrelation = true; // set foundGoodCorrelation flag to true\n if (correlation > best_correlation) { //\n best_correlation = correlation; // update the best_correlation value to the latest correlation value\n best_offset = offset; // update best_offset to the latest offset value\n }\n } else if (foundGoodCorrelation) {\n // short-circuit - we found a good correlation, then a bad one, so we'd just be seeing copies from here.\n return sampleRate / best_offset;\n }\n lastCorrelation = correlation; // set lastCorrelation to latest correlation\n }\n return -1;\n }","function sha1_ft(t, b, c, d)\r\n{\r\n if(t < 20) return (b & c) | ((~b) & d);\r\n if(t < 40) return b ^ c ^ d;\r\n if(t < 60) return (b & c) | (b & d) | (c & d);\r\n return b ^ c ^ d;\r\n}","function calculateNext(data) {\n\n var alpham, betam, alphah, betah, alphaj, betaj, alphaoa,\n betaoa, alphaoi, betaoi, alphaua, betaua, alphaui, betaui, alphaxr, betaxr, alphaxs, betaxs,\n temp, xnaca11, xnaca21;\n\n var exptaum_t, xinfm_t, exptauh_t, xinfh_t, exptauj_t, xinfj_t, \n xk1t_t, exptauoa_t, xinfoa_t, exptauoi_t, xinfoi_t, exptauua_t, xinfua_t, exptauui_t, xinfui_t, xkurcoeff_t, xkrcoeff_t, \n exptaud_t, xinfd_t, exptauf_t, xinff_t, xnakt_t, xnaca1_t, \n xnaca2_t, exptauw_t, xinfw_t;\n\n /* moved to settings as previous value required \n exptauxr_t, xinfxr_t, exptauxs_t, xinfxs_t*/\n\n var xinffca_t , xpcat_t, ecat_t, xupt_t, carow2_t;\n\n var xinfut_t, exptauvt_t, xinfvt_t; \n\n var xstim, eca, xinfm1, exptaum1, xinfh1, exptauh1, xinfj1, exptauj1,\n xinfoa1, exptauoa1, xinfoi1, exptauoi1,\n xinfua1, exptauua1, xinfui1, exptauui1, xkurcoeff1,\n xinfxr1, exptauxr1, xkrcoeff1,\n xinfxs1, exptauxs1,\n xinfd1, exptaud1, xinff1, exptauf1, xinffca1,\n xinfu, exptauv, xinfv, xinfw1, exptauw1,\n xtr, xup, xupleak,\n di_ups, carow21; \n\n //calculations start\n //\n\n alpham = (Math.abs( cS.v + 47.13) < 1e-5) ? 3.2 : 0.32 * ( cS.v + 47.13 )/( 1.- Math.exp(-0.1*( cS.v + 47.13 ) ) );\n\n betam = 0.08 * Math.exp (- cS.v /11.);\n\n alphah = ( cS.v > -40.0 ) ? 0.0 : 0.135 * Math.exp(-( cS.v+80.0)/6.8); \n\n betah = ( cS.v > -40.0 ) ? 1.0/ (0.13 * (1.0 + Math.exp (-( cS.v + 10.66)/11.1))) \n : 3.56 * Math.exp ( 0.079 * cS.v ) + 3.1e5 * Math.exp(0.35 * cS.v); \n\n alphaj = ( cS.v > -40.0 ) ? 0.0 \n : (-127140 * Math.exp(0.2444 * cS.v)-3.474e-5 * Math.exp(-0.04391 * cS.v)) * ( cS.v + 37.78)/(1. + Math.exp (0.311 * ( cS.v + 79.23))); \n\n betaj = ( cS.v > -40.0 ) ? 0.3 * Math.exp(-2.535e-7 * cS.v)/(1.+Math.exp(-0.1 * ( cS.v+32.))) \n : 0.1212 * Math.exp(-0.01052 * cS.v)/(1.+Math.exp(-0.1378 * ( cS.v+40.14))); \n\n alphaoa = 0.65 / ( Math.exp ( - ( cS.v + 10. ) / 8.5 ) + Math.exp ( - ( cS.v-30. ) / 59. ) ); \n\n betaoa = 0.65 / ( 2.5 + Math.exp ( ( cS.v + 82. ) / 17. ) );\n\n alphaoi = 1.0 / ( 18.53 + Math.exp ( ( cS.v + 113.7 ) / 10.95 ) );\n\n betaoi = 1.0 / ( 35.56 + Math.exp ( - ( cS.v + 1.26 ) / 7.44 ) ); \n\n alphaua = 0.65 / ( Math.exp ( - ( cS.v + 10. ) / 8.5 ) + Math.exp ( - ( cS.v-30. ) / 59. ) ); \n\n betaua = 0.65 / ( 2.5 + Math.exp ( ( cS.v + 82. ) / 17. ) ); \n\n alphaui = 1.0 / ( 21. + Math.exp ( - ( cS.v-185. ) / 28. ) ) ; \n\n betaui = Math.exp ( ( cS.v-158. ) / 16. ); \n\n alphaxr = 0.0003* ( cS.v + 14.1 ) / ( 1.- Math.exp ( - ( cS.v + 14.1 ) / 5. ) ); \n\n betaxr = 7.3898e-5* ( cS.v-3.3328 ) / ( Math.exp ( ( cS.v-3.3328 ) / 5.1237 ) -1. ); \n\n alphaxs = 4e-5* ( cS.v-19.9 ) / ( 1.- Math.exp ( - ( cS.v-19.9 ) / 17. ) ); \n\n betaxs = 3.5e-5* ( cS.v-19.9 ) / ( Math.exp ( ( cS.v-19.9 ) / 9. ) -1. );\n\n //table variables depending on V\n\n exptaum_t = Math.exp(- cS.timestep*(alpham+betam));\n\n xinfm_t = alpham/(alpham+betam);\n\n exptauh_t = Math.exp(- cS.timestep*(alphah+betah));\n\n xinfh_t = alphah/(alphah+betah);\n\n exptauj_t = Math.exp(- cS.timestep*(alphaj+betaj));\n\n xinfj_t = alphaj/(alphaj+betaj);\n\n xk1t_t = cS.gk1*( cS.v- cC.ek)/(1.+Math.exp(0.07*( cS.v + 80.)));\n\n exptauoa_t = Math.exp(- cS.timestep*((alphaoa+betaoa)* cS.xkq10));\n\n xinfoa_t = 1.0/(1.+Math.exp(-( cS.v+20.47)/17.54));\n\n exptauoi_t = Math.exp(- cS.timestep*((alphaoi+betaoi)* cS.xkq10));\n\n xinfoi_t = 1.0/(1.+Math.exp(( cS.v+43.1)/5.3));\n\n exptauua_t = Math.exp(- cS.timestep*((alphaua+betaua)* cS.xkq10));\n\n xinfua_t = 1.0/(1.+Math.exp(-( cS.v+30.3)/9.6));\n\n exptauui_t = Math.exp(- cS.timestep*((alphaui+betaui)* cS.xkq10));\n\n xinfui_t = 1.0/(1.+Math.exp(( cS.v-99.45)/27.48));\n\n xkurcoeff_t = (0.005+0.05/(1.+Math.exp(-( cS.v-15.)/13.)))*( cS.v- cC.ek);\n\n\n if(!((Math.abs( cS.v+14.1) < 1e-5) || (Math.abs( cS.v-3.3328)<1e-5))){\n cS.exptauxr_t = Math.exp(- cS.timestep*(alphaxr+betaxr));\n cS.xinfxr_t = 1.0/(1.+Math.exp(-( cS.v+14.1)/6.5));\n }\n\n xkrcoeff_t = cS.gkr*( cS.v- cC.ek)/(1.+Math.exp(( cS.v+15.)/22.4));\n\n if(!(Math.abs( cS.v-19.9) < 1e-5)){\n cS.exptauxs_t = Math.exp(- cS.timestep/0.5*(alphaxs+betaxs));\n cS.xinfxs_t = 1.0/Math.sqrt(1.+Math.exp(-( cS.v-19.9)/12.7));\n }\n\n //temp varaible used for calculations\n temp = (1.0-Math.exp(-( cS.v+10.)/6.24))/(0.035*( cS.v+10.)* (1.+Math.exp(-( cS.v+10.)/6.24)));\n\n if(Math.abs( cS.v+10) < 1e-5){\n exptaud_t = 2.2894;\n exptauf_t = 0.9997795;\n }\n else{\n exptaud_t = Math.exp(- cS.timestep/temp); \n exptauf_t = Math.exp(- cS.timestep/9.*(0.0197*Math.exp(Math.pow(-(0.0337 *( cS.v+10.)), 2))+0.02));\n }\n\n xinfd_t = 1.0/(1.+Math.exp(-( cS.v+10.)/8.));\n\n xinff_t = 1.0/(1.+Math.exp(( cS.v+28.)/6.9));\n\n xnakt_t = (1.0/(1.+0.1245*Math.exp(-0.1* cS.v/ cC.rtof)+0.0365* cC.sigma*Math.exp(- cS.v/ cC.rtof)))* cS.xinakmax/(1.+(Math.pow(( cS.xkmnai/ cS.cnai),1.5)))*( cS.cko/( cS.cko+ cS.xkmko));\n\n xnaca1_t = cS.xinacamax*Math.exp( cS.gamma* cS.v/ cC.rtof)*(Math.pow( cS.cnai,3))* cS.ccao/((Math.pow( cS.xkmna,3)+ Math.pow( cS.cnao,3))*( cS.xkmca+ cS.ccao)*(1.+ cS.xksat*Math.exp(( cS.gamma-1.)* cS.v/ cC.rtof)));\n\n xnaca2_t = cS.xinacamax*Math.exp(( cS.gamma-1.)* cS.v/ cC.rtof)/((Math.pow( cS.xkmna,3) + Math.pow( cS.cnao,3))*( cS.xkmca+ cS.ccao)*(1.+ cS.xksat*Math.exp(( cS.gamma-1.)* cS.v/ cC.rtof))); \n\n temp = 6.0*(1.-Math.exp(-( cS.v-7.9)/5.))/((1.+0.3*Math.exp(-( cS.v-7.9)/5.))*( cS.v-7.9)); \n\n exptauw_t = Math.exp(- cS.timestep/temp);\n\n xinfw_t = 1.0-1.0/(1.+Math.exp(-( cS.v-40.)/17.));\n\n //table variables depending on ca\n\n xinffca_t = 1.0/(1.+ cS.ccai/0.00035);\n xpcat_t = cS.xipcamax* cS.ccai/(0.0005+ cS.ccai);\n ecat_t = cC.rtof*0.5*Math.log( cS.ccao/ cS.ccai);\n xupt_t = cS.xupmax/(1.+ cS.xkup/ cS.ccai);\n carow2_t = ( cS.trpnmax* cS.xkmtrpn/( cS.ccai+ cS.xkmtrpn)/( cS.ccai+ cS.xkmtrpn) + cS.cmdnmax* cS.xkmcmdn/( cS.ccai+ cS.xkmcmdn)/( cS.ccai+ cS.xkmcmdn)+1.)/ cC.c_b1c;\n\n //table variables depending on fn\n /* fnlo=-0.2,fnhi=2.3,nfnt=2500\n dfntable=(fnhi-fnlo)/float(nfnt)\n fn=fnlo+i*dfntable\n */\n xinfut_t = 1.0/(1.+ Math.exp(-( cS.fn/13.67e-4-250.0)));\n\n temp = 1.91+2.09/(1.+ Math.exp(-( cS.fn/13.67e-4-250.0)));\n\n exptauvt_t = Math.exp(- cS.timestep/temp);\n\n xinfvt_t = 1.-1.0/(1.+ Math.exp(-( cS.fn-6.835e-14)/13.67e-16));\n\n\n // table loop starts here\n\n xstim = _s1s2Stimulus(count, data);\n\n //c equilibrium potentials\n eca = ecat_t;\n\n //c fast sodium current\n xinfm1 = xinfm_t;\n exptaum1 = exptaum_t;\n xinfh1 = xinfh_t;\n exptauh1 = exptauh_t;\n xinfj1 = xinfj_t;\n exptauj1 = exptauj_t;\n\n cS.xm = xinfm1 + ( cS.xm - xinfm1) * exptaum1;\n cS.xh = xinfh1 + ( cS.xh - xinfh1) * exptauh1;\n cS.xj = xinfj1 + ( cS.xj - xinfj1) * exptauj1; \n cS.xna = cS.xm * cS.xm * cS.xm * cS.xh * cS.xj * cS.gna *( cS.v - cC.ena);\n\n //c time-independent k+ current\n cS.xk1 = xk1t_t;\n\n //c transient outward k+ current\n xinfoa1 = xinfoa_t;\n exptauoa1 = exptauoa_t;\n xinfoi1 = xinfoi_t;\n exptauoi1 = exptauoi_t;\n\n cS.xoa = xinfoa1+( cS.xoa-xinfoa1)*exptauoa1;\n cS.xoi = xinfoi1+( cS.xoi-xinfoi1)*exptauoi1;\n cS.xto = cS.xoa* cS.xoa* cS.xoa* cS.xoi* cS.gto*( cS.v - cC.ek);\n\n //c ultrarapid delayed rectifier k+ current\n xinfua1 = xinfua_t;\n exptauua1 = exptauua_t;\n xinfui1 = xinfui_t;\n exptauui1 = exptauui_t;\n xkurcoeff1= xkurcoeff_t;\n\n cS.xua = xinfua1+( cS.xua-xinfua1)*exptauua1;\n cS.xui = xinfui1+( cS.xui-xinfui1)*exptauui1;\n cS.xkur = cS.xua* cS.xua* cS.xua* cS.xui*xkurcoeff1;\n\n //c rapid delayed outward rectifier k+ current\n xinfxr1 = cS.xinfxr_t;\n exptauxr1 = cS.exptauxr_t;\n xkrcoeff1 = xkrcoeff_t;\n\n cS.xr = xinfxr1+( cS.xr-xinfxr1)*exptauxr1;\n cS.xkr = cS.xr*xkrcoeff1;\n\n //c slow delayed outward rectifier k+ current\n xinfxs1 = cS.xinfxs_t;\n exptauxs1 = cS.exptauxs_t;\n\n cS.xs = xinfxs1+( cS.xs-xinfxs1)*exptauxs1;\n cS.xks = cS.xs* cS.xs* cS.gks*( cS.v- cC.ek);\n\n //c L-tpe ca2+ current\n xinfd1 = xinfd_t;\n exptaud1 = exptaud_t;\n xinff1 = xinff_t;\n exptauf1 = exptauf_t;\n xinffca1 = xinffca_t;\n\n cS.xd = xinfd1+( cS.xd-xinfd1)*exptaud1;\n cS.xf = xinff1+( cS.xf-xinff1)*exptauf1;\n cS.xfca = xinffca1+( cS.xfca-xinffca1)* cC.exptaufca;\n cS.xcal = cS.xd* cS.xf* cS.xfca* cS.gcal*( cS.v-65.0);\n\n //xnak, xnaca, xbca, xbna, xpca; \n\n //cc na+/k+ pump current\n cS.xnak = xnakt_t;\n\n //c na+/ca2+ exchanger current\n xnaca11 = xnaca1_t;\n xnaca21 = xnaca2_t;\n cS.xnaca = xnaca11 - xnaca21* cC.cnao3* cS.ccai;\n\n //cc background currents\n cS.xbca = cS.gbca * ( cS.v - eca);\n\n cS.xbna = cS.gbna * ( cS.v - cC.ena);\n\n //c ca2+ pump current\n cS.xpca = xpcat_t;\n\n /*c ca2+ release current from JSR\n c correction: divide first fn term by cm, multiply second fn term by cm\n c then to ensure computational accuracy (no problems with tiny numbers),\n c divide fn by 1e-12 and adjust functions accordingly*/\n cS.xrel = cS.xkrel* cS.xu* cS.xu* cS.xv* cS.xw*( cS.ccarel- cS.ccai);\n\n cS.fn = cS.vrel/ cS.cm* cS.xrel-0.5 * cS.cm/ cS.xxf*(0.5* cS.xcal-0.2* cS.xnaca);\n\n xinfu = xinfut_t;\n exptauv = exptauvt_t;\n xinfv = xinfvt_t;\n\n cS.xu = xinfu+( cS.xu-xinfu)* cC.exptauu;\n cS.xv = xinfv+( cS.xv-xinfv)*exptauv;\n\n xinfw1 = xinfw_t;\n exptauw1 = exptauw_t;\n\n cS.xw = xinfw1+( cS.xw-xinfw1)*exptauw1;\n cS.xrel = cS.xkrel* cS.xu* cS.xu* cS.xv* cS.xw*( cS.ccarel - cS.ccai);\n\n // c transfer current from NSR to JSR\n xtr = ( cS.ccaup - cS.ccarel)/ cS.tautr;\n\n // c ca2+ uptake current by the NSR\n xup = xupt_t;\n\n // c ca2+ leak current by the NSR\n xupleak = cS.ccaup* cS.xupmax/ cS.ccaupmax;\n\n //c intracellular ion concentrations\n di_ups = xup-xupleak;\n carow21 = carow2_t;\n cS.ccai = cS.ccai + cS.timestep * ( cC.c_b1d*( cS.xnaca + cS.xnaca - cS.xpca - cS.xcal - cS.xbca)- cC.c_b1e* di_ups + cS.xrel) / carow21; \n cS.ccaup = cS.ccaup + cS.timestep * (xup - xupleak-xtr*( cS.vrel/ cS.vup));\n cS.ccarel = cS.ccarel + cS.timestep * ((xtr - cS.xrel)/ (1.+( cS.csqnmax* cS.xkmcsqn)/(Math.pow(( cS.ccarel+ cS.xkmcsqn),2))));\n\n //console.log( cS.xna , cS.xk1 , + cS.xkur + cS.xto , cS.xkur , cS.xkr , cS.xks , cS.xcal , cS.xpca , cS.xnak, cS.xnaca, cS.xbna, cS.xbca-xstim);\n \n cS.v = cS.v - cS.timestep * ( cS.xna + cS.xk1 + cS.xto + cS.xkur + cS.xkr + cS.xks + cS.xcal + cS.xpca + cS.xnak + cS.xnaca + cS.xbna + cS.xbca - xstim);\n\n // table loop ends\n\n //cal ends\n // sets voltage variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\n \n // sets current variables after calculations\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\n\n // iterate the count\n count++;\n\n return data; \n }","function makeSamples(groove, color, data){\n\n\tvar oneSecond = 44100;\n\tvar loop = false;\n\tvar repeats = 4;\n\tvar repeated = 0;\n\tvar PI = Math.PI;\n\n\tvar maxSamples = (groove.duration * oneSecond ) / 1000 ;\t\n var instrumentType = \"sin\";\n var delay = false;\n if (color == 0) {\n\tdelay = true;\n } \n else if (color == 1) {\n } \n else if (color == 2) {\n\tinstrumentType = \"sqr\";\n } \n else if (color == 3) {\n\tinstrumentType = \"sqr\";\n } \n else if (color == 4) {\n\tinstrumentType = \"sqr\";\n } \n else if (color == 5) {\n\tinstrumentType = \"sqr\";\n } \n else if (color == 6) {\n\tinstrumentType = \"sqr\";\n\tdelay = true;\n } \n else if (color == 7) {\n\tinstrumentType = \"saw\";\n } \n else if (color == 8) {\n\tinstrumentType = \"saw\";\n } \n else if (color == 9) {\n\tinstrumentType = \"saw\";\n } \n else if (color == 10) {\n\tinstrumentType = \"saw\";\n } \n\n var freqs = data[0];\n var times = data[1];\n\tdebugfreqs = freqs;\n \tdebugtimes = times;\n\n var samples = [];\n ii = 0;\n var tcounter = 0;\n for (var j = 0; j < freqs.length - 1; j++) {\n\t\tif (j == 0 && times[0] > groove.startLine){\n\t\t\tvar freqDur = times[j] / groove.lineLength;\n\t \n\t\t\tfreqDur = freqDur * groove.duration;\n\t\t\tfreqDur = freqDur * 44100;\n\t\t\tfreqDur = Math.floor(freqDur / 1000);\n\t \n\t \tfor (var i = 0; i < freqDur; i++) {\n\t \t var t = i / oneSecond; \n\t \t samples[ii] = 0;\n\t \t ii++;\n\t\t }\n\t\t}\n var frequency = freqs[j];\n//\tif (freqs.length > j + 1 && freqs[j + 1] == 0){\n//\t\tfrequency = 0;\n//\t}\n\n var freqDur = times[j + 1] / groove.lineLength;\n \n freqDur = freqDur * groove.duration;\n freqDur = freqDur * 44100;\n freqDur = Math.floor(freqDur / 1000);\n\n// \tfor (var i = 0; i < freqDur; i++){\n\t\tvar i = 0;\n while (true){\n var t = i / oneSecond; // time from 0 to 1\n if (frequency == 0){\n samples[ii] = 0;\n }\n\t\t else if (instrumentType == \"sin\"){\n\t\t samples[ii] = Math.sin(frequency * 2 * PI * t); // wave equation (between -1,+1)\n\t\t }\n else if (instrumentType == \"sqr\") {\n\t\t\t if (Math.sin(frequency * 2 * PI * t) > 0){\n\t\t\t\t\tsamples[ii] = 1; } else { samples[ii] = -1;\n\t\t\t\t}\n\t\t }\n else if (instrumentType == \"saw\") {\n \tsamples[ii] = 1 - ((frequency*t)%1);\n\t\t }\n samples[ii] = samples[ii] * 0.25;\n\n\t\t\tif (i >= freqDur){\n\t\t\t\tif (instrumentType == \"sin\"){\n\t\t\t\t\tif (samples[ii] == 0 || (samples[ii -1] < samples[ii] && samples[ii] < 0.01 && samples[ii] > -0.01)){\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\t\t\n\t\t\t}\n ii++;\n if (maxSamples > 0 && ii >= maxSamples){\n\t\t\t\tbreak;\n\t\t }\n\t\t i++;\n }\n if (maxSamples > 0 && ii >= maxSamples){\n\t\t\tbreak;\n\t }\n }\n if (maxSamples == 0){\n\t\tmaxSamples = ii;\n }\n else {\n\t\twhile (ii < maxSamples){\n\t \t\tsamples[ii] = 0;\n\t \tii++;\n\t\t}\n }\n//\tdocument.write(ii);\n//\tdocument.write(\"
\");\n// var delayLine = new Array;\n// var pointer = 0;\n// var delayLength = oneSecond / 2;\n// for (var ijj = 0; ijj < groove.lineLength; ijj++){\n//\t\tdelayLine[ijj] = 0;\n// }\n for (var repeat = 1 ; repeat < repeats; repeat++){\n for (var jj = 0 ; jj < ii ; jj++){\n samples[jj + ii * repeat] = samples[jj];\n\t if (delay){\n//\t\tsamples[jj + ii * repeat] = samples[jj + ii * repeat] - 0.5*delayLine[pointer];\n//\t\tdelayLine[pointer] = samples[jj + ii * repeat];\n//\t\tpointer = (pointer+1)%lineLength;\n }\n\t }\n\t}\n return samples;\n}","function addEqualiser() {\n\n var gainDb = -40.0; // atenuation When it takes a positive value it is a real gain, when negative it is an attenuation. It is expressed in dB, has a default value of 0 and can take a value in a nominal range of -40 to 40.\n var bandSplit = [360, 3600];\n context_player = new AudioContext();\n\n for (var i = 0; i < 2; i++) {\n\n mediaElement_player.push(null);\n sourceNode_player.push(null);\n source_player.push(null);\n lGain_player.push(null);\n mGain_player.push(null);\n hGain_player.push(null);\n sum_player.push(null);\n volumeNodes.push(null);\n\n\n mediaElement_player[i] = document.getElementById('jp_audio_' + i);\n source_player[i] = context_player.createMediaElementSource(mediaElement_player[i]);\n\n initFrequencyQuality(i);\n\n // affects the ammount of treble in a sound - treble knob - atenuates the sounds below the 3600 frequencies\n var lBand_player = context_player.createBiquadFilter();\n lBand_player.type = \"lowshelf\";\n lBand_player.frequency.value = bandSplit[1];\n lBand_player.gain.value = gainDb;\n\n // affects the ammount of bass in a sound - bass knob - atenuates the sounds higher than 360 frequencies\n var hBand_player = context_player.createBiquadFilter();\n hBand_player.type = \"highshelf\";\n hBand_player.frequency.value = bandSplit[0];\n hBand_player.gain.value = gainDb;\n\n var hInvert_player = context_player.createGain();\n hInvert_player.gain.value = -1.0;\n\n //Subtract low and high frequencies (add invert) from the source for the mid frequencies\n var mBand_player = context_player.createGain();\n\n //or use picking\n //mBand_player = context_player.createBiquadFilter();\n //mBand_player.type = \"peaking\";\n //mBand_player.frequency.value = bandSplit[0];\n //mBand_player.gain.value = gainDb;\n\n var lInvert_player = context_player.createGain();\n lInvert_player.gain.value = -1.0;\n\n sourceNode_player[i].connect(lBand_player);\n sourceNode_player[i].connect(mBand_player);\n sourceNode_player[i].connect(hBand_player);\n\n hBand_player.connect(hInvert_player);\n lBand_player.connect(lInvert_player);\n\n hInvert_player.connect(mBand_player);\n lInvert_player.connect(mBand_player);\n\n\n lGain_player[i] = context_player.createGain();\n mGain_player[i] = context_player.createGain();\n hGain_player[i] = context_player.createGain();\n\n lBand_player.connect(lGain_player[i]);\n mBand_player.connect(mGain_player[i]);\n hBand_player.connect(hGain_player[i]);\n\n sum_player[i] = context_player.createGain();\n lGain_player[i].connect(sum_player[i]);\n mGain_player[i].connect(sum_player[i]);\n hGain_player[i].connect(sum_player[i]);\n\n lGain_player[i].gain.value = 1;\n mGain_player[i].gain.value = 1;\n hGain_player[i].gain.value = 1;\n\n volumeNodes[i] = context_player.createGain();\n sum_player[i].connect(volumeNodes[i]);\n volumeNodes[i].connect(context_player.destination);\n }\n\n //set volume\n var x = 50 / 100;\n // Use an equal-power crossfading curve:\n var gain1 = Math.cos(x * 0.5 * Math.PI);\n var gain2 = Math.cos((1.0 - x) * 0.5 * Math.PI);\n volumeNodes[0].gain.value = gain1;\n volumeNodes[1].gain.value = gain2;\n\n //create audio Recording node\n audioRecordNode = context_player.createGain();\n volumeNodes[0].connect(audioRecordNode);\n volumeNodes[1].connect(audioRecordNode);\n audioRecorder = new Recorder(audioRecordNode);\n}","function sha1_ft(t, b, c, d) {\n if (t < 20) return (b & c) | ((~b) & d);\n if (t < 40) return b ^ c ^ d;\n if (t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function adapt(delta,numPoints,firstTime){var k=0;delta=firstTime?floor(delta/damp):delta>>1;delta+=floor(delta/numPoints);for(;delta>baseMinusTMin*tMax>>1;k+=base){delta=floor(delta/baseMinusTMin)}return floor(k+(baseMinusTMin+1)*delta/(delta+skew))}","function setupAudioNodes(audioContext, drawWaveformFunction, drawSpectrumFunction, drawSpectrogramFunction, htmlIds, colorScale)\n{\n // Setup a script node\n let scriptNode = audioContext.createScriptProcessor();\n // Connect to destination\n scriptNode.connect(audioContext.destination);\n \n // Setup an analyzer\n let analyser = audioContext.createAnalyser();\n analyser.smoothingTimeConstant = 0;\n // Higher FFT size means more bins. More bins mean more points to graph.\n // Also means each bin has a smaller range of frequencies so it's kind of like more precise.\n analyser.fftSize = 2048 * 2;\n \n // Create a buffer source node\n let sourceNode = audioContext.createBufferSource();\n sourceNode.connect(analyser);\n analyser.connect(scriptNode);\n \n sourceNode.connect(audioContext.destination);\n \n console.log(\"Sample rate: \" + audioContext.sampleRate + \" Hz\");\n console.log(\"FFT size: \" + analyser.fftSize);\n // FrequencyBinCount is half of FFT size\n console.log(\"FrequencyBinCount: \" + analyser.frequencyBinCount);\n \n let frequencyPerBin = (audioContext.sampleRate / 2) / analyser.frequencyBinCount;\n console.log(\"Each frequency bin represents \" + frequencyPerBin + \" Hz of range\");\n console.log(\"frequencyData[0]\" + \" is the strength of frequencies from \" + (0 * frequencyPerBin) + \" Hz to \" + ((0 + 1)*frequencyPerBin) + \" Hz\");\n console.log(\"frequencyData[1]\" + \" is the strength of frequencies from \" + (1 * frequencyPerBin) + \" Hz to \" + ((1 + 1)*frequencyPerBin) + \" Hz\");\n console.log(\"frequencyData[2]\" + \" is the strength of frequencies from \" + (2 * frequencyPerBin) + \" Hz to \" + ((2 + 1)*frequencyPerBin) + \" Hz\");\n console.log(\"frequencyData[\" + (analyser.frequencyBinCount - 1) + \"]\" + \" is the strength of frequencies from \" + (analyser.frequencyBinCount - 1) * frequencyPerBin + \" Hz to \" + (((analyser.frequencyBinCount - 1) + 1) * frequencyPerBin) + \" Hz\");\n \n // When the script node is called we use information from the analyzer node to draw\n scriptNode.onaudioprocess = function()\n {\n let frequencyData = new Uint8Array(analyser.frequencyBinCount);\n analyser.getByteFrequencyData(frequencyData);\n \n let timeDomainData = new Uint8Array(analyser.frequencyBinCount);\n analyser.getByteTimeDomainData(timeDomainData);\n \n if (sourceNode.buffer !== null)\n {\n //console.log(frequencyData);\n //console.log(timeDomainData);\n drawWaveformFunction(timeDomainData, htmlIds.waveformCanvas, colorScale);\n drawSpectrumFunction(frequencyData, htmlIds.spectrumCanvas, colorScale);\n drawSpectrogramFunction(frequencyData, htmlIds.spectrogramCanvas, colorScale);\n }\n }\n \n return sourceNode;\n}","function draw(data)\n{\n var spectrum = []; // an array that will hold noise cancelled data\n var i, x, L=0, ldata=0, nBins=0, binNum=0, c=0; // uint8\n var minLvl, maxLvl; //uint\n var level, y, sum; //int\n var offsetIndex = 0;\n var FFT_N = 128; //data.length;\n\n samplePos = 0;\n // Remove noise and apply EQ levels\n for(x=0; x < FFT_N/2; x++ ) {\n L = noise[x];\n spectrum[x] = data[x+ offsetIndex];\n if ( spectrum[x] < L ) {\n spectrum[x] = 0;\n } else {\n spectrum[x] = ((spectrum[x] - L) * (256 - eq[x] >> peakHeight));\n }\n }\n //fill colors first, then we will erase idle sections.\n for(i=0; i < totalColumns; i++) {\n client.setPixelColor(i, LED_RED); // row 0, RED\n client.setPixelColor(8 + i, LED_BLUE); // Rwo 1, Blue\n client.setPixelColor(16+ i, LED_BLUE); // Row 2, Blue\n client.setPixelColor(24+ i, LED_GREEN); // Row 3, Green\n client.setPixelColor(32+ i, LED_GREEN); // Row 4, Green\n }\n\n for(x=0; x < totalColumns; x++ ) {\n ldata = colData[x];\n nBins = ldata[0] + 2;\n binNum = ldata[1];\n for(sum=0, i=2; i < nBins; i++ ) {\n sum += spectrum[binNum++] * ldata[i]; // Weighted\n colDiv[x] += data[x];\n }\n col[x][colCount] = sum / colDiv[x]; // Average\n minLvl = maxLvl = col[x][0];\n for(i=1; i < totalFrames; i++ ) {\n if(col[x][i] < minLvl) {\n minLvl = col[x][i];\n } else if( col[x][i] > maxLvl ) {\n maxLvl = col[x][i];\n }\n }\n // minLvl and maxLvl indicate the extents of the FFT output, used\n // for vertically scaling the output graph (so it looks interesting\n // regardless of volume level). If they're too close together though\n // (e.g. at very low volume levels) the graph becomes super coarse\n // and 'jumpy'...so keep some minimum distance between them (this\n // also lets the graph go to zero when no sound is playing):\n\n if( maxLvl-minLvl < peakHeight) {\n maxLvl = minLvl + peakHeight;\n }\n minLvAvg[x] = (minLvAvg[x] * 7 + minLvl) >> 3; // Dampen min/max levels\n maxLvAvg[x] = (maxLvAvg[x] * 7 + maxLvl) >> 3; // fake rolling average\n // Second fixed-point scale based on dynamic min/max levels\n level = 10 * (col[x][colCount] - minLvAvg[x]) / parseInt(maxLvAvg[x] - minLvAvg[x]);\n // clip output and convert to byte\n if( level < 0) { c = 0; }\n else if ( level > peakOffTop ) { c = peakOffTop; } // Allow dot to go a few pixels off the top\n else { c = parseInt(level); }\n\n if( c > peak[x] ) { peak[x] = c; } // keep dot on top\n if(peak[x] < 0 ) { // empty the column\n clearColumnLeds(x,peakHeight);\n //continue;\n } else if(c < peakHeight ) { // empty partial column\n clearColumnLeds(x, peakHeight - c);\n }\n // the peak dot color varies but doesn't necessarily match\n // the three screen regions.. yellow has a little more influence.\n y = peakHeight - peak[x];\n\n /******************** DO NOT DELETE **********************/\n /* Save this section for a high Peak Array of LEDs - It is not so useful for 5 pixel High\n if( y < 1 ) { setColumnRowPixelColor(x,y, LED_RED); }\n else if( y < 5 ) { setColumnRowPixelColor(x,y, LED_BLUE); }\n else { setColumnRowPixelColor(x,y, LED_GREEN); }\n */\n /******************** DO NOT DELETE **********************/\n\n }\n client.writePixels();\n\n /******************** Important **************************/\n // Every third frame, make the peak pixels drop by 1:\n if ( ++dotCount >= 3 ) {\n dotCount = 0;\n // reset Averages, col dividers and peaks\n for ( i = 0; i < totalColumns; i++ ) {\n minLvAvg[i] = 0;\n maxLvAvg[i] = 512;\n colDiv[i] = 0;\n //peak[i] = 0; // We are dropping the peaks below\n }\n for ( x = 0; x < peakHeight; x++ ) {\n peak[x] -= (peak[x] > 0) ? 1 : 0; // if peak is above 0, then subtract 1\n }\n // rotate hue over LEDs\n LED_RED = OPC.rotateColor(1, LED_RED);\n LED_BLUE = OPC.rotateColor(1, LED_BLUE);\n LED_GREEN = OPC.rotateColor(1, LED_GREEN);\n }\n // Adjust the Frame Count\n if ( ++colCount >= totalFrames ) {\n colCount = 0;\n }\n\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}"],"string":"[\n \"function FFTNayuki(n) {\\n \\n this.n = n;\\n this.levels = -1;\\n\\n for (var i = 0; i < 32; i++) {\\n if (1 << i == n) {\\n this.levels = i; // Equal to log2(n)\\n }\\n }\\n if (this.levels == -1) {\\n throw \\\"Length is not a power of 2\\\";\\n }\\n\\n this.cosTable = new Array(n / 2);\\n this.sinTable = new Array(n / 2);\\n for (var i = 0; i < n / 2; i++) {\\n this.cosTable[i] = Math.cos(2 * Math.PI * i / n);\\n this.sinTable[i] = Math.sin(2 * Math.PI * i / n);\\n }\\n\\n /* \\n * Computes the discrete Fourier transform (DFT) of the given complex vector, storing the result back into the vector.\\n * The vector's length must be equal to the size n that was passed to the object constructor, and this must be a power of 2. Uses the Cooley-Tukey decimation-in-time radix-2 algorithm.\\n */\\n this.forward = function(real, imag) {\\n\\n var n = this.n;\\n \\n // Bit-reversed addressing permutation\\n for (var i = 0; i < n; i++) {\\n var j = reverseBits(i, this.levels);\\n if (j > i) {\\n var temp = real[i];\\n real[i] = real[j];\\n real[j] = temp;\\n temp = imag[i];\\n imag[i] = imag[j];\\n imag[j] = temp;\\n }\\n }\\n \\n // Cooley-Tukey decimation-in-time radix-2 FFT\\n for (var size = 2; size <= n; size *= 2) {\\n var halfsize = size / 2;\\n var tablestep = n / size;\\n for (var i = 0; i < n; i += size) {\\n for (var j = i, k = 0; j < i + halfsize; j++, k += tablestep) {\\n var tpre = real[j+halfsize] * this.cosTable[k] +\\n imag[j+halfsize] * this.sinTable[k];\\n var tpim = -real[j+halfsize] * this.sinTable[k] +\\n imag[j+halfsize] * this.cosTable[k];\\n real[j + halfsize] = real[j] - tpre;\\n imag[j + halfsize] = imag[j] - tpim;\\n real[j] += tpre;\\n imag[j] += tpim;\\n }\\n }\\n }\\n \\n // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\\n function reverseBits(x, bits) {\\n var y = 0;\\n for (var i = 0; i < bits; i++) {\\n y = (y << 1) | (x & 1);\\n x >>>= 1;\\n }\\n return y;\\n }\\n }\\n\\n /* \\n * Computes the inverse discrete Fourier transform (IDFT) of the given complex vector, storing the result back into the vector.\\n * The vector's length must be equal to the size n that was passed to the object constructor, and this must be a power of 2. This is a wrapper function. This transform does not perform scaling, so the inverse is not a true inverse.\\n */\\n this.inverse = function(real, imag) {\\n forward(imag, real);\\n }\\n}\",\n \"function realFft(input, output) {\\n\\n var n = input.length,\\n x = output, \\n TWO_PI = 2*Math.PI,\\n sqrt = Math.sqrt,\\n n2, n4, n8, nn, \\n t1, t2, t3, t4, \\n i1, i2, i3, i4, i5, i6, i7, i8, \\n st1, cc1, ss1, cc3, ss3,\\n e, \\n a,\\n rval, ival, mag; \\n\\n _reverseBinPermute(output, input);\\n\\n for (var ix = 0, id = 4; ix < n; id *= 4) {\\n for (var i0 = ix; i0 < n; i0 += id) {\\n //sumdiff(x[i0], x[i0+1]); // {a, b} <--| {a+b, a-b}\\n st1 = x[i0] - x[i0+1];\\n x[i0] += x[i0+1];\\n x[i0+1] = st1;\\n } \\n ix = 2*(id-1);\\n }\\n\\n n2 = 2;\\n nn = n >>> 1;\\n\\n while((nn = nn >>> 1)) {\\n ix = 0;\\n n2 = n2 << 1;\\n id = n2 << 1;\\n n4 = n2 >>> 2;\\n n8 = n2 >>> 3;\\n do {\\n if(n4 !== 1) {\\n for(i0 = ix; i0 < n; i0 += id) {\\n i1 = i0;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n \\n //diffsum3_r(x[i3], x[i4], t1); // {a, b, s} <--| {a, b-a, a+b}\\n t1 = x[i3] + x[i4];\\n x[i4] -= x[i3];\\n //sumdiff3(x[i1], t1, x[i3]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i3] = x[i1] - t1; \\n x[i1] += t1;\\n \\n i1 += n8;\\n i2 += n8;\\n i3 += n8;\\n i4 += n8;\\n \\n //sumdiff(x[i3], x[i4], t1, t2); // {s, d} <--| {a+b, a-b}\\n t1 = x[i3] + x[i4];\\n t2 = x[i3] - x[i4];\\n \\n t1 = -t1 * Math.SQRT1_2;\\n t2 *= Math.SQRT1_2;\\n \\n // sumdiff(t1, x[i2], x[i4], x[i3]); // {s, d} <--| {a+b, a-b}\\n st1 = x[i2];\\n x[i4] = t1 + st1; \\n x[i3] = t1 - st1;\\n \\n //sumdiff3(x[i1], t2, x[i2]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i2] = x[i1] - t2;\\n x[i1] += t2;\\n }\\n } else {\\n for(i0 = ix; i0 < n; i0 += id) {\\n i1 = i0;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n \\n //diffsum3_r(x[i3], x[i4], t1); // {a, b, s} <--| {a, b-a, a+b}\\n t1 = x[i3] + x[i4]; \\n x[i4] -= x[i3];\\n \\n //sumdiff3(x[i1], t1, x[i3]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i3] = x[i1] - t1; \\n x[i1] += t1;\\n }\\n }\\n \\n ix = (id << 1) - n2;\\n id = id << 2;\\n } while (ix < n);\\n \\n e = TWO_PI / n2;\\n\\n for (var j = 1; j < n8; j++) {\\n a = j * e;\\n ss1 = Math.sin(a);\\n cc1 = Math.cos(a);\\n\\n //ss3 = sin(3*a); cc3 = cos(3*a);\\n cc3 = 4*cc1*(cc1*cc1-0.75);\\n ss3 = 4*ss1*(0.75-ss1*ss1);\\n \\n ix = 0; id = n2 << 1;\\n do {\\n for (i0 = ix; i0 < n; i0 += id) {\\n i1 = i0 + j;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n \\n i5 = i0 + n4 - j;\\n i6 = i5 + n4;\\n i7 = i6 + n4;\\n i8 = i7 + n4;\\n \\n //cmult(c, s, x, y, &u, &v)\\n //cmult(cc1, ss1, x[i7], x[i3], t2, t1); // {u,v} <--| {x*c-y*s, x*s+y*c}\\n t2 = x[i7]*cc1 - x[i3]*ss1; \\n t1 = x[i7]*ss1 + x[i3]*cc1;\\n \\n //cmult(cc3, ss3, x[i8], x[i4], t4, t3);\\n t4 = x[i8]*cc3 - x[i4]*ss3; \\n t3 = x[i8]*ss3 + x[i4]*cc3;\\n \\n //sumdiff(t2, t4); // {a, b} <--| {a+b, a-b}\\n st1 = t2 - t4;\\n t2 += t4;\\n t4 = st1;\\n \\n //sumdiff(t2, x[i6], x[i8], x[i3]); // {s, d} <--| {a+b, a-b}\\n //st1 = x[i6]; x[i8] = t2 + st1; x[i3] = t2 - st1;\\n x[i8] = t2 + x[i6]; \\n x[i3] = t2 - x[i6];\\n \\n //sumdiff_r(t1, t3); // {a, b} <--| {a+b, b-a}\\n st1 = t3 - t1;\\n t1 += t3;\\n t3 = st1;\\n \\n //sumdiff(t3, x[i2], x[i4], x[i7]); // {s, d} <--| {a+b, a-b}\\n //st1 = x[i2]; x[i4] = t3 + st1; x[i7] = t3 - st1;\\n x[i4] = t3 + x[i2]; \\n x[i7] = t3 - x[i2];\\n \\n //sumdiff3(x[i1], t1, x[i6]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i6] = x[i1] - t1; \\n x[i1] += t1;\\n \\n //diffsum3_r(t4, x[i5], x[i2]); // {a, b, s} <--| {a, b-a, a+b}\\n x[i2] = t4 + x[i5]; \\n x[i5] -= t4;\\n }\\n \\n ix = (id << 1) - n2;\\n id = id << 2;\\n \\n } while (ix < n);\\n }\\n }\\n \\n /* Scale output to have same norm as input. */\\n var f = 1 / sqrt(n);\\n for (var i = 0; i < n; i++)\\n\\t x[i] *= f;\\n\\n}\",\n \"function FFT$1(){var _n=0,// order\\n_bitrev=null,// bit reversal table\\n_cstb=null;// sin/cos table\\nvar _tre,_tim;this.init=function(n){if(n!==0&&(n&n-1)===0){_n=n;_setVariables();_makeBitReversal();_makeCosSinTable();}else{throw new Error('init: radix-2 required');}};// 1D-FFT\\nthis.fft1d=function(re,im){fft(re,im,1);};// 1D-IFFT\\nthis.ifft1d=function(re,im){var n=1/_n;fft(re,im,-1);for(var i=0;i<_n;i++){re[i]*=n;im[i]*=n;}};// 2D-FFT\\nthis.fft2d=function(re,im){var i=0;// x-axis\\nfor(var y=0;y<_n;y++){i=y*_n;for(var x1=0;x1<_n;x1++){_tre[x1]=re[x1+i];_tim[x1]=im[x1+i];}this.fft1d(_tre,_tim);for(var x2=0;x2<_n;x2++){re[x2+i]=_tre[x2];im[x2+i]=_tim[x2];}}// y-axis\\nfor(var x=0;x<_n;x++){for(var y1=0;y1<_n;y1++){i=x+y1*_n;_tre[y1]=re[i];_tim[y1]=im[i];}this.fft1d(_tre,_tim);for(var y2=0;y2<_n;y2++){i=x+y2*_n;re[i]=_tre[y2];im[i]=_tim[y2];}}};// 2D-IFFT\\nthis.ifft2d=function(re,im){var i=0;// x-axis\\nfor(var y=0;y<_n;y++){i=y*_n;for(var x1=0;x1<_n;x1++){_tre[x1]=re[x1+i];_tim[x1]=im[x1+i];}this.ifft1d(_tre,_tim);for(var x2=0;x2<_n;x2++){re[x2+i]=_tre[x2];im[x2+i]=_tim[x2];}}// y-axis\\nfor(var x=0;x<_n;x++){for(var y1=0;y1<_n;y1++){i=x+y1*_n;_tre[y1]=re[i];_tim[y1]=im[i];}this.ifft1d(_tre,_tim);for(var y2=0;y2<_n;y2++){i=x+y2*_n;re[i]=_tre[y2];im[i]=_tim[y2];}}};// 2D-IFFT, real-valued\\n// only outputs the real valued part\\nthis.real_ifft2d=function(re,im){var i2;var i=0;// x-axis\\nfor(var y=0;y<_n;y++){i=y*_n;for(var x1=0;x1<_n;x1++){_tre[x1]=re[x1+i];_tim[x1]=im[x1+i];}this.ifft1d(_tre,_tim);for(var x2=0;x2<_n;x2++){re[x2+i]=_tre[x2];im[x2+i]=_tim[x2];}}// y-axis\\nvar halfn=_n/2;var rowIdx=0;for(var x=0;x<_n;x+=2){//untangle\\ni=x;i2=x+1;_tre[0]=re[0+i];_tim[0]=re[0+i2];_tre[_n/2]=re[halfn*_n+i];_tim[_n/2]=re[halfn*_n+i2];for(var x2=1;x2>2;// bit reversal\\nfor(var l=0;l<_n;l++){m=_bitrev[l];if(l>1;while(k<=j){j-=k;k>>=1;}j+=k;_bitrev[i]=j;}}// make trigonometric function table\\nfunction _makeCosSinTable(){var n2=_n>>1,n4=_n>>2,n8=_n>>3,n2p4=n2+n4,t=Math.sin(Math.PI/_n),dc=2*t*t,ds=Math.sqrt(dc*(2-dc)),c=_cstb[n4]=1,s=_cstb[0]=0;t=2*dc;for(var i=1;i>2;// bit reversal\\nfor(var l=0;l<_n;l++){m=_bitrev[l];if(l>1;while(k<=j){j-=k;k>>=1;}j+=k;_bitrev[i]=j;}}// make trigonometric function table\\nfunction _makeCosSinTable(){var n2=_n>>1,n4=_n>>2,n8=_n>>3,n2p4=n2+n4,t=Math.sin(Math.PI/_n),dc=2*t*t,ds=Math.sqrt(dc*(2-dc)),c=_cstb[n4]=1,s=_cstb[0]=0;t=2*dc;for(var i=1;i>2;// bit reversal\\nfor(var l=0;l<_n;l++){m=_bitrev[l];if(l>2;// bit reversal\\nfor(var l=0;l<_n;l++){m=_bitrev[l];if(l> 1;\\n j = 0;\\n for(i=0;i>= 1\\n }\\n j += k\\n }\\n \\n // Compute the FFT\\n c1 = -1.0\\n c2 = 0.0\\n l2 = 1\\n for(l=0;l>> 1,\\n bSi = 2 / n,\\n n2, n4, n8, nn,\\n t1, t2, t3, t4,\\n i1, i2, i3, i4, i5, i6, i7, i8,\\n st1, cc1, ss1, cc3, ss3,\\n e,\\n a,\\n rval, ival, mag;\\n\\n this.reverseBinPermute(x, buffer);\\n\\n for (var ix = 0, id = 4; ix < n; id *= 4) {\\n for (var i0 = ix; i0 < n; i0 += id) {\\n //sumdiff(x[i0], x[i0+1]); // {a, b} <--| {a+b, a-b}\\n st1 = x[i0] - x[i0 + 1];\\n x[i0] += x[i0 + 1];\\n x[i0 + 1] = st1;\\n }\\n ix = 2 * (id - 1);\\n }\\n\\n n2 = 2;\\n nn = n >>> 1;\\n\\n while ((nn = nn >>> 1)) {\\n ix = 0;\\n n2 = n2 << 1;\\n id = n2 << 1;\\n n4 = n2 >>> 2;\\n n8 = n2 >>> 3;\\n do {\\n if (n4 !== 1) {\\n for (i0 = ix; i0 < n; i0 += id) {\\n i1 = i0;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n\\n //diffsum3_r(x[i3], x[i4], t1); // {a, b, s} <--| {a, b-a, a+b}\\n t1 = x[i3] + x[i4];\\n x[i4] -= x[i3];\\n //sumdiff3(x[i1], t1, x[i3]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i3] = x[i1] - t1;\\n x[i1] += t1;\\n\\n i1 += n8;\\n i2 += n8;\\n i3 += n8;\\n i4 += n8;\\n\\n //sumdiff(x[i3], x[i4], t1, t2); // {s, d} <--| {a+b, a-b}\\n t1 = x[i3] + x[i4];\\n t2 = x[i3] - x[i4];\\n\\n t1 = -t1 * Math.SQRT1_2;\\n t2 *= Math.SQRT1_2;\\n\\n // sumdiff(t1, x[i2], x[i4], x[i3]); // {s, d} <--| {a+b, a-b}\\n st1 = x[i2];\\n x[i4] = t1 + st1;\\n x[i3] = t1 - st1;\\n\\n //sumdiff3(x[i1], t2, x[i2]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i2] = x[i1] - t2;\\n x[i1] += t2;\\n }\\n } else {\\n for (i0 = ix; i0 < n; i0 += id) {\\n i1 = i0;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n\\n //diffsum3_r(x[i3], x[i4], t1); // {a, b, s} <--| {a, b-a, a+b}\\n t1 = x[i3] + x[i4];\\n x[i4] -= x[i3];\\n\\n //sumdiff3(x[i1], t1, x[i3]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i3] = x[i1] - t1;\\n x[i1] += t1;\\n }\\n }\\n\\n ix = (id << 1) - n2;\\n id = id << 2;\\n } while (ix < n);\\n\\n e = TWO_PI / n2;\\n\\n for (var j = 1; j < n8; j++) {\\n a = j * e;\\n ss1 = Math.sin(a);\\n cc1 = Math.cos(a);\\n\\n //ss3 = sin(3*a); cc3 = cos(3*a);\\n cc3 = 4 * cc1 * (cc1 * cc1 - 0.75);\\n ss3 = 4 * ss1 * (0.75 - ss1 * ss1);\\n\\n ix = 0; id = n2 << 1;\\n do {\\n for (i0 = ix; i0 < n; i0 += id) {\\n i1 = i0 + j;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n\\n i5 = i0 + n4 - j;\\n i6 = i5 + n4;\\n i7 = i6 + n4;\\n i8 = i7 + n4;\\n\\n //cmult(c, s, x, y, &u, &v)\\n //cmult(cc1, ss1, x[i7], x[i3], t2, t1); // {u,v} <--| {x*c-y*s, x*s+y*c}\\n t2 = x[i7] * cc1 - x[i3] * ss1;\\n t1 = x[i7] * ss1 + x[i3] * cc1;\\n\\n //cmult(cc3, ss3, x[i8], x[i4], t4, t3);\\n t4 = x[i8] * cc3 - x[i4] * ss3;\\n t3 = x[i8] * ss3 + x[i4] * cc3;\\n\\n //sumdiff(t2, t4); // {a, b} <--| {a+b, a-b}\\n st1 = t2 - t4;\\n t2 += t4;\\n t4 = st1;\\n\\n //sumdiff(t2, x[i6], x[i8], x[i3]); // {s, d} <--| {a+b, a-b}\\n //st1 = x[i6]; x[i8] = t2 + st1; x[i3] = t2 - st1;\\n x[i8] = t2 + x[i6];\\n x[i3] = t2 - x[i6];\\n\\n //sumdiff_r(t1, t3); // {a, b} <--| {a+b, b-a}\\n st1 = t3 - t1;\\n t1 += t3;\\n t3 = st1;\\n\\n //sumdiff(t3, x[i2], x[i4], x[i7]); // {s, d} <--| {a+b, a-b}\\n //st1 = x[i2]; x[i4] = t3 + st1; x[i7] = t3 - st1;\\n x[i4] = t3 + x[i2];\\n x[i7] = t3 - x[i2];\\n\\n //sumdiff3(x[i1], t1, x[i6]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i6] = x[i1] - t1;\\n x[i1] += t1;\\n\\n //diffsum3_r(t4, x[i5], x[i2]); // {a, b, s} <--| {a, b-a, a+b}\\n x[i2] = t4 + x[i5];\\n x[i5] -= t4;\\n }\\n\\n ix = (id << 1) - n2;\\n id = id << 2;\\n\\n } while (ix < n);\\n }\\n }\\n\\n while (--i) {\\n rval = x[i];\\n ival = x[n - i - 1];\\n mag = bSi * sqrt(rval * rval + ival * ival);\\n\\n if (mag > this.peak) {\\n this.peakBand = i;\\n this.peak = mag;\\n }\\n\\n spectrum[i] = mag;\\n }\\n\\n spectrum[0] = bSi * x[0];\\n\\n return spectrum;\\n }\",\n \"function fftBluestein(dir, nrows, ncols, buffer, x_ptr, y_ptr, scratch_ptr) {\\n dir |= 0\\n nrows |= 0\\n ncols |= 0\\n x_ptr |= 0\\n y_ptr |= 0\\n scratch_ptr |= 0\\n\\n // Initialize tables\\n var m = bits.nextPow2(2 * ncols + 1)\\n , cos_ptr = scratch_ptr\\n , sin_ptr = cos_ptr + ncols\\n , xs_ptr = sin_ptr + ncols\\n , ys_ptr = xs_ptr + m\\n , cft_ptr = ys_ptr + m\\n , sft_ptr = cft_ptr + m\\n , w = -dir * Math.PI / ncols\\n , row, a, b, c, d, k1, k2, k3\\n , i\\n for(i=0; i maxBLOOM) newbloom = maxBLOOM;\\n //POST.CHANGEBLOON(newbloom);\\n LASTBLOON = window.POST.CHANGEBLOON(newbloom);\\n ckeckBPM(freq);\\n}\",\n \"function Poll_FFT_MONOTONE()\\r\\n{\\r\\n //44100 / 1024 = 43,06 Hz saltos 21,533203125 Hz\\r\\n try\\r\\n {\\r\\n let spectrum = gb_fft.analyze();\\r\\n let row= -1;\\r\\n let col= -1; \\r\\n \\r\\n if (gb_use_ntsc_arduino) //63.55 microsegundos\\r\\n {\\r\\n //Para belial\\r\\n if (spectrum[32] > 230){row = 0;}\\r\\n else{\\r\\n if (spectrum[35] > 230){row = 1;} //4 770 /21,533203125 = 35,75873015873015873015873015873\\r\\n else{\\r\\n if (spectrum[39] > 230){row = 2;}\\r\\n else{\\r\\n if (spectrum[18] > 230){row = 3;} //* 393,3910306845 /21,533203125 = 18,269043783262040816326530612245\\r\\n\\t }\\r\\n }\\r\\n } \\r\\n \\r\\n if (spectrum[14] > 230){col = 0;} //2 302,60848514192 /21,533203125 = 14\\r\\n else{ \\r\\n if (spectrum[62] > 230){col = 1;}\\r\\n else{ \\r\\n \\t if (spectrum[26] > 230){col = 2;} //# 561,98718669215 /21,533203125 = 26,09863397608896145124716553288\\r\\n else{\\r\\n if (spectrum[76] > 230){col = 3;}\\r\\n \\t }\\r\\n }\\r\\n } \\t \\r\\n }\\r\\n else\\r\\n {\\r\\n //if (spectrum[31] > 250){row = 0;}\\r\\n if (spectrum[32] > 230){row = 0;}\\r\\n else{\\r\\n if (spectrum[35] > 230){row = 1;}\\r\\n else{\\r\\n if (spectrum[39] > 230){row = 2;}\\r\\n else{\\r\\n if (spectrum[43] > 230){row = 3;}\\r\\n\\t }\\r\\n }\\r\\n }\\r\\n \\r\\n //if (spectrum[55] > 250){col = 0;}\\r\\n if (spectrum[56] > 230){col = 0;}\\r\\n else{\\r\\n //if (spectrum[61] > 250){col = 1;}\\r\\n if (spectrum[62] > 230){col = 1;}\\r\\n else{\\r\\n //if (spectrum[67] > 250){col = 2;}\\r\\n\\t if (spectrum[68] > 230){col = 2;}\\r\\n else{\\r\\n if (spectrum[76] > 230){col = 3;}\\r\\n\\t }\\r\\n }\\r\\n } \\t \\r\\n }\\r\\n\\r\\n \\r\\n //let cadLog = '67:'+spectrum[67].toString()+' 68:'+spectrum[68].toString()+' 69:'+spectrum[69].toString();\\r\\n //let cadLog = '31:'+spectrum[31].toString()+' 32:'+spectrum[32].toString()+' 33:'+spectrum[33].toString();\\r\\n //let cadLog = '61:'+spectrum[61].toString()+' 62:'+spectrum[62].toString()+' 63:'+spectrum[63].toString();\\r\\n //console.log (cadLog);\\r\\n \\t\\t\\r\\n if ((row>-1)||(col>-1))\\r\\n { \\r\\n gb_fft_dtmf = RowColToMonotone(row,col);\\r\\n gb_cadDTMF = gb_fft_dtmf;\\r\\n if (gb_fft_dtmf_antes != gb_fft_dtmf)\\r\\n {\\t \\r\\n gb_fft_dtmf_antes = gb_fft_dtmf;\\t\\r\\n \\r\\n\\tcad_areaRX += gb_fft_dtmf;\\t\\r\\n\\tgb_buf_rcv_dtmf += gb_fft_dtmf;\\r\\n\\tgb_event_new_data_dtmf = true;\\r\\n\\t\\r\\n\\tif (gb_use_fast === true)\\r\\n\\t{ //Si es fast solo recibe un tono \\r\\n\\t gb_fft_dtmf_two_monotone += gb_fft_dtmf;\\r\\n\\t if (gb_fft_dtmf_two_monotone.length > 1)\\r\\n\\t {\\t \\t \\r\\n\\t gb_buf_rcv_dtmf = '#' + gb_fft_dtmf_two_monotone + '*';\\t \\r\\n\\t gb_fft_dtmf_two_monotone = '';\\t \\r\\n\\t }\\r\\n\\t gb_begin_sms = false; \\r\\n\\t gb_end_sms = true;\\r\\n\\t contIniAsteriscos = 1;\\t\\r\\n\\t}\\r\\n\\telse\\r\\n\\t{\\r\\n\\t switch (gb_fft_dtmf)\\r\\n\\t {\\r\\n\\t case '#':\\r\\n\\t gb_buf_rcv_dtmf = '#';\\r\\n\\t gb_begin_sms = true; \\r\\n\\t gb_end_sms = false;\\r\\n\\t //gb_begin_sync_dtmf= true;\\t \\r\\n\\t break;\\r\\n\\t case '*':\\t \\r\\n\\t contIniAsteriscos ++;\\r\\n\\t gb_begin_sms = false; \\r\\n\\t gb_end_sms = true;\\r\\n\\t break;\\r\\n\\t default:\\t \\r\\n\\t contIniAsteriscos = 0;\\t \\t \\r\\n\\t break;\\r\\n\\t }\\r\\n\\t}\\r\\n\\t\\t\\r\\n gb_forceDraw = true;\\r\\n }\\r\\n //playSoundTrack(gb_fft_dtmf);//Reproduce el Track\\r\\n }\\r\\n else\\r\\n {\\r\\n gb_fft_dtmf= gb_fft_dtmf_antes= '';\\r\\n } \\r\\n }\\r\\n catch(err)\\r\\n {\\r\\n DebugLog(err.message.toString());\\r\\n }\\r\\n}\",\n \"function fft(input) {\\n var\\n n = input.length,\\n nHalf,\\n even,\\n odd,\\n output = [],\\n wnkMultiplied,\\n wnk,\\n k,\\n r;\\n\\n if (n === 1) {\\n return input;\\n }\\n\\n // even and odd parts\\n even = fft(getListHalf(input, 0));\\n odd = fft(getListHalf(input, 1));\\n\\n // combine\\n output.length = n;\\n nHalf = n / 2;\\n for (k = 0; k < nHalf; k++) {\\n r = -2 * Math.PI * k / n;\\n wnk = getComplexFromRadians(r);\\n wnkMultiplied = complexMultiply(wnk, odd[k]);\\n output[k] = complexAdd(even[k], wnkMultiplied);\\n output[nHalf + k] = complexSubtract(even[k], wnkMultiplied);\\n }\\n\\n return output;\\n}\",\n \"function Poll_FFT_DTMF()\\r\\n{\\r\\n //44100 / 1024 = 43,06 Hz saltos 21,533203125 Hz\\r\\n try\\r\\n {\\r\\n if (gb_use_mic_dtmf === false)\\r\\n {\\r\\n return;\\r\\n }\\r\\n\\t \\r\\n let spectrum = gb_fft.analyze();\\r\\n let row= -1;\\r\\n let col= -1; \\r\\n \\r\\n //if (spectrum[31] > 250){row = 0;}\\r\\n if (spectrum[32] > 230){row = 0;}\\r\\n else{\\r\\n if (spectrum[35] > 230){row = 1;}\\r\\n else{\\r\\n if (spectrum[39] > 230){row = 2;}\\r\\n else{\\r\\n if (spectrum[43] > 230){row = 3;}\\r\\n\\t}\\r\\n }\\r\\n }\\r\\n \\r\\n //if (spectrum[55] > 250){col = 0;}\\r\\n if (spectrum[56] > 230){col = 0;}\\r\\n else{\\r\\n //if (spectrum[61] > 250){col = 1;}\\r\\n if (spectrum[62] > 230){col = 1;} \\r\\n else{\\r\\n //if (spectrum[67] > 250){col = 2;}\\r\\n\\tif (spectrum[68] > 230){col = 2;}\\r\\n else{\\r\\n if (spectrum[76] > 230){col = 3;}\\r\\n\\t}\\r\\n }\\r\\n }\\r\\n \\r\\n //console.log('55:'+spectrum[55].toString()+' 56:'+spectrum[56].toString()+' 57:'+spectrum[57].toString());\\r\\n \\t\\r\\n if ((row>-1) && (col>-1))\\r\\n { \\r\\n gb_fft_dtmf = RowColToDtmf(row,col);\\r\\n gb_cadDTMF = gb_fft_dtmf;\\r\\n if (gb_fft_dtmf_antes != gb_fft_dtmf){\\t\\r\\n gb_fft_dtmf_antes = gb_fft_dtmf;\\r\\n cad_areaRX += gb_fft_dtmf;\\t\\r\\n\\tgb_buf_rcv_dtmf += gb_fft_dtmf;\\r\\n\\tgb_event_new_data_dtmf = true;\\r\\n\\tif (gb_fft_dtmf === '#'){\\r\\n\\t gb_begin_sync_dtmf= true;\\r\\n }\\r\\n\\r\\n if (gb_use_fast === true)\\r\\n\\t{ //Si es fast solo recibe un tono\\r\\n\\t gb_buf_rcv_dtmf = '#' + DTMFStringToDoubleNumber(gb_fft_dtmf) + '*';\\t \\r\\n\\t gb_begin_sms = false; \\r\\n\\t gb_end_sms = true;\\r\\n\\t contIniAsteriscos = 1;\\r\\n\\t}\\r\\n\\telse\\r\\n\\t{\\r\\n\\t switch (gb_fft_dtmf)\\r\\n\\t {\\r\\n \\t case '#':\\r\\n\\t gb_buf_rcv_dtmf = '#';\\r\\n\\t gb_begin_sms = true; \\r\\n\\t gb_end_sms = false;\\r\\n\\t //gb_begin_sync_dtmf= true;\\t \\r\\n\\t break;\\r\\n\\t case '*':\\t \\r\\n\\t contIniAsteriscos ++;\\r\\n\\t gb_begin_sms = false; \\r\\n\\t gb_end_sms = true;\\r\\n\\t break;\\r\\n\\t default:\\t \\r\\n\\t contIniAsteriscos = 0;\\t \\t \\r\\n\\t break;\\r\\n\\t }\\t\\r\\n\\t}\\r\\n\\t\\r\\n\\t\\r\\n gb_forceDraw = true;\\r\\n } \\r\\n }\\r\\n else\\r\\n {\\r\\n gb_fft_dtmf= gb_fft_dtmf_antes= '';\\r\\n } \\r\\n }\\r\\n catch(err)\\r\\n {\\r\\n DebugLog(err.message.toString());\\r\\n }\\r\\n}\",\n \"function transformRadix2(real, imag) {\\n // Initialization\\n if (real.length != imag.length)\\n throw \\\"Mismatched lengths\\\";\\n var n = real.length;\\n if (n == 1)\\n // Trivial transform\\n return;\\n var levels = -1;\\n for (var i = 0; i < 32; i++) {\\n if (1 << i == n)\\n levels = i;\\n // Equal to log2(n)\\n }\\n if (levels == -1)\\n throw \\\"Length is not a power of 2\\\";\\n var cosTable = new Array(n / 2);\\n var sinTable = new Array(n / 2);\\n for (var i = 0; i < n / 2; i++) {\\n cosTable[i] = Math.cos(2 * Math.PI * i / n);\\n sinTable[i] = Math.sin(2 * Math.PI * i / n);\\n }\\n\\n // Bit-reversed addressing permutation\\n for (var i = 0; i < n; i++) {\\n var j = reverseBits(i, levels);\\n if (j > i) {\\n var temp = real[i];\\n real[i] = real[j];\\n real[j] = temp;\\n temp = imag[i];\\n imag[i] = imag[j];\\n imag[j] = temp;\\n }\\n }\\n\\n // Cooley-Tukey decimation-in-time radix-2 FFT\\n for (var size = 2; size <= n; size *= 2) {\\n var halfsize = size / 2;\\n var tablestep = n / size;\\n for (var i = 0; i < n; i += size) {\\n for (var j = i, k = 0; j < i + halfsize; j++,\\n k += tablestep) {\\n var tpre = real[j + halfsize] * cosTable[k] + imag[j + halfsize] * sinTable[k];\\n var tpim = -real[j + halfsize] * sinTable[k] + imag[j + halfsize] * cosTable[k];\\n real[j + halfsize] = real[j] - tpre;\\n imag[j + halfsize] = imag[j] - tpim;\\n real[j] += tpre;\\n imag[j] += tpim;\\n }\\n }\\n }\\n\\n // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\\n function reverseBits(x, bits) {\\n var y = 0;\\n for (var i = 0; i < bits; i++) {\\n y = (y << 1) | (x & 1);\\n x >>>= 1;\\n }\\n return y;\\n }\\n}\",\n \"function naiveDft(inreal, inimag, outreal, outimag, inverse) {\\n if (inreal.length != inimag.length || inreal.length != outreal.length || outreal.length != outimag.length)\\n throw \\\"Mismatched lengths\\\";\\n\\n var n = inreal.length;\\n var coef = (inverse ? 2 : -2) * Math.PI;\\n for (var k = 0; k < n; k++) { // For each output element\\n var sumreal = 0;\\n var sumimag = 0;\\n for (var t = 0; t < n; t++) { // For each input element\\n var angle = coef * (t * k % n) / n; // This is more accurate than t * k\\n sumreal += inreal[t]*Math.cos(angle) - inimag[t]*Math.sin(angle);\\n sumimag += inreal[t]*Math.sin(angle) + inimag[t]*Math.cos(angle);\\n }\\n outreal[k] = sumreal;\\n outimag[k] = sumimag;\\n }\\n \\n \\n // compute the average of the intervals of outreal array\\n // peak saves the time index of all peaks\\n var peak = [0];\\n for(i = 1; i < outreal.length-1; i++){\\n if(outreal[i] > outreal[i-1] && outreal[i] > outreal[i+1]){\\n peak.push(i);\\n }\\n }\\n // interval saves the interval of all values in peak\\n var interval = [];\\n for(i = 0; i < peak.length-1; i++){\\n interval.push(peak[i+1] - peak[i]);\\n }\\n // compute the mean value in interval array\\n var sum = 0;\\n for(i = 0; i < interval.length; i++){\\n sum += interval[i];\\n }\\n var mean = Number((sum/interval.length).toFixed(3));\\n // the scan rate is the inverse of mean interval\\n var scanrate = Number((1000/mean).toFixed(2)); \\n document.getElementById(\\\"scanrate\\\").innerHTML = \\\"
\\\" + scanrate + \\\"Hz\\\" \\n + \\\"
\\\" + \\\"It means your keyboard refreshes every \\\" + mean + \\\"ms\\\" \\n + \\\"
\\\" + \\\"The computing approach is to look in to the pressing time that your keyboard is able to recognize. More data lies around specific time points, the interval of them is right the refreshing period of your keyboard.\\\";\\n }\",\n \"function fftRadix2(realVals, imagVals, size, inverse, cpuBackend) {\\n if (size === 1) {\\n return { real: realVals, imag: imagVals };\\n }\\n const data = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].mergeRealAndImagArrays(realVals, imagVals);\\n const half = size / 2;\\n const evenComplex = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].complexWithEvenIndex(data);\\n const evenRealVals = evenComplex.real;\\n const evenImagVals = evenComplex.imag;\\n const evenShape = [evenRealVals.length];\\n const evenRealInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenRealVals);\\n const evenImagInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenImagVals);\\n const evenTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: evenRealInfo, imag: evenImagInfo }, backend: cpuBackend });\\n const oddComplex = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].complexWithOddIndex(data);\\n const oddRealVals = oddComplex.real;\\n const oddImagVals = oddComplex.imag;\\n const oddShape = [oddRealVals.length];\\n const oddRealInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddRealVals);\\n const oddImagInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddImagVals);\\n const oddTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: oddRealInfo, imag: oddImagInfo }, backend: cpuBackend });\\n // Recursive call for half part of original input.\\n const $evenComplex = fftRadix2(evenRealVals, evenImagVals, half, inverse, cpuBackend);\\n const $evenRealVals = $evenComplex.real;\\n const $evenImagVals = $evenComplex.imag;\\n const $evenShape = [$evenRealVals.length];\\n const $evenRealInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenRealVals);\\n const $evenImagInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenImagVals);\\n const $evenTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({\\n inputs: { real: $evenRealInfo, imag: $evenImagInfo },\\n backend: cpuBackend\\n });\\n const $oddComplex = fftRadix2(oddRealVals, oddImagVals, half, inverse, cpuBackend);\\n const $oddRealVals = $oddComplex.real;\\n const $oddImagVals = $oddComplex.imag;\\n const $oddShape = [$oddRealVals.length];\\n const $oddRealInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddRealVals);\\n const $oddImagInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddImagVals);\\n const $oddTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: $oddRealInfo, imag: $oddImagInfo }, backend: cpuBackend });\\n const e = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].exponents(size, inverse);\\n const eShape = [e.real.length];\\n const eRealInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.real);\\n const eImagInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.imag);\\n const complexInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: eRealInfo, imag: eImagInfo }, backend: cpuBackend });\\n const exponentInfo = Object(_kernels_Multiply__WEBPACK_IMPORTED_MODULE_6__[\\\"multiply\\\"])({ inputs: { a: complexInfo, b: $oddTensorInfo }, backend: cpuBackend });\\n const addPart = Object(_kernels_Add__WEBPACK_IMPORTED_MODULE_1__[\\\"add\\\"])({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const subPart = Object(_kernels_Sub__WEBPACK_IMPORTED_MODULE_10__[\\\"sub\\\"])({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const addPartReal = Object(_kernels_Real__WEBPACK_IMPORTED_MODULE_7__[\\\"real\\\"])({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartReal = Object(_kernels_Real__WEBPACK_IMPORTED_MODULE_7__[\\\"real\\\"])({ inputs: { input: subPart }, backend: cpuBackend });\\n const addPartImag = Object(_kernels_Imag__WEBPACK_IMPORTED_MODULE_5__[\\\"imag\\\"])({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartImag = Object(_kernels_Imag__WEBPACK_IMPORTED_MODULE_5__[\\\"imag\\\"])({ inputs: { input: subPart }, backend: cpuBackend });\\n const $real = Object(_kernels_Concat__WEBPACK_IMPORTED_MODULE_3__[\\\"concat\\\"])({\\n inputs: [addPartReal, subPartReal],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $imag = Object(_kernels_Concat__WEBPACK_IMPORTED_MODULE_3__[\\\"concat\\\"])({\\n inputs: [addPartImag, subPartImag],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $realVals = cpuBackend.data.get($real.dataId).values;\\n const $imagVals = cpuBackend.data.get($imag.dataId).values;\\n cpuBackend.disposeIntermediateTensorInfo(evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(complexInfo);\\n cpuBackend.disposeIntermediateTensorInfo(exponentInfo);\\n cpuBackend.disposeIntermediateTensorInfo(addPart);\\n cpuBackend.disposeIntermediateTensorInfo(subPart);\\n cpuBackend.disposeIntermediateTensorInfo(addPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(addPartImag);\\n cpuBackend.disposeIntermediateTensorInfo(subPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(subPartImag);\\n cpuBackend.disposeIntermediateTensorInfo($real);\\n cpuBackend.disposeIntermediateTensorInfo($imag);\\n return { real: $realVals, imag: $imagVals };\\n}\",\n \"function FFTDrawer(canvas, channel) {\\n var canvasContext = canvas.getContext('2d');\\n var curveColor = 'rgb(255,160,122)';\\n var binCount = FFT_SIZE / 2;\\n var data = new Float32Array(binCount);\\n\\n function drawCurve() {\\n var width = canvas.width;\\n var height = canvas.height;\\n var pixelsPerDb = height / 96.0;\\n\\n canvasContext.clearRect(0, 0, width, height);\\n\\n /* Get the proper analyzer from the audio graph */\\n var analyzer = (channel == 0) ? analyzer_left : analyzer_right;\\n if (!analyzer || !get_global('enable_fft')) {\\n requestAnimationFrame(drawCurve);\\n return;\\n }\\n\\n /* Draw decibel scale. */\\n for (var db = -96.0; db <= 0; db += 12) {\\n var y = height - (db + 96) * pixelsPerDb;\\n canvasContext.strokeStyle = curveColor;\\n canvasContext.strokeText(db.toFixed(0) + 'dB', 10, y);\\n }\\n\\n /* Draw FFT */\\n analyzer.getFloatFrequencyData(data);\\n canvasContext.beginPath();\\n canvasContext.lineWidth = 1;\\n canvasContext.strokeStyle = curveColor;\\n canvasContext.moveTo(0, height);\\n\\n var frequencyHz = new Float32Array(width);\\n for (var i = 0; i < binCount; ++i) {\\n var f = i / binCount;\\n\\n /* Convert to log frequency scale (octaves). */\\n var noctaves = 10;\\n f = 1 + Math.log(f) / (noctaves * Math.LN2);\\n\\n /* Draw the magnitude */\\n var x = f * width;\\n var y = height - (data[i] + 96) * pixelsPerDb;\\n\\n canvasContext.lineTo(x, y);\\n }\\n\\n canvasContext.stroke();\\n requestAnimationFrame(drawCurve);\\n }\\n\\n function init() {\\n requestAnimationFrame(drawCurve);\\n }\\n\\n this.init = init;\\n}\",\n \"function fft(x) {\\n return fftComplexDirection(x,false);\\n}\",\n \"function transformRadix2(real, imag) {\\n // Initialization\\n var i, j, k;\\n if (real.length !== imag.length)\\n throw \\\"Mismatched lengths\\\";\\n var n = real.length;\\n if (n === 1) // Trivial transform\\n return;\\n var levels = -1;\\n for (i = 0; i < 32; i++) {\\n if (1 << i === n)\\n levels = i; // Equal to log2(n)\\n }\\n if (levels === -1)\\n throw \\\"Length is not a power of 2\\\";\\n var cosTable = new Array(n / 2);\\n var sinTable = new Array(n / 2);\\n for (i = 0; i < n / 2; i++) {\\n cosTable[i] = Math.cos(2 * Math.PI * i / n);\\n sinTable[i] = Math.sin(2 * Math.PI * i / n);\\n }\\n\\n // Bit-reversed addressing permutation\\n for (i = 0; i < n; i++) {\\n j = reverseBits(i, levels);\\n if (j > i) {\\n var temp = real[i];\\n real[i] = real[j];\\n real[j] = temp;\\n temp = imag[i];\\n imag[i] = imag[j];\\n imag[j] = temp;\\n }\\n }\\n\\n // Cooley-Tukey decimation-in-time radix-2 FFT\\n for (var size = 2; size <= n; size *= 2) {\\n var halfsize = size / 2;\\n var tablestep = n / size;\\n for (i = 0; i < n; i += size) {\\n for (j = i, k = 0; j < i + halfsize; j++, k += tablestep) {\\n var tpre = real[j + halfsize] * cosTable[k] + imag[j + halfsize] * sinTable[k];\\n var tpim = -real[j + halfsize] * sinTable[k] + imag[j + halfsize] * cosTable[k];\\n real[j + halfsize] = real[j] - tpre;\\n imag[j + halfsize] = imag[j] - tpim;\\n real[j] += tpre;\\n imag[j] += tpim;\\n }\\n }\\n }\\n\\n // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\\n function reverseBits(x, bits) {\\n var y = 0;\\n for (var i = 0; i < bits; i++) {\\n y = (y << 1) | (x & 1);\\n x >>>= 1;\\n }\\n return y;\\n }\\n}\",\n \"function naiveDft(inreal, inimag, outreal, outimag, inverse) {\\n\\tconst n = inreal.length;\\n\\tif (n != inimag.length || n != outreal.length || n != outimag.length)\\n\\t\\tthrow new RangeError(\\\"Mismatched lengths\\\");\\n\\t\\n\\tconst coef = (inverse ? 2 : -2) * Math.PI;\\n\\tfor (let k = 0; k < n; k++) { // For each output element\\n\\t\\tlet sumreal = 0;\\n\\t\\tlet sumimag = 0;\\n\\t\\tfor (let t = 0; t < n; t++) { // For each input element\\n\\t\\t\\tconst angle = coef * (t * k % n) / n; // This is more accurate than t * k\\n\\t\\t\\tsumreal += inreal[t] * Math.cos(angle) - inimag[t] * Math.sin(angle);\\n\\t\\t\\tsumimag += inreal[t] * Math.sin(angle) + inimag[t] * Math.cos(angle);\\n\\t\\t}\\n\\t\\toutreal[k] = sumreal;\\n\\t\\toutimag[k] = sumimag;\\n\\t}\\n}\",\n \"_transform(chunk,encoding,cb) {\\n\\n const uint8_view = new Uint8Array(chunk, 0, chunk.length);\\n var dataView = new DataView(uint8_view.buffer);\\n\\n let iFloat = Array(this.sz*2);\\n let asComplex = Array(this.sz);\\n\\n\\n // for(let i = 0; i < this.sz*2; i+=1) {\\n // iFloat[i] = dataView.getFloat64(i*8, true);\\n // }\\n\\n for(let i = 0; i < this.sz*2; i+=2) {\\n let re = dataView.getFloat64(i*8, true);\\n let im = dataView.getFloat64((i*8)+8, true);\\n\\n asComplex[i/2] = mt.complex(re,im);\\n\\n iFloat[i] = re;\\n iFloat[i+1] = im;\\n\\n // if( i < 16 ) {\\n // console.log(re);\\n // }\\n\\n }\\n\\n let iShort = mutil.IFloatToIShortMulti(iFloat);\\n\\n if( this.onFrameIShort !== null ) {\\n this.onFrameIShort(iShort);\\n }\\n\\n // console.log(\\\"iFloat length \\\" + iFloat.length);\\n // console.log(iFloat.slice(0,16));\\n\\n // console.log(\\\"iShort length \\\" + iShort.length);\\n // console.log(iShort.slice(0,16));\\n\\n\\n this.handleDefaultStream(iFloat,iShort,asComplex);\\n this.handleFineSync(iFloat,iShort,asComplex);\\n this.handleAllSubcarriers(iFloat,iShort,asComplex);\\n this.handleDemodData(iFloat,iShort,asComplex);\\n\\n\\n // for(x of iFloat) {\\n // console.log(x);\\n // }\\n\\n\\n this.uint.frame_track_counter++;\\n cb();\\n }\",\n \"function PowerSpectrum( NumSamples, In, Out)\\n{\\n var Half = NumSamples / 2;\\n var i;\\n\\n var theta = Math.PI / Half;\\n\\n var tmpReal = new Float32Array(Half);\\n var tmpImag = new Float32Array(Half);\\n var RealOut = new Float32Array(Half);\\n var ImagOut = new Float32Array(Half);\\n\\n for (var i = 0; i < Half; i++) {\\n tmpReal[i] = In[2 * i];\\n tmpImag[i] = In[2 * i + 1];\\n }\\n\\n ACFFT(Half, 0, tmpReal, tmpImag, RealOut, ImagOut);\\n\\n var wtemp = (Math.sin(0.5 * theta));\\n\\n var wpr = -2.0 * wtemp * wtemp;\\n var wpi = -1.0 * (Math.sin(theta));\\n var wr = 1.0 + wpr;\\n var wi = wpi;\\n\\n var i3;\\n\\n var h1r, h1i, h2r, h2i, rt, it;\\n\\n for (var i = 1; i < Half / 2; i++) {\\n\\n i3 = Half - i;\\n\\n h1r = 0.5 * (RealOut[i] + RealOut[i3]);\\n h1i = 0.5 * (ImagOut[i] - ImagOut[i3]);\\n h2r = 0.5 * (ImagOut[i] + ImagOut[i3]);\\n h2i = -0.5 * (RealOut[i] - RealOut[i3]);\\n\\n rt = h1r + wr * h2r - wi * h2i;\\n it = h1i + wr * h2i + wi * h2r;\\n\\n Out[i] = rt * rt + it * it;\\n\\n rt = h1r - wr * h2r + wi * h2i;\\n it = -h1i + wr * h2i + wi * h2r;\\n\\n Out[i3] = rt * rt + it * it;\\n\\n wr = (wtemp = wr) * wpr - wi * wpi + wr;\\n wi = wi * wpr + wtemp * wpi + wi;\\n }\\n\\n rt = (h1r = RealOut[0]) + ImagOut[0];\\n it = h1r - ImagOut[0];\\n Out[0] = rt * rt + it * it;\\n\\n rt = RealOut[Half / 2];\\n it = ImagOut[Half / 2];\\n Out[Half / 2] = rt * rt + it * it;\\n}\",\n \"pow22523(z) {\\r\\n const t0 = new FieldElement();\\r\\n const t1 = new FieldElement();\\r\\n const t2 = new FieldElement();\\r\\n let i;\\r\\n t0.square(z);\\r\\n // for (i = 1; i < 1; i++) {\\r\\n // t0.square(t0);\\r\\n // }\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 2; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(z, t1);\\r\\n t0.mul(t0, t1);\\r\\n t0.square(t0);\\r\\n // for (i = 1; i < 1; i++) {\\r\\n // t0.square(t0);\\r\\n // }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 5; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 10; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(t1, t0);\\r\\n t2.square(t1);\\r\\n for (i = 1; i < 20; i++) {\\r\\n t2.square(t2);\\r\\n }\\r\\n t1.mul(t2, t1);\\r\\n t1.square(t1);\\r\\n for (i = 1; i < 10; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 50; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(t1, t0);\\r\\n t2.square(t1);\\r\\n for (i = 1; i < 100; i++) {\\r\\n t2.square(t2);\\r\\n }\\r\\n t1.mul(t2, t1);\\r\\n t1.square(t1);\\r\\n for (i = 1; i < 50; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t0.square(t0);\\r\\n for (i = 1; i < 2; i++) {\\r\\n t0.square(t0);\\r\\n }\\r\\n this.mul(t0, z);\\r\\n }\",\n \"function calculateNext(data){\\n \\n var AM, BM, TAU_M, AH, BH, TAU_H, AJ, BJ, TAU_J, axr1, bxr1, TAU_Xr1,\\n axr2, bxr2, TAU_Xr2, Axs, Bxs, TAU_Xs, TAU_R, TAU_S, Ad, Bd, Cd, TAU_D, \\n Af, Bf, Cf, TAU_F, Af2, Bf2, Cf2, TAU_F2, temp, temp2, Ak1, Bk1,\\n Ek, Ena, Eks, Eca, FCaSS_INF, exptaufcass, kCaSR, k1, k2, dRR,\\n CaCSQN, dCaSR, bjsr, cjsr, CaSSBuf, dCaSS, bcss, ccss, CaBuf, dCai, bc, cc,\\n dNai, dKi, sOO; \\n\\n var minft_t, exptaumt_t, hinft_t, exptauht_t, jinft_t, exptaujt_t, xr1inft_t,\\n exptauxr1t_t, xr2inft_t, exptauxr2t_t, xsinft_t, exptauxst_t, rinft_t , sinft_t,\\n exptaurt_t, exptaust_t, dinft_t, exptaudt_t, finft_t, exptauft_t, f2inft_t, \\n exptauf2t_t, inakcoefft_t, ipkcoefft_t, ical1t_t, ical2t_t, inaca1t_t, inaca2t_t,\\n ik1coefft_t, fcassinft_t, exptaufcasst_t; \\n\\n\\n sOO = ( cS[iType] === 'epi') ? 8.958e-8 : ( cS[iType] === 'endo' ) ? 8.848e-8 : 1.142e-7; // (cS.itype === 'M')\\n \\n\\n //table setup starts\\n AM = 1.0/(1.+ Math.exp((-60.-cS.v)/5.));\\n BM = 0.1/(1.+ Math.exp((cS.v+35.)/5.))+0.10/(1.+Math.exp((cS.v-50.)/200.));\\n minft_t = 1.0/((1.+Math.exp((-56.86-cS.v)/9.03))*(1.+Math.exp((-56.86-cS.v)/9.03)));\\n TAU_M = AM*BM;\\n exptaumt_t = Math.exp(-cS.timestep/TAU_M);\\n\\n hinft_t = 1.0/((1.+Math.exp((cS.v+71.55)/7.43))*(1.+Math.exp((cS.v+71.55)/7.43)));\\n \\n AH = (cS.v > -40) ? 0. : (0.057*Math.exp(-(cS.v+80.)/6.8));\\n BH = (cS.v > -40) ? (0.77/(0.13*(1.+Math.exp(-(cS.v+10.66)/11.1)))) \\n : (2.7*Math.exp(0.079*cS.v)+(3.1e5)*Math.exp(0.3485*cS.v));\\n TAU_H = 1.0/(AH+BH);\\n exptauht_t = Math.exp(-cS.timestep/TAU_H);\\n\\n AJ = (cS.v > -40) ? 0. : (((-2.5428e4)*Math.exp(0.2444*cS.v)-(6.948e-6)*Math.exp(-0.04391*cS.v))*(cS.v+37.78)/(1.+Math.exp(0.311*(cS.v+79.23))));\\n BJ = (cS.v > -40) ? (0.6*Math.exp((0.057)*cS.v)/(1.+Math.exp(-0.1*(cS.v+32.))))\\n : (0.02424*Math.exp(-0.01052*cS.v)/(1.+Math.exp(-0.1378*(cS.v+40.14))));\\n TAU_J = 1.0/(AJ+BJ);\\n exptaujt_t = Math.exp(-cS.timestep/TAU_J);\\n\\n jinft_t = hinft_t;\\n\\n xr1inft_t = 1.0/(1.+Math.exp((-26.-cS.v)/7.));\\n\\n axr1 = 450.0/(1.+Math.exp((-45.-cS.v)/10.));\\n bxr1 = 6.0/(1.+Math.exp((cS.v-(-30.))/11.5));\\n TAU_Xr1 = axr1*bxr1;\\n exptauxr1t_t = Math.exp(-cS.timestep/TAU_Xr1);\\n\\n\\n xr2inft_t = 1.0/(1.+Math.exp((cS.v-(-88.))/24.));\\n \\n axr2 = 3.0/(1.+Math.exp((-60.-cS.v)/20.));\\n bxr2 = 1.12/(1.+Math.exp((cS.v-60.)/20.));\\n TAU_Xr2 = axr2*bxr2;\\n exptauxr2t_t = Math.exp(-cS.timestep/TAU_Xr2);\\n\\n xsinft_t = 1.0/(1.+ Math.exp((-5.-cS.v)/14.));\\n\\n Axs = (1400.0/(Math.sqrt(1.+Math.exp((5.-cS.v)/6.))));\\n Bxs = (1.0/(1.+ Math.exp((cS.v-35.)/15.)));\\n TAU_Xs = Axs*Bxs+80.;\\n exptauxst_t = Math.exp(-cS.timestep/TAU_Xs);\\n\\n rinft_t = ( cS.itype === 'epi') ? 1.0/(1.+ Math.exp((20.- cS.v)/6.)) \\n : ( cS.itype === 'endo' ) ? 1.0/(1.+Math.exp((20.-cS.v)/6.))\\n : 1.0/(1.+ Math.exp((20.-cS.v)/6.)) ; // (cS.itype === 'M')\\n\\n sinft_t = ( cS.itype === 'epi') ? 1.0/(1.+Math.exp((cS.v+20.)/5.))\\n : ( cS.itype === 'endo' ) ? 1.0/(1.+ Math.exp((cS.v+28.)/5.))\\n : 1.0/(1.+ Math.exp((cS.v+20.)/5.)); // (cS.itype === 'M')\\n\\n TAU_R = ( cS.itype === 'epi') ? 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8\\n : ( cS.itype === 'endo' ) ? 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8\\n : 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8; // (cS.itype === 'M')\\n\\n TAU_S = ( cS.itype === 'epi') ? 85.* Math.exp(-(cS.v+45.)*(cS.v+45.)/320.) +5.0/(1.+Math.exp((cS.v-20.)/5.))+3. \\n : ( cS.itype === 'endo' ) ? 1000.*Math.exp(-(cS.v+67.)*(cS.v+67.)/1000.)+8.\\n : 85.*Math.exp(-(cS.v+45.)*(cS.v+45.)/320.)+5.0/(1.+Math.exp((cS.v-20.)/5.))+3.; // (cS.itype === 'M')\\n \\n exptaurt_t = Math.exp(-cS.timestep/TAU_R);\\n exptaust_t = Math.exp(-cS.timestep/TAU_S);\\n \\n dinft_t = 1.0/(1.+Math.exp((-8.-cS.v)/7.5));\\n \\n Ad = 1.4/(1.+Math.exp((-35.-cS.v)/13.))+0.25;\\n Bd = 1.4/(1.+Math.exp((cS.v+5.)/5.));\\n Cd = 1.0/(1.+Math.exp((50.-cS.v)/20.));\\n TAU_D = Ad*Bd+Cd;\\n exptaudt_t = Math.exp(-cS.timestep/TAU_D);\\n\\n finft_t = 1.0/(1.+Math.exp((cS.v+20.)/7.));\\n\\n Af = 1102.5*Math.exp(-(cS.v+27.)*(cS.v+27.)/225.);\\n Bf = 200.0/(1.+Math.exp((13.-cS.v)/10.));\\n Cf = (180.0/(1.+Math.exp((cS.v+30.)/10.)))+20.;\\n TAU_F = Af+Bf+Cf;\\n exptauft_t = Math.exp(-cS.timestep/TAU_F);\\n\\n f2inft_t = 0.67/(1.+Math.exp((cS.v+35.)/7.))+0.33;\\n\\n //original code had the following, but paper uses denom of 170**2, not 7**2\\n\\n Af2 = 600.*Math.exp(-(cS.v+25.)*(cS.v+25.)/49.);\\n\\n // paper value for Af2 is INCORRECT to match the figure\\n //Af2=600.*exp(-(vv+25.)*(vv+25.)/(170.*170.))\\n \\n Bf2 = 31.0/(1.+Math.exp((25.-cS.v)/10.));\\n Cf2 = 16.0/(1.+Math.exp((cS.v+30.)/10.));\\n TAU_F2 = Af2+Bf2+Cf2\\n exptauf2t_t = Math.exp(-cS.timestep/TAU_F2);\\n\\n inakcoefft_t = (1.0/(1.+0.1245*Math.exp(-0.1*cS.v*cC.fort)+0.0353*Math.exp(-cS.v*cC.fort)))*cS.knak*(cS.Ko/(cS.Ko+cS.KmK)); \\n ipkcoefft_t = cS.GpK/(1.+Math.exp((25.-cS.v)/5.98)); \\n temp = Math.exp(2*(cS.v-15)*cC.fort);\\n\\n if(!(Math.abs(cS.v-15.) < 1e-4)){\\n // need implemented\\n ical1t_t = cS.GCaL*4.*(cS.v-15.)*(cS.FF*cC.fort)* (0.25*temp)/(temp-1.);\\n ical2t_t = cS.GCaL*4.*(cS.v-15.)*(cS.FF*cC.fort)*cS.Cao/(temp-1.);\\n }\\n \\n temp = Math.exp((cS.n-1.)*cS.v*cC.fort);\\n temp2 = cS.knaca/((cC.KmNai3+cC.Nao3)*(cS.KmCa+cS.Cao)*(1.+cS.ksat*temp));\\n inaca1t_t = temp2*Math.exp(cS.n*cS.v*cC.fort)*cS.Cao;\\n inaca2t_t = temp2*temp*cC.Nao3*cS.alphanaca; \\n\\n\\n //reversal potentials\\n Ek = cC.rtof*(Math.log((cS.Ko/cS.ki)));\\n Ena = cC.rtof*(Math.log((cS.Nao/cS.nai)));\\n Eks = cC.rtof*(Math.log((cS.Ko+cS.pKNa*cS.Nao)/(cS.ki+cS.pKNa*cS.nai)));\\n Eca = 0.5*cC.rtof*(Math.log((cS.Cao/cS.cai)));\\n \\n // need to figure out vmek is (cS.v - Ek) \\n Ak1 = 0.1/(1.+Math.exp(0.06*((cS.v - Ek)-200.)));\\n Bk1 = (3.*Math.exp(0.0002*((cS.v - Ek)+100.))+Math.exp(0.1*((cS.v - Ek)-10.)))/(1.+Math.exp(-0.5*((cS.v - Ek)))); \\n ik1coefft_t = cS.GK1*Ak1/(Ak1+Bk1); \\n \\n fcassinft_t = 0.6/(1+(cS.cass/0.05)*(cS.cass/0.05))+0.4;\\n temp = 80.0/(1+(cS.cass/0.05)*(cS.cass/0.05))+2.;\\n exptaufcasst_t = Math.exp(-cS.timestep/temp); \\n\\n //stimulus\\n\\n cS.Istim = _s1s2Stimulus(count, settings);\\n \\n //Compute currents\\n\\n cS.sm = minft_t - (minft_t-cS.sm)*exptaumt_t;\\n cS.sh = hinft_t - (hinft_t-cS.sh)*exptauht_t;\\n cS.sj = jinft_t - (jinft_t-cS.sj)*exptaujt_t;\\n cS.ina = cS.GNa*cS.sm *cS.sm *cS.sm *cS.sh*cS.sj*(cS.v-Ena); \\n\\n cS.sxr1 = xr1inft_t-(xr1inft_t - cS.sxr1) * exptauxr1t_t;\\n\\n \\n cS.sxr2 = xr2inft_t-(xr2inft_t - cS.sxr2) * exptauxr2t_t;\\n \\n cS.ikr = cS.Gkr*cC.Gkrfactor*cS.sxr1*cS.sxr2*(cS.v-Ek); \\n \\n cS.sxs = xsinft_t-(xsinft_t-cS.sxs)*exptauxst_t;\\n\\n cS.iks = cS.Gks*cS.sxs*cS.sxs*(cS.v-Eks);\\n\\n cS.sr = rinft_t-(rinft_t-cS.sr)*exptaurt_t;\\n\\n cS.ss = sinft_t-(sinft_t-cS.ss)*exptaust_t;\\n\\n cS.ito = cS.Gto*cS.sr*cS.ss*(cS.v-Ek);\\n\\n cS.sd = dinft_t-(dinft_t-cS.sd)*exptaudt_t;\\n\\n cS.sf = finft_t-(finft_t-cS.sf)*exptauft_t;\\n\\n cS.sf2 = f2inft_t-(f2inft_t-cS.sf2)*exptauf2t_t; \\n\\n FCaSS_INF = (cS.cass > cS.casshi) ? 0.4 : fcassinft_t ;\\n\\n exptaufcass = (cS.cass > cS.casshi) ? cC.exptaufcassinf : exptaufcasst_t;\\n\\n cS.sfcass = FCaSS_INF-(FCaSS_INF- cS.sfcass)*exptaufcass;\\n\\n cS.ical = cS.sd*cS.sf*cS.sf2*cS.sfcass*(ical1t_t* cS.cass - ical2t_t);\\n\\n cS.ik1 = ik1coefft_t*(cS.v-Ek);\\n\\n cS.ipk = ipkcoefft_t*(cS.v-Ek);\\n\\n cS.inaca = inaca1t_t*cS.nai*cS.nai*cS.nai-inaca2t_t*cS.cai;\\n\\n cS.inak = inakcoefft_t*(cS.nai/(cS.nai+cS.KmNa));\\n\\n cS.ipca = cS.GpCa*cS.cai/(cS.KpCa+cS.cai);\\n\\n cS.ibna = cS.GbNa*(cS.v-Ena);\\n\\n cS.ibca = cS.GbCa*(cS.v-Eca);\\n\\n //total current\\n cS.sItot = cS.ikr+ cS.iks+ cS.ik1+ cS.ito+ cS.ina+ cS.ibna+ cS.ical+ cS.ibca+ cS.inak+ cS.inaca+ cS.ipca+ cS.ipk+ cS.Istim;\\n\\n //console.log(cS.ikr, cS.iks, cS.ik1, cS.ito, cS.ina, cS.ibna, cS.ical, cS.ibca, cS.inak, cS.inaca, cS.ipca, cS.ipk, cS.Istim);\\n\\n //update concentrations\\n\\n kCaSR = cS.maxsr-((cS.maxsr-cS.minsr)/(1+(cS.EC/cS.casr*(cS.EC/cS.casr))));\\n k1 = cS.k1prime/kCaSR;\\n k2 = cS.k2prime*kCaSR;\\n dRR = cS.k4*(1.-cS.srr)-k2*cS.cass*cS.srr;\\n cS.srr = cS.srr+cS.timestep*dRR;\\n sOO = k1*cS.cass*cS.cass*cS.srr/(cS.k3+k1*cS.cass*cS.cass);\\n\\n //intracellular calcium currents\\n\\n cS.Irel = cS.Vrel*sOO*(cS.casr- cS.cass);\\n cS.Ileak = cS.Vleak*(cS.casr-cS.cai);\\n cS.Iup = cS.Vmaxup/(1.+((cS.Kup*cS.Kup)/(cS.cai*cS.cai)));\\n cS.Ixfer = cS.Vxfer*(cS.cass - cS.cai);\\n\\n\\n CaCSQN = cS.Bufsr*cS.casr/(cS.casr+cS.Kbufsr);\\n dCaSR = cS.timestep*(cS.Iup-cS.Irel-cS.Ileak);\\n bjsr = cS.Bufsr-CaCSQN-dCaSR-cS.casr+cS.Kbufsr;\\n cjsr = cS.Kbufsr*(CaCSQN+dCaSR+cS.casr);\\n cS.casr = (Math.sqrt(bjsr*bjsr+4.*cjsr)-bjsr)/2.;\\n\\n CaSSBuf = cS.Bufss * cS.cass/(cS.cass+cS.Kbufss);\\n dCaSS = cS.timestep * (-cS.Ixfer*(cS.Vc/cS.Vss)+cS.Irel*(cS.Vsr/cS.Vss)+(-cS.ical*cC.inversevssF2*cS.CAPACITANCE)); \\n bcss = cS.Bufss - CaSSBuf - dCaSS - cS.cass+cS.Kbufss;\\n ccss = cS.Kbufss*(CaSSBuf+dCaSS+cS.cass);\\n cS.cass = (Math.sqrt(bcss*bcss+4.*ccss)-bcss)/2.;\\n\\n CaBuf = cS.Bufc*cS.cai/(cS.cai+cS.Kbufc);\\n dCai = cS.timestep *((-(cS.ibca+cS.ipca-2*cS.inaca)*cC.inverseVcF2*cS.CAPACITANCE)-(cS.Iup-cS.Ileak)*(cS.Vsr/cS.Vc)+cS.Ixfer); \\n bc = cS.Bufc-CaBuf-dCai-cS.cai+cS.Kbufc;\\n cc = cS.Kbufc*(CaBuf+dCai+cS.cai);\\n cS.cai = (Math.sqrt(bc*bc+4.*cc)-bc)/2.;\\n\\n dNai = -(cS.ina+cS.ibna+3.*cS.inak+3.*cS.inaca)*cC.inverseVcF*cS.CAPACITANCE;\\n cS.nai = cS.nai+cS.timestep*dNai;\\n\\n dKi = -(cS.Istim+cS.ik1+cS.ito+cS.ikr+cS.iks-2.*cS.inak+cS.ipk)*cC.inverseVcF*cS.CAPACITANCE; \\n cS.ki = cS.ki+cS.timestep*dKi;\\n cS.v = cS.v - cS.sItot * cS.timestep ;\\n \\n\\n //cal ends\\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n \\n // iterate the count\\n count++;\\n\\n return data; \\n }\",\n \"function calculateNext(data) {\\n \\n\\t\\tvar yinft_t, exptauyt_t, xinft_t, exptauxt_t, ikcoefft_t, rinft_t, exptaurt_t, itoterm1t_t, itoterm2t_t, itoterm3t_t,\\n\\t\\tinacaterm1t_t, inacaterm2t_t, minft_t, exptaumt_t, hinft_t, exptauht_t, dinft_t, exptaudt_t, finft_t, exptauft_t,\\n\\t\\tisicaterm1t_t, isikterm1t_t, isikterm2t_t, pinft_t, exptaupt_t, ik1term1t_t, \\n\\n\\t\\tadum, bdum, ena, ek, emh, eca, vmek, yinf, exptauy, ikc, inac, ionc, xinf, exptaux, ikcoeff, ik1term1, rinf, exptaur,\\n\\t\\titoterm1, itoterm2, itoterm3, icac, inacaterm1, inacaterm2, nai3, dum2, dum3, dum4, minf, exptaum, hinf, exptauh, \\n\\t\\tdinf, exptaud, finf, exptauf, tvar, inf, isicaterm1, isikterm1, isikterm2, imk, imna, imca, iion,\\n\\t\\tfactor, derv, pinf, exptaup, iup, itr, irel, dcaup, dcarel, dcai, dna, dk ;\\n\\n\\t\\tadum = 0.05 * Math.exp(-0.067 * (cS.v + 42.));\\n bdum = (Math.abs(cS.v + 42.) <= 1e-6) ? 2.5 : (cS.v + 42.) / (1.- Math.exp(-0.2 * (cS.v + 42.)));\\n cS.tau = adum + bdum;\\n yinft_t = adum / cS.tau;\\n exptauyt_t = Math.exp(-cS.timestep * cS.tau);\\n adum = 0.5 * Math.exp(0.0826 * (cS.v + 50.)) / (1.0 + Math.exp(0.057 * (cS.v + 50.)));\\n bdum = 1.3 * Math.exp(-0.06 * (cS.v + 20.)) / (1. + Math.exp(-0.04 * (cS.v + 20.)));\\n cS.tau = adum + bdum;\\n xinft_t = adum / cS.tau;\\n exptauxt_t = Math.exp(-cS.timestep * cS.tau);\\n ikcoefft_t = Math.exp(-cS.v * cC.fort);\\n adum = 0.033 * Math.exp(-cS.v / 17.);\\n bdum = 33. / (1. + Math.exp(-(cS.v + 10.) / 8.));\\n cS.tau = adum + bdum;\\n rinft_t = adum / cS.tau;\\n exptaurt_t = Math.exp(-cS.timestep * cS.tau);\\n itoterm1t_t = (Math.abs(cS.v + 10.) <= (10e-6)) ? 5. : (cS.v + 10.) / (1.-Math.exp(-2. * (cS.v + 10.)));\\n itoterm2t_t = Math.exp(.02 * cS.v);\\n itoterm3t_t = Math.exp(-.02 * cS.v);\\n inacaterm1t_t = Math.exp(cS.gamma * cS.v * cC.fort);\\n inacaterm2t_t = Math.exp((cS.gamma - 1.) * cS.v * cC.fort);\\n adum = (Math.abs(cS.v + 41.) <= 1e-6) ? 2000 : 200. * (cS.v + 41.) / (1.-Math.exp(-0.1 * (cS.v + 41.)));\\n bdum = 8000. * Math.exp(-0.056 * (cS.v + 66.));\\n cS.tau = adum + bdum;\\n minft_t = adum / cS.tau;\\n exptaumt_t = Math.exp(-cS.timestep * cS.tau);\\n adum = 20. * Math.exp(-0.125 * (cS.v + 75.));\\n bdum = 2000. / (1. + 320. * Math.exp(-0.1 * (cS.v + 75.)));\\n cS.tau = adum + bdum;\\n hinft_t = adum / cS.tau;\\n exptauht_t = Math.exp(-cS.timestep * cS.tau);\\n if(Math.abs(cS.v + 19.) <= 1e-6){\\n adum = 120.;\\n bdum = 120.;\\n }\\n else{\\n adum = 30. * (cS.v + 19.) / (1.-Math.exp(-(cS.v + 19.) / 4.));\\n bdum = 12. * (cS.v + 19.) / (Math.exp((cS.v + 19.) / 10.)-1.);\\n }\\n cS.tau = adum + bdum;\\n dinft_t = adum / cS.tau;\\n exptaudt_t = Math.exp(-cS.timestep * cS.tau);\\n adum = (Math.abs((cS.v + 34.)) <= 1e-6) ? 25. : 6.25 * (cS.v + 34.) / (Math.exp((cS.v + 34.) / 4.)-1.);\\n bdum = 50. / (1. + Math.exp(-(cS.v + 34.) / 4.));\\n cS.tau = adum + bdum;\\n finft_t = adum / cS.tau;\\n exptauft_t = Math.exp(-cS.timestep * cS.tau);\\n isicaterm1t_t = Math.exp(-2. * (cS.v - 50.) * cC.fort);\\n isikterm1t_t = (1.- Math.exp(-(cS.v - 50.) * cC.fort));\\n isikterm2t_t = Math.exp((50. - cS.v) * cC.fort);\\n adum = (Math.abs((cS.v + 34.)) <= 1e-6) ? 2.5 : .625 * (cS.v + 34.) / (Math.exp((cS.v + 34.) / 4.)-1.);\\n bdum = 5.0 / (1. + Math.exp(-(cS.v + 34.) / 4.));\\n cS.tau = adum + bdum;\\n pinft_t = adum / cS.tau;\\n exptaupt_t = Math.exp(-cS.timestep * cS.tau);\\n\\n // compute equilibrium potentials\\n\\t\\t\\n\\t\\tena = cC.rtof * Math.log(cS.nao / cS.nai);\\n ek = cC.rtof * Math.log(cS.kc / cS.ki);\\n emh = cC.rtof * Math.log((cS.nao + 0.12 * cS.kc) / (cS.nai + 0.12 * cS.ki));\\n eca = 0.5 * cC.rtof * Math.log(cS.cao / cS.cai);\\n \\n vmek = cS.v - ek;\\n ik1term1t_t = cS.gk1 * (vmek) / (1. + Math.exp(2. * (vmek + 10.) * cC.fort));\\n\\t\\t\\n\\t\\t// hyperpolarizing-activated current\\n yinf = yinft_t;\\n exptauy = exptauyt_t;\\n cS.y = yinf - (yinf - cS.y) * exptauy;\\n\\n cS.ifk = cS.y * (cS.kc / (cS.kc + cS.kmf)) * cS.gfk * (cS.v - ek);\\n cS.ifna = cS.y * (cS.kc / (cS.kc + cS.kmf)) * cS.gfna * (cS.v - ena);\\n// cS.ifk = 0.0\\n// cS.ifna = 0.0\\n ikc = cS.ifk;\\n inac = cS.ifna;\\n ionc = cS.ifk + cS.ifna;\\n\\n// time-dependent (delayed K + current)\\n xinf = xinft_t;\\n exptaux = exptauxt_t;\\n cS.x = xinf - (xinf - cS.x) * exptaux;\\n\\n ikcoeff = ikcoefft_t;\\n cS.ik = cS.x * cS.ikmax * (cS.ki - cS.kc * ikcoeff) / 140.;\\n ikc = ikc + cS.ik;\\n ionc = ionc + cS.ik;\\n\\n// time-independent (background) K + current\\n ik1term1 = ik1term1t_t;\\n cS.ik1 = (cS.kc / (cS.kc + cS.km1)) * ik1term1;\\n ikc = ikc + cS.ik1;\\n ionc = ionc + cS.ik1;\\n\\n\\t\\t// transient outward current\\n rinf = rinft_t;\\n exptaur = exptaurt_t;\\n cS.r = rinf - (rinf - cS.r) * exptaur;\\n\\n itoterm1 = itoterm1t_t;\\n itoterm2 = itoterm2t_t;\\n itoterm3 = itoterm3t_t;\\n cS.ito = (cS.r * cS.gto * (0.2 + (cS.kc / (cS.kc + cS.kmt))) * (cS.cai / \\n (cS.kact + cS.cai)) * itoterm1) * (cS.ki * itoterm2-cS.kc * itoterm3); // gto = 0.28\\n ikc = ikc + cS.ito;\\n ionc = ionc + cS.ito;\\n\\t\\t \\n// background sodium current\\n cS.ibna = cS.gbna * (cS.v - ena);\\n inac = inac + cS.ibna;\\n ionc = ionc + cS.ibna;\\n\\n// background calcium current\\n cS.ibca = cS.gbca * (cS.v - eca);\\n icac = cS.ibca;\\n ionc = ionc + cS.ibca;\\n\\n// na-k pump exchange current\\n cS.inak = cS.ipmax * (cS.kc / (cS.kmk + cS.kc)) * (cS.nai / (cS.kmna + cS.nai));\\n ikc = ikc - 2. * cS.inak;\\n inac = inac + 3. * cS.inak;\\n ionc = ionc + cS.inak;\\n\\n// na-ca pump exchange current\\n inacaterm1 = inacaterm1t_t;\\n inacaterm2 = inacaterm2t_t;\\n nai3 = cS.nai * cS.nai * cS.nai;\\n dum2 = nai3 * cS.cao * inacaterm1;\\n dum3 = cC.nao3 * (cS.cai) * inacaterm2;\\n dum4 = 1. + cS.dnaca * ((cS.cai) * cC.nao3 + cS.cao * nai3);\\n cS.inaca = cS.knaca * (dum2 - dum3) / dum4;\\n inac = inac + 3 * cS.inaca;\\n icac = icac - 2. * cS.inaca;\\n ionc = ionc + cS.inaca;\\n\\n// fast sodium current\\n minf = minft_t;\\n exptaum = exptaumt_t;\\n cS.m = minf - (minf - cS.m) * exptaum;\\n\\n hinf = hinft_t;\\n exptauh = exptauht_t;\\n cS.h = hinf - (hinf - cS.h) * exptauh;\\n\\n cS.ina = cS.m * cS.m * cS.m * cS.h * cS.gna * (cS.v - emh);\\n inac = inac + cS.ina;\\n ionc = ionc + cS.ina; \\n\\n// fast second inward current (calcium)\\n dinf = dinft_t;\\n exptaud = exptaudt_t;\\n cS.d = dinf - (dinf - cS.d) * exptaud;\\n\\n finf = finft_t;\\n exptauf = exptauft_t;\\n cS.f = finf - (finf - cS.f) * exptauf;\\n\\n adum = 5.;\\n bdum = cS.cai * adum / cS.kmf2;\\n tvar = adum + bdum;\\n inf = adum / (adum + bdum);\\n cS.f2 = inf - (inf - cS.f2) * Math.exp(-cS.timestep * tvar);\\n\\n dum2 = cS.d * cS.f * cS.f2 * (4. * cS.psi * (cS.v - 50.) * cC.fort);\\n isicaterm1 = isicaterm1t_t;\\n dum3 = (1. - isicaterm1);\\n dum4 = cS.cai * cC.exp100fort - cS.cao * isicaterm1;\\n cS.isica = dum2 * dum4 / dum3;\\n icac = icac + cS.isica;\\n ionc = ionc + cS.isica;\\n\\n// more fast inward current\\n isikterm1 = isikterm1t_t;\\n isikterm2 = isikterm2t_t;\\n dum3 = isikterm1;\\n dum4 = cS.ki * cC.exp50fort - cS.kc * isikterm2;\\n cS.isik = dum2 * dum4 / (400. * dum3);\\n ikc = ikc + cS.isik;\\n ionc = ionc + cS.isik;\\n\\n// total currents used to update each ion concentration\\n imk = ikc;\\n imna = inac;\\n imca = icac;\\n\\n// convert from nanoamperes to microampers per square cm\\n\\n// iion = 0.015 * ionc\\n\\n// derv = -1000. * iion / cm\\n\\n imna = cS.ifna + cS.ina + 3. * cS.inaca + 3. * cS.inak + cS.ibna;\\n imk = cS.ifk + cS.ik + cS.ik1 + cS.ito + cS.isik - 2. * cS.inak;\\n imca = cS.isica - 2. * cS.inaca + cS.ibca;\\n iion = imna + imk + imca;\\n\\n\\n// stimulus\\n// if(ttim * 1000.0.le.1.0) then\\n// if(mod(it,icycle).le.istimdur) then\\n// if(ttim * 1000.0.le.1.0.or.\\n// & (ttim * 1000.0.gt.500.0.and.ttim * 1000.0.le.501.0)) then\\n// ionc = ionc-10000.0\\n// endif\\n// 1750 works, 1800 does not so use 1750 as diast. thresh, 3500 = 2 * \\n // if(mod(ntime,icycle).le.istimdur) then\\n factor = _s1s2Stimulus(count,data);\\n iion = iion - factor;\\n imk = imk - factor;\\n \\n derv = iion / cS.cm;\\n\\n \\n// change in intracellular sodium \\n dna = (-imna / (cC.vi * cS.fcon)) * cS.timestep;\\n cS.nai = cS.nai + dna;\\n\\n// change in extracellular potassium\\n dk = (-cS.prate * (cS.kc - cS.kb) + imk / (cC.ve * cS.fcon)) * cS.timestep;\\n cS.kc = cS.kc + dk;\\n\\n// change in intracellular potassium\\n dk = (-imk / (cC.vi * cS.fcon)) * cS.timestep;\\n cS.ki = cS.ki + dk;\\n\\t\\t\\n// intracellular calcium handling\\n pinf = pinft_t;\\n exptaup = exptaupt_t;\\n cS.p = pinf - (pinf - cS.p) * exptaup;\\n\\n iup = cC.aup * cS.cai * (cS.cabarup - cS.caup);\\n itr = cC.atr * cS.p * (cS.caup - cS.carel);\\n irel = cC.arel * cS.carel * (((cS.cai) * cS.cai) / ((cS.cai) * cS.cai + cS.kmca * cS.kmca));\\n\\n dcaup = ((iup - itr) / (2. * cC.vup * cS.fcon)) * cS.timestep;\\n cS.caup = cS.caup + dcaup;\\n\\n dcarel = ((itr - irel) / (2. * cC.vrel * cS.fcon)) * cS.timestep;\\n cS.carel = cS.carel + dcarel;\\n\\n dcai = (-(imca + iup - irel) / (2. * cC.vi * cS.fcon)) * cS.timestep;\\n cS.cai = cS.cai + dcai;\\n\\n// update voltage\\n cS.v = cS.v - cS.timestep * derv;\\n\\t\\t\\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n \\n // iterate the count\\n count++;\\n return data; \\n }\",\n \"function dft_direct (re, im) {\\n let N = re.length;\\n // is this necessary? should be able to do DFT with any N\\n //if (N.toString(2) % 10) return; // check that N is a power of 2\\n\\n // array containing N evenly spaced points around the unit circle\\n let W = discrete_circle(N);\\n\\n // debugger;\\n // initialize imaginary values to zero if not provided\\n im = im || re.map( a => 0 );\\n\\n // sum (x * W) over N points (0 to N-1), for all frequencies k in N\\n return re.map( (_, k) =>\\n re.map( (_, n) => cpx_mult([re[n], im[n]], W[n * k % N]) )\\n .reduce( (a, b) => cpx_add(a, b) ));\\n}\",\n \"function fftRadix2(realVals, imagVals, size, inverse, cpuBackend) {\\n if (size === 1) {\\n return { real: realVals, imag: imagVals };\\n }\\n const data = backend_util.mergeRealAndImagArrays(realVals, imagVals);\\n const half = size / 2;\\n const evenComplex = backend_util.complexWithEvenIndex(data);\\n const evenRealVals = evenComplex.real;\\n const evenImagVals = evenComplex.imag;\\n const evenShape = [evenRealVals.length];\\n const evenRealInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenRealVals);\\n const evenImagInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenImagVals);\\n const evenTensorInfo = complex({ inputs: { real: evenRealInfo, imag: evenImagInfo }, backend: cpuBackend });\\n const oddComplex = backend_util.complexWithOddIndex(data);\\n const oddRealVals = oddComplex.real;\\n const oddImagVals = oddComplex.imag;\\n const oddShape = [oddRealVals.length];\\n const oddRealInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddRealVals);\\n const oddImagInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddImagVals);\\n const oddTensorInfo = complex({ inputs: { real: oddRealInfo, imag: oddImagInfo }, backend: cpuBackend });\\n // Recursive call for half part of original input.\\n const $evenComplex = fftRadix2(evenRealVals, evenImagVals, half, inverse, cpuBackend);\\n const $evenRealVals = $evenComplex.real;\\n const $evenImagVals = $evenComplex.imag;\\n const $evenShape = [$evenRealVals.length];\\n const $evenRealInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenRealVals);\\n const $evenImagInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenImagVals);\\n const $evenTensorInfo = complex({\\n inputs: { real: $evenRealInfo, imag: $evenImagInfo },\\n backend: cpuBackend\\n });\\n const $oddComplex = fftRadix2(oddRealVals, oddImagVals, half, inverse, cpuBackend);\\n const $oddRealVals = $oddComplex.real;\\n const $oddImagVals = $oddComplex.imag;\\n const $oddShape = [$oddRealVals.length];\\n const $oddRealInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddRealVals);\\n const $oddImagInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddImagVals);\\n const $oddTensorInfo = complex({ inputs: { real: $oddRealInfo, imag: $oddImagInfo }, backend: cpuBackend });\\n const e = backend_util.exponents(size, inverse);\\n const eShape = [e.real.length];\\n const eRealInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.real);\\n const eImagInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.imag);\\n const complexInfo = complex({ inputs: { real: eRealInfo, imag: eImagInfo }, backend: cpuBackend });\\n const exponentInfo = multiply({ inputs: { a: complexInfo, b: $oddTensorInfo }, backend: cpuBackend });\\n const addPart = add({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const subPart = sub({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const addPartReal = real({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartReal = real({ inputs: { input: subPart }, backend: cpuBackend });\\n const addPartImag = imag({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartImag = imag({ inputs: { input: subPart }, backend: cpuBackend });\\n const $real = concat({\\n inputs: [addPartReal, subPartReal],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $imag = concat({\\n inputs: [addPartImag, subPartImag],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $realVals = cpuBackend.data.get($real.dataId).values;\\n const $imagVals = cpuBackend.data.get($imag.dataId).values;\\n cpuBackend.disposeIntermediateTensorInfo(evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(complexInfo);\\n cpuBackend.disposeIntermediateTensorInfo(exponentInfo);\\n cpuBackend.disposeIntermediateTensorInfo(addPart);\\n cpuBackend.disposeIntermediateTensorInfo(subPart);\\n cpuBackend.disposeIntermediateTensorInfo(addPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(addPartImag);\\n cpuBackend.disposeIntermediateTensorInfo(subPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(subPartImag);\\n cpuBackend.disposeIntermediateTensorInfo($real);\\n cpuBackend.disposeIntermediateTensorInfo($imag);\\n return { real: $realVals, imag: $imagVals };\\n}\",\n \"function doFFT(values) {\\n\\tvar data = new complex_array.ComplexArray(values.length);\\n\\tdata.real = new Float32Array(values);\\n\\tvar frequencies = data.FFT();\\n\\n\\treturn frequencies;\\n}\",\n \"calculateLoudness(buffer) {\\n\\n // first call or after resetMemory\\n if (this.copybuffer == undefined) {\\n // how long should the copybuffer be at least? \\n // --> at least maxT should fit in and length shall be an integer fraction of buffer length\\n let length = Math.floor(this.sampleRate * this.loudnessprops.maxT / buffer.length + 1) * buffer.length;\\n this.copybuffer = new CircularAudioBuffer(context, this.nChannels, length, this.sampleRate);\\n }\\n\\n //accumulate buffer to previous call\\n this.copybuffer.concat(buffer);\\n\\n // must be gt nSamplesPerInterval\\n // or: wait at least one interval time T to be able to calculate loudness\\n if (this.copybuffer.getLength() < this.nSamplesPerInterval) {\\n console.log('buffer too small ... have to eat more data');\\n return NaN;\\n }\\n\\n // get array of meansquares from buffer of overlapping intervals\\n let meanSquares = this.getBufferMeanSquares(this.copybuffer, this.nSamplesPerInterval, this.nStepsize);\\n\\n // first stage filter\\n this.filterBlocks(meanSquares, this.gamma_a);\\n\\n // second stage filter\\n let gamma_r = 0.;\\n for (let chIdx = 0; chIdx < this.nChannels; chIdx++) {\\n let mean = 0.;\\n for (let idx = 0; idx < meanSquares[chIdx].length; idx++) {\\n mean += meanSquares[chIdx][idx];\\n }\\n mean /= meanSquares[chIdx].length;\\n gamma_r += (this.channelWeight[chIdx] * mean);\\n }\\n gamma_r = -0.691 + 10.0 * Math.log10(gamma_r) - 10.;\\n\\n this.filterBlocks(meanSquares, gamma_r);\\n\\n // gated loudness from filtered blocks\\n let gatedLoudness = 0.;\\n for (let chIdx = 0; chIdx < this.nChannels; chIdx++) {\\n let mean = 0.;\\n for (let idx = 0; idx < meanSquares[chIdx].length; idx++) {\\n mean += meanSquares[chIdx][idx];\\n }\\n mean /= meanSquares[chIdx].length;\\n\\n gatedLoudness += (this.channelWeight[chIdx] * mean);\\n }\\n gatedLoudness = -0.691 + 10.0 * Math.log10(gatedLoudness);\\n\\n //console.log(this.id, '- gatedLoudness:', gatedLoudness);\\n\\n return gatedLoudness;\\n }\",\n \"function yt(t){var S,k,_,A,e,u=Math.floor,I=new Array(64),C=new Array(64),T=new Array(64),F=new Array(64),w=new Array(65535),y=new Array(65535),Q=new Array(64),v=new Array(64),P=[],E=0,q=7,O=new Array(64),B=new Array(64),R=new Array(64),n=new Array(256),j=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],D=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],M=[0,1,2,3,4,5,6,7,8,9,10,11],U=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],N=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],z=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],L=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function G(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),V(255&t)}function X(t,e,n,r,i){for(var o,a=i[0],s=i[240],h=function(t,e){var n,r,i,o,a,s,h,c,l,u,f=0;for(l=0;l<8;++l){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],h=t[f+6];var d=n+(c=t[f+7]),p=n-c,g=r+h,m=r-h,w=i+s,y=i-s,v=o+a,b=o-a,x=d+v,S=d-v,k=g+w,_=g-w;t[f]=x+k,t[f+4]=x-k;var A=.707106781*(_+S);t[f+2]=S+A,t[f+6]=S-A;var I=.382683433*((x=b+y)-(_=m+p)),C=.5411961*x+I,T=1.306562965*_+I,F=.707106781*(k=y+m),P=p+F,E=p-F;t[f+5]=E+C,t[f+3]=E-C,t[f+1]=P+T,t[f+7]=P-T,f+=8}for(l=f=0;l<8;++l){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],h=t[f+48];var q=n+(c=t[f+56]),O=n-c,B=r+h,R=r-h,j=i+s,D=i-s,M=o+a,U=o-a,N=q+M,z=q-M,L=B+j,H=B-j;t[f]=N+L,t[f+32]=N-L;var W=.707106781*(H+z);t[f+16]=z+W,t[f+48]=z-W;var G=.382683433*((N=U+D)-(H=R+O)),V=.5411961*N+G,Y=1.306562965*H+G,X=.707106781*(L=D+R),J=O+X,K=O-X;t[f+40]=K+V,t[f+24]=K-V,t[f+8]=J+Y,t[f+56]=J-Y,f++}for(l=0;l<64;++l)u=t[l]*e[l],Q[l]=0>4;for(var m=1;m<=f;++m)G(s);g&=15}o=32767+v[d],G(i[(g<<4)+y[o]]),G(w[o]),d++}return 63!=u&&G(a),n}function J(t){if(t<=0&&(t=1),100>3)*v+(d=4*(7&g)),y<=b+p&&(f-=v*(b+1+p-y)),v<=s+d&&(f-=s+d-v+4),h=m[f++],c=m[f++],l=m[f++],O[g]=(j[h]+j[c+256>>0]+j[l+512>>0]>>16)-128,B[g]=(j[h+768>>0]+j[c+1024>>0]+j[l+1280>>0]>>16)-128,R[g]=(j[h+1280>>0]+j[c+1536>>0]+j[l+1792>>0]>>16)-128;i=X(O,T,i,S,_),o=X(B,F,o,k,A),a=X(R,F,a,k,A),s+=32}b+=8}if(0<=q){var x=[];x[1]=q+1,x[0]=(1<>0]=38470*t,j[t+512>>0]=7471*t+32768,j[t+768>>0]=-11059*t,j[t+1024>>0]=-21709*t,j[t+1280>>0]=32768*t+8421375,j[t+1536>>0]=-27439*t,j[t+1792>>0]=-5329*t}(),J(t),(new Date).getTime()}()}\",\n \"function _t(t) {\\n var N,\\n L,\\n A,\\n S,\\n e,\\n c = Math.floor,\\n _ = new Array(64),\\n F = new Array(64),\\n P = new Array(64),\\n k = new Array(64),\\n y = new Array(65535),\\n v = new Array(65535),\\n Z = new Array(64),\\n w = new Array(64),\\n I = [],\\n C = 0,\\n B = 7,\\n j = new Array(64),\\n E = new Array(64),\\n M = new Array(64),\\n n = new Array(256),\\n O = new Array(2048),\\n b = [0, 1, 5, 6, 14, 15, 27, 28, 2, 4, 7, 13, 16, 26, 29, 42, 3, 8, 12, 17, 25, 30, 41, 43, 9, 11, 18, 24, 31, 40, 44, 53, 10, 19, 23, 32, 39, 45, 52, 54, 20, 22, 33, 38, 46, 51, 55, 60, 21, 34, 37, 47, 50, 56, 59, 61, 35, 36, 48, 49, 57, 58, 62, 63],\\n q = [0, 0, 1, 5, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0],\\n T = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11],\\n R = [0, 0, 2, 1, 3, 3, 2, 4, 3, 5, 5, 4, 4, 0, 0, 1, 125],\\n D = [1, 2, 3, 0, 4, 17, 5, 18, 33, 49, 65, 6, 19, 81, 97, 7, 34, 113, 20, 50, 129, 145, 161, 8, 35, 66, 177, 193, 21, 82, 209, 240, 36, 51, 98, 114, 130, 9, 10, 22, 23, 24, 25, 26, 37, 38, 39, 40, 41, 42, 52, 53, 54, 55, 56, 57, 58, 67, 68, 69, 70, 71, 72, 73, 74, 83, 84, 85, 86, 87, 88, 89, 90, 99, 100, 101, 102, 103, 104, 105, 106, 115, 116, 117, 118, 119, 120, 121, 122, 131, 132, 133, 134, 135, 136, 137, 138, 146, 147, 148, 149, 150, 151, 152, 153, 154, 162, 163, 164, 165, 166, 167, 168, 169, 170, 178, 179, 180, 181, 182, 183, 184, 185, 186, 194, 195, 196, 197, 198, 199, 200, 201, 202, 210, 211, 212, 213, 214, 215, 216, 217, 218, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250],\\n U = [0, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0],\\n z = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11],\\n H = [0, 0, 2, 1, 2, 4, 4, 3, 4, 7, 5, 4, 4, 0, 1, 2, 119],\\n W = [0, 1, 2, 3, 17, 4, 5, 33, 49, 6, 18, 65, 81, 7, 97, 113, 19, 34, 50, 129, 8, 20, 66, 145, 161, 177, 193, 9, 35, 51, 82, 240, 21, 98, 114, 209, 10, 22, 36, 52, 225, 37, 241, 23, 24, 25, 26, 38, 39, 40, 41, 42, 53, 54, 55, 56, 57, 58, 67, 68, 69, 70, 71, 72, 73, 74, 83, 84, 85, 86, 87, 88, 89, 90, 99, 100, 101, 102, 103, 104, 105, 106, 115, 116, 117, 118, 119, 120, 121, 122, 130, 131, 132, 133, 134, 135, 136, 137, 138, 146, 147, 148, 149, 150, 151, 152, 153, 154, 162, 163, 164, 165, 166, 167, 168, 169, 170, 178, 179, 180, 181, 182, 183, 184, 185, 186, 194, 195, 196, 197, 198, 199, 200, 201, 202, 210, 211, 212, 213, 214, 215, 216, 217, 218, 226, 227, 228, 229, 230, 231, 232, 233, 234, 242, 243, 244, 245, 246, 247, 248, 249, 250];\\n\\n function r(t, e) {\\n for (var n = 0, r = 0, i = new Array(), o = 1; o <= 16; o++) {\\n for (var a = 1; a <= t[o]; a++) i[e[r]] = [], i[e[r]][0] = n, i[e[r]][1] = o, r++, n++;\\n\\n n *= 2;\\n }\\n\\n return i;\\n }\\n\\n function V(t) {\\n for (var e = t[0], n = t[1] - 1; 0 <= n;) e & 1 << n && (C |= 1 << B), n--, --B < 0 && (255 == C ? (G(255), G(0)) : G(C), B = 7, C = 0);\\n }\\n\\n function G(t) {\\n I.push(t);\\n }\\n\\n function Y(t) {\\n G(t >> 8 & 255), G(255 & t);\\n }\\n\\n function J(t, e, n, r, i) {\\n for (var o, a = i[0], s = i[240], l = function (t, e) {\\n var n,\\n r,\\n i,\\n o,\\n a,\\n s,\\n l,\\n h,\\n u,\\n c,\\n f = 0;\\n\\n for (u = 0; u < 8; ++u) {\\n n = t[f], r = t[f + 1], i = t[f + 2], o = t[f + 3], a = t[f + 4], s = t[f + 5], l = t[f + 6];\\n var p = n + (h = t[f + 7]),\\n d = n - h,\\n g = r + l,\\n m = r - l,\\n y = i + s,\\n v = i - s,\\n w = o + a,\\n b = o - a,\\n x = p + w,\\n N = p - w,\\n L = g + y,\\n A = g - y;\\n t[f] = x + L, t[f + 4] = x - L;\\n var S = .707106781 * (A + N);\\n t[f + 2] = N + S, t[f + 6] = N - S;\\n\\n var _ = .382683433 * ((x = b + v) - (A = m + d)),\\n F = .5411961 * x + _,\\n P = 1.306562965 * A + _,\\n k = .707106781 * (L = v + m),\\n I = d + k,\\n C = d - k;\\n\\n t[f + 5] = C + F, t[f + 3] = C - F, t[f + 1] = I + P, t[f + 7] = I - P, f += 8;\\n }\\n\\n for (u = f = 0; u < 8; ++u) {\\n n = t[f], r = t[f + 8], i = t[f + 16], o = t[f + 24], a = t[f + 32], s = t[f + 40], l = t[f + 48];\\n var B = n + (h = t[f + 56]),\\n j = n - h,\\n E = r + l,\\n M = r - l,\\n O = i + s,\\n q = i - s,\\n T = o + a,\\n R = o - a,\\n D = B + T,\\n U = B - T,\\n z = E + O,\\n H = E - O;\\n t[f] = D + z, t[f + 32] = D - z;\\n var W = .707106781 * (H + U);\\n t[f + 16] = U + W, t[f + 48] = U - W;\\n var V = .382683433 * ((D = R + q) - (H = M + j)),\\n G = .5411961 * D + V,\\n Y = 1.306562965 * H + V,\\n J = .707106781 * (z = q + M),\\n X = j + J,\\n K = j - J;\\n t[f + 40] = K + G, t[f + 24] = K - G, t[f + 8] = X + Y, t[f + 56] = X - Y, f++;\\n }\\n\\n for (u = 0; u < 64; ++u) c = t[u] * e[u], Z[u] = 0 < c ? c + .5 | 0 : c - .5 | 0;\\n\\n return Z;\\n }(t, e), h = 0; h < 64; ++h) w[b[h]] = l[h];\\n\\n var u = w[0] - n;\\n n = w[0], 0 == u ? V(r[0]) : (V(r[v[o = 32767 + u]]), V(y[o]));\\n\\n for (var c = 63; 0 < c && 0 == w[c]; c--);\\n\\n if (0 == c) return V(a), n;\\n\\n for (var f, p = 1; p <= c;) {\\n for (var d = p; 0 == w[p] && p <= c; ++p);\\n\\n var g = p - d;\\n\\n if (16 <= g) {\\n f = g >> 4;\\n\\n for (var m = 1; m <= f; ++m) V(s);\\n\\n g &= 15;\\n }\\n\\n o = 32767 + w[p], V(i[(g << 4) + v[o]]), V(y[o]), p++;\\n }\\n\\n return 63 != c && V(a), n;\\n }\\n\\n function X(t) {\\n if (t <= 0 && (t = 1), 100 < t && (t = 100), e != t) {\\n (function (t) {\\n for (var e = [16, 11, 10, 16, 24, 40, 51, 61, 12, 12, 14, 19, 26, 58, 60, 55, 14, 13, 16, 24, 40, 57, 69, 56, 14, 17, 22, 29, 51, 87, 80, 62, 18, 22, 37, 56, 68, 109, 103, 77, 24, 35, 55, 64, 81, 104, 113, 92, 49, 64, 78, 87, 103, 121, 120, 101, 72, 92, 95, 98, 112, 100, 103, 99], n = 0; n < 64; n++) {\\n var r = c((e[n] * t + 50) / 100);\\n r < 1 ? r = 1 : 255 < r && (r = 255), _[b[n]] = r;\\n }\\n\\n for (var i = [17, 18, 24, 47, 99, 99, 99, 99, 18, 21, 26, 66, 99, 99, 99, 99, 24, 26, 56, 99, 99, 99, 99, 99, 47, 66, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99], o = 0; o < 64; o++) {\\n var a = c((i[o] * t + 50) / 100);\\n a < 1 ? a = 1 : 255 < a && (a = 255), F[b[o]] = a;\\n }\\n\\n for (var s = [1, 1.387039845, 1.306562965, 1.175875602, 1, .785694958, .5411961, .275899379], l = 0, h = 0; h < 8; h++) for (var u = 0; u < 8; u++) P[l] = 1 / (_[b[l]] * s[h] * s[u] * 8), k[l] = 1 / (F[b[l]] * s[h] * s[u] * 8), l++;\\n })(t < 50 ? Math.floor(5e3 / t) : Math.floor(200 - 2 * t)), e = t;\\n }\\n }\\n\\n this.encode = function (t, e) {\\n var n, r;\\n new Date().getTime();\\n e && X(e), I = new Array(), C = 0, B = 7, Y(65496), Y(65504), Y(16), G(74), G(70), G(73), G(70), G(0), G(1), G(1), G(0), Y(1), Y(1), G(0), G(0), function () {\\n Y(65499), Y(132), G(0);\\n\\n for (var t = 0; t < 64; t++) G(_[t]);\\n\\n G(1);\\n\\n for (var e = 0; e < 64; e++) G(F[e]);\\n }(), n = t.width, r = t.height, Y(65472), Y(17), G(8), Y(r), Y(n), G(3), G(1), G(17), G(0), G(2), G(17), G(1), G(3), G(17), G(1), function () {\\n Y(65476), Y(418), G(0);\\n\\n for (var t = 0; t < 16; t++) G(q[t + 1]);\\n\\n for (var e = 0; e <= 11; e++) G(T[e]);\\n\\n G(16);\\n\\n for (var n = 0; n < 16; n++) G(R[n + 1]);\\n\\n for (var r = 0; r <= 161; r++) G(D[r]);\\n\\n G(1);\\n\\n for (var i = 0; i < 16; i++) G(U[i + 1]);\\n\\n for (var o = 0; o <= 11; o++) G(z[o]);\\n\\n G(17);\\n\\n for (var a = 0; a < 16; a++) G(H[a + 1]);\\n\\n for (var s = 0; s <= 161; s++) G(W[s]);\\n }(), Y(65498), Y(12), G(3), G(1), G(0), G(2), G(17), G(3), G(17), G(0), G(63), G(0);\\n var i = 0,\\n o = 0,\\n a = 0;\\n C = 0, B = 7, this.encode.displayName = \\\"_encode_\\\";\\n\\n for (var s, l, h, u, c, f, p, d, g, m = t.data, y = t.width, v = t.height, w = 4 * y, b = 0; b < v;) {\\n for (s = 0; s < w;) {\\n for (f = c = w * b + s, p = -1, g = d = 0; g < 64; g++) f = c + (d = g >> 3) * w + (p = 4 * (7 & g)), v <= b + d && (f -= w * (b + 1 + d - v)), w <= s + p && (f -= s + p - w + 4), l = m[f++], h = m[f++], u = m[f++], j[g] = (O[l] + O[h + 256 >> 0] + O[u + 512 >> 0] >> 16) - 128, E[g] = (O[l + 768 >> 0] + O[h + 1024 >> 0] + O[u + 1280 >> 0] >> 16) - 128, M[g] = (O[l + 1280 >> 0] + O[h + 1536 >> 0] + O[u + 1792 >> 0] >> 16) - 128;\\n\\n i = J(j, P, i, N, A), o = J(E, k, o, L, S), a = J(M, k, a, L, S), s += 32;\\n }\\n\\n b += 8;\\n }\\n\\n if (0 <= B) {\\n var x = [];\\n x[1] = B + 1, x[0] = (1 << B + 1) - 1, V(x);\\n }\\n\\n return Y(65497), new Uint8Array(I);\\n }, function () {\\n new Date().getTime();\\n t || (t = 50), function () {\\n for (var t = String.fromCharCode, e = 0; e < 256; e++) n[e] = t(e);\\n }(), N = r(q, T), L = r(U, z), A = r(R, D), S = r(H, W), function () {\\n for (var t = 1, e = 2, n = 1; n <= 15; n++) {\\n for (var r = t; r < e; r++) v[32767 + r] = n, y[32767 + r] = [], y[32767 + r][1] = n, y[32767 + r][0] = r;\\n\\n for (var i = -(e - 1); i <= -t; i++) v[32767 + i] = n, y[32767 + i] = [], y[32767 + i][1] = n, y[32767 + i][0] = e - 1 + i;\\n\\n t <<= 1, e <<= 1;\\n }\\n }(), function () {\\n for (var t = 0; t < 256; t++) O[t] = 19595 * t, O[t + 256 >> 0] = 38470 * t, O[t + 512 >> 0] = 7471 * t + 32768, O[t + 768 >> 0] = -11059 * t, O[t + 1024 >> 0] = -21709 * t, O[t + 1280 >> 0] = 32768 * t + 8421375, O[t + 1536 >> 0] = -27439 * t, O[t + 1792 >> 0] = -5329 * t;\\n }(), X(t), new Date().getTime();\\n }();\\n }\",\n \"twistMU() {\\n this.fourCycle(this.edgeLoc, 1, 4, 7, 10, this.edgeOrient, 1, 1, 1, 1, 2);\\n this.fourCycle(this.sideLoc, 3, 2, 0, 5, this.sideOrient, 2, 1, 2, 3, 4);\\n }\",\n \"function draw() {\\n\\t background(0);\\n\\t var spectrum = fft.analyze();// run the FFT analysis\\n\\n/*\\nLocal Variable, fft.getEnergy maps the different \\nfrequencies of the audio and returns values between 0 and 255\\n*/\\n var bass = fft.getEnergy( \\\"bass\\\" );\\n var treble = fft.getEnergy( \\\"treble\\\" );\\n var highMid = fft.getEnergy( \\\"highMid\\\" ); \\n\\n/* \\nLocal variable which assigns values to the mapped frequencies\\n*/\\n var mapMid = map( highMid, 0, 255, -50, 255 );\\n var mapTreble = map( treble, 0, 255, -140, 200 );\\n\\n var pieces = 60;//Local variable for the number of lines in the shape\\n var radius = 350\\n \\t translate (width/2, height/2);// Moves origin to the centre of the canvas\\n \\t stroke (0);\\n \\tstrokeWeight(3);\\n for( i = 0; i < pieces; i++ ) { // draws a shape of each piece\\n \\t\\n stroke(219, 162, 188);\\n rotate(frameCount * 0.0001);\\n line(mapMid, mapMid, 10, bass ); \\n stroke(17, 218, 211);\\n point(mapTreble, 480);\\n point(mapMid, 670);\\n \\n /* \\n Push() adds a new item at the end of the array.\\n Pop() removes the last item of an array\\n */\\n push();\\n rotate(-frameCount * 0.01);\\n stroke(17, 218, 211);\\n point(120, bass) ;\\n fill(17, 218, 211);\\n point(bass,300) ;\\n pop();\\n \\n push();\\n rotate(-frameCount * 0.01);//negative framecount allows points to spin counter clockwise\\n stroke(219, 162, 188);\\n point(550, bass) ;\\n point(430, mapTreble) ;\\n line( bass, 740, mouseY, 740 );\\n pop();\\n\\n }\\n}\",\n \"function FFTM(x,y){this.x=x;this.y=y;}\",\n \"function FFTM(x,y){this.x=x;this.y=y;}\",\n \"function initFourierImage() {\\r\\n //event listeners\\r\\n function loadImage(loc) {\\r\\n var start = +new Date();\\r\\n\\r\\n //placed in a callback so the UI has a chance to update\\r\\n disableButtons(function() {\\r\\n //draw the initial image\\r\\n var img = new Image();\\r\\n img.addEventListener('load', function() {\\r\\n //make each canvas the image's exact size\\r\\n dims[0] = img.width;\\r\\n dims[1] = img.height;\\r\\n for (var ai = 0; ai < 4; ai++) {\\r\\n canvases[ai] = $s('#canvas'+ai);\\r\\n canvases[ai].width = dims[0], canvases[ai].height = dims[1];\\r\\n ctxs[ai] = canvases[ai].getContext('2d');\\r\\n }\\r\\n\\r\\n //draw the image to the canvas\\r\\n ctxs[0].drawImage(img, 0, 0, img.width, img.height);\\r\\n\\r\\n //grab the pixels\\r\\n var imageData = ctxs[0].getImageData(0, 0, dims[0], dims[1]);\\r\\n var h_es = []; //the h values\\r\\n for (var ai = 0; ai < imageData.data.length; ai+=4) {\\r\\n //greyscale, so you only need every 4th value\\r\\n h_es.push(imageData.data[ai]);\\r\\n }\\r\\n\\r\\n //initialize the h values\\r\\n h = function(n, m) {\\r\\n if (arguments.length === 0) return h_es;\\r\\n\\r\\n var idx = n*dims[0] + m;\\r\\n return h_es[idx];\\r\\n }; //create it in function form to make the code match the math\\r\\n\\r\\n enableButtons();\\r\\n\\r\\n var duration = +new Date() - start;\\r\\n console.log('It took '+duration+'ms to draw the image.');\\r\\n });\\r\\n img.src = loc;\\r\\n });\\r\\n }\\r\\n $s('#draw-cs-btn').addEventListener('click', function() {\\r\\n loadImage('cs.png');\\r\\n });\\r\\n $s('#draw-circle-btn').addEventListener('click', function() {\\r\\n loadImage('circle.png');\\r\\n });\\r\\n $s('#draw-grace-btn').addEventListener('click', function() {\\r\\n loadImage('grace.png');\\r\\n });\\r\\n\\r\\n $s('#transform-btn').addEventListener('click', function() {\\r\\n var start = +new Date();\\r\\n\\r\\n if (!h()) return alert('You need to draw an image to canvas 1 first.');\\r\\n\\r\\n //placed in a callback so the UI has a chance to update\\r\\n disableButtons(function() {\\r\\n //compute the h hat values\\r\\n var h_hats = [];\\r\\n FFT(h_hats, h());\\r\\n h_hats = shiftFFT(h_hats);\\r\\n\\r\\n //get the largest magnitude\\r\\n var maxMagnitude = 0;\\r\\n for (var ai = 0; ai < h_hats.length; ai++) {\\r\\n var mag = h_hats[ai].magnitude();\\r\\n if (mag > maxMagnitude) {\\r\\n maxMagnitude = mag;\\r\\n }\\r\\n }\\r\\n\\r\\n //apply a low or high pass filter\\r\\n var lpr = parseInt($s('#low-freq-radius').value); //low pass radius\\r\\n var hpr = parseInt($s('#high-freq-radius').value); //high \\\" \\\"\\r\\n var N = dims[1], M = dims[0];\\r\\n for (var k = 0; k < N; k++) {\\r\\n for (var l = 0; l < M; l++) {\\r\\n var idx = k*M + l;\\r\\n var dist = Math.pow(k-M/2, 2) + Math.pow(l-N/2, 2);\\r\\n if (dist > lpr*lpr && isNaN(hpr) ||\\r\\n dist < hpr*hpr && isNaN(lpr) ||\\r\\n dist < lpr*lpr && !isNaN(lpr) && !isNaN(hpr) ||\\r\\n dist > hpr*hpr && !isNaN(lpr) && !isNaN(hpr)) {\\r\\n h_hats[idx] = new Complex(0, 0);\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n //store them in a nice function to match the math\\r\\n $h = function(k, l) {\\r\\n if (arguments.length === 0) return h_hats;\\r\\n \\r\\n var idx = k*dims[0] + l;\\r\\n return h_hats[idx];\\r\\n };\\r\\n\\r\\n //draw the pixels\\r\\n var currImageData = ctxs[1].getImageData(0, 0, dims[0], dims[1]);\\r\\n var logOfMaxMag = Math.log(cc*maxMagnitude+1);\\r\\n for (var k = 0; k < dims[1]; k++) {\\r\\n for (var l = 0; l < dims[0]; l++) {\\r\\n var idxInPixels = 4*(dims[0]*k + l);\\r\\n currImageData.data[idxInPixels+3] = 255; //full alpha\\r\\n var color = Math.log(cc*$h(k, l).magnitude()+1);\\r\\n color = Math.round(255*(color/logOfMaxMag));\\r\\n for (var c = 0; c < 3; c++) { //RGB are the same, lol c++\\r\\n currImageData.data[idxInPixels+c] = color;\\r\\n }\\r\\n }\\r\\n }\\r\\n ctxs[1].putImageData(currImageData, 0, 0);\\r\\n\\r\\n enableButtons();\\r\\n\\r\\n var duration = +new Date() - start;\\r\\n console.log('It took '+duration+'ms to compute the FT.');\\r\\n });\\r\\n });\\r\\n\\r\\n $s('#reconstruct-btn').addEventListener('click', function() {\\r\\n var start = +new Date();\\r\\n\\r\\n if (!$h()) {\\r\\n return alert('You first need to compute the Fourier transform.');\\r\\n }\\r\\n\\r\\n //placed in a callback so the UI has a chance to update\\r\\n disableButtons(function() {\\r\\n //compute the h prime values\\r\\n var h_primes = [];\\r\\n var h_hats = $h();\\r\\n h_hats = unshiftFFT(h_hats);\\r\\n invFFT(h_primes, h_hats);\\r\\n\\r\\n //store them in a nice function to match the math\\r\\n h_ = function(n, m) {\\r\\n if (arguments.length === 0) return h_primes;\\r\\n\\r\\n var idx = n*dims[0] + m;\\r\\n return round(h_primes[idx], 2);\\r\\n };\\r\\n\\r\\n //draw the pixels\\r\\n var currImageData = ctxs[2].getImageData(0, 0, dims[0], dims[1]);\\r\\n for (var n = 0; n < dims[1]; n++) {\\r\\n for (var m = 0; m < dims[0]; m++) {\\r\\n var idxInPixels = 4*(dims[0]*n + m);\\r\\n currImageData.data[idxInPixels+3] = 255; //full alpha\\r\\n for (var c = 0; c < 3; c++) { //RGB are the same, lol c++\\r\\n currImageData.data[idxInPixels+c] = h_(n, m);\\r\\n }\\r\\n }\\r\\n }\\r\\n ctxs[2].putImageData(currImageData, 0, 0);\\r\\n\\r\\n enableButtons();\\r\\n\\r\\n var duration = +new Date() - start;\\r\\n console.log('It took '+duration+'ms to reconstruct the image.');\\r\\n });\\r\\n });\\r\\n\\r\\n $s('#difference-btn').addEventListener('click', function() {\\r\\n var start = +new Date();\\r\\n\\r\\n if (!h_()) {\\r\\n return alert('You haven\\\\'t reconstructed an image yet.');\\r\\n }\\r\\n\\r\\n //placed in a callback so the UI has a chance to update\\r\\n disableButtons(function() {\\r\\n //find the range of the errors\\r\\n var minError = Infinity;\\r\\n var maxError = 0;\\r\\n for (var n = 0; n < dims[1]; n++) {\\r\\n for (var m = 0; m < dims[0]; m++) {\\r\\n var error = h_(n, m) - h(n, m);\\r\\n if (error < minError) minError = error;\\r\\n if (error > maxError) maxError = error;\\r\\n }\\r\\n }\\r\\n\\r\\n //draw the pixels\\r\\n var currImageData = ctxs[3].getImageData(0, 0, dims[0], dims[1]);\\r\\n for (var n = 0; n < dims[1]; n++) {\\r\\n for (var m = 0; m < dims[0]; m++) {\\r\\n var idxInPixels = 4*(dims[0]*n + m); //idx in the pixels array\\r\\n var error = h_(n, m) - h(n, m);\\r\\n var color = getCoolColor(error, [minError, maxError]);\\r\\n for (var c = 0; c < 3; c++) {\\r\\n currImageData.data[idxInPixels+c] = color[c];\\r\\n }\\r\\n currImageData.data[idxInPixels+3] = 255; // fullalpha\\t\\t\\r\\n }\\r\\n }\\r\\n ctxs[3].putImageData(currImageData, 0, 0);\\r\\n\\r\\n enableButtons();\\r\\n\\r\\n var duration = +new Date() - start;\\r\\n console.log('It took '+duration+'ms to compute the difference.');\\r\\n });\\r\\n });\\r\\n\\r\\n //initialize the working variables\\r\\n canvases = [], ctxs = [];\\r\\n h = $h = h_ = function() { return false; };\\r\\n}\",\n \"function fDCTQuant(data, fdtbl)\\n {\\n var d0, d1, d2, d3, d4, d5, d6, d7;\\n /* Pass 1: process rows. */\\n var dataOff=0;\\n var i;\\n var I8 = 8;\\n var I64 = 64;\\n for (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n //outputfDCTQuant[i] = fround(fDCTQuant);\\n \\n }\\n return outputfDCTQuant;\\n }\",\n \"function transformRadix2(real, imag) {\\n\\t // Initialization\\n\\t if (real.length != imag.length) throw \\\"Mismatched lengths\\\";\\n\\t var n = real.length;\\n\\t if (n == 1) // Trivial transform\\n\\t return;\\n\\t var levels = -1;\\n\\t for (var i = 0; i < 32; i++) {\\n\\t if (1 << i == n) levels = i; // Equal to log2(n)\\n\\t }\\n\\t if (levels == -1) throw \\\"Length is not a power of 2\\\";\\n\\t var cosTable = new Array(n / 2);\\n\\t var sinTable = new Array(n / 2);\\n\\t for (var i = 0; i < n / 2; i++) {\\n\\t cosTable[i] = Math.cos(2 * Math.PI * i / n);\\n\\t sinTable[i] = Math.sin(2 * Math.PI * i / n);\\n\\t }\\n\\n\\t // Bit-reversed addressing permutation\\n\\t for (var i = 0; i < n; i++) {\\n\\t var j = reverseBits(i, levels);\\n\\t if (j > i) {\\n\\t var temp = real[i];\\n\\t real[i] = real[j];\\n\\t real[j] = temp;\\n\\t temp = imag[i];\\n\\t imag[i] = imag[j];\\n\\t imag[j] = temp;\\n\\t }\\n\\t }\\n\\n\\t // Cooley-Tukey decimation-in-time radix-2 FFT\\n\\t for (var size = 2; size <= n; size *= 2) {\\n\\t var halfsize = size / 2;\\n\\t var tablestep = n / size;\\n\\t for (var i = 0; i < n; i += size) {\\n\\t for (var j = i, k = 0; j < i + halfsize; j++, k += tablestep) {\\n\\t var tpre = real[j + halfsize] * cosTable[k] + imag[j + halfsize] * sinTable[k];\\n\\t var tpim = -real[j + halfsize] * sinTable[k] + imag[j + halfsize] * cosTable[k];\\n\\t real[j + halfsize] = real[j] - tpre;\\n\\t imag[j + halfsize] = imag[j] - tpim;\\n\\t real[j] += tpre;\\n\\t imag[j] += tpim;\\n\\t }\\n\\t }\\n\\t }\\n\\n\\t // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\\n\\t function reverseBits(x, bits) {\\n\\t var y = 0;\\n\\t for (var i = 0; i < bits; i++) {\\n\\t y = y << 1 | x & 1;\\n\\t x >>>= 1;\\n\\t }\\n\\t return y;\\n\\t }\\n\\t}\",\n \"function calculateNext(data) {\\n \\n var hthv, hthw, hthso, hthsi, hthvm, htho, hthvinf, hthwinf,\\n tvm, ts, to, twp, twm, tso, tsi, vinf, winf, dv, dw, ds;\\n \\n cS.istim = _s1s2Stimulus(count,data);\\n\\n // Step functions\\n hthv = (cS.u >= cS.thv);\\n hthw = (cS.u >= cS.thw);\\n hthso = (cS.u >= cS.thw);\\n hthsi = (cS.u >= cS.thw);\\n hthvm = (cS.u >= cS.thvm);\\n htho = (cS.u >= cS.tho);\\n hthvinf = (cS.u >= cS.thvm);\\n hthwinf = (cS.u >= cS.tho); //thwinf = tho.\\n\\n // Multi-part terms\\n tvm = (1 - hthvm) * cS.tv1m + hthvm * cS.tv2m;\\n ts = (1 - hthw) * cS.ts1 + hthw * cS.ts2;\\n to = (1 - htho) * cS.to1 + htho * cS.to2;\\n twp = cS.tw1p + (cS.tw2p - cS.tw1p) * (1 + Math.tanh((cS.w - cS.wcp) * cS.kwp)) / 2;\\n twm = cS.tw1m + (cS.tw2m - cS.tw1m) * (1 + Math.tanh((cS.u - cS.uwm) * cS.kwm)) / 2;\\n tso = cS.tso1 + (cS.tso2 - cS.tso1) * (1 + Math.tanh((cS.u - cS.uso) * cS.kso)) / 2;\\n tsi = cS.tsi1 + (cS.tsi1 - cS.tsi1) * (1 + Math.tanh((cS.s - cS.sc) * cS.ksi)) / 2;\\n vinf = 1 - hthvinf;\\n winf = (1 - hthwinf) * (1 - cS.u / cS.twinf) + hthwinf * cS.winfstar;\\n\\n // Gate evolution\\n dv = (1 - hthv) * (vinf - cS.v) / tvm - hthv * cS.v / cS.tvp;\\n dw = (1 - hthw) * (winf - cS.w) / twm - hthw * cS.w / twp;\\n ds = ((1 + Math.tanh((cS.u - cS.us) * cS.ks)) / 2 - cS.s) / ts;\\n cS.v = cS.v + cS.timestep * dv;\\n cS.w = cS.w + cS.timestep * dw;\\n cS.s = cS.s + cS.timestep * ds;\\n \\n // Currents\\n cS.xfi = -cS.v * hthv * (cS.u - cS.thv) * (cS.uu - cS.u) / cS.tfi;\\n cS.xso = (cS.u - cS.uo) * (1 - hthso) / to + hthso / tso;\\n cS.xsi = -hthsi * cS.w * cS.s / tsi;\\n \\n // update u using forward Euler\\n cS.u = cS.u - cS.timestep * (cS.xfi + cS.xso + cS.xsi - cS.istim);\\n \\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n \\n // iterate the count\\n count++;\\n \\n return data; \\n }\",\n \"function fDCTQuant(data, fdtbl)\\n\\t {\\n\\t var d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t /* Pass 1: process rows. */\\n\\t var dataOff=0;\\n\\t var i;\\n\\t var I8 = 8;\\n\\t var I64 = 64;\\n\\t for (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t //outputfDCTQuant[i] = fround(fDCTQuant);\\n\\t \\n\\t }\\n\\t return outputfDCTQuant;\\n\\t }\",\n \"function Poll_FFT_DTMF()\\r\\n{\\r\\n //44100 / 1024 = 43,06 Hz saltos 21,533203125 Hz\\r\\n try\\r\\n {\\r\\n if (gb_use_mic_dtmf === true)\\r\\n { \\r\\n if ((typeof gb_mic === 'undefined') || (typeof gb_fft === 'undefined'))\\r\\n {\\r\\n\\treturn;\\r\\n }\\r\\n\\t \\r\\n let spectrum = gb_fft.analyze();\\r\\n let row= -1;\\r\\n let col= -1; \\r\\n \\r\\n if (spectrum[31] > 250){row = 0;}\\r\\n else{\\r\\n if (spectrum[35] > 250){row = 1;}\\r\\n else{\\r\\n if (spectrum[39] > 250){row = 2;}\\r\\n else{\\r\\n if (spectrum[43] > 250){row = 3;}\\r\\n\\t }\\r\\n }\\r\\n }\\r\\n \\r\\n if (spectrum[55] > 250){col = 0;}\\r\\n else{\\r\\n if (spectrum[61] > 250){col = 1;}\\r\\n else{\\r\\n if (spectrum[67] > 250){col = 2;}\\r\\n else{\\r\\n if (spectrum[76] > 250){col = 3;}\\r\\n\\t }\\r\\n }\\r\\n }\\r\\n \\t\\t\\r\\n if ((row>-1) && (col>-1))\\r\\n {\\r\\n gb_fft_dtmf = RowColToDtmf(row,col);\\r\\n gb_cadDTMF = gb_fft_dtmf;\\r\\n if (gb_fft_dtmf_antes != gb_fft_dtmf)\\r\\n\\t{\\t\\r\\n gb_fft_dtmf_antes = gb_fft_dtmf;\\r\\n gb_cad_areaRX += gb_fft_dtmf;\\t\\r\\n\\t gb_buf_rcv_dtmf += gb_fft_dtmf;\\r\\n\\t gb_event_new_data_dtmf = true;\\r\\n\\t if (gb_fft_dtmf === '#')\\r\\n\\t {\\r\\n\\t gb_begin_sync_dtmf= true;\\r\\n }\\r\\n\\t switch (gb_fft_dtmf)\\r\\n\\t {\\r\\n\\t case '#': gb_begin_sms = true; gb_end_sms = false; break;\\r\\n\\t case '*': gb_end_sms = true; gb_begin_sms = false; break;\\t \\r\\n\\t }\\r\\n\\t if (gb_fft_dtmf === '*')\\r\\n\\t {\\r\\n\\t \\r\\n\\t }\\r\\n gb_forceDraw = true;\\r\\n }\\r\\n }\\r\\n else\\r\\n {\\r\\n gb_fft_dtmf= gb_fft_dtmf_antes= '';\\r\\n }\\r\\n }\\r\\n }\\r\\n catch(err)\\r\\n {\\r\\n DebugLog(err.message.toString());\\r\\n } \\r\\n}\",\n \"function tone(hh, peak) {\\n let spectrum = junco_fft.analyze();\\n let hh_value = spectrum[hh]; //TODO:ersetzten durch eigenes highhead value \\n debugValues += hh_value.toString()\\n debugValues += \\\" - \\\"\\n if (lastHHval > hh_value) { //vergleichen und schauen in welche Richtung der Track läuft \\n if (direction_hh > 0 && lastHHval > peak) { //TODO: anderer Wert\\n if (hh === 131) { \\n if (spacer < 2 && timer < 5) {\\n let step = new Step(hh * 6, Math.floor(peak * 0.5));\\n stair.push(step);\\n spacer++;\\n if (spacer === 1) {\\n timer = 10;\\n } else if (spacer === 2) {\\n timer = 10;\\n }\\n } else {\\n return;\\n }\\n }\\n }\\n if (hh === 104) {\\n if (spacer < 1 && timer === 0) {\\n let step = new Step(hh * 6, Math.floor(peak * 0.5));\\n stair.push(step);\\n spacer++;\\n console.log(spacer)\\n timer = 15;\\n } else {\\n return;\\n }\\n }\\n if (hh === 87) {\\n if (spacer < 1 && timer === 0) {\\n let step = new Step(hh * 6, Math.floor(peak * 0.4));\\n stair.push(step);\\n spacer++;\\n console.log(spacer)\\n timer = 15;\\n } else {\\n return;\\n }\\n }\\n if (hh === 65) {\\n if (spacer < 2 && timer < 5) {\\n let step = new Step(hh * 6, Math.floor(peak));\\n stair.push(step);\\n spacer++;\\n if (spacer === 1) {\\n timer = 10;\\n } else if (spacer === 2) {\\n timer = 20;\\n }\\n } else {\\n return;\\n }\\n }\\n direction_hh = -1; //man schaut auf welcher Seite des Ausschlags man ist\\n } else {\\n direction_hh = 1;\\n }\\n lastHHval = hh_value;\\n}\",\n \"function workerThreadFn() {\\n\\n let that = {};\\n\\n that.n = 1024;\\n that.inverse = true;\\n\\n that.fft = new FFT.complex(that.n, that.inverse);\\n\\n parentPort.on('message', (payloadIn)=>{\\n // let a = msg.bufferInput;\\n // console.log(msg);\\n\\n let chunkCopy = payloadIn.chunk;\\n\\n const ffttype = 'complex';\\n\\n const width = 8*2;\\n\\n // how many uint32's (how many samples) did we get\\n const sz = 1024;\\n\\n\\n var dataView = new DataView(chunkCopy);\\n\\n\\n // it's possible that a proxy may be faster here instead of building bufferInput/fftInput\\n // https://ponyfoo.com/articles/es6-proxies-in-depth\\n \\n let bufferInput = new ArrayBuffer(sz*width); // in bytes\\n let bufferOutput = new ArrayBuffer(sz*width); // in bytes\\n\\n // this.w.postMessage(bufferInput,[bufferInput]);\\n\\n\\n let fftInput = new Float64Array(bufferInput);\\n let fftOutput = new Float64Array(bufferOutput);\\n // let uint8_out_view = new Uint8Array(bufferOutput);\\n\\n\\n // in place modify of the copy\\n for(let i = 0; i < sz*2; i+=2) {\\n let re = dataView.getFloat64(i*8, true);// * this.gain;\\n let im = dataView.getFloat64((i*8)+8, true);// * this.gain;\\n // console.log('re: ' + re + ' im: ' + im);\\n fftInput[i] = re;\\n fftInput[i+1] = im;\\n }\\n\\n that.fft.simple(fftOutput, fftInput, ffttype);\\n\\n const payloadOut = {id:payloadIn.id, bufferOutput:bufferOutput};\\n\\n parentPort.postMessage(payloadOut, [payloadOut.bufferOutput]);\\n // console.log('finished');\\n\\n\\n });\\n}\",\n \"function fDCTQuant(data, fdtbl)\\n {\\n var d0, d1, d2, d3, d4, d5, d6, d7;\\n /* Pass 1: process rows. */\\n var dataOff=0;\\n var i;\\n var I8 = 8;\\n var I64 = 64;\\n for (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n //outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n }\\n return outputfDCTQuant;\\n }\",\n \"function TMhs(htma,sol,T_BaseFrame){\\n var T0 = [];\\n for(var i=0;i>8&255),V(255&t)}function X(t,e,n,r,i){for(var o,s=i[0],a=i[240],h=function(t,e){var n,r,i,o,s,a,h,c,l,u,f=0;for(l=0;l<8;++l){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],s=t[f+4],a=t[f+5],h=t[f+6];var d=n+(c=t[f+7]),p=n-c,g=r+h,m=r-h,y=i+a,w=i-a,v=o+s,b=o-s,x=d+v,S=d-v,I=g+y,k=g-y;t[f]=x+I,t[f+4]=x-I;var _=.707106781*(k+S);t[f+2]=S+_,t[f+6]=S-_;var C=.382683433*((x=b+w)-(k=m+p)),A=.5411961*x+C,T=1.306562965*k+C,F=.707106781*(I=w+m),P=p+F,O=p-F;t[f+5]=O+A,t[f+3]=O-A,t[f+1]=P+T,t[f+7]=P-T,f+=8}for(l=f=0;l<8;++l){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],s=t[f+32],a=t[f+40],h=t[f+48];var E=n+(c=t[f+56]),q=n-c,B=r+h,D=r-h,U=i+a,j=i-a,R=o+s,M=o-s,N=E+R,z=E-R,L=B+U,H=B-U;t[f]=N+L,t[f+32]=N-L;var W=.707106781*(H+z);t[f+16]=z+W,t[f+48]=z-W;var G=.382683433*((N=M+j)-(H=D+q)),V=.5411961*N+G,Y=1.306562965*H+G,X=.707106781*(L=j+D),K=q+X,J=q-X;t[f+40]=J+V,t[f+24]=J-V,t[f+8]=K+Y,t[f+56]=K-Y,f++}for(l=0;l<64;++l)u=t[l]*e[l],Q[l]=0>4;for(var m=1;m<=f;++m)G(a);g&=15}o=32767+v[d],G(i[(g<<4)+w[o]]),G(y[o]),d++}return 63!=u&&G(s),n}function K(t){if(t<=0&&(t=1),100>3)*v+(d=4*(7&g)),w<=b+p&&(f-=v*(b+1+p-w)),v<=a+d&&(f-=a+d-v+4),h=m[f++],c=m[f++],l=m[f++],q[g]=(U[h]+U[c+256>>0]+U[l+512>>0]>>16)-128,B[g]=(U[h+768>>0]+U[c+1024>>0]+U[l+1280>>0]>>16)-128,D[g]=(U[h+1280>>0]+U[c+1536>>0]+U[l+1792>>0]>>16)-128;i=X(q,T,i,S,k),o=X(B,F,o,I,_),s=X(D,F,s,I,_),a+=32}b+=8}if(0<=E){var x=[];x[1]=E+1,x[0]=(1<>0]=38470*t,U[t+512>>0]=7471*t+32768,U[t+768>>0]=-11059*t,U[t+1024>>0]=-21709*t,U[t+1280>>0]=32768*t+8421375,U[t+1536>>0]=-27439*t,U[t+1792>>0]=-5329*t}(),K(t),(new Date).getTime()}()}\",\n \"calculateTCUs (initial_directions, initial_PCEs) {\\r\\n // Ensure that the TCU volumes are up to date. Here we are assuming the user movement volumes have already been converted to their PCE.\\r\\n if (initial_directions == -1) {\\r\\n var direction_array = PROJECT.getIntersectionByID(this._intersection_ID).getZoneByIndex(this._zone_ID - 1).getDirectionArray();\\r\\n var PCE_table = PROJECT.getIntersectionByID(this._intersection_ID).getZoneByIndex(this._zone_ID - 1).getZonePCEs().getPCEArray();\\r\\n } else {\\r\\n var direction_array = initial_directions;\\r\\n var PCE_table = initial_PCEs.getPCEArray();\\r\\n console.log(direction_array);\\r\\n console.log(PCE_table);\\r\\n }\\r\\n \\r\\n for (var direction = 0; direction < 4; direction++) {\\r\\n \\r\\n var right_vol = PCE_table[direction].getRight();\\r\\n var through_vol = PCE_table[direction].getThrough();\\r\\n var left_vol = PCE_table[direction].getLeft();\\r\\n \\r\\n var right_turn_lanes = direction_array[direction].getRightTurn();\\r\\n var through_lanes = direction_array[direction].getThrough();\\r\\n var left_turn_lanes = direction_array[direction].getLeftTurn();\\r\\n var shared_right = direction_array[direction].getSharedRight();\\r\\n var shared_left = direction_array[direction].getSharedLeft();\\r\\n var chan_right = direction_array[direction].getChannelizedRight();\\r\\n \\r\\n // Gets the direction exactly 2 away from 'direction'; masking by three returns only the 1s and 2s bits (0 - 3)\\r\\n var opposing_throughs_vol = PCE_table[(direction + 2) & 3].getThrough();\\r\\n var opposing_right_vol = PCE_table[(direction + 2) & 3].getRight();\\r\\n var opposing_through_lanes = direction_array[(direction + 2) & 3].getThrough();\\r\\n var opposing_right_lanes = direction_array[(direction + 2) & 3].getRightTurn();\\r\\n var opposing_chan_right = direction_array[(direction + 2) & 3].getChannelizedRight();\\r\\n var opposing_left_lanes = direction_array[(direction + 2) & 3].getLeftTurn();\\r\\n var opposing_shared_left = direction_array[(direction + 2) & 3].getSharedLeft();\\r\\n \\r\\n var this_phase_split;\\r\\n \\r\\n if (direction % 2 === 0 && !this._north_south_split_override) {\\r\\n this._north_south_split_phase = (left_turn_lanes > 0 && shared_left) ? true : \\r\\n (opposing_left_lanes > 0 && opposing_shared_left) ? true : false;\\r\\n this_phase_split = this._north_south_split_phase;\\r\\n } else if (!this._east_west_split_override) {\\r\\n this._east_west_split_phase = (left_turn_lanes > 0 && shared_left) ? true : \\r\\n (opposing_left_lanes > 0 && opposing_shared_left) ? true : false;\\r\\n this_phase_split = this._east_west_split_phase;\\r\\n }\\r\\n \\r\\n if (this_phase_split) {\\r\\n this._protected_lefts[direction] = false;\\r\\n } else {\\r\\n this._protected_lefts[direction] = left_turn_lanes > 1 ? true : \\r\\n (left_vol >= 240 && left_turn_lanes == 1) ? true : \\r\\n (opposing_through_lanes == 1 && (left_vol * ( opposing_throughs_vol + opposing_right_vol * (1 - opposing_chan_right) ) ) > 50000) ? true :\\r\\n (opposing_through_lanes == 2 && (left_vol * ( opposing_throughs_vol + opposing_right_vol * (1 - opposing_chan_right) ) ) > 90000) ? true :\\r\\n (opposing_through_lanes == 3 && (left_vol * ( opposing_throughs_vol + opposing_right_vol * (1 - opposing_chan_right) ) ) > 110000) ? true :\\r\\n (opposing_through_lanes > 3 && left_turn_lanes > 0) ? true:\\r\\n false;\\r\\n }\\r\\n \\r\\n var throughs = through_vol;\\r\\n var rights = 0;\\r\\n var lefts = 0;\\r\\n \\r\\n if (!chan_right) {\\r\\n // Calculates % of right-turn volume in exclusive right-turn lanes and shared through-right\\r\\n var right_vol_splitfrac = ( (1 + (right_turn_lanes - shared_right)) / (right_turn_lanes + 1) );\\r\\n\\r\\n // Add shared rights to through volume\\r\\n throughs = Math.round(throughs + ((right_vol / UNIVERSAL_RIGHT_TURN_ADJUSTMENT_FACTOR ) * (1 - right_vol_splitfrac) ) );\\r\\n\\r\\n // Will be zero if no exclusive lanes; = right_vol if no shared right; something between 0 and right_vol if shared and exclusive rights exist for this approach\\r\\n rights = Math.round(right_vol * right_vol_splitfrac / right_turn_lanes) * (1 - chan_right);\\r\\n // Old version of this line; allows rights to be channelized AND shared. Probably an unnecessary case\\r\\n // rights = Math.round(right_vol * (right_vol_splitfrac * (1 - chan_right)) / right_turn_lanes);\\r\\n }\\r\\n \\r\\n // This needs to be adjusted for phase effect.\\r\\n var left_turn_factor = 5;\\r\\n var left_vol_splitfrac = (1 + (left_turn_lanes - shared_left)) / (left_turn_lanes + 1);\\r\\n \\r\\n throughs = throughs + (((left_vol * left_turn_factor) / UNIVERSAL_LEFT_TURN_ADJUSTMENT_FACTOR ) * (1 - left_vol_splitfrac) );\\r\\n var lefts = Math.round(left_vol * left_vol_splitfrac / left_turn_lanes);\\r\\n \\r\\n // Convert through volume to a flow rate\\r\\n throughs = Math.round(throughs / through_lanes);\\r\\n \\r\\n /////// NOW SET THE VOLUMES IN this._TCUs\\r\\n this._TCUs.getDirectionByIndex(direction).setLeft(lefts);\\r\\n this._TCUs.getDirectionByIndex(direction).setThrough(throughs);\\r\\n this._TCUs.getDirectionByIndex(direction).setRight(rights);\\r\\n \\r\\n console.log(this);\\r\\n } \\r\\n this.calculateCapacities();\\r\\n }\",\n \"function draw() {\\n background(0, 0, 0, 0.031);\\n translate(posX ? posX : 0, posY ? posY : 0)\\n stroke(78, 255, 255)\\n rect(0.9 * width, 0, 10, accumulator);\\n// fill(0,255,0,0.05)\\n // fft.smooth();\\n // fft.log\\n // noise.start();\\n spectrum = fft.analyze();\\n chunkSize = Math.floor(spectrum.length / population);\\n reducedSpectrum = arrayChunk(spectrum, chunkSize);\\n // con\\n reducedSpectrum.map((cluster, index) => {\\n let sum = cluster.reduce((accum, element) => {\\n return accum + element;\\n });\\n // then((sum) => {\\n let val = sum / cluster.length;\\n // console.log(val)\\n if (index < population) {\\n var comp = map(index, 0, population, 360, 0);\\n stroke(comp, 255, 255);\\n var r = map(val, 0, 255, 0.1, 125);\\n x = map(index, 0, population, 0, width);\\n y = map(index, 0, population, height, 0);\\n ellipse(width / 2 + ants[index].dist, y , r);\\n random(1) < 0.13 ? ants[index].move() : null;\\n } else {\\n accumulator += val;\\n }\\n // })\\n // })\\n })\\n\\n // for (i = 0; i < spectrum.length; i++) {\\n // if (i < population) {\\n // var comp = map(i, 0, population, 360, 0);\\n // stroke(comp, 255, 255);\\n // var r = map(spectrum[i], 0, 255, 0.1, 125);\\n // x = map(i, 0, population, 0, width);\\n // y = map(i, 0, population, height, 0);\\n // ellipse(width / 2 + ants[i].dist, y, r);\\n // ants[i].move();\\n // } else {\\n // accumulator += spectrum[i];\\n // }\\n // }\\n}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"twistU() {\\n this.fourCycle(this.cornerLoc, 0, 2, 4, 6, this.cornerOrient, 0, 0, 0, 0, 3);\\n this.fourCycle(this.edgeLoc, 0, 3, 6, 9, this.edgeOrient, 1, 1, 1, 1, 2);\\n this.sideOrient[1] = (this.sideOrient[1] + 3) % 4;\\n }\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tvar I8 = 8;\\n\\t\\t\\tvar I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tvar I8 = 8;\\n\\t\\t\\tvar I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function fft_rx2 (re, im) {\\n let N = re.length;\\n if (N.toString(2) % 10) // return immediately if N is not power of 2\\n return;\\n else if (N <= 32) // if N is sufficiently small, compute dft directly\\n return dft_direct(re, im);\\n\\n let W = discrete_circle(N); // N evenly spaced points around the unit circle\\n im = im || re.map( a => 0 ); // set imaginary values to zero if not provided\\n\\n // compute N/2-point DFT for even and odd samples of input array\\n let S_1 = fft_rx2(...[re, im].map( a => a.filter( (_, i) => !(i % 2) ) ));\\n let S_2 = fft_rx2(...[re, im].map( a => a.filter( (_, i) => i % 2 ) ));\\n\\n // mutiply by twiddle factor. later, exploit symmetry W[k+N/2] = -W[k]\\n let G_2 = S_2.map( (a, k) => cpx_mult(a, W[k % N]) );\\n\\n // combine for all frequencies k in N/2-1\\n let X = [];\\n for (let k of xrange(N/2)) {\\n X[k] = cpx_add(S_1[k], G_2[k]);\\n X[k + N/2] = cpx_sub(S_1[k], G_2[k]);\\n }\\n\\n return X;\\n}\",\n \"function FluidField(canvas) {\\r\\n\\r\\n function lin_solve2(x, x0, y, y0, a, c)\\r\\n {\\r\\n if (a === 0 && c === 1) {\\r\\n for (var j=1 ; j <= height; j++) {\\r\\n var currentRow = j * rowSize;\\r\\n ++currentRow;\\r\\n for (var i = 0; i < width; i++) {\\r\\n x[currentRow] = x0[currentRow];\\r\\n y[currentRow] = y0[currentRow];\\r\\n ++currentRow;\\r\\n }\\r\\n }\\r\\n } else {\\r\\n var invC = 1/c;\\r\\n for (var k=0 ; k 0 && res < 1000000 && (wRes != width || hRes != height)) {\\r\\n width = wRes;\\r\\n height = hRes;\\r\\n reset();\\r\\n return true;\\r\\n }\\r\\n return false;\\r\\n }\\r\\n this.setResolution(1, 1);\\r\\n}\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tconst I8 = 8;\\n\\t\\t\\tconst I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tconst I8 = 8;\\n\\t\\t\\tconst I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tconst I8 = 8;\\n\\t\\t\\tconst I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tconst I8 = 8;\\n\\t\\t\\tconst I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function fDCTQuant(data, fdtbl)\\n\\t\\t{\\n\\t\\t\\tvar d0, d1, d2, d3, d4, d5, d6, d7;\\n\\t\\t\\t/* Pass 1: process rows. */\\n\\t\\t\\tvar dataOff=0;\\n\\t\\t\\tvar i;\\n\\t\\t\\tconst I8 = 8;\\n\\t\\t\\tconst I64 = 64;\\n\\t\\t\\tfor (i=0; i 0.0) ? ((fDCTQuant + 0.5)|0) : ((fDCTQuant - 0.5)|0);\\n\\t\\t\\t\\t//outputfDCTQuant[i] = fround(fDCTQuant);\\n\\n\\t\\t\\t}\\n\\t\\t\\treturn outputfDCTQuant;\\n\\t\\t}\",\n \"function createFFT(smoothing,bins){\\n // remember to call this function in setup\\n // creates new p5 FFT constructor\\n fft = new p5.FFT(smoothing,bins);\\n}\",\n \"function each( x, F, i0, i1 )\\n{\\n var len = x.length, argslen = arguments.length;\\n if ( argslen < 4 ) i1 = len-1;\\n if ( 0 > i1 ) i1 += len;\\n if ( argslen < 3 ) i0 = 0;\\n if ( i0 > i1 ) return x;\\n var i, k, l=i1-i0+1, l1, lr, r, q;\\n r=l&15; q=r&1;\\n if ( q ) F(x[i0], i0, x);\\n for (i=q; i 0.001) ? 0.32*(cS.v+47.13)/(1.0 - Math.exp(-0.1*(cS.v+47.13)) ): 3.2;\\n bm = 0.08*Math.exp(cS.v/(-11.0));\\n hlp = am+bm;\\n tau = 1.0/hlp;\\n expm_t = Math.exp(-cS.timestep/tau);\\n \\n mi_t = am/hlp;\\n zINa_t = cS.gNa*(cS.v - cC.ena);\\n expv_t = Math.exp(-cS.timestep/tauv_t);\\n \\n \\n /*CA gating variables */\\n \\n hlp = Math.sqrt(2.0*cC.pi);\\n hlp2= (cS.v-22.36)/16.6813;\\n ad = (14.9859/(16.6813*hlp))*Math.exp(-0.5*hlp2*hlp2);\\n hlp2 = (cS.v-6.2744)/14.93;\\n bd = 0.1471-((5.3/(14.93*hlp))*Math.exp(-0.5*hlp2*hlp2));\\n hlp = ad+bd;\\n Infi = ad/hlp;\\n zICa_t = cS.gCa*cC.fCa*Infi*(cS.v-cC.eca);\\n \\n af = 0.006872/(1.0+Math.exp((cS.v-6.1546)/6.1223));\\n hlp = 0.0687*Math.exp(-0.1081*(cS.v+9.8255)) + 0.0112;\\n hlp2 = 1.0+Math.exp(-0.2779*(cS.v+9.8255));\\n bf = hlp/hlp2 + 0.0005474;\\n hlp = af+bf;\\n tau = 1.0/hlp;\\n expff_t = Math.exp(-cS.timestep/tau);\\n fi_t = af/hlp;\\n \\n /*TO gating variables */\\n hlp = cS.v-42.2912;\\n hlp2 = 0.5266*Math.exp(-0.0166*hlp);\\n hlp3 = 1.0 + Math.exp(-0.0943*hlp);\\n ar = hlp2/hlp3;\\n hlp = 0.5149*Math.exp(-0.1344*(cS.v-5.0027)) + 0.00005186*cS.v;\\n hlp2 = 1.0 + Math.exp(-0.1348*(cS.v-0.00005186));\\n br = hlp/hlp2;\\n hlp = ar+br;\\n Infi = ar/hlp;\\n zIto_t= cS.gto*Infi*(cS.v-cC.eto);\\n hlp = cS.v + 34.2531;\\n hlp2 = 0.0721*Math.exp(-0.173*hlp)+0.00005612*cS.v;\\n hlp3 = 1.0+Math.exp(-0.1732*hlp);\\n ato = hlp2/hlp3;\\n hlp = cS.v + 34.0235;\\n hlp2 = 0.0767*Math.exp(-1.66E-9*hlp)+0.0001215*cS.v;\\n hlp3 = 1.0+Math.exp(-0.1604*hlp);\\n bto = hlp2/hlp3;\\n hlp = ato+bto;\\n tau = 1.0/hlp;\\n expto_t = Math.exp(-cS.timestep/tau);\\n toi_t = ato/hlp;\\n \\n /* IK gating variables */\\n expxx_t= Math.exp(-cS.timestep/(taux_t+40.0*(1.0-(Math.exp(160.0+cS.v*2.0)- Math.exp(-(160.0+cS.v*2.0)))/(Math.exp(160.0+cS.v*2.0)+ Math.exp(-(160.0+cS.v*2.0)))) ));\\n zIK_t = cS.gK*(cS.v- cC.ekr);\\n \\n cS.istim = _s1s2Stimulus(count, data);\\n \\n /* Gating variables */\\n cS.m = mi_t + ( cS.m - mi_t ) * expm_t;\\n cS.f = fi_t + ( cS.f - fi_t ) * expff_t;\\n cS.xv = vi_t + ( cS.xv - vi_t ) * expv_t;\\n cS.to = toi_t + ( cS.to - toi_t ) * expto_t;\\n cS.xx = xi_t + ( cS.xx - xi_t ) * expxx_t;\\n \\n /* The membrane currents */\\n cS.ica = cS.f*zICa_t;\\n cS.icab= zICab_t;\\n cS.ina = cS.gNa*cS.xv*cS.xv*cS.m*cS.m*cS.m*(cS.v - cC.ena);\\n cS.inab= zINab_t;\\n cS.ik = cS.xx*cS.xx*zIK_t;\\n cS.ik1 = zIK1_t;\\n cS.ito = cS.to*zIto_t;\\n cS.inaca = zINaCa1_t - cS.Cai*zINaCa2_t;\\n cS.inak = zINaK_t;\\n Itot= cS.ica+cS.icab+cS.ik1+cS.ik+cS.ina+cS.inab+cS.inaca+cS.inak+cS.ito-cS.istim;\\n \\n // \\n \\n /*if(count == 1){\\n xlap = cC.d_o_dx2*(2.0*v(i+1)-2.0*cS.v);\\n }\\n else if (count == 1){\\n xlap = cC.d_o_dx2*(2.0*v(i-1)-2.0*cS.v)\\n }\\n else{\\n xlap = cC.d_o_dx2*(v(i+1)-2.0*cS.v+v(i-1))\\n }*/\\n \\n /* The membrane potential */\\n \\n //cS.v = cS.v - cS.timestep*Itot+xlap; \\n cS.v = cS.v - cS.timestep*Itot;\\n \\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n \\n // iterate the count\\n count++;\\n return data; \\n }\",\n \"constructor({audioCtx, fftSize, carFreq, modAmpl, modFreq, visualCtx}) {\\n this.audioCtx = audioCtx;\\n this,fftSize = fftSize;\\n this.carFreq = carFreq;\\n this.modAmpl = modAmpl;\\n this.modFreq = modFreq;\\n this.visualCtx = visualCtx;\\n this.play = false;\\n\\n\\n this.animate;\\n this.analyserNode = audioCtx.createAnalyser();\\n this.analyserNode.smoothingTimeConstant = 0.0;\\n this.analyserNode.fftSize = fftSize;\\n\\n // Create the array for the data values\\n this.frequencyArray = new Uint8Array(this.analyserNode.frequencyBinCount);\\n\\n // Uses the chroma.js library by Gregor Aisch to create a color gradient\\n // download from https://github.com/gka/chroma.js\\n this.colorScale = new chroma.scale('Spectral').domain([1,0]);\\n // Global Variables for Drawing\\n this.column = 0;\\n this.canvasWidth = 800;\\n this.canvasHeight = 256;\\n }\",\n \"function Ku(t) {\\n for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];\\n for (var r = 0, i = e; r < i.length; r++) {\\n var o = i[r];\\n t = o.Yf(t);\\n }\\n return t;\\n}\",\n \"_precompute() {\\n\\t\\t\\tconst encTable = this._tables[0];\\n\\t\\t\\tconst decTable = this._tables[1];\\n\\t\\t\\tconst sbox = encTable[4];\\n\\t\\t\\tconst sboxInv = decTable[4];\\n\\t\\t\\tconst d = [];\\n\\t\\t\\tconst th = [];\\n\\t\\t\\tlet xInv, x2, x4, x8;\\n\\n\\t\\t\\t// Compute double and third tables\\n\\t\\t\\tfor (let i = 0; i < 256; i++) {\\n\\t\\t\\t\\tth[(d[i] = i << 1 ^ (i >> 7) * 283) ^ i] = i;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (let x = xInv = 0; !sbox[x]; x ^= x2 || 1, xInv = th[xInv] || 1) {\\n\\t\\t\\t\\t// Compute sbox\\n\\t\\t\\t\\tlet s = xInv ^ xInv << 1 ^ xInv << 2 ^ xInv << 3 ^ xInv << 4;\\n\\t\\t\\t\\ts = s >> 8 ^ s & 255 ^ 99;\\n\\t\\t\\t\\tsbox[x] = s;\\n\\t\\t\\t\\tsboxInv[s] = x;\\n\\n\\t\\t\\t\\t// Compute MixColumns\\n\\t\\t\\t\\tx8 = d[x4 = d[x2 = d[x]]];\\n\\t\\t\\t\\tlet tDec = x8 * 0x1010101 ^ x4 * 0x10001 ^ x2 * 0x101 ^ x * 0x1010100;\\n\\t\\t\\t\\tlet tEnc = d[s] * 0x101 ^ s * 0x1010100;\\n\\n\\t\\t\\t\\tfor (let i = 0; i < 4; i++) {\\n\\t\\t\\t\\t\\tencTable[i][x] = tEnc = tEnc << 24 ^ tEnc >>> 8;\\n\\t\\t\\t\\t\\tdecTable[i][s] = tDec = tDec << 24 ^ tDec >>> 8;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Compactify. Considerable speedup on Firefox.\\n\\t\\t\\tfor (let i = 0; i < 5; i++) {\\n\\t\\t\\t\\tencTable[i] = encTable[i].slice(0);\\n\\t\\t\\t\\tdecTable[i] = decTable[i].slice(0);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function setup() {\\n createCanvas(700, 300);\\n fft = new p5.FFT();\\n \\n basso=[50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46, 50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46, 50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46, 50, 50, 45, 45, 47, 47, 43, 43, 44, 44, 38, 38, 44, 44, 46, 46]; // the Basso Continuo\\n \\n violino=[78, 78, 76, 76, 74, 74, 73, 73, 71, 71, 69, 69, 71, 71, 73, 73, 74, 74, 73, 73, 71, 71, 69, 69, 67, 67, 66, 66, 67, 67, 64, 64, 62, 66, 69, 67, 66, 62, 66, 64, 62, 61, 62, 69, 67, 71, 69, 67, 66, 62, 64, 73, 74, 78, 81, 69, 71, 67, 69, 66, 62, 74, 74, 74]; // the three violine voices are actually the same, just shifted by two bars.\\n\\ni=0;\\ns=0;\\nv=[];\\nb=new Canon(basso,0); // the basso\\n}\",\n \"process(fft) {\\n var dct = new DCT()\\n if (fft.length != this.fftSize) {\\n throw Error('Passed in FFT bins were incorrect size. Expected ' + this.fftSize + ' but was ' + fft.length);\\n }\\n var melSpec = this.filterBank.filter(fft),\\n melSpecLog = melSpec.map(log),\\n melCoef = dct.process(melSpecLog).slice(0, 13)\\n return melCoef;\\n }\",\n \"function triangulate(){\\n var tfs = arrTF.slice();\\n for (var i = 0; i < tfs.length; i++) {\\n var f = tfs[i];\\n if(f.length <= 3)continue;\\n while(f.length > 3){\\n arrE.push([f[0],f[2]]);\\n arrTF.push([f[0],f[1],f[2]]);\\n f.splice(1, 1);\\n }\\n arrTF[i] = f;\\n }\\n}\",\n \"triggerFreqShifter() {\\n this.freqShifterActive = this.freqShifterActive ? this.freqShifterActive = false : this.freqShifterActive = true;\\n\\n if (this.freqShifterActive) {\\n this.player.connect(this.freqShifter);\\n this.freqShifter.wet.rampTo(1, 0.1);\\n this.volOut.volume.rampTo(-20, 0.5);\\n this.shifterLoop = new Tone.Loop((time) => this.shifterLFO(), 0.01); // calls below function every 0.01 seconds\\n this.shifterLoop.start();\\n /*\\n this.player.connect(this.freqShifter);\\n this.freqShifter.wet.rampTo(1, 0.1);\\n this.freqShifterLFO.start();\\n */\\n }\\n\\n else {\\n this.freqShifter.wet.rampTo(0, 0.1);\\n this.player.disconnect(this.freqShifter);\\n this.volOut.volume.rampTo(-0, 0.5);\\n this.shifterLoop.stop();\\n this.freqShifterGoingDown = true;\\n\\n this.freqShifter.pitch = 0;\\n\\n this.freqShifterParamTrackActive = false;\\n this.freqShifterParamTrackActive_Y = false;\\n /*\\n this.freqShifter.wet.rampTo(0, 0.1);\\n this.player.disconnect(this.freqShifter);\\n this.freqShifterParamTrack.wet.rampTo(0, 0.1);\\n this.freqShifterParamTrackActive = false;\\n this.freqShifterParamTrackActive_Y = false;\\n */\\n }\\n }\",\n \"function xu(t) {\\n t.Wh.forEach((function(t) {\\n t.next();\\n }));\\n}\",\n \"function mdct_short(inout, inoutPos) {\\n\\t\\tfor (var l = 0; l < 3; l++) {\\n\\t\\t\\tvar tc0, tc1, tc2, ts0, ts1, ts2;\\n\\n\\t\\t\\tts0 = inout[inoutPos + 2 * 3] * win[Encoder.SHORT_TYPE][0]\\n\\t\\t\\t\\t\\t- inout[inoutPos + 5 * 3];\\n\\t\\t\\ttc0 = inout[inoutPos + 0 * 3] * win[Encoder.SHORT_TYPE][2]\\n\\t\\t\\t\\t\\t- inout[inoutPos + 3 * 3];\\n\\t\\t\\ttc1 = ts0 + tc0;\\n\\t\\t\\ttc2 = ts0 - tc0;\\n\\n\\t\\t\\tts0 = inout[inoutPos + 5 * 3] * win[Encoder.SHORT_TYPE][0]\\n\\t\\t\\t\\t\\t+ inout[inoutPos + 2 * 3];\\n\\t\\t\\ttc0 = inout[inoutPos + 3 * 3] * win[Encoder.SHORT_TYPE][2]\\n\\t\\t\\t\\t\\t+ inout[inoutPos + 0 * 3];\\n\\t\\t\\tts1 = ts0 + tc0;\\n\\t\\t\\tts2 = -ts0 + tc0;\\n\\n\\t\\t\\ttc0 = (inout[inoutPos + 1 * 3] * win[Encoder.SHORT_TYPE][1] - inout[inoutPos + 4 * 3]) * 2.069978111953089e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s [ 1 ]\\n\\t\\t\\t */\\n\\t\\t\\tts0 = (inout[inoutPos + 4 * 3] * win[Encoder.SHORT_TYPE][1] + inout[inoutPos + 1 * 3]) * 2.069978111953089e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s [ 1 ]\\n\\t\\t\\t */\\n\\t\\t\\tinout[inoutPos + 3 * 0] = tc1 * 1.907525191737280e-11 + tc0;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[ 2 ]\\n\\t\\t\\t */\\n\\t\\t\\tinout[inoutPos + 3 * 5] = -ts1 * 1.907525191737280e-11 + ts0;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[0 ]\\n\\t\\t\\t */\\n\\t\\t\\ttc2 = tc2 * 0.86602540378443870761 * 1.907525191737281e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[ 2]\\n\\t\\t\\t */\\n\\t\\t\\tts1 = ts1 * 0.5 * 1.907525191737281e-11 + ts0;\\n\\t\\t\\tinout[inoutPos + 3 * 1] = tc2 - ts1;\\n\\t\\t\\tinout[inoutPos + 3 * 2] = tc2 + ts1;\\n\\n\\t\\t\\ttc1 = tc1 * 0.5 * 1.907525191737281e-11 - tc0;\\n\\t\\t\\tts2 = ts2 * 0.86602540378443870761 * 1.907525191737281e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[ 0]\\n\\t\\t\\t */\\n\\t\\t\\tinout[inoutPos + 3 * 3] = tc1 + ts2;\\n\\t\\t\\tinout[inoutPos + 3 * 4] = tc1 - ts2;\\n\\n\\t\\t\\tinoutPos++;\\n\\t\\t}\\n\\t}\",\n \"function mdct_short(inout, inoutPos) {\\n\\t\\tfor (var l = 0; l < 3; l++) {\\n\\t\\t\\tvar tc0, tc1, tc2, ts0, ts1, ts2;\\n\\n\\t\\t\\tts0 = inout[inoutPos + 2 * 3] * win[Encoder.SHORT_TYPE][0]\\n\\t\\t\\t\\t\\t- inout[inoutPos + 5 * 3];\\n\\t\\t\\ttc0 = inout[inoutPos + 0 * 3] * win[Encoder.SHORT_TYPE][2]\\n\\t\\t\\t\\t\\t- inout[inoutPos + 3 * 3];\\n\\t\\t\\ttc1 = ts0 + tc0;\\n\\t\\t\\ttc2 = ts0 - tc0;\\n\\n\\t\\t\\tts0 = inout[inoutPos + 5 * 3] * win[Encoder.SHORT_TYPE][0]\\n\\t\\t\\t\\t\\t+ inout[inoutPos + 2 * 3];\\n\\t\\t\\ttc0 = inout[inoutPos + 3 * 3] * win[Encoder.SHORT_TYPE][2]\\n\\t\\t\\t\\t\\t+ inout[inoutPos + 0 * 3];\\n\\t\\t\\tts1 = ts0 + tc0;\\n\\t\\t\\tts2 = -ts0 + tc0;\\n\\n\\t\\t\\ttc0 = (inout[inoutPos + 1 * 3] * win[Encoder.SHORT_TYPE][1] - inout[inoutPos + 4 * 3]) * 2.069978111953089e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s [ 1 ]\\n\\t\\t\\t */\\n\\t\\t\\tts0 = (inout[inoutPos + 4 * 3] * win[Encoder.SHORT_TYPE][1] + inout[inoutPos + 1 * 3]) * 2.069978111953089e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s [ 1 ]\\n\\t\\t\\t */\\n\\t\\t\\tinout[inoutPos + 3 * 0] = tc1 * 1.907525191737280e-11 + tc0;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[ 2 ]\\n\\t\\t\\t */\\n\\t\\t\\tinout[inoutPos + 3 * 5] = -ts1 * 1.907525191737280e-11 + ts0;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[0 ]\\n\\t\\t\\t */\\n\\t\\t\\ttc2 = tc2 * 0.86602540378443870761 * 1.907525191737281e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[ 2]\\n\\t\\t\\t */\\n\\t\\t\\tts1 = ts1 * 0.5 * 1.907525191737281e-11 + ts0;\\n\\t\\t\\tinout[inoutPos + 3 * 1] = tc2 - ts1;\\n\\t\\t\\tinout[inoutPos + 3 * 2] = tc2 + ts1;\\n\\n\\t\\t\\ttc1 = tc1 * 0.5 * 1.907525191737281e-11 - tc0;\\n\\t\\t\\tts2 = ts2 * 0.86602540378443870761 * 1.907525191737281e-11;\\n\\t\\t\\t/*\\n\\t\\t\\t * tritab_s[ 0]\\n\\t\\t\\t */\\n\\t\\t\\tinout[inoutPos + 3 * 3] = tc1 + ts2;\\n\\t\\t\\tinout[inoutPos + 3 * 4] = tc1 - ts2;\\n\\n\\t\\t\\tinoutPos++;\\n\\t\\t}\\n\\t}\",\n \"stepThyratrons() {\\n let X2bPtr = this.Xptr[1]-1;\\n if (X2bPtr===0) X2bPtr = ROTOR_SIZES.X2;\\n let S1bPtr = this.Sptr[0]-1;\\n if (S1bPtr===0) S1bPtr = ROTOR_SIZES.S1;\\n\\n // Get Chi rotor 5 two back to calculate plaintext (Z+Chi+Psi=Plain)\\n let X5bPtr=this.Xptr[4]-1;\\n if (X5bPtr===0) X5bPtr=ROTOR_SIZES.X5;\\n X5bPtr=X5bPtr-1;\\n if (X5bPtr===0) X5bPtr=ROTOR_SIZES.X5;\\n // Get Psi rotor 5 two back to calculate plaintext (Z+Chi+Psi=Plain)\\n let S5bPtr=this.Sptr[4]-1;\\n if (S5bPtr===0) S5bPtr=ROTOR_SIZES.S5;\\n S5bPtr=S5bPtr-1;\\n if (S5bPtr===0) S5bPtr=ROTOR_SIZES.S5;\\n\\n const x2sw = this.limitations.X2;\\n const s1sw = this.limitations.S1;\\n const p5sw = this.limitations.P5;\\n\\n // Limitation calculations\\n let lim=1;\\n if (x2sw) lim = this.rings.X[2][X2bPtr-1];\\n if (s1sw) lim = lim ^ this.rings.S[1][S1bPtr-1];\\n\\n // P5\\n if (p5sw) {\\n let p5lim = this.P5Zbit[1];\\n p5lim = p5lim ^ this.rings.X[5][X5bPtr-1];\\n p5lim = p5lim ^ this.rings.S[5][S5bPtr-1];\\n lim = lim ^ p5lim;\\n }\\n\\n const basicmotor = this.rings.M[2][this.Mptr[0]-1];\\n this.totalmotor = basicmotor;\\n\\n if (x2sw || s1sw) {\\n if (basicmotor===0 && lim===1) {\\n this.totalmotor = 0;\\n } else {\\n this.totalmotor = 1;\\n }\\n }\\n\\n // Step Chi rotors\\n for (let r=0; r<5; r++) {\\n this.Xptr[r]++;\\n if (this.Xptr[r] > ROTOR_SIZES[\\\"X\\\"+(r+1)]) this.Xptr[r] = 1;\\n }\\n\\n if (this.totalmotor) {\\n // Step Psi rotors\\n for (let r=0; r<5; r++) {\\n this.Sptr[r]++;\\n if (this.Sptr[r] > ROTOR_SIZES[\\\"S\\\"+(r+1)]) this.Sptr[r] = 1;\\n }\\n }\\n\\n // Move M37 rotor if M61 set\\n if (this.rings.M[1][this.Mptr[1]-1]===1) this.Mptr[0]++;\\n if (this.Mptr[0] > ROTOR_SIZES.M37) this.Mptr[0]=1;\\n\\n // Always move M61 rotor\\n this.Mptr[1]++;\\n if (this.Mptr[1] > ROTOR_SIZES.M61) this.Mptr[1]=1;\\n }\",\n \"function ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function frameLooper() {\\n window.requestAnimationFrame(frameLooper); // recursive yaaay, for looping\\n // fbc_array is our actual frequency/amplitude array\\n // having access to this will be key to split up later\\n fbc_array = new Uint8Array(analyser.frequencyBinCount);\\n\\n analyser.getByteFrequencyData(fbc_array);\\n ctx.clearRect(0, 0, canvas.width, canvas.height); // clear the canvas every loop\\n ctx.fillStyle = '#00CCFF'; // color of the bars. I chose sky blue\\n bars = 128; // how many bars to render. 128 might make the most sense.\\n // fbc_array.length == 1024, so each bar represents 8 frequencies\\n\\n for(var i = 0; i < bars; i++){\\n bar_x = i * 2; // each bar is 3 units apart on the x axis\\n bar_width = 1; // each bar is 2 units wide. 0-1 is a bar, 2 is not, 3-4 is a bar, etc. But this is based on the width of the canvas\\n bar_height = -(fbc_array[i] / 2); // frequency data, of the current index. The amplitude\\n\\n // amps[0].text = fbc_array[0]; // not working\\n\\n // here I'm finding out stuff about the bar_height\\n // barH.innerHTML = fbc_array; // this is a simple trick for now, but I want to make a 32x32 grid, and loop over it and fill the number (amp) into each of them\\n // Doing this at every frame makes everything lag, so idk if I'll have to comment out the *BAR* visualization for testing purposes. Then I'll make a grid of the array, change the color of the text as it increases, and that'll be my new visualisation.\\n\\n // fillRect(x, y, width, height) // explanation of the parameters below\\n ctx.fillRect(bar_x, canvas.height, bar_width, bar_height); // this draws the bars themselves\\n }\\n\\n\\n // Table visualization\\n for(var j = 0; j < fbc_array.length; j++){\\n amps[j].innerHTML = fbc_array[j];\\n // styling is gonna be difficult\\n // amps[j].css({\\\"background-color\\\":`rgb(0,${j}, ${j})`});\\n }\\n\\n}\",\n \"_AMDF(buf, sampleRate) {\\n var SIZE = buf.length; // set SIZE variable equal to buffer length 4096 => half a second\\n var MAX_SAMPLES = Math.floor(SIZE / 2); // set MAX_SAMPLES = 4096/2 = 2048\\n var best_offset = -1; // initialise best_offset to -1\\n var best_correlation = 0; // initialise best_correlation to 0\\n var rms = 0; // initialise rms to 0 (rms => root-mean-square)\\n var foundGoodCorrelation = false; // initialise foundGoodCorrelation flag to false\\n var correlations = new Array(MAX_SAMPLES); // create an array variable called correlations of size MAX_SAMPLES (2048)\\n\\n for (var i = 0; i < SIZE; i++) {\\n var val = buf[i]; // val is equal to the (i)th value in the array\\n rms += val * val; // rms is the summation of each value squared\\n }\\n rms = Math.sqrt(rms / SIZE); // set rms equal to the square root of rms/SIZE (square root of the average)\\n if (rms < 0.01) // not enough signal\\n return -1;\\n\\n var lastCorrelation = 1; // initialise lastCorrelation to 1 so that the first check won't be the best correlation\\n for (var offset = 52; offset < 160; offset++) { // offset initialised to 52, goes through a for loop from 52 to 160, which will cover the notes that Singphony can render\\n var correlation = 0; // re-set correlation to 0 at each offset value\\n\\n for (var i = 0; i < MAX_SAMPLES; i++) { // cycle through from 0 to 2048\\n correlation += Math.abs((buf[i]) - (buf[i + offset])); // step through at each value and subtract the value at the offset from the value in the original buffer and keep adding that to the correlation value\\n } // correlation will be a large enough positive float\\n\\n correlation = 1 - (correlation / MAX_SAMPLES); // set correlation to 1 - correlation/512\\n correlations[offset] = correlation; // store it, for the tweaking we need to do below.\\n if ((correlation > this.GOOD_ENOUGH_CORRELATION) && (correlation > lastCorrelation)) { // if the correlation value is higher than 0.9 and the previous correlation value\\n foundGoodCorrelation = true; // set foundGoodCorrelation flag to true\\n if (correlation > best_correlation) { //\\n best_correlation = correlation; // update the best_correlation value to the latest correlation value\\n best_offset = offset; // update best_offset to the latest offset value\\n }\\n } else if (foundGoodCorrelation) {\\n // short-circuit - we found a good correlation, then a bad one, so we'd just be seeing copies from here.\\n return sampleRate / best_offset;\\n }\\n lastCorrelation = correlation; // set lastCorrelation to latest correlation\\n }\\n return -1;\\n }\",\n \"function sha1_ft(t, b, c, d)\\r\\n{\\r\\n if(t < 20) return (b & c) | ((~b) & d);\\r\\n if(t < 40) return b ^ c ^ d;\\r\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\r\\n return b ^ c ^ d;\\r\\n}\",\n \"function calculateNext(data) {\\n\\n var alpham, betam, alphah, betah, alphaj, betaj, alphaoa,\\n betaoa, alphaoi, betaoi, alphaua, betaua, alphaui, betaui, alphaxr, betaxr, alphaxs, betaxs,\\n temp, xnaca11, xnaca21;\\n\\n var exptaum_t, xinfm_t, exptauh_t, xinfh_t, exptauj_t, xinfj_t, \\n xk1t_t, exptauoa_t, xinfoa_t, exptauoi_t, xinfoi_t, exptauua_t, xinfua_t, exptauui_t, xinfui_t, xkurcoeff_t, xkrcoeff_t, \\n exptaud_t, xinfd_t, exptauf_t, xinff_t, xnakt_t, xnaca1_t, \\n xnaca2_t, exptauw_t, xinfw_t;\\n\\n /* moved to settings as previous value required \\n exptauxr_t, xinfxr_t, exptauxs_t, xinfxs_t*/\\n\\n var xinffca_t , xpcat_t, ecat_t, xupt_t, carow2_t;\\n\\n var xinfut_t, exptauvt_t, xinfvt_t; \\n\\n var xstim, eca, xinfm1, exptaum1, xinfh1, exptauh1, xinfj1, exptauj1,\\n xinfoa1, exptauoa1, xinfoi1, exptauoi1,\\n xinfua1, exptauua1, xinfui1, exptauui1, xkurcoeff1,\\n xinfxr1, exptauxr1, xkrcoeff1,\\n xinfxs1, exptauxs1,\\n xinfd1, exptaud1, xinff1, exptauf1, xinffca1,\\n xinfu, exptauv, xinfv, xinfw1, exptauw1,\\n xtr, xup, xupleak,\\n di_ups, carow21; \\n\\n //calculations start\\n //\\n\\n alpham = (Math.abs( cS.v + 47.13) < 1e-5) ? 3.2 : 0.32 * ( cS.v + 47.13 )/( 1.- Math.exp(-0.1*( cS.v + 47.13 ) ) );\\n\\n betam = 0.08 * Math.exp (- cS.v /11.);\\n\\n alphah = ( cS.v > -40.0 ) ? 0.0 : 0.135 * Math.exp(-( cS.v+80.0)/6.8); \\n\\n betah = ( cS.v > -40.0 ) ? 1.0/ (0.13 * (1.0 + Math.exp (-( cS.v + 10.66)/11.1))) \\n : 3.56 * Math.exp ( 0.079 * cS.v ) + 3.1e5 * Math.exp(0.35 * cS.v); \\n\\n alphaj = ( cS.v > -40.0 ) ? 0.0 \\n : (-127140 * Math.exp(0.2444 * cS.v)-3.474e-5 * Math.exp(-0.04391 * cS.v)) * ( cS.v + 37.78)/(1. + Math.exp (0.311 * ( cS.v + 79.23))); \\n\\n betaj = ( cS.v > -40.0 ) ? 0.3 * Math.exp(-2.535e-7 * cS.v)/(1.+Math.exp(-0.1 * ( cS.v+32.))) \\n : 0.1212 * Math.exp(-0.01052 * cS.v)/(1.+Math.exp(-0.1378 * ( cS.v+40.14))); \\n\\n alphaoa = 0.65 / ( Math.exp ( - ( cS.v + 10. ) / 8.5 ) + Math.exp ( - ( cS.v-30. ) / 59. ) ); \\n\\n betaoa = 0.65 / ( 2.5 + Math.exp ( ( cS.v + 82. ) / 17. ) );\\n\\n alphaoi = 1.0 / ( 18.53 + Math.exp ( ( cS.v + 113.7 ) / 10.95 ) );\\n\\n betaoi = 1.0 / ( 35.56 + Math.exp ( - ( cS.v + 1.26 ) / 7.44 ) ); \\n\\n alphaua = 0.65 / ( Math.exp ( - ( cS.v + 10. ) / 8.5 ) + Math.exp ( - ( cS.v-30. ) / 59. ) ); \\n\\n betaua = 0.65 / ( 2.5 + Math.exp ( ( cS.v + 82. ) / 17. ) ); \\n\\n alphaui = 1.0 / ( 21. + Math.exp ( - ( cS.v-185. ) / 28. ) ) ; \\n\\n betaui = Math.exp ( ( cS.v-158. ) / 16. ); \\n\\n alphaxr = 0.0003* ( cS.v + 14.1 ) / ( 1.- Math.exp ( - ( cS.v + 14.1 ) / 5. ) ); \\n\\n betaxr = 7.3898e-5* ( cS.v-3.3328 ) / ( Math.exp ( ( cS.v-3.3328 ) / 5.1237 ) -1. ); \\n\\n alphaxs = 4e-5* ( cS.v-19.9 ) / ( 1.- Math.exp ( - ( cS.v-19.9 ) / 17. ) ); \\n\\n betaxs = 3.5e-5* ( cS.v-19.9 ) / ( Math.exp ( ( cS.v-19.9 ) / 9. ) -1. );\\n\\n //table variables depending on V\\n\\n exptaum_t = Math.exp(- cS.timestep*(alpham+betam));\\n\\n xinfm_t = alpham/(alpham+betam);\\n\\n exptauh_t = Math.exp(- cS.timestep*(alphah+betah));\\n\\n xinfh_t = alphah/(alphah+betah);\\n\\n exptauj_t = Math.exp(- cS.timestep*(alphaj+betaj));\\n\\n xinfj_t = alphaj/(alphaj+betaj);\\n\\n xk1t_t = cS.gk1*( cS.v- cC.ek)/(1.+Math.exp(0.07*( cS.v + 80.)));\\n\\n exptauoa_t = Math.exp(- cS.timestep*((alphaoa+betaoa)* cS.xkq10));\\n\\n xinfoa_t = 1.0/(1.+Math.exp(-( cS.v+20.47)/17.54));\\n\\n exptauoi_t = Math.exp(- cS.timestep*((alphaoi+betaoi)* cS.xkq10));\\n\\n xinfoi_t = 1.0/(1.+Math.exp(( cS.v+43.1)/5.3));\\n\\n exptauua_t = Math.exp(- cS.timestep*((alphaua+betaua)* cS.xkq10));\\n\\n xinfua_t = 1.0/(1.+Math.exp(-( cS.v+30.3)/9.6));\\n\\n exptauui_t = Math.exp(- cS.timestep*((alphaui+betaui)* cS.xkq10));\\n\\n xinfui_t = 1.0/(1.+Math.exp(( cS.v-99.45)/27.48));\\n\\n xkurcoeff_t = (0.005+0.05/(1.+Math.exp(-( cS.v-15.)/13.)))*( cS.v- cC.ek);\\n\\n\\n if(!((Math.abs( cS.v+14.1) < 1e-5) || (Math.abs( cS.v-3.3328)<1e-5))){\\n cS.exptauxr_t = Math.exp(- cS.timestep*(alphaxr+betaxr));\\n cS.xinfxr_t = 1.0/(1.+Math.exp(-( cS.v+14.1)/6.5));\\n }\\n\\n xkrcoeff_t = cS.gkr*( cS.v- cC.ek)/(1.+Math.exp(( cS.v+15.)/22.4));\\n\\n if(!(Math.abs( cS.v-19.9) < 1e-5)){\\n cS.exptauxs_t = Math.exp(- cS.timestep/0.5*(alphaxs+betaxs));\\n cS.xinfxs_t = 1.0/Math.sqrt(1.+Math.exp(-( cS.v-19.9)/12.7));\\n }\\n\\n //temp varaible used for calculations\\n temp = (1.0-Math.exp(-( cS.v+10.)/6.24))/(0.035*( cS.v+10.)* (1.+Math.exp(-( cS.v+10.)/6.24)));\\n\\n if(Math.abs( cS.v+10) < 1e-5){\\n exptaud_t = 2.2894;\\n exptauf_t = 0.9997795;\\n }\\n else{\\n exptaud_t = Math.exp(- cS.timestep/temp); \\n exptauf_t = Math.exp(- cS.timestep/9.*(0.0197*Math.exp(Math.pow(-(0.0337 *( cS.v+10.)), 2))+0.02));\\n }\\n\\n xinfd_t = 1.0/(1.+Math.exp(-( cS.v+10.)/8.));\\n\\n xinff_t = 1.0/(1.+Math.exp(( cS.v+28.)/6.9));\\n\\n xnakt_t = (1.0/(1.+0.1245*Math.exp(-0.1* cS.v/ cC.rtof)+0.0365* cC.sigma*Math.exp(- cS.v/ cC.rtof)))* cS.xinakmax/(1.+(Math.pow(( cS.xkmnai/ cS.cnai),1.5)))*( cS.cko/( cS.cko+ cS.xkmko));\\n\\n xnaca1_t = cS.xinacamax*Math.exp( cS.gamma* cS.v/ cC.rtof)*(Math.pow( cS.cnai,3))* cS.ccao/((Math.pow( cS.xkmna,3)+ Math.pow( cS.cnao,3))*( cS.xkmca+ cS.ccao)*(1.+ cS.xksat*Math.exp(( cS.gamma-1.)* cS.v/ cC.rtof)));\\n\\n xnaca2_t = cS.xinacamax*Math.exp(( cS.gamma-1.)* cS.v/ cC.rtof)/((Math.pow( cS.xkmna,3) + Math.pow( cS.cnao,3))*( cS.xkmca+ cS.ccao)*(1.+ cS.xksat*Math.exp(( cS.gamma-1.)* cS.v/ cC.rtof))); \\n\\n temp = 6.0*(1.-Math.exp(-( cS.v-7.9)/5.))/((1.+0.3*Math.exp(-( cS.v-7.9)/5.))*( cS.v-7.9)); \\n\\n exptauw_t = Math.exp(- cS.timestep/temp);\\n\\n xinfw_t = 1.0-1.0/(1.+Math.exp(-( cS.v-40.)/17.));\\n\\n //table variables depending on ca\\n\\n xinffca_t = 1.0/(1.+ cS.ccai/0.00035);\\n xpcat_t = cS.xipcamax* cS.ccai/(0.0005+ cS.ccai);\\n ecat_t = cC.rtof*0.5*Math.log( cS.ccao/ cS.ccai);\\n xupt_t = cS.xupmax/(1.+ cS.xkup/ cS.ccai);\\n carow2_t = ( cS.trpnmax* cS.xkmtrpn/( cS.ccai+ cS.xkmtrpn)/( cS.ccai+ cS.xkmtrpn) + cS.cmdnmax* cS.xkmcmdn/( cS.ccai+ cS.xkmcmdn)/( cS.ccai+ cS.xkmcmdn)+1.)/ cC.c_b1c;\\n\\n //table variables depending on fn\\n /* fnlo=-0.2,fnhi=2.3,nfnt=2500\\n dfntable=(fnhi-fnlo)/float(nfnt)\\n fn=fnlo+i*dfntable\\n */\\n xinfut_t = 1.0/(1.+ Math.exp(-( cS.fn/13.67e-4-250.0)));\\n\\n temp = 1.91+2.09/(1.+ Math.exp(-( cS.fn/13.67e-4-250.0)));\\n\\n exptauvt_t = Math.exp(- cS.timestep/temp);\\n\\n xinfvt_t = 1.-1.0/(1.+ Math.exp(-( cS.fn-6.835e-14)/13.67e-16));\\n\\n\\n // table loop starts here\\n\\n xstim = _s1s2Stimulus(count, data);\\n\\n //c equilibrium potentials\\n eca = ecat_t;\\n\\n //c fast sodium current\\n xinfm1 = xinfm_t;\\n exptaum1 = exptaum_t;\\n xinfh1 = xinfh_t;\\n exptauh1 = exptauh_t;\\n xinfj1 = xinfj_t;\\n exptauj1 = exptauj_t;\\n\\n cS.xm = xinfm1 + ( cS.xm - xinfm1) * exptaum1;\\n cS.xh = xinfh1 + ( cS.xh - xinfh1) * exptauh1;\\n cS.xj = xinfj1 + ( cS.xj - xinfj1) * exptauj1; \\n cS.xna = cS.xm * cS.xm * cS.xm * cS.xh * cS.xj * cS.gna *( cS.v - cC.ena);\\n\\n //c time-independent k+ current\\n cS.xk1 = xk1t_t;\\n\\n //c transient outward k+ current\\n xinfoa1 = xinfoa_t;\\n exptauoa1 = exptauoa_t;\\n xinfoi1 = xinfoi_t;\\n exptauoi1 = exptauoi_t;\\n\\n cS.xoa = xinfoa1+( cS.xoa-xinfoa1)*exptauoa1;\\n cS.xoi = xinfoi1+( cS.xoi-xinfoi1)*exptauoi1;\\n cS.xto = cS.xoa* cS.xoa* cS.xoa* cS.xoi* cS.gto*( cS.v - cC.ek);\\n\\n //c ultrarapid delayed rectifier k+ current\\n xinfua1 = xinfua_t;\\n exptauua1 = exptauua_t;\\n xinfui1 = xinfui_t;\\n exptauui1 = exptauui_t;\\n xkurcoeff1= xkurcoeff_t;\\n\\n cS.xua = xinfua1+( cS.xua-xinfua1)*exptauua1;\\n cS.xui = xinfui1+( cS.xui-xinfui1)*exptauui1;\\n cS.xkur = cS.xua* cS.xua* cS.xua* cS.xui*xkurcoeff1;\\n\\n //c rapid delayed outward rectifier k+ current\\n xinfxr1 = cS.xinfxr_t;\\n exptauxr1 = cS.exptauxr_t;\\n xkrcoeff1 = xkrcoeff_t;\\n\\n cS.xr = xinfxr1+( cS.xr-xinfxr1)*exptauxr1;\\n cS.xkr = cS.xr*xkrcoeff1;\\n\\n //c slow delayed outward rectifier k+ current\\n xinfxs1 = cS.xinfxs_t;\\n exptauxs1 = cS.exptauxs_t;\\n\\n cS.xs = xinfxs1+( cS.xs-xinfxs1)*exptauxs1;\\n cS.xks = cS.xs* cS.xs* cS.gks*( cS.v- cC.ek);\\n\\n //c L-tpe ca2+ current\\n xinfd1 = xinfd_t;\\n exptaud1 = exptaud_t;\\n xinff1 = xinff_t;\\n exptauf1 = exptauf_t;\\n xinffca1 = xinffca_t;\\n\\n cS.xd = xinfd1+( cS.xd-xinfd1)*exptaud1;\\n cS.xf = xinff1+( cS.xf-xinff1)*exptauf1;\\n cS.xfca = xinffca1+( cS.xfca-xinffca1)* cC.exptaufca;\\n cS.xcal = cS.xd* cS.xf* cS.xfca* cS.gcal*( cS.v-65.0);\\n\\n //xnak, xnaca, xbca, xbna, xpca; \\n\\n //cc na+/k+ pump current\\n cS.xnak = xnakt_t;\\n\\n //c na+/ca2+ exchanger current\\n xnaca11 = xnaca1_t;\\n xnaca21 = xnaca2_t;\\n cS.xnaca = xnaca11 - xnaca21* cC.cnao3* cS.ccai;\\n\\n //cc background currents\\n cS.xbca = cS.gbca * ( cS.v - eca);\\n\\n cS.xbna = cS.gbna * ( cS.v - cC.ena);\\n\\n //c ca2+ pump current\\n cS.xpca = xpcat_t;\\n\\n /*c ca2+ release current from JSR\\n c correction: divide first fn term by cm, multiply second fn term by cm\\n c then to ensure computational accuracy (no problems with tiny numbers),\\n c divide fn by 1e-12 and adjust functions accordingly*/\\n cS.xrel = cS.xkrel* cS.xu* cS.xu* cS.xv* cS.xw*( cS.ccarel- cS.ccai);\\n\\n cS.fn = cS.vrel/ cS.cm* cS.xrel-0.5 * cS.cm/ cS.xxf*(0.5* cS.xcal-0.2* cS.xnaca);\\n\\n xinfu = xinfut_t;\\n exptauv = exptauvt_t;\\n xinfv = xinfvt_t;\\n\\n cS.xu = xinfu+( cS.xu-xinfu)* cC.exptauu;\\n cS.xv = xinfv+( cS.xv-xinfv)*exptauv;\\n\\n xinfw1 = xinfw_t;\\n exptauw1 = exptauw_t;\\n\\n cS.xw = xinfw1+( cS.xw-xinfw1)*exptauw1;\\n cS.xrel = cS.xkrel* cS.xu* cS.xu* cS.xv* cS.xw*( cS.ccarel - cS.ccai);\\n\\n // c transfer current from NSR to JSR\\n xtr = ( cS.ccaup - cS.ccarel)/ cS.tautr;\\n\\n // c ca2+ uptake current by the NSR\\n xup = xupt_t;\\n\\n // c ca2+ leak current by the NSR\\n xupleak = cS.ccaup* cS.xupmax/ cS.ccaupmax;\\n\\n //c intracellular ion concentrations\\n di_ups = xup-xupleak;\\n carow21 = carow2_t;\\n cS.ccai = cS.ccai + cS.timestep * ( cC.c_b1d*( cS.xnaca + cS.xnaca - cS.xpca - cS.xcal - cS.xbca)- cC.c_b1e* di_ups + cS.xrel) / carow21; \\n cS.ccaup = cS.ccaup + cS.timestep * (xup - xupleak-xtr*( cS.vrel/ cS.vup));\\n cS.ccarel = cS.ccarel + cS.timestep * ((xtr - cS.xrel)/ (1.+( cS.csqnmax* cS.xkmcsqn)/(Math.pow(( cS.ccarel+ cS.xkmcsqn),2))));\\n\\n //console.log( cS.xna , cS.xk1 , + cS.xkur + cS.xto , cS.xkur , cS.xkr , cS.xks , cS.xcal , cS.xpca , cS.xnak, cS.xnaca, cS.xbna, cS.xbca-xstim);\\n \\n cS.v = cS.v - cS.timestep * ( cS.xna + cS.xk1 + cS.xto + cS.xkur + cS.xkr + cS.xks + cS.xcal + cS.xpca + cS.xnak + cS.xnaca + cS.xbna + cS.xbca - xstim);\\n\\n // table loop ends\\n\\n //cal ends\\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n\\n // iterate the count\\n count++;\\n\\n return data; \\n }\",\n \"function makeSamples(groove, color, data){\\n\\n\\tvar oneSecond = 44100;\\n\\tvar loop = false;\\n\\tvar repeats = 4;\\n\\tvar repeated = 0;\\n\\tvar PI = Math.PI;\\n\\n\\tvar maxSamples = (groove.duration * oneSecond ) / 1000 ;\\t\\n var instrumentType = \\\"sin\\\";\\n var delay = false;\\n if (color == 0) {\\n\\tdelay = true;\\n } \\n else if (color == 1) {\\n } \\n else if (color == 2) {\\n\\tinstrumentType = \\\"sqr\\\";\\n } \\n else if (color == 3) {\\n\\tinstrumentType = \\\"sqr\\\";\\n } \\n else if (color == 4) {\\n\\tinstrumentType = \\\"sqr\\\";\\n } \\n else if (color == 5) {\\n\\tinstrumentType = \\\"sqr\\\";\\n } \\n else if (color == 6) {\\n\\tinstrumentType = \\\"sqr\\\";\\n\\tdelay = true;\\n } \\n else if (color == 7) {\\n\\tinstrumentType = \\\"saw\\\";\\n } \\n else if (color == 8) {\\n\\tinstrumentType = \\\"saw\\\";\\n } \\n else if (color == 9) {\\n\\tinstrumentType = \\\"saw\\\";\\n } \\n else if (color == 10) {\\n\\tinstrumentType = \\\"saw\\\";\\n } \\n\\n var freqs = data[0];\\n var times = data[1];\\n\\tdebugfreqs = freqs;\\n \\tdebugtimes = times;\\n\\n var samples = [];\\n ii = 0;\\n var tcounter = 0;\\n for (var j = 0; j < freqs.length - 1; j++) {\\n\\t\\tif (j == 0 && times[0] > groove.startLine){\\n\\t\\t\\tvar freqDur = times[j] / groove.lineLength;\\n\\t \\n\\t\\t\\tfreqDur = freqDur * groove.duration;\\n\\t\\t\\tfreqDur = freqDur * 44100;\\n\\t\\t\\tfreqDur = Math.floor(freqDur / 1000);\\n\\t \\n\\t \\tfor (var i = 0; i < freqDur; i++) {\\n\\t \\t var t = i / oneSecond; \\n\\t \\t samples[ii] = 0;\\n\\t \\t ii++;\\n\\t\\t }\\n\\t\\t}\\n var frequency = freqs[j];\\n//\\tif (freqs.length > j + 1 && freqs[j + 1] == 0){\\n//\\t\\tfrequency = 0;\\n//\\t}\\n\\n var freqDur = times[j + 1] / groove.lineLength;\\n \\n freqDur = freqDur * groove.duration;\\n freqDur = freqDur * 44100;\\n freqDur = Math.floor(freqDur / 1000);\\n\\n// \\tfor (var i = 0; i < freqDur; i++){\\n\\t\\tvar i = 0;\\n while (true){\\n var t = i / oneSecond; // time from 0 to 1\\n if (frequency == 0){\\n samples[ii] = 0;\\n }\\n\\t\\t else if (instrumentType == \\\"sin\\\"){\\n\\t\\t samples[ii] = Math.sin(frequency * 2 * PI * t); // wave equation (between -1,+1)\\n\\t\\t }\\n else if (instrumentType == \\\"sqr\\\") {\\n\\t\\t\\t if (Math.sin(frequency * 2 * PI * t) > 0){\\n\\t\\t\\t\\t\\tsamples[ii] = 1; } else { samples[ii] = -1;\\n\\t\\t\\t\\t}\\n\\t\\t }\\n else if (instrumentType == \\\"saw\\\") {\\n \\tsamples[ii] = 1 - ((frequency*t)%1);\\n\\t\\t }\\n samples[ii] = samples[ii] * 0.25;\\n\\n\\t\\t\\tif (i >= freqDur){\\n\\t\\t\\t\\tif (instrumentType == \\\"sin\\\"){\\n\\t\\t\\t\\t\\tif (samples[ii] == 0 || (samples[ii -1] < samples[ii] && samples[ii] < 0.01 && samples[ii] > -0.01)){\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\t\\t\\t\\n\\t\\t\\t}\\n ii++;\\n if (maxSamples > 0 && ii >= maxSamples){\\n\\t\\t\\t\\tbreak;\\n\\t\\t }\\n\\t\\t i++;\\n }\\n if (maxSamples > 0 && ii >= maxSamples){\\n\\t\\t\\tbreak;\\n\\t }\\n }\\n if (maxSamples == 0){\\n\\t\\tmaxSamples = ii;\\n }\\n else {\\n\\t\\twhile (ii < maxSamples){\\n\\t \\t\\tsamples[ii] = 0;\\n\\t \\tii++;\\n\\t\\t}\\n }\\n//\\tdocument.write(ii);\\n//\\tdocument.write(\\\"
\\\");\\n// var delayLine = new Array;\\n// var pointer = 0;\\n// var delayLength = oneSecond / 2;\\n// for (var ijj = 0; ijj < groove.lineLength; ijj++){\\n//\\t\\tdelayLine[ijj] = 0;\\n// }\\n for (var repeat = 1 ; repeat < repeats; repeat++){\\n for (var jj = 0 ; jj < ii ; jj++){\\n samples[jj + ii * repeat] = samples[jj];\\n\\t if (delay){\\n//\\t\\tsamples[jj + ii * repeat] = samples[jj + ii * repeat] - 0.5*delayLine[pointer];\\n//\\t\\tdelayLine[pointer] = samples[jj + ii * repeat];\\n//\\t\\tpointer = (pointer+1)%lineLength;\\n }\\n\\t }\\n\\t}\\n return samples;\\n}\",\n \"function addEqualiser() {\\n\\n var gainDb = -40.0; // atenuation When it takes a positive value it is a real gain, when negative it is an attenuation. It is expressed in dB, has a default value of 0 and can take a value in a nominal range of -40 to 40.\\n var bandSplit = [360, 3600];\\n context_player = new AudioContext();\\n\\n for (var i = 0; i < 2; i++) {\\n\\n mediaElement_player.push(null);\\n sourceNode_player.push(null);\\n source_player.push(null);\\n lGain_player.push(null);\\n mGain_player.push(null);\\n hGain_player.push(null);\\n sum_player.push(null);\\n volumeNodes.push(null);\\n\\n\\n mediaElement_player[i] = document.getElementById('jp_audio_' + i);\\n source_player[i] = context_player.createMediaElementSource(mediaElement_player[i]);\\n\\n initFrequencyQuality(i);\\n\\n // affects the ammount of treble in a sound - treble knob - atenuates the sounds below the 3600 frequencies\\n var lBand_player = context_player.createBiquadFilter();\\n lBand_player.type = \\\"lowshelf\\\";\\n lBand_player.frequency.value = bandSplit[1];\\n lBand_player.gain.value = gainDb;\\n\\n // affects the ammount of bass in a sound - bass knob - atenuates the sounds higher than 360 frequencies\\n var hBand_player = context_player.createBiquadFilter();\\n hBand_player.type = \\\"highshelf\\\";\\n hBand_player.frequency.value = bandSplit[0];\\n hBand_player.gain.value = gainDb;\\n\\n var hInvert_player = context_player.createGain();\\n hInvert_player.gain.value = -1.0;\\n\\n //Subtract low and high frequencies (add invert) from the source for the mid frequencies\\n var mBand_player = context_player.createGain();\\n\\n //or use picking\\n //mBand_player = context_player.createBiquadFilter();\\n //mBand_player.type = \\\"peaking\\\";\\n //mBand_player.frequency.value = bandSplit[0];\\n //mBand_player.gain.value = gainDb;\\n\\n var lInvert_player = context_player.createGain();\\n lInvert_player.gain.value = -1.0;\\n\\n sourceNode_player[i].connect(lBand_player);\\n sourceNode_player[i].connect(mBand_player);\\n sourceNode_player[i].connect(hBand_player);\\n\\n hBand_player.connect(hInvert_player);\\n lBand_player.connect(lInvert_player);\\n\\n hInvert_player.connect(mBand_player);\\n lInvert_player.connect(mBand_player);\\n\\n\\n lGain_player[i] = context_player.createGain();\\n mGain_player[i] = context_player.createGain();\\n hGain_player[i] = context_player.createGain();\\n\\n lBand_player.connect(lGain_player[i]);\\n mBand_player.connect(mGain_player[i]);\\n hBand_player.connect(hGain_player[i]);\\n\\n sum_player[i] = context_player.createGain();\\n lGain_player[i].connect(sum_player[i]);\\n mGain_player[i].connect(sum_player[i]);\\n hGain_player[i].connect(sum_player[i]);\\n\\n lGain_player[i].gain.value = 1;\\n mGain_player[i].gain.value = 1;\\n hGain_player[i].gain.value = 1;\\n\\n volumeNodes[i] = context_player.createGain();\\n sum_player[i].connect(volumeNodes[i]);\\n volumeNodes[i].connect(context_player.destination);\\n }\\n\\n //set volume\\n var x = 50 / 100;\\n // Use an equal-power crossfading curve:\\n var gain1 = Math.cos(x * 0.5 * Math.PI);\\n var gain2 = Math.cos((1.0 - x) * 0.5 * Math.PI);\\n volumeNodes[0].gain.value = gain1;\\n volumeNodes[1].gain.value = gain2;\\n\\n //create audio Recording node\\n audioRecordNode = context_player.createGain();\\n volumeNodes[0].connect(audioRecordNode);\\n volumeNodes[1].connect(audioRecordNode);\\n audioRecorder = new Recorder(audioRecordNode);\\n}\",\n \"function sha1_ft(t, b, c, d) {\\n if (t < 20) return (b & c) | ((~b) & d);\\n if (t < 40) return b ^ c ^ d;\\n if (t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function adapt(delta,numPoints,firstTime){var k=0;delta=firstTime?floor(delta/damp):delta>>1;delta+=floor(delta/numPoints);for(;delta>baseMinusTMin*tMax>>1;k+=base){delta=floor(delta/baseMinusTMin)}return floor(k+(baseMinusTMin+1)*delta/(delta+skew))}\",\n \"function setupAudioNodes(audioContext, drawWaveformFunction, drawSpectrumFunction, drawSpectrogramFunction, htmlIds, colorScale)\\n{\\n // Setup a script node\\n let scriptNode = audioContext.createScriptProcessor();\\n // Connect to destination\\n scriptNode.connect(audioContext.destination);\\n \\n // Setup an analyzer\\n let analyser = audioContext.createAnalyser();\\n analyser.smoothingTimeConstant = 0;\\n // Higher FFT size means more bins. More bins mean more points to graph.\\n // Also means each bin has a smaller range of frequencies so it's kind of like more precise.\\n analyser.fftSize = 2048 * 2;\\n \\n // Create a buffer source node\\n let sourceNode = audioContext.createBufferSource();\\n sourceNode.connect(analyser);\\n analyser.connect(scriptNode);\\n \\n sourceNode.connect(audioContext.destination);\\n \\n console.log(\\\"Sample rate: \\\" + audioContext.sampleRate + \\\" Hz\\\");\\n console.log(\\\"FFT size: \\\" + analyser.fftSize);\\n // FrequencyBinCount is half of FFT size\\n console.log(\\\"FrequencyBinCount: \\\" + analyser.frequencyBinCount);\\n \\n let frequencyPerBin = (audioContext.sampleRate / 2) / analyser.frequencyBinCount;\\n console.log(\\\"Each frequency bin represents \\\" + frequencyPerBin + \\\" Hz of range\\\");\\n console.log(\\\"frequencyData[0]\\\" + \\\" is the strength of frequencies from \\\" + (0 * frequencyPerBin) + \\\" Hz to \\\" + ((0 + 1)*frequencyPerBin) + \\\" Hz\\\");\\n console.log(\\\"frequencyData[1]\\\" + \\\" is the strength of frequencies from \\\" + (1 * frequencyPerBin) + \\\" Hz to \\\" + ((1 + 1)*frequencyPerBin) + \\\" Hz\\\");\\n console.log(\\\"frequencyData[2]\\\" + \\\" is the strength of frequencies from \\\" + (2 * frequencyPerBin) + \\\" Hz to \\\" + ((2 + 1)*frequencyPerBin) + \\\" Hz\\\");\\n console.log(\\\"frequencyData[\\\" + (analyser.frequencyBinCount - 1) + \\\"]\\\" + \\\" is the strength of frequencies from \\\" + (analyser.frequencyBinCount - 1) * frequencyPerBin + \\\" Hz to \\\" + (((analyser.frequencyBinCount - 1) + 1) * frequencyPerBin) + \\\" Hz\\\");\\n \\n // When the script node is called we use information from the analyzer node to draw\\n scriptNode.onaudioprocess = function()\\n {\\n let frequencyData = new Uint8Array(analyser.frequencyBinCount);\\n analyser.getByteFrequencyData(frequencyData);\\n \\n let timeDomainData = new Uint8Array(analyser.frequencyBinCount);\\n analyser.getByteTimeDomainData(timeDomainData);\\n \\n if (sourceNode.buffer !== null)\\n {\\n //console.log(frequencyData);\\n //console.log(timeDomainData);\\n drawWaveformFunction(timeDomainData, htmlIds.waveformCanvas, colorScale);\\n drawSpectrumFunction(frequencyData, htmlIds.spectrumCanvas, colorScale);\\n drawSpectrogramFunction(frequencyData, htmlIds.spectrogramCanvas, colorScale);\\n }\\n }\\n \\n return sourceNode;\\n}\",\n \"function draw(data)\\n{\\n var spectrum = []; // an array that will hold noise cancelled data\\n var i, x, L=0, ldata=0, nBins=0, binNum=0, c=0; // uint8\\n var minLvl, maxLvl; //uint\\n var level, y, sum; //int\\n var offsetIndex = 0;\\n var FFT_N = 128; //data.length;\\n\\n samplePos = 0;\\n // Remove noise and apply EQ levels\\n for(x=0; x < FFT_N/2; x++ ) {\\n L = noise[x];\\n spectrum[x] = data[x+ offsetIndex];\\n if ( spectrum[x] < L ) {\\n spectrum[x] = 0;\\n } else {\\n spectrum[x] = ((spectrum[x] - L) * (256 - eq[x] >> peakHeight));\\n }\\n }\\n //fill colors first, then we will erase idle sections.\\n for(i=0; i < totalColumns; i++) {\\n client.setPixelColor(i, LED_RED); // row 0, RED\\n client.setPixelColor(8 + i, LED_BLUE); // Rwo 1, Blue\\n client.setPixelColor(16+ i, LED_BLUE); // Row 2, Blue\\n client.setPixelColor(24+ i, LED_GREEN); // Row 3, Green\\n client.setPixelColor(32+ i, LED_GREEN); // Row 4, Green\\n }\\n\\n for(x=0; x < totalColumns; x++ ) {\\n ldata = colData[x];\\n nBins = ldata[0] + 2;\\n binNum = ldata[1];\\n for(sum=0, i=2; i < nBins; i++ ) {\\n sum += spectrum[binNum++] * ldata[i]; // Weighted\\n colDiv[x] += data[x];\\n }\\n col[x][colCount] = sum / colDiv[x]; // Average\\n minLvl = maxLvl = col[x][0];\\n for(i=1; i < totalFrames; i++ ) {\\n if(col[x][i] < minLvl) {\\n minLvl = col[x][i];\\n } else if( col[x][i] > maxLvl ) {\\n maxLvl = col[x][i];\\n }\\n }\\n // minLvl and maxLvl indicate the extents of the FFT output, used\\n // for vertically scaling the output graph (so it looks interesting\\n // regardless of volume level). If they're too close together though\\n // (e.g. at very low volume levels) the graph becomes super coarse\\n // and 'jumpy'...so keep some minimum distance between them (this\\n // also lets the graph go to zero when no sound is playing):\\n\\n if( maxLvl-minLvl < peakHeight) {\\n maxLvl = minLvl + peakHeight;\\n }\\n minLvAvg[x] = (minLvAvg[x] * 7 + minLvl) >> 3; // Dampen min/max levels\\n maxLvAvg[x] = (maxLvAvg[x] * 7 + maxLvl) >> 3; // fake rolling average\\n // Second fixed-point scale based on dynamic min/max levels\\n level = 10 * (col[x][colCount] - minLvAvg[x]) / parseInt(maxLvAvg[x] - minLvAvg[x]);\\n // clip output and convert to byte\\n if( level < 0) { c = 0; }\\n else if ( level > peakOffTop ) { c = peakOffTop; } // Allow dot to go a few pixels off the top\\n else { c = parseInt(level); }\\n\\n if( c > peak[x] ) { peak[x] = c; } // keep dot on top\\n if(peak[x] < 0 ) { // empty the column\\n clearColumnLeds(x,peakHeight);\\n //continue;\\n } else if(c < peakHeight ) { // empty partial column\\n clearColumnLeds(x, peakHeight - c);\\n }\\n // the peak dot color varies but doesn't necessarily match\\n // the three screen regions.. yellow has a little more influence.\\n y = peakHeight - peak[x];\\n\\n /******************** DO NOT DELETE **********************/\\n /* Save this section for a high Peak Array of LEDs - It is not so useful for 5 pixel High\\n if( y < 1 ) { setColumnRowPixelColor(x,y, LED_RED); }\\n else if( y < 5 ) { setColumnRowPixelColor(x,y, LED_BLUE); }\\n else { setColumnRowPixelColor(x,y, LED_GREEN); }\\n */\\n /******************** DO NOT DELETE **********************/\\n\\n }\\n client.writePixels();\\n\\n /******************** Important **************************/\\n // Every third frame, make the peak pixels drop by 1:\\n if ( ++dotCount >= 3 ) {\\n dotCount = 0;\\n // reset Averages, col dividers and peaks\\n for ( i = 0; i < totalColumns; i++ ) {\\n minLvAvg[i] = 0;\\n maxLvAvg[i] = 512;\\n colDiv[i] = 0;\\n //peak[i] = 0; // We are dropping the peaks below\\n }\\n for ( x = 0; x < peakHeight; x++ ) {\\n peak[x] -= (peak[x] > 0) ? 1 : 0; // if peak is above 0, then subtract 1\\n }\\n // rotate hue over LEDs\\n LED_RED = OPC.rotateColor(1, LED_RED);\\n LED_BLUE = OPC.rotateColor(1, LED_BLUE);\\n LED_GREEN = OPC.rotateColor(1, LED_GREEN);\\n }\\n // Adjust the Frame Count\\n if ( ++colCount >= totalFrames ) {\\n colCount = 0;\\n }\\n\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.65954375","0.6168972","0.6044958","0.6022759","0.591924","0.58853126","0.5843347","0.577806","0.57772064","0.5703021","0.562801","0.55890924","0.5570078","0.5464318","0.54534","0.5339202","0.5326124","0.5318228","0.53027326","0.52718914","0.52644837","0.5250019","0.51002055","0.5096984","0.5089478","0.5085867","0.50818896","0.5062489","0.50592065","0.5053552","0.50457776","0.50395507","0.50318575","0.49991494","0.4997923","0.49906737","0.49865484","0.49865484","0.49596334","0.49486697","0.49455962","0.49007112","0.48839712","0.48683113","0.48617876","0.48600242","0.48516387","0.48220733","0.48169217","0.4816723","0.48098448","0.48025116","0.48025116","0.48025116","0.48025116","0.47310892","0.47233245","0.47233245","0.4707004","0.47061676","0.47017288","0.47017288","0.47017288","0.47017288","0.47017288","0.4687284","0.46807086","0.46659926","0.46513113","0.46496043","0.46476468","0.46458715","0.46238944","0.46099308","0.45991912","0.45899886","0.4589064","0.4589064","0.45789668","0.4576599","0.45682994","0.45675915","0.45629087","0.45546445","0.45448613","0.45376247","0.45360956","0.45337763","0.45290184","0.45245162","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879"],"string":"[\n \"0.65954375\",\n \"0.6168972\",\n \"0.6044958\",\n \"0.6022759\",\n \"0.591924\",\n \"0.58853126\",\n \"0.5843347\",\n \"0.577806\",\n \"0.57772064\",\n \"0.5703021\",\n \"0.562801\",\n \"0.55890924\",\n \"0.5570078\",\n \"0.5464318\",\n \"0.54534\",\n \"0.5339202\",\n \"0.5326124\",\n \"0.5318228\",\n \"0.53027326\",\n \"0.52718914\",\n \"0.52644837\",\n \"0.5250019\",\n \"0.51002055\",\n \"0.5096984\",\n \"0.5089478\",\n \"0.5085867\",\n \"0.50818896\",\n \"0.5062489\",\n \"0.50592065\",\n \"0.5053552\",\n \"0.50457776\",\n \"0.50395507\",\n \"0.50318575\",\n \"0.49991494\",\n \"0.4997923\",\n \"0.49906737\",\n \"0.49865484\",\n \"0.49865484\",\n \"0.49596334\",\n \"0.49486697\",\n \"0.49455962\",\n \"0.49007112\",\n \"0.48839712\",\n \"0.48683113\",\n \"0.48617876\",\n \"0.48600242\",\n \"0.48516387\",\n \"0.48220733\",\n \"0.48169217\",\n \"0.4816723\",\n \"0.48098448\",\n \"0.48025116\",\n \"0.48025116\",\n \"0.48025116\",\n \"0.48025116\",\n \"0.47310892\",\n \"0.47233245\",\n \"0.47233245\",\n \"0.4707004\",\n \"0.47061676\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.4687284\",\n \"0.46807086\",\n \"0.46659926\",\n \"0.46513113\",\n \"0.46496043\",\n \"0.46476468\",\n \"0.46458715\",\n \"0.46238944\",\n \"0.46099308\",\n \"0.45991912\",\n \"0.45899886\",\n \"0.4589064\",\n \"0.4589064\",\n \"0.45789668\",\n \"0.4576599\",\n \"0.45682994\",\n \"0.45675915\",\n \"0.45629087\",\n \"0.45546445\",\n \"0.45448613\",\n \"0.45376247\",\n \"0.45360956\",\n \"0.45337763\",\n \"0.45290184\",\n \"0.45245162\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80785,"cells":{"query":{"kind":"string","value":"Class: Buffer ============= The Buffer constructor returns instances of `Uint8Array` that are augmented with function properties for all the node `Buffer` API functions. We use `Uint8Array` so that square bracket notation works as expected it returns a single octet. By augmenting the instances, we can avoid modifying the `Uint8Array` prototype."},"document":{"kind":"string","value":"function Buffer (arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\n return new Buffer(arg)\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0\n this.parent = undefined\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg)\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n }\n\n // Unusual.\n return fromObject(this, arg)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer(arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n\t return new Buffer(arg);\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0;\n\t this.parent = undefined;\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg);\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg);\n\t}","function Buffer(arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n\t return new Buffer(arg);\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0;\n\t this.parent = undefined;\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg);\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg);\n\t}","function Buffer(arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n\t return new Buffer(arg);\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0;\n\t this.parent = undefined;\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg);\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg);\n\t}","function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\n\tif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}","function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}","function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}","function Buffer (arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\n return new Buffer(arg)\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0\n this.parent = undefined\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg)\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n }\n\n // Unusual.\n return fromObject(this, arg)\n }","function Buffer(arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1)\n return new Buffer(arg, arguments[1]);\n return new Buffer(arg);\n }\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0;\n this.parent = undefined;\n }\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg);\n }\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n }\n // Unusual.\n return fromObject(this, arg);\n }","function Buffer(arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\n return new Buffer(arg)\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0\n this.parent = undefined\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg)\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n }\n\n // Unusual.\n return fromObject(this, arg)\n }","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function Buffer(arg){if(!(this instanceof Buffer)){ // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\nif(arguments.length>1)return new Buffer(arg,arguments[1]);return new Buffer(arg);}if(!Buffer.TYPED_ARRAY_SUPPORT){this.length=0;this.parent=undefined;} // Common case.\nif(typeof arg==='number'){return fromNumber(this,arg);} // Slightly less common case.\nif(typeof arg==='string'){return fromString(this,arg,arguments.length>1?arguments[1]:'utf8');} // Unusual.\nreturn fromObject(this,arg);}","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n \n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer(arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n return new Buffer(arg);\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0;\n this.parent = undefined;\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg);\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n }\n\n // Unusual.\n return fromObject(this, arg);\n }","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer (arg) {\n\t\t if (!(this instanceof Buffer)) {\n\t\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t\t return new Buffer(arg)\n\t\t }\n\t\t\n\t\t this.length = 0\n\t\t this.parent = undefined\n\t\t\n\t\t // Common case.\n\t\t if (typeof arg === 'number') {\n\t\t return fromNumber(this, arg)\n\t\t }\n\t\t\n\t\t // Slightly less common case.\n\t\t if (typeof arg === 'string') {\n\t\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t\t }\n\t\t\n\t\t // Unusual.\n\t\t return fromObject(this, arg)\n\t\t}","function createByteContainer() {\n if (HAS_BUFFER)\n return new Buffer(0);\n\n return new Uint8Array();\n }","function createByteContainer() {\n if (HAS_BUFFER)\n return new Buffer(0);\n\n return new Uint8Array();\n }","function Buffer (subject, encoding, noZero) {\n if (!(this instanceof Buffer))\n return new Buffer(subject, encoding, noZero)\n\n var type = typeof subject\n\n // Find the length\n var length\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) { // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data))\n subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength)\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\n\n if (length < 0)\n length = 0\n else\n length >>>= 0 // Coerce to uint32.\n\n var self = this\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n /*eslint-disable consistent-this */\n self = Buffer._augment(new Uint8Array(length))\n /*eslint-enable consistent-this */\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++)\n self[i] = subject.readUInt8(i)\n } else {\n for (i = 0; i < length; i++)\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize)\n self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding, noZero) {\n if (!(this instanceof Buffer))\n return new Buffer(subject, encoding, noZero)\n\n var type = typeof subject\n\n // Find the length\n var length\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) { // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data))\n subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength)\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\n\n if (length < 0)\n length = 0\n else\n length >>>= 0 // Coerce to uint32.\n\n var self = this\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n /*eslint-disable consistent-this */\n self = Buffer._augment(new Uint8Array(length))\n /*eslint-enable consistent-this */\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++)\n self[i] = subject.readUInt8(i)\n } else {\n for (i = 0; i < length; i++)\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize)\n self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding, noZero) {\n if (!(this instanceof Buffer))\n return new Buffer(subject, encoding, noZero)\n\n var type = typeof subject\n\n // Find the length\n var length\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) { // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data))\n subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength)\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\n\n if (length < 0)\n length = 0\n else\n length >>>= 0 // Coerce to uint32.\n\n var self = this\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n /*eslint-disable consistent-this */\n self = Buffer._augment(new Uint8Array(length))\n /*eslint-enable consistent-this */\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++)\n self[i] = subject.readUInt8(i)\n } else {\n for (i = 0; i < length; i++)\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize)\n self.parent = rootParent\n\n return self\n}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}"],"string":"[\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer(arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n\\t return new Buffer(arg);\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0;\\n\\t this.parent = undefined;\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg);\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg);\\n\\t}\",\n \"function Buffer(arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n\\t return new Buffer(arg);\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0;\\n\\t this.parent = undefined;\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg);\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg);\\n\\t}\",\n \"function Buffer(arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n\\t return new Buffer(arg);\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0;\\n\\t this.parent = undefined;\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg);\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg);\\n\\t}\",\n \"function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\\n\\tif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}\",\n \"function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}\",\n \"function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}\",\n \"function Buffer (arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n return new Buffer(arg)\\n }\\n\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0\\n this.parent = undefined\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg)\\n }\\n\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n }\\n\\n // Unusual.\\n return fromObject(this, arg)\\n }\",\n \"function Buffer(arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1)\\n return new Buffer(arg, arguments[1]);\\n return new Buffer(arg);\\n }\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0;\\n this.parent = undefined;\\n }\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg);\\n }\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n }\\n // Unusual.\\n return fromObject(this, arg);\\n }\",\n \"function Buffer(arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n return new Buffer(arg)\\n }\\n\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0\\n this.parent = undefined\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg)\\n }\\n\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n }\\n\\n // Unusual.\\n return fromObject(this, arg)\\n }\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function Buffer(arg){if(!(this instanceof Buffer)){ // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\nif(arguments.length>1)return new Buffer(arg,arguments[1]);return new Buffer(arg);}if(!Buffer.TYPED_ARRAY_SUPPORT){this.length=0;this.parent=undefined;} // Common case.\\nif(typeof arg==='number'){return fromNumber(this,arg);} // Slightly less common case.\\nif(typeof arg==='string'){return fromString(this,arg,arguments.length>1?arguments[1]:'utf8');} // Unusual.\\nreturn fromObject(this,arg);}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n \\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer(arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n return new Buffer(arg);\\n }\\n\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0;\\n this.parent = undefined;\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg);\\n }\\n\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n }\\n\\n // Unusual.\\n return fromObject(this, arg);\\n }\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer (arg) {\\n\\t\\t if (!(this instanceof Buffer)) {\\n\\t\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t\\t return new Buffer(arg)\\n\\t\\t }\\n\\t\\t\\n\\t\\t this.length = 0\\n\\t\\t this.parent = undefined\\n\\t\\t\\n\\t\\t // Common case.\\n\\t\\t if (typeof arg === 'number') {\\n\\t\\t return fromNumber(this, arg)\\n\\t\\t }\\n\\t\\t\\n\\t\\t // Slightly less common case.\\n\\t\\t if (typeof arg === 'string') {\\n\\t\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t\\t }\\n\\t\\t\\n\\t\\t // Unusual.\\n\\t\\t return fromObject(this, arg)\\n\\t\\t}\",\n \"function createByteContainer() {\\n if (HAS_BUFFER)\\n return new Buffer(0);\\n\\n return new Uint8Array();\\n }\",\n \"function createByteContainer() {\\n if (HAS_BUFFER)\\n return new Buffer(0);\\n\\n return new Uint8Array();\\n }\",\n \"function Buffer (subject, encoding, noZero) {\\n if (!(this instanceof Buffer))\\n return new Buffer(subject, encoding, noZero)\\n\\n var type = typeof subject\\n\\n // Find the length\\n var length\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) { // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data))\\n subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength)\\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\\n\\n if (length < 0)\\n length = 0\\n else\\n length >>>= 0 // Coerce to uint32.\\n\\n var self = this\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n /*eslint-disable consistent-this */\\n self = Buffer._augment(new Uint8Array(length))\\n /*eslint-enable consistent-this */\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++)\\n self[i] = subject.readUInt8(i)\\n } else {\\n for (i = 0; i < length; i++)\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize)\\n self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding, noZero) {\\n if (!(this instanceof Buffer))\\n return new Buffer(subject, encoding, noZero)\\n\\n var type = typeof subject\\n\\n // Find the length\\n var length\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) { // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data))\\n subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength)\\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\\n\\n if (length < 0)\\n length = 0\\n else\\n length >>>= 0 // Coerce to uint32.\\n\\n var self = this\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n /*eslint-disable consistent-this */\\n self = Buffer._augment(new Uint8Array(length))\\n /*eslint-enable consistent-this */\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++)\\n self[i] = subject.readUInt8(i)\\n } else {\\n for (i = 0; i < length; i++)\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize)\\n self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding, noZero) {\\n if (!(this instanceof Buffer))\\n return new Buffer(subject, encoding, noZero)\\n\\n var type = typeof subject\\n\\n // Find the length\\n var length\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) { // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data))\\n subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength)\\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\\n\\n if (length < 0)\\n length = 0\\n else\\n length >>>= 0 // Coerce to uint32.\\n\\n var self = this\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n /*eslint-disable consistent-this */\\n self = Buffer._augment(new Uint8Array(length))\\n /*eslint-enable consistent-this */\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++)\\n self[i] = subject.readUInt8(i)\\n } else {\\n for (i = 0; i < length; i++)\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize)\\n self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7387608","0.7387608","0.7387608","0.7387608","0.7387608","0.7387608","0.7387608","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73214823","0.73214823","0.73214823","0.73214823","0.73214823","0.7310611","0.7306889","0.7306889","0.7272222","0.7244172","0.7244172","0.71993977","0.71977997","0.71967536","0.71846634","0.71846634","0.71846634","0.71846634","0.71622974","0.71517247","0.71415156","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.71168745","0.71168745","0.71168745","0.7110093","0.7100295","0.7100295","0.70932084","0.70932084","0.70932084","0.7091139","0.7091139","0.7091139","0.7091139","0.7091139","0.7091139","0.70889336","0.70889336"],"string":"[\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.7310611\",\n \"0.7306889\",\n \"0.7306889\",\n \"0.7272222\",\n \"0.7244172\",\n \"0.7244172\",\n \"0.71993977\",\n \"0.71977997\",\n \"0.71967536\",\n \"0.71846634\",\n \"0.71846634\",\n \"0.71846634\",\n \"0.71846634\",\n \"0.71622974\",\n \"0.71517247\",\n \"0.71415156\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.71168745\",\n \"0.71168745\",\n \"0.71168745\",\n \"0.7110093\",\n \"0.7100295\",\n \"0.7100295\",\n \"0.70932084\",\n \"0.70932084\",\n \"0.70932084\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.70889336\",\n \"0.70889336\"\n]"},"document_score":{"kind":"string","value":"0.71254957"},"document_rank":{"kind":"string","value":"65"}}},{"rowIdx":80786,"cells":{"query":{"kind":"string","value":"Duplicate of fromArray() to keep fromArray() monomorphic."},"document":{"kind":"string","value":"function fromTypedArray (that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function fromArray(as) {\n // For some reason, TypeScript does not infer this type correctly\n var b = build;\n var f = as.reduce(b, []);\n return f;\n }","function __spreadArray(to, from) {\n for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\n to[j] = from[i];\n return to;\n }","function cloneArrFrom(arr) {\n let newArr = Array.from(arr);\n return newArr;\n}","function fromTypedArray(that, array) {\n var length = checked(array.length) | 0;\n that = allocate(that, length);\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255;\n }\n return that;\n }","function fromTypedArray(that, array) {\n var length = checked(array.length) | 0;\n that = allocate(that, length);\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255;\n }\n return that;\n }","function fromTypedArray(that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n }","function copyArray() {\n return new Array(...array);\n}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray (that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n }","function fromTypedArray (that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n }","function fromArray(as) {\n return as.reduce(build, {});\n }","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","static fromArray(arr) {\n return Matrix.map(new Matrix(arr.length, 1), (_, i) => arr[i]);\n }","function fromTypedArray (that, array) {\n\t\t var length = checked(array.length) | 0\n\t\t that = allocate(that, length)\n\t\t // Truncating the elements is probably not what people expect from typed\n\t\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t\t // of the old Buffer constructor.\n\t\t for (var i = 0; i < length; i += 1) {\n\t\t that[i] = array[i] & 255\n\t\t }\n\t\t return that\n\t\t}","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","copyArray(arr) {\n\t\treturn Array.from(arr).map((val, ind) => Array.from(arr[ind]));\n\t}","function _toConsumableArray(arr){if(Array.isArray(arr)){for(var i=0,arr2=Array(arr.length);i=0;i--) r = (h$c2(h$ghczmprimZCGHCziTypesziZC_con_e, ((h$c1(h$ghcjszmprimZCGHCJSziPrimziJSVal_con_e, (a[i])))), (r)));\n return a;\n}","function h$fromArray(a) {\n var r = h$ghczmprimZCGHCziTypesziZMZN;\n for(var i=a.length-1;i>=0;i--) r = (h$c2(h$ghczmprimZCGHCziTypesziZC_con_e, ((h$c1(h$ghcjszmprimZCGHCJSziPrimziJSVal_con_e, (a[i])))), (r)));\n return a;\n}","function h$fromArray(a) {\n var r = h$ghczmprimZCGHCziTypesziZMZN;\n for(var i=a.length-1;i>=0;i--) r = (h$c2(h$ghczmprimZCGHCziTypesziZC_con_e, ((h$c1(h$ghcjszmprimZCGHCJSziPrimziJSVal_con_e, (a[i])))), (r)));\n return a;\n}"],"string":"[\n \"function fromArray(as) {\\n // For some reason, TypeScript does not infer this type correctly\\n var b = build;\\n var f = as.reduce(b, []);\\n return f;\\n }\",\n \"function __spreadArray(to, from) {\\n for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\\n to[j] = from[i];\\n return to;\\n }\",\n \"function cloneArrFrom(arr) {\\n let newArr = Array.from(arr);\\n return newArr;\\n}\",\n \"function fromTypedArray(that, array) {\\n var length = checked(array.length) | 0;\\n that = allocate(that, length);\\n // Truncating the elements is probably not what people expect from typed\\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n // of the old Buffer constructor.\\n for (var i = 0; i < length; i += 1) {\\n that[i] = array[i] & 255;\\n }\\n return that;\\n }\",\n \"function fromTypedArray(that, array) {\\n var length = checked(array.length) | 0;\\n that = allocate(that, length);\\n // Truncating the elements is probably not what people expect from typed\\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n // of the old Buffer constructor.\\n for (var i = 0; i < length; i += 1) {\\n that[i] = array[i] & 255;\\n }\\n return that;\\n }\",\n \"function fromTypedArray(that, array) {\\n var length = checked(array.length) | 0\\n that = allocate(that, length)\\n // Truncating the elements is probably not what people expect from typed\\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n // of the old Buffer constructor.\\n for (var i = 0; i < length; i += 1) {\\n that[i] = array[i] & 255\\n }\\n return that\\n }\",\n \"function copyArray() {\\n return new Array(...array);\\n}\",\n \"function fromTypedArray(that, array) {\\n\\t var length = checked(array.length) | 0;\\n\\t that = allocate(that, length);\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255;\\n\\t }\\n\\t return that;\\n\\t}\",\n \"function fromTypedArray(that, array) {\\n\\t var length = checked(array.length) | 0;\\n\\t that = allocate(that, length);\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255;\\n\\t }\\n\\t return that;\\n\\t}\",\n \"function fromTypedArray(that, array) {\\n\\t var length = checked(array.length) | 0;\\n\\t that = allocate(that, length);\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255;\\n\\t }\\n\\t return that;\\n\\t}\",\n \"function fromTypedArray(that, array) {\\n\\t var length = checked(array.length) | 0;\\n\\t that = allocate(that, length);\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255;\\n\\t }\\n\\t return that;\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n var length = checked(array.length) | 0\\n that = allocate(that, length)\\n // Truncating the elements is probably not what people expect from typed\\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n // of the old Buffer constructor.\\n for (var i = 0; i < length; i += 1) {\\n that[i] = array[i] & 255\\n }\\n return that\\n }\",\n \"function fromTypedArray (that, array) {\\n var length = checked(array.length) | 0\\n that = allocate(that, length)\\n // Truncating the elements is probably not what people expect from typed\\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n // of the old Buffer constructor.\\n for (var i = 0; i < length; i += 1) {\\n that[i] = array[i] & 255\\n }\\n return that\\n }\",\n \"function fromArray(as) {\\n return as.reduce(build, {});\\n }\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"function fromTypedArray (that, array) {\\n\\t var length = checked(array.length) | 0\\n\\t that = allocate(that, length)\\n\\t // Truncating the elements is probably not what people expect from typed\\n\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t // of the old Buffer constructor.\\n\\t for (var i = 0; i < length; i += 1) {\\n\\t that[i] = array[i] & 255\\n\\t }\\n\\t return that\\n\\t}\",\n \"static fromArray(arr) {\\n return Matrix.map(new Matrix(arr.length, 1), (_, i) => arr[i]);\\n }\",\n \"function fromTypedArray (that, array) {\\n\\t\\t var length = checked(array.length) | 0\\n\\t\\t that = allocate(that, length)\\n\\t\\t // Truncating the elements is probably not what people expect from typed\\n\\t\\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\\n\\t\\t // of the old Buffer constructor.\\n\\t\\t for (var i = 0; i < length; i += 1) {\\n\\t\\t that[i] = array[i] & 255\\n\\t\\t }\\n\\t\\t return that\\n\\t\\t}\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\",\n \"copyArray(arr) {\\n\\t\\treturn Array.from(arr).map((val, ind) => Array.from(arr[ind]));\\n\\t}\",\n \"function _toConsumableArray(arr){if(Array.isArray(arr)){for(var i=0,arr2=Array(arr.length);i=0;i--) r = (h$c2(h$ghczmprimZCGHCziTypesziZC_con_e, ((h$c1(h$ghcjszmprimZCGHCJSziPrimziJSVal_con_e, (a[i])))), (r)));\\n return a;\\n}\",\n \"function h$fromArray(a) {\\n var r = h$ghczmprimZCGHCziTypesziZMZN;\\n for(var i=a.length-1;i>=0;i--) r = (h$c2(h$ghczmprimZCGHCziTypesziZC_con_e, ((h$c1(h$ghcjszmprimZCGHCJSziPrimziJSVal_con_e, (a[i])))), (r)));\\n return a;\\n}\",\n \"function h$fromArray(a) {\\n var r = h$ghczmprimZCGHCziTypesziZMZN;\\n for(var i=a.length-1;i>=0;i--) r = (h$c2(h$ghczmprimZCGHCziTypesziZC_con_e, ((h$c1(h$ghcjszmprimZCGHCJSziPrimziJSVal_con_e, (a[i])))), (r)));\\n return a;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.65889376","0.65335846","0.6512674","0.64970803","0.6463127","0.6455966","0.644092","0.63979745","0.63979745","0.63979745","0.63979745","0.63100034","0.63100034","0.62795615","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6261167","0.6212621","0.6197625","0.61800444","0.61800444","0.61800444","0.61800444","0.61800444","0.61800444","0.61800444","0.61800444","0.61800444","0.61800444","0.6108512","0.6101382","0.6098474","0.6090728","0.6090728","0.6090728"],"string":"[\n \"0.65889376\",\n \"0.65335846\",\n \"0.6512674\",\n \"0.64970803\",\n \"0.6463127\",\n \"0.6455966\",\n \"0.644092\",\n \"0.63979745\",\n \"0.63979745\",\n \"0.63979745\",\n \"0.63979745\",\n \"0.63100034\",\n \"0.63100034\",\n \"0.62795615\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6261167\",\n \"0.6212621\",\n \"0.6197625\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.61800444\",\n \"0.6108512\",\n \"0.6101382\",\n \"0.6098474\",\n \"0.6090728\",\n \"0.6090728\",\n \"0.6090728\"\n]"},"document_score":{"kind":"string","value":"0.62321496"},"document_rank":{"kind":"string","value":"78"}}},{"rowIdx":80787,"cells":{"query":{"kind":"string","value":"Need to make sure that buffer isn't trying to write out of bounds."},"document":{"kind":"string","value":"function checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function writeBuffer(buffer, pos, src) {\n src.copy(buffer, pos)\n return src.length\n}","function writeBuffer(buffer, pos, src) {\n src.copy(buffer, pos)\n return src.length\n}","ensure(n) {\n let minsize = this.pos + n;\n if (minsize > this.capacity) {\n let cap = this.capacity * 2;\n while (cap < minsize) cap *= 2;\n let newbuf = new Uint8Array(cap);\n newbuf.set(this.buffer);\n this.buffer = newbuf;\n this.capacity = cap;\n }\n }","function bufferOutOfBounds(name = undefined) {\n if (name) {\n return `\"${name}\" is outside of buffer bounds`;\n }\n return 'Attempt to write outside buffer bounds';\n}","writeBytes(value) {\n let start = 0;\n let valueLen = value.length;\n while (valueLen > 0) {\n const bytesLeft = this.numBytesLeft();\n if (bytesLeft === 0) {\n this._grow(this.pos + valueLen);\n }\n const bytesToWrite = Math.min(bytesLeft, valueLen);\n value.copy(this.buf, this.pos, start, start + bytesToWrite);\n this.pos += bytesToWrite;\n start += bytesToWrite;\n valueLen -= bytesToWrite;\n }\n }","function checkLen(len){\n if(pos + len > buf.length)\n throw new Error('Broken data stream at pos ' + pos + ' (need ' + len + ' more bytes)');\n }","oob() {\n return this.at > this.buffer.byteLength || this.at < 0;\n }","_blockedWrite() {\n throw new Error('Cannot write because the writer has been closed.');\n }","_blockedWrite() {\n throw new Error('Cannot write because the writer has been closed.');\n }","function write() {\n\t// Bail if the write queue is invalid\n\tif (!check_queue_write()) return;\n\n\t// Create message from buffer\n\tlet buffer = proto.proto.create(intf.intf.queue_write[intf.intf.queue_write.length - 1]);\n\n\tif (typeof buffer === 'undefined' || buffer === null || buffer === '') return;\n\n\tintf.intf.port.write(buffer, (error) => {\n\t\t// Bail and retry if there was a write error\n\t\tif (error) {\n\t\t\terror_out('writing', error);\n\n\t\t\t// Re-kick it\n\t\t\tsetImmediate(write);\n\n\t\t\treturn;\n\t\t}\n\n\t\tintf.intf.port.drain(() => {\n\t\t\t// After a successful write and drain, remove the last element from the write queue\n\t\t\tintf.intf.queue_write.pop();\n\n\t\t\t// Re-kick it\n\t\t\t// setImmediate(write);\n\t\t\tprocess.nextTick(write);\n\t\t});\n\t});\n}","write(sequence, offset) {\n offset = typeof offset === 'number' ? offset : this.position;\n // If the buffer is to small let's extend the buffer\n if (this.buffer.length < offset + sequence.length) {\n const buffer$1 = buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.alloc(this.buffer.length + sequence.length);\n this.buffer.copy(buffer$1, 0, 0, this.buffer.length);\n // Assign the new buffer\n this.buffer = buffer$1;\n }\n if (ArrayBuffer.isView(sequence)) {\n this.buffer.set(ensure_buffer.ensureBuffer(sequence), offset);\n this.position =\n offset + sequence.byteLength > this.position ? offset + sequence.length : this.position;\n }\n else if (typeof sequence === 'string') {\n this.buffer.write(sequence, offset, sequence.length, 'binary');\n this.position =\n offset + sequence.length > this.position ? offset + sequence.length : this.position;\n }\n }","function pushError(){assert.throws(function(){r.push(new Buffer(1))})}","function writeBuffer()\n{\n fs.writeFile(outputFile, outputBuffer, 'utf8', function (error) {\n if (error)\n {\n console.log('Could not write the file', error);\n }\n\n exit();\n });\n}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0)\n\t throw new RangeError('offset is not uint')\n\t if (offset + ext > length)\n\t throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}","function checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0)\n throw new RangeError('offset is not uint')\n if (offset + ext > length)\n throw new RangeError('Trying to access beyond buffer length')\n }","function checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n }","function checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n }","function checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n }","function writeOrBuffer(stream, state, chunk, encoding, cb) {\n\t chunk = decodeChunk(state, chunk, encoding);\n\t if (util.isBuffer(chunk)) encoding = 'buffer';\n\t var len = state.objectMode ? 1 : chunk.length;\n\n\t state.length += len;\n\n\t var ret = state.length < state.highWaterMark;\n\t // we must ensure that previous needDrain will not be reset to false.\n\t if (!ret) state.needDrain = true;\n\n\t if (state.writing || state.corked) state.buffer.push(new WriteReq(chunk, encoding, cb));else doWrite(stream, state, false, len, chunk, encoding, cb);\n\n\t return ret;\n\t}","onDrain() {\n this.writeBuffer.splice(0, this.prevBufferLen);\n\n // setting prevBufferLen = 0 is very important\n // for example, when upgrading, upgrade packet is sent over,\n // and a nonzero prevBufferLen could cause problems on `drain`\n this.prevBufferLen = 0;\n\n if (0 === this.writeBuffer.length) {\n this.emit(\"drain\");\n } else {\n this.flush();\n }\n }","onDrain() {\n this.writeBuffer.splice(0, this.prevBufferLen);\n\n // setting prevBufferLen = 0 is very important\n // for example, when upgrading, upgrade packet is sent over,\n // and a nonzero prevBufferLen could cause problems on `drain`\n this.prevBufferLen = 0;\n\n if (0 === this.writeBuffer.length) {\n this.emit(\"drain\");\n } else {\n this.flush();\n }\n }","function checkOffset (offset, ext, length) {\n\t\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t\t}","function writeLength(buffer, pos, length) {\n var digit = 0\n , origPos = pos\n\n do {\n digit = length % 128 | 0\n length = length / 128 | 0\n if (length > 0) {\n digit = digit | 0x80\n }\n buffer.writeUInt8(digit, pos++, true)\n } while (length > 0)\n\n return pos - origPos\n}","function writeLength(buffer, pos, length) {\n var digit = 0\n , origPos = pos\n\n do {\n digit = length % 128 | 0\n length = length / 128 | 0\n if (length > 0) {\n digit = digit | 0x80\n }\n buffer.writeUInt8(digit, pos++, true)\n } while (length > 0)\n\n return pos - origPos\n}","function checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n }","function checkOffset(offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n }","function writeOrBuffer(stream, state, chunk, encoding, cb) {\n\t chunk = decodeChunk(state, chunk, encoding);\n\t if (Buffer.isBuffer(chunk))\n\t encoding = 'buffer';\n\t var len = state.objectMode ? 1 : chunk.length;\n\t\n\t state.length += len;\n\t\n\t var ret = state.length < state.highWaterMark;\n\t // we must ensure that previous needDrain will not be reset to false.\n\t if (!ret)\n\t state.needDrain = true;\n\t\n\t if (state.writing)\n\t state.buffer.push(new WriteReq(chunk, encoding, cb));\n\t else\n\t doWrite(stream, state, len, chunk, encoding, cb);\n\t\n\t return ret;\n\t}"],"string":"[\n \"function writeBuffer(buffer, pos, src) {\\n src.copy(buffer, pos)\\n return src.length\\n}\",\n \"function writeBuffer(buffer, pos, src) {\\n src.copy(buffer, pos)\\n return src.length\\n}\",\n \"ensure(n) {\\n let minsize = this.pos + n;\\n if (minsize > this.capacity) {\\n let cap = this.capacity * 2;\\n while (cap < minsize) cap *= 2;\\n let newbuf = new Uint8Array(cap);\\n newbuf.set(this.buffer);\\n this.buffer = newbuf;\\n this.capacity = cap;\\n }\\n }\",\n \"function bufferOutOfBounds(name = undefined) {\\n if (name) {\\n return `\\\"${name}\\\" is outside of buffer bounds`;\\n }\\n return 'Attempt to write outside buffer bounds';\\n}\",\n \"writeBytes(value) {\\n let start = 0;\\n let valueLen = value.length;\\n while (valueLen > 0) {\\n const bytesLeft = this.numBytesLeft();\\n if (bytesLeft === 0) {\\n this._grow(this.pos + valueLen);\\n }\\n const bytesToWrite = Math.min(bytesLeft, valueLen);\\n value.copy(this.buf, this.pos, start, start + bytesToWrite);\\n this.pos += bytesToWrite;\\n start += bytesToWrite;\\n valueLen -= bytesToWrite;\\n }\\n }\",\n \"function checkLen(len){\\n if(pos + len > buf.length)\\n throw new Error('Broken data stream at pos ' + pos + ' (need ' + len + ' more bytes)');\\n }\",\n \"oob() {\\n return this.at > this.buffer.byteLength || this.at < 0;\\n }\",\n \"_blockedWrite() {\\n throw new Error('Cannot write because the writer has been closed.');\\n }\",\n \"_blockedWrite() {\\n throw new Error('Cannot write because the writer has been closed.');\\n }\",\n \"function write() {\\n\\t// Bail if the write queue is invalid\\n\\tif (!check_queue_write()) return;\\n\\n\\t// Create message from buffer\\n\\tlet buffer = proto.proto.create(intf.intf.queue_write[intf.intf.queue_write.length - 1]);\\n\\n\\tif (typeof buffer === 'undefined' || buffer === null || buffer === '') return;\\n\\n\\tintf.intf.port.write(buffer, (error) => {\\n\\t\\t// Bail and retry if there was a write error\\n\\t\\tif (error) {\\n\\t\\t\\terror_out('writing', error);\\n\\n\\t\\t\\t// Re-kick it\\n\\t\\t\\tsetImmediate(write);\\n\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tintf.intf.port.drain(() => {\\n\\t\\t\\t// After a successful write and drain, remove the last element from the write queue\\n\\t\\t\\tintf.intf.queue_write.pop();\\n\\n\\t\\t\\t// Re-kick it\\n\\t\\t\\t// setImmediate(write);\\n\\t\\t\\tprocess.nextTick(write);\\n\\t\\t});\\n\\t});\\n}\",\n \"write(sequence, offset) {\\n offset = typeof offset === 'number' ? offset : this.position;\\n // If the buffer is to small let's extend the buffer\\n if (this.buffer.length < offset + sequence.length) {\\n const buffer$1 = buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.alloc(this.buffer.length + sequence.length);\\n this.buffer.copy(buffer$1, 0, 0, this.buffer.length);\\n // Assign the new buffer\\n this.buffer = buffer$1;\\n }\\n if (ArrayBuffer.isView(sequence)) {\\n this.buffer.set(ensure_buffer.ensureBuffer(sequence), offset);\\n this.position =\\n offset + sequence.byteLength > this.position ? offset + sequence.length : this.position;\\n }\\n else if (typeof sequence === 'string') {\\n this.buffer.write(sequence, offset, sequence.length, 'binary');\\n this.position =\\n offset + sequence.length > this.position ? offset + sequence.length : this.position;\\n }\\n }\",\n \"function pushError(){assert.throws(function(){r.push(new Buffer(1))})}\",\n \"function writeBuffer()\\n{\\n fs.writeFile(outputFile, outputBuffer, 'utf8', function (error) {\\n if (error)\\n {\\n console.log('Could not write the file', error);\\n }\\n\\n exit();\\n });\\n}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0)\\n\\t throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length)\\n\\t throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t}\",\n \"function checkOffset (offset, ext, length) {\\n if ((offset % 1) !== 0 || offset < 0)\\n throw new RangeError('offset is not uint')\\n if (offset + ext > length)\\n throw new RangeError('Trying to access beyond buffer length')\\n }\",\n \"function checkOffset (offset, ext, length) {\\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n }\",\n \"function checkOffset (offset, ext, length) {\\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n }\",\n \"function checkOffset (offset, ext, length) {\\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n }\",\n \"function writeOrBuffer(stream, state, chunk, encoding, cb) {\\n\\t chunk = decodeChunk(state, chunk, encoding);\\n\\t if (util.isBuffer(chunk)) encoding = 'buffer';\\n\\t var len = state.objectMode ? 1 : chunk.length;\\n\\n\\t state.length += len;\\n\\n\\t var ret = state.length < state.highWaterMark;\\n\\t // we must ensure that previous needDrain will not be reset to false.\\n\\t if (!ret) state.needDrain = true;\\n\\n\\t if (state.writing || state.corked) state.buffer.push(new WriteReq(chunk, encoding, cb));else doWrite(stream, state, false, len, chunk, encoding, cb);\\n\\n\\t return ret;\\n\\t}\",\n \"onDrain() {\\n this.writeBuffer.splice(0, this.prevBufferLen);\\n\\n // setting prevBufferLen = 0 is very important\\n // for example, when upgrading, upgrade packet is sent over,\\n // and a nonzero prevBufferLen could cause problems on `drain`\\n this.prevBufferLen = 0;\\n\\n if (0 === this.writeBuffer.length) {\\n this.emit(\\\"drain\\\");\\n } else {\\n this.flush();\\n }\\n }\",\n \"onDrain() {\\n this.writeBuffer.splice(0, this.prevBufferLen);\\n\\n // setting prevBufferLen = 0 is very important\\n // for example, when upgrading, upgrade packet is sent over,\\n // and a nonzero prevBufferLen could cause problems on `drain`\\n this.prevBufferLen = 0;\\n\\n if (0 === this.writeBuffer.length) {\\n this.emit(\\\"drain\\\");\\n } else {\\n this.flush();\\n }\\n }\",\n \"function checkOffset (offset, ext, length) {\\n\\t\\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n\\t\\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n\\t\\t}\",\n \"function writeLength(buffer, pos, length) {\\n var digit = 0\\n , origPos = pos\\n\\n do {\\n digit = length % 128 | 0\\n length = length / 128 | 0\\n if (length > 0) {\\n digit = digit | 0x80\\n }\\n buffer.writeUInt8(digit, pos++, true)\\n } while (length > 0)\\n\\n return pos - origPos\\n}\",\n \"function writeLength(buffer, pos, length) {\\n var digit = 0\\n , origPos = pos\\n\\n do {\\n digit = length % 128 | 0\\n length = length / 128 | 0\\n if (length > 0) {\\n digit = digit | 0x80\\n }\\n buffer.writeUInt8(digit, pos++, true)\\n } while (length > 0)\\n\\n return pos - origPos\\n}\",\n \"function checkOffset (offset, ext, length) {\\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n }\",\n \"function checkOffset(offset, ext, length) {\\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\\n }\",\n \"function writeOrBuffer(stream, state, chunk, encoding, cb) {\\n\\t chunk = decodeChunk(state, chunk, encoding);\\n\\t if (Buffer.isBuffer(chunk))\\n\\t encoding = 'buffer';\\n\\t var len = state.objectMode ? 1 : chunk.length;\\n\\t\\n\\t state.length += len;\\n\\t\\n\\t var ret = state.length < state.highWaterMark;\\n\\t // we must ensure that previous needDrain will not be reset to false.\\n\\t if (!ret)\\n\\t state.needDrain = true;\\n\\t\\n\\t if (state.writing)\\n\\t state.buffer.push(new WriteReq(chunk, encoding, cb));\\n\\t else\\n\\t doWrite(stream, state, len, chunk, encoding, cb);\\n\\t\\n\\t return ret;\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.66716176","0.66716176","0.66315866","0.6520346","0.63839465","0.627423","0.6253665","0.62347245","0.62347245","0.6108547","0.6036368","0.6017906","0.59830993","0.59575397","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.59489954","0.5946407","0.5938225","0.5938225","0.5938225","0.593551","0.5929771","0.5929771","0.5923442","0.59165347","0.59165347","0.59157187","0.59137034","0.5911989"],"string":"[\n \"0.66716176\",\n \"0.66716176\",\n \"0.66315866\",\n \"0.6520346\",\n \"0.63839465\",\n \"0.627423\",\n \"0.6253665\",\n \"0.62347245\",\n \"0.62347245\",\n \"0.6108547\",\n \"0.6036368\",\n \"0.6017906\",\n \"0.59830993\",\n \"0.59575397\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.59489954\",\n \"0.5946407\",\n \"0.5938225\",\n \"0.5938225\",\n \"0.5938225\",\n \"0.593551\",\n \"0.5929771\",\n \"0.5929771\",\n \"0.5923442\",\n \"0.59165347\",\n \"0.59165347\",\n \"0.59157187\",\n \"0.59137034\",\n \"0.5911989\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80788,"cells":{"query":{"kind":"string","value":"Copyright Joyent, Inc. and other Node contributors. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. NOTE: These type checking functions intentionally don't use `instanceof` because it is fragile and can be easily faked with `Object.create()`."},"document":{"kind":"string","value":"function isArray(arg) {\n if (Array.isArray) {\n return Array.isArray(arg);\n }\n return objectToString(arg) === '[object Array]';\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function t(e){return!!e.constructor&&'function'==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function n(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function o(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function F(t) {\n return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function Y(t) {\n return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n}","function e(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function n(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function n(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function fe(t) {\n return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n}","function an(t) {\n return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n}","function n(r){return!!r.constructor&&typeof r.constructor.isBuffer==\"function\"&&r.constructor.isBuffer(r)}","function u(e){return!0===\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}","function r(t){return t&&\"object\"===typeof t}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function isPlainObject(input){return typeof input==='object'&&input!==null&&(Object.getPrototypeOf(input)===Object.prototype||Object.getPrototypeOf(input)===null);}","function i(e){return!0===\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}","function builtinprototypesarenotinstances() {\n try {\n Boolean.prototype.valueOf(); return false;\n } catch(e) {}\n try {\n Number.prototype.valueOf(); return false;\n } catch(e) {}\n try {\n String.prototype.toString(); return false;\n } catch(e) {}\n try {\n RegExp.prototype.source; return false;\n } catch(e) {}\n try {\n Date.prototype.valueOf(); return false;\n } catch(e) {}\n return true;\n}","function Ko(t) {\n return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n}","function testcase() {\n var numProto = Object.getPrototypeOf(new Number(42));\n var s = Object.prototype.toString.call(numProto );\n return (s === '[object Object]') ;\n }","function v11(v12,v13) {\n const v15 = v11(Object,Function);\n // v15 = .unknown\n const v16 = Object(v13,v8,0,v6);\n // v16 = .object()\n const v17 = 0;\n // v17 = .integer\n const v18 = 1;\n // v18 = .integer\n const v19 = 512;\n // v19 = .integer\n const v20 = \"-1024\";\n // v20 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v21 = isFinite;\n // v21 = .function([.anything] => .boolean)\n const v23 = [1337];\n // v23 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v24 = {};\n // v24 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v25 = v23;\n const v26 = -29897853;\n // v26 = .integer\n const v27 = \"replace\";\n // v27 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v28 = Boolean;\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v30 = [13.37,13.37];\n // v30 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v31 = 1337;\n // v31 = .integer\n let v32 = 13.37;\n const v36 = [13.37,13.37,13.37];\n // v36 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v38 = [1337,1337];\n // v38 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v39 = [13.37,1337,v38,1337,\"-128\",13.37,\"-128\",\"-128\",2147483647,1337];\n // v39 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v40 = {__proto__:v36,length:v39};\n // v40 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"length\"])\n const v41 = \"0\";\n // v41 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v42 = -4130093409;\n // v42 = .integer\n const v44 = {b:2147483647,e:v38,valueOf:v36};\n // v44 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"b\", \"valueOf\", \"e\"])\n const v45 = \"k**baeaDif\";\n // v45 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v46 = 65536;\n // v46 = .integer\n const v47 = \"k**baeaDif\";\n // v47 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v48 = 13.37;\n // v48 = .float\n const v50 = [13.37,13.37];\n // v50 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v51 = ~v50;\n // v51 = .boolean\n const v53 = [13.37];\n // v53 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n let v54 = v53;\n const v55 = gc;\n // v55 = .function([] => .undefined)\n const v58 = [13.37,13.37,13.37,13.37];\n // v58 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v60 = [1337,1337,1337,1337];\n // v60 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v61 = [3697200800,v58,v60];\n // v61 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\n // v62 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"length\", \"constructor\", \"toString\", \"valueOf\"])\n const v65 = [13.37,13.37,13.37,13.37];\n // v65 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v67 = [1337,1337,1337,1337];\n // v67 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v68 = [3697200800,v65,v67];\n // v68 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\n // v69 = .object(ofGroup: Object, withProperties: [\"e\", \"constructor\", \"__proto__\", \"length\", \"toString\", \"valueOf\"])\n const v70 = Object;\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n function v71(v72) {\n }\n const v74 = [13.37];\n // v74 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v75 = 1337;\n // v75 = .integer\n const v76 = v44 ** 13.37;\n // v76 = .integer | .float | .bigint\n function v77(v78,v79,v80,v81,v82) {\n }\n let v83 = v74;\n const v84 = \"2\";\n // v84 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v85 = \"2\";\n // v85 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v88 = [13.37,13.37,1337,13.37];\n // v88 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v89(v90,v91,v92) {\n }\n const v94 = [1337,1337,1337,1337];\n // v94 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v95 = [3697200800,v88,v94];\n // v95 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v96(v97,v98) {\n }\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\n // v99 = .object(ofGroup: Object, withProperties: [\"toString\", \"length\", \"constructor\", \"__proto__\", \"e\", \"d\"])\n let v100 = 13.37;\n const v101 = typeof v74;\n // v101 = .string\n const v102 = \"symbol\";\n // v102 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v103 = 3697200800;\n // v103 = .integer\n const v104 = \"2\";\n // v104 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v105 = Boolean;\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v106 = Function;\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v107 = 13.37;\n // v107 = .float\n const v108 = 1337;\n // v108 = .integer\n const v109 = \"2\";\n // v109 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v110 = Function;\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v112 = [13.37,13.37,13.37,13.37];\n // v112 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v113 = 1337;\n // v113 = .integer\n let v114 = 13.37;\n const v116 = {...3697200800,...3697200800};\n // v116 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n const v117 = Object;\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v118 = Function;\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v119 = {};\n // v119 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v120 = v119;\n const v121 = (3697200800).constructor;\n // v121 = .unknown\n function v122(v123,v124) {\n }\n const v125 = Promise;\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\"prototype\"], withMethods: [\"race\", \"allSettled\", \"reject\", \"all\", \"resolve\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\"__proto__\"], withMethods: [\"finally\", \"then\", \"catch\"]))\n const v128 = 4;\n // v128 = .integer\n let v129 = 0;\n const v131 = [13.37,13.37,13.37,13.37];\n // v131 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v133 = [1337,1337,1337,1337];\n // v133 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v134 = [3697200800,v131,v133];\n // v134 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v135 = Object;\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v136 = -944747134;\n // v136 = .integer\n const v139 = [13.37,13.37,13.37,13.37];\n // v139 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v141 = [1337,1337,1337,1337];\n // v141 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v142 = [3697200800,v139,v141];\n // v142 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\n // v143 = .object(ofGroup: Object, withProperties: [\"toString\", \"constructor\", \"e\", \"__proto__\", \"valueOf\", \"length\"])\n let v144 = v143;\n const v145 = gc;\n // v145 = .function([] => .undefined)\n let v146 = 13.37;\n const v150 = [13.37,13.37,13.37,Function];\n // v150 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v152 = [1337,1337,1337,1337];\n // v152 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v153 = [3697200800,v150,v152];\n // v153 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v154 = v153 + 1;\n // v154 = .primitive\n let v155 = 0;\n const v156 = v155 + 1;\n // v156 = .primitive\n const v158 = \"2\";\n // v158 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v160 = [13.37,13.37,13.37,13.37];\n // v160 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v162 = 0;\n // v162 = .integer\n const v163 = [1337,1337,1337,1337];\n // v163 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v164 = [3697200800,1337,v163];\n // v164 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v166 = 1337;\n // v166 = .integer\n let v167 = 2594067260;\n const v169 = 4;\n // v169 = .integer\n let v170 = 0;\n const v171 = v167 + 1;\n // v171 = .primitive\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\n // v172 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"constructor\", \"valueOf\", \"length\", \"toString\"])\n const v173 = 0;\n // v173 = .integer\n const v174 = 5;\n // v174 = .integer\n const v175 = 2937513072;\n // v175 = .integer\n const v176 = Object;\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v177 = v172.constructor;\n // v177 = .unknown\n const v178 = 0;\n // v178 = .integer\n const v179 = 1;\n // v179 = .integer\n try {\n } catch(v180) {\n const v182 = [13.37,13.37,13.37,13.37];\n // v182 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v183 = v182.__proto__;\n // v183 = .object()\n function v185(v186) {\n }\n const v187 = Object >>> v183;\n // v187 = .integer | .bigint\n }\n function v188(v189,v190,v191,v192,...v193) {\n }\n}","function c(t){return!0===s(t)&&\"[object Object]\"===Object.prototype.toString.call(t)}","function detecteInstanceOf (obj, origin) {\n return obj instanceof origin\n // return Object.getPrototypeOf(obj) === origin.prototype\n // return obj.__proto__ === origin.prototype\n}","function V(e){if(null===e||\"[object Object]\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}","function isObj$1(something) {\n return typeDetect(something) === 'Object';\n}","testObjectAssertions() {\n var objConstructor = {}.constructor;\n\n this.assertIdentical({ a: 12 }.constructor, objConstructor);\n /* eslint-disable-next-line no-new-object */\n this.assertIdentical(new Object().constructor, objConstructor);\n\n var qxObj = new qx.core.Object();\n this.assertNotIdentical(qxObj.constructor, objConstructor);\n this.assertNotIdentical((1).constructor, objConstructor);\n this.assertNotIdentical(\"Juhu\".constructor, objConstructor);\n this.assertNotIdentical(/abc/.constructor, objConstructor);\n qxObj.dispose();\n }","function U(e){return!0==(null!=(r=e)&&\"object\"==typeof r&&!1===Array.isArray(r))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar r}","function Is(){return Is=Object.assign?Object.assign.bind():function(e){for(var t=1;t\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","#isPrimitive(value) {\n return value !== Object(value); \n }","function is(obj) {\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\"c\" /* default */];\n}","function Ut(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function i(t){return null!==t&&\"object\"==typeof t}","function is(v, t) { return typeof v === t; }","function b(e) {\n return (\n !0 ==\n (null != (t = e) &&\n \"object\" == typeof t &&\n !1 === Array.isArray(t)) &&\n \"[object Object]\" === Object.prototype.toString.call(e)\n );\n /*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n var t;\n }","function u(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function u(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function u(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function u(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function u(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function u(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function o(e){return 1==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */var t}","function mn(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function N(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function vo(t){return!0==(null!=(e=t)&&\"object\"==typeof e&&!1===Array.isArray(e))&&\"[object Object]\"===Object.prototype.toString.call(t);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar e}","function _instanceof(left, right) { if (right != null && typeof Symbol !== \"undefined\" && right[Symbol.hasInstance]) { return right[Symbol.hasInstance](left); } else { return left instanceof right; } }","function r(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function r(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function n(t){return\"[object Object]\"==={}.toString.call(t)}","function of(value) {\n switch (typeof value) {\n case 'object':\n if (value === null) {\n return NULL;\n } else if (Array.isArray(value)) {\n return ARRAY;\n }\n return OBJECT;\n case 'string':\n return STRING;\n case 'boolean':\n return BOOLEAN;\n case 'number':\n return isFinite(value) ? NUMBER : MISSING;\n }\n // Covers undefined, function, etc\n return MISSING;\n}","function n(t){return\"[object Object]\"===Object.prototype.toString.call(t)}","function n(t){return\"[object Object]\"===Object.prototype.toString.call(t)}","isPlainObject(obj) {\n return _toString.call(obj) === '[object Object]'\n }","function d(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function d(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}","function ro(t){return Object.prototype.toString.call(t)===\"[object Object]\"}","function nt(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function c(e){return null!==e&&\"object\"==typeof e}","function n(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function n(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function n(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function qe(t) {\n return !(\"object\" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof V || t instanceof Ne || t instanceof Ie || t instanceof Le || t instanceof Re);\n}","static is()\n {\n var arg0 = arguments[0]\n var type = Tester.type(arg0)\n for (let i = 1, len = arguments.length; i < len; i++) {\n let argN = arguments[i]\n if (\n type === argN ||\n argN === 'mixed' ||\n argN === '*' ||\n Tester.type(argN) === 'function' && (\n arg0 instanceof argN ||\n // Why? Probably if the class does not have a constructor for \"this\".\n // @see @cyrhla/core/Controller/SetController\n Tester.type(arg0) === 'object' && arg0.constructor.name === argN.name\n )\n ) {\n return true\n }\n }\n\n return false\n }","function ra(t){return Object.prototype.toString.call(t)===\"[object Object]\"}","function f(i) {\n var x = new Number(i);\n return x;\n} // Assert that a unique object really was created.","function Ft(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function isObject_(test) {\r\n return Object.prototype.toString.call(test) === '[object Object]';\r\n}","function assertInstance(o, f) {\n assertSame(o.constructor, f);\n assertInstanceof(o, f);\n}","function test_fail_hole_prototype() {\n var obj = Object.create({ stuff: \"in prototype\" });\n obj.foo = \"bar\";\n\n function f1() {\n bidar.serialize(obj);\n }\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\n}","function i(t){var e=typeof t;return null==t||\"object\"!=e&&\"function\"!=e}","function isObject$1(obj){\nreturn kindOf(obj)==='object'||kindOf(obj)==='function';\n}","function Object() {}","function Object() {}","function s(e){return!0==(null!=(t=e)&&\"object\"==typeof t&&!1===Array.isArray(t))&&\"[object Object]\"===Object.prototype.toString.call(e);\n/*!\n * isobject \n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nvar t}","function r(t){return t&&\"object\"===typeof t&&!Array.isArray(t)}","function proxyInstanceof(args) {\n var obj = deserialize(args[0]);\n var type = deserialize(args[1]);\n return obj instanceof type;\n }","function isObject$1(e){return\"[object Object]\"===Object.prototype.toString.call(e)}","function r(e){return e&&\"object\"==typeof e&&!Array.isArray(e)}","function r(e){return e&&\"object\"==typeof e&&!Array.isArray(e)}","function r(e){return e&&\"object\"==typeof e&&!Array.isArray(e)}"],"string":"[\n \"function t(e){return!!e.constructor&&'function'==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function n(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function o(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function F(t) {\\n return \\\"object\\\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\\n}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function Y(t) {\\n return \\\"object\\\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\\n}\",\n \"function e(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function n(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function n(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function fe(t) {\\n return \\\"object\\\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\\n}\",\n \"function an(t) {\\n return \\\"object\\\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\\n}\",\n \"function n(r){return!!r.constructor&&typeof r.constructor.isBuffer==\\\"function\\\"&&r.constructor.isBuffer(r)}\",\n \"function u(e){return!0===\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction(e){return null!=e&&\\\"object\\\"==typeof e&&!1===Array.isArray(e)}(e)&&\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function r(t){return t&&\\\"object\\\"===typeof t}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function isPlainObject(input){return typeof input==='object'&&input!==null&&(Object.getPrototypeOf(input)===Object.prototype||Object.getPrototypeOf(input)===null);}\",\n \"function i(e){return!0===\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nfunction(e){return null!=e&&\\\"object\\\"==typeof e&&!1===Array.isArray(e)}(e)&&\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function builtinprototypesarenotinstances() {\\n try {\\n Boolean.prototype.valueOf(); return false;\\n } catch(e) {}\\n try {\\n Number.prototype.valueOf(); return false;\\n } catch(e) {}\\n try {\\n String.prototype.toString(); return false;\\n } catch(e) {}\\n try {\\n RegExp.prototype.source; return false;\\n } catch(e) {}\\n try {\\n Date.prototype.valueOf(); return false;\\n } catch(e) {}\\n return true;\\n}\",\n \"function Ko(t) {\\n return \\\"object\\\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\\n}\",\n \"function testcase() {\\n var numProto = Object.getPrototypeOf(new Number(42));\\n var s = Object.prototype.toString.call(numProto );\\n return (s === '[object Object]') ;\\n }\",\n \"function v11(v12,v13) {\\n const v15 = v11(Object,Function);\\n // v15 = .unknown\\n const v16 = Object(v13,v8,0,v6);\\n // v16 = .object()\\n const v17 = 0;\\n // v17 = .integer\\n const v18 = 1;\\n // v18 = .integer\\n const v19 = 512;\\n // v19 = .integer\\n const v20 = \\\"-1024\\\";\\n // v20 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v21 = isFinite;\\n // v21 = .function([.anything] => .boolean)\\n const v23 = [1337];\\n // v23 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v24 = {};\\n // v24 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n let v25 = v23;\\n const v26 = -29897853;\\n // v26 = .integer\\n const v27 = \\\"replace\\\";\\n // v27 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v28 = Boolean;\\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\\\"prototype\\\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\\n const v30 = [13.37,13.37];\\n // v30 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v31 = 1337;\\n // v31 = .integer\\n let v32 = 13.37;\\n const v36 = [13.37,13.37,13.37];\\n // v36 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v38 = [1337,1337];\\n // v38 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v39 = [13.37,1337,v38,1337,\\\"-128\\\",13.37,\\\"-128\\\",\\\"-128\\\",2147483647,1337];\\n // v39 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v40 = {__proto__:v36,length:v39};\\n // v40 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\", \\\"length\\\"])\\n const v41 = \\\"0\\\";\\n // v41 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v42 = -4130093409;\\n // v42 = .integer\\n const v44 = {b:2147483647,e:v38,valueOf:v36};\\n // v44 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\", \\\"b\\\", \\\"valueOf\\\", \\\"e\\\"])\\n const v45 = \\\"k**baeaDif\\\";\\n // v45 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v46 = 65536;\\n // v46 = .integer\\n const v47 = \\\"k**baeaDif\\\";\\n // v47 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v48 = 13.37;\\n // v48 = .float\\n const v50 = [13.37,13.37];\\n // v50 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v51 = ~v50;\\n // v51 = .boolean\\n const v53 = [13.37];\\n // v53 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n let v54 = v53;\\n const v55 = gc;\\n // v55 = .function([] => .undefined)\\n const v58 = [13.37,13.37,13.37,13.37];\\n // v58 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v60 = [1337,1337,1337,1337];\\n // v60 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v61 = [3697200800,v58,v60];\\n // v61 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\\n // v62 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"__proto__\\\", \\\"length\\\", \\\"constructor\\\", \\\"toString\\\", \\\"valueOf\\\"])\\n const v65 = [13.37,13.37,13.37,13.37];\\n // v65 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v67 = [1337,1337,1337,1337];\\n // v67 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v68 = [3697200800,v65,v67];\\n // v68 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\\n // v69 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\", \\\"toString\\\", \\\"valueOf\\\"])\\n const v70 = Object;\\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n function v71(v72) {\\n }\\n const v74 = [13.37];\\n // v74 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v75 = 1337;\\n // v75 = .integer\\n const v76 = v44 ** 13.37;\\n // v76 = .integer | .float | .bigint\\n function v77(v78,v79,v80,v81,v82) {\\n }\\n let v83 = v74;\\n const v84 = \\\"2\\\";\\n // v84 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v85 = \\\"2\\\";\\n // v85 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v88 = [13.37,13.37,1337,13.37];\\n // v88 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n function v89(v90,v91,v92) {\\n }\\n const v94 = [1337,1337,1337,1337];\\n // v94 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v95 = [3697200800,v88,v94];\\n // v95 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n function v96(v97,v98) {\\n }\\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\\n // v99 = .object(ofGroup: Object, withProperties: [\\\"toString\\\", \\\"length\\\", \\\"constructor\\\", \\\"__proto__\\\", \\\"e\\\", \\\"d\\\"])\\n let v100 = 13.37;\\n const v101 = typeof v74;\\n // v101 = .string\\n const v102 = \\\"symbol\\\";\\n // v102 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v103 = 3697200800;\\n // v103 = .integer\\n const v104 = \\\"2\\\";\\n // v104 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v105 = Boolean;\\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\\\"prototype\\\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\\n const v106 = Function;\\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v107 = 13.37;\\n // v107 = .float\\n const v108 = 1337;\\n // v108 = .integer\\n const v109 = \\\"2\\\";\\n // v109 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v110 = Function;\\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v112 = [13.37,13.37,13.37,13.37];\\n // v112 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v113 = 1337;\\n // v113 = .integer\\n let v114 = 13.37;\\n const v116 = {...3697200800,...3697200800};\\n // v116 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n const v117 = Object;\\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v118 = Function;\\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v119 = {};\\n // v119 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n let v120 = v119;\\n const v121 = (3697200800).constructor;\\n // v121 = .unknown\\n function v122(v123,v124) {\\n }\\n const v125 = Promise;\\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"race\\\", \\\"allSettled\\\", \\\"reject\\\", \\\"all\\\", \\\"resolve\\\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\\\"__proto__\\\"], withMethods: [\\\"finally\\\", \\\"then\\\", \\\"catch\\\"]))\\n const v128 = 4;\\n // v128 = .integer\\n let v129 = 0;\\n const v131 = [13.37,13.37,13.37,13.37];\\n // v131 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v133 = [1337,1337,1337,1337];\\n // v133 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v134 = [3697200800,v131,v133];\\n // v134 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v135 = Object;\\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v136 = -944747134;\\n // v136 = .integer\\n const v139 = [13.37,13.37,13.37,13.37];\\n // v139 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v141 = [1337,1337,1337,1337];\\n // v141 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v142 = [3697200800,v139,v141];\\n // v142 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\\n // v143 = .object(ofGroup: Object, withProperties: [\\\"toString\\\", \\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\", \\\"valueOf\\\", \\\"length\\\"])\\n let v144 = v143;\\n const v145 = gc;\\n // v145 = .function([] => .undefined)\\n let v146 = 13.37;\\n const v150 = [13.37,13.37,13.37,Function];\\n // v150 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v152 = [1337,1337,1337,1337];\\n // v152 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v153 = [3697200800,v150,v152];\\n // v153 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v154 = v153 + 1;\\n // v154 = .primitive\\n let v155 = 0;\\n const v156 = v155 + 1;\\n // v156 = .primitive\\n const v158 = \\\"2\\\";\\n // v158 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v160 = [13.37,13.37,13.37,13.37];\\n // v160 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v162 = 0;\\n // v162 = .integer\\n const v163 = [1337,1337,1337,1337];\\n // v163 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v164 = [3697200800,1337,v163];\\n // v164 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v166 = 1337;\\n // v166 = .integer\\n let v167 = 2594067260;\\n const v169 = 4;\\n // v169 = .integer\\n let v170 = 0;\\n const v171 = v167 + 1;\\n // v171 = .primitive\\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\\n // v172 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"__proto__\\\", \\\"constructor\\\", \\\"valueOf\\\", \\\"length\\\", \\\"toString\\\"])\\n const v173 = 0;\\n // v173 = .integer\\n const v174 = 5;\\n // v174 = .integer\\n const v175 = 2937513072;\\n // v175 = .integer\\n const v176 = Object;\\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v177 = v172.constructor;\\n // v177 = .unknown\\n const v178 = 0;\\n // v178 = .integer\\n const v179 = 1;\\n // v179 = .integer\\n try {\\n } catch(v180) {\\n const v182 = [13.37,13.37,13.37,13.37];\\n // v182 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v183 = v182.__proto__;\\n // v183 = .object()\\n function v185(v186) {\\n }\\n const v187 = Object >>> v183;\\n // v187 = .integer | .bigint\\n }\\n function v188(v189,v190,v191,v192,...v193) {\\n }\\n}\",\n \"function c(t){return!0===s(t)&&\\\"[object Object]\\\"===Object.prototype.toString.call(t)}\",\n \"function detecteInstanceOf (obj, origin) {\\n return obj instanceof origin\\n // return Object.getPrototypeOf(obj) === origin.prototype\\n // return obj.__proto__ === origin.prototype\\n}\",\n \"function V(e){if(null===e||\\\"[object Object]\\\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}\",\n \"function isObj$1(something) {\\n return typeDetect(something) === 'Object';\\n}\",\n \"testObjectAssertions() {\\n var objConstructor = {}.constructor;\\n\\n this.assertIdentical({ a: 12 }.constructor, objConstructor);\\n /* eslint-disable-next-line no-new-object */\\n this.assertIdentical(new Object().constructor, objConstructor);\\n\\n var qxObj = new qx.core.Object();\\n this.assertNotIdentical(qxObj.constructor, objConstructor);\\n this.assertNotIdentical((1).constructor, objConstructor);\\n this.assertNotIdentical(\\\"Juhu\\\".constructor, objConstructor);\\n this.assertNotIdentical(/abc/.constructor, objConstructor);\\n qxObj.dispose();\\n }\",\n \"function U(e){return!0==(null!=(r=e)&&\\\"object\\\"==typeof r&&!1===Array.isArray(r))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar r}\",\n \"function Is(){return Is=Object.assign?Object.assign.bind():function(e){for(var t=1;t\\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"#isPrimitive(value) {\\n return value !== Object(value); \\n }\",\n \"function is(obj) {\\n return obj instanceof __WEBPACK_IMPORTED_MODULE_3__Range__[\\\"c\\\" /* default */];\\n}\",\n \"function Ut(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function i(t){return null!==t&&\\\"object\\\"==typeof t}\",\n \"function is(v, t) { return typeof v === t; }\",\n \"function b(e) {\\n return (\\n !0 ==\\n (null != (t = e) &&\\n \\\"object\\\" == typeof t &&\\n !1 === Array.isArray(t)) &&\\n \\\"[object Object]\\\" === Object.prototype.toString.call(e)\\n );\\n /*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\n var t;\\n }\",\n \"function u(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function u(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function u(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function u(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function u(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function u(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function o(e){return 1==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */var t}\",\n \"function mn(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function N(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function vo(t){return!0==(null!=(e=t)&&\\\"object\\\"==typeof e&&!1===Array.isArray(e))&&\\\"[object Object]\\\"===Object.prototype.toString.call(t);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar e}\",\n \"function _instanceof(left, right) { if (right != null && typeof Symbol !== \\\"undefined\\\" && right[Symbol.hasInstance]) { return right[Symbol.hasInstance](left); } else { return left instanceof right; } }\",\n \"function r(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function r(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function n(t){return\\\"[object Object]\\\"==={}.toString.call(t)}\",\n \"function of(value) {\\n switch (typeof value) {\\n case 'object':\\n if (value === null) {\\n return NULL;\\n } else if (Array.isArray(value)) {\\n return ARRAY;\\n }\\n return OBJECT;\\n case 'string':\\n return STRING;\\n case 'boolean':\\n return BOOLEAN;\\n case 'number':\\n return isFinite(value) ? NUMBER : MISSING;\\n }\\n // Covers undefined, function, etc\\n return MISSING;\\n}\",\n \"function n(t){return\\\"[object Object]\\\"===Object.prototype.toString.call(t)}\",\n \"function n(t){return\\\"[object Object]\\\"===Object.prototype.toString.call(t)}\",\n \"isPlainObject(obj) {\\n return _toString.call(obj) === '[object Object]'\\n }\",\n \"function d(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function d(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function isObject_(test) {\\r\\n return Object.prototype.toString.call(test) === '[object Object]';\\r\\n}\",\n \"function ro(t){return Object.prototype.toString.call(t)===\\\"[object Object]\\\"}\",\n \"function nt(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function c(e){return null!==e&&\\\"object\\\"==typeof e}\",\n \"function n(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function n(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function n(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function qe(t) {\\n return !(\\\"object\\\" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof V || t instanceof Ne || t instanceof Ie || t instanceof Le || t instanceof Re);\\n}\",\n \"static is()\\n {\\n var arg0 = arguments[0]\\n var type = Tester.type(arg0)\\n for (let i = 1, len = arguments.length; i < len; i++) {\\n let argN = arguments[i]\\n if (\\n type === argN ||\\n argN === 'mixed' ||\\n argN === '*' ||\\n Tester.type(argN) === 'function' && (\\n arg0 instanceof argN ||\\n // Why? Probably if the class does not have a constructor for \\\"this\\\".\\n // @see @cyrhla/core/Controller/SetController\\n Tester.type(arg0) === 'object' && arg0.constructor.name === argN.name\\n )\\n ) {\\n return true\\n }\\n }\\n\\n return false\\n }\",\n \"function ra(t){return Object.prototype.toString.call(t)===\\\"[object Object]\\\"}\",\n \"function f(i) {\\n var x = new Number(i);\\n return x;\\n} // Assert that a unique object really was created.\",\n \"function Ft(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function isObject_(test) {\\r\\n return Object.prototype.toString.call(test) === '[object Object]';\\r\\n}\",\n \"function assertInstance(o, f) {\\n assertSame(o.constructor, f);\\n assertInstanceof(o, f);\\n}\",\n \"function test_fail_hole_prototype() {\\n var obj = Object.create({ stuff: \\\"in prototype\\\" });\\n obj.foo = \\\"bar\\\";\\n\\n function f1() {\\n bidar.serialize(obj);\\n }\\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\\n}\",\n \"function i(t){var e=typeof t;return null==t||\\\"object\\\"!=e&&\\\"function\\\"!=e}\",\n \"function isObject$1(obj){\\nreturn kindOf(obj)==='object'||kindOf(obj)==='function';\\n}\",\n \"function Object() {}\",\n \"function Object() {}\",\n \"function s(e){return!0==(null!=(t=e)&&\\\"object\\\"==typeof t&&!1===Array.isArray(t))&&\\\"[object Object]\\\"===Object.prototype.toString.call(e);\\n/*!\\n * isobject \\n *\\n * Copyright (c) 2014-2017, Jon Schlinkert.\\n * Released under the MIT License.\\n */\\nvar t}\",\n \"function r(t){return t&&\\\"object\\\"===typeof t&&!Array.isArray(t)}\",\n \"function proxyInstanceof(args) {\\n var obj = deserialize(args[0]);\\n var type = deserialize(args[1]);\\n return obj instanceof type;\\n }\",\n \"function isObject$1(e){return\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function r(e){return e&&\\\"object\\\"==typeof e&&!Array.isArray(e)}\",\n \"function r(e){return e&&\\\"object\\\"==typeof e&&!Array.isArray(e)}\",\n \"function r(e){return e&&\\\"object\\\"==typeof e&&!Array.isArray(e)}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6310727","0.6224555","0.62207437","0.62207437","0.62207437","0.6154229","0.61486113","0.6084733","0.6084733","0.6084733","0.6084733","0.6084733","0.6084733","0.6084733","0.6084733","0.6084733","0.60484034","0.6019956","0.5980783","0.5980783","0.5953351","0.59335464","0.59086776","0.5893822","0.5861267","0.5854999","0.5854999","0.5854999","0.58487904","0.5839471","0.5795979","0.57904065","0.57720566","0.57692903","0.57514924","0.5736686","0.56970644","0.5676061","0.56349057","0.5612781","0.5588063","0.5584823","0.5584823","0.5584341","0.55786806","0.55740845","0.556069","0.5557668","0.5551798","0.5549271","0.5542394","0.5538592","0.5532222","0.5518469","0.5514222","0.5508458","0.5508458","0.5508458","0.5508458","0.5508458","0.5508458","0.5505634","0.5501686","0.5500359","0.5498903","0.549567","0.54850066","0.54850066","0.5473191","0.54715633","0.5459148","0.5459148","0.54587924","0.5453464","0.5453464","0.5445576","0.5442355","0.543739","0.5423903","0.5417907","0.5417907","0.5417907","0.54170823","0.5416613","0.5408156","0.54009336","0.53919864","0.53863716","0.53851575","0.5382887","0.5369107","0.53657943","0.53629446","0.53629446","0.5362526","0.5356745","0.5342544","0.5337779","0.5334211","0.5334211","0.5334211"],"string":"[\n \"0.6310727\",\n \"0.6224555\",\n \"0.62207437\",\n \"0.62207437\",\n \"0.62207437\",\n \"0.6154229\",\n \"0.61486113\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.6084733\",\n \"0.60484034\",\n \"0.6019956\",\n \"0.5980783\",\n \"0.5980783\",\n \"0.5953351\",\n \"0.59335464\",\n \"0.59086776\",\n \"0.5893822\",\n \"0.5861267\",\n \"0.5854999\",\n \"0.5854999\",\n \"0.5854999\",\n \"0.58487904\",\n \"0.5839471\",\n \"0.5795979\",\n \"0.57904065\",\n \"0.57720566\",\n \"0.57692903\",\n \"0.57514924\",\n \"0.5736686\",\n \"0.56970644\",\n \"0.5676061\",\n \"0.56349057\",\n \"0.5612781\",\n \"0.5588063\",\n \"0.5584823\",\n \"0.5584823\",\n \"0.5584341\",\n \"0.55786806\",\n \"0.55740845\",\n \"0.556069\",\n \"0.5557668\",\n \"0.5551798\",\n \"0.5549271\",\n \"0.5542394\",\n \"0.5538592\",\n \"0.5532222\",\n \"0.5518469\",\n \"0.5514222\",\n \"0.5508458\",\n \"0.5508458\",\n \"0.5508458\",\n \"0.5508458\",\n \"0.5508458\",\n \"0.5508458\",\n \"0.5505634\",\n \"0.5501686\",\n \"0.5500359\",\n \"0.5498903\",\n \"0.549567\",\n \"0.54850066\",\n \"0.54850066\",\n \"0.5473191\",\n \"0.54715633\",\n \"0.5459148\",\n \"0.5459148\",\n \"0.54587924\",\n \"0.5453464\",\n \"0.5453464\",\n \"0.5445576\",\n \"0.5442355\",\n \"0.543739\",\n \"0.5423903\",\n \"0.5417907\",\n \"0.5417907\",\n \"0.5417907\",\n \"0.54170823\",\n \"0.5416613\",\n \"0.5408156\",\n \"0.54009336\",\n \"0.53919864\",\n \"0.53863716\",\n \"0.53851575\",\n \"0.5382887\",\n \"0.5369107\",\n \"0.53657943\",\n \"0.53629446\",\n \"0.53629446\",\n \"0.5362526\",\n \"0.5356745\",\n \"0.5342544\",\n \"0.5337779\",\n \"0.5334211\",\n \"0.5334211\",\n \"0.5334211\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80789,"cells":{"query":{"kind":"string","value":"Calculate the MD5 of an array of littleendian words, and a bit length"},"document":{"kind":"string","value":"function core_md5 (x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32)\n x[(((len + 64) >>> 9) << 4) + 14] = len\n\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a\n var oldb = b\n var oldc = c\n var oldd = d\n\n a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936)\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302)\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222)\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844)\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safe_add(a, olda)\n b = safe_add(b, oldb)\n c = safe_add(c, oldc)\n d = safe_add(d, oldd)\n }\n\n return [a, b, c, d]\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function binl_md5 (x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << (len % 32)\n\t x[(((len + 64) >>> 9) << 4) + 14] = len\n\t\n\t var i\n\t var olda\n\t var oldb\n\t var oldc\n\t var oldd\n\t var a = 1732584193\n\t var b = -271733879\n\t var c = -1732584194\n\t var d = 271733878\n\t\n\t for (i = 0; i < x.length; i += 16) {\n\t olda = a\n\t oldb = b\n\t oldc = c\n\t oldd = d\n\t\n\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\t\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\t\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\t\n\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\t\n\t a = safe_add(a, olda)\n\t b = safe_add(b, oldb)\n\t c = safe_add(c, oldc)\n\t d = safe_add(d, oldd)\n\t }\n\t return [a, b, c, d]\n\t }","function binl_md5 (x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << (len % 32)\n\t x[(((len + 64) >>> 9) << 4) + 14] = len\n\t\n\t var i\n\t var olda\n\t var oldb\n\t var oldc\n\t var oldd\n\t var a = 1732584193\n\t var b = -271733879\n\t var c = -1732584194\n\t var d = 271733878\n\t\n\t for (i = 0; i < x.length; i += 16) {\n\t olda = a\n\t oldb = b\n\t oldc = c\n\t oldd = d\n\t\n\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\t\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\t\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\t\n\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\t\n\t a = safe_add(a, olda)\n\t b = safe_add(b, oldb)\n\t c = safe_add(c, oldc)\n\t d = safe_add(d, oldd)\n\t }\n\t return [a, b, c, d]\n\t }","function binl_md5 (x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << (len % 32)\n\t x[(((len + 64) >>> 9) << 4) + 14] = len\n\n\t var i\n\t var olda\n\t var oldb\n\t var oldc\n\t var oldd\n\t var a = 1732584193\n\t var b = -271733879\n\t var c = -1732584194\n\t var d = 271733878\n\n\t for (i = 0; i < x.length; i += 16) {\n\t olda = a\n\t oldb = b\n\t oldc = c\n\t oldd = d\n\n\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n\t a = safe_add(a, olda)\n\t b = safe_add(b, oldb)\n\t c = safe_add(c, oldc)\n\t d = safe_add(d, oldd)\n\t }\n\t return [a, b, c, d]\n\t }","function binl_md5 (x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << (len % 32)\n\t x[(((len + 64) >>> 9) << 4) + 14] = len\n\n\t var i\n\t var olda\n\t var oldb\n\t var oldc\n\t var oldd\n\t var a = 1732584193\n\t var b = -271733879\n\t var c = -1732584194\n\t var d = 271733878\n\n\t for (i = 0; i < x.length; i += 16) {\n\t olda = a\n\t oldb = b\n\t oldc = c\n\t oldd = d\n\n\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n\t a = safe_add(a, olda)\n\t b = safe_add(b, oldb)\n\t c = safe_add(c, oldc)\n\t d = safe_add(d, oldd)\n\t }\n\t return [a, b, c, d]\n\t }","function binl_md5(x, len) {\r\n\t\t /* append padding */\r\n\t\t x[len >> 5] |= 0x80 << ((len) % 32);\r\n\t\t x[(((len + 64) >>> 9) << 4) + 14] = len;\r\n\r\n\t\t var i, olda, oldb, oldc, oldd,\r\n\t\t a = 1732584193,\r\n\t\t b = -271733879,\r\n\t\t c = -1732584194,\r\n\t\t d = 271733878;\r\n\r\n\t\t for (i = 0; i < x.length; i += 16) {\r\n\t\t olda = a;\r\n\t\t oldb = b;\r\n\t\t oldc = c;\r\n\t\t oldd = d;\r\n\r\n\t\t a = md5_ff(a, b, c, d, x[i], 7, -680876936);\r\n\t\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\r\n\t\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\r\n\t\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\r\n\t\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\r\n\t\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\r\n\t\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\r\n\t\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\r\n\t\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\r\n\t\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\r\n\t\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\r\n\t\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\r\n\t\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\r\n\t\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\r\n\t\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\r\n\t\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\r\n\r\n\t\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\r\n\t\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\r\n\t\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\r\n\t\t b = md5_gg(b, c, d, a, x[i], 20, -373897302);\r\n\t\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\r\n\t\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\r\n\t\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\r\n\t\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\r\n\t\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\r\n\t\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\r\n\t\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\r\n\t\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\r\n\t\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\r\n\t\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\r\n\t\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\r\n\t\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\r\n\r\n\t\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\r\n\t\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\r\n\t\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\r\n\t\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\r\n\t\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\r\n\t\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\r\n\t\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\r\n\t\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\r\n\t\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\r\n\t\t d = md5_hh(d, a, b, c, x[i], 11, -358537222);\r\n\t\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\r\n\t\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\r\n\t\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\r\n\t\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\r\n\t\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\r\n\t\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\r\n\r\n\t\t a = md5_ii(a, b, c, d, x[i], 6, -198630844);\r\n\t\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\r\n\t\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\r\n\t\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\r\n\t\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\r\n\t\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\r\n\t\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\r\n\t\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\r\n\t\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\r\n\t\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\r\n\t\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\r\n\t\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\r\n\t\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\r\n\t\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\r\n\t\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\r\n\t\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\r\n\r\n\t\t a = safe_add(a, olda);\r\n\t\t b = safe_add(b, oldb);\r\n\t\t c = safe_add(c, oldc);\r\n\t\t d = safe_add(d, oldd);\r\n\t\t }\r\n\t\t return [a, b, c, d];\r\n\t\t }","function binl_md5 (x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32)\n x[(((len + 64) >>> 9) << 4) + 14] = len\n\n var i\n var olda\n var oldb\n var oldc\n var oldd\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (i = 0; i < x.length; i += 16) {\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936)\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5_gg(b, c, d, a, x[i], 20, -373897302)\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5_hh(d, a, b, c, x[i], 11, -358537222)\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844)\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safe_add(a, olda)\n b = safe_add(b, oldb)\n c = safe_add(c, oldc)\n d = safe_add(d, oldd)\n }\n return [a, b, c, d]\n }","function binlMD5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32)\n x[((len + 64) >>> 9 << 4) + 14] = len\n\n var i\n var olda\n var oldb\n var oldc\n var oldd\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (i = 0; i < x.length; i += 16) {\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safeAdd(a, olda)\n b = safeAdd(b, oldb)\n c = safeAdd(c, oldc)\n d = safeAdd(d, oldd)\n }\n return [a, b, c, d]\n}","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binlMD5 (x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32)\n x[(((len + 64) >>> 9) << 4) + 14] = len\n\n var i\n var olda\n var oldb\n var oldc\n var oldd\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (i = 0; i < x.length; i += 16) {\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safeAdd(a, olda)\n b = safeAdd(b, oldb)\n c = safeAdd(c, oldc)\n d = safeAdd(d, oldd)\n }\n return [a, b, c, d]\n }","function binlMD5 (x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32)\n x[(((len + 64) >>> 9) << 4) + 14] = len\n\n var i\n var olda\n var oldb\n var oldc\n var oldd\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (i = 0; i < x.length; i += 16) {\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safeAdd(a, olda)\n b = safeAdd(b, oldb)\n c = safeAdd(c, oldc)\n d = safeAdd(d, oldd)\n }\n return [a, b, c, d]\n }","function binlMD5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[(len + 64 >>> 9 << 4) + 14] = len;\n\n var i;\n var olda;\n var oldb;\n var oldc;\n var oldd;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n return [a, b, c, d];\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[(len + 64 >>> 9 << 4) + 14] = len;\n\n var i;\n var olda;\n var oldb;\n var oldc;\n var oldd;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binlMD5 (x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32)\n x[((len + 64) >>> 9 << 4) + 14] = len\n\n var i\n var olda\n var oldb\n var oldc\n var oldd\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (i = 0; i < x.length; i += 16) {\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safeAdd(a, olda)\n b = safeAdd(b, oldb)\n c = safeAdd(c, oldc)\n d = safeAdd(d, oldd)\n }\n return [a, b, c, d]\n }","function binlMD5 (x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32)\n x[((len + 64) >>> 9 << 4) + 14] = len\n\n var i\n var olda\n var oldb\n var oldc\n var oldd\n var a = 1732584193\n var b = -271733879\n var c = -1732584194\n var d = 271733878\n\n for (i = 0; i < x.length; i += 16) {\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\n\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\n\n a = safeAdd(a, olda)\n b = safeAdd(b, oldb)\n c = safeAdd(c, oldc)\n d = safeAdd(d, oldd)\n }\n return [a, b, c, d]\n }","function binl_md5(x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << (len % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var i, olda, oldb, oldc, oldd,\n\t a = 1732584193,\n\t b = -271733879,\n\t c = -1732584194,\n\t d = 271733878;\n\t\n\t for (i = 0; i < x.length; i += 16) {\n\t olda = a;\n\t oldb = b;\n\t oldc = c;\n\t oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return [a, b, c, d];\n\t }","function binl_md5(x,len){/*append padding*/\r\n x[len >> 5] |= 0x80 << ((len) % 32);\r\n x[(((len+64) >>> 9) << 4)+14]=len;\r\n var a=1732584193, b=-271733879, c=-1732584194, d=271733878;\r\n for(var i=0;i> 5] |= 0x80 << len % 32;\n x[(len + 64 >>> 9 << 4) + 14] = len;\n var i;\n var olda;\n var oldb;\n var oldc;\n var oldd;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n}","function binlMD5 (x, len) {\r\n /* append padding */\r\n x[len >> 5] |= 0x80 << (len % 32);\r\n x[(((len + 64) >>> 9) << 4) + 14] = len;\r\n\r\n var i;\r\n var olda;\r\n var oldb;\r\n var oldc;\r\n var oldd;\r\n var a = 1732584193;\r\n var b = -271733879;\r\n var c = -1732584194;\r\n var d = 271733878;\r\n\r\n for (i = 0; i < x.length; i += 16) {\r\n olda = a;\r\n oldb = b;\r\n oldc = c;\r\n oldd = d;\r\n\r\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\r\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\r\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\r\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\r\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\r\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\r\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\r\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\r\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\r\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\r\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\r\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\r\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\r\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\r\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\r\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\r\n\r\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\r\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\r\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\r\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\r\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\r\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\r\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\r\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\r\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\r\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\r\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\r\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\r\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\r\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\r\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\r\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\r\n\r\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\r\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\r\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\r\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\r\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\r\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\r\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\r\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\r\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\r\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\r\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\r\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\r\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\r\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\r\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\r\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\r\n\r\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\r\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\r\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\r\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\r\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\r\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\r\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\r\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\r\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\r\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\r\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\r\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\r\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\r\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\r\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\r\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\r\n\r\n a = safeAdd(a, olda);\r\n b = safeAdd(b, oldb);\r\n c = safeAdd(c, oldc);\r\n d = safeAdd(d, oldd);\r\n }\r\n return [a, b, c, d]\r\n }","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len) {\n\t\t/* append padding */\n\t\tx[len >> 5] |= 0x80 << len % 32;\n\t\tx[(((len + 64) >>> 9) << 4) + 14] = len;\n\n\t\tvar i;\n\t\tvar olda;\n\t\tvar oldb;\n\t\tvar oldc;\n\t\tvar oldd;\n\t\tvar a = 1732584193;\n\t\tvar b = -271733879;\n\t\tvar c = -1732584194;\n\t\tvar d = 271733878;\n\n\t\tfor (i = 0; i < x.length; i += 16) {\n\t\t\tolda = a;\n\t\t\toldb = b;\n\t\t\toldc = c;\n\t\t\toldd = d;\n\n\t\t\ta = md5_ff(a, b, c, d, x[i], 7, -680876936);\n\t\t\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t\t\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t\t\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t\t\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t\t\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t\t\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t\t\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n\t\t\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t\t\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t\t\tb = md5_gg(b, c, d, a, x[i], 20, -373897302);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t\t\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t\t\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t\t\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n\t\t\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t\t\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t\t\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t\t\td = md5_hh(d, a, b, c, x[i], 11, -358537222);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t\t\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n\t\t\ta = md5_ii(a, b, c, d, x[i], 6, -198630844);\n\t\t\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t\t\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t\t\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t\t\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n\t\t\ta = safe_add(a, olda);\n\t\t\tb = safe_add(b, oldb);\n\t\t\tc = safe_add(c, oldc);\n\t\t\td = safe_add(d, oldd);\n\t\t}\n\t\treturn [a, b, c, d];\n\t}","function binl_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n}","function binl_md5(x, len) {\n\t/* append padding */\n\tx[len >> 5] |= 0x80 << ((len) % 32);\n\tx[(((len + 64) >>> 9) << 4) + 14] = len;\n\n\tvar a = 1732584193;\n\tvar b = -271733879;\n\tvar c = -1732584194;\n\tvar d = 271733878;\n\n\tfor ( var i = 0; i < x.length; i += 16) {\n\t\tvar olda = a;\n\t\tvar oldb = b;\n\t\tvar oldc = c;\n\t\tvar oldd = d;\n\n\t\ta = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\n\t\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n\t\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t\tb = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\n\t\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n\t\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t\td = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\n\t\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n\t\ta = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\n\t\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n\t\ta = safe_add(a, olda);\n\t\tb = safe_add(b, oldb);\n\t\tc = safe_add(c, oldc);\n\t\td = safe_add(d, oldd);\n\t}\n\treturn Array(a, b, c, d);\n}","function binl_md5(x, len) {\n\t/* append padding */\n\tx[len >> 5] |= 0x80 << ((len) % 32);\n\tx[(((len + 64) >>> 9) << 4) + 14] = len;\n\n\tvar a = 1732584193;\n\tvar b = -271733879;\n\tvar c = -1732584194;\n\tvar d = 271733878;\n\n\tfor(var i = 0; i < x.length; i += 16) {\n\t\tvar olda = a;\n\t\tvar oldb = b;\n\t\tvar oldc = c;\n\t\tvar oldd = d;\n\n\t\ta = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t\td = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t\tc = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t\tb = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t\ta = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t\td = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t\tc = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t\tb = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t\ta = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t\td = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t\tc = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t\tb = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t\ta = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t\td = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t\tc = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t\tb = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n\t\ta = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t\td = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t\tc = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t\tb = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t\ta = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t\td = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t\tc = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t\tb = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t\ta = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t\td = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t\tc = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t\tb = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t\ta = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t\td = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t\tc = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t\tb = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n\t\ta = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t\td = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t\tc = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t\tb = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t\ta = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t\td = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t\tc = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t\tb = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t\ta = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t\td = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t\tc = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t\tb = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t\ta = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t\td = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t\tc = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t\tb = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n\t\ta = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t\td = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t\tc = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t\tb = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t\ta = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t\td = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t\tc = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t\tb = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t\ta = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t\td = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t\tc = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t\tb = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t\ta = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t\td = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t\tc = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t\tb = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n\t\ta = safe_add(a, olda);\n\t\tb = safe_add(b, oldb);\n\t\tc = safe_add(c, oldc);\n\t\td = safe_add(d, oldd);\n\t}\n\treturn Array(a, b, c, d);\n}","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n}","function binl_md5(x, len) {\n var olda, oldb, oldc, oldd, a = 1732584193, b = -271733879, c = -1732584194, d = 271733878;\n // append padding\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n for (var i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n a = MD5.md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = MD5.md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = MD5.md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = MD5.md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = MD5.md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = MD5.md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = MD5.md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = MD5.md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = MD5.md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = MD5.md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = MD5.md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = MD5.md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = MD5.md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = MD5.md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = MD5.md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = MD5.md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = MD5.md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = MD5.md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = MD5.md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = MD5.md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = MD5.md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = MD5.md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = MD5.md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = MD5.md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = MD5.md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = MD5.md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = MD5.md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = MD5.md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = MD5.md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = MD5.md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = MD5.md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = MD5.md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = MD5.md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = MD5.md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = MD5.md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = MD5.md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = MD5.md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = MD5.md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = MD5.md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = MD5.md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = MD5.md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = MD5.md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = MD5.md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = MD5.md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = MD5.md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = MD5.md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = MD5.md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = MD5.md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = MD5.md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = MD5.md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = MD5.md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = MD5.md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = MD5.md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = MD5.md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = MD5.md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = MD5.md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = MD5.md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = MD5.md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = MD5.md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = MD5.md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = MD5.md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = MD5.md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = MD5.md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = MD5.md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = MD5.safe_add(a, olda);\n b = MD5.safe_add(b, oldb);\n c = MD5.safe_add(c, oldc);\n d = MD5.safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function leword_md5(x, len) {\n\tvar i, olda, oldb, oldc, oldd,\n\t\ta = 1732584193,\n\t\tb = -271733879,\n\t\tc = -1732584194,\n\t\td = 271733878;\n\t\n\t/* append padding */\n\tx[len >> 5] |= 0x80 << (len % 32);\n\tx[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\tfor (i = 0; i < x.length; i += 16) {\n\t\tolda = a;\n\t\toldb = b;\n\t\toldc = c;\n\t\toldd = d;\n\t\t\n\t\ta = md5_ff(a, b, c, d, x[i], 7, -680876936);\n\t\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\t\t\n\t\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t\tb = md5_gg(b, c, d, a, x[i], 20, -373897302);\n\t\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\t\t\n\t\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t\td = md5_hh(d, a, b, c, x[i], 11, -358537222);\n\t\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\t\t\n\t\ta = md5_ii(a, b, c, d, x[i], 6, -198630844);\n\t\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\t\t\n\t\ta = add32b_op16b(a, olda);\n\t\tb = add32b_op16b(b, oldb);\n\t\tc = add32b_op16b(c, oldc);\n\t\td = add32b_op16b(d, oldd);\n\t}\n\treturn [a, b, c, d];\n}","function binl_md5(x, len) {\r\n /* append padding */\r\n x[len >> 5] |= 0x80 << ((len) % 32);\r\n x[(((len + 64) >>> 9) << 4) + 14] = len;\r\n\r\n var i, olda, oldb, oldc, oldd,\r\n a = 1732584193,\r\n b = -271733879,\r\n c = -1732584194,\r\n d = 271733878;\r\n\r\n for (i = 0; i < x.length; i += 16) {\r\n olda = a;\r\n oldb = b;\r\n oldc = c;\r\n oldd = d;\r\n\r\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\r\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\r\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\r\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\r\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\r\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\r\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\r\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\r\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\r\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\r\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\r\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\r\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\r\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\r\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\r\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\r\n\r\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\r\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\r\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\r\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\r\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\r\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\r\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\r\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\r\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\r\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\r\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\r\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\r\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\r\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\r\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\r\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\r\n\r\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\r\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\r\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\r\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\r\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\r\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\r\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\r\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\r\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\r\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\r\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\r\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\r\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\r\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\r\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\r\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\r\n\r\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\r\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\r\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\r\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\r\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\r\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\r\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\r\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\r\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\r\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\r\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\r\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\r\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\r\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\r\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\r\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\r\n\r\n a = safe_add(a, olda);\r\n b = safe_add(b, oldb);\r\n c = safe_add(c, oldc);\r\n d = safe_add(d, oldd);\r\n }\r\n return [a, b, c, d];\r\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binl_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var i, olda, oldb, oldc, oldd,\n a = 1732584193,\n b = -271733879,\n c = -1732584194,\n d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return [a, b, c, d];\n }","function binlMD5(x,len){/* append padding */x[len>>5]|=0x80<>>9<<4)+14]=len;var i;var olda;var oldb;var oldc;var oldd;var a=1732584193;var b=-271733879;var c=-1732584194;var d=271733878;for(i=0;i>5] |=0x80<<((len)%32);\n\tx[(((len+64)>>>9)<<4)+14]=len;\n\tvar a=1732584193;\n\tvar b=-271733879;\n\tvar c=-1732584194;\n\tvar d=271733878;\n\tfor(var i=0;i> 5] |= 0x80 << ((len) % 32); \n x[(((len + 64) >>> 9) << 4) + 14] = len; \n \n var a = 1732584193; \n var b = -271733879; \n var c = -1732584194; \n var d = 271733878; \n \n for(var i = 0; i < x.length; i += 16) { \n var olda = a; \n var oldb = b; \n var oldc = c; \n var oldd = d; \n \n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); \n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); \n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); \n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); \n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); \n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); \n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); \n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); \n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); \n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); \n c = md5_ff(c, d, a, b, x[i+10], 17, -42063); \n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); \n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); \n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); \n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); \n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); \n \n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); \n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); \n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); \n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); \n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); \n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); \n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); \n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); \n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); \n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); \n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); \n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); \n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); \n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); \n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); \n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); \n \n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); \n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); \n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); \n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); \n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); \n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); \n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); \n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); \n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); \n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); \n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); \n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); \n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); \n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); \n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); \n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); \n \n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); \n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); \n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); \n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); \n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); \n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); \n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); \n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); \n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); \n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); \n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); \n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); \n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); \n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); \n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); \n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); \n \n a = safe_add(a, olda); \n b = safe_add(b, oldb); \n c = safe_add(c, oldc); \n d = safe_add(d, oldd); \n } \n return Array(a, b, c, d); \n}","function core_md5(x : Array., len : number) : Array.\n {\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = this.md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = this.md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = this.md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = this.md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = this.md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = this.md5_ff(d, a, b, c, x[i+ 5] as number, 12, 1200080426);\n c = this.md5_ff(c, d, a, b, x[i+ 6] as number, 17, -1473231341);\n b = this.md5_ff(b, c, d, a, x[i+ 7] as number, 22, -45705983);\n a = this.md5_ff(a, b, c, d, x[i+ 8] as number, 7 , 1770035416);\n d = this.md5_ff(d, a, b, c, x[i+ 9] as number, 12, -1958414417);\n c = this.md5_ff(c, d, a, b, x[i+10] as number, 17, -42063);\n b = this.md5_ff(b, c, d, a, x[i+11] as number, 22, -1990404162);\n a = this.md5_ff(a, b, c, d, x[i+12] as number, 7 , 1804603682);\n d = this.md5_ff(d, a, b, c, x[i+13] as number, 12, -40341101);\n c = this.md5_ff(c, d, a, b, x[i+14] as number, 17, -1502002290);\n b = this.md5_ff(b, c, d, a, x[i+15] as number, 22, 1236535329);\n\n a = this.md5_gg(a, b, c, d, x[i+ 1] as number, 5 , -165796510);\n d = this.md5_gg(d, a, b, c, x[i+ 6] as number, 9 , -1069501632);\n c = this.md5_gg(c, d, a, b, x[i+11] as number, 14, 643717713);\n b = this.md5_gg(b, c, d, a, x[i+ 0] as number, 20, -373897302);\n a = this.md5_gg(a, b, c, d, x[i+ 5] as number, 5 , -701558691);\n d = this.md5_gg(d, a, b, c, x[i+10] as number, 9 , 38016083);\n c = this.md5_gg(c, d, a, b, x[i+15] as number, 14, -660478335);\n b = this.md5_gg(b, c, d, a, x[i+ 4] as number, 20, -405537848);\n a = this.md5_gg(a, b, c, d, x[i+ 9] as number, 5 , 568446438);\n d = this.md5_gg(d, a, b, c, x[i+14] as number, 9 , -1019803690);\n c = this.md5_gg(c, d, a, b, x[i+ 3] as number, 14, -187363961);\n b = this.md5_gg(b, c, d, a, x[i+ 8] as number, 20, 1163531501);\n a = this.md5_gg(a, b, c, d, x[i+13] as number, 5 , -1444681467);\n d = this.md5_gg(d, a, b, c, x[i+ 2] as number, 9 , -51403784);\n c = this.md5_gg(c, d, a, b, x[i+ 7] as number, 14, 1735328473);\n b = this.md5_gg(b, c, d, a, x[i+12] as number, 20, -1926607734);\n\n a = this.md5_hh(a, b, c, d, x[i+ 5] as number, 4 , -378558);\n d = this.md5_hh(d, a, b, c, x[i+ 8] as number, 11, -2022574463);\n c = this.md5_hh(c, d, a, b, x[i+11] as number, 16, 1839030562);\n b = this.md5_hh(b, c, d, a, x[i+14] as number, 23, -35309556);\n a = this.md5_hh(a, b, c, d, x[i+ 1] as number, 4 , -1530992060);\n d = this.md5_hh(d, a, b, c, x[i+ 4] as number, 11, 1272893353);\n c = this.md5_hh(c, d, a, b, x[i+ 7] as number, 16, -155497632);\n b = this.md5_hh(b, c, d, a, x[i+10] as number, 23, -1094730640);\n a = this.md5_hh(a, b, c, d, x[i+13] as number, 4 , 681279174);\n d = this.md5_hh(d, a, b, c, x[i+ 0] as number, 11, -358537222);\n c = this.md5_hh(c, d, a, b, x[i+ 3] as number, 16, -722521979);\n b = this.md5_hh(b, c, d, a, x[i+ 6] as number, 23, 76029189);\n a = this.md5_hh(a, b, c, d, x[i+ 9] as number, 4 , -640364487);\n d = this.md5_hh(d, a, b, c, x[i+12] as number, 11, -421815835);\n c = this.md5_hh(c, d, a, b, x[i+15] as number, 16, 530742520);\n b = this.md5_hh(b, c, d, a, x[i+ 2] as number, 23, -995338651);\n\n a = this.md5_ii(a, b, c, d, x[i+ 0] as number, 6 , -198630844);\n d = this.md5_ii(d, a, b, c, x[i+ 7] as number, 10, 1126891415);\n c = this.md5_ii(c, d, a, b, x[i+14] as number, 15, -1416354905);\n b = this.md5_ii(b, c, d, a, x[i+ 5] as number, 21, -57434055);\n a = this.md5_ii(a, b, c, d, x[i+12] as number, 6 , 1700485571);\n d = this.md5_ii(d, a, b, c, x[i+ 3] as number, 10, -1894986606);\n c = this.md5_ii(c, d, a, b, x[i+10] as number, 15, -1051523);\n b = this.md5_ii(b, c, d, a, x[i+ 1] as number, 21, -2054922799);\n a = this.md5_ii(a, b, c, d, x[i+ 8] as number, 6 , 1873313359);\n d = this.md5_ii(d, a, b, c, x[i+15] as number, 10, -30611744);\n c = this.md5_ii(c, d, a, b, x[i+ 6] as number, 15, -1560198380);\n b = this.md5_ii(b, c, d, a, x[i+13] as number, 21, 1309151649);\n a = this.md5_ii(a, b, c, d, x[i+ 4] as number, 6 , -145523070);\n d = this.md5_ii(d, a, b, c, x[i+11] as number, 10, -1120210379);\n c = this.md5_ii(c, d, a, b, x[i+ 2] as number, 15, 718787259);\n b = this.md5_ii(b, c, d, a, x[i+ 9] as number, 21, -343485551);\n\n a = this.safe_add(a, olda);\n b = this.safe_add(b, oldb);\n c = this.safe_add(c, oldc);\n d = this.safe_add(d, oldd);\n }\n return [a, b, c, d];\n\n }","function core_md5 (x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32)\n\t x[(((len + 64) >>> 9) << 4) + 14] = len\n\t\n\t var a = 1732584193\n\t var b = -271733879\n\t var c = -1732584194\n\t var d = 271733878\n\t\n\t for (var i = 0; i < x.length; i += 16) {\n\t var olda = a\n\t var oldb = b\n\t var oldc = c\n\t var oldd = d\n\t\n\t a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936)\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\n\t\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\n\t b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302)\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\n\t\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\n\t d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222)\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\n\t\n\t a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844)\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\n\t\n\t a = safe_add(a, olda)\n\t b = safe_add(b, oldb)\n\t c = safe_add(c, oldc)\n\t d = safe_add(d, oldd)\n\t }\n\t\n\t return [a, b, c, d]\n\t}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[(len + 64 >>> 9 << 4) + 14] = len;\n var i;\n var olda;\n var oldb;\n var oldc;\n var oldd;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (i = 0; i < x.length; i += 16) {\n olda = a;\n oldb = b;\n oldc = c;\n oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function core_md5(x, len) {\n\t\t/* append padding */\n\t\tx[len >> 5] |= 0x80 << len % 32;\n\t\tx[(len + 64 >>> 9 << 4) + 14] = len;\n\t\tvar a = 1732584193;\n\t\tvar b = -271733879;\n\t\tvar c = -1732584194;\n\t\tvar d = 271733878;\n\t\tfor (var i = 0; i < x.length; i += 16) {\n\t\t\tvar olda = a;\n\t\t\tvar oldb = b;\n\t\t\tvar oldc = c;\n\t\t\tvar oldd = d;\n\t\t\ta = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\n\t\t\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t\t\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t\t\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t\t\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t\t\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t\t\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t\t\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t\t\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t\t\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t\t\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t\t\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t\t\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t\t\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t\t\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t\t\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t\t\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t\t\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t\t\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t\t\td = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t\t\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t\t\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t\t\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t\t\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\n\t\t\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t\t\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t\t\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t\t\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t\t\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t\t\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t\t\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\t\t\ta = safe_add(a, olda);\n\t\t\tb = safe_add(b, oldb);\n\t\t\tc = safe_add(c, oldc);\n\t\t\td = safe_add(d, oldd);\n\t\t}\n\t\treturn Array(a, b, c, d);\n\t}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n let a = 1732584193;\n let b = -271733879;\n let c = -1732584194;\n let d = 271733878;\n\n for (let i = 0; i < x.length; i += 16) {\n const olda = a;\n const oldb = b;\n const oldc = c;\n const oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n let a = 1732584193;\n let b = -271733879;\n let c = -1732584194;\n let d = 271733878;\n\n for (let i = 0; i < x.length; i += 16) {\n const olda = a;\n const oldb = b;\n const oldc = c;\n const oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n let a = 1732584193;\n let b = -271733879;\n let c = -1732584194;\n let d = 271733878;\n\n for (let i = 0; i < x.length; i += 16) {\n const olda = a;\n const oldb = b;\n const oldc = c;\n const oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n let a = 1732584193;\n let b = -271733879;\n let c = -1732584194;\n let d = 271733878;\n\n for (let i = 0; i < x.length; i += 16) {\n const olda = a;\n const oldb = b;\n const oldc = c;\n const oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n\n return [a, b, c, d];\n}","function wordsToMd5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << len % 32;\n x[getOutputLength(len) - 1] = len;\n let a = 1732584193;\n let b = -271733879;\n let c = -1732584194;\n let d = 271733878;\n for (let i = 0; i < x.length; i += 16) {\n const olda = a;\n const oldb = b;\n const oldc = c;\n const oldd = d;\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\n a = safeAdd(a, olda);\n b = safeAdd(b, oldb);\n c = safeAdd(c, oldc);\n d = safeAdd(d, oldd);\n }\n return [a, b, c, d];\n}","function core_md5(x, len) \n{ \n/* append padding */ \nx[len >> 5] |= 0x80 << ((len) % 32); \nx[(((len + 64) >>> 9) << 4) + 14] = len;\n\nvar a = 1732584193; \nvar b = -271733879; \nvar c = -1732584194; \nvar d = 271733878;\n\nfor(var i = 0; i < x.length; i += 16) \n{ \nvar olda = a; \nvar oldb = b; \nvar oldc = c; \nvar oldd = d;\n\na = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); \nd = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); \nc = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); \nb = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); \na = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); \nd = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); \nc = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); \nb = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); \na = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); \nd = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); \nc = md5_ff(c, d, a, b, x[i+10], 17, -42063); \nb = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); \na = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); \nd = md5_ff(d, a, b, c, x[i+13], 12, -40341101); \nc = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); \nb = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\na = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); \nd = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); \nc = md5_gg(c, d, a, b, x[i+11], 14, 643717713); \nb = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); \na = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); \nd = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); \nc = md5_gg(c, d, a, b, x[i+15], 14, -660478335); \nb = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); \na = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); \nd = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); \nc = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); \nb = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); \na = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); \nd = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); \nc = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); \nb = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\na = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); \nd = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); \nc = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); \nb = md5_hh(b, c, d, a, x[i+14], 23, -35309556); \na = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); \nd = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); \nc = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); \nb = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); \na = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); \nd = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); \nc = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); \nb = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); \na = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); \nd = md5_hh(d, a, b, c, x[i+12], 11, -421815835); \nc = md5_hh(c, d, a, b, x[i+15], 16, 530742520); \nb = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\na = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); \nd = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); \nc = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); \nb = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); \na = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); \nd = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); \nc = md5_ii(c, d, a, b, x[i+10], 15, -1051523); \nb = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); \na = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); \nd = md5_ii(d, a, b, c, x[i+15], 10, -30611744); \nc = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); \nb = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); \na = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); \nd = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); \nc = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); \nb = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\na = safe_add(a, olda); \nb = safe_add(b, oldb); \nc = safe_add(c, oldc); \nd = safe_add(d, oldd); \n} \nreturn Array(a, b, c, d);\n\n}","function core_md5(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n \n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n \n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n \n a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n \n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n \n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n \n a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n \n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n \n}","function core_md5(x, len) {\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << len % 32;\n\t x[(len + 64 >>> 9 << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for (var i = 0; i < x.length; i += 16) {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\n\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\n\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len)\n\t{\n\t /* append padding */\n\t x[len >> 5] |= 0x80 << ((len) % 32);\n\t x[(((len + 64) >>> 9) << 4) + 14] = len;\n\t\n\t var a = 1732584193;\n\t var b = -271733879;\n\t var c = -1732584194;\n\t var d = 271733878;\n\t\n\t for(var i = 0; i < x.length; i += 16)\n\t {\n\t var olda = a;\n\t var oldb = b;\n\t var oldc = c;\n\t var oldd = d;\n\t\n\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\t\n\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\t\n\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\t\n\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\t\n\t a = safe_add(a, olda);\n\t b = safe_add(b, oldb);\n\t c = safe_add(c, oldc);\n\t d = safe_add(d, oldd);\n\t }\n\t return Array(a, b, c, d);\n\t\n\t}","function core_md5(x, len) {\n\t\t\t/* append padding */\n\t\t\tx[len >> 5] |= 0x80 << ((len) % 32);\n\t\t\tx[(((len + 64) >>> 9) << 4) + 14] = len;\n\n\t\t\tvar a = 1732584193;\n\t\t\tvar b = -271733879;\n\t\t\tvar c = -1732584194;\n\t\t\tvar d = 271733878;\n\n\t\t\tfor(var i = 0; i < x.length; i += 16) {\n\t\t\t\tvar olda = a;\n\t\t\t\tvar oldb = b;\n\t\t\t\tvar oldc = c;\n\t\t\t\tvar oldd = d;\n\n\t\t\t\ta = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\n\t\t\t\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\n\t\t\t\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\n\t\t\t\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\n\t\t\t\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\n\t\t\t\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\n\t\t\t\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\n\t\t\t\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\n\t\t\t\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\n\t\t\t\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\n\t\t\t\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\n\t\t\t\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\n\t\t\t\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\n\t\t\t\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\n\t\t\t\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\n\t\t\t\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\n\n\t\t\t\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\n\t\t\t\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\n\t\t\t\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\n\t\t\t\tb = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\n\t\t\t\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\n\t\t\t\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\n\t\t\t\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\n\t\t\t\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\n\t\t\t\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\n\t\t\t\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\n\t\t\t\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\n\t\t\t\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\n\t\t\t\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\n\t\t\t\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\n\t\t\t\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\n\t\t\t\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\n\n\t\t\t\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\n\t\t\t\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\n\t\t\t\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\n\t\t\t\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\n\t\t\t\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\n\t\t\t\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\n\t\t\t\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\n\t\t\t\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\n\t\t\t\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\n\t\t\t\td = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\n\t\t\t\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\n\t\t\t\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\n\t\t\t\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\n\t\t\t\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\n\t\t\t\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\n\t\t\t\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\n\n\t\t\t\ta = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\n\t\t\t\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\n\t\t\t\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\n\t\t\t\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\n\t\t\t\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\n\t\t\t\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\n\t\t\t\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\n\t\t\t\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\n\t\t\t\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\n\t\t\t\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\n\t\t\t\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\n\t\t\t\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\n\t\t\t\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\n\t\t\t\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\n\t\t\t\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\n\t\t\t\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\n\n\t\t\t\ta = safe_add(a, olda);\n\t\t\t\tb = safe_add(b, oldb);\n\t\t\t\tc = safe_add(c, oldc);\n\t\t\t\td = safe_add(d, oldd);\n\t\t\t}\n\t\t\treturn Array(a, b, c, d);\n\t\t}","function core_md5(x, len) {\r\n /* append padding */\r\n x[len >> 5] |= 0x80 << ((len) % 32);\r\n x[(((len + 64) >>> 9) << 4) + 14] = len;\r\n\r\n var a = 1732584193;\r\n var b = -271733879;\r\n var c = -1732584194;\r\n var d = 271733878;\r\n\r\n for (var i = 0; i < x.length; i += 16) {\r\n var olda = a;\r\n var oldb = b;\r\n var oldc = c;\r\n var oldd = d;\r\n\r\n a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\r\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\r\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\r\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\r\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\r\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\r\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\r\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\r\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\r\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\r\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\r\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\r\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\r\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\r\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\r\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\r\n\r\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\r\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\r\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\r\n b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\r\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\r\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\r\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\r\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\r\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\r\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\r\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\r\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\r\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\r\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\r\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\r\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\r\n\r\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\r\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\r\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\r\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\r\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\r\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\r\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\r\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\r\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\r\n d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\r\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\r\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\r\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\r\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\r\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\r\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\r\n\r\n a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\r\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\r\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\r\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\r\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\r\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\r\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\r\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\r\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\r\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\r\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\r\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\r\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\r\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\r\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\r\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\r\n\r\n a = safe_add(a, olda);\r\n b = safe_add(b, oldb);\r\n c = safe_add(c, oldc);\r\n d = safe_add(d, oldd);\r\n }\r\n return Array(a, b, c, d);\r\n\r\n }","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}","function core_md5(x, len)\n{\n /* append padding */\n x[len >> 5] |= 0x80 << ((len) % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n\n for(var i = 0; i < x.length; i += 16)\n {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\n\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\n\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\n\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n return Array(a, b, c, d);\n\n}"],"string":"[\n \"function binl_md5 (x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << (len % 32)\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\t\\n\\t var i\\n\\t var olda\\n\\t var oldb\\n\\t var oldc\\n\\t var oldd\\n\\t var a = 1732584193\\n\\t var b = -271733879\\n\\t var c = -1732584194\\n\\t var d = 271733878\\n\\t\\n\\t for (i = 0; i < x.length; i += 16) {\\n\\t olda = a\\n\\t oldb = b\\n\\t oldc = c\\n\\t oldd = d\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\\n\\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\\n\\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\t\\n\\t a = safe_add(a, olda)\\n\\t b = safe_add(b, oldb)\\n\\t c = safe_add(c, oldc)\\n\\t d = safe_add(d, oldd)\\n\\t }\\n\\t return [a, b, c, d]\\n\\t }\",\n \"function binl_md5 (x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << (len % 32)\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\t\\n\\t var i\\n\\t var olda\\n\\t var oldb\\n\\t var oldc\\n\\t var oldd\\n\\t var a = 1732584193\\n\\t var b = -271733879\\n\\t var c = -1732584194\\n\\t var d = 271733878\\n\\t\\n\\t for (i = 0; i < x.length; i += 16) {\\n\\t olda = a\\n\\t oldb = b\\n\\t oldc = c\\n\\t oldd = d\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\\n\\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\\n\\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\t\\n\\t a = safe_add(a, olda)\\n\\t b = safe_add(b, oldb)\\n\\t c = safe_add(c, oldc)\\n\\t d = safe_add(d, oldd)\\n\\t }\\n\\t return [a, b, c, d]\\n\\t }\",\n \"function binl_md5 (x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << (len % 32)\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\n\\t var i\\n\\t var olda\\n\\t var oldb\\n\\t var oldc\\n\\t var oldd\\n\\t var a = 1732584193\\n\\t var b = -271733879\\n\\t var c = -1732584194\\n\\t var d = 271733878\\n\\n\\t for (i = 0; i < x.length; i += 16) {\\n\\t olda = a\\n\\t oldb = b\\n\\t oldc = c\\n\\t oldd = d\\n\\n\\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\\n\\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\\n\\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n\\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n\\t a = safe_add(a, olda)\\n\\t b = safe_add(b, oldb)\\n\\t c = safe_add(c, oldc)\\n\\t d = safe_add(d, oldd)\\n\\t }\\n\\t return [a, b, c, d]\\n\\t }\",\n \"function binl_md5 (x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << (len % 32)\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\n\\t var i\\n\\t var olda\\n\\t var oldb\\n\\t var oldc\\n\\t var oldd\\n\\t var a = 1732584193\\n\\t var b = -271733879\\n\\t var c = -1732584194\\n\\t var d = 271733878\\n\\n\\t for (i = 0; i < x.length; i += 16) {\\n\\t olda = a\\n\\t oldb = b\\n\\t oldc = c\\n\\t oldd = d\\n\\n\\t a = md5_ff(a, b, c, d, x[i], 7, -680876936)\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\\n\\t b = md5_gg(b, c, d, a, x[i], 20, -373897302)\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\\n\\t d = md5_hh(d, a, b, c, x[i], 11, -358537222)\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n\\t a = md5_ii(a, b, c, d, x[i], 6, -198630844)\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n\\t a = safe_add(a, olda)\\n\\t b = safe_add(b, oldb)\\n\\t c = safe_add(c, oldc)\\n\\t d = safe_add(d, oldd)\\n\\t }\\n\\t return [a, b, c, d]\\n\\t }\",\n \"function binl_md5(x, len) {\\r\\n\\t\\t /* append padding */\\r\\n\\t\\t x[len >> 5] |= 0x80 << ((len) % 32);\\r\\n\\t\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\r\\n\\r\\n\\t\\t var i, olda, oldb, oldc, oldd,\\r\\n\\t\\t a = 1732584193,\\r\\n\\t\\t b = -271733879,\\r\\n\\t\\t c = -1732584194,\\r\\n\\t\\t d = 271733878;\\r\\n\\r\\n\\t\\t for (i = 0; i < x.length; i += 16) {\\r\\n\\t\\t olda = a;\\r\\n\\t\\t oldb = b;\\r\\n\\t\\t oldc = c;\\r\\n\\t\\t oldd = d;\\r\\n\\r\\n\\t\\t a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\r\\n\\t\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\r\\n\\t\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\r\\n\\t\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\r\\n\\t\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\r\\n\\t\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\r\\n\\t\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\r\\n\\t\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\r\\n\\t\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\r\\n\\t\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\r\\n\\t\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\r\\n\\t\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\r\\n\\t\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\r\\n\\t\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\r\\n\\t\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\r\\n\\t\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\r\\n\\r\\n\\t\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\r\\n\\t\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\r\\n\\t\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\r\\n\\t\\t b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\r\\n\\t\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\r\\n\\t\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\r\\n\\t\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\r\\n\\t\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\r\\n\\t\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\r\\n\\t\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\r\\n\\t\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\r\\n\\t\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\r\\n\\t\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\r\\n\\t\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\r\\n\\t\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\r\\n\\t\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\r\\n\\r\\n\\t\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\r\\n\\t\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\r\\n\\t\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\r\\n\\t\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\r\\n\\t\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\r\\n\\t\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\r\\n\\t\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\r\\n\\t\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\r\\n\\t\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\r\\n\\t\\t d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\r\\n\\t\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\r\\n\\t\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\r\\n\\t\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\r\\n\\t\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\r\\n\\t\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\r\\n\\t\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\r\\n\\r\\n\\t\\t a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\r\\n\\t\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\r\\n\\t\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\r\\n\\t\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\r\\n\\t\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\r\\n\\t\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\r\\n\\t\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\r\\n\\t\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\r\\n\\t\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\r\\n\\t\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\r\\n\\t\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\r\\n\\t\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\r\\n\\t\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\r\\n\\t\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\r\\n\\t\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\r\\n\\t\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\r\\n\\r\\n\\t\\t a = safe_add(a, olda);\\r\\n\\t\\t b = safe_add(b, oldb);\\r\\n\\t\\t c = safe_add(c, oldc);\\r\\n\\t\\t d = safe_add(d, oldd);\\r\\n\\t\\t }\\r\\n\\t\\t return [a, b, c, d];\\r\\n\\t\\t }\",\n \"function binl_md5 (x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32)\\n x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\n var i\\n var olda\\n var oldb\\n var oldc\\n var oldd\\n var a = 1732584193\\n var b = -271733879\\n var c = -1732584194\\n var d = 271733878\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936)\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302)\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222)\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844)\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n a = safe_add(a, olda)\\n b = safe_add(b, oldb)\\n c = safe_add(c, oldc)\\n d = safe_add(d, oldd)\\n }\\n return [a, b, c, d]\\n }\",\n \"function binlMD5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32)\\n x[((len + 64) >>> 9 << 4) + 14] = len\\n\\n var i\\n var olda\\n var oldb\\n var oldc\\n var oldd\\n var a = 1732584193\\n var b = -271733879\\n var c = -1732584194\\n var d = 271733878\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n a = safeAdd(a, olda)\\n b = safeAdd(b, oldb)\\n c = safeAdd(c, oldc)\\n d = safeAdd(d, oldd)\\n }\\n return [a, b, c, d]\\n}\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binlMD5 (x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32)\\n x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\n var i\\n var olda\\n var oldb\\n var oldc\\n var oldd\\n var a = 1732584193\\n var b = -271733879\\n var c = -1732584194\\n var d = 271733878\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n a = safeAdd(a, olda)\\n b = safeAdd(b, oldb)\\n c = safeAdd(c, oldc)\\n d = safeAdd(d, oldd)\\n }\\n return [a, b, c, d]\\n }\",\n \"function binlMD5 (x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32)\\n x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\n var i\\n var olda\\n var oldb\\n var oldc\\n var oldd\\n var a = 1732584193\\n var b = -271733879\\n var c = -1732584194\\n var d = 271733878\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n a = safeAdd(a, olda)\\n b = safeAdd(b, oldb)\\n c = safeAdd(c, oldc)\\n d = safeAdd(d, oldd)\\n }\\n return [a, b, c, d]\\n }\",\n \"function binlMD5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[(len + 64 >>> 9 << 4) + 14] = len;\\n\\n var i;\\n var olda;\\n var oldb;\\n var oldc;\\n var oldd;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[(len + 64 >>> 9 << 4) + 14] = len;\\n\\n var i;\\n var olda;\\n var oldb;\\n var oldc;\\n var oldd;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binlMD5 (x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32)\\n x[((len + 64) >>> 9 << 4) + 14] = len\\n\\n var i\\n var olda\\n var oldb\\n var oldc\\n var oldd\\n var a = 1732584193\\n var b = -271733879\\n var c = -1732584194\\n var d = 271733878\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n a = safeAdd(a, olda)\\n b = safeAdd(b, oldb)\\n c = safeAdd(c, oldc)\\n d = safeAdd(d, oldd)\\n }\\n return [a, b, c, d]\\n }\",\n \"function binlMD5 (x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32)\\n x[((len + 64) >>> 9 << 4) + 14] = len\\n\\n var i\\n var olda\\n var oldb\\n var oldc\\n var oldd\\n var a = 1732584193\\n var b = -271733879\\n var c = -1732584194\\n var d = 271733878\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n a = md5ff(a, b, c, d, x[i], 7, -680876936)\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586)\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819)\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897)\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983)\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063)\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101)\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510)\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713)\\n b = md5gg(b, c, d, a, x[i], 20, -373897302)\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691)\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083)\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335)\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848)\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438)\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961)\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784)\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558)\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556)\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632)\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174)\\n d = md5hh(d, a, b, c, x[i], 11, -358537222)\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979)\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189)\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487)\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835)\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520)\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\n a = md5ii(a, b, c, d, x[i], 6, -198630844)\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055)\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523)\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744)\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070)\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259)\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\n a = safeAdd(a, olda)\\n b = safeAdd(b, oldb)\\n c = safeAdd(c, oldc)\\n d = safeAdd(d, oldd)\\n }\\n return [a, b, c, d]\\n }\",\n \"function binl_md5(x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << (len % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var i, olda, oldb, oldc, oldd,\\n\\t a = 1732584193,\\n\\t b = -271733879,\\n\\t c = -1732584194,\\n\\t d = 271733878;\\n\\t\\n\\t for (i = 0; i < x.length; i += 16) {\\n\\t olda = a;\\n\\t oldb = b;\\n\\t oldc = c;\\n\\t oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return [a, b, c, d];\\n\\t }\",\n \"function binl_md5(x,len){/*append padding*/\\r\\n x[len >> 5] |= 0x80 << ((len) % 32);\\r\\n x[(((len+64) >>> 9) << 4)+14]=len;\\r\\n var a=1732584193, b=-271733879, c=-1732584194, d=271733878;\\r\\n for(var i=0;i> 5] |= 0x80 << len % 32;\\n x[(len + 64 >>> 9 << 4) + 14] = len;\\n var i;\\n var olda;\\n var oldb;\\n var oldc;\\n var oldd;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n}\",\n \"function binlMD5 (x, len) {\\r\\n /* append padding */\\r\\n x[len >> 5] |= 0x80 << (len % 32);\\r\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\r\\n\\r\\n var i;\\r\\n var olda;\\r\\n var oldb;\\r\\n var oldc;\\r\\n var oldd;\\r\\n var a = 1732584193;\\r\\n var b = -271733879;\\r\\n var c = -1732584194;\\r\\n var d = 271733878;\\r\\n\\r\\n for (i = 0; i < x.length; i += 16) {\\r\\n olda = a;\\r\\n oldb = b;\\r\\n oldc = c;\\r\\n oldd = d;\\r\\n\\r\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\r\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\r\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\r\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\r\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\r\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\r\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\r\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\r\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\r\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\r\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\r\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\r\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\r\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\r\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\r\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\r\\n\\r\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\r\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\r\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\r\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\r\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\r\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\r\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\r\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\r\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\r\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\r\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\r\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\r\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\r\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\r\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\r\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\r\\n\\r\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\r\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\r\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\r\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\r\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\r\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\r\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\r\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\r\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\r\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\r\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\r\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\r\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\r\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\r\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\r\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\r\\n\\r\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\r\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\r\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\r\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\r\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\r\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\r\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\r\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\r\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\r\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\r\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\r\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\r\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\r\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\r\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\r\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\r\\n\\r\\n a = safeAdd(a, olda);\\r\\n b = safeAdd(b, oldb);\\r\\n c = safeAdd(c, oldc);\\r\\n d = safeAdd(d, oldd);\\r\\n }\\r\\n return [a, b, c, d]\\r\\n }\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len) {\\n\\t\\t/* append padding */\\n\\t\\tx[len >> 5] |= 0x80 << len % 32;\\n\\t\\tx[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n\\t\\tvar i;\\n\\t\\tvar olda;\\n\\t\\tvar oldb;\\n\\t\\tvar oldc;\\n\\t\\tvar oldd;\\n\\t\\tvar a = 1732584193;\\n\\t\\tvar b = -271733879;\\n\\t\\tvar c = -1732584194;\\n\\t\\tvar d = 271733878;\\n\\n\\t\\tfor (i = 0; i < x.length; i += 16) {\\n\\t\\t\\tolda = a;\\n\\t\\t\\toldb = b;\\n\\t\\t\\toldc = c;\\n\\t\\t\\toldd = d;\\n\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n\\t\\t\\ta = safe_add(a, olda);\\n\\t\\t\\tb = safe_add(b, oldb);\\n\\t\\t\\tc = safe_add(c, oldc);\\n\\t\\t\\td = safe_add(d, oldd);\\n\\t\\t}\\n\\t\\treturn [a, b, c, d];\\n\\t}\",\n \"function binl_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len) {\\n\\t/* append padding */\\n\\tx[len >> 5] |= 0x80 << ((len) % 32);\\n\\tx[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n\\tvar a = 1732584193;\\n\\tvar b = -271733879;\\n\\tvar c = -1732584194;\\n\\tvar d = 271733878;\\n\\n\\tfor ( var i = 0; i < x.length; i += 16) {\\n\\t\\tvar olda = a;\\n\\t\\tvar oldb = b;\\n\\t\\tvar oldc = c;\\n\\t\\tvar oldd = d;\\n\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n\\t\\ta = safe_add(a, olda);\\n\\t\\tb = safe_add(b, oldb);\\n\\t\\tc = safe_add(c, oldc);\\n\\t\\td = safe_add(d, oldd);\\n\\t}\\n\\treturn Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len) {\\n\\t/* append padding */\\n\\tx[len >> 5] |= 0x80 << ((len) % 32);\\n\\tx[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n\\tvar a = 1732584193;\\n\\tvar b = -271733879;\\n\\tvar c = -1732584194;\\n\\tvar d = 271733878;\\n\\n\\tfor(var i = 0; i < x.length; i += 16) {\\n\\t\\tvar olda = a;\\n\\t\\tvar oldb = b;\\n\\t\\tvar oldc = c;\\n\\t\\tvar oldd = d;\\n\\n\\t\\ta = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t\\td = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t\\tc = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t\\tb = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t\\ta = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t\\td = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t\\tc = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t\\tb = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t\\ta = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t\\td = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t\\tc = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t\\tb = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t\\ta = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t\\td = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t\\tc = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t\\tb = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n\\t\\ta = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t\\td = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t\\tc = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t\\tb = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t\\ta = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t\\td = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t\\tc = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t\\tb = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t\\ta = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t\\td = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t\\tc = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t\\tb = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t\\ta = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t\\td = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t\\tc = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t\\tb = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n\\t\\ta = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t\\td = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t\\tc = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t\\tb = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t\\ta = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t\\td = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t\\tc = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t\\tb = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t\\ta = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t\\td = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t\\tc = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t\\tb = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t\\ta = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t\\td = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t\\tc = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t\\tb = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n\\t\\ta = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t\\td = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t\\tc = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t\\tb = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t\\ta = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t\\td = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t\\tc = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t\\tb = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t\\ta = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t\\td = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t\\tc = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t\\tb = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t\\ta = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t\\td = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t\\tc = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t\\tb = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n\\t\\ta = safe_add(a, olda);\\n\\t\\tb = safe_add(b, oldb);\\n\\t\\tc = safe_add(c, oldc);\\n\\t\\td = safe_add(d, oldd);\\n\\t}\\n\\treturn Array(a, b, c, d);\\n}\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n}\",\n \"function binl_md5(x, len) {\\n var olda, oldb, oldc, oldd, a = 1732584193, b = -271733879, c = -1732584194, d = 271733878;\\n // append padding\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n for (var i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n a = MD5.md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = MD5.md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = MD5.md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = MD5.md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = MD5.md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = MD5.md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = MD5.md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = MD5.md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = MD5.md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = MD5.md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = MD5.md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = MD5.md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = MD5.md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = MD5.md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = MD5.md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = MD5.md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = MD5.md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = MD5.md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = MD5.md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = MD5.md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = MD5.md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = MD5.md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = MD5.md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = MD5.md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = MD5.md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = MD5.md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = MD5.md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = MD5.md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = MD5.md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = MD5.md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = MD5.md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = MD5.md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = MD5.md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = MD5.md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = MD5.md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = MD5.md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = MD5.md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = MD5.md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = MD5.md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = MD5.md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = MD5.md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = MD5.md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = MD5.md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = MD5.md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = MD5.md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = MD5.md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = MD5.md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = MD5.md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = MD5.md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = MD5.md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = MD5.md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = MD5.md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = MD5.md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = MD5.md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = MD5.md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = MD5.md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = MD5.md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = MD5.md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = MD5.md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = MD5.md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = MD5.md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = MD5.md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = MD5.md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = MD5.md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = MD5.safe_add(a, olda);\\n b = MD5.safe_add(b, oldb);\\n c = MD5.safe_add(c, oldc);\\n d = MD5.safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function leword_md5(x, len) {\\n\\tvar i, olda, oldb, oldc, oldd,\\n\\t\\ta = 1732584193,\\n\\t\\tb = -271733879,\\n\\t\\tc = -1732584194,\\n\\t\\td = 271733878;\\n\\t\\n\\t/* append padding */\\n\\tx[len >> 5] |= 0x80 << (len % 32);\\n\\tx[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\tfor (i = 0; i < x.length; i += 16) {\\n\\t\\tolda = a;\\n\\t\\toldb = b;\\n\\t\\toldc = c;\\n\\t\\toldd = d;\\n\\t\\t\\n\\t\\ta = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t\\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t\\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t\\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t\\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\t\\t\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t\\tb = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t\\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t\\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t\\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t\\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\t\\t\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t\\td = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t\\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t\\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t\\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t\\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\t\\t\\n\\t\\ta = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t\\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t\\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t\\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t\\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\t\\t\\n\\t\\ta = add32b_op16b(a, olda);\\n\\t\\tb = add32b_op16b(b, oldb);\\n\\t\\tc = add32b_op16b(c, oldc);\\n\\t\\td = add32b_op16b(d, oldd);\\n\\t}\\n\\treturn [a, b, c, d];\\n}\",\n \"function binl_md5(x, len) {\\r\\n /* append padding */\\r\\n x[len >> 5] |= 0x80 << ((len) % 32);\\r\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\r\\n\\r\\n var i, olda, oldb, oldc, oldd,\\r\\n a = 1732584193,\\r\\n b = -271733879,\\r\\n c = -1732584194,\\r\\n d = 271733878;\\r\\n\\r\\n for (i = 0; i < x.length; i += 16) {\\r\\n olda = a;\\r\\n oldb = b;\\r\\n oldc = c;\\r\\n oldd = d;\\r\\n\\r\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\r\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\r\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\r\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\r\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\r\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\r\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\r\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\r\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\r\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\r\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\r\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\r\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\r\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\r\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\r\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\r\\n\\r\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\r\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\r\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\r\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\r\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\r\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\r\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\r\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\r\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\r\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\r\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\r\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\r\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\r\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\r\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\r\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\r\\n\\r\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\r\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\r\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\r\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\r\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\r\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\r\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\r\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\r\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\r\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\r\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\r\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\r\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\r\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\r\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\r\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\r\\n\\r\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\r\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\r\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\r\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\r\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\r\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\r\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\r\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\r\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\r\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\r\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\r\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\r\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\r\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\r\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\r\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\r\\n\\r\\n a = safe_add(a, olda);\\r\\n b = safe_add(b, oldb);\\r\\n c = safe_add(c, oldc);\\r\\n d = safe_add(d, oldd);\\r\\n }\\r\\n return [a, b, c, d];\\r\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binl_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var i, olda, oldb, oldc, oldd,\\n a = 1732584193,\\n b = -271733879,\\n c = -1732584194,\\n d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n }\",\n \"function binlMD5(x,len){/* append padding */x[len>>5]|=0x80<>>9<<4)+14]=len;var i;var olda;var oldb;var oldc;var oldd;var a=1732584193;var b=-271733879;var c=-1732584194;var d=271733878;for(i=0;i>5] |=0x80<<((len)%32);\\n\\tx[(((len+64)>>>9)<<4)+14]=len;\\n\\tvar a=1732584193;\\n\\tvar b=-271733879;\\n\\tvar c=-1732584194;\\n\\tvar d=271733878;\\n\\tfor(var i=0;i> 5] |= 0x80 << ((len) % 32); \\n x[(((len + 64) >>> 9) << 4) + 14] = len; \\n \\n var a = 1732584193; \\n var b = -271733879; \\n var c = -1732584194; \\n var d = 271733878; \\n \\n for(var i = 0; i < x.length; i += 16) { \\n var olda = a; \\n var oldb = b; \\n var oldc = c; \\n var oldd = d; \\n \\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); \\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); \\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); \\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); \\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); \\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); \\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); \\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); \\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); \\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); \\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063); \\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); \\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); \\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); \\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); \\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); \\n \\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); \\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); \\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); \\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); \\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); \\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); \\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); \\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); \\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); \\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); \\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); \\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); \\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); \\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); \\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); \\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); \\n \\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); \\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); \\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); \\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); \\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); \\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); \\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); \\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); \\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); \\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); \\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); \\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); \\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); \\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); \\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); \\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); \\n \\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); \\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); \\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); \\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); \\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); \\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); \\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); \\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); \\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); \\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); \\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); \\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); \\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); \\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); \\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); \\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); \\n \\n a = safe_add(a, olda); \\n b = safe_add(b, oldb); \\n c = safe_add(c, oldc); \\n d = safe_add(d, oldd); \\n } \\n return Array(a, b, c, d); \\n}\",\n \"function core_md5(x : Array., len : number) : Array.\\n {\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = this.md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = this.md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = this.md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = this.md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = this.md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = this.md5_ff(d, a, b, c, x[i+ 5] as number, 12, 1200080426);\\n c = this.md5_ff(c, d, a, b, x[i+ 6] as number, 17, -1473231341);\\n b = this.md5_ff(b, c, d, a, x[i+ 7] as number, 22, -45705983);\\n a = this.md5_ff(a, b, c, d, x[i+ 8] as number, 7 , 1770035416);\\n d = this.md5_ff(d, a, b, c, x[i+ 9] as number, 12, -1958414417);\\n c = this.md5_ff(c, d, a, b, x[i+10] as number, 17, -42063);\\n b = this.md5_ff(b, c, d, a, x[i+11] as number, 22, -1990404162);\\n a = this.md5_ff(a, b, c, d, x[i+12] as number, 7 , 1804603682);\\n d = this.md5_ff(d, a, b, c, x[i+13] as number, 12, -40341101);\\n c = this.md5_ff(c, d, a, b, x[i+14] as number, 17, -1502002290);\\n b = this.md5_ff(b, c, d, a, x[i+15] as number, 22, 1236535329);\\n\\n a = this.md5_gg(a, b, c, d, x[i+ 1] as number, 5 , -165796510);\\n d = this.md5_gg(d, a, b, c, x[i+ 6] as number, 9 , -1069501632);\\n c = this.md5_gg(c, d, a, b, x[i+11] as number, 14, 643717713);\\n b = this.md5_gg(b, c, d, a, x[i+ 0] as number, 20, -373897302);\\n a = this.md5_gg(a, b, c, d, x[i+ 5] as number, 5 , -701558691);\\n d = this.md5_gg(d, a, b, c, x[i+10] as number, 9 , 38016083);\\n c = this.md5_gg(c, d, a, b, x[i+15] as number, 14, -660478335);\\n b = this.md5_gg(b, c, d, a, x[i+ 4] as number, 20, -405537848);\\n a = this.md5_gg(a, b, c, d, x[i+ 9] as number, 5 , 568446438);\\n d = this.md5_gg(d, a, b, c, x[i+14] as number, 9 , -1019803690);\\n c = this.md5_gg(c, d, a, b, x[i+ 3] as number, 14, -187363961);\\n b = this.md5_gg(b, c, d, a, x[i+ 8] as number, 20, 1163531501);\\n a = this.md5_gg(a, b, c, d, x[i+13] as number, 5 , -1444681467);\\n d = this.md5_gg(d, a, b, c, x[i+ 2] as number, 9 , -51403784);\\n c = this.md5_gg(c, d, a, b, x[i+ 7] as number, 14, 1735328473);\\n b = this.md5_gg(b, c, d, a, x[i+12] as number, 20, -1926607734);\\n\\n a = this.md5_hh(a, b, c, d, x[i+ 5] as number, 4 , -378558);\\n d = this.md5_hh(d, a, b, c, x[i+ 8] as number, 11, -2022574463);\\n c = this.md5_hh(c, d, a, b, x[i+11] as number, 16, 1839030562);\\n b = this.md5_hh(b, c, d, a, x[i+14] as number, 23, -35309556);\\n a = this.md5_hh(a, b, c, d, x[i+ 1] as number, 4 , -1530992060);\\n d = this.md5_hh(d, a, b, c, x[i+ 4] as number, 11, 1272893353);\\n c = this.md5_hh(c, d, a, b, x[i+ 7] as number, 16, -155497632);\\n b = this.md5_hh(b, c, d, a, x[i+10] as number, 23, -1094730640);\\n a = this.md5_hh(a, b, c, d, x[i+13] as number, 4 , 681279174);\\n d = this.md5_hh(d, a, b, c, x[i+ 0] as number, 11, -358537222);\\n c = this.md5_hh(c, d, a, b, x[i+ 3] as number, 16, -722521979);\\n b = this.md5_hh(b, c, d, a, x[i+ 6] as number, 23, 76029189);\\n a = this.md5_hh(a, b, c, d, x[i+ 9] as number, 4 , -640364487);\\n d = this.md5_hh(d, a, b, c, x[i+12] as number, 11, -421815835);\\n c = this.md5_hh(c, d, a, b, x[i+15] as number, 16, 530742520);\\n b = this.md5_hh(b, c, d, a, x[i+ 2] as number, 23, -995338651);\\n\\n a = this.md5_ii(a, b, c, d, x[i+ 0] as number, 6 , -198630844);\\n d = this.md5_ii(d, a, b, c, x[i+ 7] as number, 10, 1126891415);\\n c = this.md5_ii(c, d, a, b, x[i+14] as number, 15, -1416354905);\\n b = this.md5_ii(b, c, d, a, x[i+ 5] as number, 21, -57434055);\\n a = this.md5_ii(a, b, c, d, x[i+12] as number, 6 , 1700485571);\\n d = this.md5_ii(d, a, b, c, x[i+ 3] as number, 10, -1894986606);\\n c = this.md5_ii(c, d, a, b, x[i+10] as number, 15, -1051523);\\n b = this.md5_ii(b, c, d, a, x[i+ 1] as number, 21, -2054922799);\\n a = this.md5_ii(a, b, c, d, x[i+ 8] as number, 6 , 1873313359);\\n d = this.md5_ii(d, a, b, c, x[i+15] as number, 10, -30611744);\\n c = this.md5_ii(c, d, a, b, x[i+ 6] as number, 15, -1560198380);\\n b = this.md5_ii(b, c, d, a, x[i+13] as number, 21, 1309151649);\\n a = this.md5_ii(a, b, c, d, x[i+ 4] as number, 6 , -145523070);\\n d = this.md5_ii(d, a, b, c, x[i+11] as number, 10, -1120210379);\\n c = this.md5_ii(c, d, a, b, x[i+ 2] as number, 15, 718787259);\\n b = this.md5_ii(b, c, d, a, x[i+ 9] as number, 21, -343485551);\\n\\n a = this.safe_add(a, olda);\\n b = this.safe_add(b, oldb);\\n c = this.safe_add(c, oldc);\\n d = this.safe_add(d, oldd);\\n }\\n return [a, b, c, d];\\n\\n }\",\n \"function core_md5 (x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32)\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len\\n\\t\\n\\t var a = 1732584193\\n\\t var b = -271733879\\n\\t var c = -1732584194\\n\\t var d = 271733878\\n\\t\\n\\t for (var i = 0; i < x.length; i += 16) {\\n\\t var olda = a\\n\\t var oldb = b\\n\\t var oldc = c\\n\\t var oldd = d\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936)\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586)\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819)\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330)\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897)\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426)\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341)\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983)\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416)\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417)\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063)\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162)\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682)\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101)\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290)\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329)\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510)\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632)\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713)\\n\\t b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302)\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691)\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083)\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335)\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848)\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438)\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690)\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961)\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501)\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467)\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784)\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473)\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734)\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558)\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463)\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562)\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556)\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060)\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353)\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632)\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640)\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174)\\n\\t d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222)\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979)\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189)\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487)\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835)\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520)\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651)\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844)\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415)\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905)\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055)\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571)\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606)\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523)\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799)\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359)\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744)\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380)\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649)\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070)\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379)\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259)\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551)\\n\\t\\n\\t a = safe_add(a, olda)\\n\\t b = safe_add(b, oldb)\\n\\t c = safe_add(c, oldc)\\n\\t d = safe_add(d, oldd)\\n\\t }\\n\\t\\n\\t return [a, b, c, d]\\n\\t}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[(len + 64 >>> 9 << 4) + 14] = len;\\n var i;\\n var olda;\\n var oldb;\\n var oldc;\\n var oldd;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (i = 0; i < x.length; i += 16) {\\n olda = a;\\n oldb = b;\\n oldc = c;\\n oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function core_md5(x, len) {\\n\\t\\t/* append padding */\\n\\t\\tx[len >> 5] |= 0x80 << len % 32;\\n\\t\\tx[(len + 64 >>> 9 << 4) + 14] = len;\\n\\t\\tvar a = 1732584193;\\n\\t\\tvar b = -271733879;\\n\\t\\tvar c = -1732584194;\\n\\t\\tvar d = 271733878;\\n\\t\\tfor (var i = 0; i < x.length; i += 16) {\\n\\t\\t\\tvar olda = a;\\n\\t\\t\\tvar oldb = b;\\n\\t\\t\\tvar oldc = c;\\n\\t\\t\\tvar oldd = d;\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t\\t\\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t\\t\\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t\\t\\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t\\t\\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\t\\t\\ta = safe_add(a, olda);\\n\\t\\t\\tb = safe_add(b, oldb);\\n\\t\\t\\tc = safe_add(c, oldc);\\n\\t\\t\\td = safe_add(d, oldd);\\n\\t\\t}\\n\\t\\treturn Array(a, b, c, d);\\n\\t}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n let a = 1732584193;\\n let b = -271733879;\\n let c = -1732584194;\\n let d = 271733878;\\n\\n for (let i = 0; i < x.length; i += 16) {\\n const olda = a;\\n const oldb = b;\\n const oldc = c;\\n const oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n let a = 1732584193;\\n let b = -271733879;\\n let c = -1732584194;\\n let d = 271733878;\\n\\n for (let i = 0; i < x.length; i += 16) {\\n const olda = a;\\n const oldb = b;\\n const oldc = c;\\n const oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n let a = 1732584193;\\n let b = -271733879;\\n let c = -1732584194;\\n let d = 271733878;\\n\\n for (let i = 0; i < x.length; i += 16) {\\n const olda = a;\\n const oldb = b;\\n const oldc = c;\\n const oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n let a = 1732584193;\\n let b = -271733879;\\n let c = -1732584194;\\n let d = 271733878;\\n\\n for (let i = 0; i < x.length; i += 16) {\\n const olda = a;\\n const oldb = b;\\n const oldc = c;\\n const oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n\\n return [a, b, c, d];\\n}\",\n \"function wordsToMd5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << len % 32;\\n x[getOutputLength(len) - 1] = len;\\n let a = 1732584193;\\n let b = -271733879;\\n let c = -1732584194;\\n let d = 271733878;\\n for (let i = 0; i < x.length; i += 16) {\\n const olda = a;\\n const oldb = b;\\n const oldc = c;\\n const oldd = d;\\n a = md5ff(a, b, c, d, x[i], 7, -680876936);\\n d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5gg(b, c, d, a, x[i], 20, -373897302);\\n a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n a = md5hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5hh(d, a, b, c, x[i], 11, -358537222);\\n c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);\\n a = md5ii(a, b, c, d, x[i], 6, -198630844);\\n d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);\\n a = safeAdd(a, olda);\\n b = safeAdd(b, oldb);\\n c = safeAdd(c, oldc);\\n d = safeAdd(d, oldd);\\n }\\n return [a, b, c, d];\\n}\",\n \"function core_md5(x, len) \\n{ \\n/* append padding */ \\nx[len >> 5] |= 0x80 << ((len) % 32); \\nx[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\nvar a = 1732584193; \\nvar b = -271733879; \\nvar c = -1732584194; \\nvar d = 271733878;\\n\\nfor(var i = 0; i < x.length; i += 16) \\n{ \\nvar olda = a; \\nvar oldb = b; \\nvar oldc = c; \\nvar oldd = d;\\n\\na = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); \\nd = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); \\nc = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); \\nb = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); \\na = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); \\nd = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); \\nc = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); \\nb = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); \\na = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); \\nd = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); \\nc = md5_ff(c, d, a, b, x[i+10], 17, -42063); \\nb = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); \\na = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); \\nd = md5_ff(d, a, b, c, x[i+13], 12, -40341101); \\nc = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); \\nb = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\na = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); \\nd = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); \\nc = md5_gg(c, d, a, b, x[i+11], 14, 643717713); \\nb = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); \\na = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); \\nd = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); \\nc = md5_gg(c, d, a, b, x[i+15], 14, -660478335); \\nb = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); \\na = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); \\nd = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); \\nc = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); \\nb = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); \\na = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); \\nd = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); \\nc = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); \\nb = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\na = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); \\nd = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); \\nc = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); \\nb = md5_hh(b, c, d, a, x[i+14], 23, -35309556); \\na = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); \\nd = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); \\nc = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); \\nb = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); \\na = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); \\nd = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); \\nc = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); \\nb = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); \\na = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); \\nd = md5_hh(d, a, b, c, x[i+12], 11, -421815835); \\nc = md5_hh(c, d, a, b, x[i+15], 16, 530742520); \\nb = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\na = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); \\nd = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); \\nc = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); \\nb = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); \\na = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); \\nd = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); \\nc = md5_ii(c, d, a, b, x[i+10], 15, -1051523); \\nb = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); \\na = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); \\nd = md5_ii(d, a, b, c, x[i+15], 10, -30611744); \\nc = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); \\nb = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); \\na = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); \\nd = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); \\nc = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); \\nb = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\na = safe_add(a, olda); \\nb = safe_add(b, oldb); \\nc = safe_add(c, oldc); \\nd = safe_add(d, oldd); \\n} \\nreturn Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len) {\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n \\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n \\n for (var i = 0; i < x.length; i += 16) {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n \\n a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n \\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n \\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n \\n a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n \\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n \\n}\",\n \"function core_md5(x, len) {\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << len % 32;\\n\\t x[(len + 64 >>> 9 << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for (var i = 0; i < x.length; i += 16) {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len)\\n\\t{\\n\\t /* append padding */\\n\\t x[len >> 5] |= 0x80 << ((len) % 32);\\n\\t x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\t\\n\\t var a = 1732584193;\\n\\t var b = -271733879;\\n\\t var c = -1732584194;\\n\\t var d = 271733878;\\n\\t\\n\\t for(var i = 0; i < x.length; i += 16)\\n\\t {\\n\\t var olda = a;\\n\\t var oldb = b;\\n\\t var oldc = c;\\n\\t var oldd = d;\\n\\t\\n\\t a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n\\t d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n\\t c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n\\t b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n\\t a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n\\t d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n\\t c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n\\t b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n\\t a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n\\t d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n\\t c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n\\t b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n\\t a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n\\t d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n\\t c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n\\t b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\t\\n\\t a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n\\t d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n\\t c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n\\t b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n\\t a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n\\t d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n\\t c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n\\t b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n\\t a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n\\t d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n\\t c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n\\t b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n\\t a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n\\t d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n\\t c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n\\t b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\t\\n\\t a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n\\t d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n\\t c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n\\t b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n\\t a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n\\t d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n\\t c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n\\t b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n\\t a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n\\t d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n\\t c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n\\t b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n\\t a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n\\t d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n\\t c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n\\t b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\t\\n\\t a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n\\t d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n\\t c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n\\t b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n\\t a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n\\t d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n\\t c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n\\t b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n\\t a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n\\t d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n\\t c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n\\t b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n\\t a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n\\t d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n\\t c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n\\t b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\t\\n\\t a = safe_add(a, olda);\\n\\t b = safe_add(b, oldb);\\n\\t c = safe_add(c, oldc);\\n\\t d = safe_add(d, oldd);\\n\\t }\\n\\t return Array(a, b, c, d);\\n\\t\\n\\t}\",\n \"function core_md5(x, len) {\\n\\t\\t\\t/* append padding */\\n\\t\\t\\tx[len >> 5] |= 0x80 << ((len) % 32);\\n\\t\\t\\tx[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n\\t\\t\\tvar a = 1732584193;\\n\\t\\t\\tvar b = -271733879;\\n\\t\\t\\tvar c = -1732584194;\\n\\t\\t\\tvar d = 271733878;\\n\\n\\t\\t\\tfor(var i = 0; i < x.length; i += 16) {\\n\\t\\t\\t\\tvar olda = a;\\n\\t\\t\\t\\tvar oldb = b;\\n\\t\\t\\t\\tvar oldc = c;\\n\\t\\t\\t\\tvar oldd = d;\\n\\n\\t\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\\n\\t\\t\\t\\td = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\n\\t\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\n\\t\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\n\\t\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\n\\t\\t\\t\\td = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\n\\t\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\n\\t\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\n\\t\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\n\\t\\t\\t\\td = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\n\\t\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\n\\t\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\n\\t\\t\\t\\ta = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\n\\t\\t\\t\\td = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\n\\t\\t\\t\\tc = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\n\\t\\t\\t\\tb = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\n\\n\\t\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\n\\t\\t\\t\\td = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\n\\t\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\n\\t\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\\n\\t\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\n\\t\\t\\t\\td = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\n\\t\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\n\\t\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\n\\t\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\n\\t\\t\\t\\td = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\n\\t\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\n\\t\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\n\\t\\t\\t\\ta = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\n\\t\\t\\t\\td = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\n\\t\\t\\t\\tc = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\n\\t\\t\\t\\tb = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\n\\n\\t\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\n\\t\\t\\t\\td = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\n\\t\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\n\\t\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\n\\t\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\n\\t\\t\\t\\td = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\n\\t\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\n\\t\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\n\\t\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\n\\t\\t\\t\\td = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\\n\\t\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\n\\t\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\n\\t\\t\\t\\ta = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\n\\t\\t\\t\\td = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\n\\t\\t\\t\\tc = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\n\\t\\t\\t\\tb = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\n\\n\\t\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\\n\\t\\t\\t\\td = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\n\\t\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\n\\t\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\n\\t\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\n\\t\\t\\t\\td = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\n\\t\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\n\\t\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\n\\t\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\n\\t\\t\\t\\td = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\n\\t\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\n\\t\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\n\\t\\t\\t\\ta = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\n\\t\\t\\t\\td = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\n\\t\\t\\t\\tc = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\n\\t\\t\\t\\tb = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\n\\n\\t\\t\\t\\ta = safe_add(a, olda);\\n\\t\\t\\t\\tb = safe_add(b, oldb);\\n\\t\\t\\t\\tc = safe_add(c, oldc);\\n\\t\\t\\t\\td = safe_add(d, oldd);\\n\\t\\t\\t}\\n\\t\\t\\treturn Array(a, b, c, d);\\n\\t\\t}\",\n \"function core_md5(x, len) {\\r\\n /* append padding */\\r\\n x[len >> 5] |= 0x80 << ((len) % 32);\\r\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\r\\n\\r\\n var a = 1732584193;\\r\\n var b = -271733879;\\r\\n var c = -1732584194;\\r\\n var d = 271733878;\\r\\n\\r\\n for (var i = 0; i < x.length; i += 16) {\\r\\n var olda = a;\\r\\n var oldb = b;\\r\\n var oldc = c;\\r\\n var oldd = d;\\r\\n\\r\\n a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);\\r\\n d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);\\r\\n c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);\\r\\n b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);\\r\\n a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);\\r\\n d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);\\r\\n c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);\\r\\n b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);\\r\\n a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);\\r\\n d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);\\r\\n c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);\\r\\n b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);\\r\\n a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);\\r\\n d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);\\r\\n c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);\\r\\n b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);\\r\\n\\r\\n a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);\\r\\n d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);\\r\\n c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);\\r\\n b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);\\r\\n a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);\\r\\n d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);\\r\\n c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);\\r\\n b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);\\r\\n a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);\\r\\n d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);\\r\\n c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);\\r\\n b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);\\r\\n a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);\\r\\n d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);\\r\\n c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);\\r\\n b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);\\r\\n\\r\\n a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);\\r\\n d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);\\r\\n c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);\\r\\n b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);\\r\\n a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);\\r\\n d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);\\r\\n c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);\\r\\n b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);\\r\\n a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);\\r\\n d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);\\r\\n c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);\\r\\n b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);\\r\\n a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);\\r\\n d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);\\r\\n c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);\\r\\n b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);\\r\\n\\r\\n a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);\\r\\n d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);\\r\\n c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);\\r\\n b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);\\r\\n a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);\\r\\n d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);\\r\\n c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);\\r\\n b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);\\r\\n a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);\\r\\n d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);\\r\\n c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);\\r\\n b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);\\r\\n a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);\\r\\n d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);\\r\\n c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);\\r\\n b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);\\r\\n\\r\\n a = safe_add(a, olda);\\r\\n b = safe_add(b, oldb);\\r\\n c = safe_add(c, oldc);\\r\\n d = safe_add(d, oldd);\\r\\n }\\r\\n return Array(a, b, c, d);\\r\\n\\r\\n }\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\",\n \"function core_md5(x, len)\\n{\\n /* append padding */\\n x[len >> 5] |= 0x80 << ((len) % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n\\n var a = 1732584193;\\n var b = -271733879;\\n var c = -1732584194;\\n var d = 271733878;\\n\\n for(var i = 0; i < x.length; i += 16)\\n {\\n var olda = a;\\n var oldb = b;\\n var oldc = c;\\n var oldd = d;\\n\\n a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\\n d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\\n c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\\n b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\\n a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\\n d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\\n c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\\n b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\\n a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\\n d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\\n c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\\n b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\\n a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\\n d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\\n c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\\n b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\\n\\n a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\\n d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\\n c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\\n b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\\n a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\\n d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\\n c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\\n b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\\n a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\\n d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\\n c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\\n b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\\n a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\\n d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\\n c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\\n b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\\n\\n a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\\n d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\\n c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\\n b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\\n a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\\n d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\\n c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\\n b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\\n a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\\n d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\\n c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\\n b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\\n a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\\n d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\\n c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\\n b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\\n\\n a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\\n d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\\n c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\\n b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\\n a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\\n d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\\n c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\\n b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\\n a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\\n d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\\n c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\\n b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\\n a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\\n d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\\n c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\\n b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n return Array(a, b, c, d);\\n\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7908864","0.7908864","0.7851151","0.7851151","0.78297484","0.781424","0.7799697","0.7797474","0.77968043","0.77968043","0.77955353","0.7787075","0.7781164","0.7781164","0.77667457","0.77615637","0.7760521","0.7751281","0.7748616","0.7743792","0.7743792","0.7743792","0.7743792","0.7743792","0.7743792","0.7743792","0.77375746","0.7729931","0.772481","0.7709786","0.77086514","0.770115","0.7695157","0.7678502","0.767632","0.7663077","0.7663077","0.7663077","0.7663077","0.76334345","0.76247174","0.7620554","0.76130843","0.7558494","0.75508064","0.7540283","0.7533404","0.7526618","0.7526618","0.7526618","0.7526618","0.7526618","0.7526618","0.749391","0.749391","0.749391","0.749391","0.7483203","0.74822277","0.74802476","0.74660134","0.746039","0.746039","0.746039","0.746039","0.746039","0.746039","0.746039","0.74583393","0.7453497","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534","0.74454534"],"string":"[\n \"0.7908864\",\n \"0.7908864\",\n \"0.7851151\",\n \"0.7851151\",\n \"0.78297484\",\n \"0.781424\",\n \"0.7799697\",\n \"0.7797474\",\n \"0.77968043\",\n \"0.77968043\",\n \"0.77955353\",\n \"0.7787075\",\n \"0.7781164\",\n \"0.7781164\",\n \"0.77667457\",\n \"0.77615637\",\n \"0.7760521\",\n \"0.7751281\",\n \"0.7748616\",\n \"0.7743792\",\n \"0.7743792\",\n \"0.7743792\",\n \"0.7743792\",\n \"0.7743792\",\n \"0.7743792\",\n \"0.7743792\",\n \"0.77375746\",\n \"0.7729931\",\n \"0.772481\",\n \"0.7709786\",\n \"0.77086514\",\n \"0.770115\",\n \"0.7695157\",\n \"0.7678502\",\n \"0.767632\",\n \"0.7663077\",\n \"0.7663077\",\n \"0.7663077\",\n \"0.7663077\",\n \"0.76334345\",\n \"0.76247174\",\n \"0.7620554\",\n \"0.76130843\",\n \"0.7558494\",\n \"0.75508064\",\n \"0.7540283\",\n \"0.7533404\",\n \"0.7526618\",\n \"0.7526618\",\n \"0.7526618\",\n \"0.7526618\",\n \"0.7526618\",\n \"0.7526618\",\n \"0.749391\",\n \"0.749391\",\n \"0.749391\",\n \"0.749391\",\n \"0.7483203\",\n \"0.74822277\",\n \"0.74802476\",\n \"0.74660134\",\n \"0.746039\",\n \"0.746039\",\n \"0.746039\",\n \"0.746039\",\n \"0.746039\",\n \"0.746039\",\n \"0.746039\",\n \"0.74583393\",\n \"0.7453497\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\",\n \"0.74454534\"\n]"},"document_score":{"kind":"string","value":"0.7489554"},"document_rank":{"kind":"string","value":"70"}}},{"rowIdx":80790,"cells":{"query":{"kind":"string","value":"These functions implement the four basic operations the algorithm uses."},"document":{"kind":"string","value":"function md5_cmn (q, a, b, x, s, t) {\n return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function BasicOp(a, b) {\n var sum = a + b;\n console.log(\"sum\" + sum);\n var sub = a - b;\n console.log(\"sub\" + sub);\n var multi = a * b;\n console.log(\"multiplication\" + multi);\n var div = a / b;\n console.log(\"devision\" + sub);\n}","function arithmaticOpration(){\n\taddition();\n\tSubstration();\n\tMultiplication();\n\tDivision();\n\tModulus();\n\tIncrementPost();\n\tDecrementPre();\n\tPostPre();\n\n}","function common_operation(value1,value2){\r\n var x = name_3.id[0];\r\n var y = name_3.id[1];\r\n x = parseInt(x);\r\n y = parseInt(y);\r\n var z = castle_elephent_4(x,y,turn);\r\n if (z == 5){\r\n return assign(value1,value2,x,y,turn);\r\n }\r\n else{\r\n z = castle_elephent_3(x,y,turn);\r\n if (z == 5){\r\n return assign(value1,value2,x,y,turn);\r\n } \r\n else{\r\n z = castle_elephent_2(x,y,turn);\r\n if (z == 5){\r\n return assign(value1,value2,x,y,turn);\r\n } \r\n else{\r\n z = castle_elephent_1(x,y,turn);\r\n if (z == 5){\r\n return assign(value1,value2,x,y,turn);\r\n } \r\n else{\r\n \r\n } \r\n } \r\n } \r\n }\r\n}","function order_of_operation(){\n for(var i = 0; ix);\n if (tempArr.length>2){\n let rslt = 'argtttt';\n if (tempArr[1]==='+') {\n rslt = add(tempArr[0],tempArr[2]);\n }\n else if (tempArr[1]==='-') {\n rslt = substract(tempArr[0],tempArr[2]);\n }\n tempArr.splice(0,3,rslt);\n return compute(tempArr);\n }\n else return tempArr[0];\n}","function alg1(){\nalert(\"Sometimes we have to find the HCF and LCM of algebraic expressions.This depends on our ability to identify factors correctly\");\nalert(\"For example lets find the HCF and LCM of a²b,a³b² and a²b³.Now a and b are the common factors in the three terms.Use a and b with the lowest powers for HCF and those with the highest powers for LCM.In this case HCF=a²b(pick out the lowest power of each common factor.LCM=a³b³(pick out the highest power of each factor.)\");\nalert(\"Lets do more examples on HCF and LCM of algebraic expressions\");\nalert(\"Find the HCF and LCM of 3x+3,2x+2,x²-1.First factorise the terms ie 3x+3=3(x+1),2x+2=2(x+1) and x²-1=(x-1)(x+1). Looking at the three terms (x+1) is common hence HCF=(x+1).Now for the LCM take each factor where its most abundant hence LCM=2×3(x-1)(x+1)**Note-no need to expand brackets.\");\nalert(\"Find the HCF and LCM of x²-9,x²+6x+9 and 2x²+7x+3.First factorise the above quadratic expressions ie x²-9=(x+3)(x-3),x²+6x+9=(x+3)(x+3) and 2x²+7x+3=(2x+1)(x+3).Looking at the above terms (x+3) is common hence HCF=(x+3).For LCM take each factor where its most common hence LCM=(x+3)²(x-3)(2x+1).\");\n}","function ex_7_R(a, b){\n s = 0; k = a;\n for( i = 1; i 0) {\n for (var i = 0; i < operArr.length; i++) {\n if (operArr[i] == \"/\") {\n tempAns = numArr[i] / numArr[i + 1];\n numArr.splice(i,2, tempAns);\n operArr.splice(i,1);\n i--;\n }\n }\n for (var i = 0; i < operArr.length; i++) {\n if (operArr[i] == \"x\") {\n tempAns = numArr[i] * numArr[i + 1];\n numArr.splice(i,2, tempAns);\n operArr.splice(i,1);\n i--;\n }\n }\n for (var i = 0; i < operArr.length; i++) {\n if (operArr[i] == \"+\") {\n tempAns = numArr[i] + numArr[i + 1];\n numArr.splice(i,2, tempAns);\n operArr.splice(i,1);\n i--;\n }\n }\n for (var i = 0; i < operArr.length; i++) {\n if (operArr[i] == \"-\") {\n tempAns = numArr[i] - numArr[i + 1];\n numArr.splice(i,2, tempAns);\n operArr.splice(i,1);\n i--;\n }\n }\n }\n\n numArr[0] = Math.round(100 * numArr[0]) / 100;\n\n return numArr[0];\n\n}","function basicInstructionFormats(op) {//op = operation for explanple add,sub etc.\n var switcher;//returns the type of instruction\n if (op.equals(\"ADD\") || op.equals(\"SUB\") || op.equals(\"MULT\") || op.equals(\"DIV\") || op.equals(\"AND\")\n || op.equals(\"OR\") || op.equals(\"XOR\") || op.equals(\"SLL\") || op.equals(\"SRL\") || op.equals(\"SLT\")\n || op.equals(\"SLE\") || op.equals(\"SGT\") || op.equals(\"SGE\") || op.equals(\"SEQ\"))\n return switcher = 0; // R-type instructions\n else if (op.equals(\"ADDI\") || op.equals(\"ANDI\") || op.equals(\"ORI\") || op.equals(\"XORI\")\n || op.equals(\"SUBI\") || op.equals(\"SLLI\") || op.equals(\"SRLI\"))\n return switcher = 1; // I-type instructions\n else if (op.equals(\"LW\") || op.equals(\"SW\"))\n return switcher = 2; // load/store word instructions\n else if (op.equals(\"BEQ\") || op.equals(\"BNE\"))\n return switcher = 3; // branch instructions\n else alert(\"INSTRUCTION NOT FOUND :(\")\n }","static approxEqRots(ra, rb) {\nvar aeq, i;\n//------–-----\naeq = (function() {\nvar j, results;\nresults = [];\nfor (i = j = 0; j < 4; i = ++j) {\nresults.push(this.approxEq(ra[i], rb[i]));\n}\nreturn results;\n}).call(this);\nreturn aeq[0] && aeq[1] && aeq[2] && aeq[3];\n}","function calculate(input1,input2,inputN)\r\n{\r\n\t\r\n\treturn output;\r\n}","function makeOpComposition () {\n \n var ops = []; \n var domain = makeEmptyMap(); \n var gen = 0; \n \n var func = function (s) {\n return function (i) {\n return evaluate(domain.has(i) ? (ops.length-1) - (gen-domain.get(i)) : -1, i)(i);\n }\n \n // determine selection state of i but only access the elements \n // of ops (staring from ind) that have i in their domain\n function evaluate(ind, i) {\n if (ind < 0) return s; // i defined in the base selection mapping s\n else {\n var op = ops[ind];\n return op(function (j) { return evaluate(ind - op.domain.get(i), j)(i); });\n // the call to evaluate is wrapped to a lambda to make the call lazy.\n // op will only call the lambda if op.f.constant is false\n }\n }\n }\n \n func.domain = domain;\n \n // member functions of func\n func.push = function (op) {\n ops.push(op);\n ++gen\n op.domain.forEach(function(_, i) {\n op.domain.set(i, domain.has(i) ? gen - domain.get(i) : ops.length);\n domain.set(i, gen); \n });\n }\n func.pop = function () {\n var n = ops.length;\n var op = ops.pop();\n --gen;\n // domain updated for those elements that are in op.domain\n op.domain.forEach(function (_, i) {\n if (op.domain.get(i) >= n) domain.delete(i); // no op defines i\n else domain.set(i, domain.get(i) - op.domain.get(i)); \n });\n return op;\n }\n func.top = function () { return ops[ops.length - 1]; }\n func.top2 = function () { return ops[ops.length - 2]; }\n func.shift = function (bmap) {\n var op = ops.shift();\n op.domain.forEach(function(_, i) {\n if (domain.get(i) - gen === ops.length) { domain.delete(i); }\n // if lastOp the only op that defines i, remove i from domain\n });\n return op;\n }\n func.size = function () { return ops.length; }\n func.removeIndex = function (i) {\n if (!domain.has(i)) return;\n \n // find the first op in ops that defines i\n var j = (ops.length - 1) - (gen - domain.get(i));\n \n while (j >= 0) {\n var d = ops[j].domain.get(i);\n ops[j].domain.delete(i);\n j -= d;\n }\n domain.delete(i);\n }\n \n return func;\n }","function operate(nums) {\n\t\tvar num1 = nums[0];\n\t\tvar num2 = nums[1];\n\t\tvar num3 = nums[2];\n\t\tvar num4 = nums[3];\n\n\t\tfor(var i=0; i < op_keys.length; i++) {\n\t\t\tfor(var j=0; j < op_keys.length; j++) {\n\t\t\t\tfor(var k=0; k < op_keys.length; k++) {\n\t\t\t\t\tvar operation = \"(\" + \"(\" + num1 + op_keys[i] + num2 + \")\" + op_keys[j] + num3 + \")\" + op_keys[k] + num4;\n\t\t\t\t\tvar result = OPS[op_keys[i]](num1, num2);\n\t\t\t\t\tvar result2 = OPS[op_keys[j]](result, num3);\n\t\t\t\t\tvar result3 = OPS[op_keys[k]](result2, num4);\n\t\t\t\t\tvar display = operation + \" = \" + result3;\n\n\t\t\t\t\tif (result3 === 24) { \n\t\t\t\t\t\t$listofsolutions.append(\"\" + display + \" \"); \n\t\t\t\t\t}\n\n\t\t\t\t}// k\n\t\t\t}// j\n\t\t}// i\n\n\t}// operate","function a(num1, num2) { // we have this predictable functioin\n // thats minimized the bugs in the code\n return num1 + num2\n}","function extractNumOpt(){\r\nn=arrayNumberOpt.length;\r\n//\r\nvar num1=0;//declared here\r\nvar num2=0;//declared here to be 0 at first\r\n\r\n//\r\nfor(i=0;i= 3 && i%2 == 0){\n if(!isNaN(parseInt(operation[i]))){\n r = calculate(r, operation[i-1], parseInt(operation[i]))\n }\n }else if(i < 3){\n if (!isNaN(parseInt(operation[i]))) {\n num.push(parseInt(operation[i]))\n }else{\n operator.push(operation[i])\n }\n r = calculate(num[0], operator[0], num[1])\n }\n else{\n \n }\n }\n return r\n}","function operate(operator, x, y) {\n if (operator === '+'){\n return add(x,y);\n }\n else if (operator === '-') {\n return subtract(x,y);\n }\n else if (operator === '*') {\n return multiply(x,y);\n }\n else {\n return divide(x,y);\n }\n}","function calT(a, b, op) {\n\n var result;\n \n if (op == \"+\") {\n \n result = a + b;\n \n alert(result);\n }\n \n else if (op == \"-\") {\n \n result = a - b;\n \n alert(result);\n \n }\n \n else if(op == \"*\") {\n \n result = a * b;\n \n alert(result);\n }\n \n else if(op == \"/\"){\n \n result = a / b;\n \n alert(result);\n }\n \n \n }","function calculate(x, op, y) {\n switch (op){\n case \"+\":\n return add(x,y)\n break \n case \"-\":\n return substract(x,y)\n break\n case \"*\":\n return multiply(x,y)\n break\n case \"/\":\n return divide(x,y)\n break\n default:\n null\n }\n}","static operation(a, b, data, n, f = \"0\") {\n // Ensures that the current screen is NOT empty\n if (curr_o != \"\") {\n // Performs the operation through switch function\n switch (data) {\n case \"+\":\n res = b + a;\n check = 1;\n break;\n case \"x\":\n res = b * a;\n check = 1;\n break;\n case \"/\":\n res = b / a;\n check = 1;\n break;\n case \"-\":\n res = b - a;\n check = 1;\n break;\n case \"%\":\n res = (b * a) / 100;\n check = 1;\n break;\n case \"^\":\n res = Math.pow(b, a);\n check = 1;\n }\n }\n // If this function was called from \"result\" target, display the final result on the current screen\n if (f === \"1\") {\n prev_o = res.toString();\n curr_o = prev_o;\n prev_o = \"\";\n Calc.dispprev(prev_o);\n Calc.dispcurr(curr_o);\n }\n // If not then retain the current result on the previous screen followed by any new operator\n else {\n // Ensures that some operation is performed successfully\n if (check === 1) {\n prev_o = res.toString();\n check = 0;\n }\n // Calls this function to append the new operator on previous screen\n Calc.appendp(n);\n Calc.dispprev(prev_o);\n // Makes the current screen empty\n curr_o = \"\";\n Calc.dispcurr(curr_o);\n // Asigns the value of oppr to none\n oppr = \"\";\n }\n return;\n }","function special_cases() {\n //Inserts a zero into index 1 of equation array if the first input is an operation\n if (is_operator(equation_array[0])) {\n equation_array.unshift(\"0\");\n }\n ;\n var store_i = [];\n for (var i = 0; i < equation_array.length; i++) {\n //Checks for a divid by zero case\n if (equation_array[i] == \"/\" && equation_array[i + 1] == 0) {\n display_val = \"Cannot Divid By Zero!\"\n divid_by_zero = true;\n }\n //Checks for a percentage and inserts 100 to divid with\n if (equation_array[i] == \"%\") {\n equation_array.splice(i + 1, 0, \"100\");\n }\n\n }\n ;\n\n //Checks if an equation ends with an operation, if true duplicates last input\n if (is_operator(equation_array[equation_array.length - 1])) {\n equation_array.push(equation_array[equation_array.length - 2]);\n }\n ;\n\n\n}","function add4(a, b) {\r\n return (a + b);\r\n}","function coreMD5(x) \n{ \n var a = 1732584193 \n var b = -271733879 \n var c = -1732584194 \n var d = 271733878 \n \n for(var i = 0; i < x.length; i += 16) \n { \n var olda = a \n var oldb = b \n var oldc = c \n var oldd = d \n \n a = ff(a, b, c, d, x[i+ 0], 7 , -680876936) \n d = ff(d, a, b, c, x[i+ 1], 12, -389564586) \n c = ff(c, d, a, b, x[i+ 2], 17, 606105819) \n b = ff(b, c, d, a, x[i+ 3], 22, -1044525330) \n a = ff(a, b, c, d, x[i+ 4], 7 , -176418897) \n d = ff(d, a, b, c, x[i+ 5], 12, 1200080426) \n c = ff(c, d, a, b, x[i+ 6], 17, -1473231341) \n b = ff(b, c, d, a, x[i+ 7], 22, -45705983) \n a = ff(a, b, c, d, x[i+ 8], 7 , 1770035416) \n d = ff(d, a, b, c, x[i+ 9], 12, -1958414417) \n c = ff(c, d, a, b, x[i+10], 17, -42063) \n b = ff(b, c, d, a, x[i+11], 22, -1990404162) \n a = ff(a, b, c, d, x[i+12], 7 , 1804603682) \n d = ff(d, a, b, c, x[i+13], 12, -40341101) \n c = ff(c, d, a, b, x[i+14], 17, -1502002290) \n b = ff(b, c, d, a, x[i+15], 22, 1236535329) \n \n a = gg(a, b, c, d, x[i+ 1], 5 , -165796510) \n d = gg(d, a, b, c, x[i+ 6], 9 , -1069501632) \n c = gg(c, d, a, b, x[i+11], 14, 643717713) \n b = gg(b, c, d, a, x[i+ 0], 20, -373897302) \n a = gg(a, b, c, d, x[i+ 5], 5 , -701558691) \n d = gg(d, a, b, c, x[i+10], 9 , 38016083) \n c = gg(c, d, a, b, x[i+15], 14, -660478335) \n b = gg(b, c, d, a, x[i+ 4], 20, -405537848) \n a = gg(a, b, c, d, x[i+ 9], 5 , 568446438) \n d = gg(d, a, b, c, x[i+14], 9 , -1019803690) \n c = gg(c, d, a, b, x[i+ 3], 14, -187363961) \n b = gg(b, c, d, a, x[i+ 8], 20, 1163531501) \n a = gg(a, b, c, d, x[i+13], 5 , -1444681467) \n d = gg(d, a, b, c, x[i+ 2], 9 , -51403784) \n c = gg(c, d, a, b, x[i+ 7], 14, 1735328473) \n b = gg(b, c, d, a, x[i+12], 20, -1926607734) \n \n a = hh(a, b, c, d, x[i+ 5], 4 , -378558) \n d = hh(d, a, b, c, x[i+ 8], 11, -2022574463) \n c = hh(c, d, a, b, x[i+11], 16, 1839030562) \n b = hh(b, c, d, a, x[i+14], 23, -35309556) \n a = hh(a, b, c, d, x[i+ 1], 4 , -1530992060) \n d = hh(d, a, b, c, x[i+ 4], 11, 1272893353) \n c = hh(c, d, a, b, x[i+ 7], 16, -155497632) \n b = hh(b, c, d, a, x[i+10], 23, -1094730640) \n a = hh(a, b, c, d, x[i+13], 4 , 681279174) \n d = hh(d, a, b, c, x[i+ 0], 11, -358537222) \n c = hh(c, d, a, b, x[i+ 3], 16, -722521979) \n b = hh(b, c, d, a, x[i+ 6], 23, 76029189) \n a = hh(a, b, c, d, x[i+ 9], 4 , -640364487) \n d = hh(d, a, b, c, x[i+12], 11, -421815835) \n c = hh(c, d, a, b, x[i+15], 16, 530742520) \n b = hh(b, c, d, a, x[i+ 2], 23, -995338651) \n \n a = ii(a, b, c, d, x[i+ 0], 6 , -198630844) \n d = ii(d, a, b, c, x[i+ 7], 10, 1126891415) \n c = ii(c, d, a, b, x[i+14], 15, -1416354905) \n b = ii(b, c, d, a, x[i+ 5], 21, -57434055) \n a = ii(a, b, c, d, x[i+12], 6 , 1700485571) \n d = ii(d, a, b, c, x[i+ 3], 10, -1894986606) \n c = ii(c, d, a, b, x[i+10], 15, -1051523) \n b = ii(b, c, d, a, x[i+ 1], 21, -2054922799) \n a = ii(a, b, c, d, x[i+ 8], 6 , 1873313359) \n d = ii(d, a, b, c, x[i+15], 10, -30611744) \n c = ii(c, d, a, b, x[i+ 6], 15, -1560198380) \n b = ii(b, c, d, a, x[i+13], 21, 1309151649) \n a = ii(a, b, c, d, x[i+ 4], 6 , -145523070) \n d = ii(d, a, b, c, x[i+11], 10, -1120210379) \n c = ii(c, d, a, b, x[i+ 2], 15, 718787259) \n b = ii(b, c, d, a, x[i+ 9], 21, -343485551) \n \n a = safe_add(a, olda) \n b = safe_add(b, oldb) \n c = safe_add(c, oldc) \n d = safe_add(d, oldd) \n } \n return [a, b, c, d] \n}","sumOfHalvesEqual() {}","function calculate(num1, op, num2) {\n // ifs and elses (switch?) using num1, num2 and operator\n\n\n var result;\n\n switch (op) {\n case \"+\":\n result = num1 + num2;\n\n break;\n\n case \"-\":\n result = num1 - num2;\n\n break;\n\n case \"*\":\n result = num1 * num2;\n\n break;\n\n case \"/\":\n result = num1 / num2;\n\n break;\n\n default:\n\n }\n // console.log(result);\n return result;\n }","function main() {\n let meters = 15.6;\n const inches = meterToInches(meters);\n console.log(`${meters} meters = ${inches} inches`);\n console.log();\n let n = Math.floor(Math.random() * 20);\n loopThrough(n);\n console.log(`Sum of numbers from 0 to ${n} is ${calculateSum(n)}`);\n fizzbuzz(30);\n console.log(`Factorial of ${n} is ${findFactorial(n)}`);\n console.log(sleep_in(false, false));\n console.log(sleep_in(true, false));\n console.log(sleep_in(false, true));\n console.log(common([1, 2, 3], [7, 3]));\n console.log(common([1, 2, 3], [1, 0]));\n console.log(common([1, 2, 3], [7, 3, 2]));\n objectsAndKeysChallenge();\n mutatingObjects()\n}","function questionCalculations()\r\n\t{\r\n\t\t// here, calculations for all the above variables should occur\r\n\t}","function calcular (oper,...nums){\n let res\n switch (oper){\n case '+':\n //res = 0\n //for(let n of nums) soma +=n\n res = somaTudo(...nums)\n break\n\n case '*':\n res = 1\n for(let n of nums) res *=n\n }\n return res\n}","function ACombinatorialWithDivide(pEn,pKay) {\nthis.en = pEn\nthis.kay = pKay\n//make a list of the number size that is just for the reminant of the top with the bottom crossed out.\nthis.newList = Array.apply(null, new Array(this.kay)).map(Function.call, Number).map(function(it){return it+this.en-this.kay+1},this)\n//reverse the list\nvar revList=this.newList.map(function(item,index){return this.newList[this.newList.length-index-1]},this)\n//make the other denominator number, that was not cancelled\nthis.botList=this.newList.map(function(item){return item-(this.en-this.kay)},this)\n//reverse that list\nvar revBot=this.botList.map(function(item,index){return this.botList[this.botList.length-index-1]},this)\nvar tallyList = infiniteArrayClone(revBot);\n// Logger.log(\" tallyList: \"+tallyList+\" revBot: \"+revBot+\" revList: \"+revList) \nfor (var cA=0;cA=0){var v=x*this[i++]+w[j]+c;c=Math.floor(v/0x4000000);w[j++]=v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.","function o0(o1, o2) {\n try {\nreturn o34(o32, o36, o37);\n}catch(e){}\n}","function solve182()\n{\n var operations_ArrStr = input.split(\"\\n\");\n var register_MapStrInt = initRegister(operations_ArrStr);\n var register0 = new Map(register_MapStrInt);\n register0.set(\"p\", 0);\n var register1 = new Map(register_MapStrInt);\n register1.set(\"p\", 1);\n register_MapStrInt = new Map(register0);\n var nextOperationIndex_Int = 0; // index of next operation\n var nextOperation0 = 1;\n var nextOperation1 = 1;\n var in_Que = [];\n var out_Que = [];\n \n var count_Int = 0;\n \n var emptyInCount_Int = 0;\n var activeProgramm = 0;\n while(true)\n {\n let operation_ArrStr = operations_ArrStr[nextOperationIndex_Int].split(\" \");\n switch (operation_ArrStr[0])\n {\n case \"snd\":\n if(!isNaN(parseInt(operation_ArrStr[1])))\n {\n out_Que.push(parseInt(operation_ArrStr[1]));\n if(activeProgramm == 1)\n {\n count_Int++;\n }\n }\n else if(register_MapStrInt.has(operation_ArrStr[1]))\n {\n out_Que.push(register_MapStrInt.get(operation_ArrStr[1]));\n if(activeProgramm == 1)\n {\n count_Int++;\n }\n }\n nextOperationIndex_Int++;\n break;\n case \"set\":\n if(!isNaN(parseInt(operation_ArrStr[2])))\n {\n register_MapStrInt.set(operation_ArrStr[1], parseInt(operation_ArrStr[2]));\n }\n else if(register_MapStrInt.has(operation_ArrStr[2]))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[2]));\n }\n nextOperationIndex_Int++;\n break;\n case \"add\":\n if(!isNaN(parseInt(operation_ArrStr[2])))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) + parseInt(operation_ArrStr[2]));\n }\n else if(register_MapStrInt.has(operation_ArrStr[2]))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) + register_MapStrInt.get(operation_ArrStr[2]));\n }\n nextOperationIndex_Int++;\n break;\n case \"mul\":\n if(!isNaN(parseInt(operation_ArrStr[2])))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) * parseInt(operation_ArrStr[2]));\n }\n else if(register_MapStrInt.has(operation_ArrStr[2]))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) * register_MapStrInt.get(operation_ArrStr[2]));\n }\n nextOperationIndex_Int++;\n break;\n case \"mod\":\n if(!isNaN(parseInt(operation_ArrStr[2])))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) % parseInt(operation_ArrStr[2]));\n }\n else if(register_MapStrInt.has(operation_ArrStr[2]))\n {\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) % register_MapStrInt.get(operation_ArrStr[2]));\n }\n nextOperationIndex_Int++;\n break;\n case \"rcv\":\n if(register_MapStrInt.has(operation_ArrStr[1]))\n {\n if(in_Que.length == 0)\n {\n emptyInCount_Int++;\n // check for deadlock\n if(out_Que.length == 0 && emptyInCount_Int >= 2)\n {\n return count_Int;\n }\n if(out_Que.length != 0)\n {\n //emptyInCount_Int = 0; ???\n }\n // change active programm\n if(activeProgramm == 0)\n {\n activeProgramm = 1;\n nextOperation0 = nextOperationIndex_Int;\n nextOperationIndex_Int = nextOperation1 - 1;\n register0 = new Map(register_MapStrInt);\n register_MapStrInt = new Map(register1);\n let a = in_Que.slice();\n in_Que = out_Que.slice();\n out_Que = a.slice(); // = [] (?)\n }\n else if(activeProgramm == 1)\n {\n activeProgramm = 0;\n nextOperation1 = nextOperationIndex_Int;\n nextOperationIndex_Int = nextOperation0 - 1;\n register1 = new Map(register_MapStrInt);\n register_MapStrInt = new Map(register0);\n let a = in_Que.slice();\n in_Que = out_Que.slice();\n out_Que = a.slice(); // = [] (?)\n }\n else\n {\n return -1;\n }\n }\n else\n {\n register_MapStrInt.set(operation_ArrStr[1], in_Que.shift());\n }\n }\n nextOperationIndex_Int++;\n break;\n case \"jgz\":\n var x = 0;\n if(!isNaN(parseInt(operation_ArrStr[1])))\n {\n x = parseInt(operation_ArrStr[1]);\n }\n else if(register_MapStrInt.has(operation_ArrStr[1]))\n {\n x = register_MapStrInt.get(operation_ArrStr[1]);\n }\n if(x <= 0)\n {\n nextOperationIndex_Int++;\n break;\n }\n if(!isNaN(parseInt(operation_ArrStr[2])))\n {\n nextOperationIndex_Int += parseInt(operation_ArrStr[2]);\n }\n else if(register_MapStrInt.has(operation_ArrStr[2]))\n {\n nextOperationIndex_Int += register_MapStrInt.get(operation_ArrStr[2]);\n }\n break;\n }\n }\n}","static approxEqTrans(ta, tb) {\nvar aeq, i;\n//------–-----\naeq = (function() {\nvar j, results;\nresults = [];\nfor (i = j = 0; j < 3; i = ++j) {\nresults.push(this.approxEq(ta[i], tb[i]));\n}\nreturn results;\n}).call(this);\nreturn aeq[0] && aeq[1] && aeq[2];\n}","function add(a,b){return a+b;}","function add (a,b)\n{\n return a + b \n\n}","function sum(a, b) {\n\n}","function basicSum(x, y) {\n return x + y;\n}","function orderOfProcedence(expressionArray)\r\n {\r\n\r\n for (var i = 0, d; d = expressionArray[i]; i++)\r\n {\r\n if (d == '^')\r\n {\r\n var elementPosition = expressionArray.indexOf('^'); // creates the element's current position of the array\r\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\r\n calculationByOperation(sign, elementPosition); // calling the function to resolve the sub expression found\r\n i = 0; // resets the counter to begin from the start of the expression\r\n }\r\n }\r\n\r\n // Checking and calculating division and multiplication from left to right\r\n for (var i = 0, d; d = expressionArray[i]; i++)\r\n {\r\n if (d == '/')\r\n {\r\n var elementPosition = expressionArray.indexOf('/'); // creates the element's current position of the array\r\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\r\n calculationByOperation(sign, elementPosition); // calling the third function to resolve the sub expression found\r\n\r\n if (divisionByZero == 1) // if division by zero is detected the program breaks out of the function\r\n {\r\n return false;\r\n }\r\n else {\r\n i = 0; // resets the counter to begin from the start of the array\r\n }\r\n\r\n }\r\n else if (d == '*')\r\n {\r\n var elementPosition = expressionArray.indexOf('*'); // creates the element's current position of the array\r\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\r\n calculationByOperation(sign, elementPosition); // calling the third function to resolve the sub expression found\r\n i = 0; // resets the counter to begin from the start of the array\r\n }\r\n }\r\n\r\n // Checking and calculating addition and subtraction from left to right\r\n for (var i = 0, d; d = expressionArray[i]; i++)\r\n {\r\n if (d == '+')\r\n {\r\n var elementPosition = expressionArray.indexOf('+'); // creates the element's current position of the array\r\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\r\n calculationByOperation(sign, elementPosition); // calling the function to resolve the sub expression found\r\n i = 0; // resets the counter to begin from the start of the expression\r\n }\r\n if (d == '-')\r\n {\r\n var elementPosition = expressionArray.indexOf('-'); // creates the element's current position of the array\r\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\r\n calculationByOperation(sign, elementPosition); // calling the function to resolve the sub expression found\r\n i = 0; // resets the counter to begin from the start of the expression\r\n }\r\n }\r\n\r\n }","function a(num1, num2) { // & as a matter of fact\n // these function also have no side effects\n // they are not touching any of the outside world\n // they are only touching their own parameters\n // & parameterrs if you rememeber they are local variables\n return num1 + num2\n}","function AMultipleCombinatorial(pEn,pKays) {\nthis.en = pEn\nif (typeof pKays === 'number')\n{pKays=[pKays];}\nvar sumOfVals = pKays.reduce(function(total,val){return total+=val});\nif (sumOfValsval)?total:val});\nif (this.maxKay==1)\n{\nthis.prod=(Array.apply(null,new Array(pEn)).map(Function.call, Number).map(function(it){return it+1})).reduce(function(prd,val){return prd*=val;},1)\n}\nelse{\nthis.functionToMakeList= function(disKay,aKay){return Array.apply(null,new Array(disKay)).map(Function.call, Number).map(function(it){return it+aKay+1})}\nthis.functionToReverseLists = function(disArray){return disArray.map(function(val,ind){return disArray[disArray.length-ind-1]})}\n//Take it out of set\npKays.splice(pKays.indexOf(this.maxKay),1);\n//make a list of the number size that is just for the reminant of the top with the bottom crossed out.\n//array apply null ducks giving apply context, which is the point of the arguments in call, apply, and bind\n//so it just runs the new array constructor for the number, which makes an array which has indexes for three undefined slots\n//map (function.call), uses function call as a callback, which calls the call back in the context of the Number function\n//now map takes val, ind, array which are what number.call gets, so this is a fancy way to pass (val, ind, array) as the parameters\n// of any function. Remember first argument of number.call is context, which is val in this case, which is undefined, which gets thrown out\n//the next is taken as the one parameter of the Number method, which is the index.\n//you are using call call game to create a circumstance to through out maps first value\n//so we make a list just as long as maxKay which takes the numbers from max to kay and boosts them all up so the last one is em\nvar newList = this.functionToMakeList(pEn-this.maxKay,this.maxKay);\n//reverse the list\nthis.revList=this.functionToReverseLists(newList);\n//make the other denominator number, that was not cancelled\nthis.botLists=pKays.map(function(val){return this.functionToMakeList(val,0);},this);\n//reverse these list\nthis.revBots=this.botLists.map(function(dArray){return this.functionToReverseLists(dArray)},this);\n// Logger.log(\"maxKey: \"+this.maxKay+\" PK: \"+pKays+\" newList: \"+newList+\" rb: \"+this.revBots+\" TL: \"+this.tallyListOfLists+\" RL: \"+this.revList)\n//go through the toplist\n//go through the bot list\n//alter top and bottom\n//kill record when one is done \n \n this.tallyListOfLists = infiniteArrayClone(this.revBots)\n var revBotLengths= this.revBots.map(function(val){return val.length});\n revBotLengths.sort(function(a, b){return a - b});\n// var poses = []\n// for (var cA=revBotLengths.length-1;cA>-1;cA--)\n// {\n// var cB= this.revBots.length-1;\n// while (this.revBots[cB].length!=revBotLengths[cA])\n// {\n// cB--;\n// }\n// poses.push(this.revBots.length-cB-1);\n// }\n// this.tallyListOfLists = [];\n// poses.forEach(function(val){this.tallyListOfLists.push(this.revBots[val])},this)\n// this.revBots = infiniteArrayClone(this.tallyListOfLists);\n\n \nfor (var cA=0;cA0)&&(cC0)&&(cB0)});\n this.revBotProd=1\n//do the multiplication of the remnant\n this.revBots.forEach(function(val){val.forEach(function(item){this.revBotProd=this.revBotProd*item})});\n//SpreadsheetApp.getUi().alert(newList)\nthis.prod=1/this.revBotProd\nthis.revList.forEach(function(item){this.prod=this.prod*item},this) ;\n//this.revList.forEach(function(item){this.sum+=item},this);\n}\n}","function c(e,n,r,i){function o(e,t){return 1-3*t+3*e}function s(e,t){return 3*t-6*e}function a(e){return 3*e}function l(e,t,n){return((o(t,n)*e+s(t,n))*e+a(t))*e}function u(e,t,n){return 3*o(t,n)*e*e+2*s(t,n)*e+a(t)}function c(t,n){for(var i=0;i0?i=s:n=s}while(Math.abs(o)>v&&++a=g?c(t,a):0===l?a:p(t,n,n+x)}function h(){T=!0,e===n&&r===i||f()}var m=4,g=.001,v=1e-7,y=10,b=11,x=1/(b-1),w=\"Float32Array\"in t;if(4!==arguments.length)return!1;for(var S=0;S<4;++S)if(\"number\"!=typeof arguments[S]||isNaN(arguments[S])||!isFinite(arguments[S]))return!1;e=Math.min(e,1),r=Math.min(r,1),e=Math.max(e,0),r=Math.max(r,0);var C=w?new Float32Array(b):new Array(b),T=!1,E=function(t){return T||h(),e===n&&r===i?t:0===t?0:1===t?1:l(d(t),n,i)};E.getControlPoints=function(){return[{x:e,y:n},{x:r,y:i}]};var k=\"generateBezier(\"+[e,n,r,i]+\")\";return E.toString=function(){return k},E}","function l(e,n,o,r){function i(e,t){return 1-3*t+3*e}function a(e,t){return 3*t-6*e}function s(e){return 3*e}function l(e,t,n){return((i(t,n)*e+a(t,n))*e+s(t))*e}function u(e,t,n){return 3*i(t,n)*e*e+2*a(t,n)*e+s(t)}function c(t,n){for(var r=0;r0?r=a:n=a}while(Math.abs(i)>g&&++s=y?c(t,s):0==l?s:d(t,n,n+b)}function m(){S=!0,e==n&&o==r||f()}var h=4,y=.001,g=1e-7,v=10,w=11,b=1/(w-1),_=\"Float32Array\"in t;if(4!==arguments.length)return!1;for(var x=0;x<4;++x)if(\"number\"!=typeof arguments[x]||isNaN(arguments[x])||!isFinite(arguments[x]))return!1;e=Math.min(e,1),o=Math.min(o,1),e=Math.max(e,0),o=Math.max(o,0);var C=_?new Float32Array(w):new Array(w),S=!1,T=function(t){return S||m(),e===n&&o===r?t:0===t?0:1===t?1:l(p(t),n,r)};T.getControlPoints=function(){return[{x:e,y:n},{x:o,y:r}]};var k=\"generateBezier(\"+[e,n,o,r]+\")\";return T.toString=function(){return k},T}","function izzqz( a , b , x , y , z )\n {\n\n const c_0 = 1e-6 ;\n \n var r = new Array( 5 ) ;\n var rr = new Array( 1 ) ;\n \n var xi = undefined ;\n var yi = undefined ;\n var ii = undefined ;\n \n var ri = undefined ;\n \n var izz = 0.0 ;\n var izzqz = 0.0 ;\n\n rr[0] = r ;\n\n if( z < c_0 ) z = c_0 ;\n \n for( i = 0; i < 4; ++i )\n { \n \n switch( i )\n {\n \n case 0:\n xi = ( (- a) / 2 ) ;\n yi = ( (- b) / 2 ) ;\n ii = ( 1 / (2 * Math.PI) ) ;\n break;\n \n case 1:\n xi = ( (- a) / 2 ) ;\n yi = ( ( b) / 2 ) ;\n ii = (- 1 / (2 * Math.PI) ) ;\n break;\n \n case 2:\n xi = ( ( a) / 2 ) ;\n yi = ( ( b) / 2 ) ;\n ii = ( 1 / (2 * Math.PI) ) ;\n break;\n\n case 3:\n xi = ( ( a) / 2 ) ;\n yi = ( (- b) / 2 ) ;\n ii = (- 1 / (2 * Math.PI) ) ;\n \n }; // end switch()\n \n ri = Math.sqrt( ((x + xi) * (x + xi)) + ((y + yi) * (y + yi)) + (z * z) ) ;\n izz = ( 1 / (((x + xi) * (x + xi)) + (z * z)) ) ;\n izz += ( 1 / (((y + yi) * (y + yi)) + (z * z)) ) ;\n izz *= ( ((x + xi) * (y + yi) * z) / ri ) ;\n izz += Math.atan2( ((x + xi) * (y + yi)) , (z * ri) ) ;\n \n r[i] = ( ii * izz ) ;\n\n izzqz += ( ii * izz ) ;\n \n }; // end for()\n\n r[4] = izzqz ;\n\n return( rr ) ;\n \n }","pow22523(z) {\r\n const t0 = new FieldElement();\r\n const t1 = new FieldElement();\r\n const t2 = new FieldElement();\r\n let i;\r\n t0.square(z);\r\n // for (i = 1; i < 1; i++) {\r\n // t0.square(t0);\r\n // }\r\n t1.square(t0);\r\n for (i = 1; i < 2; i++) {\r\n t1.square(t1);\r\n }\r\n t1.mul(z, t1);\r\n t0.mul(t0, t1);\r\n t0.square(t0);\r\n // for (i = 1; i < 1; i++) {\r\n // t0.square(t0);\r\n // }\r\n t0.mul(t1, t0);\r\n t1.square(t0);\r\n for (i = 1; i < 5; i++) {\r\n t1.square(t1);\r\n }\r\n t0.mul(t1, t0);\r\n t1.square(t0);\r\n for (i = 1; i < 10; i++) {\r\n t1.square(t1);\r\n }\r\n t1.mul(t1, t0);\r\n t2.square(t1);\r\n for (i = 1; i < 20; i++) {\r\n t2.square(t2);\r\n }\r\n t1.mul(t2, t1);\r\n t1.square(t1);\r\n for (i = 1; i < 10; i++) {\r\n t1.square(t1);\r\n }\r\n t0.mul(t1, t0);\r\n t1.square(t0);\r\n for (i = 1; i < 50; i++) {\r\n t1.square(t1);\r\n }\r\n t1.mul(t1, t0);\r\n t2.square(t1);\r\n for (i = 1; i < 100; i++) {\r\n t2.square(t2);\r\n }\r\n t1.mul(t2, t1);\r\n t1.square(t1);\r\n for (i = 1; i < 50; i++) {\r\n t1.square(t1);\r\n }\r\n t0.mul(t1, t0);\r\n t0.square(t0);\r\n for (i = 1; i < 2; i++) {\r\n t0.square(t0);\r\n }\r\n this.mul(t0, z);\r\n }","function operate(a,operator,b){\n\tswitch(operator){\n\t\tcase '+':\n\t\t\treturn add(a,b);\n\t\t\tbreak;\n\t\tcase '-':\n\t\t\treturn substract(a,b);\n\t\t\tbreak;\n\t\tcase '*':\n\t\t\treturn multiply(a,b);\n\t\t\tbreak;\n\t\tcase '/':\n\t\t\treturn divide(a,b);\n\t\t\tbreak;\n\t\tcase '=':\n\t\t\treturn b;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tclearAll();\n\t\t\talert(\"Error: Invalid operator!\");\n\t\t\treturn 0;\n\t\t\tbreak;\n\t}\n}","function growFaster(intOps, boolOps, numberPrograms, booleanPrograms, inputoutputs){\r\n\r\n var levelNum = [];\r\n var levelBool = [];\r\n for(var i = 0; i < inputoutputs.length; i++){ \r\n //making the new enviroment for the i-th insatanc\r\n var envt = {};\r\n for(var key in inputoutputs[i]) {\r\n if(key != \"_out\"){\r\n envt[key] = inputoutputs[i][key];\r\n } \r\n }\r\n\r\n\r\n for(var i = 0; i < boolOps.length; i++){ \r\n for( var j = 0; j < numberPrograms.length; j++){\r\n for( var k = 0; k < numberPrograms.length; k++){\r\n var var1 = interpret(numberPrograms[j], envt);\r\n var var2 = interpret(numberPrograms[k], envt);\r\n if(boolOps[i] == LT){\r\n levelBool.push(lt(numberPrograms[j], numberPrograms[k]));\r\n }\r\n } \r\n }\r\n for( var j = 0; j < booleanPrograms.length; j++){\r\n for( var k = 0; k < booleanPrograms.length; k++){\r\n var var1 = interpret(booleanPrograms[j], envt);\r\n var var2 = interpret(booleanPrograms[k], envt);\r\n if(boolOps[i] == AND){\r\n if(var1 == false && var2 == false){\r\n levelBool.push(and(flse(), flse()));\r\n }else if(var1 != false && var2 == false){\r\n levelBool.push(and(not(flse()), flse()));\r\n }else if(var1 == false && var2 != false){\r\n levelBool.push(and(flse(),not(flse())));\r\n }else if(var1 != false && var2 != false){\r\n levelBool.push(and(not(flse()), not(flse())));\r\n }\r\n }\r\n }\r\n if(boolOps[i] == NOT){\r\n if(var1 != false){\r\n levelBool.push(not(flse()));\r\n }else{ \r\n levelBool.push(flse());\r\n }\r\n }\r\n }\r\n }\r\n\r\n for(var i = 0; i < intOps.length; i++){\r\n if(intOps[i] == ITE){\r\n for( var j = 0; j < booleanPrograms.length; j++){\r\n for( var k = 0; k < numberPrograms.length; k++){ \r\n for( var l = 0; l < numberPrograms.length; l++){\r\n var var1 = interpret(booleanPrograms[j], envt);\r\n if(var1 == false){\r\n levelNum.push(ite(flse(), numberPrograms[k], numberPrograms[j]));\r\n } else{\r\n levelNum.push(ite(not(flse()), numberPrograms[k], numberPrograms[j]));\r\n }\r\n }\r\n }\r\n }\r\n } \r\n\r\n for( var k = 0; k < numberPrograms.length; k++){ \r\n for( var l = 0; l < numberPrograms.length; l++){\r\n if(intOps[i] == PLUS){\r\n levelNum.push(plus(numberPrograms[k], numberPrograms[l]));\r\n } else if(intOps[i] == TIMES){\r\n levelNum.push(times(numberPrograms[k], numberPrograms[l]));\r\n }\r\n\r\n }\r\n }\r\n } \r\n \r\n } \r\n return {\"nums\":levelNum, \"bools\": levelBool};\r\n}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}","function o0(e,o1,buffer) {\n try {\n\"use asm\";\n}catch(e){}\n function o7(o2,o3) {\n try {\nset.o27 = +o2;\n}catch(e){}\n try {\no384 = +o28;\n}catch(e){}\n try {\nreturn o1083 = o1062;\n}catch(e){}\n }\n \n function o4(o2,o3){\n try {\no4212]o4.o6(function() { try {\nObject.defineProperty(o3, key, { value: 'something', enumerable: true });\n}catch(e){} }, \"Object.defineProperty uses ToPropertyKey. Property is added to the object\")] = 2;\n}catch(e){}\n try {\no39.o38(o34);\n}catch(e){}\n var o673 = o215(1, \"i32*\", o212);\n var o1103 = 0;\n try {\no5 = +o7[this.o565[o810]](o2,o3);\n}catch(e){}\n try {\nreturn +o5;\n}catch(e){}\n }\n \n var o7 = [add,add,add,add];\n \n \n try {\nreturn o4.o10;\n}catch(e){}\n}","function operate(num1, num2, operator){\n if(operator === '+') return add(num1, num2)\n if(operator === '-') return subtract(num1, num2)\n if(operator === '*') return multiply(num1, num2)\n if(operator === '/') return divide(num1, num2)\n}","function operations(typeOperator) {\n\t\n\tif(typeOperator=='comma' && v!='v'){\n\t\tresText=resText+\".\";\n\t\tv='v';\n\t\tdv=1;\n\t\tanimateButtons('comma');\n\t}else if(typeOperator!='comma'){\n\t\tv='f';\n\t}\n\n\tif(typeOperator==\"sum\"){\n\t\tresText=resText+\"+\";\n\t\tanimateButtons('sum');\t \n\t}else if(typeOperator==\"minus\"){\n\t\tresText=resText+\"-\";\n\t\tanimateButtons('minus');\n\n\n\t}else if(typeOperator==\"times\"){\n\t\tresText=\"ans\"+\"×\";\n\t\tanimateButtons('times');\n\n\n\t}else if(typeOperator==\"divided\"){\n\t\tresText=\"ans\"+\"÷\";\n\t\tanimateButtons('divided');\n\n\t}\n\n\n\tif(typeOperator!='comma'){\n\n\t\tif(prevTypeOperator=='sum'){\n\t\t\tresNum=numberInstMemo+resNum;\n\t\t\tnumberInstMemo=0;\n\n\t\t}else if(prevTypeOperator=='minus'){\n\t\t\tresNum=resNum-numberInstMemo;\n\t\t\tnumberInstMemo=0;\n\n\t\t}else if(prevTypeOperator=='times' && d!=0){\n\t\t\tresNum=resNum*numberInstMemo;\n\t\t\tnumberInstMemo=0; \n\n\t\t}else if(prevTypeOperator=='divided' && d!=0){\n\t\t\tresNum=resNum/numberInstMemo;\n\t\t\tnumberInstMemo=0; \n\n\t\t}\n\n\t\tprevTypeOperator=typeOperator;\n\t\t\n\t}\n\t\n\t\n\tif(typeOperator=='equal'){\n\n\t\tresText='ans';\n\t\tanimateButtons('equal');\n\t\t\n\t}\n\n\tdocument.getElementById(\"resText\").innerHTML = resText;\n\tdocument.getElementById(\"resNum\").innerHTML = resNum;\n\t\n\td=0;\n\n\n}","function o0(stdlib,o1,buffer) {\n try {\no8[4294967294];\n}catch(e){}\n function o104(o49, o50, o73) {\n try {\no95(o49, o50, o73, this);\n}catch(e){}\n\n try {\no489.o767++;\n}catch(e){}\n\n try {\nif (o97 === o49) {\n try {\nreturn true;\n}catch(e){}\n }\n}catch(e){}\n\n try {\nreturn false;\n}catch(e){}\n };\n //views\n var o3 =this;\n\n function o4(){\n var o30\n var o6 = o2(1.5);\n try {\no3[1] = o6;\n}catch(e){}\n try {\nreturn +(o3[1])\n}catch(e){}\n }\n try {\nreturn o4;\n}catch(e){}\n}","_coreSHA1(_x, _len) {\n\n _x[_len >> 5] |= 0x80 << (24 - _len % 32);\n _x[((_len + 64 >> 9) << 4) + 15] = _len;\n\n const _this = this;\n let _a = 1732584193;\n let _b = -271733879;\n let _c = -1732584194;\n let _d = 271733878;\n let _e = -1009589776;\n const _w = new Array(80);\n let i;\n let _olda;\n let _oldb;\n let _oldc;\n let _oldd;\n let _olde;\n let j;\n let _t;\n\n for (i = 0; i < _x.length; i += 16) {\n _olda = _a;\n _oldb = _b;\n _oldc = _c;\n _oldd = _d;\n _olde = _e;\n\n for (j = 0; j < 80; j++) {\n if (j < 16) {\n _w[j] = _x[i + j];\n }\n else {\n _w[j] = _this._rol(_w[j-3] ^ _w[j-8] ^ _w[j-14] ^ _w[j-16], 1);\n }\n _t = _this._safeAdd(_this._safeAdd(_this._rol(_a, 5), _this._sha1FT(j, _b, _c, _d)),\n _this._safeAdd(_this._safeAdd(_e, _w[j]), _this._sha1KT(j)));\n _e = _d;\n _d = _c;\n _c = _this._rol(_b, 30);\n _b = _a;\n _a = _t;\n }\n\n _a = _this._safeAdd(_a, _olda);\n _b = _this._safeAdd(_b, _oldb);\n _c = _this._safeAdd(_c, _oldc);\n _d = _this._safeAdd(_d, _oldd);\n _e = _this._safeAdd(_e, _olde);\n }\n return [_a, _b, _c, _d, _e];\n }","function tester() {\n document.getElementById(\"output\").innerHTML += firstLast6([1,2,3,4,5,6]);\n document.getElementById(\"output\").innerHTML += has23([2,3]);\n document.getElementById(\"output\").innerHTML += fix_23([1,2,3]);\n document.getElementById(\"output\").innerHTML += countYZ(\"fez day\");\n document.getElementById(\"output\").innerHTML += endOther(\"Hiabc\", \"abc\");\n document.getElementById(\"output\").innerHTML += starOut(\"ab***cd\");\n document.getElementById(\"output\").innerHTML += getSandwich(\"breadinkbread\");\n document.getElementById(\"output\").innerHTML += canBalance([1,1,1,2,1]);\n document.getElementById(\"output\").innerHTML += countClumps([2,2,2,3,3]);\n document.getElementById(\"output\").innerHTML += evenlySpaced(1,3,2);\n //test third method, etc\n}","function calculate(number1, number2, operator) {\n if (operator === 'add') {\n return suma();\n } else if (operator === 'multiply') {\n return inmultire();\n } else if (operator === 'substract') {\n return scadere();\n } else if (operator === 'divide') {\n return impartire();\n }\n\n function suma() {\n return (number1 + number2);\n }\n function impartire() {\n return (number1 / number2);\n }\n function inmultire() {\n return (number1 * number2);\n }\n function scadere() {\n return (number1 - number2);\n }\n}","function addition(a, b) {\r\n return a + b;\r\n}","function addition(a, b) {\r\n\treturn a + b;\r\n}","function reduceOperators(iObj_ops){ \n\tvar iObj_ops_red = iObj_ops.slice();\n\tvar selected_op;\n\tvar opsStr = '';\n\tfor (var n in iObj_ops) {\n\t\topsStr += iObj_ops[n].val;\n\t}\n\tconsole.log('reduceOperators - opsStr 1: ' + opsStr + ', iObj_ops: ' + JSON.stringify(iObj_ops));\n\n\t// If '+' OR '-' operator are present: -----> delete all '*' and '/' operators\n\t// ===================================\n\tif ((opsStr.indexOf('+')!==-1) || (opsStr.indexOf('-')!==-1)){\n\t\tfor (var i = iObj_ops.length - 1; i >= 0; i--) { \n\t\t\tif ('*/'.indexOf(iObj_ops[i].val)!==-1) {\n\t\t\t\tiObj_ops_red.splice(i, 1);\n\t\t\t}\n\t\t}\n\t\topsStr = opsStr.replace(/(\\*|\\/)/g, '');\n\t\tconsole.log('reduceOperators - opsStr 2: ' + opsStr + ', iObj_ops_red: ' + JSON.stringify(iObj_ops_red));\n\n\t\t////////////////////////////////////////////////////////////////////////////////////////////////\n\t\t//\n\t\t//\tDecide HERE, based on the position of fObj.taget, which operator ('+' or '-') to choose\". NO: just choose the last operator to keep it simple!\n\t\t//\n\t\t////////////////////////////////////////////////////////////////////////////////////////////////\n\n\t\t// At this point there will only be '+'- OR '-'-operators left - choose the last operator:\n\t\tselected_op = iObj_ops_red[iObj_ops_red.length-1];\n\t\tconsole.log('reduceOperators - selected_op: ' + JSON.stringify(selected_op));\n\n\t}\n\n\t// If '*' AND '/' operator are present: -----> delete all '*' operators, and choose the last '/' operator\n\t// ====================================\n\tif ((opsStr.indexOf('*')!==-1) && (opsStr.indexOf('/')!==-1)){\n\t\tfor (var i = iObj_ops.length - 1; i >= 0; i--) { \n\t\t\tif ('*'.indexOf(iObj_ops[i].val)!==-1) {\n\t\t\t\tiObj_ops_red.splice(i, 1);\n\t\t\t}\n\t\t}\n\t\topsStr = opsStr.replace(/\\*/g, '');\n\t\tconsole.log('reduceOperators - opsStr 2: ' + opsStr + ', iObj_ops_red: ' + JSON.stringify(iObj_ops_red));\n\n\t\t// // At this point there will only be '/'-operators left - choose the last '/'-operator:\n\t\t// selected_op = iObj_ops_red[iObj_ops_red.length-1];\n\t\t// console.log('reduceOperators - selected_op: ' + JSON.stringify(selected_op));\n\t}\n\n\t// If '*' OR '/' operators are present: -----> Select the last operator\n\t// ====================================\n\tif ((opsStr.indexOf('*')!==-1) || (opsStr.indexOf('/')!==-1)){\n\t\t\n\t\t// At this point there will only be '/'- OR '*'-operators left - choose the last operator:\n\t\tselected_op = iObj_ops_red[iObj_ops_red.length-1];\n\t\tconsole.log('reduceOperators - selected_op: ' + JSON.stringify(selected_op));\n\t}\n\n\n\treturn selected_op;\n}","function test_operators() {\n var Vec2;\n\n function mul_scalar(p1, a) {\n var r = new Vec2();\n r.x = p1.x * a;\n r.y = p1.y * a;\n return r;\n }\n\n var vec2_ops = Operators(\n {\n '+'(p1, p2) {\n var r = new Vec2();\n r.x = p1.x + p2.x;\n r.y = p1.y + p2.y;\n return r;\n },\n '-'(p1, p2) {\n var r = new Vec2();\n r.x = p1.x - p2.x;\n r.y = p1.y - p2.y;\n return r;\n },\n '=='(a, b) {\n return a.x == b.x && a.y == b.y;\n },\n '<'(a, b) {\n var r;\n /* lexicographic order */\n if(a.x == b.x) r = a.y < b.y;\n else r = a.x < b.x;\n return r;\n },\n '++'(a) {\n var r = new Vec2();\n r.x = a.x + 1;\n r.y = a.y + 1;\n return r;\n },\n '--'(a) {\n var r = new Vec2();\n r.x = a.x - 1;\n r.y = a.y - 1;\n return r;\n },\n '^'(p1, p2) {\n var r = Math.sqrt((p1.x - p2.x) ** 2 + (p1.y - p2.y) ** 2);\n return r;\n }\n },\n {\n left: Number,\n '*'(a, b) {\n return mul_scalar(b, a);\n }\n },\n {\n right: Number,\n '*'(a, b) {\n return mul_scalar(a, b);\n }\n }\n );\n\n Vec2 = class Vec2 extends vec2_ops {\n constructor(x, y) {\n super();\n this.x = x;\n this.y = y;\n }\n toString() {\n return 'Vec2(' + this.x + ',' + this.y + ')';\n }\n };\n\n var a = new Vec2(10, 5);\n var b = new Vec2(110, 105);\n var r;\n\n console.log(`a = `, a);\n console.log(`b = `, b);\n console.log(`a * 2 + 3 * b = `, (r = a * 2 + 3 * b));\n console.log(`b - a = `, b - a);\n console.log(`b ^ a = `, b ^ a);\n a++;\n r = ++a;\n}","function reduceTargetSide(termArr, iObj_ops, inverseOperator, reducingTerm){\n\tvar inversOpsLookup = {'/':'*', '*':'/', '+':'-', '-':'+'};\t\n\n\tconsole.log('reduceTargetSide - termArr 1: ' + JSON.stringify(termArr) + ', iObj_ops 1: ' + JSON.stringify(iObj_ops) + ', inverseOperator 1: ' + inverseOperator + ', reducingTerm 1: ' + reducingTerm);\n\n\tvar len = termArr.length;\n\tfor (var n in termArr){\n\t\tif (termArr[n] == reducingTerm) {\n\t\t\tconsole.log('reduceTargetSide - A0 - n: ' + n);\n\n\t\t\tif (inverseOperator == '-') {\n\t\t\t\tconsole.log('reduceTargetSide - A1 - n: ' + n);\n\n\t\t\t\tif ((n == 0) && (iObj_ops[n].val == '-')) { // CASE: a-x-a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A2 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t}\n\n\t\t\t\tif ((n == 0) && (iObj_ops[n].val == '+')) { // CASE: a+x-a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A3 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n, 1); // <---- IMPORTANT: remove the \"+\" operator \n\t\t\t\t}\n\n\t\t\t\tif ((n > 0) && (n < len-1) && ((iObj_ops[n-1].val == '+') || (iObj_ops[n-1].val == '-')) && ((iObj_ops[n].val == '+') || (iObj_ops[n].val == '-'))) { // CASE: c+a+x-a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A4 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n-1, 1);\n\t\t\t\t}\n\n\t\t\t\tif ((n == len-1) && (iObj_ops[n-1].val == '+')) { // CASE: x+a-a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A5 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n-1, 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (inverseOperator == '+') {\n\t\t\t\tconsole.log('reduceTargetSide - A6 - n: ' + n);\n\n\t\t\t\tif ((n == 0) && (iObj_ops[n].val == '-')) { // CASE: -a-x+a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A7 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t}\n\n\t\t\t\tif ((n == 0) && (iObj_ops[n].val == '+')) { // CASE: -a+x+a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A8 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n, 1); // <---- IMPORTANT: remove the \"+\" operator \n\t\t\t\t}\n\n\t\t\t\tif ((n > 0) && (n < len-1) && ((iObj_ops[n-1].val == '+') || (iObj_ops[n-1].val == '-')) && ((iObj_ops[n].val == '+') || (iObj_ops[n].val == '-'))) { // CASE: c-a+x+a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A9 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n-1, 1);\n\t\t\t\t}\n\n\t\t\t\tif ((n == len-1) && (iObj_ops[n-1].val == '-')) { // CASE: x-a+a = k-a\n\t\t\t\t\tconsole.log('reduceTargetSide - A10 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n-1, 1);\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\tif ((inverseOperator == '*') || (inverseOperator == '/')) {\n\t\t\t\tconsole.log('reduceTargetSide - A11 - n: ' + n);\n\n\t\t\t\tif (n == 0) { // CASE: a*x/a = k/a\n\t\t\t\t\tconsole.log('reduceTargetSide - A12 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n, 1);\n\t\t\t\t}\n\n\t\t\t\tif ((n > 0) && (n < len-1)) { // CASE: c*a*x/a = k/a\n\t\t\t\t\tconsole.log('reduceTargetSide - A13 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n-1, 1);\n\t\t\t\t}\n\n\t\t\t\tif (n == len-1) { // CASE: x*a/a = k/a\n\t\t\t\t\tconsole.log('reduceTargetSide - A14 - n: ' + n);\n\n\t\t\t\t\ttermArr.splice(n, 1);\n\t\t\t\t\tiObj_ops.splice(n-1, 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\n\tconsole.log('reduceTargetSide - termArr 2: ' + JSON.stringify(termArr) + ', iObj_ops 2: ' + JSON.stringify(iObj_ops) + ', inverseOperator 2: ' + inverseOperator + ', reducingTerm 2: ' + reducingTerm);\n\n\tvar reducedEquationSide = '';\n\tif (termArr.length == iObj_ops.length){\n\t\tfor (var n in termArr) {\n\t\t\treducedEquationSide += iObj_ops[n].val+termArr[n];\n\t\t}\n\t}\n\n\tif (termArr.length == iObj_ops.length + 1){\n\t\tfor (var n in termArr) {\n\t\t\tconsole.log('reduceTargetSide - n: ' + n + ', iObj_ops.length: ' + iObj_ops.length );\n\t\t\treducedEquationSide += termArr[n]+((typeof(iObj_ops[n])!=='undefined')? iObj_ops[n].val : '');\n\t\t}\n\t}\n\n\tconsole.log('reduceTargetSide - reducedEquationSide: ' + reducedEquationSide);\n\n\treturn reducedEquationSide;\n}","function l(e,i,n,r){function o(e,t){return 1-3*t+3*e}function a(e,t){return 3*t-6*e}function s(e){return 3*e}function l(e,t,i){return((o(t,i)*e+a(t,i))*e+s(t))*e}function c(e,t,i){return 3*o(t,i)*e*e+2*a(t,i)*e+s(t)}function u(t,i){for(var r=0;f>r;++r){var o=c(i,e,n);if(0===o)return i;var a=l(i,e,n)-t;i-=a/o}return i}function d(){for(var t=0;C>t;++t)A[t]=l(t*w,e,n)}function h(t,i,r){var o,a,s=0;do a=i+(r-i)/2,o=l(a,e,n)-t,o>0?r=a:i=a;while(Math.abs(o)>v&&++s=m?u(t,s):0==l?s:h(t,i,i+w)}function p(){S=!0,(e!=i||n!=r)&&d()}var f=4,m=.001,v=1e-7,b=10,C=11,w=1/(C-1),y=\"Float32Array\"in t;if(4!==arguments.length)return!1;for(var x=0;4>x;++x)if(\"number\"!=typeof arguments[x]||isNaN(arguments[x])||!isFinite(arguments[x]))return!1;e=Math.min(e,1),n=Math.min(n,1),e=Math.max(e,0),n=Math.max(n,0);var A=y?new Float32Array(C):new Array(C),S=!1,E=function(t){return S||p(),e===i&&n===r?t:0===t?0:1===t?1:l(g(t),i,r)};E.getControlPoints=function(){return[{x:e,y:i},{x:n,y:r}]};var _=\"generateBezier(\"+[e,i,n,r]+\")\";return E.toString=function(){return _},E}","function operate(x, y, operator) {\n switch (operator) {\n case 'add':\n return add(x, y);\n\n case 'subtract':\n return subtract(x, y);\n\n case 'multiply':\n return multiply(x, y);\n \n case 'divide':\n return divide(x, y);\n\n default: \n alert('Use numbers and declare operator');\n };\n}","exec(op, { a, b, c }) {\n switch (op) {\n case Instr.Add:\n this.memory[c] = this.memory[a] + this.memory[b];\n this.ip += 4;\n return;\n case Instr.Mult:\n this.memory[c] = this.memory[a] * this.memory[b];\n this.ip += 4;\n return;\n case Instr.SaveInput:\n this.memory[a] = this.input.shift();\n this.ip += 2;\n return;\n case Instr.Output:\n this.ip += 2;\n return this.memory[a];\n case Instr.JumpIfTrue:\n this.ip = this.memory[a] !== 0 ? this.memory[b] : this.ip + 3;\n return;\n case Instr.JumpIfFalse:\n this.ip = this.memory[a] == 0 ? this.memory[b] : this.ip + 3;\n return;\n case Instr.LessThan:\n this.memory[c] = this.memory[a] < this.memory[b] ? 1 : 0;\n this.ip += 4;\n return;\n case Instr.Equals:\n this.memory[c] = this.memory[a] === this.memory[b] ? 1 : 0;\n this.ip += 4;\n return;\n }\n }","function sum4(x, y) {\r\n return x + y;\r\n }","function soustraction(a, b) { // Nommage de ma function\n console.log(a - b); // Ce que la function fait\n}","function main() {\n showResult(47);\n showResult(88);\n showResult(34);\n showResult(3);\n showResult(-2);\n showResult(105);\n}","function sum(a, b){return a+b;}","function calculate(){}","function evenOddSums() {}","function calcularOperacoes (operador1, operador2) {\n console.log(operador1+operador2, operador1- operador2, operador1 * operador2, operador1 / operador2)\n}","function o0(o1)\n{\n var o11 = function () {\n try {\nreturn (this.o4 - this.o5) + \" (overwritten)\";\n}catch(this.o665()){}\n};\n try {\nfor (var o2 = 0; __defineGetter__[o1091 >> [4.4, 5.5, 6.6]]; this.o391[0xFF68] = this.o902)\n {\n try {\nif (o6(o29) == \"this.lastOutput[\" + o214 + \"] = output\" + o214)\n {\n try {\nif (o259[10724 >> 2] = o1098 == -1)\n {\n try {\no2 = o3;\n}catch(e){}\n }\n}catch(e){}\n }\n else\n {\n try {\nif (o2 != -\"Array.prototype.copyWithin called on an object with length > 2^32 and a source range completely > 2^32 and destination range crossing 2^32\")\n {\n try {\no4.o5(o2 + \"-\" + (o3-'error!') + \" = undefined\");\n}catch(e){}\n try {\no421 = -1;\n}catch(e){}\n }\n}catch(e){}\n try {\no4.o5(o3 + \" = \" + o1[o3]);\n}catch(e){}\n }\n}catch(e){}\n }\n}catch(e){}\n}","function sum(a, b) {\n return a + b; // processamento\n}","reduce (){\n this.hunger -= 2\n this.energy -= 1\n this.hygiene -= 1\n this.fun -= 2\n }","function performCalculation(arr, symbol1 = '*',symbol2 = '/'){\n var found = false;\n var i = 0; \n\n while(found === false && i < arr.length - 1){ //using < than, since the last symbol will always be a number because of the validation perfomed in the method 'calculate'\n if(arr[i] === symbol1 || arr[i] === symbol2){\n found = true;\n\n arr[i] = window[operations[arr[i]]](arr[i-1], arr[i+1])\n arr.splice(i+1,1); arr.splice(i-1,1);\n\n //reccursive method to continue searching for and perform the same reccursive function only if array's length is more than 1\n if(arr.length <= 1){\n return arr; //the result\n } else {\n return performCalculation(arr,symbol1,symbol2)\n }\n } \n i++; \n }\n\n // this means that this round of the while loop did not find any * or / operations, time to move to + and -\n return performCalculation(arr,'+','-');\n\n}","function eGCD_(x,y,v,a,b) {\n var g=0;\n var k=Math.max(x.length,y.length);\n if (eg_u.length!=k) {\n eg_u=new Array(k);\n eg_A=new Array(k);\n eg_B=new Array(k);\n eg_C=new Array(k);\n eg_D=new Array(k);\n }\n while(!(x[0]&1) && !(y[0]&1)) { //while x and y both even\n halve_(x);\n halve_(y);\n g++;\n }\n copy_(eg_u,x);\n copy_(v,y);\n copyInt_(eg_A,1);\n copyInt_(eg_B,0);\n copyInt_(eg_C,0);\n copyInt_(eg_D,1);\n for (;;) {\n while(!(eg_u[0]&1)) { //while u is even\n halve_(eg_u);\n if (!(eg_A[0]&1) && !(eg_B[0]&1)) { //if A==B==0 mod 2\n halve_(eg_A);\n halve_(eg_B); \n } else {\n add_(eg_A,y); halve_(eg_A);\n sub_(eg_B,x); halve_(eg_B);\n }\n }\n\n while (!(v[0]&1)) { //while v is even\n halve_(v);\n if (!(eg_C[0]&1) && !(eg_D[0]&1)) { //if C==D==0 mod 2\n halve_(eg_C);\n halve_(eg_D); \n } else {\n add_(eg_C,y); halve_(eg_C);\n sub_(eg_D,x); halve_(eg_D);\n }\n }\n\n if (!greater(v,eg_u)) { //v<=u\n sub_(eg_u,v);\n sub_(eg_A,eg_C);\n sub_(eg_B,eg_D);\n } else { //v>u\n sub_(v,eg_u);\n sub_(eg_C,eg_A);\n sub_(eg_D,eg_B);\n }\n if (equalsInt(eg_u,0)) {\n while (negative(eg_C)) { //make sure a (C) is nonnegative\n add_(eg_C,y);\n sub_(eg_D,x);\n }\n multInt_(eg_D,-1); ///make sure b (D) is nonnegative\n copy_(a,eg_C);\n copy_(b,eg_D);\n leftShift_(v,g);\n return;\n }\n }\n }","function Addition(a, b) {\n return a + b;\n}","function order_of_operations(array) {\n var no_more_parentheses = false;\n var open_p_lastIndexOf = array.lastIndexOf(\"(\");\n if (open_p_lastIndexOf < 0) {\n open_p_lastIndexOf = 0;\n no_more_parentheses = true;\n }\n var close_p_indexOf = array.indexOf(\")\", open_p_lastIndexOf);\n if (close_p_indexOf < 0) {\n close_p_indexOf = 100000000;\n }\n var working_array = array.slice(open_p_lastIndexOf + 1, close_p_indexOf);\n if (working_array.length == 1) {\n console.log(\"before splice:\", equation_array)\n equation_array.splice(open_p_lastIndexOf, 1);\n equation_array.splice(open_p_lastIndexOf + 1, 1)\n open_p_lastIndexOf = 0;\n close_p_indexOf = 100000000;\n console.log(\"after splice:\", equation_array)\n }\n\n var percentage_indexOf = array.indexOf(\"%\", open_p_lastIndexOf);\n var exponent_indexOf = array.indexOf(\"^\", open_p_lastIndexOf);\n var mult_indexOf = array.indexOf(\"x\", open_p_lastIndexOf);\n var divid_indexOf = array.indexOf(\"/\", open_p_lastIndexOf);\n var add_indexOf = array.indexOf(\"+\", open_p_lastIndexOf);\n var sub_indexOf = array.indexOf(\"-\", open_p_lastIndexOf);\n var done = false;\n\n\n if (percentage_indexOf >= 0 && percentage_indexOf < close_p_indexOf) {\n ordered_index = percentage_indexOf;\n return;\n }\n else if (exponent_indexOf >= 0 && exponent_indexOf < close_p_indexOf) {\n ordered_index = exponent_indexOf;\n return;\n }\n else if (mult_indexOf >= 0 && mult_indexOf < close_p_indexOf) {\n ordered_index = mult_indexOf;\n return;\n }\n else if (divid_indexOf >= 0 && divid_indexOf < close_p_indexOf) {\n ordered_index = divid_indexOf;\n return;\n }\n else if (add_indexOf >= 0 && add_indexOf < close_p_indexOf) {\n ordered_index = add_indexOf;\n return;\n }\n else if (sub_indexOf >= 0 && sub_indexOf < close_p_indexOf) {\n ordered_index = sub_indexOf;\n return;\n }\n else {\n return done = true;\n }\n\n if (!done && no_more_parentheses) {\n return done = false;\n }\n\n}","function s_array_op(arr1, arr2, what_to_do, sort_function)\n{\n\t// http://stackoverflow.com/questions/10866756/fast-intersection-of-two-sorted-integer-arrays\n\t\n\tif (!isArray(arr1) || !isArray(arr2))\n\t\treturn [];\n\t// need at least one to be be longer than zero\n\tif (arr1.length == 0 && arr2.length == 0)\n\t\treturn [];\n\t\t\n\t// intersection check that both are longer than zero\n\tif (what_to_do == \"i\" && (arr1.length == 0 || arr2.length == 0))\n\t\treturn [];\n\t\t\n\t// counters\n\tvar i=0, j=0;\n\t// values\n\tvar a=0, b=0;\n\t\n\tvar out = [];\n\t\n\t// comparison function\n\tvar the_compare;\n\tif (typeof(sort_function) != \"function\")\n\t\tthe_compare = function(a1,b1) { return [a1,b1].sort()[0] == a1 ? -1 : 1; };\n\telse\n\t\tthe_compare = sort_function;\n\t// push functions\n\tvar eq_push;\n\tvar lt_push;\n\tvar gte_push;\n\t\n\tswitch(what_to_do)\n\t{\n\t\tcase \"i\":\n\t\t\teq_push = function(in1) { return out.push(in1); };\n\t\t\tlt_push = function() { return; };\n\t\t\tgte_push = function() { return; };\n\t\tbreak;\n\t\tcase \"u\":\n\t\t\teq_push = function(in1) { return out.push(in1); };\n\t\t\tlt_push = function(in1) { return out.push(in1); };\n\t\t\tgte_push = function(in1) { return out.push(in1); };\n\t\tbreak;\n\t\tcase \"x\":\n\t\t\teq_push = function() { return; };\n\t\t\tlt_push = function(in1) { return out.push(in1); };\n\t\t\tgte_push = function(in1) { return out.push(in1); };\n\t\tbreak;\n\t\tdefault:\n\t\t\treturn [];\n\t}\n\t\n\t// the continues should speed up execution ...\n\twhile (i < arr1.length && j < arr2.length)\n\t{\n\t\ta = arr1[i];\n\t\tb = arr2[j];\n\t\t\n\t\tif (a === b)\n\t\t{\n\t\t\teq_push(a);\n\t\t\ti++;\n\t\t\tj++;\n\t\t\tcontinue;\n\t\t}\n\t\t// a < b\n\t\telse if (the_compare(a,b) == -1)\n\t\t{\n\t\t\tlt_push(a);\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tgte_push(b);\n\t\t\tj++;\n\t\t\tcontinue;\n\t\t}\n\t}\n\t\n\tif (what_to_do == \"u\" || what_to_do == \"x\")\n\t{\n\t\t// add any remainders\n\t\tfor (; ix);\\n if (tempArr.length>2){\\n let rslt = 'argtttt';\\n if (tempArr[1]==='+') {\\n rslt = add(tempArr[0],tempArr[2]);\\n }\\n else if (tempArr[1]==='-') {\\n rslt = substract(tempArr[0],tempArr[2]);\\n }\\n tempArr.splice(0,3,rslt);\\n return compute(tempArr);\\n }\\n else return tempArr[0];\\n}\",\n \"function alg1(){\\nalert(\\\"Sometimes we have to find the HCF and LCM of algebraic expressions.This depends on our ability to identify factors correctly\\\");\\nalert(\\\"For example lets find the HCF and LCM of a²b,a³b² and a²b³.Now a and b are the common factors in the three terms.Use a and b with the lowest powers for HCF and those with the highest powers for LCM.In this case HCF=a²b(pick out the lowest power of each common factor.LCM=a³b³(pick out the highest power of each factor.)\\\");\\nalert(\\\"Lets do more examples on HCF and LCM of algebraic expressions\\\");\\nalert(\\\"Find the HCF and LCM of 3x+3,2x+2,x²-1.First factorise the terms ie 3x+3=3(x+1),2x+2=2(x+1) and x²-1=(x-1)(x+1). Looking at the three terms (x+1) is common hence HCF=(x+1).Now for the LCM take each factor where its most abundant hence LCM=2×3(x-1)(x+1)**Note-no need to expand brackets.\\\");\\nalert(\\\"Find the HCF and LCM of x²-9,x²+6x+9 and 2x²+7x+3.First factorise the above quadratic expressions ie x²-9=(x+3)(x-3),x²+6x+9=(x+3)(x+3) and 2x²+7x+3=(2x+1)(x+3).Looking at the above terms (x+3) is common hence HCF=(x+3).For LCM take each factor where its most common hence LCM=(x+3)²(x-3)(2x+1).\\\");\\n}\",\n \"function ex_7_R(a, b){\\n s = 0; k = a;\\n for( i = 1; i 0) {\\n for (var i = 0; i < operArr.length; i++) {\\n if (operArr[i] == \\\"/\\\") {\\n tempAns = numArr[i] / numArr[i + 1];\\n numArr.splice(i,2, tempAns);\\n operArr.splice(i,1);\\n i--;\\n }\\n }\\n for (var i = 0; i < operArr.length; i++) {\\n if (operArr[i] == \\\"x\\\") {\\n tempAns = numArr[i] * numArr[i + 1];\\n numArr.splice(i,2, tempAns);\\n operArr.splice(i,1);\\n i--;\\n }\\n }\\n for (var i = 0; i < operArr.length; i++) {\\n if (operArr[i] == \\\"+\\\") {\\n tempAns = numArr[i] + numArr[i + 1];\\n numArr.splice(i,2, tempAns);\\n operArr.splice(i,1);\\n i--;\\n }\\n }\\n for (var i = 0; i < operArr.length; i++) {\\n if (operArr[i] == \\\"-\\\") {\\n tempAns = numArr[i] - numArr[i + 1];\\n numArr.splice(i,2, tempAns);\\n operArr.splice(i,1);\\n i--;\\n }\\n }\\n }\\n\\n numArr[0] = Math.round(100 * numArr[0]) / 100;\\n\\n return numArr[0];\\n\\n}\",\n \"function basicInstructionFormats(op) {//op = operation for explanple add,sub etc.\\n var switcher;//returns the type of instruction\\n if (op.equals(\\\"ADD\\\") || op.equals(\\\"SUB\\\") || op.equals(\\\"MULT\\\") || op.equals(\\\"DIV\\\") || op.equals(\\\"AND\\\")\\n || op.equals(\\\"OR\\\") || op.equals(\\\"XOR\\\") || op.equals(\\\"SLL\\\") || op.equals(\\\"SRL\\\") || op.equals(\\\"SLT\\\")\\n || op.equals(\\\"SLE\\\") || op.equals(\\\"SGT\\\") || op.equals(\\\"SGE\\\") || op.equals(\\\"SEQ\\\"))\\n return switcher = 0; // R-type instructions\\n else if (op.equals(\\\"ADDI\\\") || op.equals(\\\"ANDI\\\") || op.equals(\\\"ORI\\\") || op.equals(\\\"XORI\\\")\\n || op.equals(\\\"SUBI\\\") || op.equals(\\\"SLLI\\\") || op.equals(\\\"SRLI\\\"))\\n return switcher = 1; // I-type instructions\\n else if (op.equals(\\\"LW\\\") || op.equals(\\\"SW\\\"))\\n return switcher = 2; // load/store word instructions\\n else if (op.equals(\\\"BEQ\\\") || op.equals(\\\"BNE\\\"))\\n return switcher = 3; // branch instructions\\n else alert(\\\"INSTRUCTION NOT FOUND :(\\\")\\n }\",\n \"static approxEqRots(ra, rb) {\\nvar aeq, i;\\n//------–-----\\naeq = (function() {\\nvar j, results;\\nresults = [];\\nfor (i = j = 0; j < 4; i = ++j) {\\nresults.push(this.approxEq(ra[i], rb[i]));\\n}\\nreturn results;\\n}).call(this);\\nreturn aeq[0] && aeq[1] && aeq[2] && aeq[3];\\n}\",\n \"function calculate(input1,input2,inputN)\\r\\n{\\r\\n\\t\\r\\n\\treturn output;\\r\\n}\",\n \"function makeOpComposition () {\\n \\n var ops = []; \\n var domain = makeEmptyMap(); \\n var gen = 0; \\n \\n var func = function (s) {\\n return function (i) {\\n return evaluate(domain.has(i) ? (ops.length-1) - (gen-domain.get(i)) : -1, i)(i);\\n }\\n \\n // determine selection state of i but only access the elements \\n // of ops (staring from ind) that have i in their domain\\n function evaluate(ind, i) {\\n if (ind < 0) return s; // i defined in the base selection mapping s\\n else {\\n var op = ops[ind];\\n return op(function (j) { return evaluate(ind - op.domain.get(i), j)(i); });\\n // the call to evaluate is wrapped to a lambda to make the call lazy.\\n // op will only call the lambda if op.f.constant is false\\n }\\n }\\n }\\n \\n func.domain = domain;\\n \\n // member functions of func\\n func.push = function (op) {\\n ops.push(op);\\n ++gen\\n op.domain.forEach(function(_, i) {\\n op.domain.set(i, domain.has(i) ? gen - domain.get(i) : ops.length);\\n domain.set(i, gen); \\n });\\n }\\n func.pop = function () {\\n var n = ops.length;\\n var op = ops.pop();\\n --gen;\\n // domain updated for those elements that are in op.domain\\n op.domain.forEach(function (_, i) {\\n if (op.domain.get(i) >= n) domain.delete(i); // no op defines i\\n else domain.set(i, domain.get(i) - op.domain.get(i)); \\n });\\n return op;\\n }\\n func.top = function () { return ops[ops.length - 1]; }\\n func.top2 = function () { return ops[ops.length - 2]; }\\n func.shift = function (bmap) {\\n var op = ops.shift();\\n op.domain.forEach(function(_, i) {\\n if (domain.get(i) - gen === ops.length) { domain.delete(i); }\\n // if lastOp the only op that defines i, remove i from domain\\n });\\n return op;\\n }\\n func.size = function () { return ops.length; }\\n func.removeIndex = function (i) {\\n if (!domain.has(i)) return;\\n \\n // find the first op in ops that defines i\\n var j = (ops.length - 1) - (gen - domain.get(i));\\n \\n while (j >= 0) {\\n var d = ops[j].domain.get(i);\\n ops[j].domain.delete(i);\\n j -= d;\\n }\\n domain.delete(i);\\n }\\n \\n return func;\\n }\",\n \"function operate(nums) {\\n\\t\\tvar num1 = nums[0];\\n\\t\\tvar num2 = nums[1];\\n\\t\\tvar num3 = nums[2];\\n\\t\\tvar num4 = nums[3];\\n\\n\\t\\tfor(var i=0; i < op_keys.length; i++) {\\n\\t\\t\\tfor(var j=0; j < op_keys.length; j++) {\\n\\t\\t\\t\\tfor(var k=0; k < op_keys.length; k++) {\\n\\t\\t\\t\\t\\tvar operation = \\\"(\\\" + \\\"(\\\" + num1 + op_keys[i] + num2 + \\\")\\\" + op_keys[j] + num3 + \\\")\\\" + op_keys[k] + num4;\\n\\t\\t\\t\\t\\tvar result = OPS[op_keys[i]](num1, num2);\\n\\t\\t\\t\\t\\tvar result2 = OPS[op_keys[j]](result, num3);\\n\\t\\t\\t\\t\\tvar result3 = OPS[op_keys[k]](result2, num4);\\n\\t\\t\\t\\t\\tvar display = operation + \\\" = \\\" + result3;\\n\\n\\t\\t\\t\\t\\tif (result3 === 24) { \\n\\t\\t\\t\\t\\t\\t$listofsolutions.append(\\\"\\\" + display + \\\" \\\"); \\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}// k\\n\\t\\t\\t}// j\\n\\t\\t}// i\\n\\n\\t}// operate\",\n \"function a(num1, num2) { // we have this predictable functioin\\n // thats minimized the bugs in the code\\n return num1 + num2\\n}\",\n \"function extractNumOpt(){\\r\\nn=arrayNumberOpt.length;\\r\\n//\\r\\nvar num1=0;//declared here\\r\\nvar num2=0;//declared here to be 0 at first\\r\\n\\r\\n//\\r\\nfor(i=0;i= 3 && i%2 == 0){\\n if(!isNaN(parseInt(operation[i]))){\\n r = calculate(r, operation[i-1], parseInt(operation[i]))\\n }\\n }else if(i < 3){\\n if (!isNaN(parseInt(operation[i]))) {\\n num.push(parseInt(operation[i]))\\n }else{\\n operator.push(operation[i])\\n }\\n r = calculate(num[0], operator[0], num[1])\\n }\\n else{\\n \\n }\\n }\\n return r\\n}\",\n \"function operate(operator, x, y) {\\n if (operator === '+'){\\n return add(x,y);\\n }\\n else if (operator === '-') {\\n return subtract(x,y);\\n }\\n else if (operator === '*') {\\n return multiply(x,y);\\n }\\n else {\\n return divide(x,y);\\n }\\n}\",\n \"function calT(a, b, op) {\\n\\n var result;\\n \\n if (op == \\\"+\\\") {\\n \\n result = a + b;\\n \\n alert(result);\\n }\\n \\n else if (op == \\\"-\\\") {\\n \\n result = a - b;\\n \\n alert(result);\\n \\n }\\n \\n else if(op == \\\"*\\\") {\\n \\n result = a * b;\\n \\n alert(result);\\n }\\n \\n else if(op == \\\"/\\\"){\\n \\n result = a / b;\\n \\n alert(result);\\n }\\n \\n \\n }\",\n \"function calculate(x, op, y) {\\n switch (op){\\n case \\\"+\\\":\\n return add(x,y)\\n break \\n case \\\"-\\\":\\n return substract(x,y)\\n break\\n case \\\"*\\\":\\n return multiply(x,y)\\n break\\n case \\\"/\\\":\\n return divide(x,y)\\n break\\n default:\\n null\\n }\\n}\",\n \"static operation(a, b, data, n, f = \\\"0\\\") {\\n // Ensures that the current screen is NOT empty\\n if (curr_o != \\\"\\\") {\\n // Performs the operation through switch function\\n switch (data) {\\n case \\\"+\\\":\\n res = b + a;\\n check = 1;\\n break;\\n case \\\"x\\\":\\n res = b * a;\\n check = 1;\\n break;\\n case \\\"/\\\":\\n res = b / a;\\n check = 1;\\n break;\\n case \\\"-\\\":\\n res = b - a;\\n check = 1;\\n break;\\n case \\\"%\\\":\\n res = (b * a) / 100;\\n check = 1;\\n break;\\n case \\\"^\\\":\\n res = Math.pow(b, a);\\n check = 1;\\n }\\n }\\n // If this function was called from \\\"result\\\" target, display the final result on the current screen\\n if (f === \\\"1\\\") {\\n prev_o = res.toString();\\n curr_o = prev_o;\\n prev_o = \\\"\\\";\\n Calc.dispprev(prev_o);\\n Calc.dispcurr(curr_o);\\n }\\n // If not then retain the current result on the previous screen followed by any new operator\\n else {\\n // Ensures that some operation is performed successfully\\n if (check === 1) {\\n prev_o = res.toString();\\n check = 0;\\n }\\n // Calls this function to append the new operator on previous screen\\n Calc.appendp(n);\\n Calc.dispprev(prev_o);\\n // Makes the current screen empty\\n curr_o = \\\"\\\";\\n Calc.dispcurr(curr_o);\\n // Asigns the value of oppr to none\\n oppr = \\\"\\\";\\n }\\n return;\\n }\",\n \"function special_cases() {\\n //Inserts a zero into index 1 of equation array if the first input is an operation\\n if (is_operator(equation_array[0])) {\\n equation_array.unshift(\\\"0\\\");\\n }\\n ;\\n var store_i = [];\\n for (var i = 0; i < equation_array.length; i++) {\\n //Checks for a divid by zero case\\n if (equation_array[i] == \\\"/\\\" && equation_array[i + 1] == 0) {\\n display_val = \\\"Cannot Divid By Zero!\\\"\\n divid_by_zero = true;\\n }\\n //Checks for a percentage and inserts 100 to divid with\\n if (equation_array[i] == \\\"%\\\") {\\n equation_array.splice(i + 1, 0, \\\"100\\\");\\n }\\n\\n }\\n ;\\n\\n //Checks if an equation ends with an operation, if true duplicates last input\\n if (is_operator(equation_array[equation_array.length - 1])) {\\n equation_array.push(equation_array[equation_array.length - 2]);\\n }\\n ;\\n\\n\\n}\",\n \"function add4(a, b) {\\r\\n return (a + b);\\r\\n}\",\n \"function coreMD5(x) \\n{ \\n var a = 1732584193 \\n var b = -271733879 \\n var c = -1732584194 \\n var d = 271733878 \\n \\n for(var i = 0; i < x.length; i += 16) \\n { \\n var olda = a \\n var oldb = b \\n var oldc = c \\n var oldd = d \\n \\n a = ff(a, b, c, d, x[i+ 0], 7 , -680876936) \\n d = ff(d, a, b, c, x[i+ 1], 12, -389564586) \\n c = ff(c, d, a, b, x[i+ 2], 17, 606105819) \\n b = ff(b, c, d, a, x[i+ 3], 22, -1044525330) \\n a = ff(a, b, c, d, x[i+ 4], 7 , -176418897) \\n d = ff(d, a, b, c, x[i+ 5], 12, 1200080426) \\n c = ff(c, d, a, b, x[i+ 6], 17, -1473231341) \\n b = ff(b, c, d, a, x[i+ 7], 22, -45705983) \\n a = ff(a, b, c, d, x[i+ 8], 7 , 1770035416) \\n d = ff(d, a, b, c, x[i+ 9], 12, -1958414417) \\n c = ff(c, d, a, b, x[i+10], 17, -42063) \\n b = ff(b, c, d, a, x[i+11], 22, -1990404162) \\n a = ff(a, b, c, d, x[i+12], 7 , 1804603682) \\n d = ff(d, a, b, c, x[i+13], 12, -40341101) \\n c = ff(c, d, a, b, x[i+14], 17, -1502002290) \\n b = ff(b, c, d, a, x[i+15], 22, 1236535329) \\n \\n a = gg(a, b, c, d, x[i+ 1], 5 , -165796510) \\n d = gg(d, a, b, c, x[i+ 6], 9 , -1069501632) \\n c = gg(c, d, a, b, x[i+11], 14, 643717713) \\n b = gg(b, c, d, a, x[i+ 0], 20, -373897302) \\n a = gg(a, b, c, d, x[i+ 5], 5 , -701558691) \\n d = gg(d, a, b, c, x[i+10], 9 , 38016083) \\n c = gg(c, d, a, b, x[i+15], 14, -660478335) \\n b = gg(b, c, d, a, x[i+ 4], 20, -405537848) \\n a = gg(a, b, c, d, x[i+ 9], 5 , 568446438) \\n d = gg(d, a, b, c, x[i+14], 9 , -1019803690) \\n c = gg(c, d, a, b, x[i+ 3], 14, -187363961) \\n b = gg(b, c, d, a, x[i+ 8], 20, 1163531501) \\n a = gg(a, b, c, d, x[i+13], 5 , -1444681467) \\n d = gg(d, a, b, c, x[i+ 2], 9 , -51403784) \\n c = gg(c, d, a, b, x[i+ 7], 14, 1735328473) \\n b = gg(b, c, d, a, x[i+12], 20, -1926607734) \\n \\n a = hh(a, b, c, d, x[i+ 5], 4 , -378558) \\n d = hh(d, a, b, c, x[i+ 8], 11, -2022574463) \\n c = hh(c, d, a, b, x[i+11], 16, 1839030562) \\n b = hh(b, c, d, a, x[i+14], 23, -35309556) \\n a = hh(a, b, c, d, x[i+ 1], 4 , -1530992060) \\n d = hh(d, a, b, c, x[i+ 4], 11, 1272893353) \\n c = hh(c, d, a, b, x[i+ 7], 16, -155497632) \\n b = hh(b, c, d, a, x[i+10], 23, -1094730640) \\n a = hh(a, b, c, d, x[i+13], 4 , 681279174) \\n d = hh(d, a, b, c, x[i+ 0], 11, -358537222) \\n c = hh(c, d, a, b, x[i+ 3], 16, -722521979) \\n b = hh(b, c, d, a, x[i+ 6], 23, 76029189) \\n a = hh(a, b, c, d, x[i+ 9], 4 , -640364487) \\n d = hh(d, a, b, c, x[i+12], 11, -421815835) \\n c = hh(c, d, a, b, x[i+15], 16, 530742520) \\n b = hh(b, c, d, a, x[i+ 2], 23, -995338651) \\n \\n a = ii(a, b, c, d, x[i+ 0], 6 , -198630844) \\n d = ii(d, a, b, c, x[i+ 7], 10, 1126891415) \\n c = ii(c, d, a, b, x[i+14], 15, -1416354905) \\n b = ii(b, c, d, a, x[i+ 5], 21, -57434055) \\n a = ii(a, b, c, d, x[i+12], 6 , 1700485571) \\n d = ii(d, a, b, c, x[i+ 3], 10, -1894986606) \\n c = ii(c, d, a, b, x[i+10], 15, -1051523) \\n b = ii(b, c, d, a, x[i+ 1], 21, -2054922799) \\n a = ii(a, b, c, d, x[i+ 8], 6 , 1873313359) \\n d = ii(d, a, b, c, x[i+15], 10, -30611744) \\n c = ii(c, d, a, b, x[i+ 6], 15, -1560198380) \\n b = ii(b, c, d, a, x[i+13], 21, 1309151649) \\n a = ii(a, b, c, d, x[i+ 4], 6 , -145523070) \\n d = ii(d, a, b, c, x[i+11], 10, -1120210379) \\n c = ii(c, d, a, b, x[i+ 2], 15, 718787259) \\n b = ii(b, c, d, a, x[i+ 9], 21, -343485551) \\n \\n a = safe_add(a, olda) \\n b = safe_add(b, oldb) \\n c = safe_add(c, oldc) \\n d = safe_add(d, oldd) \\n } \\n return [a, b, c, d] \\n}\",\n \"sumOfHalvesEqual() {}\",\n \"function calculate(num1, op, num2) {\\n // ifs and elses (switch?) using num1, num2 and operator\\n\\n\\n var result;\\n\\n switch (op) {\\n case \\\"+\\\":\\n result = num1 + num2;\\n\\n break;\\n\\n case \\\"-\\\":\\n result = num1 - num2;\\n\\n break;\\n\\n case \\\"*\\\":\\n result = num1 * num2;\\n\\n break;\\n\\n case \\\"/\\\":\\n result = num1 / num2;\\n\\n break;\\n\\n default:\\n\\n }\\n // console.log(result);\\n return result;\\n }\",\n \"function main() {\\n let meters = 15.6;\\n const inches = meterToInches(meters);\\n console.log(`${meters} meters = ${inches} inches`);\\n console.log();\\n let n = Math.floor(Math.random() * 20);\\n loopThrough(n);\\n console.log(`Sum of numbers from 0 to ${n} is ${calculateSum(n)}`);\\n fizzbuzz(30);\\n console.log(`Factorial of ${n} is ${findFactorial(n)}`);\\n console.log(sleep_in(false, false));\\n console.log(sleep_in(true, false));\\n console.log(sleep_in(false, true));\\n console.log(common([1, 2, 3], [7, 3]));\\n console.log(common([1, 2, 3], [1, 0]));\\n console.log(common([1, 2, 3], [7, 3, 2]));\\n objectsAndKeysChallenge();\\n mutatingObjects()\\n}\",\n \"function questionCalculations()\\r\\n\\t{\\r\\n\\t\\t// here, calculations for all the above variables should occur\\r\\n\\t}\",\n \"function calcular (oper,...nums){\\n let res\\n switch (oper){\\n case '+':\\n //res = 0\\n //for(let n of nums) soma +=n\\n res = somaTudo(...nums)\\n break\\n\\n case '*':\\n res = 1\\n for(let n of nums) res *=n\\n }\\n return res\\n}\",\n \"function ACombinatorialWithDivide(pEn,pKay) {\\nthis.en = pEn\\nthis.kay = pKay\\n//make a list of the number size that is just for the reminant of the top with the bottom crossed out.\\nthis.newList = Array.apply(null, new Array(this.kay)).map(Function.call, Number).map(function(it){return it+this.en-this.kay+1},this)\\n//reverse the list\\nvar revList=this.newList.map(function(item,index){return this.newList[this.newList.length-index-1]},this)\\n//make the other denominator number, that was not cancelled\\nthis.botList=this.newList.map(function(item){return item-(this.en-this.kay)},this)\\n//reverse that list\\nvar revBot=this.botList.map(function(item,index){return this.botList[this.botList.length-index-1]},this)\\nvar tallyList = infiniteArrayClone(revBot);\\n// Logger.log(\\\" tallyList: \\\"+tallyList+\\\" revBot: \\\"+revBot+\\\" revList: \\\"+revList) \\nfor (var cA=0;cA=0){var v=x*this[i++]+w[j]+c;c=Math.floor(v/0x4000000);w[j++]=v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.\",\n \"function o0(o1, o2) {\\n try {\\nreturn o34(o32, o36, o37);\\n}catch(e){}\\n}\",\n \"function solve182()\\n{\\n var operations_ArrStr = input.split(\\\"\\\\n\\\");\\n var register_MapStrInt = initRegister(operations_ArrStr);\\n var register0 = new Map(register_MapStrInt);\\n register0.set(\\\"p\\\", 0);\\n var register1 = new Map(register_MapStrInt);\\n register1.set(\\\"p\\\", 1);\\n register_MapStrInt = new Map(register0);\\n var nextOperationIndex_Int = 0; // index of next operation\\n var nextOperation0 = 1;\\n var nextOperation1 = 1;\\n var in_Que = [];\\n var out_Que = [];\\n \\n var count_Int = 0;\\n \\n var emptyInCount_Int = 0;\\n var activeProgramm = 0;\\n while(true)\\n {\\n let operation_ArrStr = operations_ArrStr[nextOperationIndex_Int].split(\\\" \\\");\\n switch (operation_ArrStr[0])\\n {\\n case \\\"snd\\\":\\n if(!isNaN(parseInt(operation_ArrStr[1])))\\n {\\n out_Que.push(parseInt(operation_ArrStr[1]));\\n if(activeProgramm == 1)\\n {\\n count_Int++;\\n }\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[1]))\\n {\\n out_Que.push(register_MapStrInt.get(operation_ArrStr[1]));\\n if(activeProgramm == 1)\\n {\\n count_Int++;\\n }\\n }\\n nextOperationIndex_Int++;\\n break;\\n case \\\"set\\\":\\n if(!isNaN(parseInt(operation_ArrStr[2])))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], parseInt(operation_ArrStr[2]));\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[2]))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[2]));\\n }\\n nextOperationIndex_Int++;\\n break;\\n case \\\"add\\\":\\n if(!isNaN(parseInt(operation_ArrStr[2])))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) + parseInt(operation_ArrStr[2]));\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[2]))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) + register_MapStrInt.get(operation_ArrStr[2]));\\n }\\n nextOperationIndex_Int++;\\n break;\\n case \\\"mul\\\":\\n if(!isNaN(parseInt(operation_ArrStr[2])))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) * parseInt(operation_ArrStr[2]));\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[2]))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) * register_MapStrInt.get(operation_ArrStr[2]));\\n }\\n nextOperationIndex_Int++;\\n break;\\n case \\\"mod\\\":\\n if(!isNaN(parseInt(operation_ArrStr[2])))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) % parseInt(operation_ArrStr[2]));\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[2]))\\n {\\n register_MapStrInt.set(operation_ArrStr[1], register_MapStrInt.get(operation_ArrStr[1]) % register_MapStrInt.get(operation_ArrStr[2]));\\n }\\n nextOperationIndex_Int++;\\n break;\\n case \\\"rcv\\\":\\n if(register_MapStrInt.has(operation_ArrStr[1]))\\n {\\n if(in_Que.length == 0)\\n {\\n emptyInCount_Int++;\\n // check for deadlock\\n if(out_Que.length == 0 && emptyInCount_Int >= 2)\\n {\\n return count_Int;\\n }\\n if(out_Que.length != 0)\\n {\\n //emptyInCount_Int = 0; ???\\n }\\n // change active programm\\n if(activeProgramm == 0)\\n {\\n activeProgramm = 1;\\n nextOperation0 = nextOperationIndex_Int;\\n nextOperationIndex_Int = nextOperation1 - 1;\\n register0 = new Map(register_MapStrInt);\\n register_MapStrInt = new Map(register1);\\n let a = in_Que.slice();\\n in_Que = out_Que.slice();\\n out_Que = a.slice(); // = [] (?)\\n }\\n else if(activeProgramm == 1)\\n {\\n activeProgramm = 0;\\n nextOperation1 = nextOperationIndex_Int;\\n nextOperationIndex_Int = nextOperation0 - 1;\\n register1 = new Map(register_MapStrInt);\\n register_MapStrInt = new Map(register0);\\n let a = in_Que.slice();\\n in_Que = out_Que.slice();\\n out_Que = a.slice(); // = [] (?)\\n }\\n else\\n {\\n return -1;\\n }\\n }\\n else\\n {\\n register_MapStrInt.set(operation_ArrStr[1], in_Que.shift());\\n }\\n }\\n nextOperationIndex_Int++;\\n break;\\n case \\\"jgz\\\":\\n var x = 0;\\n if(!isNaN(parseInt(operation_ArrStr[1])))\\n {\\n x = parseInt(operation_ArrStr[1]);\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[1]))\\n {\\n x = register_MapStrInt.get(operation_ArrStr[1]);\\n }\\n if(x <= 0)\\n {\\n nextOperationIndex_Int++;\\n break;\\n }\\n if(!isNaN(parseInt(operation_ArrStr[2])))\\n {\\n nextOperationIndex_Int += parseInt(operation_ArrStr[2]);\\n }\\n else if(register_MapStrInt.has(operation_ArrStr[2]))\\n {\\n nextOperationIndex_Int += register_MapStrInt.get(operation_ArrStr[2]);\\n }\\n break;\\n }\\n }\\n}\",\n \"static approxEqTrans(ta, tb) {\\nvar aeq, i;\\n//------–-----\\naeq = (function() {\\nvar j, results;\\nresults = [];\\nfor (i = j = 0; j < 3; i = ++j) {\\nresults.push(this.approxEq(ta[i], tb[i]));\\n}\\nreturn results;\\n}).call(this);\\nreturn aeq[0] && aeq[1] && aeq[2];\\n}\",\n \"function add(a,b){return a+b;}\",\n \"function add (a,b)\\n{\\n return a + b \\n\\n}\",\n \"function sum(a, b) {\\n\\n}\",\n \"function basicSum(x, y) {\\n return x + y;\\n}\",\n \"function orderOfProcedence(expressionArray)\\r\\n {\\r\\n\\r\\n for (var i = 0, d; d = expressionArray[i]; i++)\\r\\n {\\r\\n if (d == '^')\\r\\n {\\r\\n var elementPosition = expressionArray.indexOf('^'); // creates the element's current position of the array\\r\\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\\r\\n calculationByOperation(sign, elementPosition); // calling the function to resolve the sub expression found\\r\\n i = 0; // resets the counter to begin from the start of the expression\\r\\n }\\r\\n }\\r\\n\\r\\n // Checking and calculating division and multiplication from left to right\\r\\n for (var i = 0, d; d = expressionArray[i]; i++)\\r\\n {\\r\\n if (d == '/')\\r\\n {\\r\\n var elementPosition = expressionArray.indexOf('/'); // creates the element's current position of the array\\r\\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\\r\\n calculationByOperation(sign, elementPosition); // calling the third function to resolve the sub expression found\\r\\n\\r\\n if (divisionByZero == 1) // if division by zero is detected the program breaks out of the function\\r\\n {\\r\\n return false;\\r\\n }\\r\\n else {\\r\\n i = 0; // resets the counter to begin from the start of the array\\r\\n }\\r\\n\\r\\n }\\r\\n else if (d == '*')\\r\\n {\\r\\n var elementPosition = expressionArray.indexOf('*'); // creates the element's current position of the array\\r\\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\\r\\n calculationByOperation(sign, elementPosition); // calling the third function to resolve the sub expression found\\r\\n i = 0; // resets the counter to begin from the start of the array\\r\\n }\\r\\n }\\r\\n\\r\\n // Checking and calculating addition and subtraction from left to right\\r\\n for (var i = 0, d; d = expressionArray[i]; i++)\\r\\n {\\r\\n if (d == '+')\\r\\n {\\r\\n var elementPosition = expressionArray.indexOf('+'); // creates the element's current position of the array\\r\\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\\r\\n calculationByOperation(sign, elementPosition); // calling the function to resolve the sub expression found\\r\\n i = 0; // resets the counter to begin from the start of the expression\\r\\n }\\r\\n if (d == '-')\\r\\n {\\r\\n var elementPosition = expressionArray.indexOf('-'); // creates the element's current position of the array\\r\\n var sign = expressionArray[elementPosition]; // creates the sign variable to pass into the third function\\r\\n calculationByOperation(sign, elementPosition); // calling the function to resolve the sub expression found\\r\\n i = 0; // resets the counter to begin from the start of the expression\\r\\n }\\r\\n }\\r\\n\\r\\n }\",\n \"function a(num1, num2) { // & as a matter of fact\\n // these function also have no side effects\\n // they are not touching any of the outside world\\n // they are only touching their own parameters\\n // & parameterrs if you rememeber they are local variables\\n return num1 + num2\\n}\",\n \"function AMultipleCombinatorial(pEn,pKays) {\\nthis.en = pEn\\nif (typeof pKays === 'number')\\n{pKays=[pKays];}\\nvar sumOfVals = pKays.reduce(function(total,val){return total+=val});\\nif (sumOfValsval)?total:val});\\nif (this.maxKay==1)\\n{\\nthis.prod=(Array.apply(null,new Array(pEn)).map(Function.call, Number).map(function(it){return it+1})).reduce(function(prd,val){return prd*=val;},1)\\n}\\nelse{\\nthis.functionToMakeList= function(disKay,aKay){return Array.apply(null,new Array(disKay)).map(Function.call, Number).map(function(it){return it+aKay+1})}\\nthis.functionToReverseLists = function(disArray){return disArray.map(function(val,ind){return disArray[disArray.length-ind-1]})}\\n//Take it out of set\\npKays.splice(pKays.indexOf(this.maxKay),1);\\n//make a list of the number size that is just for the reminant of the top with the bottom crossed out.\\n//array apply null ducks giving apply context, which is the point of the arguments in call, apply, and bind\\n//so it just runs the new array constructor for the number, which makes an array which has indexes for three undefined slots\\n//map (function.call), uses function call as a callback, which calls the call back in the context of the Number function\\n//now map takes val, ind, array which are what number.call gets, so this is a fancy way to pass (val, ind, array) as the parameters\\n// of any function. Remember first argument of number.call is context, which is val in this case, which is undefined, which gets thrown out\\n//the next is taken as the one parameter of the Number method, which is the index.\\n//you are using call call game to create a circumstance to through out maps first value\\n//so we make a list just as long as maxKay which takes the numbers from max to kay and boosts them all up so the last one is em\\nvar newList = this.functionToMakeList(pEn-this.maxKay,this.maxKay);\\n//reverse the list\\nthis.revList=this.functionToReverseLists(newList);\\n//make the other denominator number, that was not cancelled\\nthis.botLists=pKays.map(function(val){return this.functionToMakeList(val,0);},this);\\n//reverse these list\\nthis.revBots=this.botLists.map(function(dArray){return this.functionToReverseLists(dArray)},this);\\n// Logger.log(\\\"maxKey: \\\"+this.maxKay+\\\" PK: \\\"+pKays+\\\" newList: \\\"+newList+\\\" rb: \\\"+this.revBots+\\\" TL: \\\"+this.tallyListOfLists+\\\" RL: \\\"+this.revList)\\n//go through the toplist\\n//go through the bot list\\n//alter top and bottom\\n//kill record when one is done \\n \\n this.tallyListOfLists = infiniteArrayClone(this.revBots)\\n var revBotLengths= this.revBots.map(function(val){return val.length});\\n revBotLengths.sort(function(a, b){return a - b});\\n// var poses = []\\n// for (var cA=revBotLengths.length-1;cA>-1;cA--)\\n// {\\n// var cB= this.revBots.length-1;\\n// while (this.revBots[cB].length!=revBotLengths[cA])\\n// {\\n// cB--;\\n// }\\n// poses.push(this.revBots.length-cB-1);\\n// }\\n// this.tallyListOfLists = [];\\n// poses.forEach(function(val){this.tallyListOfLists.push(this.revBots[val])},this)\\n// this.revBots = infiniteArrayClone(this.tallyListOfLists);\\n\\n \\nfor (var cA=0;cA0)&&(cC0)&&(cB0)});\\n this.revBotProd=1\\n//do the multiplication of the remnant\\n this.revBots.forEach(function(val){val.forEach(function(item){this.revBotProd=this.revBotProd*item})});\\n//SpreadsheetApp.getUi().alert(newList)\\nthis.prod=1/this.revBotProd\\nthis.revList.forEach(function(item){this.prod=this.prod*item},this) ;\\n//this.revList.forEach(function(item){this.sum+=item},this);\\n}\\n}\",\n \"function c(e,n,r,i){function o(e,t){return 1-3*t+3*e}function s(e,t){return 3*t-6*e}function a(e){return 3*e}function l(e,t,n){return((o(t,n)*e+s(t,n))*e+a(t))*e}function u(e,t,n){return 3*o(t,n)*e*e+2*s(t,n)*e+a(t)}function c(t,n){for(var i=0;i0?i=s:n=s}while(Math.abs(o)>v&&++a=g?c(t,a):0===l?a:p(t,n,n+x)}function h(){T=!0,e===n&&r===i||f()}var m=4,g=.001,v=1e-7,y=10,b=11,x=1/(b-1),w=\\\"Float32Array\\\"in t;if(4!==arguments.length)return!1;for(var S=0;S<4;++S)if(\\\"number\\\"!=typeof arguments[S]||isNaN(arguments[S])||!isFinite(arguments[S]))return!1;e=Math.min(e,1),r=Math.min(r,1),e=Math.max(e,0),r=Math.max(r,0);var C=w?new Float32Array(b):new Array(b),T=!1,E=function(t){return T||h(),e===n&&r===i?t:0===t?0:1===t?1:l(d(t),n,i)};E.getControlPoints=function(){return[{x:e,y:n},{x:r,y:i}]};var k=\\\"generateBezier(\\\"+[e,n,r,i]+\\\")\\\";return E.toString=function(){return k},E}\",\n \"function l(e,n,o,r){function i(e,t){return 1-3*t+3*e}function a(e,t){return 3*t-6*e}function s(e){return 3*e}function l(e,t,n){return((i(t,n)*e+a(t,n))*e+s(t))*e}function u(e,t,n){return 3*i(t,n)*e*e+2*a(t,n)*e+s(t)}function c(t,n){for(var r=0;r0?r=a:n=a}while(Math.abs(i)>g&&++s=y?c(t,s):0==l?s:d(t,n,n+b)}function m(){S=!0,e==n&&o==r||f()}var h=4,y=.001,g=1e-7,v=10,w=11,b=1/(w-1),_=\\\"Float32Array\\\"in t;if(4!==arguments.length)return!1;for(var x=0;x<4;++x)if(\\\"number\\\"!=typeof arguments[x]||isNaN(arguments[x])||!isFinite(arguments[x]))return!1;e=Math.min(e,1),o=Math.min(o,1),e=Math.max(e,0),o=Math.max(o,0);var C=_?new Float32Array(w):new Array(w),S=!1,T=function(t){return S||m(),e===n&&o===r?t:0===t?0:1===t?1:l(p(t),n,r)};T.getControlPoints=function(){return[{x:e,y:n},{x:o,y:r}]};var k=\\\"generateBezier(\\\"+[e,n,o,r]+\\\")\\\";return T.toString=function(){return k},T}\",\n \"function izzqz( a , b , x , y , z )\\n {\\n\\n const c_0 = 1e-6 ;\\n \\n var r = new Array( 5 ) ;\\n var rr = new Array( 1 ) ;\\n \\n var xi = undefined ;\\n var yi = undefined ;\\n var ii = undefined ;\\n \\n var ri = undefined ;\\n \\n var izz = 0.0 ;\\n var izzqz = 0.0 ;\\n\\n rr[0] = r ;\\n\\n if( z < c_0 ) z = c_0 ;\\n \\n for( i = 0; i < 4; ++i )\\n { \\n \\n switch( i )\\n {\\n \\n case 0:\\n xi = ( (- a) / 2 ) ;\\n yi = ( (- b) / 2 ) ;\\n ii = ( 1 / (2 * Math.PI) ) ;\\n break;\\n \\n case 1:\\n xi = ( (- a) / 2 ) ;\\n yi = ( ( b) / 2 ) ;\\n ii = (- 1 / (2 * Math.PI) ) ;\\n break;\\n \\n case 2:\\n xi = ( ( a) / 2 ) ;\\n yi = ( ( b) / 2 ) ;\\n ii = ( 1 / (2 * Math.PI) ) ;\\n break;\\n\\n case 3:\\n xi = ( ( a) / 2 ) ;\\n yi = ( (- b) / 2 ) ;\\n ii = (- 1 / (2 * Math.PI) ) ;\\n \\n }; // end switch()\\n \\n ri = Math.sqrt( ((x + xi) * (x + xi)) + ((y + yi) * (y + yi)) + (z * z) ) ;\\n izz = ( 1 / (((x + xi) * (x + xi)) + (z * z)) ) ;\\n izz += ( 1 / (((y + yi) * (y + yi)) + (z * z)) ) ;\\n izz *= ( ((x + xi) * (y + yi) * z) / ri ) ;\\n izz += Math.atan2( ((x + xi) * (y + yi)) , (z * ri) ) ;\\n \\n r[i] = ( ii * izz ) ;\\n\\n izzqz += ( ii * izz ) ;\\n \\n }; // end for()\\n\\n r[4] = izzqz ;\\n\\n return( rr ) ;\\n \\n }\",\n \"pow22523(z) {\\r\\n const t0 = new FieldElement();\\r\\n const t1 = new FieldElement();\\r\\n const t2 = new FieldElement();\\r\\n let i;\\r\\n t0.square(z);\\r\\n // for (i = 1; i < 1; i++) {\\r\\n // t0.square(t0);\\r\\n // }\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 2; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(z, t1);\\r\\n t0.mul(t0, t1);\\r\\n t0.square(t0);\\r\\n // for (i = 1; i < 1; i++) {\\r\\n // t0.square(t0);\\r\\n // }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 5; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 10; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(t1, t0);\\r\\n t2.square(t1);\\r\\n for (i = 1; i < 20; i++) {\\r\\n t2.square(t2);\\r\\n }\\r\\n t1.mul(t2, t1);\\r\\n t1.square(t1);\\r\\n for (i = 1; i < 10; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 50; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(t1, t0);\\r\\n t2.square(t1);\\r\\n for (i = 1; i < 100; i++) {\\r\\n t2.square(t2);\\r\\n }\\r\\n t1.mul(t2, t1);\\r\\n t1.square(t1);\\r\\n for (i = 1; i < 50; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t0.square(t0);\\r\\n for (i = 1; i < 2; i++) {\\r\\n t0.square(t0);\\r\\n }\\r\\n this.mul(t0, z);\\r\\n }\",\n \"function operate(a,operator,b){\\n\\tswitch(operator){\\n\\t\\tcase '+':\\n\\t\\t\\treturn add(a,b);\\n\\t\\t\\tbreak;\\n\\t\\tcase '-':\\n\\t\\t\\treturn substract(a,b);\\n\\t\\t\\tbreak;\\n\\t\\tcase '*':\\n\\t\\t\\treturn multiply(a,b);\\n\\t\\t\\tbreak;\\n\\t\\tcase '/':\\n\\t\\t\\treturn divide(a,b);\\n\\t\\t\\tbreak;\\n\\t\\tcase '=':\\n\\t\\t\\treturn b;\\n\\t\\t\\tbreak;\\n\\t\\tdefault:\\n\\t\\t\\tclearAll();\\n\\t\\t\\talert(\\\"Error: Invalid operator!\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t\\tbreak;\\n\\t}\\n}\",\n \"function growFaster(intOps, boolOps, numberPrograms, booleanPrograms, inputoutputs){\\r\\n\\r\\n var levelNum = [];\\r\\n var levelBool = [];\\r\\n for(var i = 0; i < inputoutputs.length; i++){ \\r\\n //making the new enviroment for the i-th insatanc\\r\\n var envt = {};\\r\\n for(var key in inputoutputs[i]) {\\r\\n if(key != \\\"_out\\\"){\\r\\n envt[key] = inputoutputs[i][key];\\r\\n } \\r\\n }\\r\\n\\r\\n\\r\\n for(var i = 0; i < boolOps.length; i++){ \\r\\n for( var j = 0; j < numberPrograms.length; j++){\\r\\n for( var k = 0; k < numberPrograms.length; k++){\\r\\n var var1 = interpret(numberPrograms[j], envt);\\r\\n var var2 = interpret(numberPrograms[k], envt);\\r\\n if(boolOps[i] == LT){\\r\\n levelBool.push(lt(numberPrograms[j], numberPrograms[k]));\\r\\n }\\r\\n } \\r\\n }\\r\\n for( var j = 0; j < booleanPrograms.length; j++){\\r\\n for( var k = 0; k < booleanPrograms.length; k++){\\r\\n var var1 = interpret(booleanPrograms[j], envt);\\r\\n var var2 = interpret(booleanPrograms[k], envt);\\r\\n if(boolOps[i] == AND){\\r\\n if(var1 == false && var2 == false){\\r\\n levelBool.push(and(flse(), flse()));\\r\\n }else if(var1 != false && var2 == false){\\r\\n levelBool.push(and(not(flse()), flse()));\\r\\n }else if(var1 == false && var2 != false){\\r\\n levelBool.push(and(flse(),not(flse())));\\r\\n }else if(var1 != false && var2 != false){\\r\\n levelBool.push(and(not(flse()), not(flse())));\\r\\n }\\r\\n }\\r\\n }\\r\\n if(boolOps[i] == NOT){\\r\\n if(var1 != false){\\r\\n levelBool.push(not(flse()));\\r\\n }else{ \\r\\n levelBool.push(flse());\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n for(var i = 0; i < intOps.length; i++){\\r\\n if(intOps[i] == ITE){\\r\\n for( var j = 0; j < booleanPrograms.length; j++){\\r\\n for( var k = 0; k < numberPrograms.length; k++){ \\r\\n for( var l = 0; l < numberPrograms.length; l++){\\r\\n var var1 = interpret(booleanPrograms[j], envt);\\r\\n if(var1 == false){\\r\\n levelNum.push(ite(flse(), numberPrograms[k], numberPrograms[j]));\\r\\n } else{\\r\\n levelNum.push(ite(not(flse()), numberPrograms[k], numberPrograms[j]));\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n } \\r\\n\\r\\n for( var k = 0; k < numberPrograms.length; k++){ \\r\\n for( var l = 0; l < numberPrograms.length; l++){\\r\\n if(intOps[i] == PLUS){\\r\\n levelNum.push(plus(numberPrograms[k], numberPrograms[l]));\\r\\n } else if(intOps[i] == TIMES){\\r\\n levelNum.push(times(numberPrograms[k], numberPrograms[l]));\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n } \\r\\n \\r\\n } \\r\\n return {\\\"nums\\\":levelNum, \\\"bools\\\": levelBool};\\r\\n}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function _t(t){var N,L,A,S,e,c=Math.floor,_=new Array(64),F=new Array(64),P=new Array(64),k=new Array(64),y=new Array(65535),v=new Array(65535),Z=new Array(64),w=new Array(64),I=[],C=0,B=7,j=new Array(64),E=new Array(64),M=new Array(64),n=new Array(256),O=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],q=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],T=[0,1,2,3,4,5,6,7,8,9,10,11],R=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],D=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],U=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],z=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function V(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<>8&255),G(255&t)}function J(t,e,n,r,i){for(var o,a=i[0],s=i[240],l=function(t,e){var n,r,i,o,a,s,l,h,u,c,f=0;for(u=0;u<8;++u){n=t[f],r=t[f+1],i=t[f+2],o=t[f+3],a=t[f+4],s=t[f+5],l=t[f+6];var p=n+(h=t[f+7]),d=n-h,g=r+l,m=r-l,y=i+s,v=i-s,w=o+a,b=o-a,x=p+w,N=p-w,L=g+y,A=g-y;t[f]=x+L,t[f+4]=x-L;var S=.707106781*(A+N);t[f+2]=N+S,t[f+6]=N-S;var _=.382683433*((x=b+v)-(A=m+d)),F=.5411961*x+_,P=1.306562965*A+_,k=.707106781*(L=v+m),I=d+k,C=d-k;t[f+5]=C+F,t[f+3]=C-F,t[f+1]=I+P,t[f+7]=I-P,f+=8}for(u=f=0;u<8;++u){n=t[f],r=t[f+8],i=t[f+16],o=t[f+24],a=t[f+32],s=t[f+40],l=t[f+48];var B=n+(h=t[f+56]),j=n-h,E=r+l,M=r-l,O=i+s,q=i-s,T=o+a,R=o-a,D=B+T,U=B-T,z=E+O,H=E-O;t[f]=D+z,t[f+32]=D-z;var W=.707106781*(H+U);t[f+16]=U+W,t[f+48]=U-W;var V=.382683433*((D=R+q)-(H=M+j)),G=.5411961*D+V,Y=1.306562965*H+V,J=.707106781*(z=q+M),X=j+J,K=j-J;t[f+40]=K+G,t[f+24]=K-G,t[f+8]=X+Y,t[f+56]=X-Y,f++}for(u=0;u<64;++u)c=t[u]*e[u],Z[u]=0>4;for(var m=1;m<=f;++m)V(s);g&=15}o=32767+w[p],V(i[(g<<4)+v[o]]),V(y[o]),p++}return 63!=c&&V(a),n}function X(t){if(t<=0&&(t=1),100>3)*w+(p=4*(7&g)),v<=b+d&&(f-=w*(b+1+d-v)),w<=s+p&&(f-=s+p-w+4),l=m[f++],h=m[f++],u=m[f++],j[g]=(O[l]+O[h+256>>0]+O[u+512>>0]>>16)-128,E[g]=(O[l+768>>0]+O[h+1024>>0]+O[u+1280>>0]>>16)-128,M[g]=(O[l+1280>>0]+O[h+1536>>0]+O[u+1792>>0]>>16)-128;i=J(j,P,i,N,A),o=J(E,k,o,L,S),a=J(M,k,a,L,S),s+=32}b+=8}if(0<=B){var x=[];x[1]=B+1,x[0]=(1<>0]=38470*t,O[t+512>>0]=7471*t+32768,O[t+768>>0]=-11059*t,O[t+1024>>0]=-21709*t,O[t+1280>>0]=32768*t+8421375,O[t+1536>>0]=-27439*t,O[t+1792>>0]=-5329*t}(),X(t),(new Date).getTime()}()}\",\n \"function o0(e,o1,buffer) {\\n try {\\n\\\"use asm\\\";\\n}catch(e){}\\n function o7(o2,o3) {\\n try {\\nset.o27 = +o2;\\n}catch(e){}\\n try {\\no384 = +o28;\\n}catch(e){}\\n try {\\nreturn o1083 = o1062;\\n}catch(e){}\\n }\\n \\n function o4(o2,o3){\\n try {\\no4212]o4.o6(function() { try {\\nObject.defineProperty(o3, key, { value: 'something', enumerable: true });\\n}catch(e){} }, \\\"Object.defineProperty uses ToPropertyKey. Property is added to the object\\\")] = 2;\\n}catch(e){}\\n try {\\no39.o38(o34);\\n}catch(e){}\\n var o673 = o215(1, \\\"i32*\\\", o212);\\n var o1103 = 0;\\n try {\\no5 = +o7[this.o565[o810]](o2,o3);\\n}catch(e){}\\n try {\\nreturn +o5;\\n}catch(e){}\\n }\\n \\n var o7 = [add,add,add,add];\\n \\n \\n try {\\nreturn o4.o10;\\n}catch(e){}\\n}\",\n \"function operate(num1, num2, operator){\\n if(operator === '+') return add(num1, num2)\\n if(operator === '-') return subtract(num1, num2)\\n if(operator === '*') return multiply(num1, num2)\\n if(operator === '/') return divide(num1, num2)\\n}\",\n \"function operations(typeOperator) {\\n\\t\\n\\tif(typeOperator=='comma' && v!='v'){\\n\\t\\tresText=resText+\\\".\\\";\\n\\t\\tv='v';\\n\\t\\tdv=1;\\n\\t\\tanimateButtons('comma');\\n\\t}else if(typeOperator!='comma'){\\n\\t\\tv='f';\\n\\t}\\n\\n\\tif(typeOperator==\\\"sum\\\"){\\n\\t\\tresText=resText+\\\"+\\\";\\n\\t\\tanimateButtons('sum');\\t \\n\\t}else if(typeOperator==\\\"minus\\\"){\\n\\t\\tresText=resText+\\\"-\\\";\\n\\t\\tanimateButtons('minus');\\n\\n\\n\\t}else if(typeOperator==\\\"times\\\"){\\n\\t\\tresText=\\\"ans\\\"+\\\"×\\\";\\n\\t\\tanimateButtons('times');\\n\\n\\n\\t}else if(typeOperator==\\\"divided\\\"){\\n\\t\\tresText=\\\"ans\\\"+\\\"÷\\\";\\n\\t\\tanimateButtons('divided');\\n\\n\\t}\\n\\n\\n\\tif(typeOperator!='comma'){\\n\\n\\t\\tif(prevTypeOperator=='sum'){\\n\\t\\t\\tresNum=numberInstMemo+resNum;\\n\\t\\t\\tnumberInstMemo=0;\\n\\n\\t\\t}else if(prevTypeOperator=='minus'){\\n\\t\\t\\tresNum=resNum-numberInstMemo;\\n\\t\\t\\tnumberInstMemo=0;\\n\\n\\t\\t}else if(prevTypeOperator=='times' && d!=0){\\n\\t\\t\\tresNum=resNum*numberInstMemo;\\n\\t\\t\\tnumberInstMemo=0; \\n\\n\\t\\t}else if(prevTypeOperator=='divided' && d!=0){\\n\\t\\t\\tresNum=resNum/numberInstMemo;\\n\\t\\t\\tnumberInstMemo=0; \\n\\n\\t\\t}\\n\\n\\t\\tprevTypeOperator=typeOperator;\\n\\t\\t\\n\\t}\\n\\t\\n\\t\\n\\tif(typeOperator=='equal'){\\n\\n\\t\\tresText='ans';\\n\\t\\tanimateButtons('equal');\\n\\t\\t\\n\\t}\\n\\n\\tdocument.getElementById(\\\"resText\\\").innerHTML = resText;\\n\\tdocument.getElementById(\\\"resNum\\\").innerHTML = resNum;\\n\\t\\n\\td=0;\\n\\n\\n}\",\n \"function o0(stdlib,o1,buffer) {\\n try {\\no8[4294967294];\\n}catch(e){}\\n function o104(o49, o50, o73) {\\n try {\\no95(o49, o50, o73, this);\\n}catch(e){}\\n\\n try {\\no489.o767++;\\n}catch(e){}\\n\\n try {\\nif (o97 === o49) {\\n try {\\nreturn true;\\n}catch(e){}\\n }\\n}catch(e){}\\n\\n try {\\nreturn false;\\n}catch(e){}\\n };\\n //views\\n var o3 =this;\\n\\n function o4(){\\n var o30\\n var o6 = o2(1.5);\\n try {\\no3[1] = o6;\\n}catch(e){}\\n try {\\nreturn +(o3[1])\\n}catch(e){}\\n }\\n try {\\nreturn o4;\\n}catch(e){}\\n}\",\n \"_coreSHA1(_x, _len) {\\n\\n _x[_len >> 5] |= 0x80 << (24 - _len % 32);\\n _x[((_len + 64 >> 9) << 4) + 15] = _len;\\n\\n const _this = this;\\n let _a = 1732584193;\\n let _b = -271733879;\\n let _c = -1732584194;\\n let _d = 271733878;\\n let _e = -1009589776;\\n const _w = new Array(80);\\n let i;\\n let _olda;\\n let _oldb;\\n let _oldc;\\n let _oldd;\\n let _olde;\\n let j;\\n let _t;\\n\\n for (i = 0; i < _x.length; i += 16) {\\n _olda = _a;\\n _oldb = _b;\\n _oldc = _c;\\n _oldd = _d;\\n _olde = _e;\\n\\n for (j = 0; j < 80; j++) {\\n if (j < 16) {\\n _w[j] = _x[i + j];\\n }\\n else {\\n _w[j] = _this._rol(_w[j-3] ^ _w[j-8] ^ _w[j-14] ^ _w[j-16], 1);\\n }\\n _t = _this._safeAdd(_this._safeAdd(_this._rol(_a, 5), _this._sha1FT(j, _b, _c, _d)),\\n _this._safeAdd(_this._safeAdd(_e, _w[j]), _this._sha1KT(j)));\\n _e = _d;\\n _d = _c;\\n _c = _this._rol(_b, 30);\\n _b = _a;\\n _a = _t;\\n }\\n\\n _a = _this._safeAdd(_a, _olda);\\n _b = _this._safeAdd(_b, _oldb);\\n _c = _this._safeAdd(_c, _oldc);\\n _d = _this._safeAdd(_d, _oldd);\\n _e = _this._safeAdd(_e, _olde);\\n }\\n return [_a, _b, _c, _d, _e];\\n }\",\n \"function tester() {\\n document.getElementById(\\\"output\\\").innerHTML += firstLast6([1,2,3,4,5,6]);\\n document.getElementById(\\\"output\\\").innerHTML += has23([2,3]);\\n document.getElementById(\\\"output\\\").innerHTML += fix_23([1,2,3]);\\n document.getElementById(\\\"output\\\").innerHTML += countYZ(\\\"fez day\\\");\\n document.getElementById(\\\"output\\\").innerHTML += endOther(\\\"Hiabc\\\", \\\"abc\\\");\\n document.getElementById(\\\"output\\\").innerHTML += starOut(\\\"ab***cd\\\");\\n document.getElementById(\\\"output\\\").innerHTML += getSandwich(\\\"breadinkbread\\\");\\n document.getElementById(\\\"output\\\").innerHTML += canBalance([1,1,1,2,1]);\\n document.getElementById(\\\"output\\\").innerHTML += countClumps([2,2,2,3,3]);\\n document.getElementById(\\\"output\\\").innerHTML += evenlySpaced(1,3,2);\\n //test third method, etc\\n}\",\n \"function calculate(number1, number2, operator) {\\n if (operator === 'add') {\\n return suma();\\n } else if (operator === 'multiply') {\\n return inmultire();\\n } else if (operator === 'substract') {\\n return scadere();\\n } else if (operator === 'divide') {\\n return impartire();\\n }\\n\\n function suma() {\\n return (number1 + number2);\\n }\\n function impartire() {\\n return (number1 / number2);\\n }\\n function inmultire() {\\n return (number1 * number2);\\n }\\n function scadere() {\\n return (number1 - number2);\\n }\\n}\",\n \"function addition(a, b) {\\r\\n return a + b;\\r\\n}\",\n \"function addition(a, b) {\\r\\n\\treturn a + b;\\r\\n}\",\n \"function reduceOperators(iObj_ops){ \\n\\tvar iObj_ops_red = iObj_ops.slice();\\n\\tvar selected_op;\\n\\tvar opsStr = '';\\n\\tfor (var n in iObj_ops) {\\n\\t\\topsStr += iObj_ops[n].val;\\n\\t}\\n\\tconsole.log('reduceOperators - opsStr 1: ' + opsStr + ', iObj_ops: ' + JSON.stringify(iObj_ops));\\n\\n\\t// If '+' OR '-' operator are present: -----> delete all '*' and '/' operators\\n\\t// ===================================\\n\\tif ((opsStr.indexOf('+')!==-1) || (opsStr.indexOf('-')!==-1)){\\n\\t\\tfor (var i = iObj_ops.length - 1; i >= 0; i--) { \\n\\t\\t\\tif ('*/'.indexOf(iObj_ops[i].val)!==-1) {\\n\\t\\t\\t\\tiObj_ops_red.splice(i, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\topsStr = opsStr.replace(/(\\\\*|\\\\/)/g, '');\\n\\t\\tconsole.log('reduceOperators - opsStr 2: ' + opsStr + ', iObj_ops_red: ' + JSON.stringify(iObj_ops_red));\\n\\n\\t\\t////////////////////////////////////////////////////////////////////////////////////////////////\\n\\t\\t//\\n\\t\\t//\\tDecide HERE, based on the position of fObj.taget, which operator ('+' or '-') to choose\\\". NO: just choose the last operator to keep it simple!\\n\\t\\t//\\n\\t\\t////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\t\\t// At this point there will only be '+'- OR '-'-operators left - choose the last operator:\\n\\t\\tselected_op = iObj_ops_red[iObj_ops_red.length-1];\\n\\t\\tconsole.log('reduceOperators - selected_op: ' + JSON.stringify(selected_op));\\n\\n\\t}\\n\\n\\t// If '*' AND '/' operator are present: -----> delete all '*' operators, and choose the last '/' operator\\n\\t// ====================================\\n\\tif ((opsStr.indexOf('*')!==-1) && (opsStr.indexOf('/')!==-1)){\\n\\t\\tfor (var i = iObj_ops.length - 1; i >= 0; i--) { \\n\\t\\t\\tif ('*'.indexOf(iObj_ops[i].val)!==-1) {\\n\\t\\t\\t\\tiObj_ops_red.splice(i, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\topsStr = opsStr.replace(/\\\\*/g, '');\\n\\t\\tconsole.log('reduceOperators - opsStr 2: ' + opsStr + ', iObj_ops_red: ' + JSON.stringify(iObj_ops_red));\\n\\n\\t\\t// // At this point there will only be '/'-operators left - choose the last '/'-operator:\\n\\t\\t// selected_op = iObj_ops_red[iObj_ops_red.length-1];\\n\\t\\t// console.log('reduceOperators - selected_op: ' + JSON.stringify(selected_op));\\n\\t}\\n\\n\\t// If '*' OR '/' operators are present: -----> Select the last operator\\n\\t// ====================================\\n\\tif ((opsStr.indexOf('*')!==-1) || (opsStr.indexOf('/')!==-1)){\\n\\t\\t\\n\\t\\t// At this point there will only be '/'- OR '*'-operators left - choose the last operator:\\n\\t\\tselected_op = iObj_ops_red[iObj_ops_red.length-1];\\n\\t\\tconsole.log('reduceOperators - selected_op: ' + JSON.stringify(selected_op));\\n\\t}\\n\\n\\n\\treturn selected_op;\\n}\",\n \"function test_operators() {\\n var Vec2;\\n\\n function mul_scalar(p1, a) {\\n var r = new Vec2();\\n r.x = p1.x * a;\\n r.y = p1.y * a;\\n return r;\\n }\\n\\n var vec2_ops = Operators(\\n {\\n '+'(p1, p2) {\\n var r = new Vec2();\\n r.x = p1.x + p2.x;\\n r.y = p1.y + p2.y;\\n return r;\\n },\\n '-'(p1, p2) {\\n var r = new Vec2();\\n r.x = p1.x - p2.x;\\n r.y = p1.y - p2.y;\\n return r;\\n },\\n '=='(a, b) {\\n return a.x == b.x && a.y == b.y;\\n },\\n '<'(a, b) {\\n var r;\\n /* lexicographic order */\\n if(a.x == b.x) r = a.y < b.y;\\n else r = a.x < b.x;\\n return r;\\n },\\n '++'(a) {\\n var r = new Vec2();\\n r.x = a.x + 1;\\n r.y = a.y + 1;\\n return r;\\n },\\n '--'(a) {\\n var r = new Vec2();\\n r.x = a.x - 1;\\n r.y = a.y - 1;\\n return r;\\n },\\n '^'(p1, p2) {\\n var r = Math.sqrt((p1.x - p2.x) ** 2 + (p1.y - p2.y) ** 2);\\n return r;\\n }\\n },\\n {\\n left: Number,\\n '*'(a, b) {\\n return mul_scalar(b, a);\\n }\\n },\\n {\\n right: Number,\\n '*'(a, b) {\\n return mul_scalar(a, b);\\n }\\n }\\n );\\n\\n Vec2 = class Vec2 extends vec2_ops {\\n constructor(x, y) {\\n super();\\n this.x = x;\\n this.y = y;\\n }\\n toString() {\\n return 'Vec2(' + this.x + ',' + this.y + ')';\\n }\\n };\\n\\n var a = new Vec2(10, 5);\\n var b = new Vec2(110, 105);\\n var r;\\n\\n console.log(`a = `, a);\\n console.log(`b = `, b);\\n console.log(`a * 2 + 3 * b = `, (r = a * 2 + 3 * b));\\n console.log(`b - a = `, b - a);\\n console.log(`b ^ a = `, b ^ a);\\n a++;\\n r = ++a;\\n}\",\n \"function reduceTargetSide(termArr, iObj_ops, inverseOperator, reducingTerm){\\n\\tvar inversOpsLookup = {'/':'*', '*':'/', '+':'-', '-':'+'};\\t\\n\\n\\tconsole.log('reduceTargetSide - termArr 1: ' + JSON.stringify(termArr) + ', iObj_ops 1: ' + JSON.stringify(iObj_ops) + ', inverseOperator 1: ' + inverseOperator + ', reducingTerm 1: ' + reducingTerm);\\n\\n\\tvar len = termArr.length;\\n\\tfor (var n in termArr){\\n\\t\\tif (termArr[n] == reducingTerm) {\\n\\t\\t\\tconsole.log('reduceTargetSide - A0 - n: ' + n);\\n\\n\\t\\t\\tif (inverseOperator == '-') {\\n\\t\\t\\t\\tconsole.log('reduceTargetSide - A1 - n: ' + n);\\n\\n\\t\\t\\t\\tif ((n == 0) && (iObj_ops[n].val == '-')) { // CASE: a-x-a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A2 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n == 0) && (iObj_ops[n].val == '+')) { // CASE: a+x-a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A3 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n, 1); // <---- IMPORTANT: remove the \\\"+\\\" operator \\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n > 0) && (n < len-1) && ((iObj_ops[n-1].val == '+') || (iObj_ops[n-1].val == '-')) && ((iObj_ops[n].val == '+') || (iObj_ops[n].val == '-'))) { // CASE: c+a+x-a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A4 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n-1, 1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n == len-1) && (iObj_ops[n-1].val == '+')) { // CASE: x+a-a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A5 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n-1, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (inverseOperator == '+') {\\n\\t\\t\\t\\tconsole.log('reduceTargetSide - A6 - n: ' + n);\\n\\n\\t\\t\\t\\tif ((n == 0) && (iObj_ops[n].val == '-')) { // CASE: -a-x+a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A7 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n == 0) && (iObj_ops[n].val == '+')) { // CASE: -a+x+a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A8 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n, 1); // <---- IMPORTANT: remove the \\\"+\\\" operator \\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n > 0) && (n < len-1) && ((iObj_ops[n-1].val == '+') || (iObj_ops[n-1].val == '-')) && ((iObj_ops[n].val == '+') || (iObj_ops[n].val == '-'))) { // CASE: c-a+x+a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A9 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n-1, 1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n == len-1) && (iObj_ops[n-1].val == '-')) { // CASE: x-a+a = k-a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A10 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n-1, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\tif ((inverseOperator == '*') || (inverseOperator == '/')) {\\n\\t\\t\\t\\tconsole.log('reduceTargetSide - A11 - n: ' + n);\\n\\n\\t\\t\\t\\tif (n == 0) { // CASE: a*x/a = k/a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A12 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n, 1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif ((n > 0) && (n < len-1)) { // CASE: c*a*x/a = k/a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A13 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n-1, 1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (n == len-1) { // CASE: x*a/a = k/a\\n\\t\\t\\t\\t\\tconsole.log('reduceTargetSide - A14 - n: ' + n);\\n\\n\\t\\t\\t\\t\\ttermArr.splice(n, 1);\\n\\t\\t\\t\\t\\tiObj_ops.splice(n-1, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n\\n\\tconsole.log('reduceTargetSide - termArr 2: ' + JSON.stringify(termArr) + ', iObj_ops 2: ' + JSON.stringify(iObj_ops) + ', inverseOperator 2: ' + inverseOperator + ', reducingTerm 2: ' + reducingTerm);\\n\\n\\tvar reducedEquationSide = '';\\n\\tif (termArr.length == iObj_ops.length){\\n\\t\\tfor (var n in termArr) {\\n\\t\\t\\treducedEquationSide += iObj_ops[n].val+termArr[n];\\n\\t\\t}\\n\\t}\\n\\n\\tif (termArr.length == iObj_ops.length + 1){\\n\\t\\tfor (var n in termArr) {\\n\\t\\t\\tconsole.log('reduceTargetSide - n: ' + n + ', iObj_ops.length: ' + iObj_ops.length );\\n\\t\\t\\treducedEquationSide += termArr[n]+((typeof(iObj_ops[n])!=='undefined')? iObj_ops[n].val : '');\\n\\t\\t}\\n\\t}\\n\\n\\tconsole.log('reduceTargetSide - reducedEquationSide: ' + reducedEquationSide);\\n\\n\\treturn reducedEquationSide;\\n}\",\n \"function l(e,i,n,r){function o(e,t){return 1-3*t+3*e}function a(e,t){return 3*t-6*e}function s(e){return 3*e}function l(e,t,i){return((o(t,i)*e+a(t,i))*e+s(t))*e}function c(e,t,i){return 3*o(t,i)*e*e+2*a(t,i)*e+s(t)}function u(t,i){for(var r=0;f>r;++r){var o=c(i,e,n);if(0===o)return i;var a=l(i,e,n)-t;i-=a/o}return i}function d(){for(var t=0;C>t;++t)A[t]=l(t*w,e,n)}function h(t,i,r){var o,a,s=0;do a=i+(r-i)/2,o=l(a,e,n)-t,o>0?r=a:i=a;while(Math.abs(o)>v&&++s=m?u(t,s):0==l?s:h(t,i,i+w)}function p(){S=!0,(e!=i||n!=r)&&d()}var f=4,m=.001,v=1e-7,b=10,C=11,w=1/(C-1),y=\\\"Float32Array\\\"in t;if(4!==arguments.length)return!1;for(var x=0;4>x;++x)if(\\\"number\\\"!=typeof arguments[x]||isNaN(arguments[x])||!isFinite(arguments[x]))return!1;e=Math.min(e,1),n=Math.min(n,1),e=Math.max(e,0),n=Math.max(n,0);var A=y?new Float32Array(C):new Array(C),S=!1,E=function(t){return S||p(),e===i&&n===r?t:0===t?0:1===t?1:l(g(t),i,r)};E.getControlPoints=function(){return[{x:e,y:i},{x:n,y:r}]};var _=\\\"generateBezier(\\\"+[e,i,n,r]+\\\")\\\";return E.toString=function(){return _},E}\",\n \"function operate(x, y, operator) {\\n switch (operator) {\\n case 'add':\\n return add(x, y);\\n\\n case 'subtract':\\n return subtract(x, y);\\n\\n case 'multiply':\\n return multiply(x, y);\\n \\n case 'divide':\\n return divide(x, y);\\n\\n default: \\n alert('Use numbers and declare operator');\\n };\\n}\",\n \"exec(op, { a, b, c }) {\\n switch (op) {\\n case Instr.Add:\\n this.memory[c] = this.memory[a] + this.memory[b];\\n this.ip += 4;\\n return;\\n case Instr.Mult:\\n this.memory[c] = this.memory[a] * this.memory[b];\\n this.ip += 4;\\n return;\\n case Instr.SaveInput:\\n this.memory[a] = this.input.shift();\\n this.ip += 2;\\n return;\\n case Instr.Output:\\n this.ip += 2;\\n return this.memory[a];\\n case Instr.JumpIfTrue:\\n this.ip = this.memory[a] !== 0 ? this.memory[b] : this.ip + 3;\\n return;\\n case Instr.JumpIfFalse:\\n this.ip = this.memory[a] == 0 ? this.memory[b] : this.ip + 3;\\n return;\\n case Instr.LessThan:\\n this.memory[c] = this.memory[a] < this.memory[b] ? 1 : 0;\\n this.ip += 4;\\n return;\\n case Instr.Equals:\\n this.memory[c] = this.memory[a] === this.memory[b] ? 1 : 0;\\n this.ip += 4;\\n return;\\n }\\n }\",\n \"function sum4(x, y) {\\r\\n return x + y;\\r\\n }\",\n \"function soustraction(a, b) { // Nommage de ma function\\n console.log(a - b); // Ce que la function fait\\n}\",\n \"function main() {\\n showResult(47);\\n showResult(88);\\n showResult(34);\\n showResult(3);\\n showResult(-2);\\n showResult(105);\\n}\",\n \"function sum(a, b){return a+b;}\",\n \"function calculate(){}\",\n \"function evenOddSums() {}\",\n \"function calcularOperacoes (operador1, operador2) {\\n console.log(operador1+operador2, operador1- operador2, operador1 * operador2, operador1 / operador2)\\n}\",\n \"function o0(o1)\\n{\\n var o11 = function () {\\n try {\\nreturn (this.o4 - this.o5) + \\\" (overwritten)\\\";\\n}catch(this.o665()){}\\n};\\n try {\\nfor (var o2 = 0; __defineGetter__[o1091 >> [4.4, 5.5, 6.6]]; this.o391[0xFF68] = this.o902)\\n {\\n try {\\nif (o6(o29) == \\\"this.lastOutput[\\\" + o214 + \\\"] = output\\\" + o214)\\n {\\n try {\\nif (o259[10724 >> 2] = o1098 == -1)\\n {\\n try {\\no2 = o3;\\n}catch(e){}\\n }\\n}catch(e){}\\n }\\n else\\n {\\n try {\\nif (o2 != -\\\"Array.prototype.copyWithin called on an object with length > 2^32 and a source range completely > 2^32 and destination range crossing 2^32\\\")\\n {\\n try {\\no4.o5(o2 + \\\"-\\\" + (o3-'error!') + \\\" = undefined\\\");\\n}catch(e){}\\n try {\\no421 = -1;\\n}catch(e){}\\n }\\n}catch(e){}\\n try {\\no4.o5(o3 + \\\" = \\\" + o1[o3]);\\n}catch(e){}\\n }\\n}catch(e){}\\n }\\n}catch(e){}\\n}\",\n \"function sum(a, b) {\\n return a + b; // processamento\\n}\",\n \"reduce (){\\n this.hunger -= 2\\n this.energy -= 1\\n this.hygiene -= 1\\n this.fun -= 2\\n }\",\n \"function performCalculation(arr, symbol1 = '*',symbol2 = '/'){\\n var found = false;\\n var i = 0; \\n\\n while(found === false && i < arr.length - 1){ //using < than, since the last symbol will always be a number because of the validation perfomed in the method 'calculate'\\n if(arr[i] === symbol1 || arr[i] === symbol2){\\n found = true;\\n\\n arr[i] = window[operations[arr[i]]](arr[i-1], arr[i+1])\\n arr.splice(i+1,1); arr.splice(i-1,1);\\n\\n //reccursive method to continue searching for and perform the same reccursive function only if array's length is more than 1\\n if(arr.length <= 1){\\n return arr; //the result\\n } else {\\n return performCalculation(arr,symbol1,symbol2)\\n }\\n } \\n i++; \\n }\\n\\n // this means that this round of the while loop did not find any * or / operations, time to move to + and -\\n return performCalculation(arr,'+','-');\\n\\n}\",\n \"function eGCD_(x,y,v,a,b) {\\n var g=0;\\n var k=Math.max(x.length,y.length);\\n if (eg_u.length!=k) {\\n eg_u=new Array(k);\\n eg_A=new Array(k);\\n eg_B=new Array(k);\\n eg_C=new Array(k);\\n eg_D=new Array(k);\\n }\\n while(!(x[0]&1) && !(y[0]&1)) { //while x and y both even\\n halve_(x);\\n halve_(y);\\n g++;\\n }\\n copy_(eg_u,x);\\n copy_(v,y);\\n copyInt_(eg_A,1);\\n copyInt_(eg_B,0);\\n copyInt_(eg_C,0);\\n copyInt_(eg_D,1);\\n for (;;) {\\n while(!(eg_u[0]&1)) { //while u is even\\n halve_(eg_u);\\n if (!(eg_A[0]&1) && !(eg_B[0]&1)) { //if A==B==0 mod 2\\n halve_(eg_A);\\n halve_(eg_B); \\n } else {\\n add_(eg_A,y); halve_(eg_A);\\n sub_(eg_B,x); halve_(eg_B);\\n }\\n }\\n\\n while (!(v[0]&1)) { //while v is even\\n halve_(v);\\n if (!(eg_C[0]&1) && !(eg_D[0]&1)) { //if C==D==0 mod 2\\n halve_(eg_C);\\n halve_(eg_D); \\n } else {\\n add_(eg_C,y); halve_(eg_C);\\n sub_(eg_D,x); halve_(eg_D);\\n }\\n }\\n\\n if (!greater(v,eg_u)) { //v<=u\\n sub_(eg_u,v);\\n sub_(eg_A,eg_C);\\n sub_(eg_B,eg_D);\\n } else { //v>u\\n sub_(v,eg_u);\\n sub_(eg_C,eg_A);\\n sub_(eg_D,eg_B);\\n }\\n if (equalsInt(eg_u,0)) {\\n while (negative(eg_C)) { //make sure a (C) is nonnegative\\n add_(eg_C,y);\\n sub_(eg_D,x);\\n }\\n multInt_(eg_D,-1); ///make sure b (D) is nonnegative\\n copy_(a,eg_C);\\n copy_(b,eg_D);\\n leftShift_(v,g);\\n return;\\n }\\n }\\n }\",\n \"function Addition(a, b) {\\n return a + b;\\n}\",\n \"function order_of_operations(array) {\\n var no_more_parentheses = false;\\n var open_p_lastIndexOf = array.lastIndexOf(\\\"(\\\");\\n if (open_p_lastIndexOf < 0) {\\n open_p_lastIndexOf = 0;\\n no_more_parentheses = true;\\n }\\n var close_p_indexOf = array.indexOf(\\\")\\\", open_p_lastIndexOf);\\n if (close_p_indexOf < 0) {\\n close_p_indexOf = 100000000;\\n }\\n var working_array = array.slice(open_p_lastIndexOf + 1, close_p_indexOf);\\n if (working_array.length == 1) {\\n console.log(\\\"before splice:\\\", equation_array)\\n equation_array.splice(open_p_lastIndexOf, 1);\\n equation_array.splice(open_p_lastIndexOf + 1, 1)\\n open_p_lastIndexOf = 0;\\n close_p_indexOf = 100000000;\\n console.log(\\\"after splice:\\\", equation_array)\\n }\\n\\n var percentage_indexOf = array.indexOf(\\\"%\\\", open_p_lastIndexOf);\\n var exponent_indexOf = array.indexOf(\\\"^\\\", open_p_lastIndexOf);\\n var mult_indexOf = array.indexOf(\\\"x\\\", open_p_lastIndexOf);\\n var divid_indexOf = array.indexOf(\\\"/\\\", open_p_lastIndexOf);\\n var add_indexOf = array.indexOf(\\\"+\\\", open_p_lastIndexOf);\\n var sub_indexOf = array.indexOf(\\\"-\\\", open_p_lastIndexOf);\\n var done = false;\\n\\n\\n if (percentage_indexOf >= 0 && percentage_indexOf < close_p_indexOf) {\\n ordered_index = percentage_indexOf;\\n return;\\n }\\n else if (exponent_indexOf >= 0 && exponent_indexOf < close_p_indexOf) {\\n ordered_index = exponent_indexOf;\\n return;\\n }\\n else if (mult_indexOf >= 0 && mult_indexOf < close_p_indexOf) {\\n ordered_index = mult_indexOf;\\n return;\\n }\\n else if (divid_indexOf >= 0 && divid_indexOf < close_p_indexOf) {\\n ordered_index = divid_indexOf;\\n return;\\n }\\n else if (add_indexOf >= 0 && add_indexOf < close_p_indexOf) {\\n ordered_index = add_indexOf;\\n return;\\n }\\n else if (sub_indexOf >= 0 && sub_indexOf < close_p_indexOf) {\\n ordered_index = sub_indexOf;\\n return;\\n }\\n else {\\n return done = true;\\n }\\n\\n if (!done && no_more_parentheses) {\\n return done = false;\\n }\\n\\n}\",\n \"function s_array_op(arr1, arr2, what_to_do, sort_function)\\n{\\n\\t// http://stackoverflow.com/questions/10866756/fast-intersection-of-two-sorted-integer-arrays\\n\\t\\n\\tif (!isArray(arr1) || !isArray(arr2))\\n\\t\\treturn [];\\n\\t// need at least one to be be longer than zero\\n\\tif (arr1.length == 0 && arr2.length == 0)\\n\\t\\treturn [];\\n\\t\\t\\n\\t// intersection check that both are longer than zero\\n\\tif (what_to_do == \\\"i\\\" && (arr1.length == 0 || arr2.length == 0))\\n\\t\\treturn [];\\n\\t\\t\\n\\t// counters\\n\\tvar i=0, j=0;\\n\\t// values\\n\\tvar a=0, b=0;\\n\\t\\n\\tvar out = [];\\n\\t\\n\\t// comparison function\\n\\tvar the_compare;\\n\\tif (typeof(sort_function) != \\\"function\\\")\\n\\t\\tthe_compare = function(a1,b1) { return [a1,b1].sort()[0] == a1 ? -1 : 1; };\\n\\telse\\n\\t\\tthe_compare = sort_function;\\n\\t// push functions\\n\\tvar eq_push;\\n\\tvar lt_push;\\n\\tvar gte_push;\\n\\t\\n\\tswitch(what_to_do)\\n\\t{\\n\\t\\tcase \\\"i\\\":\\n\\t\\t\\teq_push = function(in1) { return out.push(in1); };\\n\\t\\t\\tlt_push = function() { return; };\\n\\t\\t\\tgte_push = function() { return; };\\n\\t\\tbreak;\\n\\t\\tcase \\\"u\\\":\\n\\t\\t\\teq_push = function(in1) { return out.push(in1); };\\n\\t\\t\\tlt_push = function(in1) { return out.push(in1); };\\n\\t\\t\\tgte_push = function(in1) { return out.push(in1); };\\n\\t\\tbreak;\\n\\t\\tcase \\\"x\\\":\\n\\t\\t\\teq_push = function() { return; };\\n\\t\\t\\tlt_push = function(in1) { return out.push(in1); };\\n\\t\\t\\tgte_push = function(in1) { return out.push(in1); };\\n\\t\\tbreak;\\n\\t\\tdefault:\\n\\t\\t\\treturn [];\\n\\t}\\n\\t\\n\\t// the continues should speed up execution ...\\n\\twhile (i < arr1.length && j < arr2.length)\\n\\t{\\n\\t\\ta = arr1[i];\\n\\t\\tb = arr2[j];\\n\\t\\t\\n\\t\\tif (a === b)\\n\\t\\t{\\n\\t\\t\\teq_push(a);\\n\\t\\t\\ti++;\\n\\t\\t\\tj++;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t// a < b\\n\\t\\telse if (the_compare(a,b) == -1)\\n\\t\\t{\\n\\t\\t\\tlt_push(a);\\n\\t\\t\\ti++;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tgte_push(b);\\n\\t\\t\\tj++;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tif (what_to_do == \\\"u\\\" || what_to_do == \\\"x\\\")\\n\\t{\\n\\t\\t// add any remainders\\n\\t\\tfor (; i> 16) + (y >> 16) + (lsw >> 16)\n return (msw << 16) | (lsw & 0xFFFF)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n }","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n }","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n}","function add32(a, b) {\n return a + b & 0xFFFFFFFF;\n }","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n }","function add32(a, b) {\nreturn (a + b) & 0xFFFFFFFF;\n}","function add32(a, b) {\nreturn (a + b) & 0xFFFFFFFF;\n}","function unsigned32Add(){\n\treturn Array.from(arguments).reduce(function (a, b){\n\t\treturn ((a >>> 0) + (b >>> 0)) >>> 0;\n\t}, 0);\n}","function add32(a, b) {\n\treturn (a + b) & 0xFFFFFFFF;\n}","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF\n}","function add32(a, b) {\n return a + b & 0xFFFFFFFF;\n}","function add32(a, b) {\n return a + b & 0xFFFFFFFF;\n}","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n }","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n }","function add32(a, b) {\n return (a + b) & 0xFFFFFFFF;\n }","function add32(a, b) {\n return ((a + b) & ~0) >>> 0;\n}","function radix16_sum32() {\n\tfor (let j = 0; j < 2; j++) {\n\t\tconst iStart = (j << 8),\n\t\t\tiEnd = ((j + 1) << 8);\n\t\tfor (let i = iStart, v = 0, sum = 0; i < iEnd; i++) {\n\t\t\tv = count32[i];\n\t\t\tcount32[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count32[i];\n\t\t\tcount32[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count32[i];\n\t\t\tcount32[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count32[i];\n\t\t\tcount32[i] = sum;\n\t\t\tsum += v;\n\t\t}\n\t}\n}","function safeAdd_32 (x, y)\n\t{\n\t\tvar lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t\tvar msw = (x >>> 16) + (y >>> 16) + (lsw >>> 16);\n\n\t\treturn ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);\n\t}","add(addend) {\n if (!Long.isLong(addend))\n addend = Long.fromValue(addend);\n // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\n const a48 = this.high >>> 16;\n const a32 = this.high & 0xffff;\n const a16 = this.low >>> 16;\n const a00 = this.low & 0xffff;\n const b48 = addend.high >>> 16;\n const b32 = addend.high & 0xffff;\n const b16 = addend.low >>> 16;\n const b00 = addend.low & 0xffff;\n let c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n c00 += a00 + b00;\n c16 += c00 >>> 16;\n c00 &= 0xffff;\n c16 += a16 + b16;\n c32 += c16 >>> 16;\n c16 &= 0xffff;\n c32 += a32 + b32;\n c48 += c32 >>> 16;\n c32 &= 0xffff;\n c48 += a48 + b48;\n c48 &= 0xffff;\n return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n }","function radix32_sum32() {\n\tfor (let j = 0; j < 4; j++) {\n\t\tconst iStart = (j << 8),\n\t\t\tiEnd = ((j + 1) << 8);\n\t\tfor (let i = iStart, v = 0, sum = 0; i < iEnd; i++) {\n\t\t\tv = count32[i];\n\t\t\tcount32[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count32[i];\n\t\t\tcount32[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count32[i];\n\t\t\tcount32[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count32[i];\n\t\t\tcount32[i] = sum;\n\t\t\tsum += v;\n\t\t}\n\t}\n}","function radix32_sum16() {\n\tfor (let j = 0; j < 4; j++) {\n\t\tconst iStart = (j << 8),\n\t\t\tiEnd = ((j + 1) << 8);\n\t\tfor (let i = iStart, v = 0, sum = 0; i < iEnd; i++) {\n\t\t\tv = count16[i];\n\t\t\tcount16[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count16[i];\n\t\t\tcount16[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count16[i];\n\t\t\tcount16[i++] = sum;\n\t\t\tsum += v;\n\t\t\tv = count16[i];\n\t\t\tcount16[i] = sum;\n\t\t\tsum += v;\n\t\t}\n\t}\n}","function add16(a, b) {\n return (a + b) & 0xFFFF;\n}","function add16(a, b) {\n return (a + b) & 0xFFFF;\n}","function safe_add(x,y){var lsw=(x&0xFFFF)+(y&0xFFFF);var msw=(x>>16)+(y>>16)+(lsw>>16);return msw<<16|lsw&0xFFFF;}","function safe_add(x,y){var lsw=(x&0xFFFF)+(y&0xFFFF);var msw=(x>>16)+(y>>16)+(lsw>>16);return msw<<16|lsw&0xFFFF;}","function bigint_add(base, rh) {\n var carry = false;\n for (var i = 0; i < base.length; i++) {\n var vc = full_add(base[i], rh[i], carry);\n base[i] = vc[0];\n carry = vc[1];\n }\n}","function safeAdd(x,y){var lsw=(x&0xffff)+(y&0xffff);var msw=(x>>16)+(y>>16)+(lsw>>16);return msw<<16|lsw&0xffff;}","function safe_add(x, y) \n{ \nvar lsw = (x & 0xFFFF) + (y & 0xFFFF); \nvar msw = (x >> 16) + (y >> 16) + (lsw >> 16); \nreturn (msw << 16) | (lsw & 0xFFFF); \n}","function safe_add(x : number, y : number) : number\n {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n }","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n}","function x64_add(a, b){\n\t\tvar A0 = a[0] & 0xFFFF; // lowest 16 bits\n\t\tvar A1 = a[0] >>> 16; // ...\n\t\tvar A2 = a[1] & 0xFFFF; // ...\n\t\tvar A3 = a[1] >>> 16; // highest 16 bits\n\t\tvar B0 = b[0] & 0xFFFF;\n\t\tvar B1 = b[0] >>> 16;\n\t\tvar B2 = b[1] & 0xFFFF;\n\t\tvar B3 = b[1] >>> 16;\n\t\tvar R0 = A0 + B0;\n\t\tvar R1 = A1 + B1 + (R0 >> 16);\n\t\tvar R2 = A2 + B2 + (R1 >> 16);\n\t\tvar R3 = A3 + B3 + (R2 >> 16);\n\t\treturn [(R0 & 0xFFFF) | ((R1 & 0xFFFF) << 16), (R2 & 0xFFFF) | ((R3 & 0xFFFF) << 16)];\n\t}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function safe_add(x, y) \n{ \n var lsw = (x & 0xFFFF) + (y & 0xFFFF) \n var msw = (x >> 16) + (y >> 16) + (lsw >> 16) \n return (msw << 16) | (lsw & 0xFFFF) \n}","function safe_add$1(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n }","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function safeAdd(x, y) {\n var lsw = (x & 0xffff) + (y & 0xffff);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xffff;\n}","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function add(x, y) {\n return (x + y ) | 0\n //lets see how this goes on testling.\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n // return (msw << 16) | (lsw & 0xFFFF);\n }","function safeAdd(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n }","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n }","function addInt_(x, n) {\n var i, k, c, b;\n x[0] += n;\n k = x.length;\n c = 0;\n for (i = 0; i < k; i++) {\n c += x[i];\n b = 0;\n if (c < 0) {\n b = -(c >> bpe);\n c += b * radix;\n }\n x[i] = c & mask;\n c = (c >> bpe) - b;\n if (!c) return; //stop carrying as soon as the carry is zero\n }\n }","function ADD64AA (v, a, b) {\n const o0 = v[a] + v[b]\n let o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}","function safe_add(x, y) {\n\t var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t return msw << 16 | lsw & 0xFFFF;\n\t}","function safe_add(x, y) {\n\t var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t return msw << 16 | lsw & 0xFFFF;\n\t}","function add(x, y) {\r\n return (x + y ) | 0\r\n //lets see how this goes on testling.\r\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n // return (msw << 16) | (lsw & 0xFFFF);\r\n }","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n}","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n}","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n}","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n}","function safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n}","function safe_add(x, y)\n{\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n}","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function add(x, y) {\n\t return (x + y ) | 0\n\t //lets see how this goes on testling.\n\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n\t // return (msw << 16) | (lsw & 0xFFFF);\n\t }","function safe_add(x, y)\n{\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n}","function safe_add(x, y)\n{\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n}","function safe_add(x, y)\n{\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n}","function safe_add(x, y)\n{\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n}"],"string":"[\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n}\",\n \"function add32(a, b) {\\n return a + b & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\nreturn (a + b) & 0xFFFFFFFF;\\n}\",\n \"function add32(a, b) {\\nreturn (a + b) & 0xFFFFFFFF;\\n}\",\n \"function unsigned32Add(){\\n\\treturn Array.from(arguments).reduce(function (a, b){\\n\\t\\treturn ((a >>> 0) + (b >>> 0)) >>> 0;\\n\\t}, 0);\\n}\",\n \"function add32(a, b) {\\n\\treturn (a + b) & 0xFFFFFFFF;\\n}\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF\\n}\",\n \"function add32(a, b) {\\n return a + b & 0xFFFFFFFF;\\n}\",\n \"function add32(a, b) {\\n return a + b & 0xFFFFFFFF;\\n}\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\n return (a + b) & 0xFFFFFFFF;\\n }\",\n \"function add32(a, b) {\\n return ((a + b) & ~0) >>> 0;\\n}\",\n \"function radix16_sum32() {\\n\\tfor (let j = 0; j < 2; j++) {\\n\\t\\tconst iStart = (j << 8),\\n\\t\\t\\tiEnd = ((j + 1) << 8);\\n\\t\\tfor (let i = iStart, v = 0, sum = 0; i < iEnd; i++) {\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t}\\n\\t}\\n}\",\n \"function safeAdd_32 (x, y)\\n\\t{\\n\\t\\tvar lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t\\tvar msw = (x >>> 16) + (y >>> 16) + (lsw >>> 16);\\n\\n\\t\\treturn ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);\\n\\t}\",\n \"add(addend) {\\n if (!Long.isLong(addend))\\n addend = Long.fromValue(addend);\\n // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\\n const a48 = this.high >>> 16;\\n const a32 = this.high & 0xffff;\\n const a16 = this.low >>> 16;\\n const a00 = this.low & 0xffff;\\n const b48 = addend.high >>> 16;\\n const b32 = addend.high & 0xffff;\\n const b16 = addend.low >>> 16;\\n const b00 = addend.low & 0xffff;\\n let c48 = 0, c32 = 0, c16 = 0, c00 = 0;\\n c00 += a00 + b00;\\n c16 += c00 >>> 16;\\n c00 &= 0xffff;\\n c16 += a16 + b16;\\n c32 += c16 >>> 16;\\n c16 &= 0xffff;\\n c32 += a32 + b32;\\n c48 += c32 >>> 16;\\n c32 &= 0xffff;\\n c48 += a48 + b48;\\n c48 &= 0xffff;\\n return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\\n }\",\n \"function radix32_sum32() {\\n\\tfor (let j = 0; j < 4; j++) {\\n\\t\\tconst iStart = (j << 8),\\n\\t\\t\\tiEnd = ((j + 1) << 8);\\n\\t\\tfor (let i = iStart, v = 0, sum = 0; i < iEnd; i++) {\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count32[i];\\n\\t\\t\\tcount32[i] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t}\\n\\t}\\n}\",\n \"function radix32_sum16() {\\n\\tfor (let j = 0; j < 4; j++) {\\n\\t\\tconst iStart = (j << 8),\\n\\t\\t\\tiEnd = ((j + 1) << 8);\\n\\t\\tfor (let i = iStart, v = 0, sum = 0; i < iEnd; i++) {\\n\\t\\t\\tv = count16[i];\\n\\t\\t\\tcount16[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count16[i];\\n\\t\\t\\tcount16[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count16[i];\\n\\t\\t\\tcount16[i++] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t\\tv = count16[i];\\n\\t\\t\\tcount16[i] = sum;\\n\\t\\t\\tsum += v;\\n\\t\\t}\\n\\t}\\n}\",\n \"function add16(a, b) {\\n return (a + b) & 0xFFFF;\\n}\",\n \"function add16(a, b) {\\n return (a + b) & 0xFFFF;\\n}\",\n \"function safe_add(x,y){var lsw=(x&0xFFFF)+(y&0xFFFF);var msw=(x>>16)+(y>>16)+(lsw>>16);return msw<<16|lsw&0xFFFF;}\",\n \"function safe_add(x,y){var lsw=(x&0xFFFF)+(y&0xFFFF);var msw=(x>>16)+(y>>16)+(lsw>>16);return msw<<16|lsw&0xFFFF;}\",\n \"function bigint_add(base, rh) {\\n var carry = false;\\n for (var i = 0; i < base.length; i++) {\\n var vc = full_add(base[i], rh[i], carry);\\n base[i] = vc[0];\\n carry = vc[1];\\n }\\n}\",\n \"function safeAdd(x,y){var lsw=(x&0xffff)+(y&0xffff);var msw=(x>>16)+(y>>16)+(lsw>>16);return msw<<16|lsw&0xffff;}\",\n \"function safe_add(x, y) \\n{ \\nvar lsw = (x & 0xFFFF) + (y & 0xFFFF); \\nvar msw = (x >> 16) + (y >> 16) + (lsw >> 16); \\nreturn (msw << 16) | (lsw & 0xFFFF); \\n}\",\n \"function safe_add(x : number, y : number) : number\\n {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n}\",\n \"function x64_add(a, b){\\n\\t\\tvar A0 = a[0] & 0xFFFF; // lowest 16 bits\\n\\t\\tvar A1 = a[0] >>> 16; // ...\\n\\t\\tvar A2 = a[1] & 0xFFFF; // ...\\n\\t\\tvar A3 = a[1] >>> 16; // highest 16 bits\\n\\t\\tvar B0 = b[0] & 0xFFFF;\\n\\t\\tvar B1 = b[0] >>> 16;\\n\\t\\tvar B2 = b[1] & 0xFFFF;\\n\\t\\tvar B3 = b[1] >>> 16;\\n\\t\\tvar R0 = A0 + B0;\\n\\t\\tvar R1 = A1 + B1 + (R0 >> 16);\\n\\t\\tvar R2 = A2 + B2 + (R1 >> 16);\\n\\t\\tvar R3 = A3 + B3 + (R2 >> 16);\\n\\t\\treturn [(R0 & 0xFFFF) | ((R1 & 0xFFFF) << 16), (R2 & 0xFFFF) | ((R3 & 0xFFFF) << 16)];\\n\\t}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function ADD64AA (v, a, b) {\\n var o0 = v[a] + v[b]\\n var o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function safe_add(x, y) \\n{ \\n var lsw = (x & 0xFFFF) + (y & 0xFFFF) \\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16) \\n return (msw << 16) | (lsw & 0xFFFF) \\n}\",\n \"function safe_add$1(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n }\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xffff) + (y & 0xffff);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xffff;\\n}\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function add(x, y) {\\n return (x + y ) | 0\\n //lets see how this goes on testling.\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n // return (msw << 16) | (lsw & 0xFFFF);\\n }\",\n \"function safeAdd(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n }\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y)\\r\\n{\\r\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n return (msw << 16) | (lsw & 0xFFFF);\\r\\n}\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n }\",\n \"function addInt_(x, n) {\\n var i, k, c, b;\\n x[0] += n;\\n k = x.length;\\n c = 0;\\n for (i = 0; i < k; i++) {\\n c += x[i];\\n b = 0;\\n if (c < 0) {\\n b = -(c >> bpe);\\n c += b * radix;\\n }\\n x[i] = c & mask;\\n c = (c >> bpe) - b;\\n if (!c) return; //stop carrying as soon as the carry is zero\\n }\\n }\",\n \"function ADD64AA (v, a, b) {\\n const o0 = v[a] + v[b]\\n let o1 = v[a + 1] + v[b + 1]\\n if (o0 >= 0x100000000) {\\n o1++\\n }\\n v[a] = o0\\n v[a + 1] = o1\\n}\",\n \"function safe_add(x, y) {\\n\\t var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t return msw << 16 | lsw & 0xFFFF;\\n\\t}\",\n \"function safe_add(x, y) {\\n\\t var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t return msw << 16 | lsw & 0xFFFF;\\n\\t}\",\n \"function add(x, y) {\\r\\n return (x + y ) | 0\\r\\n //lets see how this goes on testling.\\r\\n // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\r\\n // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\r\\n // return (msw << 16) | (lsw & 0xFFFF);\\r\\n }\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n}\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n}\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n}\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n}\",\n \"function safe_add(x, y) {\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return msw << 16 | lsw & 0xFFFF;\\n}\",\n \"function safe_add(x, y)\\n{\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n}\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function add(x, y) {\\n\\t return (x + y ) | 0\\n\\t //lets see how this goes on testling.\\n\\t // var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n\\t // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n\\t // return (msw << 16) | (lsw & 0xFFFF);\\n\\t }\",\n \"function safe_add(x, y)\\n{\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n}\",\n \"function safe_add(x, y)\\n{\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n}\",\n \"function safe_add(x, y)\\n{\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n}\",\n \"function safe_add(x, y)\\n{\\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.77990013","0.77990013","0.7757441","0.7740754","0.7736016","0.77296126","0.77296126","0.77224797","0.77194643","0.769616","0.76924163","0.76924163","0.76805955","0.76805955","0.76805955","0.7522335","0.7448978","0.7289236","0.7154131","0.7140704","0.7063321","0.7056442","0.7056442","0.69981897","0.69981897","0.6992814","0.69324285","0.6871048","0.68367624","0.68357146","0.681872","0.6795246","0.6795246","0.6795246","0.6795246","0.6795246","0.6795246","0.6795246","0.6795246","0.67848396","0.6760587","0.6759224","0.6759224","0.6759224","0.6759224","0.6759224","0.6759224","0.6759224","0.6759224","0.67570204","0.67570204","0.67570204","0.67570204","0.67570204","0.67570204","0.67570204","0.6750503","0.67458516","0.67458516","0.67458516","0.67458516","0.67458516","0.67458516","0.67458516","0.67458516","0.67458516","0.67458516","0.6743335","0.6743034","0.67405033","0.6737645","0.6737645","0.67368656","0.6729709","0.6729709","0.6729709","0.6729709","0.6729709","0.6728517","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.6726645","0.67201966","0.67201966","0.67201966","0.67201966"],"string":"[\n \"0.77990013\",\n \"0.77990013\",\n \"0.7757441\",\n \"0.7740754\",\n \"0.7736016\",\n \"0.77296126\",\n \"0.77296126\",\n \"0.77224797\",\n \"0.77194643\",\n \"0.769616\",\n \"0.76924163\",\n \"0.76924163\",\n \"0.76805955\",\n \"0.76805955\",\n \"0.76805955\",\n \"0.7522335\",\n \"0.7448978\",\n \"0.7289236\",\n \"0.7154131\",\n \"0.7140704\",\n \"0.7063321\",\n \"0.7056442\",\n \"0.7056442\",\n \"0.69981897\",\n \"0.69981897\",\n \"0.6992814\",\n \"0.69324285\",\n \"0.6871048\",\n \"0.68367624\",\n \"0.68357146\",\n \"0.681872\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.6795246\",\n \"0.67848396\",\n \"0.6760587\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.6759224\",\n \"0.67570204\",\n \"0.67570204\",\n \"0.67570204\",\n \"0.67570204\",\n \"0.67570204\",\n \"0.67570204\",\n \"0.67570204\",\n \"0.6750503\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.67458516\",\n \"0.6743335\",\n \"0.6743034\",\n \"0.67405033\",\n \"0.6737645\",\n \"0.6737645\",\n \"0.67368656\",\n \"0.6729709\",\n \"0.6729709\",\n \"0.6729709\",\n \"0.6729709\",\n \"0.6729709\",\n \"0.6728517\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.6726645\",\n \"0.67201966\",\n \"0.67201966\",\n \"0.67201966\",\n \"0.67201966\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80792,"cells":{"query":{"kind":"string","value":"Bitwise rotate a 32bit number to the left."},"document":{"kind":"string","value":"function bit_rol (num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt))\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function bitRotateLeft(num,cnt){return num<>>32-cnt;}","function bitRotateLeft (num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt))\n }","function bitRotateLeft (num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt))\n }","function bitRotateLeft (num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt))\n }","function bitRotateLeft (num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt))\n }","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}","function bitRotateLeft(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n }","function bitRotateLeft (num, cnt) {\r\n return (num << cnt) | (num >>> (32 - cnt))\r\n }","function bitRotateLeft(num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt))\n}","rotateLeft(n) {\n if (n < 32) {\n\n var lower = ((this.lower << n | this.upper >>> (32 - n))) & (0xFFFFFFFF);\n var upper = ((this.upper << n | this.lower >>> (32 - n))) & (0xFFFFFFFF);\n return new jsLong(upper, lower);\n }\n\n if (n >= 32) {\n n -= 32;\n var lower = ((this.upper << n | this.lower >>> (32 - n))) & (0xFFFFFFFF);\n var upper = ((this.lower << n | this.upper >>> (32 - n))) & (0xFFFFFFFF);\n return new jsLong(upper, lower);\n }\n }","function rotateLeft(x, n){\n\tif(n != Math.floor(n) || n < 0){\n\t\tthrow 'Invalid argument (n): requires positive integer'\n\t}\n\n\treturn ((x << n) | (x >>> (32 - n))) >>> 0;\n}","static rot_4bit_left( shift, v ){ return ((v << shift) & 15) | (v & 15) >> (4-shift); }","function rot32b_L(x, count) {\n\treturn (x << count) | (x >>> (32 - count));\n}","function bit_rol(num,cnt){return num<>>32-cnt;}","function bit_rol(num,cnt){return num<>>32-cnt;}","function bit_rol(num,cnt){return (num << cnt) | (num >>> (32 - cnt));}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function rol32(a, count) {\n return (a << count) | (a >>> (32 - count));\n}","function bit_rol(num, cnt) \n{ \nreturn (num << cnt) | (num >>> (32 - cnt)); \n}","function rol(num, cnt) \n{ \n return (num << cnt) | (num >>> (32 - cnt)) \n}","static rotate(value, bits) {\r\n return (value << bits) | (value >>> (32 - bits));\r\n }","function bit_rol(num, cnt) {\r\n\t\t return (num << cnt) | (num >>> (32 - cnt));\r\n\t\t }","function rol(num, cnt) {\n return (num << cnt) | (num >>> (32 - cnt));\n}","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function rol(num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt));\n\t }","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}","function bit_rol(num : number, cnt : number) : number\n {\n return (num << cnt) | (num >>> (32 - cnt));\n }","function bit_rol (num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt))\n\t }","function bit_rol (num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt))\n\t }","function bit_rol (num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt))\n\t }","function bit_rol (num, cnt) {\n\t return (num << cnt) | (num >>> (32 - cnt))\n\t }","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}","function bit_rol(num, cnt)\n{\n return (num << cnt) | (num >>> (32 - cnt));\n}"],"string":"[\n \"function bitRotateLeft(num,cnt){return num<>>32-cnt;}\",\n \"function bitRotateLeft (num, cnt) {\\n return (num << cnt) | (num >>> (32 - cnt))\\n }\",\n \"function bitRotateLeft (num, cnt) {\\n return (num << cnt) | (num >>> (32 - cnt))\\n }\",\n \"function bitRotateLeft (num, cnt) {\\n return (num << cnt) | (num >>> (32 - cnt))\\n }\",\n \"function bitRotateLeft (num, cnt) {\\n return (num << cnt) | (num >>> (32 - cnt))\\n }\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n}\",\n \"function bitRotateLeft(num, cnt) {\\n return num << cnt | num >>> 32 - cnt;\\n }\",\n \"function bitRotateLeft (num, cnt) {\\r\\n return (num << cnt) | (num >>> (32 - cnt))\\r\\n }\",\n \"function bitRotateLeft(num, cnt) {\\n return (num << cnt) | (num >>> (32 - cnt))\\n}\",\n \"rotateLeft(n) {\\n if (n < 32) {\\n\\n var lower = ((this.lower << n | this.upper >>> (32 - n))) & (0xFFFFFFFF);\\n var upper = ((this.upper << n | this.lower >>> (32 - n))) & (0xFFFFFFFF);\\n return new jsLong(upper, lower);\\n }\\n\\n if (n >= 32) {\\n n -= 32;\\n var lower = ((this.upper << n | this.lower >>> (32 - n))) & (0xFFFFFFFF);\\n var upper = ((this.lower << n | this.upper >>> (32 - n))) & (0xFFFFFFFF);\\n return new jsLong(upper, lower);\\n }\\n }\",\n \"function rotateLeft(x, n){\\n\\tif(n != Math.floor(n) || n < 0){\\n\\t\\tthrow 'Invalid argument (n): requires positive integer'\\n\\t}\\n\\n\\treturn ((x << n) | (x >>> (32 - n))) >>> 0;\\n}\",\n \"static rot_4bit_left( shift, v ){ return ((v << shift) & 15) | (v & 15) >> (4-shift); }\",\n \"function rot32b_L(x, count) {\\n\\treturn (x << count) | (x >>> (32 - count));\\n}\",\n \"function bit_rol(num,cnt){return num<>>32-cnt;}\",\n \"function bit_rol(num,cnt){return num<>>32-cnt;}\",\n \"function bit_rol(num,cnt){return (num << cnt) | (num >>> (32 - cnt));}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function rol32(a, count) {\\n return (a << count) | (a >>> (32 - count));\\n}\",\n \"function bit_rol(num, cnt) \\n{ \\nreturn (num << cnt) | (num >>> (32 - cnt)); \\n}\",\n \"function rol(num, cnt) \\n{ \\n return (num << cnt) | (num >>> (32 - cnt)) \\n}\",\n \"static rotate(value, bits) {\\r\\n return (value << bits) | (value >>> (32 - bits));\\r\\n }\",\n \"function bit_rol(num, cnt) {\\r\\n\\t\\t return (num << cnt) | (num >>> (32 - cnt));\\r\\n\\t\\t }\",\n \"function rol(num, cnt) {\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function rol(num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt));\\n\\t }\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num, cnt)\\r\\n{\\r\\n return (num << cnt) | (num >>> (32 - cnt));\\r\\n}\",\n \"function bit_rol(num : number, cnt : number) : number\\n {\\n return (num << cnt) | (num >>> (32 - cnt));\\n }\",\n \"function bit_rol (num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt))\\n\\t }\",\n \"function bit_rol (num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt))\\n\\t }\",\n \"function bit_rol (num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt))\\n\\t }\",\n \"function bit_rol (num, cnt) {\\n\\t return (num << cnt) | (num >>> (32 - cnt))\\n\\t }\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\",\n \"function bit_rol(num, cnt)\\n{\\n return (num << cnt) | (num >>> (32 - cnt));\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.87508583","0.8438198","0.8438198","0.8438198","0.8438198","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8341921","0.8334637","0.83200794","0.8303131","0.78028613","0.772624","0.77101445","0.7570813","0.7397471","0.7397471","0.73963314","0.73750615","0.73750615","0.73750615","0.73750615","0.73750615","0.73750615","0.73750615","0.72805834","0.72359073","0.72349817","0.7171933","0.716322","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.7144939","0.71380234","0.71380234","0.71380234","0.71380234","0.71380234","0.71380234","0.71380234","0.71380234","0.71380234","0.71286684","0.7127272","0.7127272","0.7127272","0.7127272","0.71240675","0.7116279","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115","0.71139115"],"string":"[\n \"0.87508583\",\n \"0.8438198\",\n \"0.8438198\",\n \"0.8438198\",\n \"0.8438198\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8341921\",\n \"0.8334637\",\n \"0.83200794\",\n \"0.8303131\",\n \"0.78028613\",\n \"0.772624\",\n \"0.77101445\",\n \"0.7570813\",\n \"0.7397471\",\n \"0.7397471\",\n \"0.73963314\",\n \"0.73750615\",\n \"0.73750615\",\n \"0.73750615\",\n \"0.73750615\",\n \"0.73750615\",\n \"0.73750615\",\n \"0.73750615\",\n \"0.72805834\",\n \"0.72359073\",\n \"0.72349817\",\n \"0.7171933\",\n \"0.716322\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.7144939\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71380234\",\n \"0.71286684\",\n \"0.7127272\",\n \"0.7127272\",\n \"0.7127272\",\n \"0.7127272\",\n \"0.71240675\",\n \"0.7116279\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\",\n \"0.71139115\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80793,"cells":{"query":{"kind":"string","value":"Represent num in a wNAF form"},"document":{"kind":"string","value":"function getNAF(num, w) {\n var naf = [];\n var ws = 1 << (w + 1);\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n for (var i = 1; i < shift; i++)\n naf.push(0);\n k.iushrn(shift);\n }\n\n return naf;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function toUnformattedNF()\n{\n\treturn (this.num);\n}","function getNAF(num,w){var naf=[];var ws=1<=0){var z;if(k.isOdd()){var mod=k.andln(ws-1);if(mod>(ws>>1)-1)z=(ws>>1)-mod;else z=mod;k.isubn(z);}else{z=0;}naf.push(z);// Optimization, shift by word if possible\nvar shift=k.cmpn(0)!==0&&k.andln(ws-1)===0?w+1:1;for(var i=1;i=0){var z;if(k.isOdd()){var mod=k.andln(ws-1);if(mod>(ws>>1)-1)z=(ws>>1)-mod;else z=mod;k.isubn(z);}else{z=0;}naf.push(z);// Optimization, shift by word if possible\nvar shift=k.cmpn(0)!==0&&k.andln(ws-1)===0?w+1:1;for(var i=1;i= 1000000000) {\n\t\treturn (num / 1000000000).toFixed(1).replace(/\\.0$/, '') + ' B';\n\t}\n\tif (num >= 1000000) {\n\t\treturn (num / 1000000).toFixed(1).replace(/\\.0$/, '') + ' M';\n\t}\n\tif (num >= 1000) {\n\t\treturn (num / 1000).toFixed(1).replace(/\\.0$/, '') + ' K';\n\t}\n\treturn num;\n}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << w + 1;\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\n for (var i = 1; i < shift; i++) naf.push(0);\n k.iushrn(shift);\n }\n\n return naf;\n }","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << w + 1;\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\n for (var i = 1; i < shift; i++) {\n naf.push(0);\n }k.ishrn(shift);\n }\n\n return naf;\n}","function glslifyNumber (n) {\n return n === (n | 0) ? n + '.0' : n + '';\n }","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << w + 1;\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\n for (var i = 1; i < shift; i++) {\n naf.push(0);\n }k.iushrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << w + 1;\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\n for (var i = 1; i < shift; i++) {\n naf.push(0);\n }k.iushrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n\t var naf = [];\n\t var ws = 1 << (w + 1);\n\t var k = num.clone();\n\t while (k.cmpn(1) >= 0) {\n\t var z;\n\t if (k.isOdd()) {\n\t var mod = k.andln(ws - 1);\n\t if (mod > (ws >> 1) - 1)\n\t z = (ws >> 1) - mod;\n\t else\n\t z = mod;\n\t k.isubn(z);\n\t } else {\n\t z = 0;\n\t }\n\t naf.push(z);\n\t\n\t // Optimization, shift by word if possible\n\t var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n\t for (var i = 1; i < shift; i++)\n\t naf.push(0);\n\t k.iushrn(shift);\n\t }\n\t\n\t return naf;\n\t}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << (w + 1);\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n for (var i = 1; i < shift; i++)\n naf.push(0);\n k.ishrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << (w + 1);\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n for (var i = 1; i < shift; i++)\n naf.push(0);\n k.ishrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << (w + 1);\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n for (var i = 1; i < shift; i++)\n naf.push(0);\n k.ishrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << (w + 1);\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n for (var i = 1; i < shift; i++)\n naf.push(0);\n k.ishrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << (w + 1);\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n for (var i = 1; i < shift; i++)\n naf.push(0);\n k.ishrn(shift);\n }\n\n return naf;\n}","function getNAF(num, w) {\n\t var naf = [];\n\t var ws = 1 << (w + 1);\n\t var k = num.clone();\n\t while (k.cmpn(1) >= 0) {\n\t var z;\n\t if (k.isOdd()) {\n\t var mod = k.andln(ws - 1);\n\t if (mod > (ws >> 1) - 1)\n\t z = (ws >> 1) - mod;\n\t else\n\t z = mod;\n\t k.isubn(z);\n\t } else {\n\t z = 0;\n\t }\n\t naf.push(z);\n\n\t // Optimization, shift by word if possible\n\t var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n\t for (var i = 1; i < shift; i++)\n\t naf.push(0);\n\t k.iushrn(shift);\n\t }\n\n\t return naf;\n\t}","function getNAF(num, w) {\n\t var naf = [];\n\t var ws = 1 << (w + 1);\n\t var k = num.clone();\n\t while (k.cmpn(1) >= 0) {\n\t var z;\n\t if (k.isOdd()) {\n\t var mod = k.andln(ws - 1);\n\t if (mod > (ws >> 1) - 1)\n\t z = (ws >> 1) - mod;\n\t else\n\t z = mod;\n\t k.isubn(z);\n\t } else {\n\t z = 0;\n\t }\n\t naf.push(z);\n\n\t // Optimization, shift by word if possible\n\t var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\n\t for (var i = 1; i < shift; i++)\n\t naf.push(0);\n\t k.iushrn(shift);\n\t }\n\n\t return naf;\n\t}","function getNAF(num, w) {\n var naf = [];\n var ws = 1 << w + 1;\n var k = num.clone();\n while (k.cmpn(1) >= 0) {\n var z;\n if (k.isOdd()) {\n var mod = k.andln(ws - 1);\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n naf.push(z);\n\n // Optimization, shift by word if possible\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\n for (var i = 1; i < shift; i++) naf.push(0);\n k.iushrn(shift);\n }\n\n return naf;\n}","function setNumberNF(num)\n{\n\tthis.numOriginal = num;\n\tthis.num = this.justNumber(num);\n}","function fnW(str){\n\t var num;\n\t str>9?num=str:num=\"0\"+str;\n\t return num;\n\t }","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}","function getNAF(num, w, bits) {\n\t var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n\t naf.fill(0);\n\n\t var ws = 1 << (w + 1);\n\t var k = num.clone();\n\n\t for (var i = 0; i < naf.length; i++) {\n\t var z;\n\t var mod = k.andln(ws - 1);\n\t if (k.isOdd()) {\n\t if (mod > (ws >> 1) - 1)\n\t z = (ws >> 1) - mod;\n\t else\n\t z = mod;\n\t k.isubn(z);\n\t } else {\n\t z = 0;\n\t }\n\n\t naf[i] = z;\n\t k.iushrn(1);\n\t }\n\n\t return naf;\n\t}","function getNAF(num, w, bits) {\n\t var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n\t naf.fill(0);\n\n\t var ws = 1 << (w + 1);\n\t var k = num.clone();\n\n\t for (var i = 0; i < naf.length; i++) {\n\t var z;\n\t var mod = k.andln(ws - 1);\n\t if (k.isOdd()) {\n\t if (mod > (ws >> 1) - 1)\n\t z = (ws >> 1) - mod;\n\t else\n\t z = mod;\n\t k.isubn(z);\n\t } else {\n\t z = 0;\n\t }\n\n\t naf[i] = z;\n\t k.iushrn(1);\n\t }\n\n\t return naf;\n\t}","function expandedForm(num) {\n\tconst degree = (num + '').length;\n\tlet arr = [];\n\tfor (let i = degree; i >= 0; i--) {\n\t\tlet number = Math.floor(num / Math.pow(10, i - 1)) * Math.pow(10, i - 1);\n\t\tif (number !== 0) {\n\t\t\tarr.push(number + '');\n\t\t\tnum -= number;\n\t\t}\n\t}\n\treturn arr.join(' + ');\n}","function n(n) {\n return n > 9 ? \"\" + n : \"0\" + n; \n }","function flow_g_fmt(num) {\n // TODO: shorten string\n return caml_new_string(caml_js_from_float(num).toString());\n}"],"string":"[\n \"function toUnformattedNF()\\n{\\n\\treturn (this.num);\\n}\",\n \"function getNAF(num,w){var naf=[];var ws=1<=0){var z;if(k.isOdd()){var mod=k.andln(ws-1);if(mod>(ws>>1)-1)z=(ws>>1)-mod;else z=mod;k.isubn(z);}else{z=0;}naf.push(z);// Optimization, shift by word if possible\\nvar shift=k.cmpn(0)!==0&&k.andln(ws-1)===0?w+1:1;for(var i=1;i=0){var z;if(k.isOdd()){var mod=k.andln(ws-1);if(mod>(ws>>1)-1)z=(ws>>1)-mod;else z=mod;k.isubn(z);}else{z=0;}naf.push(z);// Optimization, shift by word if possible\\nvar shift=k.cmpn(0)!==0&&k.andln(ws-1)===0?w+1:1;for(var i=1;i= 1000000000) {\\n\\t\\treturn (num / 1000000000).toFixed(1).replace(/\\\\.0$/, '') + ' B';\\n\\t}\\n\\tif (num >= 1000000) {\\n\\t\\treturn (num / 1000000).toFixed(1).replace(/\\\\.0$/, '') + ' M';\\n\\t}\\n\\tif (num >= 1000) {\\n\\t\\treturn (num / 1000).toFixed(1).replace(/\\\\.0$/, '') + ' K';\\n\\t}\\n\\treturn num;\\n}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << w + 1;\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\\n for (var i = 1; i < shift; i++) naf.push(0);\\n k.iushrn(shift);\\n }\\n\\n return naf;\\n }\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << w + 1;\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\\n for (var i = 1; i < shift; i++) {\\n naf.push(0);\\n }k.ishrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function glslifyNumber (n) {\\n return n === (n | 0) ? n + '.0' : n + '';\\n }\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << w + 1;\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\\n for (var i = 1; i < shift; i++) {\\n naf.push(0);\\n }k.iushrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << w + 1;\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\\n for (var i = 1; i < shift; i++) {\\n naf.push(0);\\n }k.iushrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n\\t var naf = [];\\n\\t var ws = 1 << (w + 1);\\n\\t var k = num.clone();\\n\\t while (k.cmpn(1) >= 0) {\\n\\t var z;\\n\\t if (k.isOdd()) {\\n\\t var mod = k.andln(ws - 1);\\n\\t if (mod > (ws >> 1) - 1)\\n\\t z = (ws >> 1) - mod;\\n\\t else\\n\\t z = mod;\\n\\t k.isubn(z);\\n\\t } else {\\n\\t z = 0;\\n\\t }\\n\\t naf.push(z);\\n\\t\\n\\t // Optimization, shift by word if possible\\n\\t var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n\\t for (var i = 1; i < shift; i++)\\n\\t naf.push(0);\\n\\t k.iushrn(shift);\\n\\t }\\n\\t\\n\\t return naf;\\n\\t}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n for (var i = 1; i < shift; i++)\\n naf.push(0);\\n k.ishrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n for (var i = 1; i < shift; i++)\\n naf.push(0);\\n k.ishrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n for (var i = 1; i < shift; i++)\\n naf.push(0);\\n k.ishrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n for (var i = 1; i < shift; i++)\\n naf.push(0);\\n k.ishrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n for (var i = 1; i < shift; i++)\\n naf.push(0);\\n k.ishrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w) {\\n\\t var naf = [];\\n\\t var ws = 1 << (w + 1);\\n\\t var k = num.clone();\\n\\t while (k.cmpn(1) >= 0) {\\n\\t var z;\\n\\t if (k.isOdd()) {\\n\\t var mod = k.andln(ws - 1);\\n\\t if (mod > (ws >> 1) - 1)\\n\\t z = (ws >> 1) - mod;\\n\\t else\\n\\t z = mod;\\n\\t k.isubn(z);\\n\\t } else {\\n\\t z = 0;\\n\\t }\\n\\t naf.push(z);\\n\\n\\t // Optimization, shift by word if possible\\n\\t var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n\\t for (var i = 1; i < shift; i++)\\n\\t naf.push(0);\\n\\t k.iushrn(shift);\\n\\t }\\n\\n\\t return naf;\\n\\t}\",\n \"function getNAF(num, w) {\\n\\t var naf = [];\\n\\t var ws = 1 << (w + 1);\\n\\t var k = num.clone();\\n\\t while (k.cmpn(1) >= 0) {\\n\\t var z;\\n\\t if (k.isOdd()) {\\n\\t var mod = k.andln(ws - 1);\\n\\t if (mod > (ws >> 1) - 1)\\n\\t z = (ws >> 1) - mod;\\n\\t else\\n\\t z = mod;\\n\\t k.isubn(z);\\n\\t } else {\\n\\t z = 0;\\n\\t }\\n\\t naf.push(z);\\n\\n\\t // Optimization, shift by word if possible\\n\\t var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;\\n\\t for (var i = 1; i < shift; i++)\\n\\t naf.push(0);\\n\\t k.iushrn(shift);\\n\\t }\\n\\n\\t return naf;\\n\\t}\",\n \"function getNAF(num, w) {\\n var naf = [];\\n var ws = 1 << w + 1;\\n var k = num.clone();\\n while (k.cmpn(1) >= 0) {\\n var z;\\n if (k.isOdd()) {\\n var mod = k.andln(ws - 1);\\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n naf.push(z);\\n\\n // Optimization, shift by word if possible\\n var shift = k.cmpn(0) !== 0 && k.andln(ws - 1) === 0 ? w + 1 : 1;\\n for (var i = 1; i < shift; i++) naf.push(0);\\n k.iushrn(shift);\\n }\\n\\n return naf;\\n}\",\n \"function setNumberNF(num)\\n{\\n\\tthis.numOriginal = num;\\n\\tthis.num = this.justNumber(num);\\n}\",\n \"function fnW(str){\\n\\t var num;\\n\\t str>9?num=str:num=\\\"0\\\"+str;\\n\\t return num;\\n\\t }\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n naf.fill(0);\\n\\n var ws = 1 << (w + 1);\\n var k = num.clone();\\n\\n for (var i = 0; i < naf.length; i++) {\\n var z;\\n var mod = k.andln(ws - 1);\\n if (k.isOdd()) {\\n if (mod > (ws >> 1) - 1)\\n z = (ws >> 1) - mod;\\n else\\n z = mod;\\n k.isubn(z);\\n } else {\\n z = 0;\\n }\\n\\n naf[i] = z;\\n k.iushrn(1);\\n }\\n\\n return naf;\\n}\",\n \"function getNAF(num, w, bits) {\\n\\t var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n\\t naf.fill(0);\\n\\n\\t var ws = 1 << (w + 1);\\n\\t var k = num.clone();\\n\\n\\t for (var i = 0; i < naf.length; i++) {\\n\\t var z;\\n\\t var mod = k.andln(ws - 1);\\n\\t if (k.isOdd()) {\\n\\t if (mod > (ws >> 1) - 1)\\n\\t z = (ws >> 1) - mod;\\n\\t else\\n\\t z = mod;\\n\\t k.isubn(z);\\n\\t } else {\\n\\t z = 0;\\n\\t }\\n\\n\\t naf[i] = z;\\n\\t k.iushrn(1);\\n\\t }\\n\\n\\t return naf;\\n\\t}\",\n \"function getNAF(num, w, bits) {\\n\\t var naf = new Array(Math.max(num.bitLength(), bits) + 1);\\n\\t naf.fill(0);\\n\\n\\t var ws = 1 << (w + 1);\\n\\t var k = num.clone();\\n\\n\\t for (var i = 0; i < naf.length; i++) {\\n\\t var z;\\n\\t var mod = k.andln(ws - 1);\\n\\t if (k.isOdd()) {\\n\\t if (mod > (ws >> 1) - 1)\\n\\t z = (ws >> 1) - mod;\\n\\t else\\n\\t z = mod;\\n\\t k.isubn(z);\\n\\t } else {\\n\\t z = 0;\\n\\t }\\n\\n\\t naf[i] = z;\\n\\t k.iushrn(1);\\n\\t }\\n\\n\\t return naf;\\n\\t}\",\n \"function expandedForm(num) {\\n\\tconst degree = (num + '').length;\\n\\tlet arr = [];\\n\\tfor (let i = degree; i >= 0; i--) {\\n\\t\\tlet number = Math.floor(num / Math.pow(10, i - 1)) * Math.pow(10, i - 1);\\n\\t\\tif (number !== 0) {\\n\\t\\t\\tarr.push(number + '');\\n\\t\\t\\tnum -= number;\\n\\t\\t}\\n\\t}\\n\\treturn arr.join(' + ');\\n}\",\n \"function n(n) {\\n return n > 9 ? \\\"\\\" + n : \\\"0\\\" + n; \\n }\",\n \"function flow_g_fmt(num) {\\n // TODO: shorten string\\n return caml_new_string(caml_js_from_float(num).toString());\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6765914","0.64303064","0.64303064","0.6332739","0.6330919","0.62930375","0.6287292","0.6284914","0.6284914","0.6283662","0.627307","0.627307","0.627307","0.627307","0.627307","0.6270584","0.6270584","0.62674284","0.6219913","0.6143485","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60998714","0.60901976","0.60901976","0.6053688","0.60145485","0.59926975"],"string":"[\n \"0.6765914\",\n \"0.64303064\",\n \"0.64303064\",\n \"0.6332739\",\n \"0.6330919\",\n \"0.62930375\",\n \"0.6287292\",\n \"0.6284914\",\n \"0.6284914\",\n \"0.6283662\",\n \"0.627307\",\n \"0.627307\",\n \"0.627307\",\n \"0.627307\",\n \"0.627307\",\n \"0.6270584\",\n \"0.6270584\",\n \"0.62674284\",\n \"0.6219913\",\n \"0.6143485\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60998714\",\n \"0.60901976\",\n \"0.60901976\",\n \"0.6053688\",\n \"0.60145485\",\n \"0.59926975\"\n]"},"document_score":{"kind":"string","value":"0.6263132"},"document_rank":{"kind":"string","value":"62"}}},{"rowIdx":80794,"cells":{"query":{"kind":"string","value":"Represent k1, k2 in a Joint Sparse Form"},"document":{"kind":"string","value":"function getJSF(k1, k2) {\n var jsf = [\n [],\n []\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function K(a,b){this.g=[];this.H=a;this.G=b||null;this.f=this.a=!1;this.c=void 0;this.u=this.K=this.m=!1;this.j=0;this.b=null;this.o=0}","function K(){this.i=0,this.j=0,this.S=new Array}","function k(m1, m2){\r\n return do_(\r\n bind(\"x\", m1),\r\n bind(\"xs\", m2),\r\n ret(withBound(cons, \"x\", \"xs\"))\r\n );\r\n }","function K(a){var b=Oc;this.l=[];this.F=b;this.D=a||null;this.j=this.i=!1;this.h=void 0;this.v=this.I=this.o=!1;this.m=0;this.g=null;this.s=0}","computeControlPoints(K)\n {\n let p1=new Array();\n let p2=new Array();\n let n = K.length-1;\n let i,m;\n\n /*rhs vector*/\n let a=new Array();\n let b=new Array();\n let c=new Array();\n let r=new Array();\n\n /*left most segment*/\n a[0]=0;\n b[0]=2;\n c[0]=1;\n r[0] = K[0]+2*K[1];\n\n /*internal segments*/\n for (i = 1; i < n - 1; i++)\n {\n a[i]=1;\n b[i]=4;\n c[i]=1;\n r[i] = 4 * K[i] + 2 * K[i+1];\n }\n\n /*right segment*/\n a[n-1]=2;\n b[n-1]=7;\n c[n-1]=0;\n r[n-1] = 8*K[n-1]+K[n];\n\n /*solves Ax=b with the Thomas algorithm (from Wikipedia)*/\n for (i = 1; i < n; i++)\n {\n m = a[i]/b[i-1];\n b[i] = b[i] - m * c[i - 1];\n r[i] = r[i] - m*r[i-1];\n }\n\n p1[n-1] = r[n-1]/b[n-1];\n for (i = n - 2; i >= 0; --i)\n p1[i] = (r[i] - c[i] * p1[i+1]) / b[i];\n\n /*we have p1, now compute p2*/\n for (i=0;i= 0; --i) {\n p1[i] = (r[i] - c[i] * p1[i + 1]) / b[i];\n }\n\n /*we have p1, now compute p2*/\n for (i = 0; i < n - 1; i++) {\n p2[i] = 2 * K[i + 1] - p1[i + 1];\n }\n p2[n - 1] = 0.5 * (K[n] + p1[n - 1]);\n return {p1: p1, p2: p2};\n }","static apply__i0_i1__o0_o1__k0_k1() {\n this.output0.realTensor = this.input0.realTensor.clone();\n this.output1.realTensor = this.input1.realTensor.clone(); }","function cantorPairing(k1, k2) {\n\treturn ((((k1+k2) * (k1+k2+1)) / 2) + k2);\n}","function Pair(s1, s2) {\n\n // The first shape.\n this.shape1 = s1 || null;\n // The second shape.\n this.shape2 = s2 || null;\n}","function SparseMatrixCRS(sm) {\n this.M = sm.M;\n this.N = sm.N;\n this.j = [];\n this.v = [];\n this.rp = []; // row pointer\n \n var j = Array(this.M); var v = Array(this.M);\n for (var k=0; k= 0; --i)\r\n\t\tp1[i] = (r[i] - c[i] * p1[i+1]) / b[i];\r\n\t\t\r\n\t/*we have p1, now compute p2*/\r\n\tfor (i=0;i ip2) {\n iAux = ip1;\n ip1 = ip2;\n ip2 = iAux;\n }\n p1 = _classes[ip1];\n\n iNext = p1.iNext;\n p1.iNext = ip2;\n iter = ip2;\n while (1) {\n c = _classes[iter];\n c.iParent = ip1;\n if (c.iNext != -1) {\n iter = c.iNext;\n } else {\n c.iNext = iNext;\n return ip1;\n }\n }\n }\n\n function addPointToClass(iClass, x, y, v) {\n var c = _classes[iClass];\n var iPoint = _points.length;\n var clusterPoint = {\n x: x,\n y: y,\n v: v,\n iNext: c.iFirstPoint\n };\n c.iFirstPoint = iPoint;\n _points.push(clusterPoint);\n }\n\n function findClusters(params) {\n var imageData = params.imageData;\n var bw = params.bw;\n var threshold = params.threshold;\n var minPointsPerCluster = params.minPointsPerCluster;\n\n if (!imageData || threshold === undefined || minPointsPerCluster === undefined) {\n throw \"findClusters: please specify imageData, threshold and minPointsPerCluster\";\n }\n\n var width = imageData.width;\n var height = imageData.height;\n var size = width * height;\n var detectBuffer = new Int32Array(size);\n\n for (var i = 0; i < size; i++) {\n detectBuffer[i] = -1;\n }\n\n var y, x;\n var value;\n var iRow;\n var iRowUp;\n var iClassUp;\n var iClassLeft;\n var iClass;\n var rowIndex;\n var data = imageData.data;\n\n clear();\n var shifter = 2;\n if (bw) {\n shifter = 0;\n }\n for (y = 1; y < height - 1; y++) {\n iRow = y * width;\n iRowUp = iRow - width;\n for (x = 1; x < width - 1; x++) {\n value = data[iRow + x << shifter];\n if (value > threshold) {\n iClassUp = detectBuffer[iRowUp + x];\n iClassLeft = detectBuffer[iRow + x - 1];\n if (iClassUp == -1) {\n if (iClassLeft == -1) {\n iClass = newEquivClass();\n } else {\n iClass = iClassLeft;\n }\n } else {\n if (iClassLeft == -1) {\n iClass = iClassUp;\n } else {\n iClass = mergeClasses(iClassUp, iClassLeft);\n }\n }\n detectBuffer[iRow + x] = iClass;\n addPointToClass(iClass, x, y, value);\n }\n }\n }\n // Ahora vamos a calcular los centros de los clusters\n var i;\n var totalPoints;\n var fx;\n var fy;\n var index;\n var iPoint;\n var cRoot, cCur;\n var p;\n var cluster;\n\n for (i = 0; i < _classes.length; i++) {\n //for (i=0; i<0; i++){\n cRoot = _classes[i];\n if (cRoot.iParent == i) {\n // soy un raíz porque mi padre soy yo\n index = i;\n fx = 0;\n fy = 0;\n totalPoints = 0;\n var cluster = newCluster();\n while (index != -1) {\n cCur = _classes[index];\n iPoint = cCur.iFirstPoint;\n while (iPoint != -1) {\n p = _points[iPoint];\n cluster.points.push({\n x: p.x,\n y: p.y,\n v: p.v\n });\n iPoint = p.iNext;\n fx += p.x * p.v;\n fy += p.y * p.v;\n totalPoints += p.v;\n }\n index = cCur.iNext;\n }\n if (totalPoints >= minPointsPerCluster) {\n fx /= totalPoints;\n fy /= totalPoints;\n cluster.fx = fx;\n cluster.fy = fy;\n addCluster(cluster);\n }\n }\n }\n }\n\n function numClusters() {\n return _clusters.length;\n }\n\n function getCluster(i) {\n return _clusters[i];\n }\n\n this.numClusters = numClusters.bind(this);\n this.getCluster = getCluster.bind(this);\n this.findClusters = findClusters.bind(this);\n}","function intiDistanceMatrix(graph) {\n var distanceMatrix = {};\n\n $.each(graph.vertices, function () {\n distanceMatrix[this.label] = {};\n var rowVertex = this;\n $.each(graph.vertices, function () {\n if (rowVertex.label === this.label)\n distanceMatrix[rowVertex.label][this.label] = 0;\n else\n distanceMatrix[rowVertex.label][this.label] = -1;\n });\n });\n\n return distanceMatrix;\n}","train(array, k = 2) {\n this.k = k;\n //initial data and centoid;\n var data = {};\n for (var i = 0; i < k; i++) {\n data[i] = {\n k: [],\n centroid: Math.ceil(this.sum(array) / array.length) * (i+1) / 3,\n temp: []\n }\n }\n while (true) {\n\n for (var i = 0; i < k; i++) {\n data[i].temp = []\n }\n for (var i = 0; i < array.length; i++) {\n let index = this.getCluster(data, array[i], k)\n data[index].temp.push(array[i])\n }\n //compare data for k set;\n this.showResult(data, k, 'temp')\n if (this.checkFinish(data, k)) {\n console.log('========================finish algorithm=============================')\n this.showResult(data, k)\n this.data = data;\n break;\n } else {\n for (var i = 0; i < k; i++) {\n data[i].centroid = this.getCentoid(data[i].temp);\n console.log('centroi ', i, data[i].centroid)\n data[i].k = data[i].temp;\n }\n }\n }\n }","function skConstraint(element1, geom1, element2, geom2, offset) {\n this._element1 = element1;\n this._geom1 = geom1;\n this._element2 = element2;\n this._geom2 = geom2;\n this._offset = offset;\n\n this.geom1 = function () {\n return this._geom1;\n }\n\n this.geom2 = function () {\n return this._geom2;\n }\n\n this.element1 = function () {\n this._element1;\n }\n\n this.element2 = function () {\n this._element2;\n }\n\n this.offset = function () {\n return this._offset;\n }\n\n this.setOffset = function (offset) {\n this._offset = v;\n }\n\n}","addEdge(v1,v2){\n //*This will find the value of the v1 and push it into v2 array to make the relationship\n this.adjacencyList[v1].push(v2);\n //*This will find the value of the v2 and push it into v1 array to make the relationship\n this.adjacencyList[v2].push(v1);\n }","function Ik(a,b){this.g=[];this.D=a;this.G=b||null;this.f=this.a=!1;this.c=void 0;this.B=this.Da=this.l=!1;this.j=0;this.b=null;this.o=0}","function addEdge(v1, v2) {\n adjMatrix[v1][v2] = 1;\n adjMatrix[v2][v1] = 1;\n}","function knn(features, labels, predictionPoint, k){\n const {mean,variance}=tf.moments(features,0);\n const scaledPrediction=predictionPoint.sub(mean).div(variance.pow(.5));\n return features\n .sub(mean)\n .div(variance.pow(.5))\n .sub(scaledPrediction)\n .pow(2)\n .sum(1)\n .pow(0.5)\n .expandDims(1)\n .concat(labels, 1)\n .unstack()\n .sort((tensorA, tensorB) => tensorA.arraySync() > tensorB.arraySync() ? 1 : -1)\n .slice(0, k)\n .reduce((acc, pair) => acc + pair.arraySync()[1], 0) / k;\n}","function gjk(shape1, shape2) {\n var _a;\n var supportFunction = minkowiskDifferenceSupportFunction(shape1, shape2);\n var initialPoint = supportFunction(new vec2_1[\"default\"](1, 0));\n var simplexPoints = new object_set_1.ObjectSet([initialPoint]);\n var point = initialPoint;\n var iterations = MAX_ITERATIONS;\n for (var i = 0; i < MAX_ITERATIONS; i++) {\n var supportPoint = supportFunction(vec2_1[\"default\"].negate(point));\n var pointDirection = vec2_1[\"default\"].normalize(point);\n var negPointDirection = vec2_1[\"default\"].negate(pointDirection);\n var pointDotNegDir = vec2_1[\"default\"].dot(point, negPointDirection);\n var supportPointDotNegDir = vec2_1[\"default\"].dot(supportPoint, negPointDirection);\n if (pointDotNegDir > supportPointDotNegDir || util_1.fpCmp(pointDotNegDir, supportPointDotNegDir) || vec2_1[\"default\"].norm(point) == 0) {\n iterations = i + 1;\n break;\n }\n simplexPoints.add(supportPoint);\n _a = findNearestPointSetOfUpTo4PointsConvexHull(simplexPoints), point = _a[0], simplexPoints = _a[1];\n }\n // console.log('Finished in', iterations, 'iterations');\n return [vec2_1[\"default\"].norm(point), vec2_1[\"default\"].normalize(point)];\n}","function makeAdjMat(myObj){\n var myKeys = Object.keys(myObj); // get the keys of dictionary\n var adjMat = myKeys.reduce(function(output, elem){ // creating the adjacency matrix\n // keep in mind myObj[elem] is the list of states that border elem\n var stateBorderArr = myKeys.map(function(state) {\n return myObj[elem].indexOf(state) > -1;\n });\n output[elem] = stateBorderArr;\n return output;\n }, {});\n return adjMat;\n}","function keygen(k) {\n var P = [];\n var s = [];\n k = k || [];\n clamp(k);\n core(P, s, k, null);\n return { p: P, s: s, k: k };\n }","function SparseMatrix(M, N) {\n this.N = N || 0;\n this.M = M || 0;\n this.i = []; // row indices of non-zero values\n this.j = []; // col indices of now-zero values\n this.v = []; // non-zero values\n}","insertKnot(un, r) {\r\n let p = this.degree;\r\n let dim = this.dimension;\r\n let k = this.findSpan(un);\r\n let isRational = this.isRational();\r\n // If un already exists in the knot vector then s is it's multiplicity\r\n let s = 0;\r\n for (let i = 0; i < this.knots.shape[0]; i++) {\r\n if (this.knots.get(i) === un) {\r\n s++;\r\n }\r\n }\r\n if (r + s >= p) {\r\n throw new Error('Knot insertion exceeds knot multiplicity beyond degree');\r\n }\r\n let m = this.knots.shape[0] - 1;\r\n let n = m - p - 1;\r\n let P = this.cpoints;\r\n let Up = this.knots;\r\n let Q = new common_1.NDArray({ shape: [P.shape[0] + r, dim] });\r\n let Uq = new common_1.NDArray({ shape: [Up.shape[0] + r] });\r\n let Rtmp, Wtmp;\r\n Rtmp = new common_1.NDArray({ shape: [p + 1, dim] });\r\n let Wp, Wq;\r\n if (this.weights) {\r\n Wp = this.weights;\r\n Wq = new common_1.NDArray({ shape: [Wp.shape[0] + r] });\r\n Wtmp = new common_1.NDArray({ shape: [p + 1] });\r\n }\r\n // Load new knot vector\r\n for (let i = 0; i < k + 1; i++) {\r\n Uq.set(i, Up.get(i));\r\n }\r\n for (let i = 1; i < r + 1; i++) {\r\n Uq.set(k + i, un);\r\n }\r\n for (let i = k + 1; i < m + 1; i++) {\r\n Uq.set(i + r, Up.get(i));\r\n }\r\n // Save unaltered control points\r\n for (let i = 0; i < k - p + 1; i++) {\r\n for (let j = 0; j < dim; j++) {\r\n Q.set(i, j, P.get(i, j));\r\n }\r\n if (Wp && Wq) {\r\n Wq.set(i, Wp.get(i));\r\n }\r\n }\r\n for (let i = k - s; i < n + 1; i++) {\r\n for (let j = 0; j < dim; j++) {\r\n Q.set(i + r, j, P.get(i, j));\r\n }\r\n if (Wp && Wq) {\r\n Wq.set(i + r, Wp.get(i));\r\n }\r\n }\r\n for (let i = 0; i < p - s + 1; i++) {\r\n for (let j = 0; j < dim; j++) {\r\n Rtmp.set(i, j, P.get(k - p + i, j));\r\n }\r\n }\r\n let L = 0;\r\n for (let j = 1; j < r + 1; j++) {\r\n L = k - p + j;\r\n for (let i = 0; i < p - j - s + 1; i++) {\r\n let alpha = (un - Up.get(L + i)) / (Up.get(i + k + 1) - Up.get(L + i));\r\n for (let z = 0; z < dim; z++) {\r\n Rtmp.set(i, z, alpha * Rtmp.get(i + 1, z) + (1 - alpha) * Rtmp.get(i, z));\r\n }\r\n if (Wtmp) {\r\n Wtmp.set(i, alpha * Wtmp.get(i + 1) + (1 - alpha) * Wtmp.get(i));\r\n }\r\n }\r\n for (let z = 0; z < dim; z++) {\r\n Q.set(L, z, Rtmp.get(0, z));\r\n Q.set(k + r - j - s, z, Rtmp.get(p - j - s, z));\r\n }\r\n if (Wq && Wtmp) {\r\n Wq.set(L, Wtmp.get(0));\r\n Wq.set(k + r - j - s, Wtmp.get(p - j - s));\r\n }\r\n }\r\n for (let i = L + 1; i < k - s + 1; i++) {\r\n for (let z = 0; z < dim; z++) {\r\n Q.set(i, z, Rtmp.get(i - L, z));\r\n }\r\n if (Wq && Wtmp) {\r\n Wq.set(i, Wtmp.get(i - L));\r\n }\r\n }\r\n this.knots = Uq;\r\n this.cpoints = Q;\r\n if (isRational) {\r\n this.weights = Wq;\r\n }\r\n }","_addToIndex(index0, key0, key1, key2) {\n // Create layers as necessary\n var index1 = index0[key0] || (index0[key0] = {});\n var index2 = index1[key1] || (index1[key1] = {}); // Setting the key to _any_ value signals the presence of the quad\n\n var existed = key2 in index2;\n if (!existed) index2[key2] = null;\n return !existed;\n }","_addToIndex(index0, key0, key1, key2) {\n // Create layers as necessary\n const index1 = index0[key0] || (index0[key0] = {});\n const index2 = index1[key1] || (index1[key1] = {});\n // Setting the key to _any_ value signals the presence of the quad\n const existed = (key2 in index2);\n if (!existed) index2[key2] = null;\n return !existed;\n }","function buildGraph$2() {\n var graph = {}; // https://jsperf.com/object-keys-vs-for-in-with-closure/3\n\n var models = Object.keys(conversions$2);\n\n for (var len = models.length, i = 0; i < len; i++) {\n graph[models[i]] = {\n // http://jsperf.com/1-vs-infinity\n // micro-opt, but this is simple.\n distance: -1,\n parent: null\n };\n }\n\n return graph;\n} // https://en.wikipedia.org/wiki/Breadth-first_search","function knn(features, labels, predictionPoint, k) {\n // tf.moments() => gives { mean, variance }\n // Standard Deviation = sqrt(variance)\n const { mean, variance } = tf.moments(features, 0);\n const standardDeviation = variance.pow(0.5);\n const scale = point => standardize(point, mean, standardDeviation);\n\n return (\n scale(features)\n .sub(scale(predictionPoint))\n .pow(2)\n .sum(1)\n .pow(0.5)\n .expandDims(1)\n .concat(labels, 1)\n .unstack()\n .sort((a, b) => (a.get(0) > b.get(0) ? 1 : -1))\n .slice(0, k)\n .reduce((acc, pair) => acc + pair.get(1), 0) / k\n );\n}","function inout ( k ) {\n\n\t\tif ( ( k *= 2 ) < 1 ) return 0.5 * k * k;\n\t\treturn - 0.5 * ( --k * ( k - 2 ) - 1 );\n\n\t}","function getVertexAcross(v1, v2, f) {\n var Vs = f.getVertices();\n if (Vs.length != 3) {\n console.log(\"Warning(getLaplacianSparseMatrix): Expecting 3 vertices per face\");\n return null;\n }\n var idx = 0;\n if ( (v1.ID != Vs[1].ID) && (v2.ID != Vs[1].ID) ) {\n idx = 1;\n }\n else if ( (v1.ID != Vs[2].ID) && (v2.ID != Vs[2].ID) ) {\n idx = 2;\n }\n return Vs[idx];\n }","function mat2 (v0, v1) {\n\t//mat2(x0, y0, x1, y1)\n\tif (arguments.length >= 4) {\n\t\tvar x0 = this.process(arguments[0]);\n\t\tvar y0 = this.process(arguments[1]);\n\t\tvar x1 = this.process(arguments[2]);\n\t\tvar y1 = this.process(arguments[3]);\n\t\tvar comps = [x0, y0, x1, y1];\n\t\treturn Descriptor(\n\t\t\t`[${comps.join(', ')}]`, {\n\t\t\tcomponents: comps,\n\t\t\ttype: 'mat2',\n\t\t\tcomplexity: cmpl(comps)\n\t\t});\n\t};\n\n\t//ensure at least identity matrix\n\tif (v0 == null) v0 = 1;\n\n\tvar v0 = this.process(v0);\n\tvar v1 = this.process(v1);\n\n\t//mat2(float) → identity matrix\n\tif (this.types[v0.type].length === 1) {\n\t\tvar res = Descriptor(\n\t\t\t`mat2(${v0})`, {\n\t\t\tcomponents: [\n\t\t\t\tv0, 0,\n\t\t\t\t0, v0\n\t\t\t].map(float, this),\n\t\t\ttype: 'mat2',\n\t\t\tcomplexity: v0.complexity * 2 + 2,\n\t\t\tinclude: 'mat2'\n\t\t});\n\t\treturn res;\n\t}\n\n\t//mat2(mat2)\n\tif (v0.type === 'mat2') {\n\t\treturn v0;\n\t}\n\n\t//mat(vec, vec)\n\tvar comps = v0.components.slice(0,2).concat(v1.components.slice(0,2));\n\treturn Descriptor(`${this.types.vec2.call(this, v0)}.concat(${this.types.vec2.call(this, v1)})`, {\n\t\tcomponents: comps.map(float, this),\n\t\tcomplexity: cmpl(comps),\n\t\ttype: 'mat2'\n\t});\n}","addEdge(v1,v2){\n this.adjacencyList[v1].push(v2)\n this.adjacencyList[v2].push(v1) \n }","lin_ij(i, j) {\n if (Array.isArray(i)) [i, j] = i;\n\n return j + i * this.mapWidth;\n }","function M(a,b){this.g=[];this.K=a;this.I=b||null;this.f=this.a=!1;this.c=void 0;this.s=this.N=this.l=!1;this.i=0;this.b=null;this.o=0}","function K(){var e=o();return this.copyTo(e),e}","_addToIndex (index0, key0, key1, key2) {\n // Create layers as necessary\n const index1 = index0[key0] || (index0[key0] = {})\n const index2 = index1[key1] || (index1[key1] = {})\n // Setting the key to _any_ value signals the presence of the quad\n const existed = key2 in index2\n\n if (!existed) {\n index2[key2] = null\n }\n\n return !existed\n }","function key(x, y) {\n return x + ',' + y;\n}","function kobon(a, b, c) {\n this.a = a;\n this.b = b;\n this.c = c;\n this.getUniquePoints = function() {\n var points = [];\n points.push(a.intersect1.point);\n points.push(a.intersect2.point);\n if (b.intersect1.point.equals(a.intersect2.point) ||\n b.intersect1.point.equals(a.intersect1.point)) {\n points.push(b.intersect2.point);\n } else {\n points.push(b.intersect1.point);\n }\n return points;\n };\n }","constructor()\r\n\t{\r\n\t\tvar mapJ1 = [\r\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\r\n\t\t[0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,9,0],\r\n\t\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]];\r\n\t\t\r\n\t\tvar mapJ2 = [\r\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\r\n\t\t[0,0,0,6,0,0,0,0,0,0,0,0,0,0,9,0,0,0],\r\n\t\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n\t\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\r\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]];\r\n\r\n var lvlList = [mapJ1, mapJ2]\r\n\t\tvar listLength = lvlList.length;\r\n\t\tvar lvlListIndex = -1;\r\n\t\tthis.GetLvl = function ()\r\n\t\t{\r\n\t\t\tif(lvlListIndex <= listLength)\r\n\t\t\t{\r\n\t\t\t\tlvlListIndex++;\r\n\t\t\t\treturn lvlList[lvlListIndex];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\treturn null;\r\n\t\t\t}\r\n\t\t};\r\n\t}","function M(a,b){this.g=[];this.u=a;this.s=b||null;this.f=this.a=!1;this.c=void 0;this.l=this.K=this.i=!1;this.h=0;this.b=null;this.j=0}","function getAllPairs(skill_array) {\n var pair_array = [];\n for (var i=0;i j){\n if(j%2){\n pair_array.push({\"label\":skill_array[i] + \" or \" +skill_array[j], \"param1\":skill_array[i], \"param2\":skill_array[j]});\n }\n else {\n pair_array.push({\"label\":skill_array[j] + \" or \" +skill_array[i], \"param1\":skill_array[j], \"param2\":skill_array[i]});\n }\n }\n }\n }\n return pair_array;\n}","function buildGraph$2() {\n\tvar graph = {}; // https://jsperf.com/object-keys-vs-for-in-with-closure/3\n\n\tvar models = Object.keys( conversions$2 );\n\n\tfor ( var len = models.length, i = 0; i < len; i++ ) {\n\t\tgraph[ models[ i ] ] = {\n\t\t\t// http://jsperf.com/1-vs-infinity\n\t\t\t// micro-opt, but this is simple.\n\t\t\tdistance: -1,\n\t\t\tparent: null,\n\t\t};\n\t}\n\n\treturn graph;\n} // https://en.wikipedia.org/wiki/Breadth-first_search","function Matrix2D() {\n this.a = 1;\n this.c = 0;\n this.tx = 0;\n this.b = 0;\n this.d = 1;\n this.ty = 0;\n }","function getJSF(k1, k2) {\n var jsf = [[], []];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = k1.andln(3) + d1 & 3;\n var m24 = k2.andln(3) + d2 & 3;\n if (m14 === 3) m14 = -1;\n if (m24 === 3) m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = k1.andln(7) + d1 & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = k2.andln(7) + d2 & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n }","function pointToKey(x, y) {\n return `${x},${y}`;\n}","function getJSF(k1, k2) {\n var jsf = [[], []];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = k1.andln(3) + d1 & 3;\n var m24 = k2.andln(3) + d2 & 3;\n if (m14 === 3) m14 = -1;\n if (m24 === 3) m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = k1.andln(7) + d1 & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = k2.andln(7) + d2 & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\n k1.ishrn(1);\n k2.ishrn(1);\n }\n\n return jsf;\n}","function connectorKey(leftNode, rightNode) {\n return 'c_' + leftNode.key + '_to_' + rightNode.key;\n}","function getJSF(k1, k2) {\n var jsf = [[], []];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = k1.andln(3) + d1 & 3;\n var m24 = k2.andln(3) + d2 & 3;\n if (m14 === 3) m14 = -1;\n if (m24 === 3) m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = k1.andln(7) + d1 & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = k2.andln(7) + d2 & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}","function getJSF(k1, k2) {\n var jsf = [[], []];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = k1.andln(3) + d1 & 3;\n var m24 = k2.andln(3) + d2 & 3;\n if (m14 === 3) m14 = -1;\n if (m24 === 3) m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = k1.andln(7) + d1 & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = k2.andln(7) + d2 & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}","function getJSF(k1, k2) {\n var jsf = [[], []];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = k1.andln(3) + d1 & 3;\n var m24 = k2.andln(3) + d2 & 3;\n if (m14 === 3) m14 = -1;\n if (m24 === 3) m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = k1.andln(7) + d1 & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = k2.andln(7) + d2 & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}","function K (v) {\n return v;\n}","function K (v) {\n return v;\n}","function K (v) {\n return v;\n}","function K (v) {\n return v;\n}","function K (v) {\n return v;\n}","function K (v) {\n return v;\n}","function K (v) {\n return v;\n}","function connect(en, ei, p) {\n var n = en.s.length + ei.s.length\n var see = new SMatrix(n-2,n-2),sei = new SMatrix(n-2,2)\n var sie = new SMatrix( 2,n-2),sii = new SMatrix( 2,2)\n /*\n var g = new SMatrix((new Junction(2)).smatrix())\n /*/\n var g = new SMatrix([\n [new Complex(0), new Complex(1)],\n [new Complex(1), new Complex(0)]\n ])\n //*/\n var i,j,k,l,m,h\n\n // Generazione di see, sei, sie, sii mediante scansione di en ed ei\n // see è diagonale a blocchi n-2 righe, n-2 colonne\n // sei è verticale di n-2 righe, 2 colonne\n // sie è orizzontale di 2 righe, n-2 colonne\n // sii è diagonale e contiene solo i due elementi delle porte da connettere\n h = 0 // Elemento in corso di gestione\n m = 0 // Blocco dell'elemento (S è diagonale a blocchi))\n k = 0 // 0 Prima o -1 dopo la porta da connettere\n var elements = [ei,en]\n\n while ( elements.length > 0 ) {\n // elemento da gestire\n var es = elements.pop()\n var el = es.s.length\n var pp = es.n.indexOf(p)\n for ( i=0; i arr1 + K + arr2 [Full path from src to dst including intersection]\n */\n arr1.push(k); /* performing arr1 + K */\n\n /* Performing arr1 + K + arr2 [As stated above] */\n let arr = arr1.concat(arr2);\n\n /* \n * Loop for the array created after split and Do not forget to skip 0th and last 2 elements otherwise they will be coloured too\n * Hence, src and dest locations will be coloured and user will not be able to src and dest again so ignore these indices. \n */\n for (let i = 1; i < arr.length - 1; i++) {\n\n /* Now split the individual element of array with ':' [colon] to get row_number and col_number */\n let temp = arr[i].split(\":\");\n\n /* Convert row_number to number inorder to use it as row index of matrix */\n let nx = parseInt(temp[0]);\n\n /* Convert col_number to number inorder to use it as col index of matrix */\n let ny = parseInt(temp[1]);\n\n /* Update the matrix value to 9 to denote that the current rect is part of shortest path */\n matrix[nx][ny] = 9;\n\n /* Update the color of shortest path to show the User there exist an Shortest Path */\n document.getElementById(`${nx}:${ny}`).style.fill = \"rgb(0, 68, 137)\";\n }\n}","function interleave(k) {\n\tif (k < 0) {\n\t\treturn -2*k;\n\t} else {\n\t\treturn 2*k + 1;\n\t}\n}","function KShape(value,shape) { \n return value / (value + (1 - (1/shape)) * (value-1));\n}","constructor({nway, size, k, memory, bits}) {\n this.size = size;\n this.k = k;\n this.nway = nway;\n this.bits = bits;\n this.statistics = { misses: 0, replacements: 0, total: 0 };\n this.cache = Array.from({length: nway},\n () => Array.from({length: size},\n () => Array.from({length: k},\n () => {\n return {\n data: '0'.repeat(bits+30), // bits for address + 32 bits for data\n time: 0\n }\n }))); // 3D array for n-way set association\n //this.printSnapshot();\n this.memory = memory;\n }","insertKnotU(un, r) {\r\n let p = this.u_degree;\r\n // Knot will be inserted between [k, k+1)\r\n let k = helper_1.findSpan(p, this.u_knots.data, un);\r\n // If un already exists in the knot vector, s is its multiplicity\r\n let s = common_1.count(this.u_knots, un, 0);\r\n if (r + s > p) {\r\n throw new Error('Knot insertion exceeds knot multiplicity beyond degree');\r\n }\r\n let mU = this.u_knots.length - 1;\r\n let nU = mU - this.u_degree - 1;\r\n let mV = this.v_knots.length - 1;\r\n let nV = mV - this.v_degree - 1;\r\n let P = this.cpoints;\r\n let Q = common_1.empty([nU + 1 + r, nV + 1, this.dimension]);\r\n let UP = this.u_knots;\r\n let UQ = common_1.empty([UP.length + r]);\r\n let VP = this.v_knots;\r\n let VQ = common_1.empty([VP.length]);\r\n // Load u-vector\r\n for (let i = 0; i < k + 1; i++) {\r\n UQ.set(i, UP.get(i));\r\n }\r\n for (let i = 1; i < r + 1; i++) {\r\n UQ.set(k + i, un);\r\n }\r\n for (let i = k + 1; i < mU + 1; i++) {\r\n UQ.set(i + r, UP.get(i));\r\n }\r\n // Copy v-vector\r\n VQ.copyfrom(VP);\r\n let alpha = common_1.empty([p + 1, r + 1]);\r\n let R = common_1.empty([p + 1, this.dimension]);\r\n let L = 0;\r\n // Pre-calculate alphas\r\n for (let j = 1; j < r + 1; j++) {\r\n L = k - p + j;\r\n for (let i = 0; i < p - j - s + 1; i++) {\r\n alpha.set(i, j, (un - UP.get(L + i)) / (UP.get(i + k + 1) - UP.get(L + i)));\r\n }\r\n }\r\n for (let row = 0; row < nV + 1; row++) {\r\n // Save unaltered control points\r\n for (let i = 0; i < k - p + 1; i++) {\r\n Q.set(i, row, P.get(i, row));\r\n }\r\n for (let i = k - s; i < nU + 1; i++) {\r\n Q.set(i + r, row, P.get(i, row));\r\n }\r\n // Load auxiliary control points\r\n for (let i = 0; i < p - s + 1; i++) {\r\n R.set(i, P.get(k - p + i, row));\r\n }\r\n for (let j = 1; j < r + 1; j++) {\r\n L = k - p + j;\r\n for (let i = 0; i < p - j - s + 1; i++) {\r\n R.set(i, common_1.add(common_1.mul(alpha.get(i, j), R.get(i + 1)), common_1.mul(1.0 - alpha.get(i, j), R.get(i))));\r\n }\r\n Q.set(L, row, R.get(0));\r\n Q.set(k + r - j - s, row, R.get(p - j - s));\r\n }\r\n // Load the remaining control points\r\n for (let i = L + 1; i < k - s; i++) {\r\n Q.set(i, row, R.get(i - L));\r\n }\r\n }\r\n this.cpoints = Q;\r\n this.v_knots = VQ;\r\n }","addEdge(v1, v2) {\n this.adjacencyList[v1].push(v2);\n this.adjacencyList[v2].push(v1);\n }","function mapper_make_key(feature) {\n\tvar key = feature[\"lat\"] + \":\" + feature[\"lon\"] + \":\" + feature[\"title\"];\n\treturn key;\n}","function buildMatrixLookup(arr) { \n var lookup = {};\n var index = arr.columns;\n var verbal = index[0];\n for(var i =0; i (obj[parseInt(key)] = Number(arr[i][key]),obj), {});\n }\n\n return lookup;\n}","function km() { // km - short for \"Key Manager\"\n return Array.prototype.slice.call(arguments).join(\":\");\n}","function get_coords_cat(i,j)\n{\n return {\n \"x\": 18 + 40*i +(j % 2 == 1 ? 20:0),\n \"y\": 20 + 35*j\n };\n}","function J(a,b){this.l=[];this.kb=a;this.V=b||null;this.f=this.a=!1;this.b=void 0;this.C=this.ya=this.s=!1;this.i=0;this.c=null;this.A=0}","function N(a,b){this.j=[];this.D=a;this.v=b||null;this.h=this.a=!1;this.g=void 0;this.I=this.K=this.p=!1;this.o=0;this.b=null;this.k=0}","get Clustering() {}","function EncodePair(word1, word2)\n{\n\tlet code = EncodeWord(word1).concat(EncodeWord(word2));\n\t\n\tcode.push(1);\n\t\n\treturn code;\n}","function getJSF(k1, k2) {\n\t var jsf = [\n\t [],\n\t []\n\t ];\n\t\n\t k1 = k1.clone();\n\t k2 = k2.clone();\n\t var d1 = 0;\n\t var d2 = 0;\n\t while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\t\n\t // First phase\n\t var m14 = (k1.andln(3) + d1) & 3;\n\t var m24 = (k2.andln(3) + d2) & 3;\n\t if (m14 === 3)\n\t m14 = -1;\n\t if (m24 === 3)\n\t m24 = -1;\n\t var u1;\n\t if ((m14 & 1) === 0) {\n\t u1 = 0;\n\t } else {\n\t var m8 = (k1.andln(7) + d1) & 7;\n\t if ((m8 === 3 || m8 === 5) && m24 === 2)\n\t u1 = -m14;\n\t else\n\t u1 = m14;\n\t }\n\t jsf[0].push(u1);\n\t\n\t var u2;\n\t if ((m24 & 1) === 0) {\n\t u2 = 0;\n\t } else {\n\t var m8 = (k2.andln(7) + d2) & 7;\n\t if ((m8 === 3 || m8 === 5) && m14 === 2)\n\t u2 = -m24;\n\t else\n\t u2 = m24;\n\t }\n\t jsf[1].push(u2);\n\t\n\t // Second phase\n\t if (2 * d1 === u1 + 1)\n\t d1 = 1 - d1;\n\t if (2 * d2 === u2 + 1)\n\t d2 = 1 - d2;\n\t k1.iushrn(1);\n\t k2.iushrn(1);\n\t }\n\t\n\t return jsf;\n\t}","function communityRepresentation() {\n\nfunction convertToBinaryArray(coordinates) {\n\n\"use strict\";\n var coordInBinary = coordiates.toString(2); \n \n if(coordInBinary.length > 7) {\n return [1,1,1,1,1,1,1,1];\n\n }\n \n while(coordInBinary.length < 7) { \n coordInBinary = \"0\" + coordInBinary;\n }\n \n // Convert string to array\n return coordInBinary.split(\"\").map(function(i) {\n return parseInt(i); }\n );\n}\n\nvar predictr = new synaptic.Architect.Perceptron(\n\n/* Remember to change numbers of neurons. */\n 7, \n 3,\n 3, \n 0\n);\n\nvar trainingData = [];\n\nvar i;\n\nvar input;\n\nvar output;\n\n/* Add training data here. */\ninput = [0,0,0,0,0,0,0,1];\noutput = [1];\n \n trainingData.push({\n input: input,\n output: output\n });\n}","init(){\n if( this.a2i === undefined ){\n this.a2i = {}\n for( var k=0; k 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.ishrn(1);\n k2.ishrn(1);\n }\n\n return jsf;\n}","function getJSF(k1, k2) {\n var jsf = [\n [],\n []\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.ishrn(1);\n k2.ishrn(1);\n }\n\n return jsf;\n}","function getJSF(k1, k2) {\n var jsf = [\n [],\n []\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.ishrn(1);\n k2.ishrn(1);\n }\n\n return jsf;\n}","function getJSF(k1, k2) {\n var jsf = [\n [],\n []\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.ishrn(1);\n k2.ishrn(1);\n }\n\n return jsf;\n}","function getJSF(k1, k2) {\n var jsf = [\n [],\n []\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n var m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n var m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.ishrn(1);\n k2.ishrn(1);\n }\n\n return jsf;\n}","function findTwoElementsUsingHash(K, matrix) {\n // Define hash map using simple object\n let hash = {};\n let hasElements = false;\n for (let index = 0; index < matrix.length; index++) {\n const element = matrix[index];\n // K = element + another_element\n // another_element = K - element\n const another_element = K - element;\n // Check that another element is found in hash\n if (another_element in hash) {\n // If found return true\n hasElements = true;\n break;\n }\n // Otherwise add this new element to hash map and continue\n hash[element] = 1;\n }\n return hasElements;\n}","function LinearConstraint(joint) {\n\n this.m1 = NaN;\n this.m2 = NaN;\n\n this.ii1 = null;\n this.ii2 = null;\n this.dd = null;\n\n this.r1x = NaN;\n this.r1y = NaN;\n this.r1z = NaN;\n\n this.r2x = NaN;\n this.r2y = NaN;\n this.r2z = NaN;\n\n this.ax1x = NaN;\n this.ax1y = NaN;\n this.ax1z = NaN;\n this.ay1x = NaN;\n this.ay1y = NaN;\n this.ay1z = NaN;\n this.az1x = NaN;\n this.az1y = NaN;\n this.az1z = NaN;\n\n this.ax2x = NaN;\n this.ax2y = NaN;\n this.ax2z = NaN;\n this.ay2x = NaN;\n this.ay2y = NaN;\n this.ay2z = NaN;\n this.az2x = NaN;\n this.az2y = NaN;\n this.az2z = NaN;\n\n this.vel = NaN;\n this.velx = NaN;\n this.vely = NaN;\n this.velz = NaN;\n\n this.joint = joint;\n this.r1 = joint.relativeAnchorPoint1;\n this.r2 = joint.relativeAnchorPoint2;\n this.p1 = joint.anchorPoint1;\n this.p2 = joint.anchorPoint2;\n this.b1 = joint.body1;\n this.b2 = joint.body2;\n this.l1 = this.b1.linearVelocity;\n this.l2 = this.b2.linearVelocity;\n this.a1 = this.b1.angularVelocity;\n this.a2 = this.b2.angularVelocity;\n this.i1 = this.b1.inverseInertia;\n this.i2 = this.b2.inverseInertia;\n this.impx = 0;\n this.impy = 0;\n this.impz = 0;\n}","addEdge(v1, v2) {\n if (v1 in this.adjacencyList && v2 in this.adjacencyList) {\n this.adjacencyList[v1].push(v2);\n this.adjacencyList[v2].push(v1);\n }\n }","insertKnotV(vn, r) {\r\n let q = this.v_degree;\r\n // Knot will be inserted between [k,k+1)\r\n let k = helper_1.findSpan(this.v_degree, this.v_knots.data, vn);\r\n // If v already exists in knot vector, s is its multiplicity\r\n let s = common_1.count(this.v_knots, vn, 0);\r\n if (r + s > q) {\r\n throw new Error('Knot insertion exceeds knot multiplicity beyond degree');\r\n }\r\n let mU = this.u_knots.length - 1;\r\n let nU = mU - this.u_degree - 1;\r\n let mV = this.v_knots.length - 1;\r\n let nV = mV - this.v_degree - 1;\r\n let P = this.cpoints;\r\n let Q = common_1.empty([nU + 1, nV + r + 1, this.dimension]);\r\n let UP = this.u_knots;\r\n let UQ = common_1.empty([UP.length]);\r\n let VP = this.v_knots;\r\n let VQ = common_1.empty([VP.length + r]);\r\n // Copy u knot vector\r\n UQ.copyfrom(UP);\r\n // Load v knot vector\r\n for (let i = 0; i < k + 1; i++) {\r\n VQ.set(i, VP.get(i));\r\n }\r\n for (let i = 1; i < r + 1; i++) {\r\n VQ.set(k + i, vn);\r\n }\r\n for (let i = k + 1; i < mV + 1; i++) {\r\n VQ.set(i + r, VP.get(i));\r\n }\r\n let alpha = common_1.empty([q + 1, r + 1]);\r\n let R = common_1.empty([q + 1, this.dimension]);\r\n let L = 0;\r\n // Pre-calculate alphas\r\n for (let j = 1; j < r + 1; j++) {\r\n L = k - q + j;\r\n for (let i = 0; i < q - j - s + 1; i++) {\r\n alpha.set(i, j, (vn - VP.get(L + i)) / (VP.get(i + k + 1) - VP.get(L + i)));\r\n }\r\n }\r\n for (let col = 0; col < nU + 1; col++) {\r\n // Save unaltered control points\r\n for (let i = 0; i < k - q + 1; i++) {\r\n Q.set(col, i, P.get(col, i));\r\n }\r\n for (let i = k - s; i < nV + 1; i++) {\r\n Q.set(col, i + r, P.get(col, i));\r\n }\r\n // Load auxiliary control points\r\n for (let i = 0; i < q - s + 1; i++) {\r\n R.set(i, P.get(col, k - q + i));\r\n }\r\n for (let j = 1; j < r + 1; j++) {\r\n L = k - q + j;\r\n for (let i = 0; i < q - j - s + 1; i++) {\r\n R.set(i, common_1.add(common_1.mul(alpha.get(i, j), R.get(i + 1)), common_1.mul((1.0 - alpha.get(i, j)), R.get(i))));\r\n }\r\n Q.set(col, L, R.get(0));\r\n Q.set(col, k + r - j - s, R.get(q - j - s));\r\n }\r\n // Load remaining control points\r\n for (let i = L + 1; i < k - s; i++) {\r\n Q.set(col, i, R.get(i - L));\r\n }\r\n }\r\n this.cpoints = Q;\r\n this.v_knots = VQ;\r\n }"],"string":"[\n \"function K(a,b){this.g=[];this.H=a;this.G=b||null;this.f=this.a=!1;this.c=void 0;this.u=this.K=this.m=!1;this.j=0;this.b=null;this.o=0}\",\n \"function K(){this.i=0,this.j=0,this.S=new Array}\",\n \"function k(m1, m2){\\r\\n return do_(\\r\\n bind(\\\"x\\\", m1),\\r\\n bind(\\\"xs\\\", m2),\\r\\n ret(withBound(cons, \\\"x\\\", \\\"xs\\\"))\\r\\n );\\r\\n }\",\n \"function K(a){var b=Oc;this.l=[];this.F=b;this.D=a||null;this.j=this.i=!1;this.h=void 0;this.v=this.I=this.o=!1;this.m=0;this.g=null;this.s=0}\",\n \"computeControlPoints(K)\\n {\\n let p1=new Array();\\n let p2=new Array();\\n let n = K.length-1;\\n let i,m;\\n\\n /*rhs vector*/\\n let a=new Array();\\n let b=new Array();\\n let c=new Array();\\n let r=new Array();\\n\\n /*left most segment*/\\n a[0]=0;\\n b[0]=2;\\n c[0]=1;\\n r[0] = K[0]+2*K[1];\\n\\n /*internal segments*/\\n for (i = 1; i < n - 1; i++)\\n {\\n a[i]=1;\\n b[i]=4;\\n c[i]=1;\\n r[i] = 4 * K[i] + 2 * K[i+1];\\n }\\n\\n /*right segment*/\\n a[n-1]=2;\\n b[n-1]=7;\\n c[n-1]=0;\\n r[n-1] = 8*K[n-1]+K[n];\\n\\n /*solves Ax=b with the Thomas algorithm (from Wikipedia)*/\\n for (i = 1; i < n; i++)\\n {\\n m = a[i]/b[i-1];\\n b[i] = b[i] - m * c[i - 1];\\n r[i] = r[i] - m*r[i-1];\\n }\\n\\n p1[n-1] = r[n-1]/b[n-1];\\n for (i = n - 2; i >= 0; --i)\\n p1[i] = (r[i] - c[i] * p1[i+1]) / b[i];\\n\\n /*we have p1, now compute p2*/\\n for (i=0;i= 0; --i) {\\n p1[i] = (r[i] - c[i] * p1[i + 1]) / b[i];\\n }\\n\\n /*we have p1, now compute p2*/\\n for (i = 0; i < n - 1; i++) {\\n p2[i] = 2 * K[i + 1] - p1[i + 1];\\n }\\n p2[n - 1] = 0.5 * (K[n] + p1[n - 1]);\\n return {p1: p1, p2: p2};\\n }\",\n \"static apply__i0_i1__o0_o1__k0_k1() {\\n this.output0.realTensor = this.input0.realTensor.clone();\\n this.output1.realTensor = this.input1.realTensor.clone(); }\",\n \"function cantorPairing(k1, k2) {\\n\\treturn ((((k1+k2) * (k1+k2+1)) / 2) + k2);\\n}\",\n \"function Pair(s1, s2) {\\n\\n // The first shape.\\n this.shape1 = s1 || null;\\n // The second shape.\\n this.shape2 = s2 || null;\\n}\",\n \"function SparseMatrixCRS(sm) {\\n this.M = sm.M;\\n this.N = sm.N;\\n this.j = [];\\n this.v = [];\\n this.rp = []; // row pointer\\n \\n var j = Array(this.M); var v = Array(this.M);\\n for (var k=0; k= 0; --i)\\r\\n\\t\\tp1[i] = (r[i] - c[i] * p1[i+1]) / b[i];\\r\\n\\t\\t\\r\\n\\t/*we have p1, now compute p2*/\\r\\n\\tfor (i=0;i ip2) {\\n iAux = ip1;\\n ip1 = ip2;\\n ip2 = iAux;\\n }\\n p1 = _classes[ip1];\\n\\n iNext = p1.iNext;\\n p1.iNext = ip2;\\n iter = ip2;\\n while (1) {\\n c = _classes[iter];\\n c.iParent = ip1;\\n if (c.iNext != -1) {\\n iter = c.iNext;\\n } else {\\n c.iNext = iNext;\\n return ip1;\\n }\\n }\\n }\\n\\n function addPointToClass(iClass, x, y, v) {\\n var c = _classes[iClass];\\n var iPoint = _points.length;\\n var clusterPoint = {\\n x: x,\\n y: y,\\n v: v,\\n iNext: c.iFirstPoint\\n };\\n c.iFirstPoint = iPoint;\\n _points.push(clusterPoint);\\n }\\n\\n function findClusters(params) {\\n var imageData = params.imageData;\\n var bw = params.bw;\\n var threshold = params.threshold;\\n var minPointsPerCluster = params.minPointsPerCluster;\\n\\n if (!imageData || threshold === undefined || minPointsPerCluster === undefined) {\\n throw \\\"findClusters: please specify imageData, threshold and minPointsPerCluster\\\";\\n }\\n\\n var width = imageData.width;\\n var height = imageData.height;\\n var size = width * height;\\n var detectBuffer = new Int32Array(size);\\n\\n for (var i = 0; i < size; i++) {\\n detectBuffer[i] = -1;\\n }\\n\\n var y, x;\\n var value;\\n var iRow;\\n var iRowUp;\\n var iClassUp;\\n var iClassLeft;\\n var iClass;\\n var rowIndex;\\n var data = imageData.data;\\n\\n clear();\\n var shifter = 2;\\n if (bw) {\\n shifter = 0;\\n }\\n for (y = 1; y < height - 1; y++) {\\n iRow = y * width;\\n iRowUp = iRow - width;\\n for (x = 1; x < width - 1; x++) {\\n value = data[iRow + x << shifter];\\n if (value > threshold) {\\n iClassUp = detectBuffer[iRowUp + x];\\n iClassLeft = detectBuffer[iRow + x - 1];\\n if (iClassUp == -1) {\\n if (iClassLeft == -1) {\\n iClass = newEquivClass();\\n } else {\\n iClass = iClassLeft;\\n }\\n } else {\\n if (iClassLeft == -1) {\\n iClass = iClassUp;\\n } else {\\n iClass = mergeClasses(iClassUp, iClassLeft);\\n }\\n }\\n detectBuffer[iRow + x] = iClass;\\n addPointToClass(iClass, x, y, value);\\n }\\n }\\n }\\n // Ahora vamos a calcular los centros de los clusters\\n var i;\\n var totalPoints;\\n var fx;\\n var fy;\\n var index;\\n var iPoint;\\n var cRoot, cCur;\\n var p;\\n var cluster;\\n\\n for (i = 0; i < _classes.length; i++) {\\n //for (i=0; i<0; i++){\\n cRoot = _classes[i];\\n if (cRoot.iParent == i) {\\n // soy un raíz porque mi padre soy yo\\n index = i;\\n fx = 0;\\n fy = 0;\\n totalPoints = 0;\\n var cluster = newCluster();\\n while (index != -1) {\\n cCur = _classes[index];\\n iPoint = cCur.iFirstPoint;\\n while (iPoint != -1) {\\n p = _points[iPoint];\\n cluster.points.push({\\n x: p.x,\\n y: p.y,\\n v: p.v\\n });\\n iPoint = p.iNext;\\n fx += p.x * p.v;\\n fy += p.y * p.v;\\n totalPoints += p.v;\\n }\\n index = cCur.iNext;\\n }\\n if (totalPoints >= minPointsPerCluster) {\\n fx /= totalPoints;\\n fy /= totalPoints;\\n cluster.fx = fx;\\n cluster.fy = fy;\\n addCluster(cluster);\\n }\\n }\\n }\\n }\\n\\n function numClusters() {\\n return _clusters.length;\\n }\\n\\n function getCluster(i) {\\n return _clusters[i];\\n }\\n\\n this.numClusters = numClusters.bind(this);\\n this.getCluster = getCluster.bind(this);\\n this.findClusters = findClusters.bind(this);\\n}\",\n \"function intiDistanceMatrix(graph) {\\n var distanceMatrix = {};\\n\\n $.each(graph.vertices, function () {\\n distanceMatrix[this.label] = {};\\n var rowVertex = this;\\n $.each(graph.vertices, function () {\\n if (rowVertex.label === this.label)\\n distanceMatrix[rowVertex.label][this.label] = 0;\\n else\\n distanceMatrix[rowVertex.label][this.label] = -1;\\n });\\n });\\n\\n return distanceMatrix;\\n}\",\n \"train(array, k = 2) {\\n this.k = k;\\n //initial data and centoid;\\n var data = {};\\n for (var i = 0; i < k; i++) {\\n data[i] = {\\n k: [],\\n centroid: Math.ceil(this.sum(array) / array.length) * (i+1) / 3,\\n temp: []\\n }\\n }\\n while (true) {\\n\\n for (var i = 0; i < k; i++) {\\n data[i].temp = []\\n }\\n for (var i = 0; i < array.length; i++) {\\n let index = this.getCluster(data, array[i], k)\\n data[index].temp.push(array[i])\\n }\\n //compare data for k set;\\n this.showResult(data, k, 'temp')\\n if (this.checkFinish(data, k)) {\\n console.log('========================finish algorithm=============================')\\n this.showResult(data, k)\\n this.data = data;\\n break;\\n } else {\\n for (var i = 0; i < k; i++) {\\n data[i].centroid = this.getCentoid(data[i].temp);\\n console.log('centroi ', i, data[i].centroid)\\n data[i].k = data[i].temp;\\n }\\n }\\n }\\n }\",\n \"function skConstraint(element1, geom1, element2, geom2, offset) {\\n this._element1 = element1;\\n this._geom1 = geom1;\\n this._element2 = element2;\\n this._geom2 = geom2;\\n this._offset = offset;\\n\\n this.geom1 = function () {\\n return this._geom1;\\n }\\n\\n this.geom2 = function () {\\n return this._geom2;\\n }\\n\\n this.element1 = function () {\\n this._element1;\\n }\\n\\n this.element2 = function () {\\n this._element2;\\n }\\n\\n this.offset = function () {\\n return this._offset;\\n }\\n\\n this.setOffset = function (offset) {\\n this._offset = v;\\n }\\n\\n}\",\n \"addEdge(v1,v2){\\n //*This will find the value of the v1 and push it into v2 array to make the relationship\\n this.adjacencyList[v1].push(v2);\\n //*This will find the value of the v2 and push it into v1 array to make the relationship\\n this.adjacencyList[v2].push(v1);\\n }\",\n \"function Ik(a,b){this.g=[];this.D=a;this.G=b||null;this.f=this.a=!1;this.c=void 0;this.B=this.Da=this.l=!1;this.j=0;this.b=null;this.o=0}\",\n \"function addEdge(v1, v2) {\\n adjMatrix[v1][v2] = 1;\\n adjMatrix[v2][v1] = 1;\\n}\",\n \"function knn(features, labels, predictionPoint, k){\\n const {mean,variance}=tf.moments(features,0);\\n const scaledPrediction=predictionPoint.sub(mean).div(variance.pow(.5));\\n return features\\n .sub(mean)\\n .div(variance.pow(.5))\\n .sub(scaledPrediction)\\n .pow(2)\\n .sum(1)\\n .pow(0.5)\\n .expandDims(1)\\n .concat(labels, 1)\\n .unstack()\\n .sort((tensorA, tensorB) => tensorA.arraySync() > tensorB.arraySync() ? 1 : -1)\\n .slice(0, k)\\n .reduce((acc, pair) => acc + pair.arraySync()[1], 0) / k;\\n}\",\n \"function gjk(shape1, shape2) {\\n var _a;\\n var supportFunction = minkowiskDifferenceSupportFunction(shape1, shape2);\\n var initialPoint = supportFunction(new vec2_1[\\\"default\\\"](1, 0));\\n var simplexPoints = new object_set_1.ObjectSet([initialPoint]);\\n var point = initialPoint;\\n var iterations = MAX_ITERATIONS;\\n for (var i = 0; i < MAX_ITERATIONS; i++) {\\n var supportPoint = supportFunction(vec2_1[\\\"default\\\"].negate(point));\\n var pointDirection = vec2_1[\\\"default\\\"].normalize(point);\\n var negPointDirection = vec2_1[\\\"default\\\"].negate(pointDirection);\\n var pointDotNegDir = vec2_1[\\\"default\\\"].dot(point, negPointDirection);\\n var supportPointDotNegDir = vec2_1[\\\"default\\\"].dot(supportPoint, negPointDirection);\\n if (pointDotNegDir > supportPointDotNegDir || util_1.fpCmp(pointDotNegDir, supportPointDotNegDir) || vec2_1[\\\"default\\\"].norm(point) == 0) {\\n iterations = i + 1;\\n break;\\n }\\n simplexPoints.add(supportPoint);\\n _a = findNearestPointSetOfUpTo4PointsConvexHull(simplexPoints), point = _a[0], simplexPoints = _a[1];\\n }\\n // console.log('Finished in', iterations, 'iterations');\\n return [vec2_1[\\\"default\\\"].norm(point), vec2_1[\\\"default\\\"].normalize(point)];\\n}\",\n \"function makeAdjMat(myObj){\\n var myKeys = Object.keys(myObj); // get the keys of dictionary\\n var adjMat = myKeys.reduce(function(output, elem){ // creating the adjacency matrix\\n // keep in mind myObj[elem] is the list of states that border elem\\n var stateBorderArr = myKeys.map(function(state) {\\n return myObj[elem].indexOf(state) > -1;\\n });\\n output[elem] = stateBorderArr;\\n return output;\\n }, {});\\n return adjMat;\\n}\",\n \"function keygen(k) {\\n var P = [];\\n var s = [];\\n k = k || [];\\n clamp(k);\\n core(P, s, k, null);\\n return { p: P, s: s, k: k };\\n }\",\n \"function SparseMatrix(M, N) {\\n this.N = N || 0;\\n this.M = M || 0;\\n this.i = []; // row indices of non-zero values\\n this.j = []; // col indices of now-zero values\\n this.v = []; // non-zero values\\n}\",\n \"insertKnot(un, r) {\\r\\n let p = this.degree;\\r\\n let dim = this.dimension;\\r\\n let k = this.findSpan(un);\\r\\n let isRational = this.isRational();\\r\\n // If un already exists in the knot vector then s is it's multiplicity\\r\\n let s = 0;\\r\\n for (let i = 0; i < this.knots.shape[0]; i++) {\\r\\n if (this.knots.get(i) === un) {\\r\\n s++;\\r\\n }\\r\\n }\\r\\n if (r + s >= p) {\\r\\n throw new Error('Knot insertion exceeds knot multiplicity beyond degree');\\r\\n }\\r\\n let m = this.knots.shape[0] - 1;\\r\\n let n = m - p - 1;\\r\\n let P = this.cpoints;\\r\\n let Up = this.knots;\\r\\n let Q = new common_1.NDArray({ shape: [P.shape[0] + r, dim] });\\r\\n let Uq = new common_1.NDArray({ shape: [Up.shape[0] + r] });\\r\\n let Rtmp, Wtmp;\\r\\n Rtmp = new common_1.NDArray({ shape: [p + 1, dim] });\\r\\n let Wp, Wq;\\r\\n if (this.weights) {\\r\\n Wp = this.weights;\\r\\n Wq = new common_1.NDArray({ shape: [Wp.shape[0] + r] });\\r\\n Wtmp = new common_1.NDArray({ shape: [p + 1] });\\r\\n }\\r\\n // Load new knot vector\\r\\n for (let i = 0; i < k + 1; i++) {\\r\\n Uq.set(i, Up.get(i));\\r\\n }\\r\\n for (let i = 1; i < r + 1; i++) {\\r\\n Uq.set(k + i, un);\\r\\n }\\r\\n for (let i = k + 1; i < m + 1; i++) {\\r\\n Uq.set(i + r, Up.get(i));\\r\\n }\\r\\n // Save unaltered control points\\r\\n for (let i = 0; i < k - p + 1; i++) {\\r\\n for (let j = 0; j < dim; j++) {\\r\\n Q.set(i, j, P.get(i, j));\\r\\n }\\r\\n if (Wp && Wq) {\\r\\n Wq.set(i, Wp.get(i));\\r\\n }\\r\\n }\\r\\n for (let i = k - s; i < n + 1; i++) {\\r\\n for (let j = 0; j < dim; j++) {\\r\\n Q.set(i + r, j, P.get(i, j));\\r\\n }\\r\\n if (Wp && Wq) {\\r\\n Wq.set(i + r, Wp.get(i));\\r\\n }\\r\\n }\\r\\n for (let i = 0; i < p - s + 1; i++) {\\r\\n for (let j = 0; j < dim; j++) {\\r\\n Rtmp.set(i, j, P.get(k - p + i, j));\\r\\n }\\r\\n }\\r\\n let L = 0;\\r\\n for (let j = 1; j < r + 1; j++) {\\r\\n L = k - p + j;\\r\\n for (let i = 0; i < p - j - s + 1; i++) {\\r\\n let alpha = (un - Up.get(L + i)) / (Up.get(i + k + 1) - Up.get(L + i));\\r\\n for (let z = 0; z < dim; z++) {\\r\\n Rtmp.set(i, z, alpha * Rtmp.get(i + 1, z) + (1 - alpha) * Rtmp.get(i, z));\\r\\n }\\r\\n if (Wtmp) {\\r\\n Wtmp.set(i, alpha * Wtmp.get(i + 1) + (1 - alpha) * Wtmp.get(i));\\r\\n }\\r\\n }\\r\\n for (let z = 0; z < dim; z++) {\\r\\n Q.set(L, z, Rtmp.get(0, z));\\r\\n Q.set(k + r - j - s, z, Rtmp.get(p - j - s, z));\\r\\n }\\r\\n if (Wq && Wtmp) {\\r\\n Wq.set(L, Wtmp.get(0));\\r\\n Wq.set(k + r - j - s, Wtmp.get(p - j - s));\\r\\n }\\r\\n }\\r\\n for (let i = L + 1; i < k - s + 1; i++) {\\r\\n for (let z = 0; z < dim; z++) {\\r\\n Q.set(i, z, Rtmp.get(i - L, z));\\r\\n }\\r\\n if (Wq && Wtmp) {\\r\\n Wq.set(i, Wtmp.get(i - L));\\r\\n }\\r\\n }\\r\\n this.knots = Uq;\\r\\n this.cpoints = Q;\\r\\n if (isRational) {\\r\\n this.weights = Wq;\\r\\n }\\r\\n }\",\n \"_addToIndex(index0, key0, key1, key2) {\\n // Create layers as necessary\\n var index1 = index0[key0] || (index0[key0] = {});\\n var index2 = index1[key1] || (index1[key1] = {}); // Setting the key to _any_ value signals the presence of the quad\\n\\n var existed = key2 in index2;\\n if (!existed) index2[key2] = null;\\n return !existed;\\n }\",\n \"_addToIndex(index0, key0, key1, key2) {\\n // Create layers as necessary\\n const index1 = index0[key0] || (index0[key0] = {});\\n const index2 = index1[key1] || (index1[key1] = {});\\n // Setting the key to _any_ value signals the presence of the quad\\n const existed = (key2 in index2);\\n if (!existed) index2[key2] = null;\\n return !existed;\\n }\",\n \"function buildGraph$2() {\\n var graph = {}; // https://jsperf.com/object-keys-vs-for-in-with-closure/3\\n\\n var models = Object.keys(conversions$2);\\n\\n for (var len = models.length, i = 0; i < len; i++) {\\n graph[models[i]] = {\\n // http://jsperf.com/1-vs-infinity\\n // micro-opt, but this is simple.\\n distance: -1,\\n parent: null\\n };\\n }\\n\\n return graph;\\n} // https://en.wikipedia.org/wiki/Breadth-first_search\",\n \"function knn(features, labels, predictionPoint, k) {\\n // tf.moments() => gives { mean, variance }\\n // Standard Deviation = sqrt(variance)\\n const { mean, variance } = tf.moments(features, 0);\\n const standardDeviation = variance.pow(0.5);\\n const scale = point => standardize(point, mean, standardDeviation);\\n\\n return (\\n scale(features)\\n .sub(scale(predictionPoint))\\n .pow(2)\\n .sum(1)\\n .pow(0.5)\\n .expandDims(1)\\n .concat(labels, 1)\\n .unstack()\\n .sort((a, b) => (a.get(0) > b.get(0) ? 1 : -1))\\n .slice(0, k)\\n .reduce((acc, pair) => acc + pair.get(1), 0) / k\\n );\\n}\",\n \"function inout ( k ) {\\n\\n\\t\\tif ( ( k *= 2 ) < 1 ) return 0.5 * k * k;\\n\\t\\treturn - 0.5 * ( --k * ( k - 2 ) - 1 );\\n\\n\\t}\",\n \"function getVertexAcross(v1, v2, f) {\\n var Vs = f.getVertices();\\n if (Vs.length != 3) {\\n console.log(\\\"Warning(getLaplacianSparseMatrix): Expecting 3 vertices per face\\\");\\n return null;\\n }\\n var idx = 0;\\n if ( (v1.ID != Vs[1].ID) && (v2.ID != Vs[1].ID) ) {\\n idx = 1;\\n }\\n else if ( (v1.ID != Vs[2].ID) && (v2.ID != Vs[2].ID) ) {\\n idx = 2;\\n }\\n return Vs[idx];\\n }\",\n \"function mat2 (v0, v1) {\\n\\t//mat2(x0, y0, x1, y1)\\n\\tif (arguments.length >= 4) {\\n\\t\\tvar x0 = this.process(arguments[0]);\\n\\t\\tvar y0 = this.process(arguments[1]);\\n\\t\\tvar x1 = this.process(arguments[2]);\\n\\t\\tvar y1 = this.process(arguments[3]);\\n\\t\\tvar comps = [x0, y0, x1, y1];\\n\\t\\treturn Descriptor(\\n\\t\\t\\t`[${comps.join(', ')}]`, {\\n\\t\\t\\tcomponents: comps,\\n\\t\\t\\ttype: 'mat2',\\n\\t\\t\\tcomplexity: cmpl(comps)\\n\\t\\t});\\n\\t};\\n\\n\\t//ensure at least identity matrix\\n\\tif (v0 == null) v0 = 1;\\n\\n\\tvar v0 = this.process(v0);\\n\\tvar v1 = this.process(v1);\\n\\n\\t//mat2(float) → identity matrix\\n\\tif (this.types[v0.type].length === 1) {\\n\\t\\tvar res = Descriptor(\\n\\t\\t\\t`mat2(${v0})`, {\\n\\t\\t\\tcomponents: [\\n\\t\\t\\t\\tv0, 0,\\n\\t\\t\\t\\t0, v0\\n\\t\\t\\t].map(float, this),\\n\\t\\t\\ttype: 'mat2',\\n\\t\\t\\tcomplexity: v0.complexity * 2 + 2,\\n\\t\\t\\tinclude: 'mat2'\\n\\t\\t});\\n\\t\\treturn res;\\n\\t}\\n\\n\\t//mat2(mat2)\\n\\tif (v0.type === 'mat2') {\\n\\t\\treturn v0;\\n\\t}\\n\\n\\t//mat(vec, vec)\\n\\tvar comps = v0.components.slice(0,2).concat(v1.components.slice(0,2));\\n\\treturn Descriptor(`${this.types.vec2.call(this, v0)}.concat(${this.types.vec2.call(this, v1)})`, {\\n\\t\\tcomponents: comps.map(float, this),\\n\\t\\tcomplexity: cmpl(comps),\\n\\t\\ttype: 'mat2'\\n\\t});\\n}\",\n \"addEdge(v1,v2){\\n this.adjacencyList[v1].push(v2)\\n this.adjacencyList[v2].push(v1) \\n }\",\n \"lin_ij(i, j) {\\n if (Array.isArray(i)) [i, j] = i;\\n\\n return j + i * this.mapWidth;\\n }\",\n \"function M(a,b){this.g=[];this.K=a;this.I=b||null;this.f=this.a=!1;this.c=void 0;this.s=this.N=this.l=!1;this.i=0;this.b=null;this.o=0}\",\n \"function K(){var e=o();return this.copyTo(e),e}\",\n \"_addToIndex (index0, key0, key1, key2) {\\n // Create layers as necessary\\n const index1 = index0[key0] || (index0[key0] = {})\\n const index2 = index1[key1] || (index1[key1] = {})\\n // Setting the key to _any_ value signals the presence of the quad\\n const existed = key2 in index2\\n\\n if (!existed) {\\n index2[key2] = null\\n }\\n\\n return !existed\\n }\",\n \"function key(x, y) {\\n return x + ',' + y;\\n}\",\n \"function kobon(a, b, c) {\\n this.a = a;\\n this.b = b;\\n this.c = c;\\n this.getUniquePoints = function() {\\n var points = [];\\n points.push(a.intersect1.point);\\n points.push(a.intersect2.point);\\n if (b.intersect1.point.equals(a.intersect2.point) ||\\n b.intersect1.point.equals(a.intersect1.point)) {\\n points.push(b.intersect2.point);\\n } else {\\n points.push(b.intersect1.point);\\n }\\n return points;\\n };\\n }\",\n \"constructor()\\r\\n\\t{\\r\\n\\t\\tvar mapJ1 = [\\r\\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\\r\\n\\t\\t[0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,9,0],\\r\\n\\t\\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]];\\r\\n\\t\\t\\r\\n\\t\\tvar mapJ2 = [\\r\\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\\r\\n\\t\\t[0,0,0,6,0,0,0,0,0,0,0,0,0,0,9,0,0,0],\\r\\n\\t\\t[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n\\t\\t[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],\\r\\n [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]];\\r\\n\\r\\n var lvlList = [mapJ1, mapJ2]\\r\\n\\t\\tvar listLength = lvlList.length;\\r\\n\\t\\tvar lvlListIndex = -1;\\r\\n\\t\\tthis.GetLvl = function ()\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(lvlListIndex <= listLength)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tlvlListIndex++;\\r\\n\\t\\t\\t\\treturn lvlList[lvlListIndex];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t}\",\n \"function M(a,b){this.g=[];this.u=a;this.s=b||null;this.f=this.a=!1;this.c=void 0;this.l=this.K=this.i=!1;this.h=0;this.b=null;this.j=0}\",\n \"function getAllPairs(skill_array) {\\n var pair_array = [];\\n for (var i=0;i j){\\n if(j%2){\\n pair_array.push({\\\"label\\\":skill_array[i] + \\\" or \\\" +skill_array[j], \\\"param1\\\":skill_array[i], \\\"param2\\\":skill_array[j]});\\n }\\n else {\\n pair_array.push({\\\"label\\\":skill_array[j] + \\\" or \\\" +skill_array[i], \\\"param1\\\":skill_array[j], \\\"param2\\\":skill_array[i]});\\n }\\n }\\n }\\n }\\n return pair_array;\\n}\",\n \"function buildGraph$2() {\\n\\tvar graph = {}; // https://jsperf.com/object-keys-vs-for-in-with-closure/3\\n\\n\\tvar models = Object.keys( conversions$2 );\\n\\n\\tfor ( var len = models.length, i = 0; i < len; i++ ) {\\n\\t\\tgraph[ models[ i ] ] = {\\n\\t\\t\\t// http://jsperf.com/1-vs-infinity\\n\\t\\t\\t// micro-opt, but this is simple.\\n\\t\\t\\tdistance: -1,\\n\\t\\t\\tparent: null,\\n\\t\\t};\\n\\t}\\n\\n\\treturn graph;\\n} // https://en.wikipedia.org/wiki/Breadth-first_search\",\n \"function Matrix2D() {\\n this.a = 1;\\n this.c = 0;\\n this.tx = 0;\\n this.b = 0;\\n this.d = 1;\\n this.ty = 0;\\n }\",\n \"function getJSF(k1, k2) {\\n var jsf = [[], []];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = k1.andln(3) + d1 & 3;\\n var m24 = k2.andln(3) + d2 & 3;\\n if (m14 === 3) m14 = -1;\\n if (m24 === 3) m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = k1.andln(7) + d1 & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = k2.andln(7) + d2 & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\\n k1.iushrn(1);\\n k2.iushrn(1);\\n }\\n\\n return jsf;\\n }\",\n \"function pointToKey(x, y) {\\n return `${x},${y}`;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [[], []];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = k1.andln(3) + d1 & 3;\\n var m24 = k2.andln(3) + d2 & 3;\\n if (m14 === 3) m14 = -1;\\n if (m24 === 3) m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = k1.andln(7) + d1 & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = k2.andln(7) + d2 & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\\n k1.ishrn(1);\\n k2.ishrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function connectorKey(leftNode, rightNode) {\\n return 'c_' + leftNode.key + '_to_' + rightNode.key;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [[], []];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = k1.andln(3) + d1 & 3;\\n var m24 = k2.andln(3) + d2 & 3;\\n if (m14 === 3) m14 = -1;\\n if (m24 === 3) m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = k1.andln(7) + d1 & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = k2.andln(7) + d2 & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\\n k1.iushrn(1);\\n k2.iushrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [[], []];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = k1.andln(3) + d1 & 3;\\n var m24 = k2.andln(3) + d2 & 3;\\n if (m14 === 3) m14 = -1;\\n if (m24 === 3) m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = k1.andln(7) + d1 & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = k2.andln(7) + d2 & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\\n k1.iushrn(1);\\n k2.iushrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [[], []];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = k1.andln(3) + d1 & 3;\\n var m24 = k2.andln(3) + d2 & 3;\\n if (m14 === 3) m14 = -1;\\n if (m24 === 3) m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = k1.andln(7) + d1 & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = k2.andln(7) + d2 & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\\n k1.iushrn(1);\\n k2.iushrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function K (v) {\\n return v;\\n}\",\n \"function connect(en, ei, p) {\\n var n = en.s.length + ei.s.length\\n var see = new SMatrix(n-2,n-2),sei = new SMatrix(n-2,2)\\n var sie = new SMatrix( 2,n-2),sii = new SMatrix( 2,2)\\n /*\\n var g = new SMatrix((new Junction(2)).smatrix())\\n /*/\\n var g = new SMatrix([\\n [new Complex(0), new Complex(1)],\\n [new Complex(1), new Complex(0)]\\n ])\\n //*/\\n var i,j,k,l,m,h\\n\\n // Generazione di see, sei, sie, sii mediante scansione di en ed ei\\n // see è diagonale a blocchi n-2 righe, n-2 colonne\\n // sei è verticale di n-2 righe, 2 colonne\\n // sie è orizzontale di 2 righe, n-2 colonne\\n // sii è diagonale e contiene solo i due elementi delle porte da connettere\\n h = 0 // Elemento in corso di gestione\\n m = 0 // Blocco dell'elemento (S è diagonale a blocchi))\\n k = 0 // 0 Prima o -1 dopo la porta da connettere\\n var elements = [ei,en]\\n\\n while ( elements.length > 0 ) {\\n // elemento da gestire\\n var es = elements.pop()\\n var el = es.s.length\\n var pp = es.n.indexOf(p)\\n for ( i=0; i arr1 + K + arr2 [Full path from src to dst including intersection]\\n */\\n arr1.push(k); /* performing arr1 + K */\\n\\n /* Performing arr1 + K + arr2 [As stated above] */\\n let arr = arr1.concat(arr2);\\n\\n /* \\n * Loop for the array created after split and Do not forget to skip 0th and last 2 elements otherwise they will be coloured too\\n * Hence, src and dest locations will be coloured and user will not be able to src and dest again so ignore these indices. \\n */\\n for (let i = 1; i < arr.length - 1; i++) {\\n\\n /* Now split the individual element of array with ':' [colon] to get row_number and col_number */\\n let temp = arr[i].split(\\\":\\\");\\n\\n /* Convert row_number to number inorder to use it as row index of matrix */\\n let nx = parseInt(temp[0]);\\n\\n /* Convert col_number to number inorder to use it as col index of matrix */\\n let ny = parseInt(temp[1]);\\n\\n /* Update the matrix value to 9 to denote that the current rect is part of shortest path */\\n matrix[nx][ny] = 9;\\n\\n /* Update the color of shortest path to show the User there exist an Shortest Path */\\n document.getElementById(`${nx}:${ny}`).style.fill = \\\"rgb(0, 68, 137)\\\";\\n }\\n}\",\n \"function interleave(k) {\\n\\tif (k < 0) {\\n\\t\\treturn -2*k;\\n\\t} else {\\n\\t\\treturn 2*k + 1;\\n\\t}\\n}\",\n \"function KShape(value,shape) { \\n return value / (value + (1 - (1/shape)) * (value-1));\\n}\",\n \"constructor({nway, size, k, memory, bits}) {\\n this.size = size;\\n this.k = k;\\n this.nway = nway;\\n this.bits = bits;\\n this.statistics = { misses: 0, replacements: 0, total: 0 };\\n this.cache = Array.from({length: nway},\\n () => Array.from({length: size},\\n () => Array.from({length: k},\\n () => {\\n return {\\n data: '0'.repeat(bits+30), // bits for address + 32 bits for data\\n time: 0\\n }\\n }))); // 3D array for n-way set association\\n //this.printSnapshot();\\n this.memory = memory;\\n }\",\n \"insertKnotU(un, r) {\\r\\n let p = this.u_degree;\\r\\n // Knot will be inserted between [k, k+1)\\r\\n let k = helper_1.findSpan(p, this.u_knots.data, un);\\r\\n // If un already exists in the knot vector, s is its multiplicity\\r\\n let s = common_1.count(this.u_knots, un, 0);\\r\\n if (r + s > p) {\\r\\n throw new Error('Knot insertion exceeds knot multiplicity beyond degree');\\r\\n }\\r\\n let mU = this.u_knots.length - 1;\\r\\n let nU = mU - this.u_degree - 1;\\r\\n let mV = this.v_knots.length - 1;\\r\\n let nV = mV - this.v_degree - 1;\\r\\n let P = this.cpoints;\\r\\n let Q = common_1.empty([nU + 1 + r, nV + 1, this.dimension]);\\r\\n let UP = this.u_knots;\\r\\n let UQ = common_1.empty([UP.length + r]);\\r\\n let VP = this.v_knots;\\r\\n let VQ = common_1.empty([VP.length]);\\r\\n // Load u-vector\\r\\n for (let i = 0; i < k + 1; i++) {\\r\\n UQ.set(i, UP.get(i));\\r\\n }\\r\\n for (let i = 1; i < r + 1; i++) {\\r\\n UQ.set(k + i, un);\\r\\n }\\r\\n for (let i = k + 1; i < mU + 1; i++) {\\r\\n UQ.set(i + r, UP.get(i));\\r\\n }\\r\\n // Copy v-vector\\r\\n VQ.copyfrom(VP);\\r\\n let alpha = common_1.empty([p + 1, r + 1]);\\r\\n let R = common_1.empty([p + 1, this.dimension]);\\r\\n let L = 0;\\r\\n // Pre-calculate alphas\\r\\n for (let j = 1; j < r + 1; j++) {\\r\\n L = k - p + j;\\r\\n for (let i = 0; i < p - j - s + 1; i++) {\\r\\n alpha.set(i, j, (un - UP.get(L + i)) / (UP.get(i + k + 1) - UP.get(L + i)));\\r\\n }\\r\\n }\\r\\n for (let row = 0; row < nV + 1; row++) {\\r\\n // Save unaltered control points\\r\\n for (let i = 0; i < k - p + 1; i++) {\\r\\n Q.set(i, row, P.get(i, row));\\r\\n }\\r\\n for (let i = k - s; i < nU + 1; i++) {\\r\\n Q.set(i + r, row, P.get(i, row));\\r\\n }\\r\\n // Load auxiliary control points\\r\\n for (let i = 0; i < p - s + 1; i++) {\\r\\n R.set(i, P.get(k - p + i, row));\\r\\n }\\r\\n for (let j = 1; j < r + 1; j++) {\\r\\n L = k - p + j;\\r\\n for (let i = 0; i < p - j - s + 1; i++) {\\r\\n R.set(i, common_1.add(common_1.mul(alpha.get(i, j), R.get(i + 1)), common_1.mul(1.0 - alpha.get(i, j), R.get(i))));\\r\\n }\\r\\n Q.set(L, row, R.get(0));\\r\\n Q.set(k + r - j - s, row, R.get(p - j - s));\\r\\n }\\r\\n // Load the remaining control points\\r\\n for (let i = L + 1; i < k - s; i++) {\\r\\n Q.set(i, row, R.get(i - L));\\r\\n }\\r\\n }\\r\\n this.cpoints = Q;\\r\\n this.v_knots = VQ;\\r\\n }\",\n \"addEdge(v1, v2) {\\n this.adjacencyList[v1].push(v2);\\n this.adjacencyList[v2].push(v1);\\n }\",\n \"function mapper_make_key(feature) {\\n\\tvar key = feature[\\\"lat\\\"] + \\\":\\\" + feature[\\\"lon\\\"] + \\\":\\\" + feature[\\\"title\\\"];\\n\\treturn key;\\n}\",\n \"function buildMatrixLookup(arr) { \\n var lookup = {};\\n var index = arr.columns;\\n var verbal = index[0];\\n for(var i =0; i (obj[parseInt(key)] = Number(arr[i][key]),obj), {});\\n }\\n\\n return lookup;\\n}\",\n \"function km() { // km - short for \\\"Key Manager\\\"\\n return Array.prototype.slice.call(arguments).join(\\\":\\\");\\n}\",\n \"function get_coords_cat(i,j)\\n{\\n return {\\n \\\"x\\\": 18 + 40*i +(j % 2 == 1 ? 20:0),\\n \\\"y\\\": 20 + 35*j\\n };\\n}\",\n \"function J(a,b){this.l=[];this.kb=a;this.V=b||null;this.f=this.a=!1;this.b=void 0;this.C=this.ya=this.s=!1;this.i=0;this.c=null;this.A=0}\",\n \"function N(a,b){this.j=[];this.D=a;this.v=b||null;this.h=this.a=!1;this.g=void 0;this.I=this.K=this.p=!1;this.o=0;this.b=null;this.k=0}\",\n \"get Clustering() {}\",\n \"function EncodePair(word1, word2)\\n{\\n\\tlet code = EncodeWord(word1).concat(EncodeWord(word2));\\n\\t\\n\\tcode.push(1);\\n\\t\\n\\treturn code;\\n}\",\n \"function getJSF(k1, k2) {\\n\\t var jsf = [\\n\\t [],\\n\\t []\\n\\t ];\\n\\t\\n\\t k1 = k1.clone();\\n\\t k2 = k2.clone();\\n\\t var d1 = 0;\\n\\t var d2 = 0;\\n\\t while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\t\\n\\t // First phase\\n\\t var m14 = (k1.andln(3) + d1) & 3;\\n\\t var m24 = (k2.andln(3) + d2) & 3;\\n\\t if (m14 === 3)\\n\\t m14 = -1;\\n\\t if (m24 === 3)\\n\\t m24 = -1;\\n\\t var u1;\\n\\t if ((m14 & 1) === 0) {\\n\\t u1 = 0;\\n\\t } else {\\n\\t var m8 = (k1.andln(7) + d1) & 7;\\n\\t if ((m8 === 3 || m8 === 5) && m24 === 2)\\n\\t u1 = -m14;\\n\\t else\\n\\t u1 = m14;\\n\\t }\\n\\t jsf[0].push(u1);\\n\\t\\n\\t var u2;\\n\\t if ((m24 & 1) === 0) {\\n\\t u2 = 0;\\n\\t } else {\\n\\t var m8 = (k2.andln(7) + d2) & 7;\\n\\t if ((m8 === 3 || m8 === 5) && m14 === 2)\\n\\t u2 = -m24;\\n\\t else\\n\\t u2 = m24;\\n\\t }\\n\\t jsf[1].push(u2);\\n\\t\\n\\t // Second phase\\n\\t if (2 * d1 === u1 + 1)\\n\\t d1 = 1 - d1;\\n\\t if (2 * d2 === u2 + 1)\\n\\t d2 = 1 - d2;\\n\\t k1.iushrn(1);\\n\\t k2.iushrn(1);\\n\\t }\\n\\t\\n\\t return jsf;\\n\\t}\",\n \"function communityRepresentation() {\\n\\nfunction convertToBinaryArray(coordinates) {\\n\\n\\\"use strict\\\";\\n var coordInBinary = coordiates.toString(2); \\n \\n if(coordInBinary.length > 7) {\\n return [1,1,1,1,1,1,1,1];\\n\\n }\\n \\n while(coordInBinary.length < 7) { \\n coordInBinary = \\\"0\\\" + coordInBinary;\\n }\\n \\n // Convert string to array\\n return coordInBinary.split(\\\"\\\").map(function(i) {\\n return parseInt(i); }\\n );\\n}\\n\\nvar predictr = new synaptic.Architect.Perceptron(\\n\\n/* Remember to change numbers of neurons. */\\n 7, \\n 3,\\n 3, \\n 0\\n);\\n\\nvar trainingData = [];\\n\\nvar i;\\n\\nvar input;\\n\\nvar output;\\n\\n/* Add training data here. */\\ninput = [0,0,0,0,0,0,0,1];\\noutput = [1];\\n \\n trainingData.push({\\n input: input,\\n output: output\\n });\\n}\",\n \"init(){\\n if( this.a2i === undefined ){\\n this.a2i = {}\\n for( var k=0; k 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = (k1.andln(3) + d1) & 3;\\n var m24 = (k2.andln(3) + d2) & 3;\\n if (m14 === 3)\\n m14 = -1;\\n if (m24 === 3)\\n m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = (k1.andln(7) + d1) & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2)\\n u1 = -m14;\\n else\\n u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = (k2.andln(7) + d2) & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2)\\n u2 = -m24;\\n else\\n u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1)\\n d1 = 1 - d1;\\n if (2 * d2 === u2 + 1)\\n d2 = 1 - d2;\\n k1.ishrn(1);\\n k2.ishrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [\\n [],\\n []\\n ];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = (k1.andln(3) + d1) & 3;\\n var m24 = (k2.andln(3) + d2) & 3;\\n if (m14 === 3)\\n m14 = -1;\\n if (m24 === 3)\\n m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = (k1.andln(7) + d1) & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2)\\n u1 = -m14;\\n else\\n u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = (k2.andln(7) + d2) & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2)\\n u2 = -m24;\\n else\\n u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1)\\n d1 = 1 - d1;\\n if (2 * d2 === u2 + 1)\\n d2 = 1 - d2;\\n k1.ishrn(1);\\n k2.ishrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [\\n [],\\n []\\n ];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = (k1.andln(3) + d1) & 3;\\n var m24 = (k2.andln(3) + d2) & 3;\\n if (m14 === 3)\\n m14 = -1;\\n if (m24 === 3)\\n m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = (k1.andln(7) + d1) & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2)\\n u1 = -m14;\\n else\\n u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = (k2.andln(7) + d2) & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2)\\n u2 = -m24;\\n else\\n u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1)\\n d1 = 1 - d1;\\n if (2 * d2 === u2 + 1)\\n d2 = 1 - d2;\\n k1.ishrn(1);\\n k2.ishrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [\\n [],\\n []\\n ];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = (k1.andln(3) + d1) & 3;\\n var m24 = (k2.andln(3) + d2) & 3;\\n if (m14 === 3)\\n m14 = -1;\\n if (m24 === 3)\\n m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = (k1.andln(7) + d1) & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2)\\n u1 = -m14;\\n else\\n u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = (k2.andln(7) + d2) & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2)\\n u2 = -m24;\\n else\\n u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1)\\n d1 = 1 - d1;\\n if (2 * d2 === u2 + 1)\\n d2 = 1 - d2;\\n k1.ishrn(1);\\n k2.ishrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function getJSF(k1, k2) {\\n var jsf = [\\n [],\\n []\\n ];\\n\\n k1 = k1.clone();\\n k2 = k2.clone();\\n var d1 = 0;\\n var d2 = 0;\\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\\n\\n // First phase\\n var m14 = (k1.andln(3) + d1) & 3;\\n var m24 = (k2.andln(3) + d2) & 3;\\n if (m14 === 3)\\n m14 = -1;\\n if (m24 === 3)\\n m24 = -1;\\n var u1;\\n if ((m14 & 1) === 0) {\\n u1 = 0;\\n } else {\\n var m8 = (k1.andln(7) + d1) & 7;\\n if ((m8 === 3 || m8 === 5) && m24 === 2)\\n u1 = -m14;\\n else\\n u1 = m14;\\n }\\n jsf[0].push(u1);\\n\\n var u2;\\n if ((m24 & 1) === 0) {\\n u2 = 0;\\n } else {\\n var m8 = (k2.andln(7) + d2) & 7;\\n if ((m8 === 3 || m8 === 5) && m14 === 2)\\n u2 = -m24;\\n else\\n u2 = m24;\\n }\\n jsf[1].push(u2);\\n\\n // Second phase\\n if (2 * d1 === u1 + 1)\\n d1 = 1 - d1;\\n if (2 * d2 === u2 + 1)\\n d2 = 1 - d2;\\n k1.ishrn(1);\\n k2.ishrn(1);\\n }\\n\\n return jsf;\\n}\",\n \"function findTwoElementsUsingHash(K, matrix) {\\n // Define hash map using simple object\\n let hash = {};\\n let hasElements = false;\\n for (let index = 0; index < matrix.length; index++) {\\n const element = matrix[index];\\n // K = element + another_element\\n // another_element = K - element\\n const another_element = K - element;\\n // Check that another element is found in hash\\n if (another_element in hash) {\\n // If found return true\\n hasElements = true;\\n break;\\n }\\n // Otherwise add this new element to hash map and continue\\n hash[element] = 1;\\n }\\n return hasElements;\\n}\",\n \"function LinearConstraint(joint) {\\n\\n this.m1 = NaN;\\n this.m2 = NaN;\\n\\n this.ii1 = null;\\n this.ii2 = null;\\n this.dd = null;\\n\\n this.r1x = NaN;\\n this.r1y = NaN;\\n this.r1z = NaN;\\n\\n this.r2x = NaN;\\n this.r2y = NaN;\\n this.r2z = NaN;\\n\\n this.ax1x = NaN;\\n this.ax1y = NaN;\\n this.ax1z = NaN;\\n this.ay1x = NaN;\\n this.ay1y = NaN;\\n this.ay1z = NaN;\\n this.az1x = NaN;\\n this.az1y = NaN;\\n this.az1z = NaN;\\n\\n this.ax2x = NaN;\\n this.ax2y = NaN;\\n this.ax2z = NaN;\\n this.ay2x = NaN;\\n this.ay2y = NaN;\\n this.ay2z = NaN;\\n this.az2x = NaN;\\n this.az2y = NaN;\\n this.az2z = NaN;\\n\\n this.vel = NaN;\\n this.velx = NaN;\\n this.vely = NaN;\\n this.velz = NaN;\\n\\n this.joint = joint;\\n this.r1 = joint.relativeAnchorPoint1;\\n this.r2 = joint.relativeAnchorPoint2;\\n this.p1 = joint.anchorPoint1;\\n this.p2 = joint.anchorPoint2;\\n this.b1 = joint.body1;\\n this.b2 = joint.body2;\\n this.l1 = this.b1.linearVelocity;\\n this.l2 = this.b2.linearVelocity;\\n this.a1 = this.b1.angularVelocity;\\n this.a2 = this.b2.angularVelocity;\\n this.i1 = this.b1.inverseInertia;\\n this.i2 = this.b2.inverseInertia;\\n this.impx = 0;\\n this.impy = 0;\\n this.impz = 0;\\n}\",\n \"addEdge(v1, v2) {\\n if (v1 in this.adjacencyList && v2 in this.adjacencyList) {\\n this.adjacencyList[v1].push(v2);\\n this.adjacencyList[v2].push(v1);\\n }\\n }\",\n \"insertKnotV(vn, r) {\\r\\n let q = this.v_degree;\\r\\n // Knot will be inserted between [k,k+1)\\r\\n let k = helper_1.findSpan(this.v_degree, this.v_knots.data, vn);\\r\\n // If v already exists in knot vector, s is its multiplicity\\r\\n let s = common_1.count(this.v_knots, vn, 0);\\r\\n if (r + s > q) {\\r\\n throw new Error('Knot insertion exceeds knot multiplicity beyond degree');\\r\\n }\\r\\n let mU = this.u_knots.length - 1;\\r\\n let nU = mU - this.u_degree - 1;\\r\\n let mV = this.v_knots.length - 1;\\r\\n let nV = mV - this.v_degree - 1;\\r\\n let P = this.cpoints;\\r\\n let Q = common_1.empty([nU + 1, nV + r + 1, this.dimension]);\\r\\n let UP = this.u_knots;\\r\\n let UQ = common_1.empty([UP.length]);\\r\\n let VP = this.v_knots;\\r\\n let VQ = common_1.empty([VP.length + r]);\\r\\n // Copy u knot vector\\r\\n UQ.copyfrom(UP);\\r\\n // Load v knot vector\\r\\n for (let i = 0; i < k + 1; i++) {\\r\\n VQ.set(i, VP.get(i));\\r\\n }\\r\\n for (let i = 1; i < r + 1; i++) {\\r\\n VQ.set(k + i, vn);\\r\\n }\\r\\n for (let i = k + 1; i < mV + 1; i++) {\\r\\n VQ.set(i + r, VP.get(i));\\r\\n }\\r\\n let alpha = common_1.empty([q + 1, r + 1]);\\r\\n let R = common_1.empty([q + 1, this.dimension]);\\r\\n let L = 0;\\r\\n // Pre-calculate alphas\\r\\n for (let j = 1; j < r + 1; j++) {\\r\\n L = k - q + j;\\r\\n for (let i = 0; i < q - j - s + 1; i++) {\\r\\n alpha.set(i, j, (vn - VP.get(L + i)) / (VP.get(i + k + 1) - VP.get(L + i)));\\r\\n }\\r\\n }\\r\\n for (let col = 0; col < nU + 1; col++) {\\r\\n // Save unaltered control points\\r\\n for (let i = 0; i < k - q + 1; i++) {\\r\\n Q.set(col, i, P.get(col, i));\\r\\n }\\r\\n for (let i = k - s; i < nV + 1; i++) {\\r\\n Q.set(col, i + r, P.get(col, i));\\r\\n }\\r\\n // Load auxiliary control points\\r\\n for (let i = 0; i < q - s + 1; i++) {\\r\\n R.set(i, P.get(col, k - q + i));\\r\\n }\\r\\n for (let j = 1; j < r + 1; j++) {\\r\\n L = k - q + j;\\r\\n for (let i = 0; i < q - j - s + 1; i++) {\\r\\n R.set(i, common_1.add(common_1.mul(alpha.get(i, j), R.get(i + 1)), common_1.mul((1.0 - alpha.get(i, j)), R.get(i))));\\r\\n }\\r\\n Q.set(col, L, R.get(0));\\r\\n Q.set(col, k + r - j - s, R.get(q - j - s));\\r\\n }\\r\\n // Load remaining control points\\r\\n for (let i = L + 1; i < k - s; i++) {\\r\\n Q.set(col, i, R.get(i - L));\\r\\n }\\r\\n }\\r\\n this.cpoints = Q;\\r\\n this.v_knots = VQ;\\r\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.5769692","0.5731908","0.53482056","0.52648157","0.5132514","0.51150286","0.5110443","0.50927955","0.50731033","0.50641257","0.50608915","0.5059641","0.5027422","0.50183904","0.5014289","0.49767065","0.49767065","0.49767065","0.49522403","0.4840789","0.4811124","0.4804849","0.48002002","0.47599766","0.47433776","0.4740253","0.4732004","0.46942648","0.46817204","0.46745524","0.46722746","0.4666603","0.46561432","0.46218282","0.46205807","0.46192792","0.4614782","0.46078208","0.4601573","0.45993122","0.45957723","0.4589375","0.45884567","0.45858547","0.45664823","0.45518818","0.4547008","0.45409003","0.4534044","0.45337266","0.45151037","0.45126334","0.4512541","0.4511414","0.45046014","0.45046014","0.45046014","0.44957232","0.44957232","0.44957232","0.44957232","0.44957232","0.44957232","0.44957232","0.44779924","0.44753745","0.44718018","0.4455567","0.44523352","0.44340664","0.44294307","0.4427678","0.44214773","0.441031","0.44035006","0.44009313","0.438912","0.4387908","0.4378443","0.43660858","0.4365378","0.43604973","0.43449137","0.43435717","0.43435717","0.43435717","0.43435717","0.43435717","0.4342955","0.434248","0.43413916","0.43411765"],"string":"[\n \"0.5769692\",\n \"0.5731908\",\n \"0.53482056\",\n \"0.52648157\",\n \"0.5132514\",\n \"0.51150286\",\n \"0.5110443\",\n \"0.50927955\",\n \"0.50731033\",\n \"0.50641257\",\n \"0.50608915\",\n \"0.5059641\",\n \"0.5027422\",\n \"0.50183904\",\n \"0.5014289\",\n \"0.49767065\",\n \"0.49767065\",\n \"0.49767065\",\n \"0.49522403\",\n \"0.4840789\",\n \"0.4811124\",\n \"0.4804849\",\n \"0.48002002\",\n \"0.47599766\",\n \"0.47433776\",\n \"0.4740253\",\n \"0.4732004\",\n \"0.46942648\",\n \"0.46817204\",\n \"0.46745524\",\n \"0.46722746\",\n \"0.4666603\",\n \"0.46561432\",\n \"0.46218282\",\n \"0.46205807\",\n \"0.46192792\",\n \"0.4614782\",\n \"0.46078208\",\n \"0.4601573\",\n \"0.45993122\",\n \"0.45957723\",\n \"0.4589375\",\n \"0.45884567\",\n \"0.45858547\",\n \"0.45664823\",\n \"0.45518818\",\n \"0.4547008\",\n \"0.45409003\",\n \"0.4534044\",\n \"0.45337266\",\n \"0.45151037\",\n \"0.45126334\",\n \"0.4512541\",\n \"0.4511414\",\n \"0.45046014\",\n \"0.45046014\",\n \"0.45046014\",\n \"0.44957232\",\n \"0.44957232\",\n \"0.44957232\",\n \"0.44957232\",\n \"0.44957232\",\n \"0.44957232\",\n \"0.44957232\",\n \"0.44779924\",\n \"0.44753745\",\n \"0.44718018\",\n \"0.4455567\",\n \"0.44523352\",\n \"0.44340664\",\n \"0.44294307\",\n \"0.4427678\",\n \"0.44214773\",\n \"0.441031\",\n \"0.44035006\",\n \"0.44009313\",\n \"0.438912\",\n \"0.4387908\",\n \"0.4378443\",\n \"0.43660858\",\n \"0.4365378\",\n \"0.43604973\",\n \"0.43449137\",\n \"0.43435717\",\n \"0.43435717\",\n \"0.43435717\",\n \"0.43435717\",\n \"0.43435717\",\n \"0.4342955\",\n \"0.434248\",\n \"0.43413916\",\n \"0.43411765\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80795,"cells":{"query":{"kind":"string","value":"Copyright Joyent, Inc. and other Node contributors. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE."},"document":{"kind":"string","value":"function EventEmitter() {\n this._events = this._events || {};\n this._maxListeners = this._maxListeners || undefined;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function me(e,t,a,s){var n,i=arguments.length,r=i<3?t:null===s?s=Object.getOwnPropertyDescriptor(t,a):s;if(\"object\"==typeof Reflect&&\"function\"==typeof Reflect.decorate)r=Reflect.decorate(e,t,a,s);else for(var d=e.length-1;d>=0;d--)(n=e[d])&&(r=(i<3?n(r):i>3?n(t,a,r):n(t,a))||r);return i>3&&r&&Object.defineProperty(t,a,r),r\n/**\n * @license\n * Copyright 2016 Google Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */}","function n(r){return!!r.constructor&&typeof r.constructor.isBuffer==\"function\"&&r.constructor.isBuffer(r)}","function Generator() {} // 80","function r() {}","function r() {}","function r() {}","function i(e){var t=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),n=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),r=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),i=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),a=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),s=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),c=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),d=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),f=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),m=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),v=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),y=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),g=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),_=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),b=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),w=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),T=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),E=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),S=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),x=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),k=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),C=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),A=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),N=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),I=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x);(0,o.default)(e,{0:t,NetworkOrCORSError:t,400:n,BadRequest:n,401:r,Unauthorized:r,402:i,PaymentRequired:i,403:a,Forbidden:a,404:s,NotFound:s,405:c,MethodNotAllowed:c,406:d,NotAcceptable:d,407:f,ProxyAuthenticationRequired:f,408:m,RequestTimeout:m,409:v,Conflict:v,410:y,Gone:y,411:g,LengthRequired:g,412:_,PreconditionFailed:_,413:b,RequestEntityTooLarge:b,414:w,RequestUriTooLong:w,415:T,UnsupportedMediaType:T,416:E,RequestRangeNotSatisfiable:E,417:S,ExpectationFailed:S,500:x,InternalServerError:x,501:k,NotImplemented:k,502:C,BadGateway:C,503:A,ServiceUnavailable:A,504:N,GatewayTimeout:N,505:I,HttpVersionNotSupported:I,select:function(t){if(void 0===t||null===t)return e;t=t.statusCode||t;var n=e[t];return n||(t=t.toString().split(\"\").shift()+\"00\",t=parseInt(t,10),e[t]||e)}})}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}","function Generator() {} // 84","function require() { return {}; }","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function Util() {}","function n(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function lt(t,i){return t(i={exports:{}},i.exports),i.exports}","function c(e,t,n){Array.isArray(e)?(n=t,t=e,e=void 0):\"string\"!=typeof e&&(n=e,e=t=void 0),t&&!Array.isArray(t)&&(n=t,t=void 0),t||(t=[\"require\",\"exports\",\"module\"]),\n//Set up properties for this module. If an ID, then use\n//internal cache. If no ID, then use the external variables\n//for this node module.\ne?\n//Put the module in deep freeze until there is a\n//require call for it.\nd[e]=[e,t,n]:l(e,t,n)}","private public function m246() {}","function t(e){return!!e.constructor&&'function'==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function universalModule() {\n\t\t var $Object = Object;\n\n\t\tfunction createClass(ctor, methods, staticMethods, superClass) {\n\t\t var proto;\n\t\t if (superClass) {\n\t\t var superProto = superClass.prototype;\n\t\t proto = $Object.create(superProto);\n\t\t } else {\n\t\t proto = ctor.prototype;\n\t\t }\n\t\t $Object.keys(methods).forEach(function (key) {\n\t\t proto[key] = methods[key];\n\t\t });\n\t\t $Object.keys(staticMethods).forEach(function (key) {\n\t\t ctor[key] = staticMethods[key];\n\t\t });\n\t\t proto.constructor = ctor;\n\t\t ctor.prototype = proto;\n\t\t return ctor;\n\t\t}\n\n\t\tfunction superCall(self, proto, name, args) {\n\t\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\n\t\t}\n\n\t\tfunction defaultSuperCall(self, proto, args) {\n\t\t superCall(self, proto, 'constructor', args);\n\t\t}\n\n\t\tvar $traceurRuntime = {};\n\t\t$traceurRuntime.createClass = createClass;\n\t\t$traceurRuntime.superCall = superCall;\n\t\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\n\t\t\"use strict\";\n\t\tfunction is(valueA, valueB) {\n\t\t if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n\t\t return true;\n\t\t }\n\t\t if (!valueA || !valueB) {\n\t\t return false;\n\t\t }\n\t\t if (typeof valueA.valueOf === 'function' && typeof valueB.valueOf === 'function') {\n\t\t valueA = valueA.valueOf();\n\t\t valueB = valueB.valueOf();\n\t\t }\n\t\t return typeof valueA.equals === 'function' && typeof valueB.equals === 'function' ? valueA.equals(valueB) : valueA === valueB || (valueA !== valueA && valueB !== valueB);\n\t\t}\n\t\tfunction invariant(condition, error) {\n\t\t if (!condition)\n\t\t throw new Error(error);\n\t\t}\n\t\tvar DELETE = 'delete';\n\t\tvar SHIFT = 5;\n\t\tvar SIZE = 1 << SHIFT;\n\t\tvar MASK = SIZE - 1;\n\t\tvar NOT_SET = {};\n\t\tvar CHANGE_LENGTH = {value: false};\n\t\tvar DID_ALTER = {value: false};\n\t\tfunction MakeRef(ref) {\n\t\t ref.value = false;\n\t\t return ref;\n\t\t}\n\t\tfunction SetRef(ref) {\n\t\t ref && (ref.value = true);\n\t\t}\n\t\tfunction OwnerID() {}\n\t\tfunction arrCopy(arr, offset) {\n\t\t offset = offset || 0;\n\t\t var len = Math.max(0, arr.length - offset);\n\t\t var newArr = new Array(len);\n\t\t for (var ii = 0; ii < len; ii++) {\n\t\t newArr[ii] = arr[ii + offset];\n\t\t }\n\t\t return newArr;\n\t\t}\n\t\tfunction assertNotInfinite(size) {\n\t\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\n\t\t}\n\t\tfunction ensureSize(iter) {\n\t\t if (iter.size === undefined) {\n\t\t iter.size = iter.__iterate(returnTrue);\n\t\t }\n\t\t return iter.size;\n\t\t}\n\t\tfunction wrapIndex(iter, index) {\n\t\t return index >= 0 ? (+index) : ensureSize(iter) + (+index);\n\t\t}\n\t\tfunction returnTrue() {\n\t\t return true;\n\t\t}\n\t\tfunction wholeSlice(begin, end, size) {\n\t\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\n\t\t}\n\t\tfunction resolveBegin(begin, size) {\n\t\t return resolveIndex(begin, size, 0);\n\t\t}\n\t\tfunction resolveEnd(end, size) {\n\t\t return resolveIndex(end, size, size);\n\t\t}\n\t\tfunction resolveIndex(index, size, defaultIndex) {\n\t\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\n\t\t}\n\t\tvar imul = typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ? Math.imul : function imul(a, b) {\n\t\t a = a | 0;\n\t\t b = b | 0;\n\t\t var c = a & 0xffff;\n\t\t var d = b & 0xffff;\n\t\t return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0;\n\t\t};\n\t\tfunction smi(i32) {\n\t\t return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\n\t\t}\n\t\tfunction hash(o) {\n\t\t if (o === false || o === null || o === undefined) {\n\t\t return 0;\n\t\t }\n\t\t if (typeof o.valueOf === 'function') {\n\t\t o = o.valueOf();\n\t\t if (o === false || o === null || o === undefined) {\n\t\t return 0;\n\t\t }\n\t\t }\n\t\t if (o === true) {\n\t\t return 1;\n\t\t }\n\t\t var type = typeof o;\n\t\t if (type === 'number') {\n\t\t var h = o | 0;\n\t\t while (o > 0xFFFFFFFF) {\n\t\t o /= 0xFFFFFFFF;\n\t\t h ^= o;\n\t\t }\n\t\t return smi(h);\n\t\t }\n\t\t if (type === 'string') {\n\t\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n\t\t }\n\t\t if (typeof o.hashCode === 'function') {\n\t\t return o.hashCode();\n\t\t }\n\t\t return hashJSObj(o);\n\t\t}\n\t\tfunction cachedHashString(string) {\n\t\t var hash = stringHashCache[string];\n\t\t if (hash === undefined) {\n\t\t hash = hashString(string);\n\t\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n\t\t STRING_HASH_CACHE_SIZE = 0;\n\t\t stringHashCache = {};\n\t\t }\n\t\t STRING_HASH_CACHE_SIZE++;\n\t\t stringHashCache[string] = hash;\n\t\t }\n\t\t return hash;\n\t\t}\n\t\tfunction hashString(string) {\n\t\t var hash = 0;\n\t\t for (var ii = 0; ii < string.length; ii++) {\n\t\t hash = 31 * hash + string.charCodeAt(ii) | 0;\n\t\t }\n\t\t return smi(hash);\n\t\t}\n\t\tfunction hashJSObj(obj) {\n\t\t var hash = weakMap && weakMap.get(obj);\n\t\t if (hash)\n\t\t return hash;\n\t\t hash = obj[UID_HASH_KEY];\n\t\t if (hash)\n\t\t return hash;\n\t\t if (!canDefineProperty) {\n\t\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n\t\t if (hash)\n\t\t return hash;\n\t\t hash = getIENodeHash(obj);\n\t\t if (hash)\n\t\t return hash;\n\t\t }\n\t\t if (Object.isExtensible && !Object.isExtensible(obj)) {\n\t\t throw new Error('Non-extensible objects are not allowed as keys.');\n\t\t }\n\t\t hash = ++objHashUID;\n\t\t if (objHashUID & 0x40000000) {\n\t\t objHashUID = 0;\n\t\t }\n\t\t if (weakMap) {\n\t\t weakMap.set(obj, hash);\n\t\t } else if (canDefineProperty) {\n\t\t Object.defineProperty(obj, UID_HASH_KEY, {\n\t\t 'enumerable': false,\n\t\t 'configurable': false,\n\t\t 'writable': false,\n\t\t 'value': hash\n\t\t });\n\t\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n\t\t obj.propertyIsEnumerable = function() {\n\t\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n\t\t };\n\t\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n\t\t } else if (obj.nodeType) {\n\t\t obj[UID_HASH_KEY] = hash;\n\t\t } else {\n\t\t throw new Error('Unable to set a non-enumerable property on object.');\n\t\t }\n\t\t return hash;\n\t\t}\n\t\tvar canDefineProperty = (function() {\n\t\t try {\n\t\t Object.defineProperty({}, 'x', {});\n\t\t return true;\n\t\t } catch (e) {\n\t\t return false;\n\t\t }\n\t\t}());\n\t\tfunction getIENodeHash(node) {\n\t\t if (node && node.nodeType > 0) {\n\t\t switch (node.nodeType) {\n\t\t case 1:\n\t\t return node.uniqueID;\n\t\t case 9:\n\t\t return node.documentElement && node.documentElement.uniqueID;\n\t\t }\n\t\t }\n\t\t}\n\t\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\n\t\tvar objHashUID = 0;\n\t\tvar UID_HASH_KEY = '__immutablehash__';\n\t\tif (typeof Symbol === 'function') {\n\t\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\n\t\t}\n\t\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\n\t\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\n\t\tvar STRING_HASH_CACHE_SIZE = 0;\n\t\tvar stringHashCache = {};\n\t\tvar ITERATE_KEYS = 0;\n\t\tvar ITERATE_VALUES = 1;\n\t\tvar ITERATE_ENTRIES = 2;\n\t\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\n\t\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n\t\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\t\tvar Iterator = function Iterator(next) {\n\t\t this.next = next;\n\t\t};\n\t\t($traceurRuntime.createClass)(Iterator, {toString: function() {\n\t\t return '[Iterator]';\n\t\t }}, {});\n\t\tIterator.KEYS = ITERATE_KEYS;\n\t\tIterator.VALUES = ITERATE_VALUES;\n\t\tIterator.ENTRIES = ITERATE_ENTRIES;\n\t\tvar IteratorPrototype = Iterator.prototype;\n\t\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\n\t\t return this.toString();\n\t\t};\n\t\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\n\t\t return this;\n\t\t};\n\t\tfunction iteratorValue(type, k, v, iteratorResult) {\n\t\t var value = type === 0 ? k : type === 1 ? v : [k, v];\n\t\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n\t\t value: value,\n\t\t done: false\n\t\t });\n\t\t return iteratorResult;\n\t\t}\n\t\tfunction iteratorDone() {\n\t\t return {\n\t\t value: undefined,\n\t\t done: true\n\t\t };\n\t\t}\n\t\tfunction hasIterator(maybeIterable) {\n\t\t return !!_iteratorFn(maybeIterable);\n\t\t}\n\t\tfunction isIterator(maybeIterator) {\n\t\t return maybeIterator && typeof maybeIterator.next === 'function';\n\t\t}\n\t\tfunction getIterator(iterable) {\n\t\t var iteratorFn = _iteratorFn(iterable);\n\t\t return iteratorFn && iteratorFn.call(iterable);\n\t\t}\n\t\tfunction _iteratorFn(iterable) {\n\t\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\n\t\t if (typeof iteratorFn === 'function') {\n\t\t return iteratorFn;\n\t\t }\n\t\t}\n\t\tvar Iterable = function Iterable(value) {\n\t\t return isIterable(value) ? value : Seq(value);\n\t\t};\n\t\tvar $Iterable = Iterable;\n\t\t($traceurRuntime.createClass)(Iterable, {\n\t\t toArray: function() {\n\t\t assertNotInfinite(this.size);\n\t\t var array = new Array(this.size || 0);\n\t\t this.valueSeq().__iterate((function(v, i) {\n\t\t array[i] = v;\n\t\t }));\n\t\t return array;\n\t\t },\n\t\t toIndexedSeq: function() {\n\t\t return new ToIndexedSequence(this);\n\t\t },\n\t\t toJS: function() {\n\t\t return this.toSeq().map((function(value) {\n\t\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\n\t\t })).__toJS();\n\t\t },\n\t\t toKeyedSeq: function() {\n\t\t return new ToKeyedSequence(this, true);\n\t\t },\n\t\t toMap: function() {\n\t\t return Map(this.toKeyedSeq());\n\t\t },\n\t\t toObject: function() {\n\t\t assertNotInfinite(this.size);\n\t\t var object = {};\n\t\t this.__iterate((function(v, k) {\n\t\t object[k] = v;\n\t\t }));\n\t\t return object;\n\t\t },\n\t\t toOrderedMap: function() {\n\t\t return OrderedMap(this.toKeyedSeq());\n\t\t },\n\t\t toOrderedSet: function() {\n\t\t return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toSet: function() {\n\t\t return Set(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toSetSeq: function() {\n\t\t return new ToSetSequence(this);\n\t\t },\n\t\t toSeq: function() {\n\t\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\n\t\t },\n\t\t toStack: function() {\n\t\t return Stack(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toList: function() {\n\t\t return List(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toString: function() {\n\t\t return '[Iterable]';\n\t\t },\n\t\t __toString: function(head, tail) {\n\t\t if (this.size === 0) {\n\t\t return head + tail;\n\t\t }\n\t\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n\t\t },\n\t\t concat: function() {\n\t\t for (var values = [],\n\t\t $__2 = 0; $__2 < arguments.length; $__2++)\n\t\t values[$__2] = arguments[$__2];\n\t\t return reify(this, concatFactory(this, values));\n\t\t },\n\t\t contains: function(searchValue) {\n\t\t return this.some((function(value) {\n\t\t return is(value, searchValue);\n\t\t }));\n\t\t },\n\t\t entries: function() {\n\t\t return this.__iterator(ITERATE_ENTRIES);\n\t\t },\n\t\t every: function(predicate, context) {\n\t\t assertNotInfinite(this.size);\n\t\t var returnValue = true;\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (!predicate.call(context, v, k, c)) {\n\t\t returnValue = false;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return returnValue;\n\t\t },\n\t\t filter: function(predicate, context) {\n\t\t return reify(this, filterFactory(this, predicate, context, true));\n\t\t },\n\t\t find: function(predicate, context, notSetValue) {\n\t\t var foundValue = notSetValue;\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (predicate.call(context, v, k, c)) {\n\t\t foundValue = v;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return foundValue;\n\t\t },\n\t\t forEach: function(sideEffect, context) {\n\t\t assertNotInfinite(this.size);\n\t\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n\t\t },\n\t\t join: function(separator) {\n\t\t assertNotInfinite(this.size);\n\t\t separator = separator !== undefined ? '' + separator : ',';\n\t\t var joined = '';\n\t\t var isFirst = true;\n\t\t this.__iterate((function(v) {\n\t\t isFirst ? (isFirst = false) : (joined += separator);\n\t\t joined += v !== null && v !== undefined ? v : '';\n\t\t }));\n\t\t return joined;\n\t\t },\n\t\t keys: function() {\n\t\t return this.__iterator(ITERATE_KEYS);\n\t\t },\n\t\t map: function(mapper, context) {\n\t\t return reify(this, mapFactory(this, mapper, context));\n\t\t },\n\t\t reduce: function(reducer, initialReduction, context) {\n\t\t assertNotInfinite(this.size);\n\t\t var reduction;\n\t\t var useFirst;\n\t\t if (arguments.length < 2) {\n\t\t useFirst = true;\n\t\t } else {\n\t\t reduction = initialReduction;\n\t\t }\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (useFirst) {\n\t\t useFirst = false;\n\t\t reduction = v;\n\t\t } else {\n\t\t reduction = reducer.call(context, reduction, v, k, c);\n\t\t }\n\t\t }));\n\t\t return reduction;\n\t\t },\n\t\t reduceRight: function(reducer, initialReduction, context) {\n\t\t var reversed = this.toKeyedSeq().reverse();\n\t\t return reversed.reduce.apply(reversed, arguments);\n\t\t },\n\t\t reverse: function() {\n\t\t return reify(this, reverseFactory(this, true));\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t if (wholeSlice(begin, end, this.size)) {\n\t\t return this;\n\t\t }\n\t\t var resolvedBegin = resolveBegin(begin, this.size);\n\t\t var resolvedEnd = resolveEnd(end, this.size);\n\t\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n\t\t return this.toSeq().cacheResult().slice(begin, end);\n\t\t }\n\t\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\n\t\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\n\t\t },\n\t\t some: function(predicate, context) {\n\t\t return !this.every(not(predicate), context);\n\t\t },\n\t\t sort: function(comparator) {\n\t\t return reify(this, sortFactory(this, comparator));\n\t\t },\n\t\t values: function() {\n\t\t return this.__iterator(ITERATE_VALUES);\n\t\t },\n\t\t butLast: function() {\n\t\t return this.slice(0, -1);\n\t\t },\n\t\t count: function(predicate, context) {\n\t\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\n\t\t },\n\t\t countBy: function(grouper, context) {\n\t\t return countByFactory(this, grouper, context);\n\t\t },\n\t\t equals: function(other) {\n\t\t return deepEqual(this, other);\n\t\t },\n\t\t entrySeq: function() {\n\t\t var iterable = this;\n\t\t if (iterable._cache) {\n\t\t return new ArraySeq(iterable._cache);\n\t\t }\n\t\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n\t\t entriesSequence.fromEntrySeq = (function() {\n\t\t return iterable.toSeq();\n\t\t });\n\t\t return entriesSequence;\n\t\t },\n\t\t filterNot: function(predicate, context) {\n\t\t return this.filter(not(predicate), context);\n\t\t },\n\t\t findLast: function(predicate, context, notSetValue) {\n\t\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n\t\t },\n\t\t first: function() {\n\t\t return this.find(returnTrue);\n\t\t },\n\t\t flatMap: function(mapper, context) {\n\t\t return reify(this, flatMapFactory(this, mapper, context));\n\t\t },\n\t\t flatten: function(depth) {\n\t\t return reify(this, flattenFactory(this, depth, true));\n\t\t },\n\t\t fromEntrySeq: function() {\n\t\t return new FromEntriesSequence(this);\n\t\t },\n\t\t get: function(searchKey, notSetValue) {\n\t\t return this.find((function(_, key) {\n\t\t return is(key, searchKey);\n\t\t }), undefined, notSetValue);\n\t\t },\n\t\t getIn: function(searchKeyPath, notSetValue) {\n\t\t var nested = this;\n\t\t if (searchKeyPath) {\n\t\t var iter = getIterator(searchKeyPath) || getIterator($Iterable(searchKeyPath));\n\t\t var step;\n\t\t while (!(step = iter.next()).done) {\n\t\t var key = step.value;\n\t\t nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\n\t\t if (nested === NOT_SET) {\n\t\t return notSetValue;\n\t\t }\n\t\t }\n\t\t }\n\t\t return nested;\n\t\t },\n\t\t groupBy: function(grouper, context) {\n\t\t return groupByFactory(this, grouper, context);\n\t\t },\n\t\t has: function(searchKey) {\n\t\t return this.get(searchKey, NOT_SET) !== NOT_SET;\n\t\t },\n\t\t hasIn: function(searchKeyPath) {\n\t\t return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\n\t\t },\n\t\t isSubset: function(iter) {\n\t\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\n\t\t return this.every((function(value) {\n\t\t return iter.contains(value);\n\t\t }));\n\t\t },\n\t\t isSuperset: function(iter) {\n\t\t return iter.isSubset(this);\n\t\t },\n\t\t keySeq: function() {\n\t\t return this.toSeq().map(keyMapper).toIndexedSeq();\n\t\t },\n\t\t last: function() {\n\t\t return this.toSeq().reverse().first();\n\t\t },\n\t\t max: function(comparator) {\n\t\t return maxFactory(this, comparator);\n\t\t },\n\t\t maxBy: function(mapper, comparator) {\n\t\t return maxFactory(this, comparator, mapper);\n\t\t },\n\t\t min: function(comparator) {\n\t\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\n\t\t },\n\t\t minBy: function(mapper, comparator) {\n\t\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\n\t\t },\n\t\t rest: function() {\n\t\t return this.slice(1);\n\t\t },\n\t\t skip: function(amount) {\n\t\t return reify(this, skipFactory(this, amount, true));\n\t\t },\n\t\t skipLast: function(amount) {\n\t\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\n\t\t },\n\t\t skipWhile: function(predicate, context) {\n\t\t return reify(this, skipWhileFactory(this, predicate, context, true));\n\t\t },\n\t\t skipUntil: function(predicate, context) {\n\t\t return this.skipWhile(not(predicate), context);\n\t\t },\n\t\t sortBy: function(mapper, comparator) {\n\t\t return reify(this, sortFactory(this, comparator, mapper));\n\t\t },\n\t\t take: function(amount) {\n\t\t return reify(this, takeFactory(this, amount));\n\t\t },\n\t\t takeLast: function(amount) {\n\t\t return reify(this, this.toSeq().reverse().take(amount).reverse());\n\t\t },\n\t\t takeWhile: function(predicate, context) {\n\t\t return reify(this, takeWhileFactory(this, predicate, context));\n\t\t },\n\t\t takeUntil: function(predicate, context) {\n\t\t return this.takeWhile(not(predicate), context);\n\t\t },\n\t\t valueSeq: function() {\n\t\t return this.toIndexedSeq();\n\t\t },\n\t\t hashCode: function() {\n\t\t return this.__hash || (this.__hash = hashIterable(this));\n\t\t }\n\t\t}, {});\n\t\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n\t\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n\t\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n\t\tvar IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\t\tvar IterablePrototype = Iterable.prototype;\n\t\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\n\t\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n\t\tIterablePrototype.toJSON = IterablePrototype.toJS;\n\t\tIterablePrototype.__toJS = IterablePrototype.toArray;\n\t\tIterablePrototype.__toStringMapper = quoteString;\n\t\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\n\t\t return this.toString();\n\t\t};\n\t\tIterablePrototype.chain = IterablePrototype.flatMap;\n\t\t(function() {\n\t\t try {\n\t\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\n\t\t if (!Iterable.noLengthWarning) {\n\t\t var stack;\n\t\t try {\n\t\t throw new Error();\n\t\t } catch (error) {\n\t\t stack = error.stack;\n\t\t }\n\t\t if (stack.indexOf('_wrapObject') === -1) {\n\t\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\n\t\t return this.size;\n\t\t }\n\t\t }\n\t\t }});\n\t\t } catch (e) {}\n\t\t})();\n\t\tvar KeyedIterable = function KeyedIterable(value) {\n\t\t return isKeyed(value) ? value : KeyedSeq(value);\n\t\t};\n\t\t($traceurRuntime.createClass)(KeyedIterable, {\n\t\t flip: function() {\n\t\t return reify(this, flipFactory(this));\n\t\t },\n\t\t findKey: function(predicate, context) {\n\t\t var foundKey;\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (predicate.call(context, v, k, c)) {\n\t\t foundKey = k;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return foundKey;\n\t\t },\n\t\t findLastKey: function(predicate, context) {\n\t\t return this.toSeq().reverse().findKey(predicate, context);\n\t\t },\n\t\t keyOf: function(searchValue) {\n\t\t return this.findKey((function(value) {\n\t\t return is(value, searchValue);\n\t\t }));\n\t\t },\n\t\t lastKeyOf: function(searchValue) {\n\t\t return this.toSeq().reverse().keyOf(searchValue);\n\t\t },\n\t\t mapEntries: function(mapper, context) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t return reify(this, this.toSeq().map((function(v, k) {\n\t\t return mapper.call(context, [k, v], iterations++, $__0);\n\t\t })).fromEntrySeq());\n\t\t },\n\t\t mapKeys: function(mapper, context) {\n\t\t var $__0 = this;\n\t\t return reify(this, this.toSeq().flip().map((function(k, v) {\n\t\t return mapper.call(context, k, v, $__0);\n\t\t })).flip());\n\t\t }\n\t\t}, {}, Iterable);\n\t\tvar KeyedIterablePrototype = KeyedIterable.prototype;\n\t\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n\t\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n\t\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n\t\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\n\t\t return k + ': ' + quoteString(v);\n\t\t});\n\t\tvar IndexedIterable = function IndexedIterable(value) {\n\t\t return isIndexed(value) ? value : IndexedSeq(value);\n\t\t};\n\t\t($traceurRuntime.createClass)(IndexedIterable, {\n\t\t toKeyedSeq: function() {\n\t\t return new ToKeyedSequence(this, false);\n\t\t },\n\t\t filter: function(predicate, context) {\n\t\t return reify(this, filterFactory(this, predicate, context, false));\n\t\t },\n\t\t findIndex: function(predicate, context) {\n\t\t var key = this.toKeyedSeq().findKey(predicate, context);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t indexOf: function(searchValue) {\n\t\t var key = this.toKeyedSeq().keyOf(searchValue);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t lastIndexOf: function(searchValue) {\n\t\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t reverse: function() {\n\t\t return reify(this, reverseFactory(this, false));\n\t\t },\n\t\t splice: function(index, removeNum) {\n\t\t var numArgs = arguments.length;\n\t\t removeNum = Math.max(removeNum | 0, 0);\n\t\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n\t\t return this;\n\t\t }\n\t\t index = resolveBegin(index, this.size);\n\t\t var spliced = this.slice(0, index);\n\t\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\n\t\t },\n\t\t findLastIndex: function(predicate, context) {\n\t\t var key = this.toKeyedSeq().findLastKey(predicate, context);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t first: function() {\n\t\t return this.get(0);\n\t\t },\n\t\t flatten: function(depth) {\n\t\t return reify(this, flattenFactory(this, depth, false));\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\n\t\t return key === index;\n\t\t }), undefined, notSetValue);\n\t\t },\n\t\t has: function(index) {\n\t\t index = wrapIndex(this, index);\n\t\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\n\t\t },\n\t\t interpose: function(separator) {\n\t\t return reify(this, interposeFactory(this, separator));\n\t\t },\n\t\t last: function() {\n\t\t return this.get(-1);\n\t\t },\n\t\t skip: function(amount) {\n\t\t var iter = this;\n\t\t var skipSeq = skipFactory(iter, amount, false);\n\t\t if (isSeq(iter) && skipSeq !== iter) {\n\t\t skipSeq.get = function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\n\t\t };\n\t\t }\n\t\t return reify(this, skipSeq);\n\t\t },\n\t\t skipWhile: function(predicate, context) {\n\t\t return reify(this, skipWhileFactory(this, predicate, context, false));\n\t\t },\n\t\t take: function(amount) {\n\t\t var iter = this;\n\t\t var takeSeq = takeFactory(iter, amount);\n\t\t if (isSeq(iter) && takeSeq !== iter) {\n\t\t takeSeq.get = function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\n\t\t };\n\t\t }\n\t\t return reify(this, takeSeq);\n\t\t }\n\t\t}, {}, Iterable);\n\t\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n\t\tIndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tvar SetIterable = function SetIterable(value) {\n\t\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n\t\t};\n\t\t($traceurRuntime.createClass)(SetIterable, {\n\t\t get: function(value, notSetValue) {\n\t\t return this.has(value) ? value : notSetValue;\n\t\t },\n\t\t contains: function(value) {\n\t\t return this.has(value);\n\t\t },\n\t\t keySeq: function() {\n\t\t return this.valueSeq();\n\t\t }\n\t\t}, {}, Iterable);\n\t\tSetIterable.prototype.has = IterablePrototype.contains;\n\t\tfunction isIterable(maybeIterable) {\n\t\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n\t\t}\n\t\tfunction isKeyed(maybeKeyed) {\n\t\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n\t\t}\n\t\tfunction isIndexed(maybeIndexed) {\n\t\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n\t\t}\n\t\tfunction isAssociative(maybeAssociative) {\n\t\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n\t\t}\n\t\tfunction isOrdered(maybeOrdered) {\n\t\t return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\n\t\t}\n\t\tIterable.isIterable = isIterable;\n\t\tIterable.isKeyed = isKeyed;\n\t\tIterable.isIndexed = isIndexed;\n\t\tIterable.isAssociative = isAssociative;\n\t\tIterable.isOrdered = isOrdered;\n\t\tIterable.Keyed = KeyedIterable;\n\t\tIterable.Indexed = IndexedIterable;\n\t\tIterable.Set = SetIterable;\n\t\tIterable.Iterator = Iterator;\n\t\tfunction keyMapper(v, k) {\n\t\t return k;\n\t\t}\n\t\tfunction entryMapper(v, k) {\n\t\t return [k, v];\n\t\t}\n\t\tfunction not(predicate) {\n\t\t return function() {\n\t\t return !predicate.apply(this, arguments);\n\t\t };\n\t\t}\n\t\tfunction neg(predicate) {\n\t\t return function() {\n\t\t return -predicate.apply(this, arguments);\n\t\t };\n\t\t}\n\t\tfunction quoteString(value) {\n\t\t return typeof value === 'string' ? JSON.stringify(value) : value;\n\t\t}\n\t\tfunction defaultNegComparator(a, b) {\n\t\t return a < b ? 1 : a > b ? -1 : 0;\n\t\t}\n\t\tfunction deepEqual(a, b) {\n\t\t if (a === b) {\n\t\t return true;\n\t\t }\n\t\t if (!isIterable(b) || a.size !== undefined && b.size !== undefined && a.size !== b.size || a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash || isKeyed(a) !== isKeyed(b) || isIndexed(a) !== isIndexed(b) || isOrdered(a) !== isOrdered(b)) {\n\t\t return false;\n\t\t }\n\t\t if (a.size === 0 && b.size === 0) {\n\t\t return true;\n\t\t }\n\t\t var notAssociative = !isAssociative(a);\n\t\t if (isOrdered(a)) {\n\t\t var entries = a.entries();\n\t\t return b.every((function(v, k) {\n\t\t var entry = entries.next().value;\n\t\t return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\n\t\t })) && entries.next().done;\n\t\t }\n\t\t var flipped = false;\n\t\t if (a.size === undefined) {\n\t\t if (b.size === undefined) {\n\t\t a.cacheResult();\n\t\t } else {\n\t\t flipped = true;\n\t\t var _ = a;\n\t\t a = b;\n\t\t b = _;\n\t\t }\n\t\t }\n\t\t var allEqual = true;\n\t\t var bSize = b.__iterate((function(v, k) {\n\t\t if (notAssociative ? !a.has(v) : flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\n\t\t allEqual = false;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return allEqual && a.size === bSize;\n\t\t}\n\t\tfunction hashIterable(iterable) {\n\t\t if (iterable.size === Infinity) {\n\t\t return 0;\n\t\t }\n\t\t var ordered = isOrdered(iterable);\n\t\t var keyed = isKeyed(iterable);\n\t\t var h = ordered ? 1 : 0;\n\t\t var size = iterable.__iterate(keyed ? ordered ? (function(v, k) {\n\t\t h = 31 * h + hashMerge(hash(v), hash(k)) | 0;\n\t\t }) : (function(v, k) {\n\t\t h = h + hashMerge(hash(v), hash(k)) | 0;\n\t\t }) : ordered ? (function(v) {\n\t\t h = 31 * h + hash(v) | 0;\n\t\t }) : (function(v) {\n\t\t h = h + hash(v) | 0;\n\t\t }));\n\t\t return murmurHashOfSize(size, h);\n\t\t}\n\t\tfunction murmurHashOfSize(size, h) {\n\t\t h = imul(h, 0xCC9E2D51);\n\t\t h = imul(h << 15 | h >>> -15, 0x1B873593);\n\t\t h = imul(h << 13 | h >>> -13, 5);\n\t\t h = (h + 0xE6546B64 | 0) ^ size;\n\t\t h = imul(h ^ h >>> 16, 0x85EBCA6B);\n\t\t h = imul(h ^ h >>> 13, 0xC2B2AE35);\n\t\t h = smi(h ^ h >>> 16);\n\t\t return h;\n\t\t}\n\t\tfunction hashMerge(a, b) {\n\t\t return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0;\n\t\t}\n\t\tfunction mixin(ctor, methods) {\n\t\t var proto = ctor.prototype;\n\t\t var keyCopier = (function(key) {\n\t\t proto[key] = methods[key];\n\t\t });\n\t\t Object.keys(methods).forEach(keyCopier);\n\t\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n\t\t return ctor;\n\t\t}\n\t\tvar Seq = function Seq(value) {\n\t\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\n\t\t};\n\t\tvar $Seq = Seq;\n\t\t($traceurRuntime.createClass)(Seq, {\n\t\t toSeq: function() {\n\t\t return this;\n\t\t },\n\t\t toString: function() {\n\t\t return this.__toString('Seq {', '}');\n\t\t },\n\t\t cacheResult: function() {\n\t\t if (!this._cache && this.__iterateUncached) {\n\t\t this._cache = this.entrySeq().toArray();\n\t\t this.size = this._cache.length;\n\t\t }\n\t\t return this;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t return seqIterate(this, fn, reverse, true);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return seqIterator(this, type, reverse, true);\n\t\t }\n\t\t}, {of: function() {\n\t\t return $Seq(arguments);\n\t\t }}, Iterable);\n\t\tvar KeyedSeq = function KeyedSeq(value) {\n\t\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\n\t\t};\n\t\tvar $KeyedSeq = KeyedSeq;\n\t\t($traceurRuntime.createClass)(KeyedSeq, {\n\t\t toKeyedSeq: function() {\n\t\t return this;\n\t\t },\n\t\t toSeq: function() {\n\t\t return this;\n\t\t }\n\t\t}, {of: function() {\n\t\t return $KeyedSeq(arguments);\n\t\t }}, Seq);\n\t\tmixin(KeyedSeq, KeyedIterable.prototype);\n\t\tvar IndexedSeq = function IndexedSeq(value) {\n\t\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n\t\t};\n\t\tvar $IndexedSeq = IndexedSeq;\n\t\t($traceurRuntime.createClass)(IndexedSeq, {\n\t\t toIndexedSeq: function() {\n\t\t return this;\n\t\t },\n\t\t toString: function() {\n\t\t return this.__toString('Seq [', ']');\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t return seqIterate(this, fn, reverse, false);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return seqIterator(this, type, reverse, false);\n\t\t }\n\t\t}, {of: function() {\n\t\t return $IndexedSeq(arguments);\n\t\t }}, Seq);\n\t\tmixin(IndexedSeq, IndexedIterable.prototype);\n\t\tvar SetSeq = function SetSeq(value) {\n\t\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\n\t\t};\n\t\tvar $SetSeq = SetSeq;\n\t\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\n\t\t return this;\n\t\t }}, {of: function() {\n\t\t return $SetSeq(arguments);\n\t\t }}, Seq);\n\t\tmixin(SetSeq, SetIterable.prototype);\n\t\tSeq.isSeq = isSeq;\n\t\tSeq.Keyed = KeyedSeq;\n\t\tSeq.Set = SetSeq;\n\t\tSeq.Indexed = IndexedSeq;\n\t\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\t\tSeq.prototype[IS_SEQ_SENTINEL] = true;\n\t\tvar ArraySeq = function ArraySeq(array) {\n\t\t this._array = array;\n\t\t this.size = array.length;\n\t\t};\n\t\t($traceurRuntime.createClass)(ArraySeq, {\n\t\t get: function(index, notSetValue) {\n\t\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var array = this._array;\n\t\t var maxIndex = array.length - 1;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var array = this._array;\n\t\t var maxIndex = array.length - 1;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar ObjectSeq = function ObjectSeq(object) {\n\t\t var keys = Object.keys(object);\n\t\t this._object = object;\n\t\t this._keys = keys;\n\t\t this.size = keys.length;\n\t\t};\n\t\t($traceurRuntime.createClass)(ObjectSeq, {\n\t\t get: function(key, notSetValue) {\n\t\t if (notSetValue !== undefined && !this.has(key)) {\n\t\t return notSetValue;\n\t\t }\n\t\t return this._object[key];\n\t\t },\n\t\t has: function(key) {\n\t\t return this._object.hasOwnProperty(key);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var object = this._object;\n\t\t var keys = this._keys;\n\t\t var maxIndex = keys.length - 1;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t var key = keys[reverse ? maxIndex - ii : ii];\n\t\t if (fn(object[key], key, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var object = this._object;\n\t\t var keys = this._keys;\n\t\t var maxIndex = keys.length - 1;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t var key = keys[reverse ? maxIndex - ii : ii];\n\t\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\n\t\t }));\n\t\t }\n\t\t}, {}, KeyedSeq);\n\t\tObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tvar IterableSeq = function IterableSeq(iterable) {\n\t\t this._iterable = iterable;\n\t\t this.size = iterable.length || iterable.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(IterableSeq, {\n\t\t __iterateUncached: function(fn, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterable = this._iterable;\n\t\t var iterator = getIterator(iterable);\n\t\t var iterations = 0;\n\t\t if (isIterator(iterator)) {\n\t\t var step;\n\t\t while (!(step = iterator.next()).done) {\n\t\t if (fn(step.value, iterations++, this) === false) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t }\n\t\t return iterations;\n\t\t },\n\t\t __iteratorUncached: function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterable = this._iterable;\n\t\t var iterator = getIterator(iterable);\n\t\t if (!isIterator(iterator)) {\n\t\t return new Iterator(iteratorDone);\n\t\t }\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, iterations++, step.value);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar IteratorSeq = function IteratorSeq(iterator) {\n\t\t this._iterator = iterator;\n\t\t this._iteratorCache = [];\n\t\t};\n\t\t($traceurRuntime.createClass)(IteratorSeq, {\n\t\t __iterateUncached: function(fn, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterator = this._iterator;\n\t\t var cache = this._iteratorCache;\n\t\t var iterations = 0;\n\t\t while (iterations < cache.length) {\n\t\t if (fn(cache[iterations], iterations++, this) === false) {\n\t\t return iterations;\n\t\t }\n\t\t }\n\t\t var step;\n\t\t while (!(step = iterator.next()).done) {\n\t\t var val = step.value;\n\t\t cache[iterations] = val;\n\t\t if (fn(val, iterations++, this) === false) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t return iterations;\n\t\t },\n\t\t __iteratorUncached: function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = this._iterator;\n\t\t var cache = this._iteratorCache;\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t if (iterations >= cache.length) {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t cache[iterations] = step.value;\n\t\t }\n\t\t return iteratorValue(type, iterations, cache[iterations++]);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tfunction isSeq(maybeSeq) {\n\t\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n\t\t}\n\t\tvar EMPTY_SEQ;\n\t\tfunction emptySequence() {\n\t\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n\t\t}\n\t\tfunction keyedSeqFromValue(value) {\n\t\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\n\t\t if (!seq) {\n\t\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\n\t\t }\n\t\t return seq;\n\t\t}\n\t\tfunction indexedSeqFromValue(value) {\n\t\t var seq = maybeIndexedSeqFromValue(value);\n\t\t if (!seq) {\n\t\t throw new TypeError('Expected Array or iterable object of values: ' + value);\n\t\t }\n\t\t return seq;\n\t\t}\n\t\tfunction seqFromValue(value) {\n\t\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\n\t\t if (!seq) {\n\t\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\n\t\t }\n\t\t return seq;\n\t\t}\n\t\tfunction maybeIndexedSeqFromValue(value) {\n\t\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\n\t\t}\n\t\tfunction isArrayLike(value) {\n\t\t return value && typeof value.length === 'number';\n\t\t}\n\t\tfunction seqIterate(seq, fn, reverse, useKeys) {\n\t\t var cache = seq._cache;\n\t\t if (cache) {\n\t\t var maxIndex = cache.length - 1;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t }\n\t\t return seq.__iterateUncached(fn, reverse);\n\t\t}\n\t\tfunction seqIterator(seq, type, reverse, useKeys) {\n\t\t var cache = seq._cache;\n\t\t if (cache) {\n\t\t var maxIndex = cache.length - 1;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n\t\t }));\n\t\t }\n\t\t return seq.__iteratorUncached(type, reverse);\n\t\t}\n\t\tfunction fromJS(json, converter) {\n\t\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\n\t\t}\n\t\tfunction _fromJSWith(converter, json, key, parentJSON) {\n\t\t if (Array.isArray(json)) {\n\t\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\n\t\t return _fromJSWith(converter, v, k, json);\n\t\t })));\n\t\t }\n\t\t if (isPlainObj(json)) {\n\t\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\n\t\t return _fromJSWith(converter, v, k, json);\n\t\t })));\n\t\t }\n\t\t return json;\n\t\t}\n\t\tfunction _fromJSDefault(json) {\n\t\t if (Array.isArray(json)) {\n\t\t return IndexedSeq(json).map(_fromJSDefault).toList();\n\t\t }\n\t\t if (isPlainObj(json)) {\n\t\t return KeyedSeq(json).map(_fromJSDefault).toMap();\n\t\t }\n\t\t return json;\n\t\t}\n\t\tfunction isPlainObj(value) {\n\t\t return value && value.constructor === Object;\n\t\t}\n\t\tvar Collection = function Collection() {\n\t\t throw TypeError('Abstract');\n\t\t};\n\t\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\n\t\tvar KeyedCollection = function KeyedCollection() {\n\t\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\n\t\t};\n\t\tvar $KeyedCollection = KeyedCollection;\n\t\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\n\t\tmixin(KeyedCollection, KeyedIterable.prototype);\n\t\tvar IndexedCollection = function IndexedCollection() {\n\t\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\n\t\t};\n\t\tvar $IndexedCollection = IndexedCollection;\n\t\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\n\t\tmixin(IndexedCollection, IndexedIterable.prototype);\n\t\tvar SetCollection = function SetCollection() {\n\t\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\n\t\t};\n\t\tvar $SetCollection = SetCollection;\n\t\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\n\t\tmixin(SetCollection, SetIterable.prototype);\n\t\tCollection.Keyed = KeyedCollection;\n\t\tCollection.Indexed = IndexedCollection;\n\t\tCollection.Set = SetCollection;\n\t\tvar Map = function Map(value) {\n\t\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().withMutations((function(map) {\n\t\t var iter = KeyedIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v, k) {\n\t\t return map.set(k, v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(Map, {\n\t\t toString: function() {\n\t\t return this.__toString('Map {', '}');\n\t\t },\n\t\t get: function(k, notSetValue) {\n\t\t return this._root ? this._root.get(0, undefined, k, notSetValue) : notSetValue;\n\t\t },\n\t\t set: function(k, v) {\n\t\t return updateMap(this, k, v);\n\t\t },\n\t\t setIn: function(keyPath, v) {\n\t\t return this.updateIn(keyPath, NOT_SET, (function() {\n\t\t return v;\n\t\t }));\n\t\t },\n\t\t remove: function(k) {\n\t\t return updateMap(this, k, NOT_SET);\n\t\t },\n\t\t deleteIn: function(keyPath) {\n\t\t return this.updateIn(keyPath, (function() {\n\t\t return NOT_SET;\n\t\t }));\n\t\t },\n\t\t update: function(k, notSetValue, updater) {\n\t\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\n\t\t },\n\t\t updateIn: function(keyPath, notSetValue, updater) {\n\t\t if (!updater) {\n\t\t updater = notSetValue;\n\t\t notSetValue = undefined;\n\t\t }\n\t\t var updatedValue = updateInDeepMap(this, getIterator(keyPath) || getIterator(Iterable(keyPath)), notSetValue, updater);\n\t\t return updatedValue === NOT_SET ? undefined : updatedValue;\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = 0;\n\t\t this._root = null;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return emptyMap();\n\t\t },\n\t\t merge: function() {\n\t\t return mergeIntoMapWith(this, undefined, arguments);\n\t\t },\n\t\t mergeWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__3 = 1; $__3 < arguments.length; $__3++)\n\t\t iters[$__3 - 1] = arguments[$__3];\n\t\t return mergeIntoMapWith(this, merger, iters);\n\t\t },\n\t\t mergeIn: function(keyPath) {\n\t\t for (var iters = [],\n\t\t $__4 = 1; $__4 < arguments.length; $__4++)\n\t\t iters[$__4 - 1] = arguments[$__4];\n\t\t return this.updateIn(keyPath, emptyMap(), (function(m) {\n\t\t return m.merge.apply(m, iters);\n\t\t }));\n\t\t },\n\t\t mergeDeep: function() {\n\t\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\n\t\t },\n\t\t mergeDeepWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__5 = 1; $__5 < arguments.length; $__5++)\n\t\t iters[$__5 - 1] = arguments[$__5];\n\t\t return mergeIntoMapWith(this, deepMerger(merger), iters);\n\t\t },\n\t\t mergeDeepIn: function(keyPath) {\n\t\t for (var iters = [],\n\t\t $__6 = 1; $__6 < arguments.length; $__6++)\n\t\t iters[$__6 - 1] = arguments[$__6];\n\t\t return this.updateIn(keyPath, emptyMap(), (function(m) {\n\t\t return m.mergeDeep.apply(m, iters);\n\t\t }));\n\t\t },\n\t\t sort: function(comparator) {\n\t\t return OrderedMap(sortFactory(this, comparator));\n\t\t },\n\t\t sortBy: function(mapper, comparator) {\n\t\t return OrderedMap(sortFactory(this, comparator, mapper));\n\t\t },\n\t\t withMutations: function(fn) {\n\t\t var mutable = this.asMutable();\n\t\t fn(mutable);\n\t\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n\t\t },\n\t\t asMutable: function() {\n\t\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n\t\t },\n\t\t asImmutable: function() {\n\t\t return this.__ensureOwner();\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this.__altered;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return new MapIterator(this, type, reverse);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t this._root && this._root.iterate((function(entry) {\n\t\t iterations++;\n\t\t return fn(entry[1], entry[0], $__0);\n\t\t }), reverse);\n\t\t return iterations;\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this.__altered = false;\n\t\t return this;\n\t\t }\n\t\t return makeMap(this.size, this._root, ownerID, this.__hash);\n\t\t }\n\t\t}, {}, KeyedCollection);\n\t\tfunction isMap(maybeMap) {\n\t\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n\t\t}\n\t\tMap.isMap = isMap;\n\t\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\t\tvar MapPrototype = Map.prototype;\n\t\tMapPrototype[IS_MAP_SENTINEL] = true;\n\t\tMapPrototype[DELETE] = MapPrototype.remove;\n\t\tMapPrototype.removeIn = MapPrototype.deleteIn;\n\t\tvar ArrayMapNode = function ArrayMapNode(ownerID, entries) {\n\t\t this.ownerID = ownerID;\n\t\t this.entries = entries;\n\t\t};\n\t\tvar $ArrayMapNode = ArrayMapNode;\n\t\t($traceurRuntime.createClass)(ArrayMapNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t var entries = this.entries;\n\t\t for (var ii = 0,\n\t\t len = entries.length; ii < len; ii++) {\n\t\t if (is(key, entries[ii][0])) {\n\t\t return entries[ii][1];\n\t\t }\n\t\t }\n\t\t return notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t var removed = value === NOT_SET;\n\t\t var entries = this.entries;\n\t\t var idx = 0;\n\t\t for (var len = entries.length; idx < len; idx++) {\n\t\t if (is(key, entries[idx][0])) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t var exists = idx < len;\n\t\t if (exists ? entries[idx][1] === value : removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t (removed || !exists) && SetRef(didChangeSize);\n\t\t if (removed && entries.length === 1) {\n\t\t return;\n\t\t }\n\t\t if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\n\t\t return createNodes(ownerID, entries, key, value);\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newEntries = isEditable ? entries : arrCopy(entries);\n\t\t if (exists) {\n\t\t if (removed) {\n\t\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n\t\t } else {\n\t\t newEntries[idx] = [key, value];\n\t\t }\n\t\t } else {\n\t\t newEntries.push([key, value]);\n\t\t }\n\t\t if (isEditable) {\n\t\t this.entries = newEntries;\n\t\t return this;\n\t\t }\n\t\t return new $ArrayMapNode(ownerID, newEntries);\n\t\t }\n\t\t}, {});\n\t\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\n\t\t this.ownerID = ownerID;\n\t\t this.bitmap = bitmap;\n\t\t this.nodes = nodes;\n\t\t};\n\t\tvar $BitmapIndexedNode = BitmapIndexedNode;\n\t\t($traceurRuntime.createClass)(BitmapIndexedNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\n\t\t var bitmap = this.bitmap;\n\t\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var bit = 1 << keyHashFrag;\n\t\t var bitmap = this.bitmap;\n\t\t var exists = (bitmap & bit) !== 0;\n\t\t if (!exists && value === NOT_SET) {\n\t\t return this;\n\t\t }\n\t\t var idx = popCount(bitmap & (bit - 1));\n\t\t var nodes = this.nodes;\n\t\t var node = exists ? nodes[idx] : undefined;\n\t\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\t\t if (newNode === node) {\n\t\t return this;\n\t\t }\n\t\t if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\n\t\t return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\n\t\t }\n\t\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n\t\t return nodes[idx ^ 1];\n\t\t }\n\t\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n\t\t return newNode;\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n\t\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\n\t\t if (isEditable) {\n\t\t this.bitmap = newBitmap;\n\t\t this.nodes = newNodes;\n\t\t return this;\n\t\t }\n\t\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\n\t\t }\n\t\t}, {});\n\t\tvar HashArrayMapNode = function HashArrayMapNode(ownerID, count, nodes) {\n\t\t this.ownerID = ownerID;\n\t\t this.count = count;\n\t\t this.nodes = nodes;\n\t\t};\n\t\tvar $HashArrayMapNode = HashArrayMapNode;\n\t\t($traceurRuntime.createClass)(HashArrayMapNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var node = this.nodes[idx];\n\t\t return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var removed = value === NOT_SET;\n\t\t var nodes = this.nodes;\n\t\t var node = nodes[idx];\n\t\t if (removed && !node) {\n\t\t return this;\n\t\t }\n\t\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\t\t if (newNode === node) {\n\t\t return this;\n\t\t }\n\t\t var newCount = this.count;\n\t\t if (!node) {\n\t\t newCount++;\n\t\t } else if (!newNode) {\n\t\t newCount--;\n\t\t if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\n\t\t return packNodes(ownerID, nodes, newCount, idx);\n\t\t }\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newNodes = setIn(nodes, idx, newNode, isEditable);\n\t\t if (isEditable) {\n\t\t this.count = newCount;\n\t\t this.nodes = newNodes;\n\t\t return this;\n\t\t }\n\t\t return new $HashArrayMapNode(ownerID, newCount, newNodes);\n\t\t }\n\t\t}, {});\n\t\tvar HashCollisionNode = function HashCollisionNode(ownerID, keyHash, entries) {\n\t\t this.ownerID = ownerID;\n\t\t this.keyHash = keyHash;\n\t\t this.entries = entries;\n\t\t};\n\t\tvar $HashCollisionNode = HashCollisionNode;\n\t\t($traceurRuntime.createClass)(HashCollisionNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t var entries = this.entries;\n\t\t for (var ii = 0,\n\t\t len = entries.length; ii < len; ii++) {\n\t\t if (is(key, entries[ii][0])) {\n\t\t return entries[ii][1];\n\t\t }\n\t\t }\n\t\t return notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var removed = value === NOT_SET;\n\t\t if (keyHash !== this.keyHash) {\n\t\t if (removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t SetRef(didChangeSize);\n\t\t return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\n\t\t }\n\t\t var entries = this.entries;\n\t\t var idx = 0;\n\t\t for (var len = entries.length; idx < len; idx++) {\n\t\t if (is(key, entries[idx][0])) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t var exists = idx < len;\n\t\t if (exists ? entries[idx][1] === value : removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t (removed || !exists) && SetRef(didChangeSize);\n\t\t if (removed && len === 2) {\n\t\t return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newEntries = isEditable ? entries : arrCopy(entries);\n\t\t if (exists) {\n\t\t if (removed) {\n\t\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n\t\t } else {\n\t\t newEntries[idx] = [key, value];\n\t\t }\n\t\t } else {\n\t\t newEntries.push([key, value]);\n\t\t }\n\t\t if (isEditable) {\n\t\t this.entries = newEntries;\n\t\t return this;\n\t\t }\n\t\t return new $HashCollisionNode(ownerID, this.keyHash, newEntries);\n\t\t }\n\t\t}, {});\n\t\tvar ValueNode = function ValueNode(ownerID, keyHash, entry) {\n\t\t this.ownerID = ownerID;\n\t\t this.keyHash = keyHash;\n\t\t this.entry = entry;\n\t\t};\n\t\tvar $ValueNode = ValueNode;\n\t\t($traceurRuntime.createClass)(ValueNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t var removed = value === NOT_SET;\n\t\t var keyMatch = is(key, this.entry[0]);\n\t\t if (keyMatch ? value === this.entry[1] : removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t if (removed) {\n\t\t SetRef(didChangeSize);\n\t\t return;\n\t\t }\n\t\t if (keyMatch) {\n\t\t if (ownerID && ownerID === this.ownerID) {\n\t\t this.entry[1] = value;\n\t\t return this;\n\t\t }\n\t\t return new $ValueNode(ownerID, this.keyHash, [key, value]);\n\t\t }\n\t\t SetRef(didChangeSize);\n\t\t return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\n\t\t }\n\t\t}, {});\n\t\tArrayMapNode.prototype.iterate = HashCollisionNode.prototype.iterate = function(fn, reverse) {\n\t\t var entries = this.entries;\n\t\t for (var ii = 0,\n\t\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n\t\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n\t\t return false;\n\t\t }\n\t\t }\n\t\t};\n\t\tBitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate = function(fn, reverse) {\n\t\t var nodes = this.nodes;\n\t\t for (var ii = 0,\n\t\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n\t\t var node = nodes[reverse ? maxIndex - ii : ii];\n\t\t if (node && node.iterate(fn, reverse) === false) {\n\t\t return false;\n\t\t }\n\t\t }\n\t\t};\n\t\tValueNode.prototype.iterate = function(fn, reverse) {\n\t\t return fn(this.entry);\n\t\t};\n\t\tvar MapIterator = function MapIterator(map, type, reverse) {\n\t\t this._type = type;\n\t\t this._reverse = reverse;\n\t\t this._stack = map._root && mapIteratorFrame(map._root);\n\t\t};\n\t\t($traceurRuntime.createClass)(MapIterator, {next: function() {\n\t\t var type = this._type;\n\t\t var stack = this._stack;\n\t\t while (stack) {\n\t\t var node = stack.node;\n\t\t var index = stack.index++;\n\t\t var maxIndex;\n\t\t if (node.entry) {\n\t\t if (index === 0) {\n\t\t return mapIteratorValue(type, node.entry);\n\t\t }\n\t\t } else if (node.entries) {\n\t\t maxIndex = node.entries.length - 1;\n\t\t if (index <= maxIndex) {\n\t\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n\t\t }\n\t\t } else {\n\t\t maxIndex = node.nodes.length - 1;\n\t\t if (index <= maxIndex) {\n\t\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n\t\t if (subNode) {\n\t\t if (subNode.entry) {\n\t\t return mapIteratorValue(type, subNode.entry);\n\t\t }\n\t\t stack = this._stack = mapIteratorFrame(subNode, stack);\n\t\t }\n\t\t continue;\n\t\t }\n\t\t }\n\t\t stack = this._stack = this._stack.__prev;\n\t\t }\n\t\t return iteratorDone();\n\t\t }}, {}, Iterator);\n\t\tfunction mapIteratorValue(type, entry) {\n\t\t return iteratorValue(type, entry[0], entry[1]);\n\t\t}\n\t\tfunction mapIteratorFrame(node, prev) {\n\t\t return {\n\t\t node: node,\n\t\t index: 0,\n\t\t __prev: prev\n\t\t };\n\t\t}\n\t\tfunction makeMap(size, root, ownerID, hash) {\n\t\t var map = Object.create(MapPrototype);\n\t\t map.size = size;\n\t\t map._root = root;\n\t\t map.__ownerID = ownerID;\n\t\t map.__hash = hash;\n\t\t map.__altered = false;\n\t\t return map;\n\t\t}\n\t\tvar EMPTY_MAP;\n\t\tfunction emptyMap() {\n\t\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n\t\t}\n\t\tfunction updateMap(map, k, v) {\n\t\t var newRoot;\n\t\t var newSize;\n\t\t if (!map._root) {\n\t\t if (v === NOT_SET) {\n\t\t return map;\n\t\t }\n\t\t newSize = 1;\n\t\t newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\n\t\t } else {\n\t\t var didChangeSize = MakeRef(CHANGE_LENGTH);\n\t\t var didAlter = MakeRef(DID_ALTER);\n\t\t newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\n\t\t if (!didAlter.value) {\n\t\t return map;\n\t\t }\n\t\t newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n\t\t }\n\t\t if (map.__ownerID) {\n\t\t map.size = newSize;\n\t\t map._root = newRoot;\n\t\t map.__hash = undefined;\n\t\t map.__altered = true;\n\t\t return map;\n\t\t }\n\t\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n\t\t}\n\t\tfunction updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (!node) {\n\t\t if (value === NOT_SET) {\n\t\t return node;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t SetRef(didChangeSize);\n\t\t return new ValueNode(ownerID, keyHash, [key, value]);\n\t\t }\n\t\t return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\n\t\t}\n\t\tfunction isLeafNode(node) {\n\t\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n\t\t}\n\t\tfunction mergeIntoNode(node, ownerID, shift, keyHash, entry) {\n\t\t if (node.keyHash === keyHash) {\n\t\t return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\n\t\t }\n\t\t var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\n\t\t var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var newNode;\n\t\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] : ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\t\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n\t\t}\n\t\tfunction createNodes(ownerID, entries, key, value) {\n\t\t if (!ownerID) {\n\t\t ownerID = new OwnerID();\n\t\t }\n\t\t var node = new ValueNode(ownerID, hash(key), [key, value]);\n\t\t for (var ii = 0; ii < entries.length; ii++) {\n\t\t var entry = entries[ii];\n\t\t node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\n\t\t }\n\t\t return node;\n\t\t}\n\t\tfunction packNodes(ownerID, nodes, count, excluding) {\n\t\t var bitmap = 0;\n\t\t var packedII = 0;\n\t\t var packedNodes = new Array(count);\n\t\t for (var ii = 0,\n\t\t bit = 1,\n\t\t len = nodes.length; ii < len; ii++, bit <<= 1) {\n\t\t var node = nodes[ii];\n\t\t if (node !== undefined && ii !== excluding) {\n\t\t bitmap |= bit;\n\t\t packedNodes[packedII++] = node;\n\t\t }\n\t\t }\n\t\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n\t\t}\n\t\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\n\t\t var count = 0;\n\t\t var expandedNodes = new Array(SIZE);\n\t\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n\t\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n\t\t }\n\t\t expandedNodes[including] = node;\n\t\t return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\n\t\t}\n\t\tfunction mergeIntoMapWith(map, merger, iterables) {\n\t\t var iters = [];\n\t\t for (var ii = 0; ii < iterables.length; ii++) {\n\t\t var value = iterables[ii];\n\t\t var iter = KeyedIterable(value);\n\t\t if (!isIterable(value)) {\n\t\t iter = iter.map((function(v) {\n\t\t return fromJS(v);\n\t\t }));\n\t\t }\n\t\t iters.push(iter);\n\t\t }\n\t\t return mergeIntoCollectionWith(map, merger, iters);\n\t\t}\n\t\tfunction deepMerger(merger) {\n\t\t return (function(existing, value) {\n\t\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\n\t\t });\n\t\t}\n\t\tfunction mergeIntoCollectionWith(collection, merger, iters) {\n\t\t iters = iters.filter((function(x) {\n\t\t return x.size !== 0;\n\t\t }));\n\t\t if (iters.length === 0) {\n\t\t return collection;\n\t\t }\n\t\t if (collection.size === 0 && iters.length === 1) {\n\t\t return collection.constructor(iters[0]);\n\t\t }\n\t\t return collection.withMutations((function(collection) {\n\t\t var mergeIntoMap = merger ? (function(value, key) {\n\t\t collection.update(key, NOT_SET, (function(existing) {\n\t\t return existing === NOT_SET ? value : merger(existing, value);\n\t\t }));\n\t\t }) : (function(value, key) {\n\t\t collection.set(key, value);\n\t\t });\n\t\t for (var ii = 0; ii < iters.length; ii++) {\n\t\t iters[ii].forEach(mergeIntoMap);\n\t\t }\n\t\t }));\n\t\t}\n\t\tfunction updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\n\t\t var isNotSet = existing === NOT_SET;\n\t\t var step = keyPathIter.next();\n\t\t if (step.done) {\n\t\t var existingValue = isNotSet ? notSetValue : existing;\n\t\t var newValue = updater(existingValue);\n\t\t return newValue === existingValue ? existing : newValue;\n\t\t }\n\t\t invariant(isNotSet || (existing && existing.set), 'invalid keyPath');\n\t\t var key = step.value;\n\t\t var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\n\t\t var nextUpdated = updateInDeepMap(nextExisting, keyPathIter, notSetValue, updater);\n\t\t return nextUpdated === nextExisting ? existing : nextUpdated === NOT_SET ? existing.remove(key) : (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\n\t\t}\n\t\tfunction popCount(x) {\n\t\t x = x - ((x >> 1) & 0x55555555);\n\t\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n\t\t x = (x + (x >> 4)) & 0x0f0f0f0f;\n\t\t x = x + (x >> 8);\n\t\t x = x + (x >> 16);\n\t\t return x & 0x7f;\n\t\t}\n\t\tfunction setIn(array, idx, val, canEdit) {\n\t\t var newArray = canEdit ? array : arrCopy(array);\n\t\t newArray[idx] = val;\n\t\t return newArray;\n\t\t}\n\t\tfunction spliceIn(array, idx, val, canEdit) {\n\t\t var newLen = array.length + 1;\n\t\t if (canEdit && idx + 1 === newLen) {\n\t\t array[idx] = val;\n\t\t return array;\n\t\t }\n\t\t var newArray = new Array(newLen);\n\t\t var after = 0;\n\t\t for (var ii = 0; ii < newLen; ii++) {\n\t\t if (ii === idx) {\n\t\t newArray[ii] = val;\n\t\t after = -1;\n\t\t } else {\n\t\t newArray[ii] = array[ii + after];\n\t\t }\n\t\t }\n\t\t return newArray;\n\t\t}\n\t\tfunction spliceOut(array, idx, canEdit) {\n\t\t var newLen = array.length - 1;\n\t\t if (canEdit && idx === newLen) {\n\t\t array.pop();\n\t\t return array;\n\t\t }\n\t\t var newArray = new Array(newLen);\n\t\t var after = 0;\n\t\t for (var ii = 0; ii < newLen; ii++) {\n\t\t if (ii === idx) {\n\t\t after = 1;\n\t\t }\n\t\t newArray[ii] = array[ii + after];\n\t\t }\n\t\t return newArray;\n\t\t}\n\t\tvar MAX_ARRAY_MAP_SIZE = SIZE / 4;\n\t\tvar MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\n\t\tvar MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\n\t\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\n\t\t this._iter = indexed;\n\t\t this._useKeys = useKeys;\n\t\t this.size = indexed.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(ToKeyedSequence, {\n\t\t get: function(key, notSetValue) {\n\t\t return this._iter.get(key, notSetValue);\n\t\t },\n\t\t has: function(key) {\n\t\t return this._iter.has(key);\n\t\t },\n\t\t valueSeq: function() {\n\t\t return this._iter.valueSeq();\n\t\t },\n\t\t reverse: function() {\n\t\t var $__0 = this;\n\t\t var reversedSequence = reverseFactory(this, true);\n\t\t if (!this._useKeys) {\n\t\t reversedSequence.valueSeq = (function() {\n\t\t return $__0._iter.toSeq().reverse();\n\t\t });\n\t\t }\n\t\t return reversedSequence;\n\t\t },\n\t\t map: function(mapper, context) {\n\t\t var $__0 = this;\n\t\t var mappedSequence = mapFactory(this, mapper, context);\n\t\t if (!this._useKeys) {\n\t\t mappedSequence.valueSeq = (function() {\n\t\t return $__0._iter.toSeq().map(mapper, context);\n\t\t });\n\t\t }\n\t\t return mappedSequence;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var ii;\n\t\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\n\t\t return fn(v, k, $__0);\n\t\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\n\t\t return fn(v, reverse ? --ii : ii++, $__0);\n\t\t })), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t if (this._useKeys) {\n\t\t return this._iter.__iterator(type, reverse);\n\t\t }\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t var ii = reverse ? resolveSize(this) : 0;\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n\t\t }));\n\t\t }\n\t\t}, {}, KeyedSeq);\n\t\tToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\n\t\t this._iter = iter;\n\t\t this.size = iter.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(ToIndexedSequence, {\n\t\t contains: function(value) {\n\t\t return this._iter.contains(value);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t return this._iter.__iterate((function(v) {\n\t\t return fn(v, iterations++, $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar ToSetSequence = function ToSetSequence(iter) {\n\t\t this._iter = iter;\n\t\t this.size = iter.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(ToSetSequence, {\n\t\t has: function(key) {\n\t\t return this._iter.contains(key);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._iter.__iterate((function(v) {\n\t\t return fn(v, v, $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\n\t\t }));\n\t\t }\n\t\t}, {}, SetSeq);\n\t\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\n\t\t this._iter = entries;\n\t\t this.size = entries.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(FromEntriesSequence, {\n\t\t entrySeq: function() {\n\t\t return this._iter.toSeq();\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._iter.__iterate((function(entry) {\n\t\t if (entry) {\n\t\t validateEntry(entry);\n\t\t return fn(entry[1], entry[0], $__0);\n\t\t }\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t return new Iterator((function() {\n\t\t while (true) {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t if (entry) {\n\t\t validateEntry(entry);\n\t\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\n\t\t }\n\t\t }\n\t\t }));\n\t\t }\n\t\t}, {}, KeyedSeq);\n\t\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\n\t\tfunction flipFactory(iterable) {\n\t\t var flipSequence = makeSequence(iterable);\n\t\t flipSequence._iter = iterable;\n\t\t flipSequence.size = iterable.size;\n\t\t flipSequence.flip = (function() {\n\t\t return iterable;\n\t\t });\n\t\t flipSequence.reverse = function() {\n\t\t var reversedSequence = iterable.reverse.apply(this);\n\t\t reversedSequence.flip = (function() {\n\t\t return iterable.reverse();\n\t\t });\n\t\t return reversedSequence;\n\t\t };\n\t\t flipSequence.has = (function(key) {\n\t\t return iterable.contains(key);\n\t\t });\n\t\t flipSequence.contains = (function(key) {\n\t\t return iterable.has(key);\n\t\t });\n\t\t flipSequence.cacheResult = cacheResultThrough;\n\t\t flipSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return iterable.__iterate((function(v, k) {\n\t\t return fn(k, v, $__0) !== false;\n\t\t }), reverse);\n\t\t };\n\t\t flipSequence.__iteratorUncached = function(type, reverse) {\n\t\t if (type === ITERATE_ENTRIES) {\n\t\t var iterator = iterable.__iterator(type, reverse);\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t if (!step.done) {\n\t\t var k = step.value[0];\n\t\t step.value[0] = step.value[1];\n\t\t step.value[1] = k;\n\t\t }\n\t\t return step;\n\t\t }));\n\t\t }\n\t\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\n\t\t };\n\t\t return flipSequence;\n\t\t}\n\t\tfunction mapFactory(iterable, mapper, context) {\n\t\t var mappedSequence = makeSequence(iterable);\n\t\t mappedSequence.size = iterable.size;\n\t\t mappedSequence.has = (function(key) {\n\t\t return iterable.has(key);\n\t\t });\n\t\t mappedSequence.get = (function(key, notSetValue) {\n\t\t var v = iterable.get(key, NOT_SET);\n\t\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\n\t\t });\n\t\t mappedSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return iterable.__iterate((function(v, k, c) {\n\t\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\n\t\t }), reverse);\n\t\t };\n\t\t mappedSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t var key = entry[0];\n\t\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\n\t\t }));\n\t\t };\n\t\t return mappedSequence;\n\t\t}\n\t\tfunction reverseFactory(iterable, useKeys) {\n\t\t var reversedSequence = makeSequence(iterable);\n\t\t reversedSequence._iter = iterable;\n\t\t reversedSequence.size = iterable.size;\n\t\t reversedSequence.reverse = (function() {\n\t\t return iterable;\n\t\t });\n\t\t if (iterable.flip) {\n\t\t reversedSequence.flip = function() {\n\t\t var flipSequence = flipFactory(iterable);\n\t\t flipSequence.reverse = (function() {\n\t\t return iterable.flip();\n\t\t });\n\t\t return flipSequence;\n\t\t };\n\t\t }\n\t\t reversedSequence.get = (function(key, notSetValue) {\n\t\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\n\t\t });\n\t\t reversedSequence.has = (function(key) {\n\t\t return iterable.has(useKeys ? key : -1 - key);\n\t\t });\n\t\t reversedSequence.contains = (function(value) {\n\t\t return iterable.contains(value);\n\t\t });\n\t\t reversedSequence.cacheResult = cacheResultThrough;\n\t\t reversedSequence.__iterate = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return iterable.__iterate((function(v, k) {\n\t\t return fn(v, k, $__0);\n\t\t }), !reverse);\n\t\t };\n\t\t reversedSequence.__iterator = (function(type, reverse) {\n\t\t return iterable.__iterator(type, !reverse);\n\t\t });\n\t\t return reversedSequence;\n\t\t}\n\t\tfunction filterFactory(iterable, predicate, context, useKeys) {\n\t\t var filterSequence = makeSequence(iterable);\n\t\t if (useKeys) {\n\t\t filterSequence.has = (function(key) {\n\t\t var v = iterable.get(key, NOT_SET);\n\t\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n\t\t });\n\t\t filterSequence.get = (function(key, notSetValue) {\n\t\t var v = iterable.get(key, NOT_SET);\n\t\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\n\t\t });\n\t\t }\n\t\t filterSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k, c) {\n\t\t if (predicate.call(context, v, k, c)) {\n\t\t iterations++;\n\t\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t\t }\n\t\t }), reverse);\n\t\t return iterations;\n\t\t };\n\t\t filterSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t while (true) {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t var key = entry[0];\n\t\t var value = entry[1];\n\t\t if (predicate.call(context, value, key, iterable)) {\n\t\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\n\t\t }\n\t\t }\n\t\t }));\n\t\t };\n\t\t return filterSequence;\n\t\t}\n\t\tfunction countByFactory(iterable, grouper, context) {\n\t\t var groups = Map().asMutable();\n\t\t iterable.__iterate((function(v, k) {\n\t\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\n\t\t return a + 1;\n\t\t }));\n\t\t }));\n\t\t return groups.asImmutable();\n\t\t}\n\t\tfunction groupByFactory(iterable, grouper, context) {\n\t\t var isKeyedIter = isKeyed(iterable);\n\t\t var groups = Map().asMutable();\n\t\t iterable.__iterate((function(v, k) {\n\t\t groups.update(grouper.call(context, v, k, iterable), (function(a) {\n\t\t return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a);\n\t\t }));\n\t\t }));\n\t\t var coerce = iterableClass(iterable);\n\t\t return groups.map((function(arr) {\n\t\t return reify(iterable, coerce(arr));\n\t\t }));\n\t\t}\n\t\tfunction takeFactory(iterable, amount) {\n\t\t if (amount > iterable.size) {\n\t\t return iterable;\n\t\t }\n\t\t if (amount < 0) {\n\t\t amount = 0;\n\t\t }\n\t\t var takeSequence = makeSequence(iterable);\n\t\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\n\t\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (amount === 0) {\n\t\t return 0;\n\t\t }\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k) {\n\t\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = amount && iterable.__iterator(type, reverse);\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t if (iterations++ > amount) {\n\t\t return iteratorDone();\n\t\t }\n\t\t return iterator.next();\n\t\t }));\n\t\t };\n\t\t return takeSequence;\n\t\t}\n\t\tfunction takeWhileFactory(iterable, predicate, context) {\n\t\t var takeSequence = makeSequence(iterable);\n\t\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k, c) {\n\t\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t var iterating = true;\n\t\t return new Iterator((function() {\n\t\t if (!iterating) {\n\t\t return iteratorDone();\n\t\t }\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t var k = entry[0];\n\t\t var v = entry[1];\n\t\t if (!predicate.call(context, v, k, $__0)) {\n\t\t iterating = false;\n\t\t return iteratorDone();\n\t\t }\n\t\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t\t }));\n\t\t };\n\t\t return takeSequence;\n\t\t}\n\t\tfunction skipFactory(iterable, amount, useKeys) {\n\t\t if (amount <= 0) {\n\t\t return iterable;\n\t\t }\n\t\t var skipSequence = makeSequence(iterable);\n\t\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\n\t\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var skipped = 0;\n\t\t var isSkipping = true;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k) {\n\t\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\n\t\t iterations++;\n\t\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t\t }\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = amount && iterable.__iterator(type, reverse);\n\t\t var skipped = 0;\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t while (skipped < amount) {\n\t\t skipped++;\n\t\t iterator.next();\n\t\t }\n\t\t var step = iterator.next();\n\t\t if (useKeys || type === ITERATE_VALUES) {\n\t\t return step;\n\t\t } else if (type === ITERATE_KEYS) {\n\t\t return iteratorValue(type, iterations++, undefined, step);\n\t\t } else {\n\t\t return iteratorValue(type, iterations++, step.value[1], step);\n\t\t }\n\t\t }));\n\t\t };\n\t\t return skipSequence;\n\t\t}\n\t\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\n\t\t var skipSequence = makeSequence(iterable);\n\t\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var isSkipping = true;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k, c) {\n\t\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n\t\t iterations++;\n\t\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t\t }\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t var skipping = true;\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t var step,\n\t\t k,\n\t\t v;\n\t\t do {\n\t\t step = iterator.next();\n\t\t if (step.done) {\n\t\t if (useKeys || type === ITERATE_VALUES) {\n\t\t return step;\n\t\t } else if (type === ITERATE_KEYS) {\n\t\t return iteratorValue(type, iterations++, undefined, step);\n\t\t } else {\n\t\t return iteratorValue(type, iterations++, step.value[1], step);\n\t\t }\n\t\t }\n\t\t var entry = step.value;\n\t\t k = entry[0];\n\t\t v = entry[1];\n\t\t skipping && (skipping = predicate.call(context, v, k, $__0));\n\t\t } while (skipping);\n\t\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t\t }));\n\t\t };\n\t\t return skipSequence;\n\t\t}\n\t\tfunction concatFactory(iterable, values) {\n\t\t var isKeyedIterable = isKeyed(iterable);\n\t\t var iters = [iterable].concat(values).map((function(v) {\n\t\t if (!isIterable(v)) {\n\t\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n\t\t } else if (isKeyedIterable) {\n\t\t v = KeyedIterable(v);\n\t\t }\n\t\t return v;\n\t\t })).filter((function(v) {\n\t\t return v.size !== 0;\n\t\t }));\n\t\t if (iters.length === 0) {\n\t\t return iterable;\n\t\t }\n\t\t if (iters.length === 1) {\n\t\t var singleton = iters[0];\n\t\t if (singleton === iterable || isKeyedIterable && isKeyed(singleton) || isIndexed(iterable) && isIndexed(singleton)) {\n\t\t return singleton;\n\t\t }\n\t\t }\n\t\t var concatSeq = new ArraySeq(iters);\n\t\t if (isKeyedIterable) {\n\t\t concatSeq = concatSeq.toKeyedSeq();\n\t\t } else if (!isIndexed(iterable)) {\n\t\t concatSeq = concatSeq.toSetSeq();\n\t\t }\n\t\t concatSeq = concatSeq.flatten(true);\n\t\t concatSeq.size = iters.reduce((function(sum, seq) {\n\t\t if (sum !== undefined) {\n\t\t var size = seq.size;\n\t\t if (size !== undefined) {\n\t\t return sum + size;\n\t\t }\n\t\t }\n\t\t }), 0);\n\t\t return concatSeq;\n\t\t}\n\t\tfunction flattenFactory(iterable, depth, useKeys) {\n\t\t var flatSequence = makeSequence(iterable);\n\t\t flatSequence.__iterateUncached = function(fn, reverse) {\n\t\t var iterations = 0;\n\t\t var stopped = false;\n\t\t function flatDeep(iter, currentDepth) {\n\t\t var $__0 = this;\n\t\t iter.__iterate((function(v, k) {\n\t\t if ((!depth || currentDepth < depth) && isIterable(v)) {\n\t\t flatDeep(v, currentDepth + 1);\n\t\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\n\t\t stopped = true;\n\t\t }\n\t\t return !stopped;\n\t\t }), reverse);\n\t\t }\n\t\t flatDeep(iterable, 0);\n\t\t return iterations;\n\t\t };\n\t\t flatSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(type, reverse);\n\t\t var stack = [];\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t while (iterator) {\n\t\t var step = iterator.next();\n\t\t if (step.done !== false) {\n\t\t iterator = stack.pop();\n\t\t continue;\n\t\t }\n\t\t var v = step.value;\n\t\t if (type === ITERATE_ENTRIES) {\n\t\t v = v[1];\n\t\t }\n\t\t if ((!depth || stack.length < depth) && isIterable(v)) {\n\t\t stack.push(iterator);\n\t\t iterator = v.__iterator(type, reverse);\n\t\t } else {\n\t\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\n\t\t }\n\t\t }\n\t\t return iteratorDone();\n\t\t }));\n\t\t };\n\t\t return flatSequence;\n\t\t}\n\t\tfunction flatMapFactory(iterable, mapper, context) {\n\t\t var coerce = iterableClass(iterable);\n\t\t return iterable.toSeq().map((function(v, k) {\n\t\t return coerce(mapper.call(context, v, k, iterable));\n\t\t })).flatten(true);\n\t\t}\n\t\tfunction interposeFactory(iterable, separator) {\n\t\t var interposedSequence = makeSequence(iterable);\n\t\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\n\t\t interposedSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k) {\n\t\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\n\t\t }), reverse);\n\t\t return iterations;\n\t\t };\n\t\t interposedSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n\t\t var iterations = 0;\n\t\t var step;\n\t\t return new Iterator((function() {\n\t\t if (!step || iterations % 2) {\n\t\t step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t }\n\t\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\n\t\t }));\n\t\t };\n\t\t return interposedSequence;\n\t\t}\n\t\tfunction sortFactory(iterable, comparator, mapper) {\n\t\t if (!comparator) {\n\t\t comparator = defaultComparator;\n\t\t }\n\t\t var isKeyedIterable = isKeyed(iterable);\n\t\t var index = 0;\n\t\t var entries = iterable.toSeq().map((function(v, k) {\n\t\t return [k, v, index++, mapper ? mapper(v, k, iterable) : v];\n\t\t })).toArray();\n\t\t entries.sort((function(a, b) {\n\t\t return comparator(a[3], b[3]) || a[2] - b[2];\n\t\t })).forEach(isKeyedIterable ? (function(v, i) {\n\t\t entries[i].length = 2;\n\t\t }) : (function(v, i) {\n\t\t entries[i] = v[1];\n\t\t }));\n\t\t return isKeyedIterable ? KeyedSeq(entries) : isIndexed(iterable) ? IndexedSeq(entries) : SetSeq(entries);\n\t\t}\n\t\tfunction maxFactory(iterable, comparator, mapper) {\n\t\t if (!comparator) {\n\t\t comparator = defaultComparator;\n\t\t }\n\t\t if (mapper) {\n\t\t var entry = iterable.toSeq().map((function(v, k) {\n\t\t return [v, mapper(v, k, iterable)];\n\t\t })).reduce((function(a, b) {\n\t\t return _maxCompare(comparator, a[1], b[1]) ? b : a;\n\t\t }));\n\t\t return entry && entry[0];\n\t\t } else {\n\t\t return iterable.reduce((function(a, b) {\n\t\t return _maxCompare(comparator, a, b) ? b : a;\n\t\t }));\n\t\t }\n\t\t}\n\t\tfunction _maxCompare(comparator, a, b) {\n\t\t var comp = comparator(b, a);\n\t\t return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\n\t\t}\n\t\tfunction reify(iter, seq) {\n\t\t return isSeq(iter) ? seq : iter.constructor(seq);\n\t\t}\n\t\tfunction validateEntry(entry) {\n\t\t if (entry !== Object(entry)) {\n\t\t throw new TypeError('Expected [K, V] tuple: ' + entry);\n\t\t }\n\t\t}\n\t\tfunction resolveSize(iter) {\n\t\t assertNotInfinite(iter.size);\n\t\t return ensureSize(iter);\n\t\t}\n\t\tfunction iterableClass(iterable) {\n\t\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\n\t\t}\n\t\tfunction makeSequence(iterable) {\n\t\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\n\t\t}\n\t\tfunction cacheResultThrough() {\n\t\t if (this._iter.cacheResult) {\n\t\t this._iter.cacheResult();\n\t\t this.size = this._iter.size;\n\t\t return this;\n\t\t } else {\n\t\t return Seq.prototype.cacheResult.call(this);\n\t\t }\n\t\t}\n\t\tfunction defaultComparator(a, b) {\n\t\t return a > b ? 1 : a < b ? -1 : 0;\n\t\t}\n\t\tvar List = function List(value) {\n\t\t var empty = emptyList();\n\t\t if (value === null || value === undefined) {\n\t\t return empty;\n\t\t }\n\t\t if (isList(value)) {\n\t\t return value;\n\t\t }\n\t\t var iter = IndexedIterable(value);\n\t\t var size = iter.size;\n\t\t if (size === 0) {\n\t\t return empty;\n\t\t }\n\t\t assertNotInfinite(size);\n\t\t if (size > 0 && size < SIZE) {\n\t\t return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\n\t\t }\n\t\t return empty.withMutations((function(list) {\n\t\t list.setSize(size);\n\t\t iter.forEach((function(v, i) {\n\t\t return list.set(i, v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(List, {\n\t\t toString: function() {\n\t\t return this.__toString('List [', ']');\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t if (index < 0 || index >= this.size) {\n\t\t return notSetValue;\n\t\t }\n\t\t index += this._origin;\n\t\t var node = listNodeFor(this, index);\n\t\t return node && node.array[index & MASK];\n\t\t },\n\t\t set: function(index, value) {\n\t\t return updateList(this, index, value);\n\t\t },\n\t\t remove: function(index) {\n\t\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = this._origin = this._capacity = 0;\n\t\t this._level = SHIFT;\n\t\t this._root = this._tail = null;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return emptyList();\n\t\t },\n\t\t push: function() {\n\t\t var values = arguments;\n\t\t var oldSize = this.size;\n\t\t return this.withMutations((function(list) {\n\t\t setListBounds(list, 0, oldSize + values.length);\n\t\t for (var ii = 0; ii < values.length; ii++) {\n\t\t list.set(oldSize + ii, values[ii]);\n\t\t }\n\t\t }));\n\t\t },\n\t\t pop: function() {\n\t\t return setListBounds(this, 0, -1);\n\t\t },\n\t\t unshift: function() {\n\t\t var values = arguments;\n\t\t return this.withMutations((function(list) {\n\t\t setListBounds(list, -values.length);\n\t\t for (var ii = 0; ii < values.length; ii++) {\n\t\t list.set(ii, values[ii]);\n\t\t }\n\t\t }));\n\t\t },\n\t\t shift: function() {\n\t\t return setListBounds(this, 1);\n\t\t },\n\t\t merge: function() {\n\t\t return mergeIntoListWith(this, undefined, arguments);\n\t\t },\n\t\t mergeWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__7 = 1; $__7 < arguments.length; $__7++)\n\t\t iters[$__7 - 1] = arguments[$__7];\n\t\t return mergeIntoListWith(this, merger, iters);\n\t\t },\n\t\t mergeDeep: function() {\n\t\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\n\t\t },\n\t\t mergeDeepWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__8 = 1; $__8 < arguments.length; $__8++)\n\t\t iters[$__8 - 1] = arguments[$__8];\n\t\t return mergeIntoListWith(this, deepMerger(merger), iters);\n\t\t },\n\t\t setSize: function(size) {\n\t\t return setListBounds(this, 0, size);\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t var size = this.size;\n\t\t if (wholeSlice(begin, end, size)) {\n\t\t return this;\n\t\t }\n\t\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var index = 0;\n\t\t var values = iterateList(this, reverse);\n\t\t return new Iterator((function() {\n\t\t var value = values();\n\t\t return value === DONE ? iteratorDone() : iteratorValue(type, index++, value);\n\t\t }));\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var index = 0;\n\t\t var values = iterateList(this, reverse);\n\t\t var value;\n\t\t while ((value = values()) !== DONE) {\n\t\t if (fn(value, index++, this) === false) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t return index;\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t return this;\n\t\t }\n\t\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n\t\t }\n\t\t}, {of: function() {\n\t\t return this(arguments);\n\t\t }}, IndexedCollection);\n\t\tfunction isList(maybeList) {\n\t\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n\t\t}\n\t\tList.isList = isList;\n\t\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\t\tvar ListPrototype = List.prototype;\n\t\tListPrototype[IS_LIST_SENTINEL] = true;\n\t\tListPrototype[DELETE] = ListPrototype.remove;\n\t\tListPrototype.setIn = MapPrototype.setIn;\n\t\tListPrototype.deleteIn = ListPrototype.removeIn = MapPrototype.removeIn;\n\t\tListPrototype.update = MapPrototype.update;\n\t\tListPrototype.updateIn = MapPrototype.updateIn;\n\t\tListPrototype.mergeIn = MapPrototype.mergeIn;\n\t\tListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n\t\tListPrototype.withMutations = MapPrototype.withMutations;\n\t\tListPrototype.asMutable = MapPrototype.asMutable;\n\t\tListPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tListPrototype.wasAltered = MapPrototype.wasAltered;\n\t\tvar VNode = function VNode(array, ownerID) {\n\t\t this.array = array;\n\t\t this.ownerID = ownerID;\n\t\t};\n\t\tvar $VNode = VNode;\n\t\t($traceurRuntime.createClass)(VNode, {\n\t\t removeBefore: function(ownerID, level, index) {\n\t\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t\t return this;\n\t\t }\n\t\t var originIndex = (index >>> level) & MASK;\n\t\t if (originIndex >= this.array.length) {\n\t\t return new $VNode([], ownerID);\n\t\t }\n\t\t var removingFirst = originIndex === 0;\n\t\t var newChild;\n\t\t if (level > 0) {\n\t\t var oldChild = this.array[originIndex];\n\t\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n\t\t if (newChild === oldChild && removingFirst) {\n\t\t return this;\n\t\t }\n\t\t }\n\t\t if (removingFirst && !newChild) {\n\t\t return this;\n\t\t }\n\t\t var editable = editableVNode(this, ownerID);\n\t\t if (!removingFirst) {\n\t\t for (var ii = 0; ii < originIndex; ii++) {\n\t\t editable.array[ii] = undefined;\n\t\t }\n\t\t }\n\t\t if (newChild) {\n\t\t editable.array[originIndex] = newChild;\n\t\t }\n\t\t return editable;\n\t\t },\n\t\t removeAfter: function(ownerID, level, index) {\n\t\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t\t return this;\n\t\t }\n\t\t var sizeIndex = ((index - 1) >>> level) & MASK;\n\t\t if (sizeIndex >= this.array.length) {\n\t\t return this;\n\t\t }\n\t\t var removingLast = sizeIndex === this.array.length - 1;\n\t\t var newChild;\n\t\t if (level > 0) {\n\t\t var oldChild = this.array[sizeIndex];\n\t\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n\t\t if (newChild === oldChild && removingLast) {\n\t\t return this;\n\t\t }\n\t\t }\n\t\t if (removingLast && !newChild) {\n\t\t return this;\n\t\t }\n\t\t var editable = editableVNode(this, ownerID);\n\t\t if (!removingLast) {\n\t\t editable.array.pop();\n\t\t }\n\t\t if (newChild) {\n\t\t editable.array[sizeIndex] = newChild;\n\t\t }\n\t\t return editable;\n\t\t }\n\t\t}, {});\n\t\tvar DONE = {};\n\t\tfunction iterateList(list, reverse) {\n\t\t var left = list._origin;\n\t\t var right = list._capacity;\n\t\t var tailPos = getTailOffset(right);\n\t\t var tail = list._tail;\n\t\t return iterateNodeOrLeaf(list._root, list._level, 0);\n\t\t function iterateNodeOrLeaf(node, level, offset) {\n\t\t return level === 0 ? iterateLeaf(node, offset) : iterateNode(node, level, offset);\n\t\t }\n\t\t function iterateLeaf(node, offset) {\n\t\t var array = offset === tailPos ? tail && tail.array : node && node.array;\n\t\t var from = offset > left ? 0 : left - offset;\n\t\t var to = right - offset;\n\t\t if (to > SIZE) {\n\t\t to = SIZE;\n\t\t }\n\t\t return (function() {\n\t\t if (from === to) {\n\t\t return DONE;\n\t\t }\n\t\t var idx = reverse ? --to : from++;\n\t\t return array && array[idx];\n\t\t });\n\t\t }\n\t\t function iterateNode(node, level, offset) {\n\t\t var values;\n\t\t var array = node && node.array;\n\t\t var from = offset > left ? 0 : (left - offset) >> level;\n\t\t var to = ((right - offset) >> level) + 1;\n\t\t if (to > SIZE) {\n\t\t to = SIZE;\n\t\t }\n\t\t return (function() {\n\t\t do {\n\t\t if (values) {\n\t\t var value = values();\n\t\t if (value !== DONE) {\n\t\t return value;\n\t\t }\n\t\t values = null;\n\t\t }\n\t\t if (from === to) {\n\t\t return DONE;\n\t\t }\n\t\t var idx = reverse ? --to : from++;\n\t\t values = iterateNodeOrLeaf(array && array[idx], level - SHIFT, offset + (idx << level));\n\t\t } while (true);\n\t\t });\n\t\t }\n\t\t}\n\t\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\n\t\t var list = Object.create(ListPrototype);\n\t\t list.size = capacity - origin;\n\t\t list._origin = origin;\n\t\t list._capacity = capacity;\n\t\t list._level = level;\n\t\t list._root = root;\n\t\t list._tail = tail;\n\t\t list.__ownerID = ownerID;\n\t\t list.__hash = hash;\n\t\t list.__altered = false;\n\t\t return list;\n\t\t}\n\t\tvar EMPTY_LIST;\n\t\tfunction emptyList() {\n\t\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n\t\t}\n\t\tfunction updateList(list, index, value) {\n\t\t index = wrapIndex(list, index);\n\t\t if (index >= list.size || index < 0) {\n\t\t return list.withMutations((function(list) {\n\t\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\n\t\t }));\n\t\t }\n\t\t index += list._origin;\n\t\t var newTail = list._tail;\n\t\t var newRoot = list._root;\n\t\t var didAlter = MakeRef(DID_ALTER);\n\t\t if (index >= getTailOffset(list._capacity)) {\n\t\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n\t\t } else {\n\t\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n\t\t }\n\t\t if (!didAlter.value) {\n\t\t return list;\n\t\t }\n\t\t if (list.__ownerID) {\n\t\t list._root = newRoot;\n\t\t list._tail = newTail;\n\t\t list.__hash = undefined;\n\t\t list.__altered = true;\n\t\t return list;\n\t\t }\n\t\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n\t\t}\n\t\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\n\t\t var idx = (index >>> level) & MASK;\n\t\t var nodeHas = node && idx < node.array.length;\n\t\t if (!nodeHas && value === undefined) {\n\t\t return node;\n\t\t }\n\t\t var newNode;\n\t\t if (level > 0) {\n\t\t var lowerNode = node && node.array[idx];\n\t\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n\t\t if (newLowerNode === lowerNode) {\n\t\t return node;\n\t\t }\n\t\t newNode = editableVNode(node, ownerID);\n\t\t newNode.array[idx] = newLowerNode;\n\t\t return newNode;\n\t\t }\n\t\t if (nodeHas && node.array[idx] === value) {\n\t\t return node;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t newNode = editableVNode(node, ownerID);\n\t\t if (value === undefined && idx === newNode.array.length - 1) {\n\t\t newNode.array.pop();\n\t\t } else {\n\t\t newNode.array[idx] = value;\n\t\t }\n\t\t return newNode;\n\t\t}\n\t\tfunction editableVNode(node, ownerID) {\n\t\t if (ownerID && node && ownerID === node.ownerID) {\n\t\t return node;\n\t\t }\n\t\t return new VNode(node ? node.array.slice() : [], ownerID);\n\t\t}\n\t\tfunction listNodeFor(list, rawIndex) {\n\t\t if (rawIndex >= getTailOffset(list._capacity)) {\n\t\t return list._tail;\n\t\t }\n\t\t if (rawIndex < 1 << (list._level + SHIFT)) {\n\t\t var node = list._root;\n\t\t var level = list._level;\n\t\t while (node && level > 0) {\n\t\t node = node.array[(rawIndex >>> level) & MASK];\n\t\t level -= SHIFT;\n\t\t }\n\t\t return node;\n\t\t }\n\t\t}\n\t\tfunction setListBounds(list, begin, end) {\n\t\t var owner = list.__ownerID || new OwnerID();\n\t\t var oldOrigin = list._origin;\n\t\t var oldCapacity = list._capacity;\n\t\t var newOrigin = oldOrigin + begin;\n\t\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n\t\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n\t\t return list;\n\t\t }\n\t\t if (newOrigin >= newCapacity) {\n\t\t return list.clear();\n\t\t }\n\t\t var newLevel = list._level;\n\t\t var newRoot = list._root;\n\t\t var offsetShift = 0;\n\t\t while (newOrigin + offsetShift < 0) {\n\t\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n\t\t newLevel += SHIFT;\n\t\t offsetShift += 1 << newLevel;\n\t\t }\n\t\t if (offsetShift) {\n\t\t newOrigin += offsetShift;\n\t\t oldOrigin += offsetShift;\n\t\t newCapacity += offsetShift;\n\t\t oldCapacity += offsetShift;\n\t\t }\n\t\t var oldTailOffset = getTailOffset(oldCapacity);\n\t\t var newTailOffset = getTailOffset(newCapacity);\n\t\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n\t\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n\t\t newLevel += SHIFT;\n\t\t }\n\t\t var oldTail = list._tail;\n\t\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\t\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n\t\t newRoot = editableVNode(newRoot, owner);\n\t\t var node = newRoot;\n\t\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n\t\t var idx = (oldTailOffset >>> level) & MASK;\n\t\t node = node.array[idx] = editableVNode(node.array[idx], owner);\n\t\t }\n\t\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n\t\t }\n\t\t if (newCapacity < oldCapacity) {\n\t\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n\t\t }\n\t\t if (newOrigin >= newTailOffset) {\n\t\t newOrigin -= newTailOffset;\n\t\t newCapacity -= newTailOffset;\n\t\t newLevel = SHIFT;\n\t\t newRoot = null;\n\t\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\t\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n\t\t offsetShift = 0;\n\t\t while (newRoot) {\n\t\t var beginIndex = (newOrigin >>> newLevel) & MASK;\n\t\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n\t\t break;\n\t\t }\n\t\t if (beginIndex) {\n\t\t offsetShift += (1 << newLevel) * beginIndex;\n\t\t }\n\t\t newLevel -= SHIFT;\n\t\t newRoot = newRoot.array[beginIndex];\n\t\t }\n\t\t if (newRoot && newOrigin > oldOrigin) {\n\t\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n\t\t }\n\t\t if (newRoot && newTailOffset < oldTailOffset) {\n\t\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n\t\t }\n\t\t if (offsetShift) {\n\t\t newOrigin -= offsetShift;\n\t\t newCapacity -= offsetShift;\n\t\t }\n\t\t }\n\t\t if (list.__ownerID) {\n\t\t list.size = newCapacity - newOrigin;\n\t\t list._origin = newOrigin;\n\t\t list._capacity = newCapacity;\n\t\t list._level = newLevel;\n\t\t list._root = newRoot;\n\t\t list._tail = newTail;\n\t\t list.__hash = undefined;\n\t\t list.__altered = true;\n\t\t return list;\n\t\t }\n\t\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n\t\t}\n\t\tfunction mergeIntoListWith(list, merger, iterables) {\n\t\t var iters = [];\n\t\t var maxSize = 0;\n\t\t for (var ii = 0; ii < iterables.length; ii++) {\n\t\t var value = iterables[ii];\n\t\t var iter = IndexedIterable(value);\n\t\t if (iter.size > maxSize) {\n\t\t maxSize = iter.size;\n\t\t }\n\t\t if (!isIterable(value)) {\n\t\t iter = iter.map((function(v) {\n\t\t return fromJS(v);\n\t\t }));\n\t\t }\n\t\t iters.push(iter);\n\t\t }\n\t\t if (maxSize > list.size) {\n\t\t list = list.setSize(maxSize);\n\t\t }\n\t\t return mergeIntoCollectionWith(list, merger, iters);\n\t\t}\n\t\tfunction getTailOffset(size) {\n\t\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n\t\t}\n\t\tvar OrderedMap = function OrderedMap(value) {\n\t\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().withMutations((function(map) {\n\t\t var iter = KeyedIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v, k) {\n\t\t return map.set(k, v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(OrderedMap, {\n\t\t toString: function() {\n\t\t return this.__toString('OrderedMap {', '}');\n\t\t },\n\t\t get: function(k, notSetValue) {\n\t\t var index = this._map.get(k);\n\t\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = 0;\n\t\t this._map.clear();\n\t\t this._list.clear();\n\t\t return this;\n\t\t }\n\t\t return emptyOrderedMap();\n\t\t },\n\t\t set: function(k, v) {\n\t\t return updateOrderedMap(this, k, v);\n\t\t },\n\t\t remove: function(k) {\n\t\t return updateOrderedMap(this, k, NOT_SET);\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this._map.wasAltered() || this._list.wasAltered();\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._list.__iterate((function(entry) {\n\t\t return entry && fn(entry[1], entry[0], $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return this._list.fromEntrySeq().__iterator(type, reverse);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map.__ensureOwner(ownerID);\n\t\t var newList = this._list.__ensureOwner(ownerID);\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this._map = newMap;\n\t\t this._list = newList;\n\t\t return this;\n\t\t }\n\t\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n\t\t }\n\t\t}, {of: function() {\n\t\t return this(arguments);\n\t\t }}, Map);\n\t\tfunction isOrderedMap(maybeOrderedMap) {\n\t\t return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\n\t\t}\n\t\tOrderedMap.isOrderedMap = isOrderedMap;\n\t\tOrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\t\tfunction makeOrderedMap(map, list, ownerID, hash) {\n\t\t var omap = Object.create(OrderedMap.prototype);\n\t\t omap.size = map ? map.size : 0;\n\t\t omap._map = map;\n\t\t omap._list = list;\n\t\t omap.__ownerID = ownerID;\n\t\t omap.__hash = hash;\n\t\t return omap;\n\t\t}\n\t\tvar EMPTY_ORDERED_MAP;\n\t\tfunction emptyOrderedMap() {\n\t\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n\t\t}\n\t\tfunction updateOrderedMap(omap, k, v) {\n\t\t var map = omap._map;\n\t\t var list = omap._list;\n\t\t var i = map.get(k);\n\t\t var has = i !== undefined;\n\t\t var newMap;\n\t\t var newList;\n\t\t if (v === NOT_SET) {\n\t\t if (!has) {\n\t\t return omap;\n\t\t }\n\t\t if (list.size >= SIZE && list.size >= map.size * 2) {\n\t\t newList = list.filter((function(entry, idx) {\n\t\t return entry !== undefined && i !== idx;\n\t\t }));\n\t\t newMap = newList.toKeyedSeq().map((function(entry) {\n\t\t return entry[0];\n\t\t })).flip().toMap();\n\t\t if (omap.__ownerID) {\n\t\t newMap.__ownerID = newList.__ownerID = omap.__ownerID;\n\t\t }\n\t\t } else {\n\t\t newMap = map.remove(k);\n\t\t newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\n\t\t }\n\t\t } else {\n\t\t if (has) {\n\t\t if (v === list.get(i)[1]) {\n\t\t return omap;\n\t\t }\n\t\t newMap = map;\n\t\t newList = list.set(i, [k, v]);\n\t\t } else {\n\t\t newMap = map.set(k, list.size);\n\t\t newList = list.set(list.size, [k, v]);\n\t\t }\n\t\t }\n\t\t if (omap.__ownerID) {\n\t\t omap.size = newMap.size;\n\t\t omap._map = newMap;\n\t\t omap._list = newList;\n\t\t omap.__hash = undefined;\n\t\t return omap;\n\t\t }\n\t\t return makeOrderedMap(newMap, newList);\n\t\t}\n\t\tvar Stack = function Stack(value) {\n\t\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\n\t\t};\n\t\tvar $Stack = Stack;\n\t\t($traceurRuntime.createClass)(Stack, {\n\t\t toString: function() {\n\t\t return this.__toString('Stack [', ']');\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t var head = this._head;\n\t\t while (head && index--) {\n\t\t head = head.next;\n\t\t }\n\t\t return head ? head.value : notSetValue;\n\t\t },\n\t\t peek: function() {\n\t\t return this._head && this._head.value;\n\t\t },\n\t\t push: function() {\n\t\t if (arguments.length === 0) {\n\t\t return this;\n\t\t }\n\t\t var newSize = this.size + arguments.length;\n\t\t var head = this._head;\n\t\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\n\t\t head = {\n\t\t value: arguments[ii],\n\t\t next: head\n\t\t };\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = newSize;\n\t\t this._head = head;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return makeStack(newSize, head);\n\t\t },\n\t\t pushAll: function(iter) {\n\t\t iter = IndexedIterable(iter);\n\t\t if (iter.size === 0) {\n\t\t return this;\n\t\t }\n\t\t assertNotInfinite(iter.size);\n\t\t var newSize = this.size;\n\t\t var head = this._head;\n\t\t iter.reverse().forEach((function(value) {\n\t\t newSize++;\n\t\t head = {\n\t\t value: value,\n\t\t next: head\n\t\t };\n\t\t }));\n\t\t if (this.__ownerID) {\n\t\t this.size = newSize;\n\t\t this._head = head;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return makeStack(newSize, head);\n\t\t },\n\t\t pop: function() {\n\t\t return this.slice(1);\n\t\t },\n\t\t unshift: function() {\n\t\t return this.push.apply(this, arguments);\n\t\t },\n\t\t unshiftAll: function(iter) {\n\t\t return this.pushAll(iter);\n\t\t },\n\t\t shift: function() {\n\t\t return this.pop.apply(this, arguments);\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = 0;\n\t\t this._head = undefined;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return emptyStack();\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t if (wholeSlice(begin, end, this.size)) {\n\t\t return this;\n\t\t }\n\t\t var resolvedBegin = resolveBegin(begin, this.size);\n\t\t var resolvedEnd = resolveEnd(end, this.size);\n\t\t if (resolvedEnd !== this.size) {\n\t\t return $traceurRuntime.superCall(this, $Stack.prototype, \"slice\", [begin, end]);\n\t\t }\n\t\t var newSize = this.size - resolvedBegin;\n\t\t var head = this._head;\n\t\t while (resolvedBegin--) {\n\t\t head = head.next;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = newSize;\n\t\t this._head = head;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return makeStack(newSize, head);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this.__altered = false;\n\t\t return this;\n\t\t }\n\t\t return makeStack(this.size, this._head, ownerID, this.__hash);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t if (reverse) {\n\t\t return this.toSeq().cacheResult.__iterate(fn, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t var node = this._head;\n\t\t while (node) {\n\t\t if (fn(node.value, iterations++, this) === false) {\n\t\t break;\n\t\t }\n\t\t node = node.next;\n\t\t }\n\t\t return iterations;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.toSeq().cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t var node = this._head;\n\t\t return new Iterator((function() {\n\t\t if (node) {\n\t\t var value = node.value;\n\t\t node = node.next;\n\t\t return iteratorValue(type, iterations++, value);\n\t\t }\n\t\t return iteratorDone();\n\t\t }));\n\t\t }\n\t\t}, {of: function() {\n\t\t return this(arguments);\n\t\t }}, IndexedCollection);\n\t\tfunction isStack(maybeStack) {\n\t\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n\t\t}\n\t\tStack.isStack = isStack;\n\t\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\t\tvar StackPrototype = Stack.prototype;\n\t\tStackPrototype[IS_STACK_SENTINEL] = true;\n\t\tStackPrototype.withMutations = MapPrototype.withMutations;\n\t\tStackPrototype.asMutable = MapPrototype.asMutable;\n\t\tStackPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tStackPrototype.wasAltered = MapPrototype.wasAltered;\n\t\tfunction makeStack(size, head, ownerID, hash) {\n\t\t var map = Object.create(StackPrototype);\n\t\t map.size = size;\n\t\t map._head = head;\n\t\t map.__ownerID = ownerID;\n\t\t map.__hash = hash;\n\t\t map.__altered = false;\n\t\t return map;\n\t\t}\n\t\tvar EMPTY_STACK;\n\t\tfunction emptyStack() {\n\t\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n\t\t}\n\t\tvar Set = function Set(value) {\n\t\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().withMutations((function(set) {\n\t\t var iter = SetIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v) {\n\t\t return set.add(v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(Set, {\n\t\t toString: function() {\n\t\t return this.__toString('Set {', '}');\n\t\t },\n\t\t has: function(value) {\n\t\t return this._map.has(value);\n\t\t },\n\t\t add: function(value) {\n\t\t return updateSet(this, this._map.set(value, true));\n\t\t },\n\t\t remove: function(value) {\n\t\t return updateSet(this, this._map.remove(value));\n\t\t },\n\t\t clear: function() {\n\t\t return updateSet(this, this._map.clear());\n\t\t },\n\t\t union: function() {\n\t\t for (var iters = [],\n\t\t $__9 = 0; $__9 < arguments.length; $__9++)\n\t\t iters[$__9] = arguments[$__9];\n\t\t iters = iters.filter((function(x) {\n\t\t return x.size !== 0;\n\t\t }));\n\t\t if (iters.length === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.size === 0 && iters.length === 1) {\n\t\t return this.constructor(iters[0]);\n\t\t }\n\t\t return this.withMutations((function(set) {\n\t\t for (var ii = 0; ii < iters.length; ii++) {\n\t\t SetIterable(iters[ii]).forEach((function(value) {\n\t\t return set.add(value);\n\t\t }));\n\t\t }\n\t\t }));\n\t\t },\n\t\t intersect: function() {\n\t\t for (var iters = [],\n\t\t $__10 = 0; $__10 < arguments.length; $__10++)\n\t\t iters[$__10] = arguments[$__10];\n\t\t if (iters.length === 0) {\n\t\t return this;\n\t\t }\n\t\t iters = iters.map((function(iter) {\n\t\t return SetIterable(iter);\n\t\t }));\n\t\t var originalSet = this;\n\t\t return this.withMutations((function(set) {\n\t\t originalSet.forEach((function(value) {\n\t\t if (!iters.every((function(iter) {\n\t\t return iter.contains(value);\n\t\t }))) {\n\t\t set.remove(value);\n\t\t }\n\t\t }));\n\t\t }));\n\t\t },\n\t\t subtract: function() {\n\t\t for (var iters = [],\n\t\t $__11 = 0; $__11 < arguments.length; $__11++)\n\t\t iters[$__11] = arguments[$__11];\n\t\t if (iters.length === 0) {\n\t\t return this;\n\t\t }\n\t\t iters = iters.map((function(iter) {\n\t\t return SetIterable(iter);\n\t\t }));\n\t\t var originalSet = this;\n\t\t return this.withMutations((function(set) {\n\t\t originalSet.forEach((function(value) {\n\t\t if (iters.some((function(iter) {\n\t\t return iter.contains(value);\n\t\t }))) {\n\t\t set.remove(value);\n\t\t }\n\t\t }));\n\t\t }));\n\t\t },\n\t\t merge: function() {\n\t\t return this.union.apply(this, arguments);\n\t\t },\n\t\t mergeWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__12 = 1; $__12 < arguments.length; $__12++)\n\t\t iters[$__12 - 1] = arguments[$__12];\n\t\t return this.union.apply(this, iters);\n\t\t },\n\t\t sort: function(comparator) {\n\t\t return OrderedSet(sortFactory(this, comparator));\n\t\t },\n\t\t sortBy: function(mapper, comparator) {\n\t\t return OrderedSet(sortFactory(this, comparator, mapper));\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this._map.wasAltered();\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._map.__iterate((function(_, k) {\n\t\t return fn(k, k, $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return this._map.map((function(_, k) {\n\t\t return k;\n\t\t })).__iterator(type, reverse);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map.__ensureOwner(ownerID);\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this._map = newMap;\n\t\t return this;\n\t\t }\n\t\t return this.__make(newMap, ownerID);\n\t\t }\n\t\t}, {\n\t\t of: function() {\n\t\t return this(arguments);\n\t\t },\n\t\t fromKeys: function(value) {\n\t\t return this(KeyedIterable(value).keySeq());\n\t\t }\n\t\t}, SetCollection);\n\t\tfunction isSet(maybeSet) {\n\t\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n\t\t}\n\t\tSet.isSet = isSet;\n\t\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\t\tvar SetPrototype = Set.prototype;\n\t\tSetPrototype[IS_SET_SENTINEL] = true;\n\t\tSetPrototype[DELETE] = SetPrototype.remove;\n\t\tSetPrototype.mergeDeep = SetPrototype.merge;\n\t\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n\t\tSetPrototype.withMutations = MapPrototype.withMutations;\n\t\tSetPrototype.asMutable = MapPrototype.asMutable;\n\t\tSetPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tSetPrototype.__empty = emptySet;\n\t\tSetPrototype.__make = makeSet;\n\t\tfunction updateSet(set, newMap) {\n\t\t if (set.__ownerID) {\n\t\t set.size = newMap.size;\n\t\t set._map = newMap;\n\t\t return set;\n\t\t }\n\t\t return newMap === set._map ? set : newMap.size === 0 ? set.__empty() : set.__make(newMap);\n\t\t}\n\t\tfunction makeSet(map, ownerID) {\n\t\t var set = Object.create(SetPrototype);\n\t\t set.size = map ? map.size : 0;\n\t\t set._map = map;\n\t\t set.__ownerID = ownerID;\n\t\t return set;\n\t\t}\n\t\tvar EMPTY_SET;\n\t\tfunction emptySet() {\n\t\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n\t\t}\n\t\tvar OrderedSet = function OrderedSet(value) {\n\t\t return value === null || value === undefined ? emptyOrderedSet() : isOrderedSet(value) ? value : emptyOrderedSet().withMutations((function(set) {\n\t\t var iter = SetIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v) {\n\t\t return set.add(v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(OrderedSet, {toString: function() {\n\t\t return this.__toString('OrderedSet {', '}');\n\t\t }}, {\n\t\t of: function() {\n\t\t return this(arguments);\n\t\t },\n\t\t fromKeys: function(value) {\n\t\t return this(KeyedIterable(value).keySeq());\n\t\t }\n\t\t}, Set);\n\t\tfunction isOrderedSet(maybeOrderedSet) {\n\t\t return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\n\t\t}\n\t\tOrderedSet.isOrderedSet = isOrderedSet;\n\t\tvar OrderedSetPrototype = OrderedSet.prototype;\n\t\tOrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\n\t\tOrderedSetPrototype.__empty = emptyOrderedSet;\n\t\tOrderedSetPrototype.__make = makeOrderedSet;\n\t\tfunction makeOrderedSet(map, ownerID) {\n\t\t var set = Object.create(OrderedSetPrototype);\n\t\t set.size = map ? map.size : 0;\n\t\t set._map = map;\n\t\t set.__ownerID = ownerID;\n\t\t return set;\n\t\t}\n\t\tvar EMPTY_ORDERED_SET;\n\t\tfunction emptyOrderedSet() {\n\t\t return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\n\t\t}\n\t\tvar Record = function Record(defaultValues, name) {\n\t\t var RecordType = function Record(values) {\n\t\t if (!(this instanceof RecordType)) {\n\t\t return new RecordType(values);\n\t\t }\n\t\t this._map = Map(values);\n\t\t };\n\t\t var keys = Object.keys(defaultValues);\n\t\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n\t\t RecordTypePrototype.constructor = RecordType;\n\t\t name && (RecordTypePrototype._name = name);\n\t\t RecordTypePrototype._defaultValues = defaultValues;\n\t\t RecordTypePrototype._keys = keys;\n\t\t RecordTypePrototype.size = keys.length;\n\t\t try {\n\t\t keys.forEach((function(key) {\n\t\t Object.defineProperty(RecordType.prototype, key, {\n\t\t get: function() {\n\t\t return this.get(key);\n\t\t },\n\t\t set: function(value) {\n\t\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\n\t\t this.set(key, value);\n\t\t }\n\t\t });\n\t\t }));\n\t\t } catch (error) {}\n\t\t return RecordType;\n\t\t};\n\t\t($traceurRuntime.createClass)(Record, {\n\t\t toString: function() {\n\t\t return this.__toString(recordName(this) + ' {', '}');\n\t\t },\n\t\t has: function(k) {\n\t\t return this._defaultValues.hasOwnProperty(k);\n\t\t },\n\t\t get: function(k, notSetValue) {\n\t\t if (!this.has(k)) {\n\t\t return notSetValue;\n\t\t }\n\t\t var defaultVal = this._defaultValues[k];\n\t\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\n\t\t },\n\t\t clear: function() {\n\t\t if (this.__ownerID) {\n\t\t this._map && this._map.clear();\n\t\t return this;\n\t\t }\n\t\t var SuperRecord = Object.getPrototypeOf(this).constructor;\n\t\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\n\t\t },\n\t\t set: function(k, v) {\n\t\t if (!this.has(k)) {\n\t\t throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n\t\t }\n\t\t var newMap = this._map && this._map.set(k, v);\n\t\t if (this.__ownerID || newMap === this._map) {\n\t\t return this;\n\t\t }\n\t\t return makeRecord(this, newMap);\n\t\t },\n\t\t remove: function(k) {\n\t\t if (!this.has(k)) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map && this._map.remove(k);\n\t\t if (this.__ownerID || newMap === this._map) {\n\t\t return this;\n\t\t }\n\t\t return makeRecord(this, newMap);\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this._map.wasAltered();\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var $__0 = this;\n\t\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t\t return $__0.get(k);\n\t\t })).__iterator(type, reverse);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t\t return $__0.get(k);\n\t\t })).__iterate(fn, reverse);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map && this._map.__ensureOwner(ownerID);\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this._map = newMap;\n\t\t return this;\n\t\t }\n\t\t return makeRecord(this, newMap, ownerID);\n\t\t }\n\t\t}, {}, KeyedCollection);\n\t\tvar RecordPrototype = Record.prototype;\n\t\tRecordPrototype[DELETE] = RecordPrototype.remove;\n\t\tRecordPrototype.deleteIn = RecordPrototype.removeIn = MapPrototype.removeIn;\n\t\tRecordPrototype.merge = MapPrototype.merge;\n\t\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\n\t\tRecordPrototype.mergeIn = MapPrototype.mergeIn;\n\t\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n\t\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n\t\tRecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n\t\tRecordPrototype.setIn = MapPrototype.setIn;\n\t\tRecordPrototype.update = MapPrototype.update;\n\t\tRecordPrototype.updateIn = MapPrototype.updateIn;\n\t\tRecordPrototype.withMutations = MapPrototype.withMutations;\n\t\tRecordPrototype.asMutable = MapPrototype.asMutable;\n\t\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tfunction makeRecord(likeRecord, map, ownerID) {\n\t\t var record = Object.create(Object.getPrototypeOf(likeRecord));\n\t\t record._map = map;\n\t\t record.__ownerID = ownerID;\n\t\t return record;\n\t\t}\n\t\tfunction recordName(record) {\n\t\t return record._name || record.constructor.name;\n\t\t}\n\t\tvar Range = function Range(start, end, step) {\n\t\t if (!(this instanceof $Range)) {\n\t\t return new $Range(start, end, step);\n\t\t }\n\t\t invariant(step !== 0, 'Cannot step a Range by 0');\n\t\t start = start || 0;\n\t\t if (end === undefined) {\n\t\t end = Infinity;\n\t\t }\n\t\t if (start === end && __EMPTY_RANGE) {\n\t\t return __EMPTY_RANGE;\n\t\t }\n\t\t step = step === undefined ? 1 : Math.abs(step);\n\t\t if (end < start) {\n\t\t step = -step;\n\t\t }\n\t\t this._start = start;\n\t\t this._end = end;\n\t\t this._step = step;\n\t\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n\t\t};\n\t\tvar $Range = Range;\n\t\t($traceurRuntime.createClass)(Range, {\n\t\t toString: function() {\n\t\t if (this.size === 0) {\n\t\t return 'Range []';\n\t\t }\n\t\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\n\t\t },\n\t\t contains: function(searchValue) {\n\t\t var possibleIndex = (searchValue - this._start) / this._step;\n\t\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t if (wholeSlice(begin, end, this.size)) {\n\t\t return this;\n\t\t }\n\t\t begin = resolveBegin(begin, this.size);\n\t\t end = resolveEnd(end, this.size);\n\t\t if (end <= begin) {\n\t\t return __EMPTY_RANGE;\n\t\t }\n\t\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n\t\t },\n\t\t indexOf: function(searchValue) {\n\t\t var offsetValue = searchValue - this._start;\n\t\t if (offsetValue % this._step === 0) {\n\t\t var index = offsetValue / this._step;\n\t\t if (index >= 0 && index < this.size) {\n\t\t return index;\n\t\t }\n\t\t }\n\t\t return -1;\n\t\t },\n\t\t lastIndexOf: function(searchValue) {\n\t\t return this.indexOf(searchValue);\n\t\t },\n\t\t take: function(amount) {\n\t\t return this.slice(0, Math.max(0, amount));\n\t\t },\n\t\t skip: function(amount) {\n\t\t return this.slice(Math.max(0, amount));\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var maxIndex = this.size - 1;\n\t\t var step = this._step;\n\t\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t if (fn(value, ii, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t value += reverse ? -step : step;\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var maxIndex = this.size - 1;\n\t\t var step = this._step;\n\t\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t var v = value;\n\t\t value += reverse ? -step : step;\n\t\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n\t\t }));\n\t\t },\n\t\t equals: function(other) {\n\t\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : deepEqual(this, other);\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar RangePrototype = Range.prototype;\n\t\tRangePrototype.__toJS = RangePrototype.toArray;\n\t\tRangePrototype.first = ListPrototype.first;\n\t\tRangePrototype.last = ListPrototype.last;\n\t\tvar __EMPTY_RANGE = Range(0, 0);\n\t\tvar Repeat = function Repeat(value, times) {\n\t\t if (times <= 0 && EMPTY_REPEAT) {\n\t\t return EMPTY_REPEAT;\n\t\t }\n\t\t if (!(this instanceof $Repeat)) {\n\t\t return new $Repeat(value, times);\n\t\t }\n\t\t this._value = value;\n\t\t this.size = times === undefined ? Infinity : Math.max(0, times);\n\t\t if (this.size === 0) {\n\t\t EMPTY_REPEAT = this;\n\t\t }\n\t\t};\n\t\tvar $Repeat = Repeat;\n\t\t($traceurRuntime.createClass)(Repeat, {\n\t\t toString: function() {\n\t\t if (this.size === 0) {\n\t\t return 'Repeat []';\n\t\t }\n\t\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t return this.has(index) ? this._value : notSetValue;\n\t\t },\n\t\t contains: function(searchValue) {\n\t\t return is(this._value, searchValue);\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t var size = this.size;\n\t\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n\t\t },\n\t\t reverse: function() {\n\t\t return this;\n\t\t },\n\t\t indexOf: function(searchValue) {\n\t\t if (is(this._value, searchValue)) {\n\t\t return 0;\n\t\t }\n\t\t return -1;\n\t\t },\n\t\t lastIndexOf: function(searchValue) {\n\t\t if (is(this._value, searchValue)) {\n\t\t return this.size;\n\t\t }\n\t\t return -1;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t for (var ii = 0; ii < this.size; ii++) {\n\t\t if (fn(this._value, ii, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var $__0 = this;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\n\t\t }));\n\t\t },\n\t\t equals: function(other) {\n\t\t return other instanceof $Repeat ? is(this._value, other._value) : deepEqual(other);\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar RepeatPrototype = Repeat.prototype;\n\t\tRepeatPrototype.last = RepeatPrototype.first;\n\t\tRepeatPrototype.has = RangePrototype.has;\n\t\tRepeatPrototype.take = RangePrototype.take;\n\t\tRepeatPrototype.skip = RangePrototype.skip;\n\t\tRepeatPrototype.__toJS = RangePrototype.__toJS;\n\t\tvar EMPTY_REPEAT;\n\t\tvar Immutable = {\n\t\t Iterable: Iterable,\n\t\t Seq: Seq,\n\t\t Collection: Collection,\n\t\t Map: Map,\n\t\t OrderedMap: OrderedMap,\n\t\t List: List,\n\t\t Stack: Stack,\n\t\t Set: Set,\n\t\t OrderedSet: OrderedSet,\n\t\t Record: Record,\n\t\t Range: Range,\n\t\t Repeat: Repeat,\n\t\t is: is,\n\t\t fromJS: fromJS\n\t\t};\n\n\t\t return Immutable;\n\t\t}","function Module(stdlib, imports, buffer) {\n \"use asm\";\n\n function f() {\n return 281474976710655 * 1048575 | 0;\n }\n\n return {\n f: f\n };\n}","function v7(v8,v9) {\n const v10 = gc;\n // v10 = .function([] => .undefined)\n let v13 = 0;\n const v16 = [13.37,13.37,13.37,13.37];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = [1337,1337,1337,1337];\n // v18 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v19 = [3697200800,v16,v18];\n // v19 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v20 = v6[0];\n // v20 = .unknown\n const v21 = Symbol;\n // v21 = .object(ofGroup: SymbolConstructor, withProperties: [\"match\", \"asyncIterator\", \"search\", \"iterator\", \"replace\", \"isConcatSpreadable\", \"toStringTag\", \"split\", \"toPrimitive\", \"matchAll\", \"hasInstance\", \"unscopable\", \"species\"], withMethods: [\"for\", \"keyFor\"]) + .function([.string] => .object(ofGroup: Symbol, withProperties: [\"__proto__\", \"description\"]))\n for (let v25 = 0; v25 < 4; v25 = v25 + 1) {\n }\n function v27(v28,v29) {\n }\n do {\n const v31 = [13.37,13.37,13.37,13.37];\n // v31 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v34 = [1337,1337,Function,1337];\n // v34 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v35 = {__proto__:v34,a:v31,c:1337,d:Function,e:v34,toString:Function};\n // v35 = .object(ofGroup: Object, withProperties: [\"a\", \"__proto__\", \"toString\", \"d\", \"c\", \"e\"])\n let v39 = 0;\n while (v39 < 1337) {\n const v40 = v39 + 1;\n // v40 = .primitive\n v39 = v40;\n }\n const v41 = [13.37,13.37,13.37,13.37];\n // v41 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v43 = [1337,1337,1337,1337];\n // v43 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v44 = [3697200800,v41,v43];\n // v44 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v45 = v13 + 1;\n // v45 = .primitive\n function v48(v49,v50) {\n return v44;\n }\n const v51 = [1337,1337,1337,1337];\n // v51 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n for (let v54 = 0; v54 < 100; v54 = v54 + 100) {\n }\n const v55 = {__proto__:v51,a:1337,c:1337,d:Function,e:v51,toString:Function};\n // v55 = .object(ofGroup: Object, withProperties: [\"e\", \"c\", \"__proto__\", \"toString\", \"d\", \"a\"])\n const v56 = v48(1337,v41,...v55);\n // v56 = .unknown\n v13 = v45;\n } while (v13 < 7);\n return v3;\n}","function e(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function universalModule() {\n\t var $Object = Object;\n\n\tfunction createClass(ctor, methods, staticMethods, superClass) {\n\t var proto;\n\t if (superClass) {\n\t var superProto = superClass.prototype;\n\t proto = $Object.create(superProto);\n\t } else {\n\t proto = ctor.prototype;\n\t }\n\t $Object.keys(methods).forEach(function (key) {\n\t proto[key] = methods[key];\n\t });\n\t $Object.keys(staticMethods).forEach(function (key) {\n\t ctor[key] = staticMethods[key];\n\t });\n\t proto.constructor = ctor;\n\t ctor.prototype = proto;\n\t return ctor;\n\t}\n\n\tfunction superCall(self, proto, name, args) {\n\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\n\t}\n\n\tfunction defaultSuperCall(self, proto, args) {\n\t superCall(self, proto, 'constructor', args);\n\t}\n\n\tvar $traceurRuntime = {};\n\t$traceurRuntime.createClass = createClass;\n\t$traceurRuntime.superCall = superCall;\n\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\n\t\"use strict\";\n\tfunction is(first, second) {\n\t if (first === second) {\n\t return first !== 0 || second !== 0 || 1 / first === 1 / second;\n\t }\n\t if (first !== first) {\n\t return second !== second;\n\t }\n\t if (first && typeof first.equals === 'function') {\n\t return first.equals(second);\n\t }\n\t return false;\n\t}\n\tfunction invariant(condition, error) {\n\t if (!condition)\n\t throw new Error(error);\n\t}\n\tvar DELETE = 'delete';\n\tvar SHIFT = 5;\n\tvar SIZE = 1 << SHIFT;\n\tvar MASK = SIZE - 1;\n\tvar NOT_SET = {};\n\tvar CHANGE_LENGTH = {value: false};\n\tvar DID_ALTER = {value: false};\n\tfunction MakeRef(ref) {\n\t ref.value = false;\n\t return ref;\n\t}\n\tfunction SetRef(ref) {\n\t ref && (ref.value = true);\n\t}\n\tfunction OwnerID() {}\n\tfunction arrCopy(arr, offset) {\n\t offset = offset || 0;\n\t var len = Math.max(0, arr.length - offset);\n\t var newArr = new Array(len);\n\t for (var ii = 0; ii < len; ii++) {\n\t newArr[ii] = arr[ii + offset];\n\t }\n\t return newArr;\n\t}\n\tfunction assertNotInfinite(size) {\n\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\n\t}\n\tfunction ensureSize(iter) {\n\t if (iter.size === undefined) {\n\t iter.size = iter.__iterate(returnTrue);\n\t }\n\t return iter.size;\n\t}\n\tfunction wrapIndex(iter, index) {\n\t return index >= 0 ? index : ensureSize(iter) + index;\n\t}\n\tfunction returnTrue() {\n\t return true;\n\t}\n\tfunction wholeSlice(begin, end, size) {\n\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\n\t}\n\tfunction resolveBegin(begin, size) {\n\t return resolveIndex(begin, size, 0);\n\t}\n\tfunction resolveEnd(end, size) {\n\t return resolveIndex(end, size, size);\n\t}\n\tfunction resolveIndex(index, size, defaultIndex) {\n\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\n\t}\n\tfunction hash(o) {\n\t if (!o) {\n\t return 0;\n\t }\n\t if (o === true) {\n\t return 1;\n\t }\n\t var type = typeof o;\n\t if (type === 'number') {\n\t if ((o | 0) === o) {\n\t return o & HASH_MAX_VAL;\n\t }\n\t o = '' + o;\n\t type = 'string';\n\t }\n\t if (type === 'string') {\n\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n\t }\n\t if (o.hashCode) {\n\t return hash(typeof o.hashCode === 'function' ? o.hashCode() : o.hashCode);\n\t }\n\t return hashJSObj(o);\n\t}\n\tfunction cachedHashString(string) {\n\t var hash = stringHashCache[string];\n\t if (hash === undefined) {\n\t hash = hashString(string);\n\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n\t STRING_HASH_CACHE_SIZE = 0;\n\t stringHashCache = {};\n\t }\n\t STRING_HASH_CACHE_SIZE++;\n\t stringHashCache[string] = hash;\n\t }\n\t return hash;\n\t}\n\tfunction hashString(string) {\n\t var hash = 0;\n\t for (var ii = 0; ii < string.length; ii++) {\n\t hash = (31 * hash + string.charCodeAt(ii)) & HASH_MAX_VAL;\n\t }\n\t return hash;\n\t}\n\tfunction hashJSObj(obj) {\n\t var hash = weakMap && weakMap.get(obj);\n\t if (hash)\n\t return hash;\n\t hash = obj[UID_HASH_KEY];\n\t if (hash)\n\t return hash;\n\t if (!canDefineProperty) {\n\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n\t if (hash)\n\t return hash;\n\t hash = getIENodeHash(obj);\n\t if (hash)\n\t return hash;\n\t }\n\t if (Object.isExtensible && !Object.isExtensible(obj)) {\n\t throw new Error('Non-extensible objects are not allowed as keys.');\n\t }\n\t hash = ++objHashUID & HASH_MAX_VAL;\n\t if (weakMap) {\n\t weakMap.set(obj, hash);\n\t } else if (canDefineProperty) {\n\t Object.defineProperty(obj, UID_HASH_KEY, {\n\t 'enumerable': false,\n\t 'configurable': false,\n\t 'writable': false,\n\t 'value': hash\n\t });\n\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n\t obj.propertyIsEnumerable = function() {\n\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n\t };\n\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n\t } else if (obj.nodeType) {\n\t obj[UID_HASH_KEY] = hash;\n\t } else {\n\t throw new Error('Unable to set a non-enumerable property on object.');\n\t }\n\t return hash;\n\t}\n\tvar canDefineProperty = (function() {\n\t try {\n\t Object.defineProperty({}, 'x', {});\n\t return true;\n\t } catch (e) {\n\t return false;\n\t }\n\t}());\n\tfunction getIENodeHash(node) {\n\t if (node && node.nodeType > 0) {\n\t switch (node.nodeType) {\n\t case 1:\n\t return node.uniqueID;\n\t case 9:\n\t return node.documentElement && node.documentElement.uniqueID;\n\t }\n\t }\n\t}\n\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\n\tvar HASH_MAX_VAL = 0x7FFFFFFF;\n\tvar objHashUID = 0;\n\tvar UID_HASH_KEY = '__immutablehash__';\n\tif (typeof Symbol === 'function') {\n\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\n\t}\n\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\n\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\n\tvar STRING_HASH_CACHE_SIZE = 0;\n\tvar stringHashCache = {};\n\tvar ITERATE_KEYS = 0;\n\tvar ITERATE_VALUES = 1;\n\tvar ITERATE_ENTRIES = 2;\n\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\n\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\tvar Iterator = function Iterator(next) {\n\t this.next = next;\n\t};\n\t($traceurRuntime.createClass)(Iterator, {toString: function() {\n\t return '[Iterator]';\n\t }}, {});\n\tIterator.KEYS = ITERATE_KEYS;\n\tIterator.VALUES = ITERATE_VALUES;\n\tIterator.ENTRIES = ITERATE_ENTRIES;\n\tvar IteratorPrototype = Iterator.prototype;\n\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\n\t return this.toString();\n\t};\n\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\n\t return this;\n\t};\n\tfunction iteratorValue(type, k, v, iteratorResult) {\n\t var value = type === 0 ? k : type === 1 ? v : [k, v];\n\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n\t value: value,\n\t done: false\n\t });\n\t return iteratorResult;\n\t}\n\tfunction iteratorDone() {\n\t return {\n\t value: undefined,\n\t done: true\n\t };\n\t}\n\tfunction hasIterator(maybeIterable) {\n\t return !!_iteratorFn(maybeIterable);\n\t}\n\tfunction isIterator(maybeIterator) {\n\t return maybeIterator && typeof maybeIterator.next === 'function';\n\t}\n\tfunction getIterator(iterable) {\n\t var iteratorFn = _iteratorFn(iterable);\n\t return iteratorFn && iteratorFn.call(iterable);\n\t}\n\tfunction _iteratorFn(iterable) {\n\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\n\t if (typeof iteratorFn === 'function') {\n\t return iteratorFn;\n\t }\n\t}\n\tvar Iterable = function Iterable(value) {\n\t return isIterable(value) ? value : Seq(value);\n\t};\n\tvar $Iterable = Iterable;\n\t($traceurRuntime.createClass)(Iterable, {\n\t toArray: function() {\n\t assertNotInfinite(this.size);\n\t var array = new Array(this.size || 0);\n\t this.valueSeq().__iterate((function(v, i) {\n\t array[i] = v;\n\t }));\n\t return array;\n\t },\n\t toIndexedSeq: function() {\n\t return new ToIndexedSequence(this);\n\t },\n\t toJS: function() {\n\t return this.toSeq().map((function(value) {\n\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\n\t })).__toJS();\n\t },\n\t toKeyedSeq: function() {\n\t return new ToKeyedSequence(this, true);\n\t },\n\t toMap: function() {\n\t assertNotInfinite(this.size);\n\t return Map(this.toKeyedSeq());\n\t },\n\t toObject: function() {\n\t assertNotInfinite(this.size);\n\t var object = {};\n\t this.__iterate((function(v, k) {\n\t object[k] = v;\n\t }));\n\t return object;\n\t },\n\t toOrderedMap: function() {\n\t assertNotInfinite(this.size);\n\t return OrderedMap(this.toKeyedSeq());\n\t },\n\t toSet: function() {\n\t assertNotInfinite(this.size);\n\t return Set(isKeyed(this) ? this.valueSeq() : this);\n\t },\n\t toSetSeq: function() {\n\t return new ToSetSequence(this);\n\t },\n\t toSeq: function() {\n\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\n\t },\n\t toStack: function() {\n\t assertNotInfinite(this.size);\n\t return Stack(isKeyed(this) ? this.valueSeq() : this);\n\t },\n\t toList: function() {\n\t assertNotInfinite(this.size);\n\t return List(isKeyed(this) ? this.valueSeq() : this);\n\t },\n\t toString: function() {\n\t return '[Iterable]';\n\t },\n\t __toString: function(head, tail) {\n\t if (this.size === 0) {\n\t return head + tail;\n\t }\n\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n\t },\n\t concat: function() {\n\t for (var values = [],\n\t $__2 = 0; $__2 < arguments.length; $__2++)\n\t values[$__2] = arguments[$__2];\n\t return reify(this, concatFactory(this, values));\n\t },\n\t contains: function(searchValue) {\n\t return this.some((function(value) {\n\t return is(value, searchValue);\n\t }));\n\t },\n\t entries: function() {\n\t return this.__iterator(ITERATE_ENTRIES);\n\t },\n\t every: function(predicate, context) {\n\t var returnValue = true;\n\t this.__iterate((function(v, k, c) {\n\t if (!predicate.call(context, v, k, c)) {\n\t returnValue = false;\n\t return false;\n\t }\n\t }));\n\t return returnValue;\n\t },\n\t filter: function(predicate, context) {\n\t return reify(this, filterFactory(this, predicate, context, true));\n\t },\n\t find: function(predicate, context, notSetValue) {\n\t var foundValue = notSetValue;\n\t this.__iterate((function(v, k, c) {\n\t if (predicate.call(context, v, k, c)) {\n\t foundValue = v;\n\t return false;\n\t }\n\t }));\n\t return foundValue;\n\t },\n\t forEach: function(sideEffect, context) {\n\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n\t },\n\t join: function(separator) {\n\t separator = separator !== undefined ? '' + separator : ',';\n\t var joined = '';\n\t var isFirst = true;\n\t this.__iterate((function(v) {\n\t isFirst ? (isFirst = false) : (joined += separator);\n\t joined += v !== null && v !== undefined ? v : '';\n\t }));\n\t return joined;\n\t },\n\t keys: function() {\n\t return this.__iterator(ITERATE_KEYS);\n\t },\n\t map: function(mapper, context) {\n\t return reify(this, mapFactory(this, mapper, context));\n\t },\n\t reduce: function(reducer, initialReduction, context) {\n\t var reduction;\n\t var useFirst;\n\t if (arguments.length < 2) {\n\t useFirst = true;\n\t } else {\n\t reduction = initialReduction;\n\t }\n\t this.__iterate((function(v, k, c) {\n\t if (useFirst) {\n\t useFirst = false;\n\t reduction = v;\n\t } else {\n\t reduction = reducer.call(context, reduction, v, k, c);\n\t }\n\t }));\n\t return reduction;\n\t },\n\t reduceRight: function(reducer, initialReduction, context) {\n\t var reversed = this.toKeyedSeq().reverse();\n\t return reversed.reduce.apply(reversed, arguments);\n\t },\n\t reverse: function() {\n\t return reify(this, reverseFactory(this, true));\n\t },\n\t slice: function(begin, end) {\n\t if (wholeSlice(begin, end, this.size)) {\n\t return this;\n\t }\n\t var resolvedBegin = resolveBegin(begin, this.size);\n\t var resolvedEnd = resolveEnd(end, this.size);\n\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n\t return this.toSeq().cacheResult().slice(begin, end);\n\t }\n\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\n\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\n\t },\n\t some: function(predicate, context) {\n\t return !this.every(not(predicate), context);\n\t },\n\t sort: function(comparator) {\n\t return this.sortBy(valueMapper, comparator);\n\t },\n\t values: function() {\n\t return this.__iterator(ITERATE_VALUES);\n\t },\n\t butLast: function() {\n\t return this.slice(0, -1);\n\t },\n\t count: function(predicate, context) {\n\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\n\t },\n\t countBy: function(grouper, context) {\n\t return countByFactory(this, grouper, context);\n\t },\n\t equals: function(other) {\n\t if (this === other) {\n\t return true;\n\t }\n\t if (!other || typeof other.equals !== 'function') {\n\t return false;\n\t }\n\t if (this.size !== undefined && other.size !== undefined) {\n\t if (this.size !== other.size) {\n\t return false;\n\t }\n\t if (this.size === 0 && other.size === 0) {\n\t return true;\n\t }\n\t }\n\t if (this.__hash !== undefined && other.__hash !== undefined && this.__hash !== other.__hash) {\n\t return false;\n\t }\n\t return this.__deepEquals(other);\n\t },\n\t __deepEquals: function(other) {\n\t var entries = this.entries();\n\t return typeof other.every === 'function' && other.every((function(v, k) {\n\t var entry = entries.next().value;\n\t return entry && is(entry[0], k) && is(entry[1], v);\n\t })) && entries.next().done;\n\t },\n\t entrySeq: function() {\n\t var iterable = this;\n\t if (iterable._cache) {\n\t return new ArraySeq(iterable._cache);\n\t }\n\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n\t entriesSequence.fromEntrySeq = (function() {\n\t return iterable.toSeq();\n\t });\n\t return entriesSequence;\n\t },\n\t filterNot: function(predicate, context) {\n\t return this.filter(not(predicate), context);\n\t },\n\t findLast: function(predicate, context, notSetValue) {\n\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n\t },\n\t first: function() {\n\t return this.find(returnTrue);\n\t },\n\t flatMap: function(mapper, context) {\n\t return reify(this, flatMapFactory(this, mapper, context));\n\t },\n\t flatten: function(depth) {\n\t return reify(this, flattenFactory(this, depth, true));\n\t },\n\t fromEntrySeq: function() {\n\t return new FromEntriesSequence(this);\n\t },\n\t get: function(searchKey, notSetValue) {\n\t return this.find((function(_, key) {\n\t return is(key, searchKey);\n\t }), undefined, notSetValue);\n\t },\n\t getIn: function(searchKeyPath, notSetValue) {\n\t var nested = this;\n\t if (searchKeyPath) {\n\t for (var ii = 0; ii < searchKeyPath.length; ii++) {\n\t nested = nested && nested.get ? nested.get(searchKeyPath[ii], NOT_SET) : NOT_SET;\n\t if (nested === NOT_SET) {\n\t return notSetValue;\n\t }\n\t }\n\t }\n\t return nested;\n\t },\n\t groupBy: function(grouper, context) {\n\t return groupByFactory(this, grouper, context);\n\t },\n\t has: function(searchKey) {\n\t return this.get(searchKey, NOT_SET) !== NOT_SET;\n\t },\n\t isSubset: function(iter) {\n\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\n\t return this.every((function(value) {\n\t return iter.contains(value);\n\t }));\n\t },\n\t isSuperset: function(iter) {\n\t return iter.isSubset(this);\n\t },\n\t keySeq: function() {\n\t return this.toSeq().map(keyMapper).toIndexedSeq();\n\t },\n\t last: function() {\n\t return this.toSeq().reverse().first();\n\t },\n\t max: function(comparator) {\n\t return this.maxBy(valueMapper, comparator);\n\t },\n\t maxBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t var maxEntry = this.entrySeq().reduce((function(max, next) {\n\t return comparator(mapper(next[1], next[0], $__0), mapper(max[1], max[0], $__0)) > 0 ? next : max;\n\t }));\n\t return maxEntry && maxEntry[1];\n\t },\n\t min: function(comparator) {\n\t return this.minBy(valueMapper, comparator);\n\t },\n\t minBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t var minEntry = this.entrySeq().reduce((function(min, next) {\n\t return comparator(mapper(next[1], next[0], $__0), mapper(min[1], min[0], $__0)) < 0 ? next : min;\n\t }));\n\t return minEntry && minEntry[1];\n\t },\n\t rest: function() {\n\t return this.slice(1);\n\t },\n\t skip: function(amount) {\n\t return reify(this, skipFactory(this, amount, true));\n\t },\n\t skipLast: function(amount) {\n\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\n\t },\n\t skipWhile: function(predicate, context) {\n\t return reify(this, skipWhileFactory(this, predicate, context, true));\n\t },\n\t skipUntil: function(predicate, context) {\n\t return this.skipWhile(not(predicate), context);\n\t },\n\t sortBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t return reify(this, new ArraySeq(this.entrySeq().entrySeq().toArray().sort((function(a, b) {\n\t return comparator(mapper(a[1][1], a[1][0], $__0), mapper(b[1][1], b[1][0], $__0)) || a[0] - b[0];\n\t }))).fromEntrySeq().valueSeq().fromEntrySeq());\n\t },\n\t take: function(amount) {\n\t return reify(this, takeFactory(this, amount));\n\t },\n\t takeLast: function(amount) {\n\t return reify(this, this.toSeq().reverse().take(amount).reverse());\n\t },\n\t takeWhile: function(predicate, context) {\n\t return reify(this, takeWhileFactory(this, predicate, context));\n\t },\n\t takeUntil: function(predicate, context) {\n\t return this.takeWhile(not(predicate), context);\n\t },\n\t valueSeq: function() {\n\t return this.toIndexedSeq();\n\t },\n\t hashCode: function() {\n\t return this.__hash || (this.__hash = this.size === Infinity ? 0 : this.reduce((function(h, v, k) {\n\t return (h + (hash(v) ^ (v === k ? 0 : hash(k)))) & HASH_MAX_VAL;\n\t }), 0));\n\t }\n\t}, {});\n\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n\tvar IterablePrototype = Iterable.prototype;\n\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\n\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n\tIterablePrototype.toJSON = IterablePrototype.toJS;\n\tIterablePrototype.__toJS = IterablePrototype.toArray;\n\tIterablePrototype.__toStringMapper = quoteString;\n\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\n\t return this.toString();\n\t};\n\tIterablePrototype.chain = IterablePrototype.flatMap;\n\t(function() {\n\t try {\n\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\n\t if (!Iterable.noLengthWarning) {\n\t var stack;\n\t try {\n\t throw new Error();\n\t } catch (error) {\n\t stack = error.stack;\n\t }\n\t if (stack.indexOf('_wrapObject') === -1) {\n\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\n\t return this.size;\n\t }\n\t }\n\t }});\n\t } catch (e) {}\n\t})();\n\tvar KeyedIterable = function KeyedIterable(value) {\n\t return isKeyed(value) ? value : KeyedSeq(value);\n\t};\n\t($traceurRuntime.createClass)(KeyedIterable, {\n\t flip: function() {\n\t return reify(this, flipFactory(this));\n\t },\n\t findKey: function(predicate, context) {\n\t var foundKey;\n\t this.__iterate((function(v, k, c) {\n\t if (predicate.call(context, v, k, c)) {\n\t foundKey = k;\n\t return false;\n\t }\n\t }));\n\t return foundKey;\n\t },\n\t findLastKey: function(predicate, context) {\n\t return this.toSeq().reverse().findKey(predicate, context);\n\t },\n\t keyOf: function(searchValue) {\n\t return this.findKey((function(value) {\n\t return is(value, searchValue);\n\t }));\n\t },\n\t lastKeyOf: function(searchValue) {\n\t return this.toSeq().reverse().keyOf(searchValue);\n\t },\n\t mapEntries: function(mapper, context) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t return reify(this, this.toSeq().map((function(v, k) {\n\t return mapper.call(context, [k, v], iterations++, $__0);\n\t })).fromEntrySeq());\n\t },\n\t mapKeys: function(mapper, context) {\n\t var $__0 = this;\n\t return reify(this, this.toSeq().flip().map((function(k, v) {\n\t return mapper.call(context, k, v, $__0);\n\t })).flip());\n\t }\n\t}, {}, Iterable);\n\tvar KeyedIterablePrototype = KeyedIterable.prototype;\n\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\n\t return k + ': ' + quoteString(v);\n\t});\n\tvar IndexedIterable = function IndexedIterable(value) {\n\t return isIndexed(value) ? value : IndexedSeq(value);\n\t};\n\t($traceurRuntime.createClass)(IndexedIterable, {\n\t toKeyedSeq: function() {\n\t return new ToKeyedSequence(this, false);\n\t },\n\t filter: function(predicate, context) {\n\t return reify(this, filterFactory(this, predicate, context, false));\n\t },\n\t findIndex: function(predicate, context) {\n\t var key = this.toKeyedSeq().findKey(predicate, context);\n\t return key === undefined ? -1 : key;\n\t },\n\t indexOf: function(searchValue) {\n\t var key = this.toKeyedSeq().keyOf(searchValue);\n\t return key === undefined ? -1 : key;\n\t },\n\t lastIndexOf: function(searchValue) {\n\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\n\t return key === undefined ? -1 : key;\n\t },\n\t reverse: function() {\n\t return reify(this, reverseFactory(this, false));\n\t },\n\t splice: function(index, removeNum) {\n\t var numArgs = arguments.length;\n\t removeNum = Math.max(removeNum | 0, 0);\n\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n\t return this;\n\t }\n\t index = resolveBegin(index, this.size);\n\t var spliced = this.slice(0, index);\n\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\n\t },\n\t findLastIndex: function(predicate, context) {\n\t var key = this.toKeyedSeq().findLastKey(predicate, context);\n\t return key === undefined ? -1 : key;\n\t },\n\t first: function() {\n\t return this.get(0);\n\t },\n\t flatten: function(depth) {\n\t return reify(this, flattenFactory(this, depth, false));\n\t },\n\t get: function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\n\t return key === index;\n\t }), undefined, notSetValue);\n\t },\n\t has: function(index) {\n\t index = wrapIndex(this, index);\n\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\n\t },\n\t interpose: function(separator) {\n\t return reify(this, interposeFactory(this, separator));\n\t },\n\t last: function() {\n\t return this.get(-1);\n\t },\n\t skip: function(amount) {\n\t var iter = this;\n\t var skipSeq = skipFactory(iter, amount, false);\n\t if (isSeq(iter) && skipSeq !== iter) {\n\t skipSeq.get = function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\n\t };\n\t }\n\t return reify(this, skipSeq);\n\t },\n\t skipWhile: function(predicate, context) {\n\t return reify(this, skipWhileFactory(this, predicate, context, false));\n\t },\n\t sortBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t return reify(this, new ArraySeq(this.entrySeq().toArray().sort((function(a, b) {\n\t return comparator(mapper(a[1], a[0], $__0), mapper(b[1], b[0], $__0)) || a[0] - b[0];\n\t }))).fromEntrySeq().valueSeq());\n\t },\n\t take: function(amount) {\n\t var iter = this;\n\t var takeSeq = takeFactory(iter, amount);\n\t if (isSeq(iter) && takeSeq !== iter) {\n\t takeSeq.get = function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\n\t };\n\t }\n\t return reify(this, takeSeq);\n\t }\n\t}, {}, Iterable);\n\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n\tvar SetIterable = function SetIterable(value) {\n\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n\t};\n\t($traceurRuntime.createClass)(SetIterable, {\n\t get: function(value, notSetValue) {\n\t return this.has(value) ? value : notSetValue;\n\t },\n\t contains: function(value) {\n\t return this.has(value);\n\t },\n\t keySeq: function() {\n\t return this.valueSeq();\n\t }\n\t}, {}, Iterable);\n\tSetIterable.prototype.has = IterablePrototype.contains;\n\tfunction isIterable(maybeIterable) {\n\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n\t}\n\tfunction isKeyed(maybeKeyed) {\n\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n\t}\n\tfunction isIndexed(maybeIndexed) {\n\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n\t}\n\tfunction isAssociative(maybeAssociative) {\n\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n\t}\n\tIterable.isIterable = isIterable;\n\tIterable.isKeyed = isKeyed;\n\tIterable.isIndexed = isIndexed;\n\tIterable.isAssociative = isAssociative;\n\tIterable.Keyed = KeyedIterable;\n\tIterable.Indexed = IndexedIterable;\n\tIterable.Set = SetIterable;\n\tIterable.Iterator = Iterator;\n\tfunction valueMapper(v) {\n\t return v;\n\t}\n\tfunction keyMapper(v, k) {\n\t return k;\n\t}\n\tfunction entryMapper(v, k) {\n\t return [k, v];\n\t}\n\tfunction not(predicate) {\n\t return function() {\n\t return !predicate.apply(this, arguments);\n\t };\n\t}\n\tfunction quoteString(value) {\n\t return typeof value === 'string' ? JSON.stringify(value) : value;\n\t}\n\tfunction defaultComparator(a, b) {\n\t return a > b ? 1 : a < b ? -1 : 0;\n\t}\n\tfunction mixin(ctor, methods) {\n\t var proto = ctor.prototype;\n\t var keyCopier = (function(key) {\n\t proto[key] = methods[key];\n\t });\n\t Object.keys(methods).forEach(keyCopier);\n\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n\t return ctor;\n\t}\n\tvar Seq = function Seq(value) {\n\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\n\t};\n\tvar $Seq = Seq;\n\t($traceurRuntime.createClass)(Seq, {\n\t toSeq: function() {\n\t return this;\n\t },\n\t toString: function() {\n\t return this.__toString('Seq {', '}');\n\t },\n\t cacheResult: function() {\n\t if (!this._cache && this.__iterateUncached) {\n\t this._cache = this.entrySeq().toArray();\n\t this.size = this._cache.length;\n\t }\n\t return this;\n\t },\n\t __iterate: function(fn, reverse) {\n\t return seqIterate(this, fn, reverse, true);\n\t },\n\t __iterator: function(type, reverse) {\n\t return seqIterator(this, type, reverse, true);\n\t }\n\t}, {of: function() {\n\t return $Seq(arguments);\n\t }}, Iterable);\n\tvar KeyedSeq = function KeyedSeq(value) {\n\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\n\t};\n\tvar $KeyedSeq = KeyedSeq;\n\t($traceurRuntime.createClass)(KeyedSeq, {\n\t toKeyedSeq: function() {\n\t return this;\n\t },\n\t toSeq: function() {\n\t return this;\n\t }\n\t}, {of: function() {\n\t return $KeyedSeq(arguments);\n\t }}, Seq);\n\tmixin(KeyedSeq, KeyedIterable.prototype);\n\tvar IndexedSeq = function IndexedSeq(value) {\n\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n\t};\n\tvar $IndexedSeq = IndexedSeq;\n\t($traceurRuntime.createClass)(IndexedSeq, {\n\t toIndexedSeq: function() {\n\t return this;\n\t },\n\t toString: function() {\n\t return this.__toString('Seq [', ']');\n\t },\n\t __iterate: function(fn, reverse) {\n\t return seqIterate(this, fn, reverse, false);\n\t },\n\t __iterator: function(type, reverse) {\n\t return seqIterator(this, type, reverse, false);\n\t }\n\t}, {of: function() {\n\t return $IndexedSeq(arguments);\n\t }}, Seq);\n\tmixin(IndexedSeq, IndexedIterable.prototype);\n\tvar SetSeq = function SetSeq(value) {\n\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\n\t};\n\tvar $SetSeq = SetSeq;\n\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\n\t return this;\n\t }}, {of: function() {\n\t return $SetSeq(arguments);\n\t }}, Seq);\n\tmixin(SetSeq, SetIterable.prototype);\n\tSeq.isSeq = isSeq;\n\tSeq.Keyed = KeyedSeq;\n\tSeq.Set = SetSeq;\n\tSeq.Indexed = IndexedSeq;\n\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\tSeq.prototype[IS_SEQ_SENTINEL] = true;\n\tvar ArraySeq = function ArraySeq(array) {\n\t this._array = array;\n\t this.size = array.length;\n\t};\n\t($traceurRuntime.createClass)(ArraySeq, {\n\t get: function(index, notSetValue) {\n\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n\t },\n\t __iterate: function(fn, reverse) {\n\t var array = this._array;\n\t var maxIndex = array.length - 1;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var array = this._array;\n\t var maxIndex = array.length - 1;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tvar ObjectSeq = function ObjectSeq(object) {\n\t var keys = Object.keys(object);\n\t this._object = object;\n\t this._keys = keys;\n\t this.size = keys.length;\n\t};\n\t($traceurRuntime.createClass)(ObjectSeq, {\n\t get: function(key, notSetValue) {\n\t if (notSetValue !== undefined && !this.has(key)) {\n\t return notSetValue;\n\t }\n\t return this._object[key];\n\t },\n\t has: function(key) {\n\t return this._object.hasOwnProperty(key);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var object = this._object;\n\t var keys = this._keys;\n\t var maxIndex = keys.length - 1;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t var key = keys[reverse ? maxIndex - ii : ii];\n\t if (fn(object[key], key, this) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var object = this._object;\n\t var keys = this._keys;\n\t var maxIndex = keys.length - 1;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t var key = keys[reverse ? maxIndex - ii : ii];\n\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\n\t }));\n\t }\n\t}, {}, KeyedSeq);\n\tvar IterableSeq = function IterableSeq(iterable) {\n\t this._iterable = iterable;\n\t this.size = iterable.length || iterable.size;\n\t};\n\t($traceurRuntime.createClass)(IterableSeq, {\n\t __iterateUncached: function(fn, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterable = this._iterable;\n\t var iterator = getIterator(iterable);\n\t var iterations = 0;\n\t if (isIterator(iterator)) {\n\t var step;\n\t while (!(step = iterator.next()).done) {\n\t if (fn(step.value, iterations++, this) === false) {\n\t break;\n\t }\n\t }\n\t }\n\t return iterations;\n\t },\n\t __iteratorUncached: function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterable = this._iterable;\n\t var iterator = getIterator(iterable);\n\t if (!isIterator(iterator)) {\n\t return new Iterator(iteratorDone);\n\t }\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, iterations++, step.value);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tvar IteratorSeq = function IteratorSeq(iterator) {\n\t this._iterator = iterator;\n\t this._iteratorCache = [];\n\t};\n\t($traceurRuntime.createClass)(IteratorSeq, {\n\t __iterateUncached: function(fn, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterator = this._iterator;\n\t var cache = this._iteratorCache;\n\t var iterations = 0;\n\t while (iterations < cache.length) {\n\t if (fn(cache[iterations], iterations++, this) === false) {\n\t return iterations;\n\t }\n\t }\n\t var step;\n\t while (!(step = iterator.next()).done) {\n\t var val = step.value;\n\t cache[iterations] = val;\n\t if (fn(val, iterations++, this) === false) {\n\t break;\n\t }\n\t }\n\t return iterations;\n\t },\n\t __iteratorUncached: function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = this._iterator;\n\t var cache = this._iteratorCache;\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t if (iterations >= cache.length) {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t cache[iterations] = step.value;\n\t }\n\t return iteratorValue(type, iterations, cache[iterations++]);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tfunction isSeq(maybeSeq) {\n\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n\t}\n\tvar EMPTY_SEQ;\n\tfunction emptySequence() {\n\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n\t}\n\tfunction keyedSeqFromValue(value) {\n\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\n\t if (!seq) {\n\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\n\t }\n\t return seq;\n\t}\n\tfunction indexedSeqFromValue(value) {\n\t var seq = maybeIndexedSeqFromValue(value);\n\t if (!seq) {\n\t throw new TypeError('Expected Array or iterable object of values: ' + value);\n\t }\n\t return seq;\n\t}\n\tfunction seqFromValue(value) {\n\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\n\t if (!seq) {\n\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\n\t }\n\t return seq;\n\t}\n\tfunction maybeIndexedSeqFromValue(value) {\n\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\n\t}\n\tfunction isArrayLike(value) {\n\t return value && typeof value.length === 'number';\n\t}\n\tfunction seqIterate(seq, fn, reverse, useKeys) {\n\t assertNotInfinite(seq.size);\n\t var cache = seq._cache;\n\t if (cache) {\n\t var maxIndex = cache.length - 1;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t }\n\t return seq.__iterateUncached(fn, reverse);\n\t}\n\tfunction seqIterator(seq, type, reverse, useKeys) {\n\t var cache = seq._cache;\n\t if (cache) {\n\t var maxIndex = cache.length - 1;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n\t }));\n\t }\n\t return seq.__iteratorUncached(type, reverse);\n\t}\n\tfunction fromJS(json, converter) {\n\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\n\t}\n\tfunction _fromJSWith(converter, json, key, parentJSON) {\n\t if (Array.isArray(json)) {\n\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\n\t return _fromJSWith(converter, v, k, json);\n\t })));\n\t }\n\t if (isPlainObj(json)) {\n\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\n\t return _fromJSWith(converter, v, k, json);\n\t })));\n\t }\n\t return json;\n\t}\n\tfunction _fromJSDefault(json) {\n\t if (Array.isArray(json)) {\n\t return IndexedSeq(json).map(_fromJSDefault).toList();\n\t }\n\t if (isPlainObj(json)) {\n\t return KeyedSeq(json).map(_fromJSDefault).toMap();\n\t }\n\t return json;\n\t}\n\tfunction isPlainObj(value) {\n\t return value && value.constructor === Object;\n\t}\n\tvar Collection = function Collection() {\n\t throw TypeError('Abstract');\n\t};\n\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\n\tvar KeyedCollection = function KeyedCollection() {\n\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\n\t};\n\tvar $KeyedCollection = KeyedCollection;\n\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\n\tmixin(KeyedCollection, KeyedIterable.prototype);\n\tvar IndexedCollection = function IndexedCollection() {\n\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\n\t};\n\tvar $IndexedCollection = IndexedCollection;\n\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\n\tmixin(IndexedCollection, IndexedIterable.prototype);\n\tvar SetCollection = function SetCollection() {\n\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\n\t};\n\tvar $SetCollection = SetCollection;\n\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\n\tmixin(SetCollection, SetIterable.prototype);\n\tCollection.Keyed = KeyedCollection;\n\tCollection.Indexed = IndexedCollection;\n\tCollection.Set = SetCollection;\n\tvar Map = function Map(value) {\n\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().merge(KeyedIterable(value));\n\t};\n\t($traceurRuntime.createClass)(Map, {\n\t toString: function() {\n\t return this.__toString('Map {', '}');\n\t },\n\t get: function(k, notSetValue) {\n\t return this._root ? this._root.get(0, hash(k), k, notSetValue) : notSetValue;\n\t },\n\t set: function(k, v) {\n\t return updateMap(this, k, v);\n\t },\n\t setIn: function(keyPath, v) {\n\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\n\t return this.updateIn(keyPath, (function() {\n\t return v;\n\t }));\n\t },\n\t remove: function(k) {\n\t return updateMap(this, k, NOT_SET);\n\t },\n\t removeIn: function(keyPath) {\n\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\n\t return this.updateIn(keyPath, (function() {\n\t return NOT_SET;\n\t }));\n\t },\n\t update: function(k, notSetValue, updater) {\n\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\n\t },\n\t updateIn: function(keyPath, notSetValue, updater) {\n\t if (!updater) {\n\t updater = notSetValue;\n\t notSetValue = undefined;\n\t }\n\t return keyPath.length === 0 ? updater(this) : updateInDeepMap(this, keyPath, notSetValue, updater, 0);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._root = null;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return emptyMap();\n\t },\n\t merge: function() {\n\t return mergeIntoMapWith(this, undefined, arguments);\n\t },\n\t mergeWith: function(merger) {\n\t for (var iters = [],\n\t $__3 = 1; $__3 < arguments.length; $__3++)\n\t iters[$__3 - 1] = arguments[$__3];\n\t return mergeIntoMapWith(this, merger, iters);\n\t },\n\t mergeDeep: function() {\n\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\n\t },\n\t mergeDeepWith: function(merger) {\n\t for (var iters = [],\n\t $__4 = 1; $__4 < arguments.length; $__4++)\n\t iters[$__4 - 1] = arguments[$__4];\n\t return mergeIntoMapWith(this, deepMerger(merger), iters);\n\t },\n\t withMutations: function(fn) {\n\t var mutable = this.asMutable();\n\t fn(mutable);\n\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n\t },\n\t asMutable: function() {\n\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n\t },\n\t asImmutable: function() {\n\t return this.__ensureOwner();\n\t },\n\t wasAltered: function() {\n\t return this.__altered;\n\t },\n\t __iterator: function(type, reverse) {\n\t return new MapIterator(this, type, reverse);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t this._root && this._root.iterate((function(entry) {\n\t iterations++;\n\t return fn(entry[1], entry[0], $__0);\n\t }), reverse);\n\t return iterations;\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this.__altered = false;\n\t return this;\n\t }\n\t return makeMap(this.size, this._root, ownerID, this.__hash);\n\t }\n\t}, {}, KeyedCollection);\n\tfunction isMap(maybeMap) {\n\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n\t}\n\tMap.isMap = isMap;\n\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\tvar MapPrototype = Map.prototype;\n\tMapPrototype[IS_MAP_SENTINEL] = true;\n\tMapPrototype[DELETE] = MapPrototype.remove;\n\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\n\t this.ownerID = ownerID;\n\t this.bitmap = bitmap;\n\t this.nodes = nodes;\n\t};\n\tvar $BitmapIndexedNode = BitmapIndexedNode;\n\t($traceurRuntime.createClass)(BitmapIndexedNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t var bit = (1 << ((shift === 0 ? hash : hash >>> shift) & MASK));\n\t var bitmap = this.bitmap;\n\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, hash, key, notSetValue);\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var hashFrag = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var bit = 1 << hashFrag;\n\t var bitmap = this.bitmap;\n\t var exists = (bitmap & bit) !== 0;\n\t if (!exists && value === NOT_SET) {\n\t return this;\n\t }\n\t var idx = popCount(bitmap & (bit - 1));\n\t var nodes = this.nodes;\n\t var node = exists ? nodes[idx] : undefined;\n\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\n\t if (newNode === node) {\n\t return this;\n\t }\n\t if (!exists && newNode && nodes.length >= MAX_BITMAP_SIZE) {\n\t return expandNodes(ownerID, nodes, bitmap, hashFrag, newNode);\n\t }\n\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n\t return nodes[idx ^ 1];\n\t }\n\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n\t return newNode;\n\t }\n\t var isEditable = ownerID && ownerID === this.ownerID;\n\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\n\t if (isEditable) {\n\t this.bitmap = newBitmap;\n\t this.nodes = newNodes;\n\t return this;\n\t }\n\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\n\t },\n\t iterate: function(fn, reverse) {\n\t var nodes = this.nodes;\n\t for (var ii = 0,\n\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n\t if (nodes[reverse ? maxIndex - ii : ii].iterate(fn, reverse) === false) {\n\t return false;\n\t }\n\t }\n\t }\n\t}, {});\n\tvar ArrayNode = function ArrayNode(ownerID, count, nodes) {\n\t this.ownerID = ownerID;\n\t this.count = count;\n\t this.nodes = nodes;\n\t};\n\tvar $ArrayNode = ArrayNode;\n\t($traceurRuntime.createClass)(ArrayNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var node = this.nodes[idx];\n\t return node ? node.get(shift + SHIFT, hash, key, notSetValue) : notSetValue;\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var removed = value === NOT_SET;\n\t var nodes = this.nodes;\n\t var node = nodes[idx];\n\t if (removed && !node) {\n\t return this;\n\t }\n\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\n\t if (newNode === node) {\n\t return this;\n\t }\n\t var newCount = this.count;\n\t if (!node) {\n\t newCount++;\n\t } else if (!newNode) {\n\t newCount--;\n\t if (newCount < MIN_ARRAY_SIZE) {\n\t return packNodes(ownerID, nodes, newCount, idx);\n\t }\n\t }\n\t var isEditable = ownerID && ownerID === this.ownerID;\n\t var newNodes = setIn(nodes, idx, newNode, isEditable);\n\t if (isEditable) {\n\t this.count = newCount;\n\t this.nodes = newNodes;\n\t return this;\n\t }\n\t return new $ArrayNode(ownerID, newCount, newNodes);\n\t },\n\t iterate: function(fn, reverse) {\n\t var nodes = this.nodes;\n\t for (var ii = 0,\n\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n\t var node = nodes[reverse ? maxIndex - ii : ii];\n\t if (node && node.iterate(fn, reverse) === false) {\n\t return false;\n\t }\n\t }\n\t }\n\t}, {});\n\tvar HashCollisionNode = function HashCollisionNode(ownerID, hash, entries) {\n\t this.ownerID = ownerID;\n\t this.hash = hash;\n\t this.entries = entries;\n\t};\n\tvar $HashCollisionNode = HashCollisionNode;\n\t($traceurRuntime.createClass)(HashCollisionNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t var entries = this.entries;\n\t for (var ii = 0,\n\t len = entries.length; ii < len; ii++) {\n\t if (is(key, entries[ii][0])) {\n\t return entries[ii][1];\n\t }\n\t }\n\t return notSetValue;\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var removed = value === NOT_SET;\n\t if (hash !== this.hash) {\n\t if (removed) {\n\t return this;\n\t }\n\t SetRef(didAlter);\n\t SetRef(didChangeSize);\n\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\n\t }\n\t var entries = this.entries;\n\t var idx = 0;\n\t for (var len = entries.length; idx < len; idx++) {\n\t if (is(key, entries[idx][0])) {\n\t break;\n\t }\n\t }\n\t var exists = idx < len;\n\t if (removed && !exists) {\n\t return this;\n\t }\n\t SetRef(didAlter);\n\t (removed || !exists) && SetRef(didChangeSize);\n\t if (removed && len === 2) {\n\t return new ValueNode(ownerID, this.hash, entries[idx ^ 1]);\n\t }\n\t var isEditable = ownerID && ownerID === this.ownerID;\n\t var newEntries = isEditable ? entries : arrCopy(entries);\n\t if (exists) {\n\t if (removed) {\n\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n\t } else {\n\t newEntries[idx] = [key, value];\n\t }\n\t } else {\n\t newEntries.push([key, value]);\n\t }\n\t if (isEditable) {\n\t this.entries = newEntries;\n\t return this;\n\t }\n\t return new $HashCollisionNode(ownerID, this.hash, newEntries);\n\t },\n\t iterate: function(fn, reverse) {\n\t var entries = this.entries;\n\t for (var ii = 0,\n\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n\t return false;\n\t }\n\t }\n\t }\n\t}, {});\n\tvar ValueNode = function ValueNode(ownerID, hash, entry) {\n\t this.ownerID = ownerID;\n\t this.hash = hash;\n\t this.entry = entry;\n\t};\n\tvar $ValueNode = ValueNode;\n\t($traceurRuntime.createClass)(ValueNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var removed = value === NOT_SET;\n\t var keyMatch = is(key, this.entry[0]);\n\t if (keyMatch ? value === this.entry[1] : removed) {\n\t return this;\n\t }\n\t SetRef(didAlter);\n\t if (removed) {\n\t SetRef(didChangeSize);\n\t return;\n\t }\n\t if (keyMatch) {\n\t if (ownerID && ownerID === this.ownerID) {\n\t this.entry[1] = value;\n\t return this;\n\t }\n\t return new $ValueNode(ownerID, hash, [key, value]);\n\t }\n\t SetRef(didChangeSize);\n\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\n\t },\n\t iterate: function(fn) {\n\t return fn(this.entry);\n\t }\n\t}, {});\n\tvar MapIterator = function MapIterator(map, type, reverse) {\n\t this._type = type;\n\t this._reverse = reverse;\n\t this._stack = map._root && mapIteratorFrame(map._root);\n\t};\n\t($traceurRuntime.createClass)(MapIterator, {next: function() {\n\t var type = this._type;\n\t var stack = this._stack;\n\t while (stack) {\n\t var node = stack.node;\n\t var index = stack.index++;\n\t var maxIndex;\n\t if (node.entry) {\n\t if (index === 0) {\n\t return mapIteratorValue(type, node.entry);\n\t }\n\t } else if (node.entries) {\n\t maxIndex = node.entries.length - 1;\n\t if (index <= maxIndex) {\n\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n\t }\n\t } else {\n\t maxIndex = node.nodes.length - 1;\n\t if (index <= maxIndex) {\n\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n\t if (subNode) {\n\t if (subNode.entry) {\n\t return mapIteratorValue(type, subNode.entry);\n\t }\n\t stack = this._stack = mapIteratorFrame(subNode, stack);\n\t }\n\t continue;\n\t }\n\t }\n\t stack = this._stack = this._stack.__prev;\n\t }\n\t return iteratorDone();\n\t }}, {}, Iterator);\n\tfunction mapIteratorValue(type, entry) {\n\t return iteratorValue(type, entry[0], entry[1]);\n\t}\n\tfunction mapIteratorFrame(node, prev) {\n\t return {\n\t node: node,\n\t index: 0,\n\t __prev: prev\n\t };\n\t}\n\tfunction makeMap(size, root, ownerID, hash) {\n\t var map = Object.create(MapPrototype);\n\t map.size = size;\n\t map._root = root;\n\t map.__ownerID = ownerID;\n\t map.__hash = hash;\n\t map.__altered = false;\n\t return map;\n\t}\n\tvar EMPTY_MAP;\n\tfunction emptyMap() {\n\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n\t}\n\tfunction updateMap(map, k, v) {\n\t var didChangeSize = MakeRef(CHANGE_LENGTH);\n\t var didAlter = MakeRef(DID_ALTER);\n\t var newRoot = updateNode(map._root, map.__ownerID, 0, hash(k), k, v, didChangeSize, didAlter);\n\t if (!didAlter.value) {\n\t return map;\n\t }\n\t var newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n\t if (map.__ownerID) {\n\t map.size = newSize;\n\t map._root = newRoot;\n\t map.__hash = undefined;\n\t map.__altered = true;\n\t return map;\n\t }\n\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n\t}\n\tfunction updateNode(node, ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t if (!node) {\n\t if (value === NOT_SET) {\n\t return node;\n\t }\n\t SetRef(didAlter);\n\t SetRef(didChangeSize);\n\t return new ValueNode(ownerID, hash, [key, value]);\n\t }\n\t return node.update(ownerID, shift, hash, key, value, didChangeSize, didAlter);\n\t}\n\tfunction isLeafNode(node) {\n\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n\t}\n\tfunction mergeIntoNode(node, ownerID, shift, hash, entry) {\n\t if (node.hash === hash) {\n\t return new HashCollisionNode(ownerID, hash, [node.entry, entry]);\n\t }\n\t var idx1 = (shift === 0 ? node.hash : node.hash >>> shift) & MASK;\n\t var idx2 = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var newNode;\n\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, hash, entry)] : ((newNode = new ValueNode(ownerID, hash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n\t}\n\tfunction packNodes(ownerID, nodes, count, excluding) {\n\t var bitmap = 0;\n\t var packedII = 0;\n\t var packedNodes = new Array(count);\n\t for (var ii = 0,\n\t bit = 1,\n\t len = nodes.length; ii < len; ii++, bit <<= 1) {\n\t var node = nodes[ii];\n\t if (node !== undefined && ii !== excluding) {\n\t bitmap |= bit;\n\t packedNodes[packedII++] = node;\n\t }\n\t }\n\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n\t}\n\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\n\t var count = 0;\n\t var expandedNodes = new Array(SIZE);\n\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n\t }\n\t expandedNodes[including] = node;\n\t return new ArrayNode(ownerID, count + 1, expandedNodes);\n\t}\n\tfunction mergeIntoMapWith(map, merger, iterables) {\n\t var iters = [];\n\t for (var ii = 0; ii < iterables.length; ii++) {\n\t var value = iterables[ii];\n\t var iter = KeyedIterable(value);\n\t if (!isIterable(value)) {\n\t iter = iter.map((function(v) {\n\t return fromJS(v);\n\t }));\n\t }\n\t iters.push(iter);\n\t }\n\t return mergeIntoCollectionWith(map, merger, iters);\n\t}\n\tfunction deepMerger(merger) {\n\t return (function(existing, value) {\n\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\n\t });\n\t}\n\tfunction mergeIntoCollectionWith(collection, merger, iters) {\n\t if (iters.length === 0) {\n\t return collection;\n\t }\n\t return collection.withMutations((function(collection) {\n\t var mergeIntoMap = merger ? (function(value, key) {\n\t collection.update(key, NOT_SET, (function(existing) {\n\t return existing === NOT_SET ? value : merger(existing, value);\n\t }));\n\t }) : (function(value, key) {\n\t collection.set(key, value);\n\t });\n\t for (var ii = 0; ii < iters.length; ii++) {\n\t iters[ii].forEach(mergeIntoMap);\n\t }\n\t }));\n\t}\n\tfunction updateInDeepMap(collection, keyPath, notSetValue, updater, offset) {\n\t invariant(!collection || collection.set, 'updateIn with invalid keyPath');\n\t var key = keyPath[offset];\n\t var existing = collection ? collection.get(key, NOT_SET) : NOT_SET;\n\t var existingValue = existing === NOT_SET ? undefined : existing;\n\t var value = offset === keyPath.length - 1 ? updater(existing === NOT_SET ? notSetValue : existing) : updateInDeepMap(existingValue, keyPath, notSetValue, updater, offset + 1);\n\t return value === existingValue ? collection : value === NOT_SET ? collection && collection.remove(key) : (collection || emptyMap()).set(key, value);\n\t}\n\tfunction popCount(x) {\n\t x = x - ((x >> 1) & 0x55555555);\n\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n\t x = (x + (x >> 4)) & 0x0f0f0f0f;\n\t x = x + (x >> 8);\n\t x = x + (x >> 16);\n\t return x & 0x7f;\n\t}\n\tfunction setIn(array, idx, val, canEdit) {\n\t var newArray = canEdit ? array : arrCopy(array);\n\t newArray[idx] = val;\n\t return newArray;\n\t}\n\tfunction spliceIn(array, idx, val, canEdit) {\n\t var newLen = array.length + 1;\n\t if (canEdit && idx + 1 === newLen) {\n\t array[idx] = val;\n\t return array;\n\t }\n\t var newArray = new Array(newLen);\n\t var after = 0;\n\t for (var ii = 0; ii < newLen; ii++) {\n\t if (ii === idx) {\n\t newArray[ii] = val;\n\t after = -1;\n\t } else {\n\t newArray[ii] = array[ii + after];\n\t }\n\t }\n\t return newArray;\n\t}\n\tfunction spliceOut(array, idx, canEdit) {\n\t var newLen = array.length - 1;\n\t if (canEdit && idx === newLen) {\n\t array.pop();\n\t return array;\n\t }\n\t var newArray = new Array(newLen);\n\t var after = 0;\n\t for (var ii = 0; ii < newLen; ii++) {\n\t if (ii === idx) {\n\t after = 1;\n\t }\n\t newArray[ii] = array[ii + after];\n\t }\n\t return newArray;\n\t}\n\tvar MAX_BITMAP_SIZE = SIZE / 2;\n\tvar MIN_ARRAY_SIZE = SIZE / 4;\n\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\n\t this._iter = indexed;\n\t this._useKeys = useKeys;\n\t this.size = indexed.size;\n\t};\n\t($traceurRuntime.createClass)(ToKeyedSequence, {\n\t get: function(key, notSetValue) {\n\t return this._iter.get(key, notSetValue);\n\t },\n\t has: function(key) {\n\t return this._iter.has(key);\n\t },\n\t valueSeq: function() {\n\t return this._iter.valueSeq();\n\t },\n\t reverse: function() {\n\t var $__0 = this;\n\t var reversedSequence = reverseFactory(this, true);\n\t if (!this._useKeys) {\n\t reversedSequence.valueSeq = (function() {\n\t return $__0._iter.toSeq().reverse();\n\t });\n\t }\n\t return reversedSequence;\n\t },\n\t map: function(mapper, context) {\n\t var $__0 = this;\n\t var mappedSequence = mapFactory(this, mapper, context);\n\t if (!this._useKeys) {\n\t mappedSequence.valueSeq = (function() {\n\t return $__0._iter.toSeq().map(mapper, context);\n\t });\n\t }\n\t return mappedSequence;\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var ii;\n\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\n\t return fn(v, k, $__0);\n\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\n\t return fn(v, reverse ? --ii : ii++, $__0);\n\t })), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t if (this._useKeys) {\n\t return this._iter.__iterator(type, reverse);\n\t }\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t var ii = reverse ? resolveSize(this) : 0;\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n\t }));\n\t }\n\t}, {}, KeyedSeq);\n\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\n\t this._iter = iter;\n\t this.size = iter.size;\n\t};\n\t($traceurRuntime.createClass)(ToIndexedSequence, {\n\t contains: function(value) {\n\t return this._iter.contains(value);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t return this._iter.__iterate((function(v) {\n\t return fn(v, iterations++, $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tvar ToSetSequence = function ToSetSequence(iter) {\n\t this._iter = iter;\n\t this.size = iter.size;\n\t};\n\t($traceurRuntime.createClass)(ToSetSequence, {\n\t has: function(key) {\n\t return this._iter.contains(key);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._iter.__iterate((function(v) {\n\t return fn(v, v, $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\n\t }));\n\t }\n\t}, {}, SetSeq);\n\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\n\t this._iter = entries;\n\t this.size = entries.size;\n\t};\n\t($traceurRuntime.createClass)(FromEntriesSequence, {\n\t entrySeq: function() {\n\t return this._iter.toSeq();\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._iter.__iterate((function(entry) {\n\t if (entry) {\n\t validateEntry(entry);\n\t return fn(entry[1], entry[0], $__0);\n\t }\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t return new Iterator((function() {\n\t while (true) {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t if (entry) {\n\t validateEntry(entry);\n\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\n\t }\n\t }\n\t }));\n\t }\n\t}, {}, KeyedSeq);\n\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\n\tfunction flipFactory(iterable) {\n\t var flipSequence = makeSequence(iterable);\n\t flipSequence._iter = iterable;\n\t flipSequence.size = iterable.size;\n\t flipSequence.flip = (function() {\n\t return iterable;\n\t });\n\t flipSequence.reverse = function() {\n\t var reversedSequence = iterable.reverse.apply(this);\n\t reversedSequence.flip = (function() {\n\t return iterable.reverse();\n\t });\n\t return reversedSequence;\n\t };\n\t flipSequence.has = (function(key) {\n\t return iterable.contains(key);\n\t });\n\t flipSequence.contains = (function(key) {\n\t return iterable.has(key);\n\t });\n\t flipSequence.cacheResult = cacheResultThrough;\n\t flipSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t return iterable.__iterate((function(v, k) {\n\t return fn(k, v, $__0) !== false;\n\t }), reverse);\n\t };\n\t flipSequence.__iteratorUncached = function(type, reverse) {\n\t if (type === ITERATE_ENTRIES) {\n\t var iterator = iterable.__iterator(type, reverse);\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t if (!step.done) {\n\t var k = step.value[0];\n\t step.value[0] = step.value[1];\n\t step.value[1] = k;\n\t }\n\t return step;\n\t }));\n\t }\n\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\n\t };\n\t return flipSequence;\n\t}\n\tfunction mapFactory(iterable, mapper, context) {\n\t var mappedSequence = makeSequence(iterable);\n\t mappedSequence.size = iterable.size;\n\t mappedSequence.has = (function(key) {\n\t return iterable.has(key);\n\t });\n\t mappedSequence.get = (function(key, notSetValue) {\n\t var v = iterable.get(key, NOT_SET);\n\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\n\t });\n\t mappedSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t return iterable.__iterate((function(v, k, c) {\n\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\n\t }), reverse);\n\t };\n\t mappedSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t var key = entry[0];\n\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\n\t }));\n\t };\n\t return mappedSequence;\n\t}\n\tfunction reverseFactory(iterable, useKeys) {\n\t var reversedSequence = makeSequence(iterable);\n\t reversedSequence._iter = iterable;\n\t reversedSequence.size = iterable.size;\n\t reversedSequence.reverse = (function() {\n\t return iterable;\n\t });\n\t if (iterable.flip) {\n\t reversedSequence.flip = function() {\n\t var flipSequence = flipFactory(iterable);\n\t flipSequence.reverse = (function() {\n\t return iterable.flip();\n\t });\n\t return flipSequence;\n\t };\n\t }\n\t reversedSequence.get = (function(key, notSetValue) {\n\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\n\t });\n\t reversedSequence.has = (function(key) {\n\t return iterable.has(useKeys ? key : -1 - key);\n\t });\n\t reversedSequence.contains = (function(value) {\n\t return iterable.contains(value);\n\t });\n\t reversedSequence.cacheResult = cacheResultThrough;\n\t reversedSequence.__iterate = function(fn, reverse) {\n\t var $__0 = this;\n\t return iterable.__iterate((function(v, k) {\n\t return fn(v, k, $__0);\n\t }), !reverse);\n\t };\n\t reversedSequence.__iterator = (function(type, reverse) {\n\t return iterable.__iterator(type, !reverse);\n\t });\n\t return reversedSequence;\n\t}\n\tfunction filterFactory(iterable, predicate, context, useKeys) {\n\t var filterSequence = makeSequence(iterable);\n\t if (useKeys) {\n\t filterSequence.has = (function(key) {\n\t var v = iterable.get(key, NOT_SET);\n\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n\t });\n\t filterSequence.get = (function(key, notSetValue) {\n\t var v = iterable.get(key, NOT_SET);\n\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\n\t });\n\t }\n\t filterSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k, c) {\n\t if (predicate.call(context, v, k, c)) {\n\t iterations++;\n\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t }\n\t }), reverse);\n\t return iterations;\n\t };\n\t filterSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t while (true) {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t var key = entry[0];\n\t var value = entry[1];\n\t if (predicate.call(context, value, key, iterable)) {\n\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\n\t }\n\t }\n\t }));\n\t };\n\t return filterSequence;\n\t}\n\tfunction countByFactory(iterable, grouper, context) {\n\t var groups = Map().asMutable();\n\t iterable.__iterate((function(v, k) {\n\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\n\t return a + 1;\n\t }));\n\t }));\n\t return groups.asImmutable();\n\t}\n\tfunction groupByFactory(iterable, grouper, context) {\n\t var isKeyedIter = isKeyed(iterable);\n\t var groups = Map().asMutable();\n\t iterable.__iterate((function(v, k) {\n\t groups.update(grouper.call(context, v, k, iterable), [], (function(a) {\n\t return (a.push(isKeyedIter ? [k, v] : v), a);\n\t }));\n\t }));\n\t var coerce = iterableClass(iterable);\n\t return groups.map((function(arr) {\n\t return reify(iterable, coerce(arr));\n\t }));\n\t}\n\tfunction takeFactory(iterable, amount) {\n\t if (amount > iterable.size) {\n\t return iterable;\n\t }\n\t if (amount < 0) {\n\t amount = 0;\n\t }\n\t var takeSequence = makeSequence(iterable);\n\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\n\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (amount === 0) {\n\t return 0;\n\t }\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k) {\n\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\n\t }));\n\t return iterations;\n\t };\n\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = amount && iterable.__iterator(type, reverse);\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t if (iterations++ > amount) {\n\t return iteratorDone();\n\t }\n\t return iterator.next();\n\t }));\n\t };\n\t return takeSequence;\n\t}\n\tfunction takeWhileFactory(iterable, predicate, context) {\n\t var takeSequence = makeSequence(iterable);\n\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k, c) {\n\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\n\t }));\n\t return iterations;\n\t };\n\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t var iterating = true;\n\t return new Iterator((function() {\n\t if (!iterating) {\n\t return iteratorDone();\n\t }\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t var k = entry[0];\n\t var v = entry[1];\n\t if (!predicate.call(context, v, k, $__0)) {\n\t iterating = false;\n\t return iteratorDone();\n\t }\n\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t }));\n\t };\n\t return takeSequence;\n\t}\n\tfunction skipFactory(iterable, amount, useKeys) {\n\t if (amount <= 0) {\n\t return iterable;\n\t }\n\t var skipSequence = makeSequence(iterable);\n\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\n\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var skipped = 0;\n\t var isSkipping = true;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k) {\n\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\n\t iterations++;\n\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t }\n\t }));\n\t return iterations;\n\t };\n\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = amount && iterable.__iterator(type, reverse);\n\t var skipped = 0;\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t while (skipped < amount) {\n\t skipped++;\n\t iterator.next();\n\t }\n\t var step = iterator.next();\n\t if (useKeys || type === ITERATE_VALUES) {\n\t return step;\n\t } else if (type === ITERATE_KEYS) {\n\t return iteratorValue(type, iterations++, undefined, step);\n\t } else {\n\t return iteratorValue(type, iterations++, step.value[1], step);\n\t }\n\t }));\n\t };\n\t return skipSequence;\n\t}\n\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\n\t var skipSequence = makeSequence(iterable);\n\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var isSkipping = true;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k, c) {\n\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n\t iterations++;\n\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t }\n\t }));\n\t return iterations;\n\t };\n\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t var skipping = true;\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t var step,\n\t k,\n\t v;\n\t do {\n\t step = iterator.next();\n\t if (step.done) {\n\t if (useKeys || type === ITERATE_VALUES) {\n\t return step;\n\t } else if (type === ITERATE_KEYS) {\n\t return iteratorValue(type, iterations++, undefined, step);\n\t } else {\n\t return iteratorValue(type, iterations++, step.value[1], step);\n\t }\n\t }\n\t var entry = step.value;\n\t k = entry[0];\n\t v = entry[1];\n\t skipping && (skipping = predicate.call(context, v, k, $__0));\n\t } while (skipping);\n\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t }));\n\t };\n\t return skipSequence;\n\t}\n\tfunction concatFactory(iterable, values) {\n\t var isKeyedIterable = isKeyed(iterable);\n\t var iters = new ArraySeq([iterable].concat(values)).map((function(v) {\n\t if (!isIterable(v)) {\n\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n\t } else if (isKeyedIterable) {\n\t v = KeyedIterable(v);\n\t }\n\t return v;\n\t }));\n\t if (isKeyedIterable) {\n\t iters = iters.toKeyedSeq();\n\t } else if (!isIndexed(iterable)) {\n\t iters = iters.toSetSeq();\n\t }\n\t var flat = iters.flatten(true);\n\t flat.size = iters.reduce((function(sum, seq) {\n\t if (sum !== undefined) {\n\t var size = seq.size;\n\t if (size !== undefined) {\n\t return sum + size;\n\t }\n\t }\n\t }), 0);\n\t return flat;\n\t}\n\tfunction flattenFactory(iterable, depth, useKeys) {\n\t var flatSequence = makeSequence(iterable);\n\t flatSequence.__iterateUncached = function(fn, reverse) {\n\t var iterations = 0;\n\t var stopped = false;\n\t function flatDeep(iter, currentDepth) {\n\t var $__0 = this;\n\t iter.__iterate((function(v, k) {\n\t if ((!depth || currentDepth < depth) && isIterable(v)) {\n\t flatDeep(v, currentDepth + 1);\n\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\n\t stopped = true;\n\t }\n\t return !stopped;\n\t }), reverse);\n\t }\n\t flatDeep(iterable, 0);\n\t return iterations;\n\t };\n\t flatSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(type, reverse);\n\t var stack = [];\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t while (iterator) {\n\t var step = iterator.next();\n\t if (step.done !== false) {\n\t iterator = stack.pop();\n\t continue;\n\t }\n\t var v = step.value;\n\t if (type === ITERATE_ENTRIES) {\n\t v = v[1];\n\t }\n\t if ((!depth || stack.length < depth) && isIterable(v)) {\n\t stack.push(iterator);\n\t iterator = v.__iterator(type, reverse);\n\t } else {\n\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\n\t }\n\t }\n\t return iteratorDone();\n\t }));\n\t };\n\t return flatSequence;\n\t}\n\tfunction flatMapFactory(iterable, mapper, context) {\n\t var coerce = iterableClass(iterable);\n\t return iterable.toSeq().map((function(v, k) {\n\t return coerce(mapper.call(context, v, k, iterable));\n\t })).flatten(true);\n\t}\n\tfunction interposeFactory(iterable, separator) {\n\t var interposedSequence = makeSequence(iterable);\n\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\n\t interposedSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k) {\n\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\n\t }), reverse);\n\t return iterations;\n\t };\n\t interposedSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n\t var iterations = 0;\n\t var step;\n\t return new Iterator((function() {\n\t if (!step || iterations % 2) {\n\t step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t }\n\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\n\t }));\n\t };\n\t return interposedSequence;\n\t}\n\tfunction reify(iter, seq) {\n\t return isSeq(iter) ? seq : iter.constructor(seq);\n\t}\n\tfunction validateEntry(entry) {\n\t if (entry !== Object(entry)) {\n\t throw new TypeError('Expected [K, V] tuple: ' + entry);\n\t }\n\t}\n\tfunction resolveSize(iter) {\n\t assertNotInfinite(iter.size);\n\t return ensureSize(iter);\n\t}\n\tfunction iterableClass(iterable) {\n\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\n\t}\n\tfunction makeSequence(iterable) {\n\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\n\t}\n\tfunction cacheResultThrough() {\n\t if (this._iter.cacheResult) {\n\t this._iter.cacheResult();\n\t this.size = this._iter.size;\n\t return this;\n\t } else {\n\t return Seq.prototype.cacheResult.call(this);\n\t }\n\t}\n\tvar List = function List(value) {\n\t var empty = emptyList();\n\t if (value === null || value === undefined) {\n\t return empty;\n\t }\n\t if (isList(value)) {\n\t return value;\n\t }\n\t value = IndexedIterable(value);\n\t var size = value.size;\n\t if (size === 0) {\n\t return empty;\n\t }\n\t if (size > 0 && size < SIZE) {\n\t return makeList(0, size, SHIFT, null, new VNode(value.toArray()));\n\t }\n\t return empty.merge(value);\n\t};\n\t($traceurRuntime.createClass)(List, {\n\t toString: function() {\n\t return this.__toString('List [', ']');\n\t },\n\t get: function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t if (index < 0 || index >= this.size) {\n\t return notSetValue;\n\t }\n\t index += this._origin;\n\t var node = listNodeFor(this, index);\n\t return node && node.array[index & MASK];\n\t },\n\t set: function(index, value) {\n\t return updateList(this, index, value);\n\t },\n\t remove: function(index) {\n\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = this._origin = this._capacity = 0;\n\t this._level = SHIFT;\n\t this._root = this._tail = null;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return emptyList();\n\t },\n\t push: function() {\n\t var values = arguments;\n\t var oldSize = this.size;\n\t return this.withMutations((function(list) {\n\t setListBounds(list, 0, oldSize + values.length);\n\t for (var ii = 0; ii < values.length; ii++) {\n\t list.set(oldSize + ii, values[ii]);\n\t }\n\t }));\n\t },\n\t pop: function() {\n\t return setListBounds(this, 0, -1);\n\t },\n\t unshift: function() {\n\t var values = arguments;\n\t return this.withMutations((function(list) {\n\t setListBounds(list, -values.length);\n\t for (var ii = 0; ii < values.length; ii++) {\n\t list.set(ii, values[ii]);\n\t }\n\t }));\n\t },\n\t shift: function() {\n\t return setListBounds(this, 1);\n\t },\n\t merge: function() {\n\t return mergeIntoListWith(this, undefined, arguments);\n\t },\n\t mergeWith: function(merger) {\n\t for (var iters = [],\n\t $__5 = 1; $__5 < arguments.length; $__5++)\n\t iters[$__5 - 1] = arguments[$__5];\n\t return mergeIntoListWith(this, merger, iters);\n\t },\n\t mergeDeep: function() {\n\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\n\t },\n\t mergeDeepWith: function(merger) {\n\t for (var iters = [],\n\t $__6 = 1; $__6 < arguments.length; $__6++)\n\t iters[$__6 - 1] = arguments[$__6];\n\t return mergeIntoListWith(this, deepMerger(merger), iters);\n\t },\n\t setSize: function(size) {\n\t return setListBounds(this, 0, size);\n\t },\n\t slice: function(begin, end) {\n\t var size = this.size;\n\t if (wholeSlice(begin, end, size)) {\n\t return this;\n\t }\n\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\n\t },\n\t __iterator: function(type, reverse) {\n\t return new ListIterator(this, type, reverse);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t var eachFn = (function(v) {\n\t return fn(v, iterations++, $__0);\n\t });\n\t var tailOffset = getTailOffset(this._capacity);\n\t if (reverse) {\n\t iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse) && iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse);\n\t } else {\n\t iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse) && iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse);\n\t }\n\t return iterations;\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t return this;\n\t }\n\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n\t }\n\t}, {of: function() {\n\t return this(arguments);\n\t }}, IndexedCollection);\n\tfunction isList(maybeList) {\n\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n\t}\n\tList.isList = isList;\n\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\tvar ListPrototype = List.prototype;\n\tListPrototype[IS_LIST_SENTINEL] = true;\n\tListPrototype[DELETE] = ListPrototype.remove;\n\tListPrototype.setIn = MapPrototype.setIn;\n\tListPrototype.removeIn = MapPrototype.removeIn;\n\tListPrototype.update = MapPrototype.update;\n\tListPrototype.updateIn = MapPrototype.updateIn;\n\tListPrototype.withMutations = MapPrototype.withMutations;\n\tListPrototype.asMutable = MapPrototype.asMutable;\n\tListPrototype.asImmutable = MapPrototype.asImmutable;\n\tListPrototype.wasAltered = MapPrototype.wasAltered;\n\tvar VNode = function VNode(array, ownerID) {\n\t this.array = array;\n\t this.ownerID = ownerID;\n\t};\n\tvar $VNode = VNode;\n\t($traceurRuntime.createClass)(VNode, {\n\t removeBefore: function(ownerID, level, index) {\n\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t return this;\n\t }\n\t var originIndex = (index >>> level) & MASK;\n\t if (originIndex >= this.array.length) {\n\t return new $VNode([], ownerID);\n\t }\n\t var removingFirst = originIndex === 0;\n\t var newChild;\n\t if (level > 0) {\n\t var oldChild = this.array[originIndex];\n\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n\t if (newChild === oldChild && removingFirst) {\n\t return this;\n\t }\n\t }\n\t if (removingFirst && !newChild) {\n\t return this;\n\t }\n\t var editable = editableVNode(this, ownerID);\n\t if (!removingFirst) {\n\t for (var ii = 0; ii < originIndex; ii++) {\n\t editable.array[ii] = undefined;\n\t }\n\t }\n\t if (newChild) {\n\t editable.array[originIndex] = newChild;\n\t }\n\t return editable;\n\t },\n\t removeAfter: function(ownerID, level, index) {\n\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t return this;\n\t }\n\t var sizeIndex = ((index - 1) >>> level) & MASK;\n\t if (sizeIndex >= this.array.length) {\n\t return this;\n\t }\n\t var removingLast = sizeIndex === this.array.length - 1;\n\t var newChild;\n\t if (level > 0) {\n\t var oldChild = this.array[sizeIndex];\n\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n\t if (newChild === oldChild && removingLast) {\n\t return this;\n\t }\n\t }\n\t if (removingLast && !newChild) {\n\t return this;\n\t }\n\t var editable = editableVNode(this, ownerID);\n\t if (!removingLast) {\n\t editable.array.pop();\n\t }\n\t if (newChild) {\n\t editable.array[sizeIndex] = newChild;\n\t }\n\t return editable;\n\t }\n\t}, {});\n\tfunction iterateVNode(node, level, offset, max, fn, reverse) {\n\t var ii;\n\t var array = node && node.array;\n\t if (level === 0) {\n\t var from = offset < 0 ? -offset : 0;\n\t var to = max - offset;\n\t if (to > SIZE) {\n\t to = SIZE;\n\t }\n\t for (ii = from; ii < to; ii++) {\n\t if (fn(array && array[reverse ? from + to - 1 - ii : ii]) === false) {\n\t return false;\n\t }\n\t }\n\t } else {\n\t var step = 1 << level;\n\t var newLevel = level - SHIFT;\n\t for (ii = 0; ii <= MASK; ii++) {\n\t var levelIndex = reverse ? MASK - ii : ii;\n\t var newOffset = offset + (levelIndex << level);\n\t if (newOffset < max && newOffset + step > 0) {\n\t var nextNode = array && array[levelIndex];\n\t if (!iterateVNode(nextNode, newLevel, newOffset, max, fn, reverse)) {\n\t return false;\n\t }\n\t }\n\t }\n\t }\n\t return true;\n\t}\n\tvar ListIterator = function ListIterator(list, type, reverse) {\n\t this._type = type;\n\t this._reverse = !!reverse;\n\t this._maxIndex = list.size - 1;\n\t var tailOffset = getTailOffset(list._capacity);\n\t var rootStack = listIteratorFrame(list._root && list._root.array, list._level, -list._origin, tailOffset - list._origin - 1);\n\t var tailStack = listIteratorFrame(list._tail && list._tail.array, 0, tailOffset - list._origin, list._capacity - list._origin - 1);\n\t this._stack = reverse ? tailStack : rootStack;\n\t this._stack.__prev = reverse ? rootStack : tailStack;\n\t};\n\t($traceurRuntime.createClass)(ListIterator, {next: function() {\n\t var stack = this._stack;\n\t while (stack) {\n\t var array = stack.array;\n\t var rawIndex = stack.index++;\n\t if (this._reverse) {\n\t rawIndex = MASK - rawIndex;\n\t if (rawIndex > stack.rawMax) {\n\t rawIndex = stack.rawMax;\n\t stack.index = SIZE - rawIndex;\n\t }\n\t }\n\t if (rawIndex >= 0 && rawIndex < SIZE && rawIndex <= stack.rawMax) {\n\t var value = array && array[rawIndex];\n\t if (stack.level === 0) {\n\t var type = this._type;\n\t var index;\n\t if (type !== 1) {\n\t index = stack.offset + (rawIndex << stack.level);\n\t if (this._reverse) {\n\t index = this._maxIndex - index;\n\t }\n\t }\n\t return iteratorValue(type, index, value);\n\t } else {\n\t this._stack = stack = listIteratorFrame(value && value.array, stack.level - SHIFT, stack.offset + (rawIndex << stack.level), stack.max, stack);\n\t }\n\t continue;\n\t }\n\t stack = this._stack = this._stack.__prev;\n\t }\n\t return iteratorDone();\n\t }}, {}, Iterator);\n\tfunction listIteratorFrame(array, level, offset, max, prevFrame) {\n\t return {\n\t array: array,\n\t level: level,\n\t offset: offset,\n\t max: max,\n\t rawMax: ((max - offset) >> level),\n\t index: 0,\n\t __prev: prevFrame\n\t };\n\t}\n\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\n\t var list = Object.create(ListPrototype);\n\t list.size = capacity - origin;\n\t list._origin = origin;\n\t list._capacity = capacity;\n\t list._level = level;\n\t list._root = root;\n\t list._tail = tail;\n\t list.__ownerID = ownerID;\n\t list.__hash = hash;\n\t list.__altered = false;\n\t return list;\n\t}\n\tvar EMPTY_LIST;\n\tfunction emptyList() {\n\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n\t}\n\tfunction updateList(list, index, value) {\n\t index = wrapIndex(list, index);\n\t if (index >= list.size || index < 0) {\n\t return list.withMutations((function(list) {\n\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\n\t }));\n\t }\n\t index += list._origin;\n\t var newTail = list._tail;\n\t var newRoot = list._root;\n\t var didAlter = MakeRef(DID_ALTER);\n\t if (index >= getTailOffset(list._capacity)) {\n\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n\t } else {\n\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n\t }\n\t if (!didAlter.value) {\n\t return list;\n\t }\n\t if (list.__ownerID) {\n\t list._root = newRoot;\n\t list._tail = newTail;\n\t list.__hash = undefined;\n\t list.__altered = true;\n\t return list;\n\t }\n\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n\t}\n\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\n\t var idx = (index >>> level) & MASK;\n\t var nodeHas = node && idx < node.array.length;\n\t if (!nodeHas && value === undefined) {\n\t return node;\n\t }\n\t var newNode;\n\t if (level > 0) {\n\t var lowerNode = node && node.array[idx];\n\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n\t if (newLowerNode === lowerNode) {\n\t return node;\n\t }\n\t newNode = editableVNode(node, ownerID);\n\t newNode.array[idx] = newLowerNode;\n\t return newNode;\n\t }\n\t if (nodeHas && node.array[idx] === value) {\n\t return node;\n\t }\n\t SetRef(didAlter);\n\t newNode = editableVNode(node, ownerID);\n\t if (value === undefined && idx === newNode.array.length - 1) {\n\t newNode.array.pop();\n\t } else {\n\t newNode.array[idx] = value;\n\t }\n\t return newNode;\n\t}\n\tfunction editableVNode(node, ownerID) {\n\t if (ownerID && node && ownerID === node.ownerID) {\n\t return node;\n\t }\n\t return new VNode(node ? node.array.slice() : [], ownerID);\n\t}\n\tfunction listNodeFor(list, rawIndex) {\n\t if (rawIndex >= getTailOffset(list._capacity)) {\n\t return list._tail;\n\t }\n\t if (rawIndex < 1 << (list._level + SHIFT)) {\n\t var node = list._root;\n\t var level = list._level;\n\t while (node && level > 0) {\n\t node = node.array[(rawIndex >>> level) & MASK];\n\t level -= SHIFT;\n\t }\n\t return node;\n\t }\n\t}\n\tfunction setListBounds(list, begin, end) {\n\t var owner = list.__ownerID || new OwnerID();\n\t var oldOrigin = list._origin;\n\t var oldCapacity = list._capacity;\n\t var newOrigin = oldOrigin + begin;\n\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n\t return list;\n\t }\n\t if (newOrigin >= newCapacity) {\n\t return list.clear();\n\t }\n\t var newLevel = list._level;\n\t var newRoot = list._root;\n\t var offsetShift = 0;\n\t while (newOrigin + offsetShift < 0) {\n\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n\t newLevel += SHIFT;\n\t offsetShift += 1 << newLevel;\n\t }\n\t if (offsetShift) {\n\t newOrigin += offsetShift;\n\t oldOrigin += offsetShift;\n\t newCapacity += offsetShift;\n\t oldCapacity += offsetShift;\n\t }\n\t var oldTailOffset = getTailOffset(oldCapacity);\n\t var newTailOffset = getTailOffset(newCapacity);\n\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n\t newLevel += SHIFT;\n\t }\n\t var oldTail = list._tail;\n\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n\t newRoot = editableVNode(newRoot, owner);\n\t var node = newRoot;\n\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n\t var idx = (oldTailOffset >>> level) & MASK;\n\t node = node.array[idx] = editableVNode(node.array[idx], owner);\n\t }\n\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n\t }\n\t if (newCapacity < oldCapacity) {\n\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n\t }\n\t if (newOrigin >= newTailOffset) {\n\t newOrigin -= newTailOffset;\n\t newCapacity -= newTailOffset;\n\t newLevel = SHIFT;\n\t newRoot = null;\n\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n\t offsetShift = 0;\n\t while (newRoot) {\n\t var beginIndex = (newOrigin >>> newLevel) & MASK;\n\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n\t break;\n\t }\n\t if (beginIndex) {\n\t offsetShift += (1 << newLevel) * beginIndex;\n\t }\n\t newLevel -= SHIFT;\n\t newRoot = newRoot.array[beginIndex];\n\t }\n\t if (newRoot && newOrigin > oldOrigin) {\n\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n\t }\n\t if (newRoot && newTailOffset < oldTailOffset) {\n\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n\t }\n\t if (offsetShift) {\n\t newOrigin -= offsetShift;\n\t newCapacity -= offsetShift;\n\t }\n\t }\n\t if (list.__ownerID) {\n\t list.size = newCapacity - newOrigin;\n\t list._origin = newOrigin;\n\t list._capacity = newCapacity;\n\t list._level = newLevel;\n\t list._root = newRoot;\n\t list._tail = newTail;\n\t list.__hash = undefined;\n\t list.__altered = true;\n\t return list;\n\t }\n\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n\t}\n\tfunction mergeIntoListWith(list, merger, iterables) {\n\t var iters = [];\n\t var maxSize = 0;\n\t for (var ii = 0; ii < iterables.length; ii++) {\n\t var value = iterables[ii];\n\t var iter = IndexedIterable(value);\n\t if (iter.size > maxSize) {\n\t maxSize = iter.size;\n\t }\n\t if (!isIterable(value)) {\n\t iter = iter.map((function(v) {\n\t return fromJS(v);\n\t }));\n\t }\n\t iters.push(iter);\n\t }\n\t if (maxSize > list.size) {\n\t list = list.setSize(maxSize);\n\t }\n\t return mergeIntoCollectionWith(list, merger, iters);\n\t}\n\tfunction getTailOffset(size) {\n\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n\t}\n\tvar Stack = function Stack(value) {\n\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\n\t};\n\tvar $Stack = Stack;\n\t($traceurRuntime.createClass)(Stack, {\n\t toString: function() {\n\t return this.__toString('Stack [', ']');\n\t },\n\t get: function(index, notSetValue) {\n\t var head = this._head;\n\t while (head && index--) {\n\t head = head.next;\n\t }\n\t return head ? head.value : notSetValue;\n\t },\n\t peek: function() {\n\t return this._head && this._head.value;\n\t },\n\t push: function() {\n\t if (arguments.length === 0) {\n\t return this;\n\t }\n\t var newSize = this.size + arguments.length;\n\t var head = this._head;\n\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\n\t head = {\n\t value: arguments[ii],\n\t next: head\n\t };\n\t }\n\t if (this.__ownerID) {\n\t this.size = newSize;\n\t this._head = head;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return makeStack(newSize, head);\n\t },\n\t pushAll: function(iter) {\n\t iter = IndexedIterable(iter);\n\t if (iter.size === 0) {\n\t return this;\n\t }\n\t var newSize = this.size;\n\t var head = this._head;\n\t iter.reverse().forEach((function(value) {\n\t newSize++;\n\t head = {\n\t value: value,\n\t next: head\n\t };\n\t }));\n\t if (this.__ownerID) {\n\t this.size = newSize;\n\t this._head = head;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return makeStack(newSize, head);\n\t },\n\t pop: function() {\n\t return this.slice(1);\n\t },\n\t unshift: function() {\n\t return this.push.apply(this, arguments);\n\t },\n\t unshiftAll: function(iter) {\n\t return this.pushAll(iter);\n\t },\n\t shift: function() {\n\t return this.pop.apply(this, arguments);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._head = undefined;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return emptyStack();\n\t },\n\t slice: function(begin, end) {\n\t if (wholeSlice(begin, end, this.size)) {\n\t return this;\n\t }\n\t var resolvedBegin = resolveBegin(begin, this.size);\n\t var resolvedEnd = resolveEnd(end, this.size);\n\t if (resolvedEnd !== this.size) {\n\t return $traceurRuntime.superCall(this, $Stack.prototype, \"slice\", [begin, end]);\n\t }\n\t var newSize = this.size - resolvedBegin;\n\t var head = this._head;\n\t while (resolvedBegin--) {\n\t head = head.next;\n\t }\n\t if (this.__ownerID) {\n\t this.size = newSize;\n\t this._head = head;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return makeStack(newSize, head);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this.__altered = false;\n\t return this;\n\t }\n\t return makeStack(this.size, this._head, ownerID, this.__hash);\n\t },\n\t __iterate: function(fn, reverse) {\n\t if (reverse) {\n\t return this.toSeq().cacheResult.__iterate(fn, reverse);\n\t }\n\t var iterations = 0;\n\t var node = this._head;\n\t while (node) {\n\t if (fn(node.value, iterations++, this) === false) {\n\t break;\n\t }\n\t node = node.next;\n\t }\n\t return iterations;\n\t },\n\t __iterator: function(type, reverse) {\n\t if (reverse) {\n\t return this.toSeq().cacheResult().__iterator(type, reverse);\n\t }\n\t var iterations = 0;\n\t var node = this._head;\n\t return new Iterator((function() {\n\t if (node) {\n\t var value = node.value;\n\t node = node.next;\n\t return iteratorValue(type, iterations++, value);\n\t }\n\t return iteratorDone();\n\t }));\n\t }\n\t}, {of: function() {\n\t return this(arguments);\n\t }}, IndexedCollection);\n\tfunction isStack(maybeStack) {\n\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n\t}\n\tStack.isStack = isStack;\n\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\tvar StackPrototype = Stack.prototype;\n\tStackPrototype[IS_STACK_SENTINEL] = true;\n\tStackPrototype.withMutations = MapPrototype.withMutations;\n\tStackPrototype.asMutable = MapPrototype.asMutable;\n\tStackPrototype.asImmutable = MapPrototype.asImmutable;\n\tStackPrototype.wasAltered = MapPrototype.wasAltered;\n\tfunction makeStack(size, head, ownerID, hash) {\n\t var map = Object.create(StackPrototype);\n\t map.size = size;\n\t map._head = head;\n\t map.__ownerID = ownerID;\n\t map.__hash = hash;\n\t map.__altered = false;\n\t return map;\n\t}\n\tvar EMPTY_STACK;\n\tfunction emptyStack() {\n\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n\t}\n\tvar Set = function Set(value) {\n\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().union(value);\n\t};\n\t($traceurRuntime.createClass)(Set, {\n\t toString: function() {\n\t return this.__toString('Set {', '}');\n\t },\n\t has: function(value) {\n\t return this._map.has(value);\n\t },\n\t add: function(value) {\n\t var newMap = this._map.set(value, true);\n\t if (this.__ownerID) {\n\t this.size = newMap.size;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return newMap === this._map ? this : makeSet(newMap);\n\t },\n\t remove: function(value) {\n\t var newMap = this._map.remove(value);\n\t if (this.__ownerID) {\n\t this.size = newMap.size;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return newMap === this._map ? this : newMap.size === 0 ? emptySet() : makeSet(newMap);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._map.clear();\n\t return this;\n\t }\n\t return emptySet();\n\t },\n\t union: function() {\n\t var iters = arguments;\n\t if (iters.length === 0) {\n\t return this;\n\t }\n\t return this.withMutations((function(set) {\n\t for (var ii = 0; ii < iters.length; ii++) {\n\t SetIterable(iters[ii]).forEach((function(value) {\n\t return set.add(value);\n\t }));\n\t }\n\t }));\n\t },\n\t intersect: function() {\n\t for (var iters = [],\n\t $__7 = 0; $__7 < arguments.length; $__7++)\n\t iters[$__7] = arguments[$__7];\n\t if (iters.length === 0) {\n\t return this;\n\t }\n\t iters = iters.map((function(iter) {\n\t return SetIterable(iter);\n\t }));\n\t var originalSet = this;\n\t return this.withMutations((function(set) {\n\t originalSet.forEach((function(value) {\n\t if (!iters.every((function(iter) {\n\t return iter.contains(value);\n\t }))) {\n\t set.remove(value);\n\t }\n\t }));\n\t }));\n\t },\n\t subtract: function() {\n\t for (var iters = [],\n\t $__8 = 0; $__8 < arguments.length; $__8++)\n\t iters[$__8] = arguments[$__8];\n\t if (iters.length === 0) {\n\t return this;\n\t }\n\t iters = iters.map((function(iter) {\n\t return SetIterable(iter);\n\t }));\n\t var originalSet = this;\n\t return this.withMutations((function(set) {\n\t originalSet.forEach((function(value) {\n\t if (iters.some((function(iter) {\n\t return iter.contains(value);\n\t }))) {\n\t set.remove(value);\n\t }\n\t }));\n\t }));\n\t },\n\t merge: function() {\n\t return this.union.apply(this, arguments);\n\t },\n\t mergeWith: function(merger) {\n\t for (var iters = [],\n\t $__9 = 1; $__9 < arguments.length; $__9++)\n\t iters[$__9 - 1] = arguments[$__9];\n\t return this.union.apply(this, iters);\n\t },\n\t wasAltered: function() {\n\t return this._map.wasAltered();\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._map.__iterate((function(_, k) {\n\t return fn(k, k, $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t return this._map.map((function(_, k) {\n\t return k;\n\t })).__iterator(type, reverse);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t var newMap = this._map.__ensureOwner(ownerID);\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return makeSet(newMap, ownerID);\n\t }\n\t}, {\n\t of: function() {\n\t return this(arguments);\n\t },\n\t fromKeys: function(value) {\n\t return this(KeyedSeq(value).flip().valueSeq());\n\t }\n\t}, SetCollection);\n\tfunction isSet(maybeSet) {\n\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n\t}\n\tSet.isSet = isSet;\n\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\tvar SetPrototype = Set.prototype;\n\tSetPrototype[IS_SET_SENTINEL] = true;\n\tSetPrototype[DELETE] = SetPrototype.remove;\n\tSetPrototype.mergeDeep = SetPrototype.merge;\n\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n\tSetPrototype.withMutations = MapPrototype.withMutations;\n\tSetPrototype.asMutable = MapPrototype.asMutable;\n\tSetPrototype.asImmutable = MapPrototype.asImmutable;\n\tfunction makeSet(map, ownerID) {\n\t var set = Object.create(SetPrototype);\n\t set.size = map ? map.size : 0;\n\t set._map = map;\n\t set.__ownerID = ownerID;\n\t return set;\n\t}\n\tvar EMPTY_SET;\n\tfunction emptySet() {\n\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n\t}\n\tvar OrderedMap = function OrderedMap(value) {\n\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().merge(KeyedIterable(value));\n\t};\n\t($traceurRuntime.createClass)(OrderedMap, {\n\t toString: function() {\n\t return this.__toString('OrderedMap {', '}');\n\t },\n\t get: function(k, notSetValue) {\n\t var index = this._map.get(k);\n\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._map.clear();\n\t this._list.clear();\n\t return this;\n\t }\n\t return emptyOrderedMap();\n\t },\n\t set: function(k, v) {\n\t return updateOrderedMap(this, k, v);\n\t },\n\t remove: function(k) {\n\t return updateOrderedMap(this, k, NOT_SET);\n\t },\n\t wasAltered: function() {\n\t return this._map.wasAltered() || this._list.wasAltered();\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._list.__iterate((function(entry) {\n\t return entry && fn(entry[1], entry[0], $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t return this._list.fromEntrySeq().__iterator(type, reverse);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t var newMap = this._map.__ensureOwner(ownerID);\n\t var newList = this._list.__ensureOwner(ownerID);\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this._map = newMap;\n\t this._list = newList;\n\t return this;\n\t }\n\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n\t }\n\t}, {of: function() {\n\t return this(arguments);\n\t }}, Map);\n\tfunction isOrderedMap(maybeOrderedMap) {\n\t return !!(maybeOrderedMap && maybeOrderedMap[IS_ORDERED_MAP_SENTINEL]);\n\t}\n\tOrderedMap.isOrderedMap = isOrderedMap;\n\tvar IS_ORDERED_MAP_SENTINEL = '@@__IMMUTABLE_ORDERED_MAP__@@';\n\tOrderedMap.prototype[IS_ORDERED_MAP_SENTINEL] = true;\n\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\tfunction makeOrderedMap(map, list, ownerID, hash) {\n\t var omap = Object.create(OrderedMap.prototype);\n\t omap.size = map ? map.size : 0;\n\t omap._map = map;\n\t omap._list = list;\n\t omap.__ownerID = ownerID;\n\t omap.__hash = hash;\n\t return omap;\n\t}\n\tvar EMPTY_ORDERED_MAP;\n\tfunction emptyOrderedMap() {\n\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n\t}\n\tfunction updateOrderedMap(omap, k, v) {\n\t var map = omap._map;\n\t var list = omap._list;\n\t var i = map.get(k);\n\t var has = i !== undefined;\n\t var removed = v === NOT_SET;\n\t if ((!has && removed) || (has && v === list.get(i)[1])) {\n\t return omap;\n\t }\n\t if (!has) {\n\t i = list.size;\n\t }\n\t var newMap = removed ? map.remove(k) : has ? map : map.set(k, i);\n\t var newList = removed ? list.set(i, undefined) : list.set(i, [k, v]);\n\t if (omap.__ownerID) {\n\t omap.size = newMap.size;\n\t omap._map = newMap;\n\t omap._list = newList;\n\t omap.__hash = undefined;\n\t return omap;\n\t }\n\t return makeOrderedMap(newMap, newList);\n\t}\n\tvar Record = function Record(defaultValues, name) {\n\t var RecordType = function Record(values) {\n\t if (!(this instanceof RecordType)) {\n\t return new RecordType(values);\n\t }\n\t this._map = Map(values);\n\t };\n\t var keys = Object.keys(defaultValues);\n\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n\t RecordTypePrototype.constructor = RecordType;\n\t name && (RecordTypePrototype._name = name);\n\t RecordTypePrototype._defaultValues = defaultValues;\n\t RecordTypePrototype._keys = keys;\n\t RecordTypePrototype.size = keys.length;\n\t try {\n\t keys.forEach((function(key) {\n\t Object.defineProperty(RecordType.prototype, key, {\n\t get: function() {\n\t return this.get(key);\n\t },\n\t set: function(value) {\n\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\n\t this.set(key, value);\n\t }\n\t });\n\t }));\n\t } catch (error) {}\n\t return RecordType;\n\t};\n\t($traceurRuntime.createClass)(Record, {\n\t toString: function() {\n\t return this.__toString(recordName(this) + ' {', '}');\n\t },\n\t has: function(k) {\n\t return this._defaultValues.hasOwnProperty(k);\n\t },\n\t get: function(k, notSetValue) {\n\t if (notSetValue !== undefined && !this.has(k)) {\n\t return notSetValue;\n\t }\n\t var defaultVal = this._defaultValues[k];\n\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\n\t },\n\t clear: function() {\n\t if (this.__ownerID) {\n\t this._map && this._map.clear();\n\t return this;\n\t }\n\t var SuperRecord = Object.getPrototypeOf(this).constructor;\n\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\n\t },\n\t set: function(k, v) {\n\t if (!this.has(k)) {\n\t throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n\t }\n\t var newMap = this._map && this._map.set(k, v);\n\t if (this.__ownerID || newMap === this._map) {\n\t return this;\n\t }\n\t return makeRecord(this, newMap);\n\t },\n\t remove: function(k) {\n\t if (!this.has(k)) {\n\t return this;\n\t }\n\t var newMap = this._map && this._map.remove(k);\n\t if (this.__ownerID || newMap === this._map) {\n\t return this;\n\t }\n\t return makeRecord(this, newMap);\n\t },\n\t wasAltered: function() {\n\t return this._map.wasAltered();\n\t },\n\t __iterator: function(type, reverse) {\n\t var $__0 = this;\n\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t return $__0.get(k);\n\t })).__iterator(type, reverse);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t return $__0.get(k);\n\t })).__iterate(fn, reverse);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t var newMap = this._map && this._map.__ensureOwner(ownerID);\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return makeRecord(this, newMap, ownerID);\n\t }\n\t}, {}, KeyedCollection);\n\tvar RecordPrototype = Record.prototype;\n\tRecordPrototype[DELETE] = RecordPrototype.remove;\n\tRecordPrototype.merge = MapPrototype.merge;\n\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\n\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n\tRecordPrototype.update = MapPrototype.update;\n\tRecordPrototype.updateIn = MapPrototype.updateIn;\n\tRecordPrototype.withMutations = MapPrototype.withMutations;\n\tRecordPrototype.asMutable = MapPrototype.asMutable;\n\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\n\tfunction makeRecord(likeRecord, map, ownerID) {\n\t var record = Object.create(Object.getPrototypeOf(likeRecord));\n\t record._map = map;\n\t record.__ownerID = ownerID;\n\t return record;\n\t}\n\tfunction recordName(record) {\n\t return record._name || record.constructor.name;\n\t}\n\tvar Range = function Range(start, end, step) {\n\t if (!(this instanceof $Range)) {\n\t return new $Range(start, end, step);\n\t }\n\t invariant(step !== 0, 'Cannot step a Range by 0');\n\t start = start || 0;\n\t if (end === undefined) {\n\t end = Infinity;\n\t }\n\t if (start === end && __EMPTY_RANGE) {\n\t return __EMPTY_RANGE;\n\t }\n\t step = step === undefined ? 1 : Math.abs(step);\n\t if (end < start) {\n\t step = -step;\n\t }\n\t this._start = start;\n\t this._end = end;\n\t this._step = step;\n\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n\t};\n\tvar $Range = Range;\n\t($traceurRuntime.createClass)(Range, {\n\t toString: function() {\n\t if (this.size === 0) {\n\t return 'Range []';\n\t }\n\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\n\t },\n\t get: function(index, notSetValue) {\n\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\n\t },\n\t contains: function(searchValue) {\n\t var possibleIndex = (searchValue - this._start) / this._step;\n\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\n\t },\n\t slice: function(begin, end) {\n\t if (wholeSlice(begin, end, this.size)) {\n\t return this;\n\t }\n\t begin = resolveBegin(begin, this.size);\n\t end = resolveEnd(end, this.size);\n\t if (end <= begin) {\n\t return __EMPTY_RANGE;\n\t }\n\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n\t },\n\t indexOf: function(searchValue) {\n\t var offsetValue = searchValue - this._start;\n\t if (offsetValue % this._step === 0) {\n\t var index = offsetValue / this._step;\n\t if (index >= 0 && index < this.size) {\n\t return index;\n\t }\n\t }\n\t return -1;\n\t },\n\t lastIndexOf: function(searchValue) {\n\t return this.indexOf(searchValue);\n\t },\n\t take: function(amount) {\n\t return this.slice(0, Math.max(0, amount));\n\t },\n\t skip: function(amount) {\n\t return this.slice(Math.max(0, amount));\n\t },\n\t __iterate: function(fn, reverse) {\n\t var maxIndex = this.size - 1;\n\t var step = this._step;\n\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t if (fn(value, ii, this) === false) {\n\t return ii + 1;\n\t }\n\t value += reverse ? -step : step;\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var maxIndex = this.size - 1;\n\t var step = this._step;\n\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t var v = value;\n\t value += reverse ? -step : step;\n\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n\t }));\n\t },\n\t __deepEquals: function(other) {\n\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : $traceurRuntime.superCall(this, $Range.prototype, \"__deepEquals\", [other]);\n\t }\n\t}, {}, IndexedSeq);\n\tvar RangePrototype = Range.prototype;\n\tRangePrototype.__toJS = RangePrototype.toArray;\n\tRangePrototype.first = ListPrototype.first;\n\tRangePrototype.last = ListPrototype.last;\n\tvar __EMPTY_RANGE = Range(0, 0);\n\tvar Repeat = function Repeat(value, times) {\n\t if (times <= 0 && EMPTY_REPEAT) {\n\t return EMPTY_REPEAT;\n\t }\n\t if (!(this instanceof $Repeat)) {\n\t return new $Repeat(value, times);\n\t }\n\t this._value = value;\n\t this.size = times === undefined ? Infinity : Math.max(0, times);\n\t if (this.size === 0) {\n\t EMPTY_REPEAT = this;\n\t }\n\t};\n\tvar $Repeat = Repeat;\n\t($traceurRuntime.createClass)(Repeat, {\n\t toString: function() {\n\t if (this.size === 0) {\n\t return 'Repeat []';\n\t }\n\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n\t },\n\t get: function(index, notSetValue) {\n\t return this.has(index) ? this._value : notSetValue;\n\t },\n\t contains: function(searchValue) {\n\t return is(this._value, searchValue);\n\t },\n\t slice: function(begin, end) {\n\t var size = this.size;\n\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n\t },\n\t reverse: function() {\n\t return this;\n\t },\n\t indexOf: function(searchValue) {\n\t if (is(this._value, searchValue)) {\n\t return 0;\n\t }\n\t return -1;\n\t },\n\t lastIndexOf: function(searchValue) {\n\t if (is(this._value, searchValue)) {\n\t return this.size;\n\t }\n\t return -1;\n\t },\n\t __iterate: function(fn, reverse) {\n\t for (var ii = 0; ii < this.size; ii++) {\n\t if (fn(this._value, ii, this) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var $__0 = this;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\n\t }));\n\t },\n\t __deepEquals: function(other) {\n\t return other instanceof $Repeat ? is(this._value, other._value) : $traceurRuntime.superCall(this, $Repeat.prototype, \"__deepEquals\", [other]);\n\t }\n\t}, {}, IndexedSeq);\n\tvar RepeatPrototype = Repeat.prototype;\n\tRepeatPrototype.last = RepeatPrototype.first;\n\tRepeatPrototype.has = RangePrototype.has;\n\tRepeatPrototype.take = RangePrototype.take;\n\tRepeatPrototype.skip = RangePrototype.skip;\n\tRepeatPrototype.__toJS = RangePrototype.__toJS;\n\tvar EMPTY_REPEAT;\n\tvar Immutable = {\n\t Iterable: Iterable,\n\t Seq: Seq,\n\t Collection: Collection,\n\t Map: Map,\n\t List: List,\n\t Stack: Stack,\n\t Set: Set,\n\t OrderedMap: OrderedMap,\n\t Record: Record,\n\t Range: Range,\n\t Repeat: Repeat,\n\t is: is,\n\t fromJS: fromJS\n\t};\n\n\t return Immutable;\n\t}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function FooBar() {\n // TODO: implement this module\n}","function n(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function n(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function Module() {}","function Module() {}","function Module() {}","function Module() {}","function Module() {}","function Module() {}","patch() {\n }","function v8(v9,v10) {\n const v16 = [1337,1337];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v17 = [\"536870912\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\n // v17 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = {constructor:13.37,e:v16};\n // v18 = .object(ofGroup: Object, withProperties: [\"constructor\", \"e\", \"__proto__\"])\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\n // v19 = .object(ofGroup: Object, withProperties: [\"d\", \"b\", \"a\", \"__proto__\", \"e\", \"constructor\", \"length\"])\n const v21 = new Float64Array(v19);\n // v21 = .object(ofGroup: Float64Array, withProperties: [\"byteOffset\", \"constructor\", \"buffer\", \"__proto__\", \"byteLength\", \"length\"], withMethods: [\"map\", \"values\", \"subarray\", \"find\", \"fill\", \"set\", \"findIndex\", \"some\", \"reduceRight\", \"reverse\", \"join\", \"includes\", \"entries\", \"reduce\", \"every\", \"copyWithin\", \"sort\", \"forEach\", \"lastIndexOf\", \"indexOf\", \"filter\", \"slice\", \"keys\"])\n v6[6] = v7;\n v7.toString = v9;\n }","function Utils() {}","function Utils() {}","function o(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function c() {}","constructor( ) {}","function main() {\n}","use(fn) {}","function FooRule() {\n}","initialize() {}","initialize() {}","initialize() {}","initialize() {}","initialize() {}","initialize() {}","function test() {\n var o35 = Object.getOwnPropertyDescriptor(Object.prototype, \"__proto__\").function(o1, o2)\n{\n var o3 = 0;\n var o4 = 0;\n try {\nfor (var o5 = 1; o5 < 10000; o5++)\n {\n try {\no3 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0x3FFFF;\n}catch(e){}\n try {\no2.o3 = o3 + o4;\n}catch(e){}\n try {\no4 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0xFFFF;\n}catch(e){}\n }\n}catch(e){}\n try {\nreturn o3 + o4;\n}catch(e){}\n};\n function o1() {\n }\n var o2 = ((o863 & 0x4000) >> Object.o157) | ((o863 & 0x40) >> 6);\n var o38 = o839.o906.o917(o308);\n var o6 = Array('Math.ceil((' + target + ')/');\n var o867 = this.o543[0x200 | (o768 >> 4)];\n var o8 = o1(\"willValidate\");\n try {\no21 = function () {\n try {\no337++;\n}catch(e){}\n };\n}catch(e){}\n try {\ntry { o1(\"MSGestureEvent\"); } catch(e) {}try { try {\no1(\"setImmediate\");\n}catch(e){} } catch(e) {}\n}catch(e){}\n try {\n({ o9: !o3.call(o2, o1, '!') });\n}catch(e){}\n try {\nif (o0 != 2)\n try {\nprint(\"FAIL\");\n}catch(e){}\n else\n try {\nprint(\"PASS\");\n}catch(e){}\n}catch(e){}\n}","function Bevy() {}","function hc(){return hc=Object.assign?Object.assign.bind():function(e){for(var t=1;t=0;d--)(n=e[d])&&(r=(i<3?n(r):i>3?n(t,a,r):n(t,a))||r);return i>3&&r&&Object.defineProperty(t,a,r),r\\n/**\\n * @license\\n * Copyright 2016 Google Inc.\\n *\\n * Permission is hereby granted, free of charge, to any person obtaining a copy\\n * of this software and associated documentation files (the \\\"Software\\\"), to deal\\n * in the Software without restriction, including without limitation the rights\\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n * copies of the Software, and to permit persons to whom the Software is\\n * furnished to do so, subject to the following conditions:\\n *\\n * The above copyright notice and this permission notice shall be included in\\n * all copies or substantial portions of the Software.\\n *\\n * THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\\n * THE SOFTWARE.\\n */}\",\n \"function n(r){return!!r.constructor&&typeof r.constructor.isBuffer==\\\"function\\\"&&r.constructor.isBuffer(r)}\",\n \"function Generator() {} // 80\",\n \"function r() {}\",\n \"function r() {}\",\n \"function r() {}\",\n \"function i(e){var t=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),n=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),r=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),i=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),a=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),s=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),c=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),d=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),f=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),m=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),v=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),y=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),g=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),_=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),b=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),w=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),T=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),E=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),S=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),x=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),k=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),C=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),A=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),N=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),I=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x);(0,o.default)(e,{0:t,NetworkOrCORSError:t,400:n,BadRequest:n,401:r,Unauthorized:r,402:i,PaymentRequired:i,403:a,Forbidden:a,404:s,NotFound:s,405:c,MethodNotAllowed:c,406:d,NotAcceptable:d,407:f,ProxyAuthenticationRequired:f,408:m,RequestTimeout:m,409:v,Conflict:v,410:y,Gone:y,411:g,LengthRequired:g,412:_,PreconditionFailed:_,413:b,RequestEntityTooLarge:b,414:w,RequestUriTooLong:w,415:T,UnsupportedMediaType:T,416:E,RequestRangeNotSatisfiable:E,417:S,ExpectationFailed:S,500:x,InternalServerError:x,501:k,NotImplemented:k,502:C,BadGateway:C,503:A,ServiceUnavailable:A,504:N,GatewayTimeout:N,505:I,HttpVersionNotSupported:I,select:function(t){if(void 0===t||null===t)return e;t=t.statusCode||t;var n=e[t];return n||(t=t.toString().split(\\\"\\\").shift()+\\\"00\\\",t=parseInt(t,10),e[t]||e)}})}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}\",\n \"function Generator() {} // 84\",\n \"function require() { return {}; }\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function Util() {}\",\n \"function n(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function lt(t,i){return t(i={exports:{}},i.exports),i.exports}\",\n \"function c(e,t,n){Array.isArray(e)?(n=t,t=e,e=void 0):\\\"string\\\"!=typeof e&&(n=e,e=t=void 0),t&&!Array.isArray(t)&&(n=t,t=void 0),t||(t=[\\\"require\\\",\\\"exports\\\",\\\"module\\\"]),\\n//Set up properties for this module. If an ID, then use\\n//internal cache. If no ID, then use the external variables\\n//for this node module.\\ne?\\n//Put the module in deep freeze until there is a\\n//require call for it.\\nd[e]=[e,t,n]:l(e,t,n)}\",\n \"private public function m246() {}\",\n \"function t(e){return!!e.constructor&&'function'==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function universalModule() {\\n\\t\\t var $Object = Object;\\n\\n\\t\\tfunction createClass(ctor, methods, staticMethods, superClass) {\\n\\t\\t var proto;\\n\\t\\t if (superClass) {\\n\\t\\t var superProto = superClass.prototype;\\n\\t\\t proto = $Object.create(superProto);\\n\\t\\t } else {\\n\\t\\t proto = ctor.prototype;\\n\\t\\t }\\n\\t\\t $Object.keys(methods).forEach(function (key) {\\n\\t\\t proto[key] = methods[key];\\n\\t\\t });\\n\\t\\t $Object.keys(staticMethods).forEach(function (key) {\\n\\t\\t ctor[key] = staticMethods[key];\\n\\t\\t });\\n\\t\\t proto.constructor = ctor;\\n\\t\\t ctor.prototype = proto;\\n\\t\\t return ctor;\\n\\t\\t}\\n\\n\\t\\tfunction superCall(self, proto, name, args) {\\n\\t\\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\\n\\t\\t}\\n\\n\\t\\tfunction defaultSuperCall(self, proto, args) {\\n\\t\\t superCall(self, proto, 'constructor', args);\\n\\t\\t}\\n\\n\\t\\tvar $traceurRuntime = {};\\n\\t\\t$traceurRuntime.createClass = createClass;\\n\\t\\t$traceurRuntime.superCall = superCall;\\n\\t\\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\\n\\t\\t\\\"use strict\\\";\\n\\t\\tfunction is(valueA, valueB) {\\n\\t\\t if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t if (!valueA || !valueB) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t if (typeof valueA.valueOf === 'function' && typeof valueB.valueOf === 'function') {\\n\\t\\t valueA = valueA.valueOf();\\n\\t\\t valueB = valueB.valueOf();\\n\\t\\t }\\n\\t\\t return typeof valueA.equals === 'function' && typeof valueB.equals === 'function' ? valueA.equals(valueB) : valueA === valueB || (valueA !== valueA && valueB !== valueB);\\n\\t\\t}\\n\\t\\tfunction invariant(condition, error) {\\n\\t\\t if (!condition)\\n\\t\\t throw new Error(error);\\n\\t\\t}\\n\\t\\tvar DELETE = 'delete';\\n\\t\\tvar SHIFT = 5;\\n\\t\\tvar SIZE = 1 << SHIFT;\\n\\t\\tvar MASK = SIZE - 1;\\n\\t\\tvar NOT_SET = {};\\n\\t\\tvar CHANGE_LENGTH = {value: false};\\n\\t\\tvar DID_ALTER = {value: false};\\n\\t\\tfunction MakeRef(ref) {\\n\\t\\t ref.value = false;\\n\\t\\t return ref;\\n\\t\\t}\\n\\t\\tfunction SetRef(ref) {\\n\\t\\t ref && (ref.value = true);\\n\\t\\t}\\n\\t\\tfunction OwnerID() {}\\n\\t\\tfunction arrCopy(arr, offset) {\\n\\t\\t offset = offset || 0;\\n\\t\\t var len = Math.max(0, arr.length - offset);\\n\\t\\t var newArr = new Array(len);\\n\\t\\t for (var ii = 0; ii < len; ii++) {\\n\\t\\t newArr[ii] = arr[ii + offset];\\n\\t\\t }\\n\\t\\t return newArr;\\n\\t\\t}\\n\\t\\tfunction assertNotInfinite(size) {\\n\\t\\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\\n\\t\\t}\\n\\t\\tfunction ensureSize(iter) {\\n\\t\\t if (iter.size === undefined) {\\n\\t\\t iter.size = iter.__iterate(returnTrue);\\n\\t\\t }\\n\\t\\t return iter.size;\\n\\t\\t}\\n\\t\\tfunction wrapIndex(iter, index) {\\n\\t\\t return index >= 0 ? (+index) : ensureSize(iter) + (+index);\\n\\t\\t}\\n\\t\\tfunction returnTrue() {\\n\\t\\t return true;\\n\\t\\t}\\n\\t\\tfunction wholeSlice(begin, end, size) {\\n\\t\\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\\n\\t\\t}\\n\\t\\tfunction resolveBegin(begin, size) {\\n\\t\\t return resolveIndex(begin, size, 0);\\n\\t\\t}\\n\\t\\tfunction resolveEnd(end, size) {\\n\\t\\t return resolveIndex(end, size, size);\\n\\t\\t}\\n\\t\\tfunction resolveIndex(index, size, defaultIndex) {\\n\\t\\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\\n\\t\\t}\\n\\t\\tvar imul = typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ? Math.imul : function imul(a, b) {\\n\\t\\t a = a | 0;\\n\\t\\t b = b | 0;\\n\\t\\t var c = a & 0xffff;\\n\\t\\t var d = b & 0xffff;\\n\\t\\t return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0;\\n\\t\\t};\\n\\t\\tfunction smi(i32) {\\n\\t\\t return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\\n\\t\\t}\\n\\t\\tfunction hash(o) {\\n\\t\\t if (o === false || o === null || o === undefined) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t if (typeof o.valueOf === 'function') {\\n\\t\\t o = o.valueOf();\\n\\t\\t if (o === false || o === null || o === undefined) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (o === true) {\\n\\t\\t return 1;\\n\\t\\t }\\n\\t\\t var type = typeof o;\\n\\t\\t if (type === 'number') {\\n\\t\\t var h = o | 0;\\n\\t\\t while (o > 0xFFFFFFFF) {\\n\\t\\t o /= 0xFFFFFFFF;\\n\\t\\t h ^= o;\\n\\t\\t }\\n\\t\\t return smi(h);\\n\\t\\t }\\n\\t\\t if (type === 'string') {\\n\\t\\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\\n\\t\\t }\\n\\t\\t if (typeof o.hashCode === 'function') {\\n\\t\\t return o.hashCode();\\n\\t\\t }\\n\\t\\t return hashJSObj(o);\\n\\t\\t}\\n\\t\\tfunction cachedHashString(string) {\\n\\t\\t var hash = stringHashCache[string];\\n\\t\\t if (hash === undefined) {\\n\\t\\t hash = hashString(string);\\n\\t\\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\\n\\t\\t STRING_HASH_CACHE_SIZE = 0;\\n\\t\\t stringHashCache = {};\\n\\t\\t }\\n\\t\\t STRING_HASH_CACHE_SIZE++;\\n\\t\\t stringHashCache[string] = hash;\\n\\t\\t }\\n\\t\\t return hash;\\n\\t\\t}\\n\\t\\tfunction hashString(string) {\\n\\t\\t var hash = 0;\\n\\t\\t for (var ii = 0; ii < string.length; ii++) {\\n\\t\\t hash = 31 * hash + string.charCodeAt(ii) | 0;\\n\\t\\t }\\n\\t\\t return smi(hash);\\n\\t\\t}\\n\\t\\tfunction hashJSObj(obj) {\\n\\t\\t var hash = weakMap && weakMap.get(obj);\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t hash = obj[UID_HASH_KEY];\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t if (!canDefineProperty) {\\n\\t\\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t hash = getIENodeHash(obj);\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t }\\n\\t\\t if (Object.isExtensible && !Object.isExtensible(obj)) {\\n\\t\\t throw new Error('Non-extensible objects are not allowed as keys.');\\n\\t\\t }\\n\\t\\t hash = ++objHashUID;\\n\\t\\t if (objHashUID & 0x40000000) {\\n\\t\\t objHashUID = 0;\\n\\t\\t }\\n\\t\\t if (weakMap) {\\n\\t\\t weakMap.set(obj, hash);\\n\\t\\t } else if (canDefineProperty) {\\n\\t\\t Object.defineProperty(obj, UID_HASH_KEY, {\\n\\t\\t 'enumerable': false,\\n\\t\\t 'configurable': false,\\n\\t\\t 'writable': false,\\n\\t\\t 'value': hash\\n\\t\\t });\\n\\t\\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\\n\\t\\t obj.propertyIsEnumerable = function() {\\n\\t\\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\\n\\t\\t };\\n\\t\\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\\n\\t\\t } else if (obj.nodeType) {\\n\\t\\t obj[UID_HASH_KEY] = hash;\\n\\t\\t } else {\\n\\t\\t throw new Error('Unable to set a non-enumerable property on object.');\\n\\t\\t }\\n\\t\\t return hash;\\n\\t\\t}\\n\\t\\tvar canDefineProperty = (function() {\\n\\t\\t try {\\n\\t\\t Object.defineProperty({}, 'x', {});\\n\\t\\t return true;\\n\\t\\t } catch (e) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t}());\\n\\t\\tfunction getIENodeHash(node) {\\n\\t\\t if (node && node.nodeType > 0) {\\n\\t\\t switch (node.nodeType) {\\n\\t\\t case 1:\\n\\t\\t return node.uniqueID;\\n\\t\\t case 9:\\n\\t\\t return node.documentElement && node.documentElement.uniqueID;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\\n\\t\\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\\n\\t\\tvar objHashUID = 0;\\n\\t\\tvar UID_HASH_KEY = '__immutablehash__';\\n\\t\\tif (typeof Symbol === 'function') {\\n\\t\\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\\n\\t\\t}\\n\\t\\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\\n\\t\\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\\n\\t\\tvar STRING_HASH_CACHE_SIZE = 0;\\n\\t\\tvar stringHashCache = {};\\n\\t\\tvar ITERATE_KEYS = 0;\\n\\t\\tvar ITERATE_VALUES = 1;\\n\\t\\tvar ITERATE_ENTRIES = 2;\\n\\t\\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\\n\\t\\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\\n\\t\\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\\n\\t\\tvar Iterator = function Iterator(next) {\\n\\t\\t this.next = next;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Iterator, {toString: function() {\\n\\t\\t return '[Iterator]';\\n\\t\\t }}, {});\\n\\t\\tIterator.KEYS = ITERATE_KEYS;\\n\\t\\tIterator.VALUES = ITERATE_VALUES;\\n\\t\\tIterator.ENTRIES = ITERATE_ENTRIES;\\n\\t\\tvar IteratorPrototype = Iterator.prototype;\\n\\t\\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\\n\\t\\t return this.toString();\\n\\t\\t};\\n\\t\\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\\n\\t\\t return this;\\n\\t\\t};\\n\\t\\tfunction iteratorValue(type, k, v, iteratorResult) {\\n\\t\\t var value = type === 0 ? k : type === 1 ? v : [k, v];\\n\\t\\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\\n\\t\\t value: value,\\n\\t\\t done: false\\n\\t\\t });\\n\\t\\t return iteratorResult;\\n\\t\\t}\\n\\t\\tfunction iteratorDone() {\\n\\t\\t return {\\n\\t\\t value: undefined,\\n\\t\\t done: true\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction hasIterator(maybeIterable) {\\n\\t\\t return !!_iteratorFn(maybeIterable);\\n\\t\\t}\\n\\t\\tfunction isIterator(maybeIterator) {\\n\\t\\t return maybeIterator && typeof maybeIterator.next === 'function';\\n\\t\\t}\\n\\t\\tfunction getIterator(iterable) {\\n\\t\\t var iteratorFn = _iteratorFn(iterable);\\n\\t\\t return iteratorFn && iteratorFn.call(iterable);\\n\\t\\t}\\n\\t\\tfunction _iteratorFn(iterable) {\\n\\t\\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\\n\\t\\t if (typeof iteratorFn === 'function') {\\n\\t\\t return iteratorFn;\\n\\t\\t }\\n\\t\\t}\\n\\t\\tvar Iterable = function Iterable(value) {\\n\\t\\t return isIterable(value) ? value : Seq(value);\\n\\t\\t};\\n\\t\\tvar $Iterable = Iterable;\\n\\t\\t($traceurRuntime.createClass)(Iterable, {\\n\\t\\t toArray: function() {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var array = new Array(this.size || 0);\\n\\t\\t this.valueSeq().__iterate((function(v, i) {\\n\\t\\t array[i] = v;\\n\\t\\t }));\\n\\t\\t return array;\\n\\t\\t },\\n\\t\\t toIndexedSeq: function() {\\n\\t\\t return new ToIndexedSequence(this);\\n\\t\\t },\\n\\t\\t toJS: function() {\\n\\t\\t return this.toSeq().map((function(value) {\\n\\t\\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\\n\\t\\t })).__toJS();\\n\\t\\t },\\n\\t\\t toKeyedSeq: function() {\\n\\t\\t return new ToKeyedSequence(this, true);\\n\\t\\t },\\n\\t\\t toMap: function() {\\n\\t\\t return Map(this.toKeyedSeq());\\n\\t\\t },\\n\\t\\t toObject: function() {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var object = {};\\n\\t\\t this.__iterate((function(v, k) {\\n\\t\\t object[k] = v;\\n\\t\\t }));\\n\\t\\t return object;\\n\\t\\t },\\n\\t\\t toOrderedMap: function() {\\n\\t\\t return OrderedMap(this.toKeyedSeq());\\n\\t\\t },\\n\\t\\t toOrderedSet: function() {\\n\\t\\t return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toSet: function() {\\n\\t\\t return Set(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toSetSeq: function() {\\n\\t\\t return new ToSetSequence(this);\\n\\t\\t },\\n\\t\\t toSeq: function() {\\n\\t\\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\\n\\t\\t },\\n\\t\\t toStack: function() {\\n\\t\\t return Stack(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toList: function() {\\n\\t\\t return List(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toString: function() {\\n\\t\\t return '[Iterable]';\\n\\t\\t },\\n\\t\\t __toString: function(head, tail) {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return head + tail;\\n\\t\\t }\\n\\t\\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\\n\\t\\t },\\n\\t\\t concat: function() {\\n\\t\\t for (var values = [],\\n\\t\\t $__2 = 0; $__2 < arguments.length; $__2++)\\n\\t\\t values[$__2] = arguments[$__2];\\n\\t\\t return reify(this, concatFactory(this, values));\\n\\t\\t },\\n\\t\\t contains: function(searchValue) {\\n\\t\\t return this.some((function(value) {\\n\\t\\t return is(value, searchValue);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t entries: function() {\\n\\t\\t return this.__iterator(ITERATE_ENTRIES);\\n\\t\\t },\\n\\t\\t every: function(predicate, context) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var returnValue = true;\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (!predicate.call(context, v, k, c)) {\\n\\t\\t returnValue = false;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return returnValue;\\n\\t\\t },\\n\\t\\t filter: function(predicate, context) {\\n\\t\\t return reify(this, filterFactory(this, predicate, context, true));\\n\\t\\t },\\n\\t\\t find: function(predicate, context, notSetValue) {\\n\\t\\t var foundValue = notSetValue;\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (predicate.call(context, v, k, c)) {\\n\\t\\t foundValue = v;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return foundValue;\\n\\t\\t },\\n\\t\\t forEach: function(sideEffect, context) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\\n\\t\\t },\\n\\t\\t join: function(separator) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t separator = separator !== undefined ? '' + separator : ',';\\n\\t\\t var joined = '';\\n\\t\\t var isFirst = true;\\n\\t\\t this.__iterate((function(v) {\\n\\t\\t isFirst ? (isFirst = false) : (joined += separator);\\n\\t\\t joined += v !== null && v !== undefined ? v : '';\\n\\t\\t }));\\n\\t\\t return joined;\\n\\t\\t },\\n\\t\\t keys: function() {\\n\\t\\t return this.__iterator(ITERATE_KEYS);\\n\\t\\t },\\n\\t\\t map: function(mapper, context) {\\n\\t\\t return reify(this, mapFactory(this, mapper, context));\\n\\t\\t },\\n\\t\\t reduce: function(reducer, initialReduction, context) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var reduction;\\n\\t\\t var useFirst;\\n\\t\\t if (arguments.length < 2) {\\n\\t\\t useFirst = true;\\n\\t\\t } else {\\n\\t\\t reduction = initialReduction;\\n\\t\\t }\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (useFirst) {\\n\\t\\t useFirst = false;\\n\\t\\t reduction = v;\\n\\t\\t } else {\\n\\t\\t reduction = reducer.call(context, reduction, v, k, c);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return reduction;\\n\\t\\t },\\n\\t\\t reduceRight: function(reducer, initialReduction, context) {\\n\\t\\t var reversed = this.toKeyedSeq().reverse();\\n\\t\\t return reversed.reduce.apply(reversed, arguments);\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t return reify(this, reverseFactory(this, true));\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t if (wholeSlice(begin, end, this.size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t\\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\\n\\t\\t return this.toSeq().cacheResult().slice(begin, end);\\n\\t\\t }\\n\\t\\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\\n\\t\\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\\n\\t\\t },\\n\\t\\t some: function(predicate, context) {\\n\\t\\t return !this.every(not(predicate), context);\\n\\t\\t },\\n\\t\\t sort: function(comparator) {\\n\\t\\t return reify(this, sortFactory(this, comparator));\\n\\t\\t },\\n\\t\\t values: function() {\\n\\t\\t return this.__iterator(ITERATE_VALUES);\\n\\t\\t },\\n\\t\\t butLast: function() {\\n\\t\\t return this.slice(0, -1);\\n\\t\\t },\\n\\t\\t count: function(predicate, context) {\\n\\t\\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\\n\\t\\t },\\n\\t\\t countBy: function(grouper, context) {\\n\\t\\t return countByFactory(this, grouper, context);\\n\\t\\t },\\n\\t\\t equals: function(other) {\\n\\t\\t return deepEqual(this, other);\\n\\t\\t },\\n\\t\\t entrySeq: function() {\\n\\t\\t var iterable = this;\\n\\t\\t if (iterable._cache) {\\n\\t\\t return new ArraySeq(iterable._cache);\\n\\t\\t }\\n\\t\\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\\n\\t\\t entriesSequence.fromEntrySeq = (function() {\\n\\t\\t return iterable.toSeq();\\n\\t\\t });\\n\\t\\t return entriesSequence;\\n\\t\\t },\\n\\t\\t filterNot: function(predicate, context) {\\n\\t\\t return this.filter(not(predicate), context);\\n\\t\\t },\\n\\t\\t findLast: function(predicate, context, notSetValue) {\\n\\t\\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\\n\\t\\t },\\n\\t\\t first: function() {\\n\\t\\t return this.find(returnTrue);\\n\\t\\t },\\n\\t\\t flatMap: function(mapper, context) {\\n\\t\\t return reify(this, flatMapFactory(this, mapper, context));\\n\\t\\t },\\n\\t\\t flatten: function(depth) {\\n\\t\\t return reify(this, flattenFactory(this, depth, true));\\n\\t\\t },\\n\\t\\t fromEntrySeq: function() {\\n\\t\\t return new FromEntriesSequence(this);\\n\\t\\t },\\n\\t\\t get: function(searchKey, notSetValue) {\\n\\t\\t return this.find((function(_, key) {\\n\\t\\t return is(key, searchKey);\\n\\t\\t }), undefined, notSetValue);\\n\\t\\t },\\n\\t\\t getIn: function(searchKeyPath, notSetValue) {\\n\\t\\t var nested = this;\\n\\t\\t if (searchKeyPath) {\\n\\t\\t var iter = getIterator(searchKeyPath) || getIterator($Iterable(searchKeyPath));\\n\\t\\t var step;\\n\\t\\t while (!(step = iter.next()).done) {\\n\\t\\t var key = step.value;\\n\\t\\t nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\\n\\t\\t if (nested === NOT_SET) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return nested;\\n\\t\\t },\\n\\t\\t groupBy: function(grouper, context) {\\n\\t\\t return groupByFactory(this, grouper, context);\\n\\t\\t },\\n\\t\\t has: function(searchKey) {\\n\\t\\t return this.get(searchKey, NOT_SET) !== NOT_SET;\\n\\t\\t },\\n\\t\\t hasIn: function(searchKeyPath) {\\n\\t\\t return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\\n\\t\\t },\\n\\t\\t isSubset: function(iter) {\\n\\t\\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\\n\\t\\t return this.every((function(value) {\\n\\t\\t return iter.contains(value);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t isSuperset: function(iter) {\\n\\t\\t return iter.isSubset(this);\\n\\t\\t },\\n\\t\\t keySeq: function() {\\n\\t\\t return this.toSeq().map(keyMapper).toIndexedSeq();\\n\\t\\t },\\n\\t\\t last: function() {\\n\\t\\t return this.toSeq().reverse().first();\\n\\t\\t },\\n\\t\\t max: function(comparator) {\\n\\t\\t return maxFactory(this, comparator);\\n\\t\\t },\\n\\t\\t maxBy: function(mapper, comparator) {\\n\\t\\t return maxFactory(this, comparator, mapper);\\n\\t\\t },\\n\\t\\t min: function(comparator) {\\n\\t\\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\\n\\t\\t },\\n\\t\\t minBy: function(mapper, comparator) {\\n\\t\\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\\n\\t\\t },\\n\\t\\t rest: function() {\\n\\t\\t return this.slice(1);\\n\\t\\t },\\n\\t\\t skip: function(amount) {\\n\\t\\t return reify(this, skipFactory(this, amount, true));\\n\\t\\t },\\n\\t\\t skipLast: function(amount) {\\n\\t\\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\\n\\t\\t },\\n\\t\\t skipWhile: function(predicate, context) {\\n\\t\\t return reify(this, skipWhileFactory(this, predicate, context, true));\\n\\t\\t },\\n\\t\\t skipUntil: function(predicate, context) {\\n\\t\\t return this.skipWhile(not(predicate), context);\\n\\t\\t },\\n\\t\\t sortBy: function(mapper, comparator) {\\n\\t\\t return reify(this, sortFactory(this, comparator, mapper));\\n\\t\\t },\\n\\t\\t take: function(amount) {\\n\\t\\t return reify(this, takeFactory(this, amount));\\n\\t\\t },\\n\\t\\t takeLast: function(amount) {\\n\\t\\t return reify(this, this.toSeq().reverse().take(amount).reverse());\\n\\t\\t },\\n\\t\\t takeWhile: function(predicate, context) {\\n\\t\\t return reify(this, takeWhileFactory(this, predicate, context));\\n\\t\\t },\\n\\t\\t takeUntil: function(predicate, context) {\\n\\t\\t return this.takeWhile(not(predicate), context);\\n\\t\\t },\\n\\t\\t valueSeq: function() {\\n\\t\\t return this.toIndexedSeq();\\n\\t\\t },\\n\\t\\t hashCode: function() {\\n\\t\\t return this.__hash || (this.__hash = hashIterable(this));\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\\n\\t\\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\\n\\t\\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\\n\\t\\tvar IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\\n\\t\\tvar IterablePrototype = Iterable.prototype;\\n\\t\\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\\n\\t\\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\\n\\t\\tIterablePrototype.toJSON = IterablePrototype.toJS;\\n\\t\\tIterablePrototype.__toJS = IterablePrototype.toArray;\\n\\t\\tIterablePrototype.__toStringMapper = quoteString;\\n\\t\\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\\n\\t\\t return this.toString();\\n\\t\\t};\\n\\t\\tIterablePrototype.chain = IterablePrototype.flatMap;\\n\\t\\t(function() {\\n\\t\\t try {\\n\\t\\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\\n\\t\\t if (!Iterable.noLengthWarning) {\\n\\t\\t var stack;\\n\\t\\t try {\\n\\t\\t throw new Error();\\n\\t\\t } catch (error) {\\n\\t\\t stack = error.stack;\\n\\t\\t }\\n\\t\\t if (stack.indexOf('_wrapObject') === -1) {\\n\\t\\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\\n\\t\\t return this.size;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }});\\n\\t\\t } catch (e) {}\\n\\t\\t})();\\n\\t\\tvar KeyedIterable = function KeyedIterable(value) {\\n\\t\\t return isKeyed(value) ? value : KeyedSeq(value);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(KeyedIterable, {\\n\\t\\t flip: function() {\\n\\t\\t return reify(this, flipFactory(this));\\n\\t\\t },\\n\\t\\t findKey: function(predicate, context) {\\n\\t\\t var foundKey;\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (predicate.call(context, v, k, c)) {\\n\\t\\t foundKey = k;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return foundKey;\\n\\t\\t },\\n\\t\\t findLastKey: function(predicate, context) {\\n\\t\\t return this.toSeq().reverse().findKey(predicate, context);\\n\\t\\t },\\n\\t\\t keyOf: function(searchValue) {\\n\\t\\t return this.findKey((function(value) {\\n\\t\\t return is(value, searchValue);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t lastKeyOf: function(searchValue) {\\n\\t\\t return this.toSeq().reverse().keyOf(searchValue);\\n\\t\\t },\\n\\t\\t mapEntries: function(mapper, context) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t return reify(this, this.toSeq().map((function(v, k) {\\n\\t\\t return mapper.call(context, [k, v], iterations++, $__0);\\n\\t\\t })).fromEntrySeq());\\n\\t\\t },\\n\\t\\t mapKeys: function(mapper, context) {\\n\\t\\t var $__0 = this;\\n\\t\\t return reify(this, this.toSeq().flip().map((function(k, v) {\\n\\t\\t return mapper.call(context, k, v, $__0);\\n\\t\\t })).flip());\\n\\t\\t }\\n\\t\\t}, {}, Iterable);\\n\\t\\tvar KeyedIterablePrototype = KeyedIterable.prototype;\\n\\t\\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\\n\\t\\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\\n\\t\\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\\n\\t\\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\\n\\t\\t return k + ': ' + quoteString(v);\\n\\t\\t});\\n\\t\\tvar IndexedIterable = function IndexedIterable(value) {\\n\\t\\t return isIndexed(value) ? value : IndexedSeq(value);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(IndexedIterable, {\\n\\t\\t toKeyedSeq: function() {\\n\\t\\t return new ToKeyedSequence(this, false);\\n\\t\\t },\\n\\t\\t filter: function(predicate, context) {\\n\\t\\t return reify(this, filterFactory(this, predicate, context, false));\\n\\t\\t },\\n\\t\\t findIndex: function(predicate, context) {\\n\\t\\t var key = this.toKeyedSeq().findKey(predicate, context);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t indexOf: function(searchValue) {\\n\\t\\t var key = this.toKeyedSeq().keyOf(searchValue);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t lastIndexOf: function(searchValue) {\\n\\t\\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t return reify(this, reverseFactory(this, false));\\n\\t\\t },\\n\\t\\t splice: function(index, removeNum) {\\n\\t\\t var numArgs = arguments.length;\\n\\t\\t removeNum = Math.max(removeNum | 0, 0);\\n\\t\\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t index = resolveBegin(index, this.size);\\n\\t\\t var spliced = this.slice(0, index);\\n\\t\\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\\n\\t\\t },\\n\\t\\t findLastIndex: function(predicate, context) {\\n\\t\\t var key = this.toKeyedSeq().findLastKey(predicate, context);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t first: function() {\\n\\t\\t return this.get(0);\\n\\t\\t },\\n\\t\\t flatten: function(depth) {\\n\\t\\t return reify(this, flattenFactory(this, depth, false));\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\\n\\t\\t return key === index;\\n\\t\\t }), undefined, notSetValue);\\n\\t\\t },\\n\\t\\t has: function(index) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\\n\\t\\t },\\n\\t\\t interpose: function(separator) {\\n\\t\\t return reify(this, interposeFactory(this, separator));\\n\\t\\t },\\n\\t\\t last: function() {\\n\\t\\t return this.get(-1);\\n\\t\\t },\\n\\t\\t skip: function(amount) {\\n\\t\\t var iter = this;\\n\\t\\t var skipSeq = skipFactory(iter, amount, false);\\n\\t\\t if (isSeq(iter) && skipSeq !== iter) {\\n\\t\\t skipSeq.get = function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\\n\\t\\t };\\n\\t\\t }\\n\\t\\t return reify(this, skipSeq);\\n\\t\\t },\\n\\t\\t skipWhile: function(predicate, context) {\\n\\t\\t return reify(this, skipWhileFactory(this, predicate, context, false));\\n\\t\\t },\\n\\t\\t take: function(amount) {\\n\\t\\t var iter = this;\\n\\t\\t var takeSeq = takeFactory(iter, amount);\\n\\t\\t if (isSeq(iter) && takeSeq !== iter) {\\n\\t\\t takeSeq.get = function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\\n\\t\\t };\\n\\t\\t }\\n\\t\\t return reify(this, takeSeq);\\n\\t\\t }\\n\\t\\t}, {}, Iterable);\\n\\t\\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\\n\\t\\tIndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tvar SetIterable = function SetIterable(value) {\\n\\t\\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(SetIterable, {\\n\\t\\t get: function(value, notSetValue) {\\n\\t\\t return this.has(value) ? value : notSetValue;\\n\\t\\t },\\n\\t\\t contains: function(value) {\\n\\t\\t return this.has(value);\\n\\t\\t },\\n\\t\\t keySeq: function() {\\n\\t\\t return this.valueSeq();\\n\\t\\t }\\n\\t\\t}, {}, Iterable);\\n\\t\\tSetIterable.prototype.has = IterablePrototype.contains;\\n\\t\\tfunction isIterable(maybeIterable) {\\n\\t\\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\\n\\t\\t}\\n\\t\\tfunction isKeyed(maybeKeyed) {\\n\\t\\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\\n\\t\\t}\\n\\t\\tfunction isIndexed(maybeIndexed) {\\n\\t\\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\\n\\t\\t}\\n\\t\\tfunction isAssociative(maybeAssociative) {\\n\\t\\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\\n\\t\\t}\\n\\t\\tfunction isOrdered(maybeOrdered) {\\n\\t\\t return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\\n\\t\\t}\\n\\t\\tIterable.isIterable = isIterable;\\n\\t\\tIterable.isKeyed = isKeyed;\\n\\t\\tIterable.isIndexed = isIndexed;\\n\\t\\tIterable.isAssociative = isAssociative;\\n\\t\\tIterable.isOrdered = isOrdered;\\n\\t\\tIterable.Keyed = KeyedIterable;\\n\\t\\tIterable.Indexed = IndexedIterable;\\n\\t\\tIterable.Set = SetIterable;\\n\\t\\tIterable.Iterator = Iterator;\\n\\t\\tfunction keyMapper(v, k) {\\n\\t\\t return k;\\n\\t\\t}\\n\\t\\tfunction entryMapper(v, k) {\\n\\t\\t return [k, v];\\n\\t\\t}\\n\\t\\tfunction not(predicate) {\\n\\t\\t return function() {\\n\\t\\t return !predicate.apply(this, arguments);\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction neg(predicate) {\\n\\t\\t return function() {\\n\\t\\t return -predicate.apply(this, arguments);\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction quoteString(value) {\\n\\t\\t return typeof value === 'string' ? JSON.stringify(value) : value;\\n\\t\\t}\\n\\t\\tfunction defaultNegComparator(a, b) {\\n\\t\\t return a < b ? 1 : a > b ? -1 : 0;\\n\\t\\t}\\n\\t\\tfunction deepEqual(a, b) {\\n\\t\\t if (a === b) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t if (!isIterable(b) || a.size !== undefined && b.size !== undefined && a.size !== b.size || a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash || isKeyed(a) !== isKeyed(b) || isIndexed(a) !== isIndexed(b) || isOrdered(a) !== isOrdered(b)) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t if (a.size === 0 && b.size === 0) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t var notAssociative = !isAssociative(a);\\n\\t\\t if (isOrdered(a)) {\\n\\t\\t var entries = a.entries();\\n\\t\\t return b.every((function(v, k) {\\n\\t\\t var entry = entries.next().value;\\n\\t\\t return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\\n\\t\\t })) && entries.next().done;\\n\\t\\t }\\n\\t\\t var flipped = false;\\n\\t\\t if (a.size === undefined) {\\n\\t\\t if (b.size === undefined) {\\n\\t\\t a.cacheResult();\\n\\t\\t } else {\\n\\t\\t flipped = true;\\n\\t\\t var _ = a;\\n\\t\\t a = b;\\n\\t\\t b = _;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var allEqual = true;\\n\\t\\t var bSize = b.__iterate((function(v, k) {\\n\\t\\t if (notAssociative ? !a.has(v) : flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\\n\\t\\t allEqual = false;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return allEqual && a.size === bSize;\\n\\t\\t}\\n\\t\\tfunction hashIterable(iterable) {\\n\\t\\t if (iterable.size === Infinity) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t var ordered = isOrdered(iterable);\\n\\t\\t var keyed = isKeyed(iterable);\\n\\t\\t var h = ordered ? 1 : 0;\\n\\t\\t var size = iterable.__iterate(keyed ? ordered ? (function(v, k) {\\n\\t\\t h = 31 * h + hashMerge(hash(v), hash(k)) | 0;\\n\\t\\t }) : (function(v, k) {\\n\\t\\t h = h + hashMerge(hash(v), hash(k)) | 0;\\n\\t\\t }) : ordered ? (function(v) {\\n\\t\\t h = 31 * h + hash(v) | 0;\\n\\t\\t }) : (function(v) {\\n\\t\\t h = h + hash(v) | 0;\\n\\t\\t }));\\n\\t\\t return murmurHashOfSize(size, h);\\n\\t\\t}\\n\\t\\tfunction murmurHashOfSize(size, h) {\\n\\t\\t h = imul(h, 0xCC9E2D51);\\n\\t\\t h = imul(h << 15 | h >>> -15, 0x1B873593);\\n\\t\\t h = imul(h << 13 | h >>> -13, 5);\\n\\t\\t h = (h + 0xE6546B64 | 0) ^ size;\\n\\t\\t h = imul(h ^ h >>> 16, 0x85EBCA6B);\\n\\t\\t h = imul(h ^ h >>> 13, 0xC2B2AE35);\\n\\t\\t h = smi(h ^ h >>> 16);\\n\\t\\t return h;\\n\\t\\t}\\n\\t\\tfunction hashMerge(a, b) {\\n\\t\\t return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0;\\n\\t\\t}\\n\\t\\tfunction mixin(ctor, methods) {\\n\\t\\t var proto = ctor.prototype;\\n\\t\\t var keyCopier = (function(key) {\\n\\t\\t proto[key] = methods[key];\\n\\t\\t });\\n\\t\\t Object.keys(methods).forEach(keyCopier);\\n\\t\\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\\n\\t\\t return ctor;\\n\\t\\t}\\n\\t\\tvar Seq = function Seq(value) {\\n\\t\\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\\n\\t\\t};\\n\\t\\tvar $Seq = Seq;\\n\\t\\t($traceurRuntime.createClass)(Seq, {\\n\\t\\t toSeq: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Seq {', '}');\\n\\t\\t },\\n\\t\\t cacheResult: function() {\\n\\t\\t if (!this._cache && this.__iterateUncached) {\\n\\t\\t this._cache = this.entrySeq().toArray();\\n\\t\\t this.size = this._cache.length;\\n\\t\\t }\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t return seqIterate(this, fn, reverse, true);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return seqIterator(this, type, reverse, true);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return $Seq(arguments);\\n\\t\\t }}, Iterable);\\n\\t\\tvar KeyedSeq = function KeyedSeq(value) {\\n\\t\\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\\n\\t\\t};\\n\\t\\tvar $KeyedSeq = KeyedSeq;\\n\\t\\t($traceurRuntime.createClass)(KeyedSeq, {\\n\\t\\t toKeyedSeq: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t toSeq: function() {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return $KeyedSeq(arguments);\\n\\t\\t }}, Seq);\\n\\t\\tmixin(KeyedSeq, KeyedIterable.prototype);\\n\\t\\tvar IndexedSeq = function IndexedSeq(value) {\\n\\t\\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\\n\\t\\t};\\n\\t\\tvar $IndexedSeq = IndexedSeq;\\n\\t\\t($traceurRuntime.createClass)(IndexedSeq, {\\n\\t\\t toIndexedSeq: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Seq [', ']');\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t return seqIterate(this, fn, reverse, false);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return seqIterator(this, type, reverse, false);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return $IndexedSeq(arguments);\\n\\t\\t }}, Seq);\\n\\t\\tmixin(IndexedSeq, IndexedIterable.prototype);\\n\\t\\tvar SetSeq = function SetSeq(value) {\\n\\t\\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\\n\\t\\t};\\n\\t\\tvar $SetSeq = SetSeq;\\n\\t\\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\\n\\t\\t return this;\\n\\t\\t }}, {of: function() {\\n\\t\\t return $SetSeq(arguments);\\n\\t\\t }}, Seq);\\n\\t\\tmixin(SetSeq, SetIterable.prototype);\\n\\t\\tSeq.isSeq = isSeq;\\n\\t\\tSeq.Keyed = KeyedSeq;\\n\\t\\tSeq.Set = SetSeq;\\n\\t\\tSeq.Indexed = IndexedSeq;\\n\\t\\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\\n\\t\\tSeq.prototype[IS_SEQ_SENTINEL] = true;\\n\\t\\tvar ArraySeq = function ArraySeq(array) {\\n\\t\\t this._array = array;\\n\\t\\t this.size = array.length;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ArraySeq, {\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var array = this._array;\\n\\t\\t var maxIndex = array.length - 1;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var array = this._array;\\n\\t\\t var maxIndex = array.length - 1;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar ObjectSeq = function ObjectSeq(object) {\\n\\t\\t var keys = Object.keys(object);\\n\\t\\t this._object = object;\\n\\t\\t this._keys = keys;\\n\\t\\t this.size = keys.length;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ObjectSeq, {\\n\\t\\t get: function(key, notSetValue) {\\n\\t\\t if (notSetValue !== undefined && !this.has(key)) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t return this._object[key];\\n\\t\\t },\\n\\t\\t has: function(key) {\\n\\t\\t return this._object.hasOwnProperty(key);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var object = this._object;\\n\\t\\t var keys = this._keys;\\n\\t\\t var maxIndex = keys.length - 1;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t\\t if (fn(object[key], key, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var object = this._object;\\n\\t\\t var keys = this._keys;\\n\\t\\t var maxIndex = keys.length - 1;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, KeyedSeq);\\n\\t\\tObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tvar IterableSeq = function IterableSeq(iterable) {\\n\\t\\t this._iterable = iterable;\\n\\t\\t this.size = iterable.length || iterable.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(IterableSeq, {\\n\\t\\t __iterateUncached: function(fn, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterable = this._iterable;\\n\\t\\t var iterator = getIterator(iterable);\\n\\t\\t var iterations = 0;\\n\\t\\t if (isIterator(iterator)) {\\n\\t\\t var step;\\n\\t\\t while (!(step = iterator.next()).done) {\\n\\t\\t if (fn(step.value, iterations++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __iteratorUncached: function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterable = this._iterable;\\n\\t\\t var iterator = getIterator(iterable);\\n\\t\\t if (!isIterator(iterator)) {\\n\\t\\t return new Iterator(iteratorDone);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, iterations++, step.value);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar IteratorSeq = function IteratorSeq(iterator) {\\n\\t\\t this._iterator = iterator;\\n\\t\\t this._iteratorCache = [];\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(IteratorSeq, {\\n\\t\\t __iterateUncached: function(fn, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterator = this._iterator;\\n\\t\\t var cache = this._iteratorCache;\\n\\t\\t var iterations = 0;\\n\\t\\t while (iterations < cache.length) {\\n\\t\\t if (fn(cache[iterations], iterations++, this) === false) {\\n\\t\\t return iterations;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var step;\\n\\t\\t while (!(step = iterator.next()).done) {\\n\\t\\t var val = step.value;\\n\\t\\t cache[iterations] = val;\\n\\t\\t if (fn(val, iterations++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __iteratorUncached: function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = this._iterator;\\n\\t\\t var cache = this._iteratorCache;\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (iterations >= cache.length) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t cache[iterations] = step.value;\\n\\t\\t }\\n\\t\\t return iteratorValue(type, iterations, cache[iterations++]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tfunction isSeq(maybeSeq) {\\n\\t\\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\\n\\t\\t}\\n\\t\\tvar EMPTY_SEQ;\\n\\t\\tfunction emptySequence() {\\n\\t\\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\\n\\t\\t}\\n\\t\\tfunction keyedSeqFromValue(value) {\\n\\t\\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\\n\\t\\t if (!seq) {\\n\\t\\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\\n\\t\\t }\\n\\t\\t return seq;\\n\\t\\t}\\n\\t\\tfunction indexedSeqFromValue(value) {\\n\\t\\t var seq = maybeIndexedSeqFromValue(value);\\n\\t\\t if (!seq) {\\n\\t\\t throw new TypeError('Expected Array or iterable object of values: ' + value);\\n\\t\\t }\\n\\t\\t return seq;\\n\\t\\t}\\n\\t\\tfunction seqFromValue(value) {\\n\\t\\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\\n\\t\\t if (!seq) {\\n\\t\\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\\n\\t\\t }\\n\\t\\t return seq;\\n\\t\\t}\\n\\t\\tfunction maybeIndexedSeqFromValue(value) {\\n\\t\\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\\n\\t\\t}\\n\\t\\tfunction isArrayLike(value) {\\n\\t\\t return value && typeof value.length === 'number';\\n\\t\\t}\\n\\t\\tfunction seqIterate(seq, fn, reverse, useKeys) {\\n\\t\\t var cache = seq._cache;\\n\\t\\t if (cache) {\\n\\t\\t var maxIndex = cache.length - 1;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t\\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t }\\n\\t\\t return seq.__iterateUncached(fn, reverse);\\n\\t\\t}\\n\\t\\tfunction seqIterator(seq, type, reverse, useKeys) {\\n\\t\\t var cache = seq._cache;\\n\\t\\t if (cache) {\\n\\t\\t var maxIndex = cache.length - 1;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t return seq.__iteratorUncached(type, reverse);\\n\\t\\t}\\n\\t\\tfunction fromJS(json, converter) {\\n\\t\\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\\n\\t\\t}\\n\\t\\tfunction _fromJSWith(converter, json, key, parentJSON) {\\n\\t\\t if (Array.isArray(json)) {\\n\\t\\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\\n\\t\\t return _fromJSWith(converter, v, k, json);\\n\\t\\t })));\\n\\t\\t }\\n\\t\\t if (isPlainObj(json)) {\\n\\t\\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\\n\\t\\t return _fromJSWith(converter, v, k, json);\\n\\t\\t })));\\n\\t\\t }\\n\\t\\t return json;\\n\\t\\t}\\n\\t\\tfunction _fromJSDefault(json) {\\n\\t\\t if (Array.isArray(json)) {\\n\\t\\t return IndexedSeq(json).map(_fromJSDefault).toList();\\n\\t\\t }\\n\\t\\t if (isPlainObj(json)) {\\n\\t\\t return KeyedSeq(json).map(_fromJSDefault).toMap();\\n\\t\\t }\\n\\t\\t return json;\\n\\t\\t}\\n\\t\\tfunction isPlainObj(value) {\\n\\t\\t return value && value.constructor === Object;\\n\\t\\t}\\n\\t\\tvar Collection = function Collection() {\\n\\t\\t throw TypeError('Abstract');\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\\n\\t\\tvar KeyedCollection = function KeyedCollection() {\\n\\t\\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\\n\\t\\t};\\n\\t\\tvar $KeyedCollection = KeyedCollection;\\n\\t\\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\\n\\t\\tmixin(KeyedCollection, KeyedIterable.prototype);\\n\\t\\tvar IndexedCollection = function IndexedCollection() {\\n\\t\\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\\n\\t\\t};\\n\\t\\tvar $IndexedCollection = IndexedCollection;\\n\\t\\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\\n\\t\\tmixin(IndexedCollection, IndexedIterable.prototype);\\n\\t\\tvar SetCollection = function SetCollection() {\\n\\t\\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\\n\\t\\t};\\n\\t\\tvar $SetCollection = SetCollection;\\n\\t\\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\\n\\t\\tmixin(SetCollection, SetIterable.prototype);\\n\\t\\tCollection.Keyed = KeyedCollection;\\n\\t\\tCollection.Indexed = IndexedCollection;\\n\\t\\tCollection.Set = SetCollection;\\n\\t\\tvar Map = function Map(value) {\\n\\t\\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().withMutations((function(map) {\\n\\t\\t var iter = KeyedIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v, k) {\\n\\t\\t return map.set(k, v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Map, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Map {', '}');\\n\\t\\t },\\n\\t\\t get: function(k, notSetValue) {\\n\\t\\t return this._root ? this._root.get(0, undefined, k, notSetValue) : notSetValue;\\n\\t\\t },\\n\\t\\t set: function(k, v) {\\n\\t\\t return updateMap(this, k, v);\\n\\t\\t },\\n\\t\\t setIn: function(keyPath, v) {\\n\\t\\t return this.updateIn(keyPath, NOT_SET, (function() {\\n\\t\\t return v;\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t remove: function(k) {\\n\\t\\t return updateMap(this, k, NOT_SET);\\n\\t\\t },\\n\\t\\t deleteIn: function(keyPath) {\\n\\t\\t return this.updateIn(keyPath, (function() {\\n\\t\\t return NOT_SET;\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t update: function(k, notSetValue, updater) {\\n\\t\\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\\n\\t\\t },\\n\\t\\t updateIn: function(keyPath, notSetValue, updater) {\\n\\t\\t if (!updater) {\\n\\t\\t updater = notSetValue;\\n\\t\\t notSetValue = undefined;\\n\\t\\t }\\n\\t\\t var updatedValue = updateInDeepMap(this, getIterator(keyPath) || getIterator(Iterable(keyPath)), notSetValue, updater);\\n\\t\\t return updatedValue === NOT_SET ? undefined : updatedValue;\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = 0;\\n\\t\\t this._root = null;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyMap();\\n\\t\\t },\\n\\t\\t merge: function() {\\n\\t\\t return mergeIntoMapWith(this, undefined, arguments);\\n\\t\\t },\\n\\t\\t mergeWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__3 = 1; $__3 < arguments.length; $__3++)\\n\\t\\t iters[$__3 - 1] = arguments[$__3];\\n\\t\\t return mergeIntoMapWith(this, merger, iters);\\n\\t\\t },\\n\\t\\t mergeIn: function(keyPath) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__4 = 1; $__4 < arguments.length; $__4++)\\n\\t\\t iters[$__4 - 1] = arguments[$__4];\\n\\t\\t return this.updateIn(keyPath, emptyMap(), (function(m) {\\n\\t\\t return m.merge.apply(m, iters);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t mergeDeep: function() {\\n\\t\\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\\n\\t\\t },\\n\\t\\t mergeDeepWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__5 = 1; $__5 < arguments.length; $__5++)\\n\\t\\t iters[$__5 - 1] = arguments[$__5];\\n\\t\\t return mergeIntoMapWith(this, deepMerger(merger), iters);\\n\\t\\t },\\n\\t\\t mergeDeepIn: function(keyPath) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__6 = 1; $__6 < arguments.length; $__6++)\\n\\t\\t iters[$__6 - 1] = arguments[$__6];\\n\\t\\t return this.updateIn(keyPath, emptyMap(), (function(m) {\\n\\t\\t return m.mergeDeep.apply(m, iters);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t sort: function(comparator) {\\n\\t\\t return OrderedMap(sortFactory(this, comparator));\\n\\t\\t },\\n\\t\\t sortBy: function(mapper, comparator) {\\n\\t\\t return OrderedMap(sortFactory(this, comparator, mapper));\\n\\t\\t },\\n\\t\\t withMutations: function(fn) {\\n\\t\\t var mutable = this.asMutable();\\n\\t\\t fn(mutable);\\n\\t\\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\\n\\t\\t },\\n\\t\\t asMutable: function() {\\n\\t\\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\\n\\t\\t },\\n\\t\\t asImmutable: function() {\\n\\t\\t return this.__ensureOwner();\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this.__altered;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return new MapIterator(this, type, reverse);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t this._root && this._root.iterate((function(entry) {\\n\\t\\t iterations++;\\n\\t\\t return fn(entry[1], entry[0], $__0);\\n\\t\\t }), reverse);\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this.__altered = false;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeMap(this.size, this._root, ownerID, this.__hash);\\n\\t\\t }\\n\\t\\t}, {}, KeyedCollection);\\n\\t\\tfunction isMap(maybeMap) {\\n\\t\\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\\n\\t\\t}\\n\\t\\tMap.isMap = isMap;\\n\\t\\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\\n\\t\\tvar MapPrototype = Map.prototype;\\n\\t\\tMapPrototype[IS_MAP_SENTINEL] = true;\\n\\t\\tMapPrototype[DELETE] = MapPrototype.remove;\\n\\t\\tMapPrototype.removeIn = MapPrototype.deleteIn;\\n\\t\\tvar ArrayMapNode = function ArrayMapNode(ownerID, entries) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.entries = entries;\\n\\t\\t};\\n\\t\\tvar $ArrayMapNode = ArrayMapNode;\\n\\t\\t($traceurRuntime.createClass)(ArrayMapNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t var entries = this.entries;\\n\\t\\t for (var ii = 0,\\n\\t\\t len = entries.length; ii < len; ii++) {\\n\\t\\t if (is(key, entries[ii][0])) {\\n\\t\\t return entries[ii][1];\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t var entries = this.entries;\\n\\t\\t var idx = 0;\\n\\t\\t for (var len = entries.length; idx < len; idx++) {\\n\\t\\t if (is(key, entries[idx][0])) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var exists = idx < len;\\n\\t\\t if (exists ? entries[idx][1] === value : removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t (removed || !exists) && SetRef(didChangeSize);\\n\\t\\t if (removed && entries.length === 1) {\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\\n\\t\\t return createNodes(ownerID, entries, key, value);\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newEntries = isEditable ? entries : arrCopy(entries);\\n\\t\\t if (exists) {\\n\\t\\t if (removed) {\\n\\t\\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\\n\\t\\t } else {\\n\\t\\t newEntries[idx] = [key, value];\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t newEntries.push([key, value]);\\n\\t\\t }\\n\\t\\t if (isEditable) {\\n\\t\\t this.entries = newEntries;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $ArrayMapNode(ownerID, newEntries);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.bitmap = bitmap;\\n\\t\\t this.nodes = nodes;\\n\\t\\t};\\n\\t\\tvar $BitmapIndexedNode = BitmapIndexedNode;\\n\\t\\t($traceurRuntime.createClass)(BitmapIndexedNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\\n\\t\\t var bitmap = this.bitmap;\\n\\t\\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var bit = 1 << keyHashFrag;\\n\\t\\t var bitmap = this.bitmap;\\n\\t\\t var exists = (bitmap & bit) !== 0;\\n\\t\\t if (!exists && value === NOT_SET) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var idx = popCount(bitmap & (bit - 1));\\n\\t\\t var nodes = this.nodes;\\n\\t\\t var node = exists ? nodes[idx] : undefined;\\n\\t\\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\\n\\t\\t if (newNode === node) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\\n\\t\\t return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\\n\\t\\t }\\n\\t\\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\\n\\t\\t return nodes[idx ^ 1];\\n\\t\\t }\\n\\t\\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\\n\\t\\t return newNode;\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\\n\\t\\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\\n\\t\\t if (isEditable) {\\n\\t\\t this.bitmap = newBitmap;\\n\\t\\t this.nodes = newNodes;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar HashArrayMapNode = function HashArrayMapNode(ownerID, count, nodes) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.count = count;\\n\\t\\t this.nodes = nodes;\\n\\t\\t};\\n\\t\\tvar $HashArrayMapNode = HashArrayMapNode;\\n\\t\\t($traceurRuntime.createClass)(HashArrayMapNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var node = this.nodes[idx];\\n\\t\\t return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t var nodes = this.nodes;\\n\\t\\t var node = nodes[idx];\\n\\t\\t if (removed && !node) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\\n\\t\\t if (newNode === node) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newCount = this.count;\\n\\t\\t if (!node) {\\n\\t\\t newCount++;\\n\\t\\t } else if (!newNode) {\\n\\t\\t newCount--;\\n\\t\\t if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\\n\\t\\t return packNodes(ownerID, nodes, newCount, idx);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newNodes = setIn(nodes, idx, newNode, isEditable);\\n\\t\\t if (isEditable) {\\n\\t\\t this.count = newCount;\\n\\t\\t this.nodes = newNodes;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $HashArrayMapNode(ownerID, newCount, newNodes);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar HashCollisionNode = function HashCollisionNode(ownerID, keyHash, entries) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.keyHash = keyHash;\\n\\t\\t this.entries = entries;\\n\\t\\t};\\n\\t\\tvar $HashCollisionNode = HashCollisionNode;\\n\\t\\t($traceurRuntime.createClass)(HashCollisionNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t var entries = this.entries;\\n\\t\\t for (var ii = 0,\\n\\t\\t len = entries.length; ii < len; ii++) {\\n\\t\\t if (is(key, entries[ii][0])) {\\n\\t\\t return entries[ii][1];\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t if (keyHash !== this.keyHash) {\\n\\t\\t if (removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\\n\\t\\t }\\n\\t\\t var entries = this.entries;\\n\\t\\t var idx = 0;\\n\\t\\t for (var len = entries.length; idx < len; idx++) {\\n\\t\\t if (is(key, entries[idx][0])) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var exists = idx < len;\\n\\t\\t if (exists ? entries[idx][1] === value : removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t (removed || !exists) && SetRef(didChangeSize);\\n\\t\\t if (removed && len === 2) {\\n\\t\\t return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newEntries = isEditable ? entries : arrCopy(entries);\\n\\t\\t if (exists) {\\n\\t\\t if (removed) {\\n\\t\\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\\n\\t\\t } else {\\n\\t\\t newEntries[idx] = [key, value];\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t newEntries.push([key, value]);\\n\\t\\t }\\n\\t\\t if (isEditable) {\\n\\t\\t this.entries = newEntries;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $HashCollisionNode(ownerID, this.keyHash, newEntries);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar ValueNode = function ValueNode(ownerID, keyHash, entry) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.keyHash = keyHash;\\n\\t\\t this.entry = entry;\\n\\t\\t};\\n\\t\\tvar $ValueNode = ValueNode;\\n\\t\\t($traceurRuntime.createClass)(ValueNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t var keyMatch = is(key, this.entry[0]);\\n\\t\\t if (keyMatch ? value === this.entry[1] : removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t if (removed) {\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t if (keyMatch) {\\n\\t\\t if (ownerID && ownerID === this.ownerID) {\\n\\t\\t this.entry[1] = value;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $ValueNode(ownerID, this.keyHash, [key, value]);\\n\\t\\t }\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tArrayMapNode.prototype.iterate = HashCollisionNode.prototype.iterate = function(fn, reverse) {\\n\\t\\t var entries = this.entries;\\n\\t\\t for (var ii = 0,\\n\\t\\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\\n\\t\\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t};\\n\\t\\tBitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate = function(fn, reverse) {\\n\\t\\t var nodes = this.nodes;\\n\\t\\t for (var ii = 0,\\n\\t\\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\\n\\t\\t var node = nodes[reverse ? maxIndex - ii : ii];\\n\\t\\t if (node && node.iterate(fn, reverse) === false) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t};\\n\\t\\tValueNode.prototype.iterate = function(fn, reverse) {\\n\\t\\t return fn(this.entry);\\n\\t\\t};\\n\\t\\tvar MapIterator = function MapIterator(map, type, reverse) {\\n\\t\\t this._type = type;\\n\\t\\t this._reverse = reverse;\\n\\t\\t this._stack = map._root && mapIteratorFrame(map._root);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(MapIterator, {next: function() {\\n\\t\\t var type = this._type;\\n\\t\\t var stack = this._stack;\\n\\t\\t while (stack) {\\n\\t\\t var node = stack.node;\\n\\t\\t var index = stack.index++;\\n\\t\\t var maxIndex;\\n\\t\\t if (node.entry) {\\n\\t\\t if (index === 0) {\\n\\t\\t return mapIteratorValue(type, node.entry);\\n\\t\\t }\\n\\t\\t } else if (node.entries) {\\n\\t\\t maxIndex = node.entries.length - 1;\\n\\t\\t if (index <= maxIndex) {\\n\\t\\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t maxIndex = node.nodes.length - 1;\\n\\t\\t if (index <= maxIndex) {\\n\\t\\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\\n\\t\\t if (subNode) {\\n\\t\\t if (subNode.entry) {\\n\\t\\t return mapIteratorValue(type, subNode.entry);\\n\\t\\t }\\n\\t\\t stack = this._stack = mapIteratorFrame(subNode, stack);\\n\\t\\t }\\n\\t\\t continue;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t stack = this._stack = this._stack.__prev;\\n\\t\\t }\\n\\t\\t return iteratorDone();\\n\\t\\t }}, {}, Iterator);\\n\\t\\tfunction mapIteratorValue(type, entry) {\\n\\t\\t return iteratorValue(type, entry[0], entry[1]);\\n\\t\\t}\\n\\t\\tfunction mapIteratorFrame(node, prev) {\\n\\t\\t return {\\n\\t\\t node: node,\\n\\t\\t index: 0,\\n\\t\\t __prev: prev\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction makeMap(size, root, ownerID, hash) {\\n\\t\\t var map = Object.create(MapPrototype);\\n\\t\\t map.size = size;\\n\\t\\t map._root = root;\\n\\t\\t map.__ownerID = ownerID;\\n\\t\\t map.__hash = hash;\\n\\t\\t map.__altered = false;\\n\\t\\t return map;\\n\\t\\t}\\n\\t\\tvar EMPTY_MAP;\\n\\t\\tfunction emptyMap() {\\n\\t\\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\\n\\t\\t}\\n\\t\\tfunction updateMap(map, k, v) {\\n\\t\\t var newRoot;\\n\\t\\t var newSize;\\n\\t\\t if (!map._root) {\\n\\t\\t if (v === NOT_SET) {\\n\\t\\t return map;\\n\\t\\t }\\n\\t\\t newSize = 1;\\n\\t\\t newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\\n\\t\\t } else {\\n\\t\\t var didChangeSize = MakeRef(CHANGE_LENGTH);\\n\\t\\t var didAlter = MakeRef(DID_ALTER);\\n\\t\\t newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\\n\\t\\t if (!didAlter.value) {\\n\\t\\t return map;\\n\\t\\t }\\n\\t\\t newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\\n\\t\\t }\\n\\t\\t if (map.__ownerID) {\\n\\t\\t map.size = newSize;\\n\\t\\t map._root = newRoot;\\n\\t\\t map.__hash = undefined;\\n\\t\\t map.__altered = true;\\n\\t\\t return map;\\n\\t\\t }\\n\\t\\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\\n\\t\\t}\\n\\t\\tfunction updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (!node) {\\n\\t\\t if (value === NOT_SET) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return new ValueNode(ownerID, keyHash, [key, value]);\\n\\t\\t }\\n\\t\\t return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\\n\\t\\t}\\n\\t\\tfunction isLeafNode(node) {\\n\\t\\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\\n\\t\\t}\\n\\t\\tfunction mergeIntoNode(node, ownerID, shift, keyHash, entry) {\\n\\t\\t if (node.keyHash === keyHash) {\\n\\t\\t return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\\n\\t\\t }\\n\\t\\t var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\\n\\t\\t var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var newNode;\\n\\t\\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] : ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\\n\\t\\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\\n\\t\\t}\\n\\t\\tfunction createNodes(ownerID, entries, key, value) {\\n\\t\\t if (!ownerID) {\\n\\t\\t ownerID = new OwnerID();\\n\\t\\t }\\n\\t\\t var node = new ValueNode(ownerID, hash(key), [key, value]);\\n\\t\\t for (var ii = 0; ii < entries.length; ii++) {\\n\\t\\t var entry = entries[ii];\\n\\t\\t node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\\n\\t\\t }\\n\\t\\t return node;\\n\\t\\t}\\n\\t\\tfunction packNodes(ownerID, nodes, count, excluding) {\\n\\t\\t var bitmap = 0;\\n\\t\\t var packedII = 0;\\n\\t\\t var packedNodes = new Array(count);\\n\\t\\t for (var ii = 0,\\n\\t\\t bit = 1,\\n\\t\\t len = nodes.length; ii < len; ii++, bit <<= 1) {\\n\\t\\t var node = nodes[ii];\\n\\t\\t if (node !== undefined && ii !== excluding) {\\n\\t\\t bitmap |= bit;\\n\\t\\t packedNodes[packedII++] = node;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\\n\\t\\t}\\n\\t\\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\\n\\t\\t var count = 0;\\n\\t\\t var expandedNodes = new Array(SIZE);\\n\\t\\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\\n\\t\\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\\n\\t\\t }\\n\\t\\t expandedNodes[including] = node;\\n\\t\\t return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\\n\\t\\t}\\n\\t\\tfunction mergeIntoMapWith(map, merger, iterables) {\\n\\t\\t var iters = [];\\n\\t\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t\\t var value = iterables[ii];\\n\\t\\t var iter = KeyedIterable(value);\\n\\t\\t if (!isIterable(value)) {\\n\\t\\t iter = iter.map((function(v) {\\n\\t\\t return fromJS(v);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t iters.push(iter);\\n\\t\\t }\\n\\t\\t return mergeIntoCollectionWith(map, merger, iters);\\n\\t\\t}\\n\\t\\tfunction deepMerger(merger) {\\n\\t\\t return (function(existing, value) {\\n\\t\\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\\n\\t\\t });\\n\\t\\t}\\n\\t\\tfunction mergeIntoCollectionWith(collection, merger, iters) {\\n\\t\\t iters = iters.filter((function(x) {\\n\\t\\t return x.size !== 0;\\n\\t\\t }));\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return collection;\\n\\t\\t }\\n\\t\\t if (collection.size === 0 && iters.length === 1) {\\n\\t\\t return collection.constructor(iters[0]);\\n\\t\\t }\\n\\t\\t return collection.withMutations((function(collection) {\\n\\t\\t var mergeIntoMap = merger ? (function(value, key) {\\n\\t\\t collection.update(key, NOT_SET, (function(existing) {\\n\\t\\t return existing === NOT_SET ? value : merger(existing, value);\\n\\t\\t }));\\n\\t\\t }) : (function(value, key) {\\n\\t\\t collection.set(key, value);\\n\\t\\t });\\n\\t\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t\\t iters[ii].forEach(mergeIntoMap);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t}\\n\\t\\tfunction updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\\n\\t\\t var isNotSet = existing === NOT_SET;\\n\\t\\t var step = keyPathIter.next();\\n\\t\\t if (step.done) {\\n\\t\\t var existingValue = isNotSet ? notSetValue : existing;\\n\\t\\t var newValue = updater(existingValue);\\n\\t\\t return newValue === existingValue ? existing : newValue;\\n\\t\\t }\\n\\t\\t invariant(isNotSet || (existing && existing.set), 'invalid keyPath');\\n\\t\\t var key = step.value;\\n\\t\\t var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\\n\\t\\t var nextUpdated = updateInDeepMap(nextExisting, keyPathIter, notSetValue, updater);\\n\\t\\t return nextUpdated === nextExisting ? existing : nextUpdated === NOT_SET ? existing.remove(key) : (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\\n\\t\\t}\\n\\t\\tfunction popCount(x) {\\n\\t\\t x = x - ((x >> 1) & 0x55555555);\\n\\t\\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\\n\\t\\t x = (x + (x >> 4)) & 0x0f0f0f0f;\\n\\t\\t x = x + (x >> 8);\\n\\t\\t x = x + (x >> 16);\\n\\t\\t return x & 0x7f;\\n\\t\\t}\\n\\t\\tfunction setIn(array, idx, val, canEdit) {\\n\\t\\t var newArray = canEdit ? array : arrCopy(array);\\n\\t\\t newArray[idx] = val;\\n\\t\\t return newArray;\\n\\t\\t}\\n\\t\\tfunction spliceIn(array, idx, val, canEdit) {\\n\\t\\t var newLen = array.length + 1;\\n\\t\\t if (canEdit && idx + 1 === newLen) {\\n\\t\\t array[idx] = val;\\n\\t\\t return array;\\n\\t\\t }\\n\\t\\t var newArray = new Array(newLen);\\n\\t\\t var after = 0;\\n\\t\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t\\t if (ii === idx) {\\n\\t\\t newArray[ii] = val;\\n\\t\\t after = -1;\\n\\t\\t } else {\\n\\t\\t newArray[ii] = array[ii + after];\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return newArray;\\n\\t\\t}\\n\\t\\tfunction spliceOut(array, idx, canEdit) {\\n\\t\\t var newLen = array.length - 1;\\n\\t\\t if (canEdit && idx === newLen) {\\n\\t\\t array.pop();\\n\\t\\t return array;\\n\\t\\t }\\n\\t\\t var newArray = new Array(newLen);\\n\\t\\t var after = 0;\\n\\t\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t\\t if (ii === idx) {\\n\\t\\t after = 1;\\n\\t\\t }\\n\\t\\t newArray[ii] = array[ii + after];\\n\\t\\t }\\n\\t\\t return newArray;\\n\\t\\t}\\n\\t\\tvar MAX_ARRAY_MAP_SIZE = SIZE / 4;\\n\\t\\tvar MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\\n\\t\\tvar MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\\n\\t\\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\\n\\t\\t this._iter = indexed;\\n\\t\\t this._useKeys = useKeys;\\n\\t\\t this.size = indexed.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ToKeyedSequence, {\\n\\t\\t get: function(key, notSetValue) {\\n\\t\\t return this._iter.get(key, notSetValue);\\n\\t\\t },\\n\\t\\t has: function(key) {\\n\\t\\t return this._iter.has(key);\\n\\t\\t },\\n\\t\\t valueSeq: function() {\\n\\t\\t return this._iter.valueSeq();\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t var $__0 = this;\\n\\t\\t var reversedSequence = reverseFactory(this, true);\\n\\t\\t if (!this._useKeys) {\\n\\t\\t reversedSequence.valueSeq = (function() {\\n\\t\\t return $__0._iter.toSeq().reverse();\\n\\t\\t });\\n\\t\\t }\\n\\t\\t return reversedSequence;\\n\\t\\t },\\n\\t\\t map: function(mapper, context) {\\n\\t\\t var $__0 = this;\\n\\t\\t var mappedSequence = mapFactory(this, mapper, context);\\n\\t\\t if (!this._useKeys) {\\n\\t\\t mappedSequence.valueSeq = (function() {\\n\\t\\t return $__0._iter.toSeq().map(mapper, context);\\n\\t\\t });\\n\\t\\t }\\n\\t\\t return mappedSequence;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var ii;\\n\\t\\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\\n\\t\\t return fn(v, k, $__0);\\n\\t\\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\\n\\t\\t return fn(v, reverse ? --ii : ii++, $__0);\\n\\t\\t })), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t if (this._useKeys) {\\n\\t\\t return this._iter.__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t var ii = reverse ? resolveSize(this) : 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, KeyedSeq);\\n\\t\\tToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\\n\\t\\t this._iter = iter;\\n\\t\\t this.size = iter.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ToIndexedSequence, {\\n\\t\\t contains: function(value) {\\n\\t\\t return this._iter.contains(value);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t return this._iter.__iterate((function(v) {\\n\\t\\t return fn(v, iterations++, $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar ToSetSequence = function ToSetSequence(iter) {\\n\\t\\t this._iter = iter;\\n\\t\\t this.size = iter.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ToSetSequence, {\\n\\t\\t has: function(key) {\\n\\t\\t return this._iter.contains(key);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._iter.__iterate((function(v) {\\n\\t\\t return fn(v, v, $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, SetSeq);\\n\\t\\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\\n\\t\\t this._iter = entries;\\n\\t\\t this.size = entries.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(FromEntriesSequence, {\\n\\t\\t entrySeq: function() {\\n\\t\\t return this._iter.toSeq();\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._iter.__iterate((function(entry) {\\n\\t\\t if (entry) {\\n\\t\\t validateEntry(entry);\\n\\t\\t return fn(entry[1], entry[0], $__0);\\n\\t\\t }\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (true) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t if (entry) {\\n\\t\\t validateEntry(entry);\\n\\t\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, KeyedSeq);\\n\\t\\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\\n\\t\\tfunction flipFactory(iterable) {\\n\\t\\t var flipSequence = makeSequence(iterable);\\n\\t\\t flipSequence._iter = iterable;\\n\\t\\t flipSequence.size = iterable.size;\\n\\t\\t flipSequence.flip = (function() {\\n\\t\\t return iterable;\\n\\t\\t });\\n\\t\\t flipSequence.reverse = function() {\\n\\t\\t var reversedSequence = iterable.reverse.apply(this);\\n\\t\\t reversedSequence.flip = (function() {\\n\\t\\t return iterable.reverse();\\n\\t\\t });\\n\\t\\t return reversedSequence;\\n\\t\\t };\\n\\t\\t flipSequence.has = (function(key) {\\n\\t\\t return iterable.contains(key);\\n\\t\\t });\\n\\t\\t flipSequence.contains = (function(key) {\\n\\t\\t return iterable.has(key);\\n\\t\\t });\\n\\t\\t flipSequence.cacheResult = cacheResultThrough;\\n\\t\\t flipSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return iterable.__iterate((function(v, k) {\\n\\t\\t return fn(k, v, $__0) !== false;\\n\\t\\t }), reverse);\\n\\t\\t };\\n\\t\\t flipSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t if (type === ITERATE_ENTRIES) {\\n\\t\\t var iterator = iterable.__iterator(type, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (!step.done) {\\n\\t\\t var k = step.value[0];\\n\\t\\t step.value[0] = step.value[1];\\n\\t\\t step.value[1] = k;\\n\\t\\t }\\n\\t\\t return step;\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\\n\\t\\t };\\n\\t\\t return flipSequence;\\n\\t\\t}\\n\\t\\tfunction mapFactory(iterable, mapper, context) {\\n\\t\\t var mappedSequence = makeSequence(iterable);\\n\\t\\t mappedSequence.size = iterable.size;\\n\\t\\t mappedSequence.has = (function(key) {\\n\\t\\t return iterable.has(key);\\n\\t\\t });\\n\\t\\t mappedSequence.get = (function(key, notSetValue) {\\n\\t\\t var v = iterable.get(key, NOT_SET);\\n\\t\\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\\n\\t\\t });\\n\\t\\t mappedSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return iterable.__iterate((function(v, k, c) {\\n\\t\\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\\n\\t\\t }), reverse);\\n\\t\\t };\\n\\t\\t mappedSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t var key = entry[0];\\n\\t\\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return mappedSequence;\\n\\t\\t}\\n\\t\\tfunction reverseFactory(iterable, useKeys) {\\n\\t\\t var reversedSequence = makeSequence(iterable);\\n\\t\\t reversedSequence._iter = iterable;\\n\\t\\t reversedSequence.size = iterable.size;\\n\\t\\t reversedSequence.reverse = (function() {\\n\\t\\t return iterable;\\n\\t\\t });\\n\\t\\t if (iterable.flip) {\\n\\t\\t reversedSequence.flip = function() {\\n\\t\\t var flipSequence = flipFactory(iterable);\\n\\t\\t flipSequence.reverse = (function() {\\n\\t\\t return iterable.flip();\\n\\t\\t });\\n\\t\\t return flipSequence;\\n\\t\\t };\\n\\t\\t }\\n\\t\\t reversedSequence.get = (function(key, notSetValue) {\\n\\t\\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\\n\\t\\t });\\n\\t\\t reversedSequence.has = (function(key) {\\n\\t\\t return iterable.has(useKeys ? key : -1 - key);\\n\\t\\t });\\n\\t\\t reversedSequence.contains = (function(value) {\\n\\t\\t return iterable.contains(value);\\n\\t\\t });\\n\\t\\t reversedSequence.cacheResult = cacheResultThrough;\\n\\t\\t reversedSequence.__iterate = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return iterable.__iterate((function(v, k) {\\n\\t\\t return fn(v, k, $__0);\\n\\t\\t }), !reverse);\\n\\t\\t };\\n\\t\\t reversedSequence.__iterator = (function(type, reverse) {\\n\\t\\t return iterable.__iterator(type, !reverse);\\n\\t\\t });\\n\\t\\t return reversedSequence;\\n\\t\\t}\\n\\t\\tfunction filterFactory(iterable, predicate, context, useKeys) {\\n\\t\\t var filterSequence = makeSequence(iterable);\\n\\t\\t if (useKeys) {\\n\\t\\t filterSequence.has = (function(key) {\\n\\t\\t var v = iterable.get(key, NOT_SET);\\n\\t\\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\\n\\t\\t });\\n\\t\\t filterSequence.get = (function(key, notSetValue) {\\n\\t\\t var v = iterable.get(key, NOT_SET);\\n\\t\\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\\n\\t\\t });\\n\\t\\t }\\n\\t\\t filterSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k, c) {\\n\\t\\t if (predicate.call(context, v, k, c)) {\\n\\t\\t iterations++;\\n\\t\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t\\t }\\n\\t\\t }), reverse);\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t filterSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (true) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t var key = entry[0];\\n\\t\\t var value = entry[1];\\n\\t\\t if (predicate.call(context, value, key, iterable)) {\\n\\t\\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return filterSequence;\\n\\t\\t}\\n\\t\\tfunction countByFactory(iterable, grouper, context) {\\n\\t\\t var groups = Map().asMutable();\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\\n\\t\\t return a + 1;\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t return groups.asImmutable();\\n\\t\\t}\\n\\t\\tfunction groupByFactory(iterable, grouper, context) {\\n\\t\\t var isKeyedIter = isKeyed(iterable);\\n\\t\\t var groups = Map().asMutable();\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t groups.update(grouper.call(context, v, k, iterable), (function(a) {\\n\\t\\t return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t var coerce = iterableClass(iterable);\\n\\t\\t return groups.map((function(arr) {\\n\\t\\t return reify(iterable, coerce(arr));\\n\\t\\t }));\\n\\t\\t}\\n\\t\\tfunction takeFactory(iterable, amount) {\\n\\t\\t if (amount > iterable.size) {\\n\\t\\t return iterable;\\n\\t\\t }\\n\\t\\t if (amount < 0) {\\n\\t\\t amount = 0;\\n\\t\\t }\\n\\t\\t var takeSequence = makeSequence(iterable);\\n\\t\\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\\n\\t\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (amount === 0) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (iterations++ > amount) {\\n\\t\\t return iteratorDone();\\n\\t\\t }\\n\\t\\t return iterator.next();\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return takeSequence;\\n\\t\\t}\\n\\t\\tfunction takeWhileFactory(iterable, predicate, context) {\\n\\t\\t var takeSequence = makeSequence(iterable);\\n\\t\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k, c) {\\n\\t\\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t var iterating = true;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (!iterating) {\\n\\t\\t return iteratorDone();\\n\\t\\t }\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t var k = entry[0];\\n\\t\\t var v = entry[1];\\n\\t\\t if (!predicate.call(context, v, k, $__0)) {\\n\\t\\t iterating = false;\\n\\t\\t return iteratorDone();\\n\\t\\t }\\n\\t\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return takeSequence;\\n\\t\\t}\\n\\t\\tfunction skipFactory(iterable, amount, useKeys) {\\n\\t\\t if (amount <= 0) {\\n\\t\\t return iterable;\\n\\t\\t }\\n\\t\\t var skipSequence = makeSequence(iterable);\\n\\t\\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\\n\\t\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var skipped = 0;\\n\\t\\t var isSkipping = true;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\\n\\t\\t iterations++;\\n\\t\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t\\t var skipped = 0;\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (skipped < amount) {\\n\\t\\t skipped++;\\n\\t\\t iterator.next();\\n\\t\\t }\\n\\t\\t var step = iterator.next();\\n\\t\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t\\t return step;\\n\\t\\t } else if (type === ITERATE_KEYS) {\\n\\t\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t\\t } else {\\n\\t\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return skipSequence;\\n\\t\\t}\\n\\t\\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\\n\\t\\t var skipSequence = makeSequence(iterable);\\n\\t\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var isSkipping = true;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k, c) {\\n\\t\\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\\n\\t\\t iterations++;\\n\\t\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t var skipping = true;\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step,\\n\\t\\t k,\\n\\t\\t v;\\n\\t\\t do {\\n\\t\\t step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t\\t return step;\\n\\t\\t } else if (type === ITERATE_KEYS) {\\n\\t\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t\\t } else {\\n\\t\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t k = entry[0];\\n\\t\\t v = entry[1];\\n\\t\\t skipping && (skipping = predicate.call(context, v, k, $__0));\\n\\t\\t } while (skipping);\\n\\t\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return skipSequence;\\n\\t\\t}\\n\\t\\tfunction concatFactory(iterable, values) {\\n\\t\\t var isKeyedIterable = isKeyed(iterable);\\n\\t\\t var iters = [iterable].concat(values).map((function(v) {\\n\\t\\t if (!isIterable(v)) {\\n\\t\\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\\n\\t\\t } else if (isKeyedIterable) {\\n\\t\\t v = KeyedIterable(v);\\n\\t\\t }\\n\\t\\t return v;\\n\\t\\t })).filter((function(v) {\\n\\t\\t return v.size !== 0;\\n\\t\\t }));\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return iterable;\\n\\t\\t }\\n\\t\\t if (iters.length === 1) {\\n\\t\\t var singleton = iters[0];\\n\\t\\t if (singleton === iterable || isKeyedIterable && isKeyed(singleton) || isIndexed(iterable) && isIndexed(singleton)) {\\n\\t\\t return singleton;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var concatSeq = new ArraySeq(iters);\\n\\t\\t if (isKeyedIterable) {\\n\\t\\t concatSeq = concatSeq.toKeyedSeq();\\n\\t\\t } else if (!isIndexed(iterable)) {\\n\\t\\t concatSeq = concatSeq.toSetSeq();\\n\\t\\t }\\n\\t\\t concatSeq = concatSeq.flatten(true);\\n\\t\\t concatSeq.size = iters.reduce((function(sum, seq) {\\n\\t\\t if (sum !== undefined) {\\n\\t\\t var size = seq.size;\\n\\t\\t if (size !== undefined) {\\n\\t\\t return sum + size;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }), 0);\\n\\t\\t return concatSeq;\\n\\t\\t}\\n\\t\\tfunction flattenFactory(iterable, depth, useKeys) {\\n\\t\\t var flatSequence = makeSequence(iterable);\\n\\t\\t flatSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var iterations = 0;\\n\\t\\t var stopped = false;\\n\\t\\t function flatDeep(iter, currentDepth) {\\n\\t\\t var $__0 = this;\\n\\t\\t iter.__iterate((function(v, k) {\\n\\t\\t if ((!depth || currentDepth < depth) && isIterable(v)) {\\n\\t\\t flatDeep(v, currentDepth + 1);\\n\\t\\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\\n\\t\\t stopped = true;\\n\\t\\t }\\n\\t\\t return !stopped;\\n\\t\\t }), reverse);\\n\\t\\t }\\n\\t\\t flatDeep(iterable, 0);\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t flatSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(type, reverse);\\n\\t\\t var stack = [];\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (iterator) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done !== false) {\\n\\t\\t iterator = stack.pop();\\n\\t\\t continue;\\n\\t\\t }\\n\\t\\t var v = step.value;\\n\\t\\t if (type === ITERATE_ENTRIES) {\\n\\t\\t v = v[1];\\n\\t\\t }\\n\\t\\t if ((!depth || stack.length < depth) && isIterable(v)) {\\n\\t\\t stack.push(iterator);\\n\\t\\t iterator = v.__iterator(type, reverse);\\n\\t\\t } else {\\n\\t\\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iteratorDone();\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return flatSequence;\\n\\t\\t}\\n\\t\\tfunction flatMapFactory(iterable, mapper, context) {\\n\\t\\t var coerce = iterableClass(iterable);\\n\\t\\t return iterable.toSeq().map((function(v, k) {\\n\\t\\t return coerce(mapper.call(context, v, k, iterable));\\n\\t\\t })).flatten(true);\\n\\t\\t}\\n\\t\\tfunction interposeFactory(iterable, separator) {\\n\\t\\t var interposedSequence = makeSequence(iterable);\\n\\t\\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\\n\\t\\t interposedSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\\n\\t\\t }), reverse);\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t interposedSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t var step;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (!step || iterations % 2) {\\n\\t\\t step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return interposedSequence;\\n\\t\\t}\\n\\t\\tfunction sortFactory(iterable, comparator, mapper) {\\n\\t\\t if (!comparator) {\\n\\t\\t comparator = defaultComparator;\\n\\t\\t }\\n\\t\\t var isKeyedIterable = isKeyed(iterable);\\n\\t\\t var index = 0;\\n\\t\\t var entries = iterable.toSeq().map((function(v, k) {\\n\\t\\t return [k, v, index++, mapper ? mapper(v, k, iterable) : v];\\n\\t\\t })).toArray();\\n\\t\\t entries.sort((function(a, b) {\\n\\t\\t return comparator(a[3], b[3]) || a[2] - b[2];\\n\\t\\t })).forEach(isKeyedIterable ? (function(v, i) {\\n\\t\\t entries[i].length = 2;\\n\\t\\t }) : (function(v, i) {\\n\\t\\t entries[i] = v[1];\\n\\t\\t }));\\n\\t\\t return isKeyedIterable ? KeyedSeq(entries) : isIndexed(iterable) ? IndexedSeq(entries) : SetSeq(entries);\\n\\t\\t}\\n\\t\\tfunction maxFactory(iterable, comparator, mapper) {\\n\\t\\t if (!comparator) {\\n\\t\\t comparator = defaultComparator;\\n\\t\\t }\\n\\t\\t if (mapper) {\\n\\t\\t var entry = iterable.toSeq().map((function(v, k) {\\n\\t\\t return [v, mapper(v, k, iterable)];\\n\\t\\t })).reduce((function(a, b) {\\n\\t\\t return _maxCompare(comparator, a[1], b[1]) ? b : a;\\n\\t\\t }));\\n\\t\\t return entry && entry[0];\\n\\t\\t } else {\\n\\t\\t return iterable.reduce((function(a, b) {\\n\\t\\t return _maxCompare(comparator, a, b) ? b : a;\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction _maxCompare(comparator, a, b) {\\n\\t\\t var comp = comparator(b, a);\\n\\t\\t return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\\n\\t\\t}\\n\\t\\tfunction reify(iter, seq) {\\n\\t\\t return isSeq(iter) ? seq : iter.constructor(seq);\\n\\t\\t}\\n\\t\\tfunction validateEntry(entry) {\\n\\t\\t if (entry !== Object(entry)) {\\n\\t\\t throw new TypeError('Expected [K, V] tuple: ' + entry);\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction resolveSize(iter) {\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t return ensureSize(iter);\\n\\t\\t}\\n\\t\\tfunction iterableClass(iterable) {\\n\\t\\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\\n\\t\\t}\\n\\t\\tfunction makeSequence(iterable) {\\n\\t\\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\\n\\t\\t}\\n\\t\\tfunction cacheResultThrough() {\\n\\t\\t if (this._iter.cacheResult) {\\n\\t\\t this._iter.cacheResult();\\n\\t\\t this.size = this._iter.size;\\n\\t\\t return this;\\n\\t\\t } else {\\n\\t\\t return Seq.prototype.cacheResult.call(this);\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction defaultComparator(a, b) {\\n\\t\\t return a > b ? 1 : a < b ? -1 : 0;\\n\\t\\t}\\n\\t\\tvar List = function List(value) {\\n\\t\\t var empty = emptyList();\\n\\t\\t if (value === null || value === undefined) {\\n\\t\\t return empty;\\n\\t\\t }\\n\\t\\t if (isList(value)) {\\n\\t\\t return value;\\n\\t\\t }\\n\\t\\t var iter = IndexedIterable(value);\\n\\t\\t var size = iter.size;\\n\\t\\t if (size === 0) {\\n\\t\\t return empty;\\n\\t\\t }\\n\\t\\t assertNotInfinite(size);\\n\\t\\t if (size > 0 && size < SIZE) {\\n\\t\\t return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\\n\\t\\t }\\n\\t\\t return empty.withMutations((function(list) {\\n\\t\\t list.setSize(size);\\n\\t\\t iter.forEach((function(v, i) {\\n\\t\\t return list.set(i, v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(List, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('List [', ']');\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t if (index < 0 || index >= this.size) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t index += this._origin;\\n\\t\\t var node = listNodeFor(this, index);\\n\\t\\t return node && node.array[index & MASK];\\n\\t\\t },\\n\\t\\t set: function(index, value) {\\n\\t\\t return updateList(this, index, value);\\n\\t\\t },\\n\\t\\t remove: function(index) {\\n\\t\\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = this._origin = this._capacity = 0;\\n\\t\\t this._level = SHIFT;\\n\\t\\t this._root = this._tail = null;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyList();\\n\\t\\t },\\n\\t\\t push: function() {\\n\\t\\t var values = arguments;\\n\\t\\t var oldSize = this.size;\\n\\t\\t return this.withMutations((function(list) {\\n\\t\\t setListBounds(list, 0, oldSize + values.length);\\n\\t\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t\\t list.set(oldSize + ii, values[ii]);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t pop: function() {\\n\\t\\t return setListBounds(this, 0, -1);\\n\\t\\t },\\n\\t\\t unshift: function() {\\n\\t\\t var values = arguments;\\n\\t\\t return this.withMutations((function(list) {\\n\\t\\t setListBounds(list, -values.length);\\n\\t\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t\\t list.set(ii, values[ii]);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t shift: function() {\\n\\t\\t return setListBounds(this, 1);\\n\\t\\t },\\n\\t\\t merge: function() {\\n\\t\\t return mergeIntoListWith(this, undefined, arguments);\\n\\t\\t },\\n\\t\\t mergeWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__7 = 1; $__7 < arguments.length; $__7++)\\n\\t\\t iters[$__7 - 1] = arguments[$__7];\\n\\t\\t return mergeIntoListWith(this, merger, iters);\\n\\t\\t },\\n\\t\\t mergeDeep: function() {\\n\\t\\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\\n\\t\\t },\\n\\t\\t mergeDeepWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__8 = 1; $__8 < arguments.length; $__8++)\\n\\t\\t iters[$__8 - 1] = arguments[$__8];\\n\\t\\t return mergeIntoListWith(this, deepMerger(merger), iters);\\n\\t\\t },\\n\\t\\t setSize: function(size) {\\n\\t\\t return setListBounds(this, 0, size);\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t var size = this.size;\\n\\t\\t if (wholeSlice(begin, end, size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var index = 0;\\n\\t\\t var values = iterateList(this, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var value = values();\\n\\t\\t return value === DONE ? iteratorDone() : iteratorValue(type, index++, value);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var index = 0;\\n\\t\\t var values = iterateList(this, reverse);\\n\\t\\t var value;\\n\\t\\t while ((value = values()) !== DONE) {\\n\\t\\t if (fn(value, index++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return index;\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t }}, IndexedCollection);\\n\\t\\tfunction isList(maybeList) {\\n\\t\\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\\n\\t\\t}\\n\\t\\tList.isList = isList;\\n\\t\\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\\n\\t\\tvar ListPrototype = List.prototype;\\n\\t\\tListPrototype[IS_LIST_SENTINEL] = true;\\n\\t\\tListPrototype[DELETE] = ListPrototype.remove;\\n\\t\\tListPrototype.setIn = MapPrototype.setIn;\\n\\t\\tListPrototype.deleteIn = ListPrototype.removeIn = MapPrototype.removeIn;\\n\\t\\tListPrototype.update = MapPrototype.update;\\n\\t\\tListPrototype.updateIn = MapPrototype.updateIn;\\n\\t\\tListPrototype.mergeIn = MapPrototype.mergeIn;\\n\\t\\tListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\\n\\t\\tListPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tListPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tListPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tListPrototype.wasAltered = MapPrototype.wasAltered;\\n\\t\\tvar VNode = function VNode(array, ownerID) {\\n\\t\\t this.array = array;\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t};\\n\\t\\tvar $VNode = VNode;\\n\\t\\t($traceurRuntime.createClass)(VNode, {\\n\\t\\t removeBefore: function(ownerID, level, index) {\\n\\t\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var originIndex = (index >>> level) & MASK;\\n\\t\\t if (originIndex >= this.array.length) {\\n\\t\\t return new $VNode([], ownerID);\\n\\t\\t }\\n\\t\\t var removingFirst = originIndex === 0;\\n\\t\\t var newChild;\\n\\t\\t if (level > 0) {\\n\\t\\t var oldChild = this.array[originIndex];\\n\\t\\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\\n\\t\\t if (newChild === oldChild && removingFirst) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (removingFirst && !newChild) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var editable = editableVNode(this, ownerID);\\n\\t\\t if (!removingFirst) {\\n\\t\\t for (var ii = 0; ii < originIndex; ii++) {\\n\\t\\t editable.array[ii] = undefined;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (newChild) {\\n\\t\\t editable.array[originIndex] = newChild;\\n\\t\\t }\\n\\t\\t return editable;\\n\\t\\t },\\n\\t\\t removeAfter: function(ownerID, level, index) {\\n\\t\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var sizeIndex = ((index - 1) >>> level) & MASK;\\n\\t\\t if (sizeIndex >= this.array.length) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var removingLast = sizeIndex === this.array.length - 1;\\n\\t\\t var newChild;\\n\\t\\t if (level > 0) {\\n\\t\\t var oldChild = this.array[sizeIndex];\\n\\t\\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\\n\\t\\t if (newChild === oldChild && removingLast) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (removingLast && !newChild) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var editable = editableVNode(this, ownerID);\\n\\t\\t if (!removingLast) {\\n\\t\\t editable.array.pop();\\n\\t\\t }\\n\\t\\t if (newChild) {\\n\\t\\t editable.array[sizeIndex] = newChild;\\n\\t\\t }\\n\\t\\t return editable;\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar DONE = {};\\n\\t\\tfunction iterateList(list, reverse) {\\n\\t\\t var left = list._origin;\\n\\t\\t var right = list._capacity;\\n\\t\\t var tailPos = getTailOffset(right);\\n\\t\\t var tail = list._tail;\\n\\t\\t return iterateNodeOrLeaf(list._root, list._level, 0);\\n\\t\\t function iterateNodeOrLeaf(node, level, offset) {\\n\\t\\t return level === 0 ? iterateLeaf(node, offset) : iterateNode(node, level, offset);\\n\\t\\t }\\n\\t\\t function iterateLeaf(node, offset) {\\n\\t\\t var array = offset === tailPos ? tail && tail.array : node && node.array;\\n\\t\\t var from = offset > left ? 0 : left - offset;\\n\\t\\t var to = right - offset;\\n\\t\\t if (to > SIZE) {\\n\\t\\t to = SIZE;\\n\\t\\t }\\n\\t\\t return (function() {\\n\\t\\t if (from === to) {\\n\\t\\t return DONE;\\n\\t\\t }\\n\\t\\t var idx = reverse ? --to : from++;\\n\\t\\t return array && array[idx];\\n\\t\\t });\\n\\t\\t }\\n\\t\\t function iterateNode(node, level, offset) {\\n\\t\\t var values;\\n\\t\\t var array = node && node.array;\\n\\t\\t var from = offset > left ? 0 : (left - offset) >> level;\\n\\t\\t var to = ((right - offset) >> level) + 1;\\n\\t\\t if (to > SIZE) {\\n\\t\\t to = SIZE;\\n\\t\\t }\\n\\t\\t return (function() {\\n\\t\\t do {\\n\\t\\t if (values) {\\n\\t\\t var value = values();\\n\\t\\t if (value !== DONE) {\\n\\t\\t return value;\\n\\t\\t }\\n\\t\\t values = null;\\n\\t\\t }\\n\\t\\t if (from === to) {\\n\\t\\t return DONE;\\n\\t\\t }\\n\\t\\t var idx = reverse ? --to : from++;\\n\\t\\t values = iterateNodeOrLeaf(array && array[idx], level - SHIFT, offset + (idx << level));\\n\\t\\t } while (true);\\n\\t\\t });\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\\n\\t\\t var list = Object.create(ListPrototype);\\n\\t\\t list.size = capacity - origin;\\n\\t\\t list._origin = origin;\\n\\t\\t list._capacity = capacity;\\n\\t\\t list._level = level;\\n\\t\\t list._root = root;\\n\\t\\t list._tail = tail;\\n\\t\\t list.__ownerID = ownerID;\\n\\t\\t list.__hash = hash;\\n\\t\\t list.__altered = false;\\n\\t\\t return list;\\n\\t\\t}\\n\\t\\tvar EMPTY_LIST;\\n\\t\\tfunction emptyList() {\\n\\t\\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\\n\\t\\t}\\n\\t\\tfunction updateList(list, index, value) {\\n\\t\\t index = wrapIndex(list, index);\\n\\t\\t if (index >= list.size || index < 0) {\\n\\t\\t return list.withMutations((function(list) {\\n\\t\\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t index += list._origin;\\n\\t\\t var newTail = list._tail;\\n\\t\\t var newRoot = list._root;\\n\\t\\t var didAlter = MakeRef(DID_ALTER);\\n\\t\\t if (index >= getTailOffset(list._capacity)) {\\n\\t\\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\\n\\t\\t } else {\\n\\t\\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\\n\\t\\t }\\n\\t\\t if (!didAlter.value) {\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t if (list.__ownerID) {\\n\\t\\t list._root = newRoot;\\n\\t\\t list._tail = newTail;\\n\\t\\t list.__hash = undefined;\\n\\t\\t list.__altered = true;\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\\n\\t\\t}\\n\\t\\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\\n\\t\\t var idx = (index >>> level) & MASK;\\n\\t\\t var nodeHas = node && idx < node.array.length;\\n\\t\\t if (!nodeHas && value === undefined) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t var newNode;\\n\\t\\t if (level > 0) {\\n\\t\\t var lowerNode = node && node.array[idx];\\n\\t\\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\\n\\t\\t if (newLowerNode === lowerNode) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t newNode = editableVNode(node, ownerID);\\n\\t\\t newNode.array[idx] = newLowerNode;\\n\\t\\t return newNode;\\n\\t\\t }\\n\\t\\t if (nodeHas && node.array[idx] === value) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t newNode = editableVNode(node, ownerID);\\n\\t\\t if (value === undefined && idx === newNode.array.length - 1) {\\n\\t\\t newNode.array.pop();\\n\\t\\t } else {\\n\\t\\t newNode.array[idx] = value;\\n\\t\\t }\\n\\t\\t return newNode;\\n\\t\\t}\\n\\t\\tfunction editableVNode(node, ownerID) {\\n\\t\\t if (ownerID && node && ownerID === node.ownerID) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t return new VNode(node ? node.array.slice() : [], ownerID);\\n\\t\\t}\\n\\t\\tfunction listNodeFor(list, rawIndex) {\\n\\t\\t if (rawIndex >= getTailOffset(list._capacity)) {\\n\\t\\t return list._tail;\\n\\t\\t }\\n\\t\\t if (rawIndex < 1 << (list._level + SHIFT)) {\\n\\t\\t var node = list._root;\\n\\t\\t var level = list._level;\\n\\t\\t while (node && level > 0) {\\n\\t\\t node = node.array[(rawIndex >>> level) & MASK];\\n\\t\\t level -= SHIFT;\\n\\t\\t }\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction setListBounds(list, begin, end) {\\n\\t\\t var owner = list.__ownerID || new OwnerID();\\n\\t\\t var oldOrigin = list._origin;\\n\\t\\t var oldCapacity = list._capacity;\\n\\t\\t var newOrigin = oldOrigin + begin;\\n\\t\\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\\n\\t\\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t if (newOrigin >= newCapacity) {\\n\\t\\t return list.clear();\\n\\t\\t }\\n\\t\\t var newLevel = list._level;\\n\\t\\t var newRoot = list._root;\\n\\t\\t var offsetShift = 0;\\n\\t\\t while (newOrigin + offsetShift < 0) {\\n\\t\\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\\n\\t\\t newLevel += SHIFT;\\n\\t\\t offsetShift += 1 << newLevel;\\n\\t\\t }\\n\\t\\t if (offsetShift) {\\n\\t\\t newOrigin += offsetShift;\\n\\t\\t oldOrigin += offsetShift;\\n\\t\\t newCapacity += offsetShift;\\n\\t\\t oldCapacity += offsetShift;\\n\\t\\t }\\n\\t\\t var oldTailOffset = getTailOffset(oldCapacity);\\n\\t\\t var newTailOffset = getTailOffset(newCapacity);\\n\\t\\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\\n\\t\\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\\n\\t\\t newLevel += SHIFT;\\n\\t\\t }\\n\\t\\t var oldTail = list._tail;\\n\\t\\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\\n\\t\\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\\n\\t\\t newRoot = editableVNode(newRoot, owner);\\n\\t\\t var node = newRoot;\\n\\t\\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\\n\\t\\t var idx = (oldTailOffset >>> level) & MASK;\\n\\t\\t node = node.array[idx] = editableVNode(node.array[idx], owner);\\n\\t\\t }\\n\\t\\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\\n\\t\\t }\\n\\t\\t if (newCapacity < oldCapacity) {\\n\\t\\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\\n\\t\\t }\\n\\t\\t if (newOrigin >= newTailOffset) {\\n\\t\\t newOrigin -= newTailOffset;\\n\\t\\t newCapacity -= newTailOffset;\\n\\t\\t newLevel = SHIFT;\\n\\t\\t newRoot = null;\\n\\t\\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\\n\\t\\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\\n\\t\\t offsetShift = 0;\\n\\t\\t while (newRoot) {\\n\\t\\t var beginIndex = (newOrigin >>> newLevel) & MASK;\\n\\t\\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t if (beginIndex) {\\n\\t\\t offsetShift += (1 << newLevel) * beginIndex;\\n\\t\\t }\\n\\t\\t newLevel -= SHIFT;\\n\\t\\t newRoot = newRoot.array[beginIndex];\\n\\t\\t }\\n\\t\\t if (newRoot && newOrigin > oldOrigin) {\\n\\t\\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\\n\\t\\t }\\n\\t\\t if (newRoot && newTailOffset < oldTailOffset) {\\n\\t\\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\\n\\t\\t }\\n\\t\\t if (offsetShift) {\\n\\t\\t newOrigin -= offsetShift;\\n\\t\\t newCapacity -= offsetShift;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (list.__ownerID) {\\n\\t\\t list.size = newCapacity - newOrigin;\\n\\t\\t list._origin = newOrigin;\\n\\t\\t list._capacity = newCapacity;\\n\\t\\t list._level = newLevel;\\n\\t\\t list._root = newRoot;\\n\\t\\t list._tail = newTail;\\n\\t\\t list.__hash = undefined;\\n\\t\\t list.__altered = true;\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\\n\\t\\t}\\n\\t\\tfunction mergeIntoListWith(list, merger, iterables) {\\n\\t\\t var iters = [];\\n\\t\\t var maxSize = 0;\\n\\t\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t\\t var value = iterables[ii];\\n\\t\\t var iter = IndexedIterable(value);\\n\\t\\t if (iter.size > maxSize) {\\n\\t\\t maxSize = iter.size;\\n\\t\\t }\\n\\t\\t if (!isIterable(value)) {\\n\\t\\t iter = iter.map((function(v) {\\n\\t\\t return fromJS(v);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t iters.push(iter);\\n\\t\\t }\\n\\t\\t if (maxSize > list.size) {\\n\\t\\t list = list.setSize(maxSize);\\n\\t\\t }\\n\\t\\t return mergeIntoCollectionWith(list, merger, iters);\\n\\t\\t}\\n\\t\\tfunction getTailOffset(size) {\\n\\t\\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\\n\\t\\t}\\n\\t\\tvar OrderedMap = function OrderedMap(value) {\\n\\t\\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().withMutations((function(map) {\\n\\t\\t var iter = KeyedIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v, k) {\\n\\t\\t return map.set(k, v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(OrderedMap, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('OrderedMap {', '}');\\n\\t\\t },\\n\\t\\t get: function(k, notSetValue) {\\n\\t\\t var index = this._map.get(k);\\n\\t\\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = 0;\\n\\t\\t this._map.clear();\\n\\t\\t this._list.clear();\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyOrderedMap();\\n\\t\\t },\\n\\t\\t set: function(k, v) {\\n\\t\\t return updateOrderedMap(this, k, v);\\n\\t\\t },\\n\\t\\t remove: function(k) {\\n\\t\\t return updateOrderedMap(this, k, NOT_SET);\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this._map.wasAltered() || this._list.wasAltered();\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._list.__iterate((function(entry) {\\n\\t\\t return entry && fn(entry[1], entry[0], $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return this._list.fromEntrySeq().__iterator(type, reverse);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t\\t var newList = this._list.__ensureOwner(ownerID);\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this._map = newMap;\\n\\t\\t this._list = newList;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t }}, Map);\\n\\t\\tfunction isOrderedMap(maybeOrderedMap) {\\n\\t\\t return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\\n\\t\\t}\\n\\t\\tOrderedMap.isOrderedMap = isOrderedMap;\\n\\t\\tOrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\\n\\t\\tfunction makeOrderedMap(map, list, ownerID, hash) {\\n\\t\\t var omap = Object.create(OrderedMap.prototype);\\n\\t\\t omap.size = map ? map.size : 0;\\n\\t\\t omap._map = map;\\n\\t\\t omap._list = list;\\n\\t\\t omap.__ownerID = ownerID;\\n\\t\\t omap.__hash = hash;\\n\\t\\t return omap;\\n\\t\\t}\\n\\t\\tvar EMPTY_ORDERED_MAP;\\n\\t\\tfunction emptyOrderedMap() {\\n\\t\\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\\n\\t\\t}\\n\\t\\tfunction updateOrderedMap(omap, k, v) {\\n\\t\\t var map = omap._map;\\n\\t\\t var list = omap._list;\\n\\t\\t var i = map.get(k);\\n\\t\\t var has = i !== undefined;\\n\\t\\t var newMap;\\n\\t\\t var newList;\\n\\t\\t if (v === NOT_SET) {\\n\\t\\t if (!has) {\\n\\t\\t return omap;\\n\\t\\t }\\n\\t\\t if (list.size >= SIZE && list.size >= map.size * 2) {\\n\\t\\t newList = list.filter((function(entry, idx) {\\n\\t\\t return entry !== undefined && i !== idx;\\n\\t\\t }));\\n\\t\\t newMap = newList.toKeyedSeq().map((function(entry) {\\n\\t\\t return entry[0];\\n\\t\\t })).flip().toMap();\\n\\t\\t if (omap.__ownerID) {\\n\\t\\t newMap.__ownerID = newList.__ownerID = omap.__ownerID;\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t newMap = map.remove(k);\\n\\t\\t newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t if (has) {\\n\\t\\t if (v === list.get(i)[1]) {\\n\\t\\t return omap;\\n\\t\\t }\\n\\t\\t newMap = map;\\n\\t\\t newList = list.set(i, [k, v]);\\n\\t\\t } else {\\n\\t\\t newMap = map.set(k, list.size);\\n\\t\\t newList = list.set(list.size, [k, v]);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (omap.__ownerID) {\\n\\t\\t omap.size = newMap.size;\\n\\t\\t omap._map = newMap;\\n\\t\\t omap._list = newList;\\n\\t\\t omap.__hash = undefined;\\n\\t\\t return omap;\\n\\t\\t }\\n\\t\\t return makeOrderedMap(newMap, newList);\\n\\t\\t}\\n\\t\\tvar Stack = function Stack(value) {\\n\\t\\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\\n\\t\\t};\\n\\t\\tvar $Stack = Stack;\\n\\t\\t($traceurRuntime.createClass)(Stack, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Stack [', ']');\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t var head = this._head;\\n\\t\\t while (head && index--) {\\n\\t\\t head = head.next;\\n\\t\\t }\\n\\t\\t return head ? head.value : notSetValue;\\n\\t\\t },\\n\\t\\t peek: function() {\\n\\t\\t return this._head && this._head.value;\\n\\t\\t },\\n\\t\\t push: function() {\\n\\t\\t if (arguments.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newSize = this.size + arguments.length;\\n\\t\\t var head = this._head;\\n\\t\\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\\n\\t\\t head = {\\n\\t\\t value: arguments[ii],\\n\\t\\t next: head\\n\\t\\t };\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = newSize;\\n\\t\\t this._head = head;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(newSize, head);\\n\\t\\t },\\n\\t\\t pushAll: function(iter) {\\n\\t\\t iter = IndexedIterable(iter);\\n\\t\\t if (iter.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t var newSize = this.size;\\n\\t\\t var head = this._head;\\n\\t\\t iter.reverse().forEach((function(value) {\\n\\t\\t newSize++;\\n\\t\\t head = {\\n\\t\\t value: value,\\n\\t\\t next: head\\n\\t\\t };\\n\\t\\t }));\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = newSize;\\n\\t\\t this._head = head;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(newSize, head);\\n\\t\\t },\\n\\t\\t pop: function() {\\n\\t\\t return this.slice(1);\\n\\t\\t },\\n\\t\\t unshift: function() {\\n\\t\\t return this.push.apply(this, arguments);\\n\\t\\t },\\n\\t\\t unshiftAll: function(iter) {\\n\\t\\t return this.pushAll(iter);\\n\\t\\t },\\n\\t\\t shift: function() {\\n\\t\\t return this.pop.apply(this, arguments);\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = 0;\\n\\t\\t this._head = undefined;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyStack();\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t if (wholeSlice(begin, end, this.size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t\\t if (resolvedEnd !== this.size) {\\n\\t\\t return $traceurRuntime.superCall(this, $Stack.prototype, \\\"slice\\\", [begin, end]);\\n\\t\\t }\\n\\t\\t var newSize = this.size - resolvedBegin;\\n\\t\\t var head = this._head;\\n\\t\\t while (resolvedBegin--) {\\n\\t\\t head = head.next;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = newSize;\\n\\t\\t this._head = head;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(newSize, head);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this.__altered = false;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(this.size, this._head, ownerID, this.__hash);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.toSeq().cacheResult.__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t var node = this._head;\\n\\t\\t while (node) {\\n\\t\\t if (fn(node.value, iterations++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t node = node.next;\\n\\t\\t }\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.toSeq().cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t var node = this._head;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (node) {\\n\\t\\t var value = node.value;\\n\\t\\t node = node.next;\\n\\t\\t return iteratorValue(type, iterations++, value);\\n\\t\\t }\\n\\t\\t return iteratorDone();\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t }}, IndexedCollection);\\n\\t\\tfunction isStack(maybeStack) {\\n\\t\\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\\n\\t\\t}\\n\\t\\tStack.isStack = isStack;\\n\\t\\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\\n\\t\\tvar StackPrototype = Stack.prototype;\\n\\t\\tStackPrototype[IS_STACK_SENTINEL] = true;\\n\\t\\tStackPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tStackPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tStackPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tStackPrototype.wasAltered = MapPrototype.wasAltered;\\n\\t\\tfunction makeStack(size, head, ownerID, hash) {\\n\\t\\t var map = Object.create(StackPrototype);\\n\\t\\t map.size = size;\\n\\t\\t map._head = head;\\n\\t\\t map.__ownerID = ownerID;\\n\\t\\t map.__hash = hash;\\n\\t\\t map.__altered = false;\\n\\t\\t return map;\\n\\t\\t}\\n\\t\\tvar EMPTY_STACK;\\n\\t\\tfunction emptyStack() {\\n\\t\\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\\n\\t\\t}\\n\\t\\tvar Set = function Set(value) {\\n\\t\\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().withMutations((function(set) {\\n\\t\\t var iter = SetIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v) {\\n\\t\\t return set.add(v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Set, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Set {', '}');\\n\\t\\t },\\n\\t\\t has: function(value) {\\n\\t\\t return this._map.has(value);\\n\\t\\t },\\n\\t\\t add: function(value) {\\n\\t\\t return updateSet(this, this._map.set(value, true));\\n\\t\\t },\\n\\t\\t remove: function(value) {\\n\\t\\t return updateSet(this, this._map.remove(value));\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t return updateSet(this, this._map.clear());\\n\\t\\t },\\n\\t\\t union: function() {\\n\\t\\t for (var iters = [],\\n\\t\\t $__9 = 0; $__9 < arguments.length; $__9++)\\n\\t\\t iters[$__9] = arguments[$__9];\\n\\t\\t iters = iters.filter((function(x) {\\n\\t\\t return x.size !== 0;\\n\\t\\t }));\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.size === 0 && iters.length === 1) {\\n\\t\\t return this.constructor(iters[0]);\\n\\t\\t }\\n\\t\\t return this.withMutations((function(set) {\\n\\t\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t\\t SetIterable(iters[ii]).forEach((function(value) {\\n\\t\\t return set.add(value);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t intersect: function() {\\n\\t\\t for (var iters = [],\\n\\t\\t $__10 = 0; $__10 < arguments.length; $__10++)\\n\\t\\t iters[$__10] = arguments[$__10];\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t iters = iters.map((function(iter) {\\n\\t\\t return SetIterable(iter);\\n\\t\\t }));\\n\\t\\t var originalSet = this;\\n\\t\\t return this.withMutations((function(set) {\\n\\t\\t originalSet.forEach((function(value) {\\n\\t\\t if (!iters.every((function(iter) {\\n\\t\\t return iter.contains(value);\\n\\t\\t }))) {\\n\\t\\t set.remove(value);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t subtract: function() {\\n\\t\\t for (var iters = [],\\n\\t\\t $__11 = 0; $__11 < arguments.length; $__11++)\\n\\t\\t iters[$__11] = arguments[$__11];\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t iters = iters.map((function(iter) {\\n\\t\\t return SetIterable(iter);\\n\\t\\t }));\\n\\t\\t var originalSet = this;\\n\\t\\t return this.withMutations((function(set) {\\n\\t\\t originalSet.forEach((function(value) {\\n\\t\\t if (iters.some((function(iter) {\\n\\t\\t return iter.contains(value);\\n\\t\\t }))) {\\n\\t\\t set.remove(value);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t merge: function() {\\n\\t\\t return this.union.apply(this, arguments);\\n\\t\\t },\\n\\t\\t mergeWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__12 = 1; $__12 < arguments.length; $__12++)\\n\\t\\t iters[$__12 - 1] = arguments[$__12];\\n\\t\\t return this.union.apply(this, iters);\\n\\t\\t },\\n\\t\\t sort: function(comparator) {\\n\\t\\t return OrderedSet(sortFactory(this, comparator));\\n\\t\\t },\\n\\t\\t sortBy: function(mapper, comparator) {\\n\\t\\t return OrderedSet(sortFactory(this, comparator, mapper));\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this._map.wasAltered();\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._map.__iterate((function(_, k) {\\n\\t\\t return fn(k, k, $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return this._map.map((function(_, k) {\\n\\t\\t return k;\\n\\t\\t })).__iterator(type, reverse);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this._map = newMap;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return this.__make(newMap, ownerID);\\n\\t\\t }\\n\\t\\t}, {\\n\\t\\t of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t },\\n\\t\\t fromKeys: function(value) {\\n\\t\\t return this(KeyedIterable(value).keySeq());\\n\\t\\t }\\n\\t\\t}, SetCollection);\\n\\t\\tfunction isSet(maybeSet) {\\n\\t\\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\\n\\t\\t}\\n\\t\\tSet.isSet = isSet;\\n\\t\\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\\n\\t\\tvar SetPrototype = Set.prototype;\\n\\t\\tSetPrototype[IS_SET_SENTINEL] = true;\\n\\t\\tSetPrototype[DELETE] = SetPrototype.remove;\\n\\t\\tSetPrototype.mergeDeep = SetPrototype.merge;\\n\\t\\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\\n\\t\\tSetPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tSetPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tSetPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tSetPrototype.__empty = emptySet;\\n\\t\\tSetPrototype.__make = makeSet;\\n\\t\\tfunction updateSet(set, newMap) {\\n\\t\\t if (set.__ownerID) {\\n\\t\\t set.size = newMap.size;\\n\\t\\t set._map = newMap;\\n\\t\\t return set;\\n\\t\\t }\\n\\t\\t return newMap === set._map ? set : newMap.size === 0 ? set.__empty() : set.__make(newMap);\\n\\t\\t}\\n\\t\\tfunction makeSet(map, ownerID) {\\n\\t\\t var set = Object.create(SetPrototype);\\n\\t\\t set.size = map ? map.size : 0;\\n\\t\\t set._map = map;\\n\\t\\t set.__ownerID = ownerID;\\n\\t\\t return set;\\n\\t\\t}\\n\\t\\tvar EMPTY_SET;\\n\\t\\tfunction emptySet() {\\n\\t\\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\\n\\t\\t}\\n\\t\\tvar OrderedSet = function OrderedSet(value) {\\n\\t\\t return value === null || value === undefined ? emptyOrderedSet() : isOrderedSet(value) ? value : emptyOrderedSet().withMutations((function(set) {\\n\\t\\t var iter = SetIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v) {\\n\\t\\t return set.add(v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(OrderedSet, {toString: function() {\\n\\t\\t return this.__toString('OrderedSet {', '}');\\n\\t\\t }}, {\\n\\t\\t of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t },\\n\\t\\t fromKeys: function(value) {\\n\\t\\t return this(KeyedIterable(value).keySeq());\\n\\t\\t }\\n\\t\\t}, Set);\\n\\t\\tfunction isOrderedSet(maybeOrderedSet) {\\n\\t\\t return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\\n\\t\\t}\\n\\t\\tOrderedSet.isOrderedSet = isOrderedSet;\\n\\t\\tvar OrderedSetPrototype = OrderedSet.prototype;\\n\\t\\tOrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tOrderedSetPrototype.__empty = emptyOrderedSet;\\n\\t\\tOrderedSetPrototype.__make = makeOrderedSet;\\n\\t\\tfunction makeOrderedSet(map, ownerID) {\\n\\t\\t var set = Object.create(OrderedSetPrototype);\\n\\t\\t set.size = map ? map.size : 0;\\n\\t\\t set._map = map;\\n\\t\\t set.__ownerID = ownerID;\\n\\t\\t return set;\\n\\t\\t}\\n\\t\\tvar EMPTY_ORDERED_SET;\\n\\t\\tfunction emptyOrderedSet() {\\n\\t\\t return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\\n\\t\\t}\\n\\t\\tvar Record = function Record(defaultValues, name) {\\n\\t\\t var RecordType = function Record(values) {\\n\\t\\t if (!(this instanceof RecordType)) {\\n\\t\\t return new RecordType(values);\\n\\t\\t }\\n\\t\\t this._map = Map(values);\\n\\t\\t };\\n\\t\\t var keys = Object.keys(defaultValues);\\n\\t\\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\\n\\t\\t RecordTypePrototype.constructor = RecordType;\\n\\t\\t name && (RecordTypePrototype._name = name);\\n\\t\\t RecordTypePrototype._defaultValues = defaultValues;\\n\\t\\t RecordTypePrototype._keys = keys;\\n\\t\\t RecordTypePrototype.size = keys.length;\\n\\t\\t try {\\n\\t\\t keys.forEach((function(key) {\\n\\t\\t Object.defineProperty(RecordType.prototype, key, {\\n\\t\\t get: function() {\\n\\t\\t return this.get(key);\\n\\t\\t },\\n\\t\\t set: function(value) {\\n\\t\\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\\n\\t\\t this.set(key, value);\\n\\t\\t }\\n\\t\\t });\\n\\t\\t }));\\n\\t\\t } catch (error) {}\\n\\t\\t return RecordType;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Record, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString(recordName(this) + ' {', '}');\\n\\t\\t },\\n\\t\\t has: function(k) {\\n\\t\\t return this._defaultValues.hasOwnProperty(k);\\n\\t\\t },\\n\\t\\t get: function(k, notSetValue) {\\n\\t\\t if (!this.has(k)) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t var defaultVal = this._defaultValues[k];\\n\\t\\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this._map && this._map.clear();\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var SuperRecord = Object.getPrototypeOf(this).constructor;\\n\\t\\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\\n\\t\\t },\\n\\t\\t set: function(k, v) {\\n\\t\\t if (!this.has(k)) {\\n\\t\\t throw new Error('Cannot set unknown key \\\"' + k + '\\\" on ' + recordName(this));\\n\\t\\t }\\n\\t\\t var newMap = this._map && this._map.set(k, v);\\n\\t\\t if (this.__ownerID || newMap === this._map) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeRecord(this, newMap);\\n\\t\\t },\\n\\t\\t remove: function(k) {\\n\\t\\t if (!this.has(k)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map && this._map.remove(k);\\n\\t\\t if (this.__ownerID || newMap === this._map) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeRecord(this, newMap);\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this._map.wasAltered();\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t\\t return $__0.get(k);\\n\\t\\t })).__iterator(type, reverse);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t\\t return $__0.get(k);\\n\\t\\t })).__iterate(fn, reverse);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map && this._map.__ensureOwner(ownerID);\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this._map = newMap;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeRecord(this, newMap, ownerID);\\n\\t\\t }\\n\\t\\t}, {}, KeyedCollection);\\n\\t\\tvar RecordPrototype = Record.prototype;\\n\\t\\tRecordPrototype[DELETE] = RecordPrototype.remove;\\n\\t\\tRecordPrototype.deleteIn = RecordPrototype.removeIn = MapPrototype.removeIn;\\n\\t\\tRecordPrototype.merge = MapPrototype.merge;\\n\\t\\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\\n\\t\\tRecordPrototype.mergeIn = MapPrototype.mergeIn;\\n\\t\\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\\n\\t\\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\\n\\t\\tRecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\\n\\t\\tRecordPrototype.setIn = MapPrototype.setIn;\\n\\t\\tRecordPrototype.update = MapPrototype.update;\\n\\t\\tRecordPrototype.updateIn = MapPrototype.updateIn;\\n\\t\\tRecordPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tRecordPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tfunction makeRecord(likeRecord, map, ownerID) {\\n\\t\\t var record = Object.create(Object.getPrototypeOf(likeRecord));\\n\\t\\t record._map = map;\\n\\t\\t record.__ownerID = ownerID;\\n\\t\\t return record;\\n\\t\\t}\\n\\t\\tfunction recordName(record) {\\n\\t\\t return record._name || record.constructor.name;\\n\\t\\t}\\n\\t\\tvar Range = function Range(start, end, step) {\\n\\t\\t if (!(this instanceof $Range)) {\\n\\t\\t return new $Range(start, end, step);\\n\\t\\t }\\n\\t\\t invariant(step !== 0, 'Cannot step a Range by 0');\\n\\t\\t start = start || 0;\\n\\t\\t if (end === undefined) {\\n\\t\\t end = Infinity;\\n\\t\\t }\\n\\t\\t if (start === end && __EMPTY_RANGE) {\\n\\t\\t return __EMPTY_RANGE;\\n\\t\\t }\\n\\t\\t step = step === undefined ? 1 : Math.abs(step);\\n\\t\\t if (end < start) {\\n\\t\\t step = -step;\\n\\t\\t }\\n\\t\\t this._start = start;\\n\\t\\t this._end = end;\\n\\t\\t this._step = step;\\n\\t\\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\\n\\t\\t};\\n\\t\\tvar $Range = Range;\\n\\t\\t($traceurRuntime.createClass)(Range, {\\n\\t\\t toString: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return 'Range []';\\n\\t\\t }\\n\\t\\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\\n\\t\\t },\\n\\t\\t contains: function(searchValue) {\\n\\t\\t var possibleIndex = (searchValue - this._start) / this._step;\\n\\t\\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t if (wholeSlice(begin, end, this.size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t begin = resolveBegin(begin, this.size);\\n\\t\\t end = resolveEnd(end, this.size);\\n\\t\\t if (end <= begin) {\\n\\t\\t return __EMPTY_RANGE;\\n\\t\\t }\\n\\t\\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\\n\\t\\t },\\n\\t\\t indexOf: function(searchValue) {\\n\\t\\t var offsetValue = searchValue - this._start;\\n\\t\\t if (offsetValue % this._step === 0) {\\n\\t\\t var index = offsetValue / this._step;\\n\\t\\t if (index >= 0 && index < this.size) {\\n\\t\\t return index;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return -1;\\n\\t\\t },\\n\\t\\t lastIndexOf: function(searchValue) {\\n\\t\\t return this.indexOf(searchValue);\\n\\t\\t },\\n\\t\\t take: function(amount) {\\n\\t\\t return this.slice(0, Math.max(0, amount));\\n\\t\\t },\\n\\t\\t skip: function(amount) {\\n\\t\\t return this.slice(Math.max(0, amount));\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var maxIndex = this.size - 1;\\n\\t\\t var step = this._step;\\n\\t\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t if (fn(value, ii, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t value += reverse ? -step : step;\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var maxIndex = this.size - 1;\\n\\t\\t var step = this._step;\\n\\t\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var v = value;\\n\\t\\t value += reverse ? -step : step;\\n\\t\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t equals: function(other) {\\n\\t\\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : deepEqual(this, other);\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar RangePrototype = Range.prototype;\\n\\t\\tRangePrototype.__toJS = RangePrototype.toArray;\\n\\t\\tRangePrototype.first = ListPrototype.first;\\n\\t\\tRangePrototype.last = ListPrototype.last;\\n\\t\\tvar __EMPTY_RANGE = Range(0, 0);\\n\\t\\tvar Repeat = function Repeat(value, times) {\\n\\t\\t if (times <= 0 && EMPTY_REPEAT) {\\n\\t\\t return EMPTY_REPEAT;\\n\\t\\t }\\n\\t\\t if (!(this instanceof $Repeat)) {\\n\\t\\t return new $Repeat(value, times);\\n\\t\\t }\\n\\t\\t this._value = value;\\n\\t\\t this.size = times === undefined ? Infinity : Math.max(0, times);\\n\\t\\t if (this.size === 0) {\\n\\t\\t EMPTY_REPEAT = this;\\n\\t\\t }\\n\\t\\t};\\n\\t\\tvar $Repeat = Repeat;\\n\\t\\t($traceurRuntime.createClass)(Repeat, {\\n\\t\\t toString: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return 'Repeat []';\\n\\t\\t }\\n\\t\\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t return this.has(index) ? this._value : notSetValue;\\n\\t\\t },\\n\\t\\t contains: function(searchValue) {\\n\\t\\t return is(this._value, searchValue);\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t var size = this.size;\\n\\t\\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t indexOf: function(searchValue) {\\n\\t\\t if (is(this._value, searchValue)) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t return -1;\\n\\t\\t },\\n\\t\\t lastIndexOf: function(searchValue) {\\n\\t\\t if (is(this._value, searchValue)) {\\n\\t\\t return this.size;\\n\\t\\t }\\n\\t\\t return -1;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t for (var ii = 0; ii < this.size; ii++) {\\n\\t\\t if (fn(this._value, ii, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t equals: function(other) {\\n\\t\\t return other instanceof $Repeat ? is(this._value, other._value) : deepEqual(other);\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar RepeatPrototype = Repeat.prototype;\\n\\t\\tRepeatPrototype.last = RepeatPrototype.first;\\n\\t\\tRepeatPrototype.has = RangePrototype.has;\\n\\t\\tRepeatPrototype.take = RangePrototype.take;\\n\\t\\tRepeatPrototype.skip = RangePrototype.skip;\\n\\t\\tRepeatPrototype.__toJS = RangePrototype.__toJS;\\n\\t\\tvar EMPTY_REPEAT;\\n\\t\\tvar Immutable = {\\n\\t\\t Iterable: Iterable,\\n\\t\\t Seq: Seq,\\n\\t\\t Collection: Collection,\\n\\t\\t Map: Map,\\n\\t\\t OrderedMap: OrderedMap,\\n\\t\\t List: List,\\n\\t\\t Stack: Stack,\\n\\t\\t Set: Set,\\n\\t\\t OrderedSet: OrderedSet,\\n\\t\\t Record: Record,\\n\\t\\t Range: Range,\\n\\t\\t Repeat: Repeat,\\n\\t\\t is: is,\\n\\t\\t fromJS: fromJS\\n\\t\\t};\\n\\n\\t\\t return Immutable;\\n\\t\\t}\",\n \"function Module(stdlib, imports, buffer) {\\n \\\"use asm\\\";\\n\\n function f() {\\n return 281474976710655 * 1048575 | 0;\\n }\\n\\n return {\\n f: f\\n };\\n}\",\n \"function v7(v8,v9) {\\n const v10 = gc;\\n // v10 = .function([] => .undefined)\\n let v13 = 0;\\n const v16 = [13.37,13.37,13.37,13.37];\\n // v16 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v18 = [1337,1337,1337,1337];\\n // v18 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v19 = [3697200800,v16,v18];\\n // v19 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v20 = v6[0];\\n // v20 = .unknown\\n const v21 = Symbol;\\n // v21 = .object(ofGroup: SymbolConstructor, withProperties: [\\\"match\\\", \\\"asyncIterator\\\", \\\"search\\\", \\\"iterator\\\", \\\"replace\\\", \\\"isConcatSpreadable\\\", \\\"toStringTag\\\", \\\"split\\\", \\\"toPrimitive\\\", \\\"matchAll\\\", \\\"hasInstance\\\", \\\"unscopable\\\", \\\"species\\\"], withMethods: [\\\"for\\\", \\\"keyFor\\\"]) + .function([.string] => .object(ofGroup: Symbol, withProperties: [\\\"__proto__\\\", \\\"description\\\"]))\\n for (let v25 = 0; v25 < 4; v25 = v25 + 1) {\\n }\\n function v27(v28,v29) {\\n }\\n do {\\n const v31 = [13.37,13.37,13.37,13.37];\\n // v31 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v34 = [1337,1337,Function,1337];\\n // v34 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v35 = {__proto__:v34,a:v31,c:1337,d:Function,e:v34,toString:Function};\\n // v35 = .object(ofGroup: Object, withProperties: [\\\"a\\\", \\\"__proto__\\\", \\\"toString\\\", \\\"d\\\", \\\"c\\\", \\\"e\\\"])\\n let v39 = 0;\\n while (v39 < 1337) {\\n const v40 = v39 + 1;\\n // v40 = .primitive\\n v39 = v40;\\n }\\n const v41 = [13.37,13.37,13.37,13.37];\\n // v41 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v43 = [1337,1337,1337,1337];\\n // v43 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v44 = [3697200800,v41,v43];\\n // v44 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v45 = v13 + 1;\\n // v45 = .primitive\\n function v48(v49,v50) {\\n return v44;\\n }\\n const v51 = [1337,1337,1337,1337];\\n // v51 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n for (let v54 = 0; v54 < 100; v54 = v54 + 100) {\\n }\\n const v55 = {__proto__:v51,a:1337,c:1337,d:Function,e:v51,toString:Function};\\n // v55 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"c\\\", \\\"__proto__\\\", \\\"toString\\\", \\\"d\\\", \\\"a\\\"])\\n const v56 = v48(1337,v41,...v55);\\n // v56 = .unknown\\n v13 = v45;\\n } while (v13 < 7);\\n return v3;\\n}\",\n \"function e(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function universalModule() {\\n\\t var $Object = Object;\\n\\n\\tfunction createClass(ctor, methods, staticMethods, superClass) {\\n\\t var proto;\\n\\t if (superClass) {\\n\\t var superProto = superClass.prototype;\\n\\t proto = $Object.create(superProto);\\n\\t } else {\\n\\t proto = ctor.prototype;\\n\\t }\\n\\t $Object.keys(methods).forEach(function (key) {\\n\\t proto[key] = methods[key];\\n\\t });\\n\\t $Object.keys(staticMethods).forEach(function (key) {\\n\\t ctor[key] = staticMethods[key];\\n\\t });\\n\\t proto.constructor = ctor;\\n\\t ctor.prototype = proto;\\n\\t return ctor;\\n\\t}\\n\\n\\tfunction superCall(self, proto, name, args) {\\n\\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\\n\\t}\\n\\n\\tfunction defaultSuperCall(self, proto, args) {\\n\\t superCall(self, proto, 'constructor', args);\\n\\t}\\n\\n\\tvar $traceurRuntime = {};\\n\\t$traceurRuntime.createClass = createClass;\\n\\t$traceurRuntime.superCall = superCall;\\n\\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\\n\\t\\\"use strict\\\";\\n\\tfunction is(first, second) {\\n\\t if (first === second) {\\n\\t return first !== 0 || second !== 0 || 1 / first === 1 / second;\\n\\t }\\n\\t if (first !== first) {\\n\\t return second !== second;\\n\\t }\\n\\t if (first && typeof first.equals === 'function') {\\n\\t return first.equals(second);\\n\\t }\\n\\t return false;\\n\\t}\\n\\tfunction invariant(condition, error) {\\n\\t if (!condition)\\n\\t throw new Error(error);\\n\\t}\\n\\tvar DELETE = 'delete';\\n\\tvar SHIFT = 5;\\n\\tvar SIZE = 1 << SHIFT;\\n\\tvar MASK = SIZE - 1;\\n\\tvar NOT_SET = {};\\n\\tvar CHANGE_LENGTH = {value: false};\\n\\tvar DID_ALTER = {value: false};\\n\\tfunction MakeRef(ref) {\\n\\t ref.value = false;\\n\\t return ref;\\n\\t}\\n\\tfunction SetRef(ref) {\\n\\t ref && (ref.value = true);\\n\\t}\\n\\tfunction OwnerID() {}\\n\\tfunction arrCopy(arr, offset) {\\n\\t offset = offset || 0;\\n\\t var len = Math.max(0, arr.length - offset);\\n\\t var newArr = new Array(len);\\n\\t for (var ii = 0; ii < len; ii++) {\\n\\t newArr[ii] = arr[ii + offset];\\n\\t }\\n\\t return newArr;\\n\\t}\\n\\tfunction assertNotInfinite(size) {\\n\\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\\n\\t}\\n\\tfunction ensureSize(iter) {\\n\\t if (iter.size === undefined) {\\n\\t iter.size = iter.__iterate(returnTrue);\\n\\t }\\n\\t return iter.size;\\n\\t}\\n\\tfunction wrapIndex(iter, index) {\\n\\t return index >= 0 ? index : ensureSize(iter) + index;\\n\\t}\\n\\tfunction returnTrue() {\\n\\t return true;\\n\\t}\\n\\tfunction wholeSlice(begin, end, size) {\\n\\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\\n\\t}\\n\\tfunction resolveBegin(begin, size) {\\n\\t return resolveIndex(begin, size, 0);\\n\\t}\\n\\tfunction resolveEnd(end, size) {\\n\\t return resolveIndex(end, size, size);\\n\\t}\\n\\tfunction resolveIndex(index, size, defaultIndex) {\\n\\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\\n\\t}\\n\\tfunction hash(o) {\\n\\t if (!o) {\\n\\t return 0;\\n\\t }\\n\\t if (o === true) {\\n\\t return 1;\\n\\t }\\n\\t var type = typeof o;\\n\\t if (type === 'number') {\\n\\t if ((o | 0) === o) {\\n\\t return o & HASH_MAX_VAL;\\n\\t }\\n\\t o = '' + o;\\n\\t type = 'string';\\n\\t }\\n\\t if (type === 'string') {\\n\\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\\n\\t }\\n\\t if (o.hashCode) {\\n\\t return hash(typeof o.hashCode === 'function' ? o.hashCode() : o.hashCode);\\n\\t }\\n\\t return hashJSObj(o);\\n\\t}\\n\\tfunction cachedHashString(string) {\\n\\t var hash = stringHashCache[string];\\n\\t if (hash === undefined) {\\n\\t hash = hashString(string);\\n\\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\\n\\t STRING_HASH_CACHE_SIZE = 0;\\n\\t stringHashCache = {};\\n\\t }\\n\\t STRING_HASH_CACHE_SIZE++;\\n\\t stringHashCache[string] = hash;\\n\\t }\\n\\t return hash;\\n\\t}\\n\\tfunction hashString(string) {\\n\\t var hash = 0;\\n\\t for (var ii = 0; ii < string.length; ii++) {\\n\\t hash = (31 * hash + string.charCodeAt(ii)) & HASH_MAX_VAL;\\n\\t }\\n\\t return hash;\\n\\t}\\n\\tfunction hashJSObj(obj) {\\n\\t var hash = weakMap && weakMap.get(obj);\\n\\t if (hash)\\n\\t return hash;\\n\\t hash = obj[UID_HASH_KEY];\\n\\t if (hash)\\n\\t return hash;\\n\\t if (!canDefineProperty) {\\n\\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\\n\\t if (hash)\\n\\t return hash;\\n\\t hash = getIENodeHash(obj);\\n\\t if (hash)\\n\\t return hash;\\n\\t }\\n\\t if (Object.isExtensible && !Object.isExtensible(obj)) {\\n\\t throw new Error('Non-extensible objects are not allowed as keys.');\\n\\t }\\n\\t hash = ++objHashUID & HASH_MAX_VAL;\\n\\t if (weakMap) {\\n\\t weakMap.set(obj, hash);\\n\\t } else if (canDefineProperty) {\\n\\t Object.defineProperty(obj, UID_HASH_KEY, {\\n\\t 'enumerable': false,\\n\\t 'configurable': false,\\n\\t 'writable': false,\\n\\t 'value': hash\\n\\t });\\n\\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\\n\\t obj.propertyIsEnumerable = function() {\\n\\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\\n\\t };\\n\\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\\n\\t } else if (obj.nodeType) {\\n\\t obj[UID_HASH_KEY] = hash;\\n\\t } else {\\n\\t throw new Error('Unable to set a non-enumerable property on object.');\\n\\t }\\n\\t return hash;\\n\\t}\\n\\tvar canDefineProperty = (function() {\\n\\t try {\\n\\t Object.defineProperty({}, 'x', {});\\n\\t return true;\\n\\t } catch (e) {\\n\\t return false;\\n\\t }\\n\\t}());\\n\\tfunction getIENodeHash(node) {\\n\\t if (node && node.nodeType > 0) {\\n\\t switch (node.nodeType) {\\n\\t case 1:\\n\\t return node.uniqueID;\\n\\t case 9:\\n\\t return node.documentElement && node.documentElement.uniqueID;\\n\\t }\\n\\t }\\n\\t}\\n\\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\\n\\tvar HASH_MAX_VAL = 0x7FFFFFFF;\\n\\tvar objHashUID = 0;\\n\\tvar UID_HASH_KEY = '__immutablehash__';\\n\\tif (typeof Symbol === 'function') {\\n\\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\\n\\t}\\n\\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\\n\\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\\n\\tvar STRING_HASH_CACHE_SIZE = 0;\\n\\tvar stringHashCache = {};\\n\\tvar ITERATE_KEYS = 0;\\n\\tvar ITERATE_VALUES = 1;\\n\\tvar ITERATE_ENTRIES = 2;\\n\\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\\n\\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\\n\\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\\n\\tvar Iterator = function Iterator(next) {\\n\\t this.next = next;\\n\\t};\\n\\t($traceurRuntime.createClass)(Iterator, {toString: function() {\\n\\t return '[Iterator]';\\n\\t }}, {});\\n\\tIterator.KEYS = ITERATE_KEYS;\\n\\tIterator.VALUES = ITERATE_VALUES;\\n\\tIterator.ENTRIES = ITERATE_ENTRIES;\\n\\tvar IteratorPrototype = Iterator.prototype;\\n\\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\\n\\t return this.toString();\\n\\t};\\n\\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\\n\\t return this;\\n\\t};\\n\\tfunction iteratorValue(type, k, v, iteratorResult) {\\n\\t var value = type === 0 ? k : type === 1 ? v : [k, v];\\n\\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\\n\\t value: value,\\n\\t done: false\\n\\t });\\n\\t return iteratorResult;\\n\\t}\\n\\tfunction iteratorDone() {\\n\\t return {\\n\\t value: undefined,\\n\\t done: true\\n\\t };\\n\\t}\\n\\tfunction hasIterator(maybeIterable) {\\n\\t return !!_iteratorFn(maybeIterable);\\n\\t}\\n\\tfunction isIterator(maybeIterator) {\\n\\t return maybeIterator && typeof maybeIterator.next === 'function';\\n\\t}\\n\\tfunction getIterator(iterable) {\\n\\t var iteratorFn = _iteratorFn(iterable);\\n\\t return iteratorFn && iteratorFn.call(iterable);\\n\\t}\\n\\tfunction _iteratorFn(iterable) {\\n\\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\\n\\t if (typeof iteratorFn === 'function') {\\n\\t return iteratorFn;\\n\\t }\\n\\t}\\n\\tvar Iterable = function Iterable(value) {\\n\\t return isIterable(value) ? value : Seq(value);\\n\\t};\\n\\tvar $Iterable = Iterable;\\n\\t($traceurRuntime.createClass)(Iterable, {\\n\\t toArray: function() {\\n\\t assertNotInfinite(this.size);\\n\\t var array = new Array(this.size || 0);\\n\\t this.valueSeq().__iterate((function(v, i) {\\n\\t array[i] = v;\\n\\t }));\\n\\t return array;\\n\\t },\\n\\t toIndexedSeq: function() {\\n\\t return new ToIndexedSequence(this);\\n\\t },\\n\\t toJS: function() {\\n\\t return this.toSeq().map((function(value) {\\n\\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\\n\\t })).__toJS();\\n\\t },\\n\\t toKeyedSeq: function() {\\n\\t return new ToKeyedSequence(this, true);\\n\\t },\\n\\t toMap: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return Map(this.toKeyedSeq());\\n\\t },\\n\\t toObject: function() {\\n\\t assertNotInfinite(this.size);\\n\\t var object = {};\\n\\t this.__iterate((function(v, k) {\\n\\t object[k] = v;\\n\\t }));\\n\\t return object;\\n\\t },\\n\\t toOrderedMap: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return OrderedMap(this.toKeyedSeq());\\n\\t },\\n\\t toSet: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return Set(isKeyed(this) ? this.valueSeq() : this);\\n\\t },\\n\\t toSetSeq: function() {\\n\\t return new ToSetSequence(this);\\n\\t },\\n\\t toSeq: function() {\\n\\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\\n\\t },\\n\\t toStack: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return Stack(isKeyed(this) ? this.valueSeq() : this);\\n\\t },\\n\\t toList: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return List(isKeyed(this) ? this.valueSeq() : this);\\n\\t },\\n\\t toString: function() {\\n\\t return '[Iterable]';\\n\\t },\\n\\t __toString: function(head, tail) {\\n\\t if (this.size === 0) {\\n\\t return head + tail;\\n\\t }\\n\\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\\n\\t },\\n\\t concat: function() {\\n\\t for (var values = [],\\n\\t $__2 = 0; $__2 < arguments.length; $__2++)\\n\\t values[$__2] = arguments[$__2];\\n\\t return reify(this, concatFactory(this, values));\\n\\t },\\n\\t contains: function(searchValue) {\\n\\t return this.some((function(value) {\\n\\t return is(value, searchValue);\\n\\t }));\\n\\t },\\n\\t entries: function() {\\n\\t return this.__iterator(ITERATE_ENTRIES);\\n\\t },\\n\\t every: function(predicate, context) {\\n\\t var returnValue = true;\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (!predicate.call(context, v, k, c)) {\\n\\t returnValue = false;\\n\\t return false;\\n\\t }\\n\\t }));\\n\\t return returnValue;\\n\\t },\\n\\t filter: function(predicate, context) {\\n\\t return reify(this, filterFactory(this, predicate, context, true));\\n\\t },\\n\\t find: function(predicate, context, notSetValue) {\\n\\t var foundValue = notSetValue;\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (predicate.call(context, v, k, c)) {\\n\\t foundValue = v;\\n\\t return false;\\n\\t }\\n\\t }));\\n\\t return foundValue;\\n\\t },\\n\\t forEach: function(sideEffect, context) {\\n\\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\\n\\t },\\n\\t join: function(separator) {\\n\\t separator = separator !== undefined ? '' + separator : ',';\\n\\t var joined = '';\\n\\t var isFirst = true;\\n\\t this.__iterate((function(v) {\\n\\t isFirst ? (isFirst = false) : (joined += separator);\\n\\t joined += v !== null && v !== undefined ? v : '';\\n\\t }));\\n\\t return joined;\\n\\t },\\n\\t keys: function() {\\n\\t return this.__iterator(ITERATE_KEYS);\\n\\t },\\n\\t map: function(mapper, context) {\\n\\t return reify(this, mapFactory(this, mapper, context));\\n\\t },\\n\\t reduce: function(reducer, initialReduction, context) {\\n\\t var reduction;\\n\\t var useFirst;\\n\\t if (arguments.length < 2) {\\n\\t useFirst = true;\\n\\t } else {\\n\\t reduction = initialReduction;\\n\\t }\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (useFirst) {\\n\\t useFirst = false;\\n\\t reduction = v;\\n\\t } else {\\n\\t reduction = reducer.call(context, reduction, v, k, c);\\n\\t }\\n\\t }));\\n\\t return reduction;\\n\\t },\\n\\t reduceRight: function(reducer, initialReduction, context) {\\n\\t var reversed = this.toKeyedSeq().reverse();\\n\\t return reversed.reduce.apply(reversed, arguments);\\n\\t },\\n\\t reverse: function() {\\n\\t return reify(this, reverseFactory(this, true));\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t if (wholeSlice(begin, end, this.size)) {\\n\\t return this;\\n\\t }\\n\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\\n\\t return this.toSeq().cacheResult().slice(begin, end);\\n\\t }\\n\\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\\n\\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\\n\\t },\\n\\t some: function(predicate, context) {\\n\\t return !this.every(not(predicate), context);\\n\\t },\\n\\t sort: function(comparator) {\\n\\t return this.sortBy(valueMapper, comparator);\\n\\t },\\n\\t values: function() {\\n\\t return this.__iterator(ITERATE_VALUES);\\n\\t },\\n\\t butLast: function() {\\n\\t return this.slice(0, -1);\\n\\t },\\n\\t count: function(predicate, context) {\\n\\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\\n\\t },\\n\\t countBy: function(grouper, context) {\\n\\t return countByFactory(this, grouper, context);\\n\\t },\\n\\t equals: function(other) {\\n\\t if (this === other) {\\n\\t return true;\\n\\t }\\n\\t if (!other || typeof other.equals !== 'function') {\\n\\t return false;\\n\\t }\\n\\t if (this.size !== undefined && other.size !== undefined) {\\n\\t if (this.size !== other.size) {\\n\\t return false;\\n\\t }\\n\\t if (this.size === 0 && other.size === 0) {\\n\\t return true;\\n\\t }\\n\\t }\\n\\t if (this.__hash !== undefined && other.__hash !== undefined && this.__hash !== other.__hash) {\\n\\t return false;\\n\\t }\\n\\t return this.__deepEquals(other);\\n\\t },\\n\\t __deepEquals: function(other) {\\n\\t var entries = this.entries();\\n\\t return typeof other.every === 'function' && other.every((function(v, k) {\\n\\t var entry = entries.next().value;\\n\\t return entry && is(entry[0], k) && is(entry[1], v);\\n\\t })) && entries.next().done;\\n\\t },\\n\\t entrySeq: function() {\\n\\t var iterable = this;\\n\\t if (iterable._cache) {\\n\\t return new ArraySeq(iterable._cache);\\n\\t }\\n\\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\\n\\t entriesSequence.fromEntrySeq = (function() {\\n\\t return iterable.toSeq();\\n\\t });\\n\\t return entriesSequence;\\n\\t },\\n\\t filterNot: function(predicate, context) {\\n\\t return this.filter(not(predicate), context);\\n\\t },\\n\\t findLast: function(predicate, context, notSetValue) {\\n\\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\\n\\t },\\n\\t first: function() {\\n\\t return this.find(returnTrue);\\n\\t },\\n\\t flatMap: function(mapper, context) {\\n\\t return reify(this, flatMapFactory(this, mapper, context));\\n\\t },\\n\\t flatten: function(depth) {\\n\\t return reify(this, flattenFactory(this, depth, true));\\n\\t },\\n\\t fromEntrySeq: function() {\\n\\t return new FromEntriesSequence(this);\\n\\t },\\n\\t get: function(searchKey, notSetValue) {\\n\\t return this.find((function(_, key) {\\n\\t return is(key, searchKey);\\n\\t }), undefined, notSetValue);\\n\\t },\\n\\t getIn: function(searchKeyPath, notSetValue) {\\n\\t var nested = this;\\n\\t if (searchKeyPath) {\\n\\t for (var ii = 0; ii < searchKeyPath.length; ii++) {\\n\\t nested = nested && nested.get ? nested.get(searchKeyPath[ii], NOT_SET) : NOT_SET;\\n\\t if (nested === NOT_SET) {\\n\\t return notSetValue;\\n\\t }\\n\\t }\\n\\t }\\n\\t return nested;\\n\\t },\\n\\t groupBy: function(grouper, context) {\\n\\t return groupByFactory(this, grouper, context);\\n\\t },\\n\\t has: function(searchKey) {\\n\\t return this.get(searchKey, NOT_SET) !== NOT_SET;\\n\\t },\\n\\t isSubset: function(iter) {\\n\\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\\n\\t return this.every((function(value) {\\n\\t return iter.contains(value);\\n\\t }));\\n\\t },\\n\\t isSuperset: function(iter) {\\n\\t return iter.isSubset(this);\\n\\t },\\n\\t keySeq: function() {\\n\\t return this.toSeq().map(keyMapper).toIndexedSeq();\\n\\t },\\n\\t last: function() {\\n\\t return this.toSeq().reverse().first();\\n\\t },\\n\\t max: function(comparator) {\\n\\t return this.maxBy(valueMapper, comparator);\\n\\t },\\n\\t maxBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t var maxEntry = this.entrySeq().reduce((function(max, next) {\\n\\t return comparator(mapper(next[1], next[0], $__0), mapper(max[1], max[0], $__0)) > 0 ? next : max;\\n\\t }));\\n\\t return maxEntry && maxEntry[1];\\n\\t },\\n\\t min: function(comparator) {\\n\\t return this.minBy(valueMapper, comparator);\\n\\t },\\n\\t minBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t var minEntry = this.entrySeq().reduce((function(min, next) {\\n\\t return comparator(mapper(next[1], next[0], $__0), mapper(min[1], min[0], $__0)) < 0 ? next : min;\\n\\t }));\\n\\t return minEntry && minEntry[1];\\n\\t },\\n\\t rest: function() {\\n\\t return this.slice(1);\\n\\t },\\n\\t skip: function(amount) {\\n\\t return reify(this, skipFactory(this, amount, true));\\n\\t },\\n\\t skipLast: function(amount) {\\n\\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\\n\\t },\\n\\t skipWhile: function(predicate, context) {\\n\\t return reify(this, skipWhileFactory(this, predicate, context, true));\\n\\t },\\n\\t skipUntil: function(predicate, context) {\\n\\t return this.skipWhile(not(predicate), context);\\n\\t },\\n\\t sortBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t return reify(this, new ArraySeq(this.entrySeq().entrySeq().toArray().sort((function(a, b) {\\n\\t return comparator(mapper(a[1][1], a[1][0], $__0), mapper(b[1][1], b[1][0], $__0)) || a[0] - b[0];\\n\\t }))).fromEntrySeq().valueSeq().fromEntrySeq());\\n\\t },\\n\\t take: function(amount) {\\n\\t return reify(this, takeFactory(this, amount));\\n\\t },\\n\\t takeLast: function(amount) {\\n\\t return reify(this, this.toSeq().reverse().take(amount).reverse());\\n\\t },\\n\\t takeWhile: function(predicate, context) {\\n\\t return reify(this, takeWhileFactory(this, predicate, context));\\n\\t },\\n\\t takeUntil: function(predicate, context) {\\n\\t return this.takeWhile(not(predicate), context);\\n\\t },\\n\\t valueSeq: function() {\\n\\t return this.toIndexedSeq();\\n\\t },\\n\\t hashCode: function() {\\n\\t return this.__hash || (this.__hash = this.size === Infinity ? 0 : this.reduce((function(h, v, k) {\\n\\t return (h + (hash(v) ^ (v === k ? 0 : hash(k)))) & HASH_MAX_VAL;\\n\\t }), 0));\\n\\t }\\n\\t}, {});\\n\\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\\n\\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\\n\\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\\n\\tvar IterablePrototype = Iterable.prototype;\\n\\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\\n\\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\\n\\tIterablePrototype.toJSON = IterablePrototype.toJS;\\n\\tIterablePrototype.__toJS = IterablePrototype.toArray;\\n\\tIterablePrototype.__toStringMapper = quoteString;\\n\\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\\n\\t return this.toString();\\n\\t};\\n\\tIterablePrototype.chain = IterablePrototype.flatMap;\\n\\t(function() {\\n\\t try {\\n\\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\\n\\t if (!Iterable.noLengthWarning) {\\n\\t var stack;\\n\\t try {\\n\\t throw new Error();\\n\\t } catch (error) {\\n\\t stack = error.stack;\\n\\t }\\n\\t if (stack.indexOf('_wrapObject') === -1) {\\n\\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\\n\\t return this.size;\\n\\t }\\n\\t }\\n\\t }});\\n\\t } catch (e) {}\\n\\t})();\\n\\tvar KeyedIterable = function KeyedIterable(value) {\\n\\t return isKeyed(value) ? value : KeyedSeq(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(KeyedIterable, {\\n\\t flip: function() {\\n\\t return reify(this, flipFactory(this));\\n\\t },\\n\\t findKey: function(predicate, context) {\\n\\t var foundKey;\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (predicate.call(context, v, k, c)) {\\n\\t foundKey = k;\\n\\t return false;\\n\\t }\\n\\t }));\\n\\t return foundKey;\\n\\t },\\n\\t findLastKey: function(predicate, context) {\\n\\t return this.toSeq().reverse().findKey(predicate, context);\\n\\t },\\n\\t keyOf: function(searchValue) {\\n\\t return this.findKey((function(value) {\\n\\t return is(value, searchValue);\\n\\t }));\\n\\t },\\n\\t lastKeyOf: function(searchValue) {\\n\\t return this.toSeq().reverse().keyOf(searchValue);\\n\\t },\\n\\t mapEntries: function(mapper, context) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t return reify(this, this.toSeq().map((function(v, k) {\\n\\t return mapper.call(context, [k, v], iterations++, $__0);\\n\\t })).fromEntrySeq());\\n\\t },\\n\\t mapKeys: function(mapper, context) {\\n\\t var $__0 = this;\\n\\t return reify(this, this.toSeq().flip().map((function(k, v) {\\n\\t return mapper.call(context, k, v, $__0);\\n\\t })).flip());\\n\\t }\\n\\t}, {}, Iterable);\\n\\tvar KeyedIterablePrototype = KeyedIterable.prototype;\\n\\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\\n\\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\\n\\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\\n\\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\\n\\t return k + ': ' + quoteString(v);\\n\\t});\\n\\tvar IndexedIterable = function IndexedIterable(value) {\\n\\t return isIndexed(value) ? value : IndexedSeq(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(IndexedIterable, {\\n\\t toKeyedSeq: function() {\\n\\t return new ToKeyedSequence(this, false);\\n\\t },\\n\\t filter: function(predicate, context) {\\n\\t return reify(this, filterFactory(this, predicate, context, false));\\n\\t },\\n\\t findIndex: function(predicate, context) {\\n\\t var key = this.toKeyedSeq().findKey(predicate, context);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t indexOf: function(searchValue) {\\n\\t var key = this.toKeyedSeq().keyOf(searchValue);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t lastIndexOf: function(searchValue) {\\n\\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t reverse: function() {\\n\\t return reify(this, reverseFactory(this, false));\\n\\t },\\n\\t splice: function(index, removeNum) {\\n\\t var numArgs = arguments.length;\\n\\t removeNum = Math.max(removeNum | 0, 0);\\n\\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\\n\\t return this;\\n\\t }\\n\\t index = resolveBegin(index, this.size);\\n\\t var spliced = this.slice(0, index);\\n\\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\\n\\t },\\n\\t findLastIndex: function(predicate, context) {\\n\\t var key = this.toKeyedSeq().findLastKey(predicate, context);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t first: function() {\\n\\t return this.get(0);\\n\\t },\\n\\t flatten: function(depth) {\\n\\t return reify(this, flattenFactory(this, depth, false));\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\\n\\t return key === index;\\n\\t }), undefined, notSetValue);\\n\\t },\\n\\t has: function(index) {\\n\\t index = wrapIndex(this, index);\\n\\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\\n\\t },\\n\\t interpose: function(separator) {\\n\\t return reify(this, interposeFactory(this, separator));\\n\\t },\\n\\t last: function() {\\n\\t return this.get(-1);\\n\\t },\\n\\t skip: function(amount) {\\n\\t var iter = this;\\n\\t var skipSeq = skipFactory(iter, amount, false);\\n\\t if (isSeq(iter) && skipSeq !== iter) {\\n\\t skipSeq.get = function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\\n\\t };\\n\\t }\\n\\t return reify(this, skipSeq);\\n\\t },\\n\\t skipWhile: function(predicate, context) {\\n\\t return reify(this, skipWhileFactory(this, predicate, context, false));\\n\\t },\\n\\t sortBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t return reify(this, new ArraySeq(this.entrySeq().toArray().sort((function(a, b) {\\n\\t return comparator(mapper(a[1], a[0], $__0), mapper(b[1], b[0], $__0)) || a[0] - b[0];\\n\\t }))).fromEntrySeq().valueSeq());\\n\\t },\\n\\t take: function(amount) {\\n\\t var iter = this;\\n\\t var takeSeq = takeFactory(iter, amount);\\n\\t if (isSeq(iter) && takeSeq !== iter) {\\n\\t takeSeq.get = function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\\n\\t };\\n\\t }\\n\\t return reify(this, takeSeq);\\n\\t }\\n\\t}, {}, Iterable);\\n\\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\\n\\tvar SetIterable = function SetIterable(value) {\\n\\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(SetIterable, {\\n\\t get: function(value, notSetValue) {\\n\\t return this.has(value) ? value : notSetValue;\\n\\t },\\n\\t contains: function(value) {\\n\\t return this.has(value);\\n\\t },\\n\\t keySeq: function() {\\n\\t return this.valueSeq();\\n\\t }\\n\\t}, {}, Iterable);\\n\\tSetIterable.prototype.has = IterablePrototype.contains;\\n\\tfunction isIterable(maybeIterable) {\\n\\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\\n\\t}\\n\\tfunction isKeyed(maybeKeyed) {\\n\\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\\n\\t}\\n\\tfunction isIndexed(maybeIndexed) {\\n\\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\\n\\t}\\n\\tfunction isAssociative(maybeAssociative) {\\n\\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\\n\\t}\\n\\tIterable.isIterable = isIterable;\\n\\tIterable.isKeyed = isKeyed;\\n\\tIterable.isIndexed = isIndexed;\\n\\tIterable.isAssociative = isAssociative;\\n\\tIterable.Keyed = KeyedIterable;\\n\\tIterable.Indexed = IndexedIterable;\\n\\tIterable.Set = SetIterable;\\n\\tIterable.Iterator = Iterator;\\n\\tfunction valueMapper(v) {\\n\\t return v;\\n\\t}\\n\\tfunction keyMapper(v, k) {\\n\\t return k;\\n\\t}\\n\\tfunction entryMapper(v, k) {\\n\\t return [k, v];\\n\\t}\\n\\tfunction not(predicate) {\\n\\t return function() {\\n\\t return !predicate.apply(this, arguments);\\n\\t };\\n\\t}\\n\\tfunction quoteString(value) {\\n\\t return typeof value === 'string' ? JSON.stringify(value) : value;\\n\\t}\\n\\tfunction defaultComparator(a, b) {\\n\\t return a > b ? 1 : a < b ? -1 : 0;\\n\\t}\\n\\tfunction mixin(ctor, methods) {\\n\\t var proto = ctor.prototype;\\n\\t var keyCopier = (function(key) {\\n\\t proto[key] = methods[key];\\n\\t });\\n\\t Object.keys(methods).forEach(keyCopier);\\n\\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\\n\\t return ctor;\\n\\t}\\n\\tvar Seq = function Seq(value) {\\n\\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\\n\\t};\\n\\tvar $Seq = Seq;\\n\\t($traceurRuntime.createClass)(Seq, {\\n\\t toSeq: function() {\\n\\t return this;\\n\\t },\\n\\t toString: function() {\\n\\t return this.__toString('Seq {', '}');\\n\\t },\\n\\t cacheResult: function() {\\n\\t if (!this._cache && this.__iterateUncached) {\\n\\t this._cache = this.entrySeq().toArray();\\n\\t this.size = this._cache.length;\\n\\t }\\n\\t return this;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t return seqIterate(this, fn, reverse, true);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return seqIterator(this, type, reverse, true);\\n\\t }\\n\\t}, {of: function() {\\n\\t return $Seq(arguments);\\n\\t }}, Iterable);\\n\\tvar KeyedSeq = function KeyedSeq(value) {\\n\\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\\n\\t};\\n\\tvar $KeyedSeq = KeyedSeq;\\n\\t($traceurRuntime.createClass)(KeyedSeq, {\\n\\t toKeyedSeq: function() {\\n\\t return this;\\n\\t },\\n\\t toSeq: function() {\\n\\t return this;\\n\\t }\\n\\t}, {of: function() {\\n\\t return $KeyedSeq(arguments);\\n\\t }}, Seq);\\n\\tmixin(KeyedSeq, KeyedIterable.prototype);\\n\\tvar IndexedSeq = function IndexedSeq(value) {\\n\\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\\n\\t};\\n\\tvar $IndexedSeq = IndexedSeq;\\n\\t($traceurRuntime.createClass)(IndexedSeq, {\\n\\t toIndexedSeq: function() {\\n\\t return this;\\n\\t },\\n\\t toString: function() {\\n\\t return this.__toString('Seq [', ']');\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t return seqIterate(this, fn, reverse, false);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return seqIterator(this, type, reverse, false);\\n\\t }\\n\\t}, {of: function() {\\n\\t return $IndexedSeq(arguments);\\n\\t }}, Seq);\\n\\tmixin(IndexedSeq, IndexedIterable.prototype);\\n\\tvar SetSeq = function SetSeq(value) {\\n\\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\\n\\t};\\n\\tvar $SetSeq = SetSeq;\\n\\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\\n\\t return this;\\n\\t }}, {of: function() {\\n\\t return $SetSeq(arguments);\\n\\t }}, Seq);\\n\\tmixin(SetSeq, SetIterable.prototype);\\n\\tSeq.isSeq = isSeq;\\n\\tSeq.Keyed = KeyedSeq;\\n\\tSeq.Set = SetSeq;\\n\\tSeq.Indexed = IndexedSeq;\\n\\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\\n\\tSeq.prototype[IS_SEQ_SENTINEL] = true;\\n\\tvar ArraySeq = function ArraySeq(array) {\\n\\t this._array = array;\\n\\t this.size = array.length;\\n\\t};\\n\\t($traceurRuntime.createClass)(ArraySeq, {\\n\\t get: function(index, notSetValue) {\\n\\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var array = this._array;\\n\\t var maxIndex = array.length - 1;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var array = this._array;\\n\\t var maxIndex = array.length - 1;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar ObjectSeq = function ObjectSeq(object) {\\n\\t var keys = Object.keys(object);\\n\\t this._object = object;\\n\\t this._keys = keys;\\n\\t this.size = keys.length;\\n\\t};\\n\\t($traceurRuntime.createClass)(ObjectSeq, {\\n\\t get: function(key, notSetValue) {\\n\\t if (notSetValue !== undefined && !this.has(key)) {\\n\\t return notSetValue;\\n\\t }\\n\\t return this._object[key];\\n\\t },\\n\\t has: function(key) {\\n\\t return this._object.hasOwnProperty(key);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var object = this._object;\\n\\t var keys = this._keys;\\n\\t var maxIndex = keys.length - 1;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t if (fn(object[key], key, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var object = this._object;\\n\\t var keys = this._keys;\\n\\t var maxIndex = keys.length - 1;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\\n\\t }));\\n\\t }\\n\\t}, {}, KeyedSeq);\\n\\tvar IterableSeq = function IterableSeq(iterable) {\\n\\t this._iterable = iterable;\\n\\t this.size = iterable.length || iterable.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(IterableSeq, {\\n\\t __iterateUncached: function(fn, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterable = this._iterable;\\n\\t var iterator = getIterator(iterable);\\n\\t var iterations = 0;\\n\\t if (isIterator(iterator)) {\\n\\t var step;\\n\\t while (!(step = iterator.next()).done) {\\n\\t if (fn(step.value, iterations++, this) === false) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __iteratorUncached: function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterable = this._iterable;\\n\\t var iterator = getIterator(iterable);\\n\\t if (!isIterator(iterator)) {\\n\\t return new Iterator(iteratorDone);\\n\\t }\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, iterations++, step.value);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar IteratorSeq = function IteratorSeq(iterator) {\\n\\t this._iterator = iterator;\\n\\t this._iteratorCache = [];\\n\\t};\\n\\t($traceurRuntime.createClass)(IteratorSeq, {\\n\\t __iterateUncached: function(fn, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterator = this._iterator;\\n\\t var cache = this._iteratorCache;\\n\\t var iterations = 0;\\n\\t while (iterations < cache.length) {\\n\\t if (fn(cache[iterations], iterations++, this) === false) {\\n\\t return iterations;\\n\\t }\\n\\t }\\n\\t var step;\\n\\t while (!(step = iterator.next()).done) {\\n\\t var val = step.value;\\n\\t cache[iterations] = val;\\n\\t if (fn(val, iterations++, this) === false) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __iteratorUncached: function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = this._iterator;\\n\\t var cache = this._iteratorCache;\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t if (iterations >= cache.length) {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t cache[iterations] = step.value;\\n\\t }\\n\\t return iteratorValue(type, iterations, cache[iterations++]);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tfunction isSeq(maybeSeq) {\\n\\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\\n\\t}\\n\\tvar EMPTY_SEQ;\\n\\tfunction emptySequence() {\\n\\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\\n\\t}\\n\\tfunction keyedSeqFromValue(value) {\\n\\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\\n\\t if (!seq) {\\n\\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\\n\\t }\\n\\t return seq;\\n\\t}\\n\\tfunction indexedSeqFromValue(value) {\\n\\t var seq = maybeIndexedSeqFromValue(value);\\n\\t if (!seq) {\\n\\t throw new TypeError('Expected Array or iterable object of values: ' + value);\\n\\t }\\n\\t return seq;\\n\\t}\\n\\tfunction seqFromValue(value) {\\n\\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\\n\\t if (!seq) {\\n\\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\\n\\t }\\n\\t return seq;\\n\\t}\\n\\tfunction maybeIndexedSeqFromValue(value) {\\n\\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\\n\\t}\\n\\tfunction isArrayLike(value) {\\n\\t return value && typeof value.length === 'number';\\n\\t}\\n\\tfunction seqIterate(seq, fn, reverse, useKeys) {\\n\\t assertNotInfinite(seq.size);\\n\\t var cache = seq._cache;\\n\\t if (cache) {\\n\\t var maxIndex = cache.length - 1;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t }\\n\\t return seq.__iterateUncached(fn, reverse);\\n\\t}\\n\\tfunction seqIterator(seq, type, reverse, useKeys) {\\n\\t var cache = seq._cache;\\n\\t if (cache) {\\n\\t var maxIndex = cache.length - 1;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\\n\\t }));\\n\\t }\\n\\t return seq.__iteratorUncached(type, reverse);\\n\\t}\\n\\tfunction fromJS(json, converter) {\\n\\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\\n\\t}\\n\\tfunction _fromJSWith(converter, json, key, parentJSON) {\\n\\t if (Array.isArray(json)) {\\n\\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\\n\\t return _fromJSWith(converter, v, k, json);\\n\\t })));\\n\\t }\\n\\t if (isPlainObj(json)) {\\n\\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\\n\\t return _fromJSWith(converter, v, k, json);\\n\\t })));\\n\\t }\\n\\t return json;\\n\\t}\\n\\tfunction _fromJSDefault(json) {\\n\\t if (Array.isArray(json)) {\\n\\t return IndexedSeq(json).map(_fromJSDefault).toList();\\n\\t }\\n\\t if (isPlainObj(json)) {\\n\\t return KeyedSeq(json).map(_fromJSDefault).toMap();\\n\\t }\\n\\t return json;\\n\\t}\\n\\tfunction isPlainObj(value) {\\n\\t return value && value.constructor === Object;\\n\\t}\\n\\tvar Collection = function Collection() {\\n\\t throw TypeError('Abstract');\\n\\t};\\n\\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\\n\\tvar KeyedCollection = function KeyedCollection() {\\n\\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\\n\\t};\\n\\tvar $KeyedCollection = KeyedCollection;\\n\\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\\n\\tmixin(KeyedCollection, KeyedIterable.prototype);\\n\\tvar IndexedCollection = function IndexedCollection() {\\n\\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\\n\\t};\\n\\tvar $IndexedCollection = IndexedCollection;\\n\\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\\n\\tmixin(IndexedCollection, IndexedIterable.prototype);\\n\\tvar SetCollection = function SetCollection() {\\n\\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\\n\\t};\\n\\tvar $SetCollection = SetCollection;\\n\\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\\n\\tmixin(SetCollection, SetIterable.prototype);\\n\\tCollection.Keyed = KeyedCollection;\\n\\tCollection.Indexed = IndexedCollection;\\n\\tCollection.Set = SetCollection;\\n\\tvar Map = function Map(value) {\\n\\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().merge(KeyedIterable(value));\\n\\t};\\n\\t($traceurRuntime.createClass)(Map, {\\n\\t toString: function() {\\n\\t return this.__toString('Map {', '}');\\n\\t },\\n\\t get: function(k, notSetValue) {\\n\\t return this._root ? this._root.get(0, hash(k), k, notSetValue) : notSetValue;\\n\\t },\\n\\t set: function(k, v) {\\n\\t return updateMap(this, k, v);\\n\\t },\\n\\t setIn: function(keyPath, v) {\\n\\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\\n\\t return this.updateIn(keyPath, (function() {\\n\\t return v;\\n\\t }));\\n\\t },\\n\\t remove: function(k) {\\n\\t return updateMap(this, k, NOT_SET);\\n\\t },\\n\\t removeIn: function(keyPath) {\\n\\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\\n\\t return this.updateIn(keyPath, (function() {\\n\\t return NOT_SET;\\n\\t }));\\n\\t },\\n\\t update: function(k, notSetValue, updater) {\\n\\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\\n\\t },\\n\\t updateIn: function(keyPath, notSetValue, updater) {\\n\\t if (!updater) {\\n\\t updater = notSetValue;\\n\\t notSetValue = undefined;\\n\\t }\\n\\t return keyPath.length === 0 ? updater(this) : updateInDeepMap(this, keyPath, notSetValue, updater, 0);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._root = null;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return emptyMap();\\n\\t },\\n\\t merge: function() {\\n\\t return mergeIntoMapWith(this, undefined, arguments);\\n\\t },\\n\\t mergeWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__3 = 1; $__3 < arguments.length; $__3++)\\n\\t iters[$__3 - 1] = arguments[$__3];\\n\\t return mergeIntoMapWith(this, merger, iters);\\n\\t },\\n\\t mergeDeep: function() {\\n\\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\\n\\t },\\n\\t mergeDeepWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__4 = 1; $__4 < arguments.length; $__4++)\\n\\t iters[$__4 - 1] = arguments[$__4];\\n\\t return mergeIntoMapWith(this, deepMerger(merger), iters);\\n\\t },\\n\\t withMutations: function(fn) {\\n\\t var mutable = this.asMutable();\\n\\t fn(mutable);\\n\\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\\n\\t },\\n\\t asMutable: function() {\\n\\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\\n\\t },\\n\\t asImmutable: function() {\\n\\t return this.__ensureOwner();\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this.__altered;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return new MapIterator(this, type, reverse);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t this._root && this._root.iterate((function(entry) {\\n\\t iterations++;\\n\\t return fn(entry[1], entry[0], $__0);\\n\\t }), reverse);\\n\\t return iterations;\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this.__altered = false;\\n\\t return this;\\n\\t }\\n\\t return makeMap(this.size, this._root, ownerID, this.__hash);\\n\\t }\\n\\t}, {}, KeyedCollection);\\n\\tfunction isMap(maybeMap) {\\n\\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\\n\\t}\\n\\tMap.isMap = isMap;\\n\\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\\n\\tvar MapPrototype = Map.prototype;\\n\\tMapPrototype[IS_MAP_SENTINEL] = true;\\n\\tMapPrototype[DELETE] = MapPrototype.remove;\\n\\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\\n\\t this.ownerID = ownerID;\\n\\t this.bitmap = bitmap;\\n\\t this.nodes = nodes;\\n\\t};\\n\\tvar $BitmapIndexedNode = BitmapIndexedNode;\\n\\t($traceurRuntime.createClass)(BitmapIndexedNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t var bit = (1 << ((shift === 0 ? hash : hash >>> shift) & MASK));\\n\\t var bitmap = this.bitmap;\\n\\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, hash, key, notSetValue);\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var hashFrag = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var bit = 1 << hashFrag;\\n\\t var bitmap = this.bitmap;\\n\\t var exists = (bitmap & bit) !== 0;\\n\\t if (!exists && value === NOT_SET) {\\n\\t return this;\\n\\t }\\n\\t var idx = popCount(bitmap & (bit - 1));\\n\\t var nodes = this.nodes;\\n\\t var node = exists ? nodes[idx] : undefined;\\n\\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\\n\\t if (newNode === node) {\\n\\t return this;\\n\\t }\\n\\t if (!exists && newNode && nodes.length >= MAX_BITMAP_SIZE) {\\n\\t return expandNodes(ownerID, nodes, bitmap, hashFrag, newNode);\\n\\t }\\n\\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\\n\\t return nodes[idx ^ 1];\\n\\t }\\n\\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\\n\\t return newNode;\\n\\t }\\n\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\\n\\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\\n\\t if (isEditable) {\\n\\t this.bitmap = newBitmap;\\n\\t this.nodes = newNodes;\\n\\t return this;\\n\\t }\\n\\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\\n\\t },\\n\\t iterate: function(fn, reverse) {\\n\\t var nodes = this.nodes;\\n\\t for (var ii = 0,\\n\\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\\n\\t if (nodes[reverse ? maxIndex - ii : ii].iterate(fn, reverse) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t}, {});\\n\\tvar ArrayNode = function ArrayNode(ownerID, count, nodes) {\\n\\t this.ownerID = ownerID;\\n\\t this.count = count;\\n\\t this.nodes = nodes;\\n\\t};\\n\\tvar $ArrayNode = ArrayNode;\\n\\t($traceurRuntime.createClass)(ArrayNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var node = this.nodes[idx];\\n\\t return node ? node.get(shift + SHIFT, hash, key, notSetValue) : notSetValue;\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var removed = value === NOT_SET;\\n\\t var nodes = this.nodes;\\n\\t var node = nodes[idx];\\n\\t if (removed && !node) {\\n\\t return this;\\n\\t }\\n\\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\\n\\t if (newNode === node) {\\n\\t return this;\\n\\t }\\n\\t var newCount = this.count;\\n\\t if (!node) {\\n\\t newCount++;\\n\\t } else if (!newNode) {\\n\\t newCount--;\\n\\t if (newCount < MIN_ARRAY_SIZE) {\\n\\t return packNodes(ownerID, nodes, newCount, idx);\\n\\t }\\n\\t }\\n\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t var newNodes = setIn(nodes, idx, newNode, isEditable);\\n\\t if (isEditable) {\\n\\t this.count = newCount;\\n\\t this.nodes = newNodes;\\n\\t return this;\\n\\t }\\n\\t return new $ArrayNode(ownerID, newCount, newNodes);\\n\\t },\\n\\t iterate: function(fn, reverse) {\\n\\t var nodes = this.nodes;\\n\\t for (var ii = 0,\\n\\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\\n\\t var node = nodes[reverse ? maxIndex - ii : ii];\\n\\t if (node && node.iterate(fn, reverse) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t}, {});\\n\\tvar HashCollisionNode = function HashCollisionNode(ownerID, hash, entries) {\\n\\t this.ownerID = ownerID;\\n\\t this.hash = hash;\\n\\t this.entries = entries;\\n\\t};\\n\\tvar $HashCollisionNode = HashCollisionNode;\\n\\t($traceurRuntime.createClass)(HashCollisionNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t var entries = this.entries;\\n\\t for (var ii = 0,\\n\\t len = entries.length; ii < len; ii++) {\\n\\t if (is(key, entries[ii][0])) {\\n\\t return entries[ii][1];\\n\\t }\\n\\t }\\n\\t return notSetValue;\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var removed = value === NOT_SET;\\n\\t if (hash !== this.hash) {\\n\\t if (removed) {\\n\\t return this;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t SetRef(didChangeSize);\\n\\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\\n\\t }\\n\\t var entries = this.entries;\\n\\t var idx = 0;\\n\\t for (var len = entries.length; idx < len; idx++) {\\n\\t if (is(key, entries[idx][0])) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t var exists = idx < len;\\n\\t if (removed && !exists) {\\n\\t return this;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t (removed || !exists) && SetRef(didChangeSize);\\n\\t if (removed && len === 2) {\\n\\t return new ValueNode(ownerID, this.hash, entries[idx ^ 1]);\\n\\t }\\n\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t var newEntries = isEditable ? entries : arrCopy(entries);\\n\\t if (exists) {\\n\\t if (removed) {\\n\\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\\n\\t } else {\\n\\t newEntries[idx] = [key, value];\\n\\t }\\n\\t } else {\\n\\t newEntries.push([key, value]);\\n\\t }\\n\\t if (isEditable) {\\n\\t this.entries = newEntries;\\n\\t return this;\\n\\t }\\n\\t return new $HashCollisionNode(ownerID, this.hash, newEntries);\\n\\t },\\n\\t iterate: function(fn, reverse) {\\n\\t var entries = this.entries;\\n\\t for (var ii = 0,\\n\\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\\n\\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t}, {});\\n\\tvar ValueNode = function ValueNode(ownerID, hash, entry) {\\n\\t this.ownerID = ownerID;\\n\\t this.hash = hash;\\n\\t this.entry = entry;\\n\\t};\\n\\tvar $ValueNode = ValueNode;\\n\\t($traceurRuntime.createClass)(ValueNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var removed = value === NOT_SET;\\n\\t var keyMatch = is(key, this.entry[0]);\\n\\t if (keyMatch ? value === this.entry[1] : removed) {\\n\\t return this;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t if (removed) {\\n\\t SetRef(didChangeSize);\\n\\t return;\\n\\t }\\n\\t if (keyMatch) {\\n\\t if (ownerID && ownerID === this.ownerID) {\\n\\t this.entry[1] = value;\\n\\t return this;\\n\\t }\\n\\t return new $ValueNode(ownerID, hash, [key, value]);\\n\\t }\\n\\t SetRef(didChangeSize);\\n\\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\\n\\t },\\n\\t iterate: function(fn) {\\n\\t return fn(this.entry);\\n\\t }\\n\\t}, {});\\n\\tvar MapIterator = function MapIterator(map, type, reverse) {\\n\\t this._type = type;\\n\\t this._reverse = reverse;\\n\\t this._stack = map._root && mapIteratorFrame(map._root);\\n\\t};\\n\\t($traceurRuntime.createClass)(MapIterator, {next: function() {\\n\\t var type = this._type;\\n\\t var stack = this._stack;\\n\\t while (stack) {\\n\\t var node = stack.node;\\n\\t var index = stack.index++;\\n\\t var maxIndex;\\n\\t if (node.entry) {\\n\\t if (index === 0) {\\n\\t return mapIteratorValue(type, node.entry);\\n\\t }\\n\\t } else if (node.entries) {\\n\\t maxIndex = node.entries.length - 1;\\n\\t if (index <= maxIndex) {\\n\\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\\n\\t }\\n\\t } else {\\n\\t maxIndex = node.nodes.length - 1;\\n\\t if (index <= maxIndex) {\\n\\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\\n\\t if (subNode) {\\n\\t if (subNode.entry) {\\n\\t return mapIteratorValue(type, subNode.entry);\\n\\t }\\n\\t stack = this._stack = mapIteratorFrame(subNode, stack);\\n\\t }\\n\\t continue;\\n\\t }\\n\\t }\\n\\t stack = this._stack = this._stack.__prev;\\n\\t }\\n\\t return iteratorDone();\\n\\t }}, {}, Iterator);\\n\\tfunction mapIteratorValue(type, entry) {\\n\\t return iteratorValue(type, entry[0], entry[1]);\\n\\t}\\n\\tfunction mapIteratorFrame(node, prev) {\\n\\t return {\\n\\t node: node,\\n\\t index: 0,\\n\\t __prev: prev\\n\\t };\\n\\t}\\n\\tfunction makeMap(size, root, ownerID, hash) {\\n\\t var map = Object.create(MapPrototype);\\n\\t map.size = size;\\n\\t map._root = root;\\n\\t map.__ownerID = ownerID;\\n\\t map.__hash = hash;\\n\\t map.__altered = false;\\n\\t return map;\\n\\t}\\n\\tvar EMPTY_MAP;\\n\\tfunction emptyMap() {\\n\\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\\n\\t}\\n\\tfunction updateMap(map, k, v) {\\n\\t var didChangeSize = MakeRef(CHANGE_LENGTH);\\n\\t var didAlter = MakeRef(DID_ALTER);\\n\\t var newRoot = updateNode(map._root, map.__ownerID, 0, hash(k), k, v, didChangeSize, didAlter);\\n\\t if (!didAlter.value) {\\n\\t return map;\\n\\t }\\n\\t var newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\\n\\t if (map.__ownerID) {\\n\\t map.size = newSize;\\n\\t map._root = newRoot;\\n\\t map.__hash = undefined;\\n\\t map.__altered = true;\\n\\t return map;\\n\\t }\\n\\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\\n\\t}\\n\\tfunction updateNode(node, ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t if (!node) {\\n\\t if (value === NOT_SET) {\\n\\t return node;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t SetRef(didChangeSize);\\n\\t return new ValueNode(ownerID, hash, [key, value]);\\n\\t }\\n\\t return node.update(ownerID, shift, hash, key, value, didChangeSize, didAlter);\\n\\t}\\n\\tfunction isLeafNode(node) {\\n\\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\\n\\t}\\n\\tfunction mergeIntoNode(node, ownerID, shift, hash, entry) {\\n\\t if (node.hash === hash) {\\n\\t return new HashCollisionNode(ownerID, hash, [node.entry, entry]);\\n\\t }\\n\\t var idx1 = (shift === 0 ? node.hash : node.hash >>> shift) & MASK;\\n\\t var idx2 = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var newNode;\\n\\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, hash, entry)] : ((newNode = new ValueNode(ownerID, hash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\\n\\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\\n\\t}\\n\\tfunction packNodes(ownerID, nodes, count, excluding) {\\n\\t var bitmap = 0;\\n\\t var packedII = 0;\\n\\t var packedNodes = new Array(count);\\n\\t for (var ii = 0,\\n\\t bit = 1,\\n\\t len = nodes.length; ii < len; ii++, bit <<= 1) {\\n\\t var node = nodes[ii];\\n\\t if (node !== undefined && ii !== excluding) {\\n\\t bitmap |= bit;\\n\\t packedNodes[packedII++] = node;\\n\\t }\\n\\t }\\n\\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\\n\\t}\\n\\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\\n\\t var count = 0;\\n\\t var expandedNodes = new Array(SIZE);\\n\\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\\n\\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\\n\\t }\\n\\t expandedNodes[including] = node;\\n\\t return new ArrayNode(ownerID, count + 1, expandedNodes);\\n\\t}\\n\\tfunction mergeIntoMapWith(map, merger, iterables) {\\n\\t var iters = [];\\n\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t var value = iterables[ii];\\n\\t var iter = KeyedIterable(value);\\n\\t if (!isIterable(value)) {\\n\\t iter = iter.map((function(v) {\\n\\t return fromJS(v);\\n\\t }));\\n\\t }\\n\\t iters.push(iter);\\n\\t }\\n\\t return mergeIntoCollectionWith(map, merger, iters);\\n\\t}\\n\\tfunction deepMerger(merger) {\\n\\t return (function(existing, value) {\\n\\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\\n\\t });\\n\\t}\\n\\tfunction mergeIntoCollectionWith(collection, merger, iters) {\\n\\t if (iters.length === 0) {\\n\\t return collection;\\n\\t }\\n\\t return collection.withMutations((function(collection) {\\n\\t var mergeIntoMap = merger ? (function(value, key) {\\n\\t collection.update(key, NOT_SET, (function(existing) {\\n\\t return existing === NOT_SET ? value : merger(existing, value);\\n\\t }));\\n\\t }) : (function(value, key) {\\n\\t collection.set(key, value);\\n\\t });\\n\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t iters[ii].forEach(mergeIntoMap);\\n\\t }\\n\\t }));\\n\\t}\\n\\tfunction updateInDeepMap(collection, keyPath, notSetValue, updater, offset) {\\n\\t invariant(!collection || collection.set, 'updateIn with invalid keyPath');\\n\\t var key = keyPath[offset];\\n\\t var existing = collection ? collection.get(key, NOT_SET) : NOT_SET;\\n\\t var existingValue = existing === NOT_SET ? undefined : existing;\\n\\t var value = offset === keyPath.length - 1 ? updater(existing === NOT_SET ? notSetValue : existing) : updateInDeepMap(existingValue, keyPath, notSetValue, updater, offset + 1);\\n\\t return value === existingValue ? collection : value === NOT_SET ? collection && collection.remove(key) : (collection || emptyMap()).set(key, value);\\n\\t}\\n\\tfunction popCount(x) {\\n\\t x = x - ((x >> 1) & 0x55555555);\\n\\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\\n\\t x = (x + (x >> 4)) & 0x0f0f0f0f;\\n\\t x = x + (x >> 8);\\n\\t x = x + (x >> 16);\\n\\t return x & 0x7f;\\n\\t}\\n\\tfunction setIn(array, idx, val, canEdit) {\\n\\t var newArray = canEdit ? array : arrCopy(array);\\n\\t newArray[idx] = val;\\n\\t return newArray;\\n\\t}\\n\\tfunction spliceIn(array, idx, val, canEdit) {\\n\\t var newLen = array.length + 1;\\n\\t if (canEdit && idx + 1 === newLen) {\\n\\t array[idx] = val;\\n\\t return array;\\n\\t }\\n\\t var newArray = new Array(newLen);\\n\\t var after = 0;\\n\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t if (ii === idx) {\\n\\t newArray[ii] = val;\\n\\t after = -1;\\n\\t } else {\\n\\t newArray[ii] = array[ii + after];\\n\\t }\\n\\t }\\n\\t return newArray;\\n\\t}\\n\\tfunction spliceOut(array, idx, canEdit) {\\n\\t var newLen = array.length - 1;\\n\\t if (canEdit && idx === newLen) {\\n\\t array.pop();\\n\\t return array;\\n\\t }\\n\\t var newArray = new Array(newLen);\\n\\t var after = 0;\\n\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t if (ii === idx) {\\n\\t after = 1;\\n\\t }\\n\\t newArray[ii] = array[ii + after];\\n\\t }\\n\\t return newArray;\\n\\t}\\n\\tvar MAX_BITMAP_SIZE = SIZE / 2;\\n\\tvar MIN_ARRAY_SIZE = SIZE / 4;\\n\\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\\n\\t this._iter = indexed;\\n\\t this._useKeys = useKeys;\\n\\t this.size = indexed.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(ToKeyedSequence, {\\n\\t get: function(key, notSetValue) {\\n\\t return this._iter.get(key, notSetValue);\\n\\t },\\n\\t has: function(key) {\\n\\t return this._iter.has(key);\\n\\t },\\n\\t valueSeq: function() {\\n\\t return this._iter.valueSeq();\\n\\t },\\n\\t reverse: function() {\\n\\t var $__0 = this;\\n\\t var reversedSequence = reverseFactory(this, true);\\n\\t if (!this._useKeys) {\\n\\t reversedSequence.valueSeq = (function() {\\n\\t return $__0._iter.toSeq().reverse();\\n\\t });\\n\\t }\\n\\t return reversedSequence;\\n\\t },\\n\\t map: function(mapper, context) {\\n\\t var $__0 = this;\\n\\t var mappedSequence = mapFactory(this, mapper, context);\\n\\t if (!this._useKeys) {\\n\\t mappedSequence.valueSeq = (function() {\\n\\t return $__0._iter.toSeq().map(mapper, context);\\n\\t });\\n\\t }\\n\\t return mappedSequence;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var ii;\\n\\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\\n\\t return fn(v, k, $__0);\\n\\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\\n\\t return fn(v, reverse ? --ii : ii++, $__0);\\n\\t })), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t if (this._useKeys) {\\n\\t return this._iter.__iterator(type, reverse);\\n\\t }\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t var ii = reverse ? resolveSize(this) : 0;\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\\n\\t }));\\n\\t }\\n\\t}, {}, KeyedSeq);\\n\\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\\n\\t this._iter = iter;\\n\\t this.size = iter.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(ToIndexedSequence, {\\n\\t contains: function(value) {\\n\\t return this._iter.contains(value);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t return this._iter.__iterate((function(v) {\\n\\t return fn(v, iterations++, $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar ToSetSequence = function ToSetSequence(iter) {\\n\\t this._iter = iter;\\n\\t this.size = iter.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(ToSetSequence, {\\n\\t has: function(key) {\\n\\t return this._iter.contains(key);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._iter.__iterate((function(v) {\\n\\t return fn(v, v, $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\\n\\t }));\\n\\t }\\n\\t}, {}, SetSeq);\\n\\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\\n\\t this._iter = entries;\\n\\t this.size = entries.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(FromEntriesSequence, {\\n\\t entrySeq: function() {\\n\\t return this._iter.toSeq();\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._iter.__iterate((function(entry) {\\n\\t if (entry) {\\n\\t validateEntry(entry);\\n\\t return fn(entry[1], entry[0], $__0);\\n\\t }\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t return new Iterator((function() {\\n\\t while (true) {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t if (entry) {\\n\\t validateEntry(entry);\\n\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\\n\\t }\\n\\t }\\n\\t }));\\n\\t }\\n\\t}, {}, KeyedSeq);\\n\\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\\n\\tfunction flipFactory(iterable) {\\n\\t var flipSequence = makeSequence(iterable);\\n\\t flipSequence._iter = iterable;\\n\\t flipSequence.size = iterable.size;\\n\\t flipSequence.flip = (function() {\\n\\t return iterable;\\n\\t });\\n\\t flipSequence.reverse = function() {\\n\\t var reversedSequence = iterable.reverse.apply(this);\\n\\t reversedSequence.flip = (function() {\\n\\t return iterable.reverse();\\n\\t });\\n\\t return reversedSequence;\\n\\t };\\n\\t flipSequence.has = (function(key) {\\n\\t return iterable.contains(key);\\n\\t });\\n\\t flipSequence.contains = (function(key) {\\n\\t return iterable.has(key);\\n\\t });\\n\\t flipSequence.cacheResult = cacheResultThrough;\\n\\t flipSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return iterable.__iterate((function(v, k) {\\n\\t return fn(k, v, $__0) !== false;\\n\\t }), reverse);\\n\\t };\\n\\t flipSequence.__iteratorUncached = function(type, reverse) {\\n\\t if (type === ITERATE_ENTRIES) {\\n\\t var iterator = iterable.__iterator(type, reverse);\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t if (!step.done) {\\n\\t var k = step.value[0];\\n\\t step.value[0] = step.value[1];\\n\\t step.value[1] = k;\\n\\t }\\n\\t return step;\\n\\t }));\\n\\t }\\n\\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\\n\\t };\\n\\t return flipSequence;\\n\\t}\\n\\tfunction mapFactory(iterable, mapper, context) {\\n\\t var mappedSequence = makeSequence(iterable);\\n\\t mappedSequence.size = iterable.size;\\n\\t mappedSequence.has = (function(key) {\\n\\t return iterable.has(key);\\n\\t });\\n\\t mappedSequence.get = (function(key, notSetValue) {\\n\\t var v = iterable.get(key, NOT_SET);\\n\\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\\n\\t });\\n\\t mappedSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return iterable.__iterate((function(v, k, c) {\\n\\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\\n\\t }), reverse);\\n\\t };\\n\\t mappedSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t var key = entry[0];\\n\\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\\n\\t }));\\n\\t };\\n\\t return mappedSequence;\\n\\t}\\n\\tfunction reverseFactory(iterable, useKeys) {\\n\\t var reversedSequence = makeSequence(iterable);\\n\\t reversedSequence._iter = iterable;\\n\\t reversedSequence.size = iterable.size;\\n\\t reversedSequence.reverse = (function() {\\n\\t return iterable;\\n\\t });\\n\\t if (iterable.flip) {\\n\\t reversedSequence.flip = function() {\\n\\t var flipSequence = flipFactory(iterable);\\n\\t flipSequence.reverse = (function() {\\n\\t return iterable.flip();\\n\\t });\\n\\t return flipSequence;\\n\\t };\\n\\t }\\n\\t reversedSequence.get = (function(key, notSetValue) {\\n\\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\\n\\t });\\n\\t reversedSequence.has = (function(key) {\\n\\t return iterable.has(useKeys ? key : -1 - key);\\n\\t });\\n\\t reversedSequence.contains = (function(value) {\\n\\t return iterable.contains(value);\\n\\t });\\n\\t reversedSequence.cacheResult = cacheResultThrough;\\n\\t reversedSequence.__iterate = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return iterable.__iterate((function(v, k) {\\n\\t return fn(v, k, $__0);\\n\\t }), !reverse);\\n\\t };\\n\\t reversedSequence.__iterator = (function(type, reverse) {\\n\\t return iterable.__iterator(type, !reverse);\\n\\t });\\n\\t return reversedSequence;\\n\\t}\\n\\tfunction filterFactory(iterable, predicate, context, useKeys) {\\n\\t var filterSequence = makeSequence(iterable);\\n\\t if (useKeys) {\\n\\t filterSequence.has = (function(key) {\\n\\t var v = iterable.get(key, NOT_SET);\\n\\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\\n\\t });\\n\\t filterSequence.get = (function(key, notSetValue) {\\n\\t var v = iterable.get(key, NOT_SET);\\n\\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\\n\\t });\\n\\t }\\n\\t filterSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k, c) {\\n\\t if (predicate.call(context, v, k, c)) {\\n\\t iterations++;\\n\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t }\\n\\t }), reverse);\\n\\t return iterations;\\n\\t };\\n\\t filterSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t while (true) {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t var key = entry[0];\\n\\t var value = entry[1];\\n\\t if (predicate.call(context, value, key, iterable)) {\\n\\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\\n\\t }\\n\\t }\\n\\t }));\\n\\t };\\n\\t return filterSequence;\\n\\t}\\n\\tfunction countByFactory(iterable, grouper, context) {\\n\\t var groups = Map().asMutable();\\n\\t iterable.__iterate((function(v, k) {\\n\\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\\n\\t return a + 1;\\n\\t }));\\n\\t }));\\n\\t return groups.asImmutable();\\n\\t}\\n\\tfunction groupByFactory(iterable, grouper, context) {\\n\\t var isKeyedIter = isKeyed(iterable);\\n\\t var groups = Map().asMutable();\\n\\t iterable.__iterate((function(v, k) {\\n\\t groups.update(grouper.call(context, v, k, iterable), [], (function(a) {\\n\\t return (a.push(isKeyedIter ? [k, v] : v), a);\\n\\t }));\\n\\t }));\\n\\t var coerce = iterableClass(iterable);\\n\\t return groups.map((function(arr) {\\n\\t return reify(iterable, coerce(arr));\\n\\t }));\\n\\t}\\n\\tfunction takeFactory(iterable, amount) {\\n\\t if (amount > iterable.size) {\\n\\t return iterable;\\n\\t }\\n\\t if (amount < 0) {\\n\\t amount = 0;\\n\\t }\\n\\t var takeSequence = makeSequence(iterable);\\n\\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\\n\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (amount === 0) {\\n\\t return 0;\\n\\t }\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k) {\\n\\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t if (iterations++ > amount) {\\n\\t return iteratorDone();\\n\\t }\\n\\t return iterator.next();\\n\\t }));\\n\\t };\\n\\t return takeSequence;\\n\\t}\\n\\tfunction takeWhileFactory(iterable, predicate, context) {\\n\\t var takeSequence = makeSequence(iterable);\\n\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k, c) {\\n\\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t var iterating = true;\\n\\t return new Iterator((function() {\\n\\t if (!iterating) {\\n\\t return iteratorDone();\\n\\t }\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t var k = entry[0];\\n\\t var v = entry[1];\\n\\t if (!predicate.call(context, v, k, $__0)) {\\n\\t iterating = false;\\n\\t return iteratorDone();\\n\\t }\\n\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t }));\\n\\t };\\n\\t return takeSequence;\\n\\t}\\n\\tfunction skipFactory(iterable, amount, useKeys) {\\n\\t if (amount <= 0) {\\n\\t return iterable;\\n\\t }\\n\\t var skipSequence = makeSequence(iterable);\\n\\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\\n\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var skipped = 0;\\n\\t var isSkipping = true;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k) {\\n\\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\\n\\t iterations++;\\n\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t }\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t var skipped = 0;\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t while (skipped < amount) {\\n\\t skipped++;\\n\\t iterator.next();\\n\\t }\\n\\t var step = iterator.next();\\n\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t return step;\\n\\t } else if (type === ITERATE_KEYS) {\\n\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t } else {\\n\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t }\\n\\t }));\\n\\t };\\n\\t return skipSequence;\\n\\t}\\n\\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\\n\\t var skipSequence = makeSequence(iterable);\\n\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var isSkipping = true;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k, c) {\\n\\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\\n\\t iterations++;\\n\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t }\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t var skipping = true;\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t var step,\\n\\t k,\\n\\t v;\\n\\t do {\\n\\t step = iterator.next();\\n\\t if (step.done) {\\n\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t return step;\\n\\t } else if (type === ITERATE_KEYS) {\\n\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t } else {\\n\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t }\\n\\t }\\n\\t var entry = step.value;\\n\\t k = entry[0];\\n\\t v = entry[1];\\n\\t skipping && (skipping = predicate.call(context, v, k, $__0));\\n\\t } while (skipping);\\n\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t }));\\n\\t };\\n\\t return skipSequence;\\n\\t}\\n\\tfunction concatFactory(iterable, values) {\\n\\t var isKeyedIterable = isKeyed(iterable);\\n\\t var iters = new ArraySeq([iterable].concat(values)).map((function(v) {\\n\\t if (!isIterable(v)) {\\n\\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\\n\\t } else if (isKeyedIterable) {\\n\\t v = KeyedIterable(v);\\n\\t }\\n\\t return v;\\n\\t }));\\n\\t if (isKeyedIterable) {\\n\\t iters = iters.toKeyedSeq();\\n\\t } else if (!isIndexed(iterable)) {\\n\\t iters = iters.toSetSeq();\\n\\t }\\n\\t var flat = iters.flatten(true);\\n\\t flat.size = iters.reduce((function(sum, seq) {\\n\\t if (sum !== undefined) {\\n\\t var size = seq.size;\\n\\t if (size !== undefined) {\\n\\t return sum + size;\\n\\t }\\n\\t }\\n\\t }), 0);\\n\\t return flat;\\n\\t}\\n\\tfunction flattenFactory(iterable, depth, useKeys) {\\n\\t var flatSequence = makeSequence(iterable);\\n\\t flatSequence.__iterateUncached = function(fn, reverse) {\\n\\t var iterations = 0;\\n\\t var stopped = false;\\n\\t function flatDeep(iter, currentDepth) {\\n\\t var $__0 = this;\\n\\t iter.__iterate((function(v, k) {\\n\\t if ((!depth || currentDepth < depth) && isIterable(v)) {\\n\\t flatDeep(v, currentDepth + 1);\\n\\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\\n\\t stopped = true;\\n\\t }\\n\\t return !stopped;\\n\\t }), reverse);\\n\\t }\\n\\t flatDeep(iterable, 0);\\n\\t return iterations;\\n\\t };\\n\\t flatSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(type, reverse);\\n\\t var stack = [];\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t while (iterator) {\\n\\t var step = iterator.next();\\n\\t if (step.done !== false) {\\n\\t iterator = stack.pop();\\n\\t continue;\\n\\t }\\n\\t var v = step.value;\\n\\t if (type === ITERATE_ENTRIES) {\\n\\t v = v[1];\\n\\t }\\n\\t if ((!depth || stack.length < depth) && isIterable(v)) {\\n\\t stack.push(iterator);\\n\\t iterator = v.__iterator(type, reverse);\\n\\t } else {\\n\\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\\n\\t }\\n\\t }\\n\\t return iteratorDone();\\n\\t }));\\n\\t };\\n\\t return flatSequence;\\n\\t}\\n\\tfunction flatMapFactory(iterable, mapper, context) {\\n\\t var coerce = iterableClass(iterable);\\n\\t return iterable.toSeq().map((function(v, k) {\\n\\t return coerce(mapper.call(context, v, k, iterable));\\n\\t })).flatten(true);\\n\\t}\\n\\tfunction interposeFactory(iterable, separator) {\\n\\t var interposedSequence = makeSequence(iterable);\\n\\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\\n\\t interposedSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k) {\\n\\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\\n\\t }), reverse);\\n\\t return iterations;\\n\\t };\\n\\t interposedSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\\n\\t var iterations = 0;\\n\\t var step;\\n\\t return new Iterator((function() {\\n\\t if (!step || iterations % 2) {\\n\\t step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t }\\n\\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\\n\\t }));\\n\\t };\\n\\t return interposedSequence;\\n\\t}\\n\\tfunction reify(iter, seq) {\\n\\t return isSeq(iter) ? seq : iter.constructor(seq);\\n\\t}\\n\\tfunction validateEntry(entry) {\\n\\t if (entry !== Object(entry)) {\\n\\t throw new TypeError('Expected [K, V] tuple: ' + entry);\\n\\t }\\n\\t}\\n\\tfunction resolveSize(iter) {\\n\\t assertNotInfinite(iter.size);\\n\\t return ensureSize(iter);\\n\\t}\\n\\tfunction iterableClass(iterable) {\\n\\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\\n\\t}\\n\\tfunction makeSequence(iterable) {\\n\\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\\n\\t}\\n\\tfunction cacheResultThrough() {\\n\\t if (this._iter.cacheResult) {\\n\\t this._iter.cacheResult();\\n\\t this.size = this._iter.size;\\n\\t return this;\\n\\t } else {\\n\\t return Seq.prototype.cacheResult.call(this);\\n\\t }\\n\\t}\\n\\tvar List = function List(value) {\\n\\t var empty = emptyList();\\n\\t if (value === null || value === undefined) {\\n\\t return empty;\\n\\t }\\n\\t if (isList(value)) {\\n\\t return value;\\n\\t }\\n\\t value = IndexedIterable(value);\\n\\t var size = value.size;\\n\\t if (size === 0) {\\n\\t return empty;\\n\\t }\\n\\t if (size > 0 && size < SIZE) {\\n\\t return makeList(0, size, SHIFT, null, new VNode(value.toArray()));\\n\\t }\\n\\t return empty.merge(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(List, {\\n\\t toString: function() {\\n\\t return this.__toString('List [', ']');\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t if (index < 0 || index >= this.size) {\\n\\t return notSetValue;\\n\\t }\\n\\t index += this._origin;\\n\\t var node = listNodeFor(this, index);\\n\\t return node && node.array[index & MASK];\\n\\t },\\n\\t set: function(index, value) {\\n\\t return updateList(this, index, value);\\n\\t },\\n\\t remove: function(index) {\\n\\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = this._origin = this._capacity = 0;\\n\\t this._level = SHIFT;\\n\\t this._root = this._tail = null;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return emptyList();\\n\\t },\\n\\t push: function() {\\n\\t var values = arguments;\\n\\t var oldSize = this.size;\\n\\t return this.withMutations((function(list) {\\n\\t setListBounds(list, 0, oldSize + values.length);\\n\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t list.set(oldSize + ii, values[ii]);\\n\\t }\\n\\t }));\\n\\t },\\n\\t pop: function() {\\n\\t return setListBounds(this, 0, -1);\\n\\t },\\n\\t unshift: function() {\\n\\t var values = arguments;\\n\\t return this.withMutations((function(list) {\\n\\t setListBounds(list, -values.length);\\n\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t list.set(ii, values[ii]);\\n\\t }\\n\\t }));\\n\\t },\\n\\t shift: function() {\\n\\t return setListBounds(this, 1);\\n\\t },\\n\\t merge: function() {\\n\\t return mergeIntoListWith(this, undefined, arguments);\\n\\t },\\n\\t mergeWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__5 = 1; $__5 < arguments.length; $__5++)\\n\\t iters[$__5 - 1] = arguments[$__5];\\n\\t return mergeIntoListWith(this, merger, iters);\\n\\t },\\n\\t mergeDeep: function() {\\n\\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\\n\\t },\\n\\t mergeDeepWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__6 = 1; $__6 < arguments.length; $__6++)\\n\\t iters[$__6 - 1] = arguments[$__6];\\n\\t return mergeIntoListWith(this, deepMerger(merger), iters);\\n\\t },\\n\\t setSize: function(size) {\\n\\t return setListBounds(this, 0, size);\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t var size = this.size;\\n\\t if (wholeSlice(begin, end, size)) {\\n\\t return this;\\n\\t }\\n\\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return new ListIterator(this, type, reverse);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t var eachFn = (function(v) {\\n\\t return fn(v, iterations++, $__0);\\n\\t });\\n\\t var tailOffset = getTailOffset(this._capacity);\\n\\t if (reverse) {\\n\\t iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse) && iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse);\\n\\t } else {\\n\\t iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse) && iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse);\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t return this;\\n\\t }\\n\\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\\n\\t }\\n\\t}, {of: function() {\\n\\t return this(arguments);\\n\\t }}, IndexedCollection);\\n\\tfunction isList(maybeList) {\\n\\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\\n\\t}\\n\\tList.isList = isList;\\n\\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\\n\\tvar ListPrototype = List.prototype;\\n\\tListPrototype[IS_LIST_SENTINEL] = true;\\n\\tListPrototype[DELETE] = ListPrototype.remove;\\n\\tListPrototype.setIn = MapPrototype.setIn;\\n\\tListPrototype.removeIn = MapPrototype.removeIn;\\n\\tListPrototype.update = MapPrototype.update;\\n\\tListPrototype.updateIn = MapPrototype.updateIn;\\n\\tListPrototype.withMutations = MapPrototype.withMutations;\\n\\tListPrototype.asMutable = MapPrototype.asMutable;\\n\\tListPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tListPrototype.wasAltered = MapPrototype.wasAltered;\\n\\tvar VNode = function VNode(array, ownerID) {\\n\\t this.array = array;\\n\\t this.ownerID = ownerID;\\n\\t};\\n\\tvar $VNode = VNode;\\n\\t($traceurRuntime.createClass)(VNode, {\\n\\t removeBefore: function(ownerID, level, index) {\\n\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t return this;\\n\\t }\\n\\t var originIndex = (index >>> level) & MASK;\\n\\t if (originIndex >= this.array.length) {\\n\\t return new $VNode([], ownerID);\\n\\t }\\n\\t var removingFirst = originIndex === 0;\\n\\t var newChild;\\n\\t if (level > 0) {\\n\\t var oldChild = this.array[originIndex];\\n\\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\\n\\t if (newChild === oldChild && removingFirst) {\\n\\t return this;\\n\\t }\\n\\t }\\n\\t if (removingFirst && !newChild) {\\n\\t return this;\\n\\t }\\n\\t var editable = editableVNode(this, ownerID);\\n\\t if (!removingFirst) {\\n\\t for (var ii = 0; ii < originIndex; ii++) {\\n\\t editable.array[ii] = undefined;\\n\\t }\\n\\t }\\n\\t if (newChild) {\\n\\t editable.array[originIndex] = newChild;\\n\\t }\\n\\t return editable;\\n\\t },\\n\\t removeAfter: function(ownerID, level, index) {\\n\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t return this;\\n\\t }\\n\\t var sizeIndex = ((index - 1) >>> level) & MASK;\\n\\t if (sizeIndex >= this.array.length) {\\n\\t return this;\\n\\t }\\n\\t var removingLast = sizeIndex === this.array.length - 1;\\n\\t var newChild;\\n\\t if (level > 0) {\\n\\t var oldChild = this.array[sizeIndex];\\n\\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\\n\\t if (newChild === oldChild && removingLast) {\\n\\t return this;\\n\\t }\\n\\t }\\n\\t if (removingLast && !newChild) {\\n\\t return this;\\n\\t }\\n\\t var editable = editableVNode(this, ownerID);\\n\\t if (!removingLast) {\\n\\t editable.array.pop();\\n\\t }\\n\\t if (newChild) {\\n\\t editable.array[sizeIndex] = newChild;\\n\\t }\\n\\t return editable;\\n\\t }\\n\\t}, {});\\n\\tfunction iterateVNode(node, level, offset, max, fn, reverse) {\\n\\t var ii;\\n\\t var array = node && node.array;\\n\\t if (level === 0) {\\n\\t var from = offset < 0 ? -offset : 0;\\n\\t var to = max - offset;\\n\\t if (to > SIZE) {\\n\\t to = SIZE;\\n\\t }\\n\\t for (ii = from; ii < to; ii++) {\\n\\t if (fn(array && array[reverse ? from + to - 1 - ii : ii]) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t } else {\\n\\t var step = 1 << level;\\n\\t var newLevel = level - SHIFT;\\n\\t for (ii = 0; ii <= MASK; ii++) {\\n\\t var levelIndex = reverse ? MASK - ii : ii;\\n\\t var newOffset = offset + (levelIndex << level);\\n\\t if (newOffset < max && newOffset + step > 0) {\\n\\t var nextNode = array && array[levelIndex];\\n\\t if (!iterateVNode(nextNode, newLevel, newOffset, max, fn, reverse)) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t }\\n\\t return true;\\n\\t}\\n\\tvar ListIterator = function ListIterator(list, type, reverse) {\\n\\t this._type = type;\\n\\t this._reverse = !!reverse;\\n\\t this._maxIndex = list.size - 1;\\n\\t var tailOffset = getTailOffset(list._capacity);\\n\\t var rootStack = listIteratorFrame(list._root && list._root.array, list._level, -list._origin, tailOffset - list._origin - 1);\\n\\t var tailStack = listIteratorFrame(list._tail && list._tail.array, 0, tailOffset - list._origin, list._capacity - list._origin - 1);\\n\\t this._stack = reverse ? tailStack : rootStack;\\n\\t this._stack.__prev = reverse ? rootStack : tailStack;\\n\\t};\\n\\t($traceurRuntime.createClass)(ListIterator, {next: function() {\\n\\t var stack = this._stack;\\n\\t while (stack) {\\n\\t var array = stack.array;\\n\\t var rawIndex = stack.index++;\\n\\t if (this._reverse) {\\n\\t rawIndex = MASK - rawIndex;\\n\\t if (rawIndex > stack.rawMax) {\\n\\t rawIndex = stack.rawMax;\\n\\t stack.index = SIZE - rawIndex;\\n\\t }\\n\\t }\\n\\t if (rawIndex >= 0 && rawIndex < SIZE && rawIndex <= stack.rawMax) {\\n\\t var value = array && array[rawIndex];\\n\\t if (stack.level === 0) {\\n\\t var type = this._type;\\n\\t var index;\\n\\t if (type !== 1) {\\n\\t index = stack.offset + (rawIndex << stack.level);\\n\\t if (this._reverse) {\\n\\t index = this._maxIndex - index;\\n\\t }\\n\\t }\\n\\t return iteratorValue(type, index, value);\\n\\t } else {\\n\\t this._stack = stack = listIteratorFrame(value && value.array, stack.level - SHIFT, stack.offset + (rawIndex << stack.level), stack.max, stack);\\n\\t }\\n\\t continue;\\n\\t }\\n\\t stack = this._stack = this._stack.__prev;\\n\\t }\\n\\t return iteratorDone();\\n\\t }}, {}, Iterator);\\n\\tfunction listIteratorFrame(array, level, offset, max, prevFrame) {\\n\\t return {\\n\\t array: array,\\n\\t level: level,\\n\\t offset: offset,\\n\\t max: max,\\n\\t rawMax: ((max - offset) >> level),\\n\\t index: 0,\\n\\t __prev: prevFrame\\n\\t };\\n\\t}\\n\\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\\n\\t var list = Object.create(ListPrototype);\\n\\t list.size = capacity - origin;\\n\\t list._origin = origin;\\n\\t list._capacity = capacity;\\n\\t list._level = level;\\n\\t list._root = root;\\n\\t list._tail = tail;\\n\\t list.__ownerID = ownerID;\\n\\t list.__hash = hash;\\n\\t list.__altered = false;\\n\\t return list;\\n\\t}\\n\\tvar EMPTY_LIST;\\n\\tfunction emptyList() {\\n\\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\\n\\t}\\n\\tfunction updateList(list, index, value) {\\n\\t index = wrapIndex(list, index);\\n\\t if (index >= list.size || index < 0) {\\n\\t return list.withMutations((function(list) {\\n\\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\\n\\t }));\\n\\t }\\n\\t index += list._origin;\\n\\t var newTail = list._tail;\\n\\t var newRoot = list._root;\\n\\t var didAlter = MakeRef(DID_ALTER);\\n\\t if (index >= getTailOffset(list._capacity)) {\\n\\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\\n\\t } else {\\n\\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\\n\\t }\\n\\t if (!didAlter.value) {\\n\\t return list;\\n\\t }\\n\\t if (list.__ownerID) {\\n\\t list._root = newRoot;\\n\\t list._tail = newTail;\\n\\t list.__hash = undefined;\\n\\t list.__altered = true;\\n\\t return list;\\n\\t }\\n\\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\\n\\t}\\n\\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\\n\\t var idx = (index >>> level) & MASK;\\n\\t var nodeHas = node && idx < node.array.length;\\n\\t if (!nodeHas && value === undefined) {\\n\\t return node;\\n\\t }\\n\\t var newNode;\\n\\t if (level > 0) {\\n\\t var lowerNode = node && node.array[idx];\\n\\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\\n\\t if (newLowerNode === lowerNode) {\\n\\t return node;\\n\\t }\\n\\t newNode = editableVNode(node, ownerID);\\n\\t newNode.array[idx] = newLowerNode;\\n\\t return newNode;\\n\\t }\\n\\t if (nodeHas && node.array[idx] === value) {\\n\\t return node;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t newNode = editableVNode(node, ownerID);\\n\\t if (value === undefined && idx === newNode.array.length - 1) {\\n\\t newNode.array.pop();\\n\\t } else {\\n\\t newNode.array[idx] = value;\\n\\t }\\n\\t return newNode;\\n\\t}\\n\\tfunction editableVNode(node, ownerID) {\\n\\t if (ownerID && node && ownerID === node.ownerID) {\\n\\t return node;\\n\\t }\\n\\t return new VNode(node ? node.array.slice() : [], ownerID);\\n\\t}\\n\\tfunction listNodeFor(list, rawIndex) {\\n\\t if (rawIndex >= getTailOffset(list._capacity)) {\\n\\t return list._tail;\\n\\t }\\n\\t if (rawIndex < 1 << (list._level + SHIFT)) {\\n\\t var node = list._root;\\n\\t var level = list._level;\\n\\t while (node && level > 0) {\\n\\t node = node.array[(rawIndex >>> level) & MASK];\\n\\t level -= SHIFT;\\n\\t }\\n\\t return node;\\n\\t }\\n\\t}\\n\\tfunction setListBounds(list, begin, end) {\\n\\t var owner = list.__ownerID || new OwnerID();\\n\\t var oldOrigin = list._origin;\\n\\t var oldCapacity = list._capacity;\\n\\t var newOrigin = oldOrigin + begin;\\n\\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\\n\\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\\n\\t return list;\\n\\t }\\n\\t if (newOrigin >= newCapacity) {\\n\\t return list.clear();\\n\\t }\\n\\t var newLevel = list._level;\\n\\t var newRoot = list._root;\\n\\t var offsetShift = 0;\\n\\t while (newOrigin + offsetShift < 0) {\\n\\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\\n\\t newLevel += SHIFT;\\n\\t offsetShift += 1 << newLevel;\\n\\t }\\n\\t if (offsetShift) {\\n\\t newOrigin += offsetShift;\\n\\t oldOrigin += offsetShift;\\n\\t newCapacity += offsetShift;\\n\\t oldCapacity += offsetShift;\\n\\t }\\n\\t var oldTailOffset = getTailOffset(oldCapacity);\\n\\t var newTailOffset = getTailOffset(newCapacity);\\n\\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\\n\\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\\n\\t newLevel += SHIFT;\\n\\t }\\n\\t var oldTail = list._tail;\\n\\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\\n\\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\\n\\t newRoot = editableVNode(newRoot, owner);\\n\\t var node = newRoot;\\n\\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\\n\\t var idx = (oldTailOffset >>> level) & MASK;\\n\\t node = node.array[idx] = editableVNode(node.array[idx], owner);\\n\\t }\\n\\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\\n\\t }\\n\\t if (newCapacity < oldCapacity) {\\n\\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\\n\\t }\\n\\t if (newOrigin >= newTailOffset) {\\n\\t newOrigin -= newTailOffset;\\n\\t newCapacity -= newTailOffset;\\n\\t newLevel = SHIFT;\\n\\t newRoot = null;\\n\\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\\n\\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\\n\\t offsetShift = 0;\\n\\t while (newRoot) {\\n\\t var beginIndex = (newOrigin >>> newLevel) & MASK;\\n\\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\\n\\t break;\\n\\t }\\n\\t if (beginIndex) {\\n\\t offsetShift += (1 << newLevel) * beginIndex;\\n\\t }\\n\\t newLevel -= SHIFT;\\n\\t newRoot = newRoot.array[beginIndex];\\n\\t }\\n\\t if (newRoot && newOrigin > oldOrigin) {\\n\\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\\n\\t }\\n\\t if (newRoot && newTailOffset < oldTailOffset) {\\n\\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\\n\\t }\\n\\t if (offsetShift) {\\n\\t newOrigin -= offsetShift;\\n\\t newCapacity -= offsetShift;\\n\\t }\\n\\t }\\n\\t if (list.__ownerID) {\\n\\t list.size = newCapacity - newOrigin;\\n\\t list._origin = newOrigin;\\n\\t list._capacity = newCapacity;\\n\\t list._level = newLevel;\\n\\t list._root = newRoot;\\n\\t list._tail = newTail;\\n\\t list.__hash = undefined;\\n\\t list.__altered = true;\\n\\t return list;\\n\\t }\\n\\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\\n\\t}\\n\\tfunction mergeIntoListWith(list, merger, iterables) {\\n\\t var iters = [];\\n\\t var maxSize = 0;\\n\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t var value = iterables[ii];\\n\\t var iter = IndexedIterable(value);\\n\\t if (iter.size > maxSize) {\\n\\t maxSize = iter.size;\\n\\t }\\n\\t if (!isIterable(value)) {\\n\\t iter = iter.map((function(v) {\\n\\t return fromJS(v);\\n\\t }));\\n\\t }\\n\\t iters.push(iter);\\n\\t }\\n\\t if (maxSize > list.size) {\\n\\t list = list.setSize(maxSize);\\n\\t }\\n\\t return mergeIntoCollectionWith(list, merger, iters);\\n\\t}\\n\\tfunction getTailOffset(size) {\\n\\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\\n\\t}\\n\\tvar Stack = function Stack(value) {\\n\\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\\n\\t};\\n\\tvar $Stack = Stack;\\n\\t($traceurRuntime.createClass)(Stack, {\\n\\t toString: function() {\\n\\t return this.__toString('Stack [', ']');\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t var head = this._head;\\n\\t while (head && index--) {\\n\\t head = head.next;\\n\\t }\\n\\t return head ? head.value : notSetValue;\\n\\t },\\n\\t peek: function() {\\n\\t return this._head && this._head.value;\\n\\t },\\n\\t push: function() {\\n\\t if (arguments.length === 0) {\\n\\t return this;\\n\\t }\\n\\t var newSize = this.size + arguments.length;\\n\\t var head = this._head;\\n\\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\\n\\t head = {\\n\\t value: arguments[ii],\\n\\t next: head\\n\\t };\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = newSize;\\n\\t this._head = head;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return makeStack(newSize, head);\\n\\t },\\n\\t pushAll: function(iter) {\\n\\t iter = IndexedIterable(iter);\\n\\t if (iter.size === 0) {\\n\\t return this;\\n\\t }\\n\\t var newSize = this.size;\\n\\t var head = this._head;\\n\\t iter.reverse().forEach((function(value) {\\n\\t newSize++;\\n\\t head = {\\n\\t value: value,\\n\\t next: head\\n\\t };\\n\\t }));\\n\\t if (this.__ownerID) {\\n\\t this.size = newSize;\\n\\t this._head = head;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return makeStack(newSize, head);\\n\\t },\\n\\t pop: function() {\\n\\t return this.slice(1);\\n\\t },\\n\\t unshift: function() {\\n\\t return this.push.apply(this, arguments);\\n\\t },\\n\\t unshiftAll: function(iter) {\\n\\t return this.pushAll(iter);\\n\\t },\\n\\t shift: function() {\\n\\t return this.pop.apply(this, arguments);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._head = undefined;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return emptyStack();\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t if (wholeSlice(begin, end, this.size)) {\\n\\t return this;\\n\\t }\\n\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t if (resolvedEnd !== this.size) {\\n\\t return $traceurRuntime.superCall(this, $Stack.prototype, \\\"slice\\\", [begin, end]);\\n\\t }\\n\\t var newSize = this.size - resolvedBegin;\\n\\t var head = this._head;\\n\\t while (resolvedBegin--) {\\n\\t head = head.next;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = newSize;\\n\\t this._head = head;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return makeStack(newSize, head);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this.__altered = false;\\n\\t return this;\\n\\t }\\n\\t return makeStack(this.size, this._head, ownerID, this.__hash);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t if (reverse) {\\n\\t return this.toSeq().cacheResult.__iterate(fn, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t var node = this._head;\\n\\t while (node) {\\n\\t if (fn(node.value, iterations++, this) === false) {\\n\\t break;\\n\\t }\\n\\t node = node.next;\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.toSeq().cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t var node = this._head;\\n\\t return new Iterator((function() {\\n\\t if (node) {\\n\\t var value = node.value;\\n\\t node = node.next;\\n\\t return iteratorValue(type, iterations++, value);\\n\\t }\\n\\t return iteratorDone();\\n\\t }));\\n\\t }\\n\\t}, {of: function() {\\n\\t return this(arguments);\\n\\t }}, IndexedCollection);\\n\\tfunction isStack(maybeStack) {\\n\\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\\n\\t}\\n\\tStack.isStack = isStack;\\n\\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\\n\\tvar StackPrototype = Stack.prototype;\\n\\tStackPrototype[IS_STACK_SENTINEL] = true;\\n\\tStackPrototype.withMutations = MapPrototype.withMutations;\\n\\tStackPrototype.asMutable = MapPrototype.asMutable;\\n\\tStackPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tStackPrototype.wasAltered = MapPrototype.wasAltered;\\n\\tfunction makeStack(size, head, ownerID, hash) {\\n\\t var map = Object.create(StackPrototype);\\n\\t map.size = size;\\n\\t map._head = head;\\n\\t map.__ownerID = ownerID;\\n\\t map.__hash = hash;\\n\\t map.__altered = false;\\n\\t return map;\\n\\t}\\n\\tvar EMPTY_STACK;\\n\\tfunction emptyStack() {\\n\\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\\n\\t}\\n\\tvar Set = function Set(value) {\\n\\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().union(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(Set, {\\n\\t toString: function() {\\n\\t return this.__toString('Set {', '}');\\n\\t },\\n\\t has: function(value) {\\n\\t return this._map.has(value);\\n\\t },\\n\\t add: function(value) {\\n\\t var newMap = this._map.set(value, true);\\n\\t if (this.__ownerID) {\\n\\t this.size = newMap.size;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return newMap === this._map ? this : makeSet(newMap);\\n\\t },\\n\\t remove: function(value) {\\n\\t var newMap = this._map.remove(value);\\n\\t if (this.__ownerID) {\\n\\t this.size = newMap.size;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return newMap === this._map ? this : newMap.size === 0 ? emptySet() : makeSet(newMap);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._map.clear();\\n\\t return this;\\n\\t }\\n\\t return emptySet();\\n\\t },\\n\\t union: function() {\\n\\t var iters = arguments;\\n\\t if (iters.length === 0) {\\n\\t return this;\\n\\t }\\n\\t return this.withMutations((function(set) {\\n\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t SetIterable(iters[ii]).forEach((function(value) {\\n\\t return set.add(value);\\n\\t }));\\n\\t }\\n\\t }));\\n\\t },\\n\\t intersect: function() {\\n\\t for (var iters = [],\\n\\t $__7 = 0; $__7 < arguments.length; $__7++)\\n\\t iters[$__7] = arguments[$__7];\\n\\t if (iters.length === 0) {\\n\\t return this;\\n\\t }\\n\\t iters = iters.map((function(iter) {\\n\\t return SetIterable(iter);\\n\\t }));\\n\\t var originalSet = this;\\n\\t return this.withMutations((function(set) {\\n\\t originalSet.forEach((function(value) {\\n\\t if (!iters.every((function(iter) {\\n\\t return iter.contains(value);\\n\\t }))) {\\n\\t set.remove(value);\\n\\t }\\n\\t }));\\n\\t }));\\n\\t },\\n\\t subtract: function() {\\n\\t for (var iters = [],\\n\\t $__8 = 0; $__8 < arguments.length; $__8++)\\n\\t iters[$__8] = arguments[$__8];\\n\\t if (iters.length === 0) {\\n\\t return this;\\n\\t }\\n\\t iters = iters.map((function(iter) {\\n\\t return SetIterable(iter);\\n\\t }));\\n\\t var originalSet = this;\\n\\t return this.withMutations((function(set) {\\n\\t originalSet.forEach((function(value) {\\n\\t if (iters.some((function(iter) {\\n\\t return iter.contains(value);\\n\\t }))) {\\n\\t set.remove(value);\\n\\t }\\n\\t }));\\n\\t }));\\n\\t },\\n\\t merge: function() {\\n\\t return this.union.apply(this, arguments);\\n\\t },\\n\\t mergeWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__9 = 1; $__9 < arguments.length; $__9++)\\n\\t iters[$__9 - 1] = arguments[$__9];\\n\\t return this.union.apply(this, iters);\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this._map.wasAltered();\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._map.__iterate((function(_, k) {\\n\\t return fn(k, k, $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return this._map.map((function(_, k) {\\n\\t return k;\\n\\t })).__iterator(type, reverse);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return makeSet(newMap, ownerID);\\n\\t }\\n\\t}, {\\n\\t of: function() {\\n\\t return this(arguments);\\n\\t },\\n\\t fromKeys: function(value) {\\n\\t return this(KeyedSeq(value).flip().valueSeq());\\n\\t }\\n\\t}, SetCollection);\\n\\tfunction isSet(maybeSet) {\\n\\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\\n\\t}\\n\\tSet.isSet = isSet;\\n\\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\\n\\tvar SetPrototype = Set.prototype;\\n\\tSetPrototype[IS_SET_SENTINEL] = true;\\n\\tSetPrototype[DELETE] = SetPrototype.remove;\\n\\tSetPrototype.mergeDeep = SetPrototype.merge;\\n\\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\\n\\tSetPrototype.withMutations = MapPrototype.withMutations;\\n\\tSetPrototype.asMutable = MapPrototype.asMutable;\\n\\tSetPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tfunction makeSet(map, ownerID) {\\n\\t var set = Object.create(SetPrototype);\\n\\t set.size = map ? map.size : 0;\\n\\t set._map = map;\\n\\t set.__ownerID = ownerID;\\n\\t return set;\\n\\t}\\n\\tvar EMPTY_SET;\\n\\tfunction emptySet() {\\n\\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\\n\\t}\\n\\tvar OrderedMap = function OrderedMap(value) {\\n\\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().merge(KeyedIterable(value));\\n\\t};\\n\\t($traceurRuntime.createClass)(OrderedMap, {\\n\\t toString: function() {\\n\\t return this.__toString('OrderedMap {', '}');\\n\\t },\\n\\t get: function(k, notSetValue) {\\n\\t var index = this._map.get(k);\\n\\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._map.clear();\\n\\t this._list.clear();\\n\\t return this;\\n\\t }\\n\\t return emptyOrderedMap();\\n\\t },\\n\\t set: function(k, v) {\\n\\t return updateOrderedMap(this, k, v);\\n\\t },\\n\\t remove: function(k) {\\n\\t return updateOrderedMap(this, k, NOT_SET);\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this._map.wasAltered() || this._list.wasAltered();\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._list.__iterate((function(entry) {\\n\\t return entry && fn(entry[1], entry[0], $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return this._list.fromEntrySeq().__iterator(type, reverse);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t var newList = this._list.__ensureOwner(ownerID);\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this._map = newMap;\\n\\t this._list = newList;\\n\\t return this;\\n\\t }\\n\\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\\n\\t }\\n\\t}, {of: function() {\\n\\t return this(arguments);\\n\\t }}, Map);\\n\\tfunction isOrderedMap(maybeOrderedMap) {\\n\\t return !!(maybeOrderedMap && maybeOrderedMap[IS_ORDERED_MAP_SENTINEL]);\\n\\t}\\n\\tOrderedMap.isOrderedMap = isOrderedMap;\\n\\tvar IS_ORDERED_MAP_SENTINEL = '@@__IMMUTABLE_ORDERED_MAP__@@';\\n\\tOrderedMap.prototype[IS_ORDERED_MAP_SENTINEL] = true;\\n\\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\\n\\tfunction makeOrderedMap(map, list, ownerID, hash) {\\n\\t var omap = Object.create(OrderedMap.prototype);\\n\\t omap.size = map ? map.size : 0;\\n\\t omap._map = map;\\n\\t omap._list = list;\\n\\t omap.__ownerID = ownerID;\\n\\t omap.__hash = hash;\\n\\t return omap;\\n\\t}\\n\\tvar EMPTY_ORDERED_MAP;\\n\\tfunction emptyOrderedMap() {\\n\\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\\n\\t}\\n\\tfunction updateOrderedMap(omap, k, v) {\\n\\t var map = omap._map;\\n\\t var list = omap._list;\\n\\t var i = map.get(k);\\n\\t var has = i !== undefined;\\n\\t var removed = v === NOT_SET;\\n\\t if ((!has && removed) || (has && v === list.get(i)[1])) {\\n\\t return omap;\\n\\t }\\n\\t if (!has) {\\n\\t i = list.size;\\n\\t }\\n\\t var newMap = removed ? map.remove(k) : has ? map : map.set(k, i);\\n\\t var newList = removed ? list.set(i, undefined) : list.set(i, [k, v]);\\n\\t if (omap.__ownerID) {\\n\\t omap.size = newMap.size;\\n\\t omap._map = newMap;\\n\\t omap._list = newList;\\n\\t omap.__hash = undefined;\\n\\t return omap;\\n\\t }\\n\\t return makeOrderedMap(newMap, newList);\\n\\t}\\n\\tvar Record = function Record(defaultValues, name) {\\n\\t var RecordType = function Record(values) {\\n\\t if (!(this instanceof RecordType)) {\\n\\t return new RecordType(values);\\n\\t }\\n\\t this._map = Map(values);\\n\\t };\\n\\t var keys = Object.keys(defaultValues);\\n\\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\\n\\t RecordTypePrototype.constructor = RecordType;\\n\\t name && (RecordTypePrototype._name = name);\\n\\t RecordTypePrototype._defaultValues = defaultValues;\\n\\t RecordTypePrototype._keys = keys;\\n\\t RecordTypePrototype.size = keys.length;\\n\\t try {\\n\\t keys.forEach((function(key) {\\n\\t Object.defineProperty(RecordType.prototype, key, {\\n\\t get: function() {\\n\\t return this.get(key);\\n\\t },\\n\\t set: function(value) {\\n\\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\\n\\t this.set(key, value);\\n\\t }\\n\\t });\\n\\t }));\\n\\t } catch (error) {}\\n\\t return RecordType;\\n\\t};\\n\\t($traceurRuntime.createClass)(Record, {\\n\\t toString: function() {\\n\\t return this.__toString(recordName(this) + ' {', '}');\\n\\t },\\n\\t has: function(k) {\\n\\t return this._defaultValues.hasOwnProperty(k);\\n\\t },\\n\\t get: function(k, notSetValue) {\\n\\t if (notSetValue !== undefined && !this.has(k)) {\\n\\t return notSetValue;\\n\\t }\\n\\t var defaultVal = this._defaultValues[k];\\n\\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\\n\\t },\\n\\t clear: function() {\\n\\t if (this.__ownerID) {\\n\\t this._map && this._map.clear();\\n\\t return this;\\n\\t }\\n\\t var SuperRecord = Object.getPrototypeOf(this).constructor;\\n\\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\\n\\t },\\n\\t set: function(k, v) {\\n\\t if (!this.has(k)) {\\n\\t throw new Error('Cannot set unknown key \\\"' + k + '\\\" on ' + recordName(this));\\n\\t }\\n\\t var newMap = this._map && this._map.set(k, v);\\n\\t if (this.__ownerID || newMap === this._map) {\\n\\t return this;\\n\\t }\\n\\t return makeRecord(this, newMap);\\n\\t },\\n\\t remove: function(k) {\\n\\t if (!this.has(k)) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map && this._map.remove(k);\\n\\t if (this.__ownerID || newMap === this._map) {\\n\\t return this;\\n\\t }\\n\\t return makeRecord(this, newMap);\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this._map.wasAltered();\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var $__0 = this;\\n\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t return $__0.get(k);\\n\\t })).__iterator(type, reverse);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t return $__0.get(k);\\n\\t })).__iterate(fn, reverse);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map && this._map.__ensureOwner(ownerID);\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return makeRecord(this, newMap, ownerID);\\n\\t }\\n\\t}, {}, KeyedCollection);\\n\\tvar RecordPrototype = Record.prototype;\\n\\tRecordPrototype[DELETE] = RecordPrototype.remove;\\n\\tRecordPrototype.merge = MapPrototype.merge;\\n\\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\\n\\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\\n\\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\\n\\tRecordPrototype.update = MapPrototype.update;\\n\\tRecordPrototype.updateIn = MapPrototype.updateIn;\\n\\tRecordPrototype.withMutations = MapPrototype.withMutations;\\n\\tRecordPrototype.asMutable = MapPrototype.asMutable;\\n\\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tfunction makeRecord(likeRecord, map, ownerID) {\\n\\t var record = Object.create(Object.getPrototypeOf(likeRecord));\\n\\t record._map = map;\\n\\t record.__ownerID = ownerID;\\n\\t return record;\\n\\t}\\n\\tfunction recordName(record) {\\n\\t return record._name || record.constructor.name;\\n\\t}\\n\\tvar Range = function Range(start, end, step) {\\n\\t if (!(this instanceof $Range)) {\\n\\t return new $Range(start, end, step);\\n\\t }\\n\\t invariant(step !== 0, 'Cannot step a Range by 0');\\n\\t start = start || 0;\\n\\t if (end === undefined) {\\n\\t end = Infinity;\\n\\t }\\n\\t if (start === end && __EMPTY_RANGE) {\\n\\t return __EMPTY_RANGE;\\n\\t }\\n\\t step = step === undefined ? 1 : Math.abs(step);\\n\\t if (end < start) {\\n\\t step = -step;\\n\\t }\\n\\t this._start = start;\\n\\t this._end = end;\\n\\t this._step = step;\\n\\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\\n\\t};\\n\\tvar $Range = Range;\\n\\t($traceurRuntime.createClass)(Range, {\\n\\t toString: function() {\\n\\t if (this.size === 0) {\\n\\t return 'Range []';\\n\\t }\\n\\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\\n\\t },\\n\\t contains: function(searchValue) {\\n\\t var possibleIndex = (searchValue - this._start) / this._step;\\n\\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t if (wholeSlice(begin, end, this.size)) {\\n\\t return this;\\n\\t }\\n\\t begin = resolveBegin(begin, this.size);\\n\\t end = resolveEnd(end, this.size);\\n\\t if (end <= begin) {\\n\\t return __EMPTY_RANGE;\\n\\t }\\n\\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\\n\\t },\\n\\t indexOf: function(searchValue) {\\n\\t var offsetValue = searchValue - this._start;\\n\\t if (offsetValue % this._step === 0) {\\n\\t var index = offsetValue / this._step;\\n\\t if (index >= 0 && index < this.size) {\\n\\t return index;\\n\\t }\\n\\t }\\n\\t return -1;\\n\\t },\\n\\t lastIndexOf: function(searchValue) {\\n\\t return this.indexOf(searchValue);\\n\\t },\\n\\t take: function(amount) {\\n\\t return this.slice(0, Math.max(0, amount));\\n\\t },\\n\\t skip: function(amount) {\\n\\t return this.slice(Math.max(0, amount));\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var maxIndex = this.size - 1;\\n\\t var step = this._step;\\n\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t if (fn(value, ii, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t value += reverse ? -step : step;\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var maxIndex = this.size - 1;\\n\\t var step = this._step;\\n\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t var v = value;\\n\\t value += reverse ? -step : step;\\n\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\\n\\t }));\\n\\t },\\n\\t __deepEquals: function(other) {\\n\\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : $traceurRuntime.superCall(this, $Range.prototype, \\\"__deepEquals\\\", [other]);\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar RangePrototype = Range.prototype;\\n\\tRangePrototype.__toJS = RangePrototype.toArray;\\n\\tRangePrototype.first = ListPrototype.first;\\n\\tRangePrototype.last = ListPrototype.last;\\n\\tvar __EMPTY_RANGE = Range(0, 0);\\n\\tvar Repeat = function Repeat(value, times) {\\n\\t if (times <= 0 && EMPTY_REPEAT) {\\n\\t return EMPTY_REPEAT;\\n\\t }\\n\\t if (!(this instanceof $Repeat)) {\\n\\t return new $Repeat(value, times);\\n\\t }\\n\\t this._value = value;\\n\\t this.size = times === undefined ? Infinity : Math.max(0, times);\\n\\t if (this.size === 0) {\\n\\t EMPTY_REPEAT = this;\\n\\t }\\n\\t};\\n\\tvar $Repeat = Repeat;\\n\\t($traceurRuntime.createClass)(Repeat, {\\n\\t toString: function() {\\n\\t if (this.size === 0) {\\n\\t return 'Repeat []';\\n\\t }\\n\\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t return this.has(index) ? this._value : notSetValue;\\n\\t },\\n\\t contains: function(searchValue) {\\n\\t return is(this._value, searchValue);\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t var size = this.size;\\n\\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\\n\\t },\\n\\t reverse: function() {\\n\\t return this;\\n\\t },\\n\\t indexOf: function(searchValue) {\\n\\t if (is(this._value, searchValue)) {\\n\\t return 0;\\n\\t }\\n\\t return -1;\\n\\t },\\n\\t lastIndexOf: function(searchValue) {\\n\\t if (is(this._value, searchValue)) {\\n\\t return this.size;\\n\\t }\\n\\t return -1;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t for (var ii = 0; ii < this.size; ii++) {\\n\\t if (fn(this._value, ii, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var $__0 = this;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\\n\\t }));\\n\\t },\\n\\t __deepEquals: function(other) {\\n\\t return other instanceof $Repeat ? is(this._value, other._value) : $traceurRuntime.superCall(this, $Repeat.prototype, \\\"__deepEquals\\\", [other]);\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar RepeatPrototype = Repeat.prototype;\\n\\tRepeatPrototype.last = RepeatPrototype.first;\\n\\tRepeatPrototype.has = RangePrototype.has;\\n\\tRepeatPrototype.take = RangePrototype.take;\\n\\tRepeatPrototype.skip = RangePrototype.skip;\\n\\tRepeatPrototype.__toJS = RangePrototype.__toJS;\\n\\tvar EMPTY_REPEAT;\\n\\tvar Immutable = {\\n\\t Iterable: Iterable,\\n\\t Seq: Seq,\\n\\t Collection: Collection,\\n\\t Map: Map,\\n\\t List: List,\\n\\t Stack: Stack,\\n\\t Set: Set,\\n\\t OrderedMap: OrderedMap,\\n\\t Record: Record,\\n\\t Range: Range,\\n\\t Repeat: Repeat,\\n\\t is: is,\\n\\t fromJS: fromJS\\n\\t};\\n\\n\\t return Immutable;\\n\\t}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function FooBar() {\\n // TODO: implement this module\\n}\",\n \"function n(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function n(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"patch() {\\n }\",\n \"function v8(v9,v10) {\\n const v16 = [1337,1337];\\n // v16 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v17 = [\\\"536870912\\\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\\n // v17 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v18 = {constructor:13.37,e:v16};\\n // v18 = .object(ofGroup: Object, withProperties: [\\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\"])\\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\\n // v19 = .object(ofGroup: Object, withProperties: [\\\"d\\\", \\\"b\\\", \\\"a\\\", \\\"__proto__\\\", \\\"e\\\", \\\"constructor\\\", \\\"length\\\"])\\n const v21 = new Float64Array(v19);\\n // v21 = .object(ofGroup: Float64Array, withProperties: [\\\"byteOffset\\\", \\\"constructor\\\", \\\"buffer\\\", \\\"__proto__\\\", \\\"byteLength\\\", \\\"length\\\"], withMethods: [\\\"map\\\", \\\"values\\\", \\\"subarray\\\", \\\"find\\\", \\\"fill\\\", \\\"set\\\", \\\"findIndex\\\", \\\"some\\\", \\\"reduceRight\\\", \\\"reverse\\\", \\\"join\\\", \\\"includes\\\", \\\"entries\\\", \\\"reduce\\\", \\\"every\\\", \\\"copyWithin\\\", \\\"sort\\\", \\\"forEach\\\", \\\"lastIndexOf\\\", \\\"indexOf\\\", \\\"filter\\\", \\\"slice\\\", \\\"keys\\\"])\\n v6[6] = v7;\\n v7.toString = v9;\\n }\",\n \"function Utils() {}\",\n \"function Utils() {}\",\n \"function o(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function c() {}\",\n \"constructor( ) {}\",\n \"function main() {\\n}\",\n \"use(fn) {}\",\n \"function FooRule() {\\n}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"function test() {\\n var o35 = Object.getOwnPropertyDescriptor(Object.prototype, \\\"__proto__\\\").function(o1, o2)\\n{\\n var o3 = 0;\\n var o4 = 0;\\n try {\\nfor (var o5 = 1; o5 < 10000; o5++)\\n {\\n try {\\no3 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0x3FFFF;\\n}catch(e){}\\n try {\\no2.o3 = o3 + o4;\\n}catch(e){}\\n try {\\no4 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0xFFFF;\\n}catch(e){}\\n }\\n}catch(e){}\\n try {\\nreturn o3 + o4;\\n}catch(e){}\\n};\\n function o1() {\\n }\\n var o2 = ((o863 & 0x4000) >> Object.o157) | ((o863 & 0x40) >> 6);\\n var o38 = o839.o906.o917(o308);\\n var o6 = Array('Math.ceil((' + target + ')/');\\n var o867 = this.o543[0x200 | (o768 >> 4)];\\n var o8 = o1(\\\"willValidate\\\");\\n try {\\no21 = function () {\\n try {\\no337++;\\n}catch(e){}\\n };\\n}catch(e){}\\n try {\\ntry { o1(\\\"MSGestureEvent\\\"); } catch(e) {}try { try {\\no1(\\\"setImmediate\\\");\\n}catch(e){} } catch(e) {}\\n}catch(e){}\\n try {\\n({ o9: !o3.call(o2, o1, '!') });\\n}catch(e){}\\n try {\\nif (o0 != 2)\\n try {\\nprint(\\\"FAIL\\\");\\n}catch(e){}\\n else\\n try {\\nprint(\\\"PASS\\\");\\n}catch(e){}\\n}catch(e){}\\n}\",\n \"function Bevy() {}\",\n \"function hc(){return hc=Object.assign?Object.assign.bind():function(e){for(var t=1;t { throw reason });\n\t}","static transient final protected internal function m47() {}","_read() {\n }","function getBasicNodeMethods() {\n return [\n 'get',\n 'post',\n 'put',\n 'head',\n 'delete',\n 'options',\n 'trace',\n 'copy',\n 'lock',\n 'mkcol',\n 'move',\n 'purge',\n 'propfind',\n 'proppatch',\n 'unlock',\n 'report',\n 'mkactivity',\n 'checkout',\n 'merge',\n 'm-search',\n 'notify',\n 'subscribe',\n 'unsubscribe',\n 'patch',\n 'search',\n 'connect'\n ];\n}","function getBasicNodeMethods() {\n return [\n 'get',\n 'post',\n 'put',\n 'head',\n 'delete',\n 'options',\n 'trace',\n 'copy',\n 'lock',\n 'mkcol',\n 'move',\n 'purge',\n 'propfind',\n 'proppatch',\n 'unlock',\n 'report',\n 'mkactivity',\n 'checkout',\n 'merge',\n 'm-search',\n 'notify',\n 'subscribe',\n 'unsubscribe',\n 'patch',\n 'search',\n 'connect'\n ];\n}"],"string":"[\n \"function _node_p(){\\n\\tvar ret = false;\\n\\tif( anchor.environment() == 'Node.js' ){ ret = true; }\\n\\treturn ret;\\n }\",\n \"function node_error(err) {\\r\\n node.error(err, err);\\r\\n }\",\n \"private public function m246() {}\",\n \"function NodeFsHandler() {}\",\n \"function NodeFsHandler() {}\",\n \"static reset(){\\n _NODE_UID = 0;\\n }\",\n \"static final private internal function m106() {}\",\n \"private internal function m248() {}\",\n \"function NodeHandler() { }\",\n \"function _isNodeInternal (line) {\\n return ~line.indexOf('(timers.js:') ||\\n ~line.indexOf('(node.js:') ||\\n ~line.indexOf('(module.js:') ||\\n ~line.indexOf('_stream_readable.js') ||\\n ~line.indexOf('process._tickDomainCallback') ||\\n ~line.indexOf('GeneratorFunctionPrototype.next (native)') ||\\n ~line.indexOf('GeneratorFunctionPrototype.throw (native)') ||\\n // co\\n ~line.indexOf('/co/index.js') ||\\n // koa-router\\n ~line.indexOf('Object.dispatch') ||\\n // bluebird\\n ~line.indexOf('Promise._settlePromise') ||\\n ~line.indexOf('Async._drainQueues') ||\\n ~line.indexOf('Immediate.Async.drainQueues') ||\\n false;\\n}\",\n \"function Node() {}\",\n \"transient private protected internal function m182() {}\",\n \"function runIfNewNode( task ) {\\n\\t\\treturn nodeV16OrNewer ? task : \\\"print_old_node_message:\\\" + task;\\n\\t}\",\n \"function isNode(){\\r\\n\\treturn typeof module !== 'undefined' && module.exports;\\r\\n}\",\n \"function node_enable() {\\n if(typeof process === 'object' && process + '' === '[object process]'){\\n return true;\\n }\\n else{\\n return false;\\n }\\n}\",\n \"function RNode() {}\",\n \"function RNode() {}\",\n \"function RNode() {}\",\n \"function noOp(err) { if (err) { throw err; } }\",\n \"function isNode() {\\n return (typeof module !== 'undefined' && this.module !== module);\\n}\",\n \"protected internal function m252() {}\",\n \"function version(){ return \\\"0.13.0\\\" }\",\n \"function NodeLogger() {}\",\n \"function NodeLogger() {}\",\n \"function NodeLogger() {}\",\n \"getHostNode() {}\",\n \"function NodeLogger() { }\",\n \"function NodeLogger() { }\",\n \"getNode() {\\n throw new Error(\\\"Must be implemented\\\");\\n }\",\n \"transient private internal function m185() {}\",\n \"function NodeLogger(){}\",\n \"function getBasicNodeMethods(){return['get','post','put','head','delete','options','trace','copy','lock','mkcol','move','purge','propfind','proppatch','unlock','report','mkactivity','checkout','merge','m-search','notify','subscribe','unsubscribe','patch','search','connect'];}\",\n \"static final protected internal function m110() {}\",\n \"getAllNodes () {\\n client.getAllNodes(this.host, 4369, function (err, nodes) {\\n if (err) {\\n console.error(err)\\n return\\n }\\n console.log(nodes)\\n })\\n }\",\n \"extend(config, ctx) {\\n config.node = {\\n console: true,\\n fs: 'empty',\\n net: 'empty',\\n tls: 'empty',\\n }\\n }\",\n \"function is_node() {\\r\\n if (is_node_ === null)\\r\\n is_node_ = typeof global === \\\"object\\\"\\r\\n && typeof global.process === \\\"object\\\"\\r\\n && typeof global.process.versions === \\\"object\\\"\\r\\n && typeof global.process.versions.node !== \\\"undefined\\\";\\r\\n return is_node_;\\r\\n}\",\n \"function assertNodeEnv() {\\r\\n return assert(isNode, 'This feature is only available in NodeJS environments');\\r\\n }\",\n \"transient protected internal function m189() {}\",\n \"function RNode(){}\",\n \"upgrade() {}\",\n \"function _detectNodeCrypto(fn) {\\n\\t return forge.util.isNodejs && typeof _crypto[fn] === 'function';\\n\\t}\",\n \"function TNode() {}\",\n \"function TNode() {}\",\n \"function TNode() {}\",\n \"_handleNodeError(newValue,oldValue){if(typeof oldValue!==typeof void 0&&null!=newValue&&0!=newValue.length){// @todo, need support for a failed to load state; could be useful\\n// if we go into an offline capability in the future\\nthis._responseList[this.active]=newValue;this.activeNodeResponse=this._responseList[this.active];// set available because we don't have a failed state\\nthis.items[this.active].metadata.status=\\\"available\\\";this.set(\\\"items.\\\"+this.active+\\\".metadata.status\\\",\\\"available\\\");this.notifyPath(\\\"items.\\\"+this.active+\\\".metadata.status\\\");// fire an event that this isn't really available so we know an issue occured\\nthis.dispatchEvent(new CustomEvent(\\\"node-load-failed\\\",{bubbles:!0,cancelable:!0,composed:!0,detail:this.items[this.active]}))}}\",\n \"_read () {}\",\n \"_read () {}\",\n \"_read () {}\",\n \"function DWRUtil() { }\",\n \"_isValidContext() {\\n const isNode = (typeof process !== 'undefined')\\n && (typeof process.release !== 'undefined')\\n && (process.release.name === 'node');\\n return isNode;\\n }\",\n \"function NWTNode() {\\n\\t\\n}\",\n \"function getBasicNodeMethods() {\\n return ['get', 'post', 'put', 'head', 'delete', 'options', 'trace', 'copy', 'lock', 'mkcol', 'move', 'purge', 'propfind', 'proppatch', 'unlock', 'report', 'mkactivity', 'checkout', 'merge', 'm-search', 'notify', 'subscribe', 'unsubscribe', 'patch', 'search', 'connect'];\\n}\",\n \"_read() {}\",\n \"_read() {}\",\n \"static transient final private protected internal function m40() {}\",\n \"function getSystemNodeVers(cb) {\\n exec('node -v', function(err, stdout) {\\n if (err) {\\n return cb(err, null);\\n }\\n cb(null, stdout.slice(1).replace('\\\\n',''));\\n });\\n}\",\n \"function r() {}\",\n \"function r() {}\",\n \"function r() {}\",\n \"function Node(){}\",\n \"transient private protected public internal function m181() {}\",\n \"static isNode(n) {\\n return n && typeof n === \\\"object\\\" && typeof n.type === \\\"string\\\";\\n }\",\n \"async initialize()\\n\\t{ \\n\\t\\tthrow new Error(\\\"initialize() method not implemented\\\");\\n\\t}\",\n \"static transient final protected public internal function m46() {}\",\n \"extend (config, ctx) {\\n config.node = {\\n fs: 'empty'\\n }\\n }\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function isNode() {\\n return typeof module !== 'undefined' &&\\n module.exports &&\\n typeof window === 'undefined';\\n}\",\n \"initiator() {\\n throw new Error('Not implemented');\\n }\",\n \"static runningOnNode ()\\n\\t\\t{ let ud = \\\"undefined\\\";\\n\\n\\t\\t\\tif (typeof process === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! process )\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! process.versions )\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! process.versions.node )\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof __dirname === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof __filename === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof require === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (require === null)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! require.resolve)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof module === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"function node(){}\",\n \"async init( callback ) {\\n throw \\\"implement me!\\\";\\n }\",\n \"constructor() {\\n this.startTime = Date.now();\\n this.attributes = {\\n \\\"version\\\": 0.5, \\n \\\"lang\\\": \\\"node.js\\\",\\n \\\"startTime\\\": this.startTime\\n };\\n\\n this.inspectedCPU = false;\\n this.inspectedMemory = false;\\n this.inspectedContainer = false;\\n this.inspectedPlatform = false;\\n this.inspectedLinux = false;\\n }\",\n \"function Node() {\\n}\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function noop(){}// No operation performed.\",\n \"function getLocalNodeVers(cb) {\\n var nave_path = process.env.HOME + \\\"/.nave/installed/\\\";\\n\\n fs.readdir(nave_path, cb);\\n}\",\n \"static get ERROR () { return 0 }\",\n \"static transient final private internal function m43() {}\",\n \"extend(config, {isDev, isClient}) {\\n config.node = {\\n fs: 'empty'\\n }\\n }\",\n \"static init() {\\n\\t\\tprocess.on('unhandledRejection', (reason, p) => { throw reason });\\n\\t}\",\n \"static transient final protected internal function m47() {}\",\n \"_read() {\\n }\",\n \"function getBasicNodeMethods() {\\n return [\\n 'get',\\n 'post',\\n 'put',\\n 'head',\\n 'delete',\\n 'options',\\n 'trace',\\n 'copy',\\n 'lock',\\n 'mkcol',\\n 'move',\\n 'purge',\\n 'propfind',\\n 'proppatch',\\n 'unlock',\\n 'report',\\n 'mkactivity',\\n 'checkout',\\n 'merge',\\n 'm-search',\\n 'notify',\\n 'subscribe',\\n 'unsubscribe',\\n 'patch',\\n 'search',\\n 'connect'\\n ];\\n}\",\n \"function getBasicNodeMethods() {\\n return [\\n 'get',\\n 'post',\\n 'put',\\n 'head',\\n 'delete',\\n 'options',\\n 'trace',\\n 'copy',\\n 'lock',\\n 'mkcol',\\n 'move',\\n 'purge',\\n 'propfind',\\n 'proppatch',\\n 'unlock',\\n 'report',\\n 'mkactivity',\\n 'checkout',\\n 'merge',\\n 'm-search',\\n 'notify',\\n 'subscribe',\\n 'unsubscribe',\\n 'patch',\\n 'search',\\n 'connect'\\n ];\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.5863474","0.5705808","0.568645","0.55544066","0.55544066","0.5446477","0.5434516","0.5381192","0.5356294","0.53282356","0.53189546","0.52043676","0.51996946","0.5156968","0.51501393","0.51281303","0.51281303","0.51281303","0.5112595","0.5100047","0.50906795","0.5088863","0.5087259","0.5087259","0.5087259","0.5080389","0.5072706","0.5072706","0.5068706","0.50571835","0.50298","0.50214815","0.501945","0.50129956","0.5000925","0.4991448","0.49863955","0.49858886","0.49840045","0.4981576","0.4970059","0.4949551","0.4949551","0.4949551","0.4927342","0.49235627","0.49235627","0.49235627","0.49222878","0.49209145","0.4916484","0.48980445","0.48758933","0.48758933","0.48750284","0.4857348","0.48530325","0.48530325","0.48530325","0.4848229","0.4847861","0.48425364","0.48396116","0.48373815","0.48351088","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48342466","0.48302492","0.48184085","0.48170963","0.4817076","0.48170155","0.48130047","0.48075417","0.48001215","0.48001215","0.48001215","0.48001215","0.48001215","0.48001215","0.48001215","0.47976673","0.4785643","0.477728","0.47741026","0.47708902","0.47680405","0.47660002","0.47642508","0.47642508"],"string":"[\n \"0.5863474\",\n \"0.5705808\",\n \"0.568645\",\n \"0.55544066\",\n \"0.55544066\",\n \"0.5446477\",\n \"0.5434516\",\n \"0.5381192\",\n \"0.5356294\",\n \"0.53282356\",\n \"0.53189546\",\n \"0.52043676\",\n \"0.51996946\",\n \"0.5156968\",\n \"0.51501393\",\n \"0.51281303\",\n \"0.51281303\",\n \"0.51281303\",\n \"0.5112595\",\n \"0.5100047\",\n \"0.50906795\",\n \"0.5088863\",\n \"0.5087259\",\n \"0.5087259\",\n \"0.5087259\",\n \"0.5080389\",\n \"0.5072706\",\n \"0.5072706\",\n \"0.5068706\",\n \"0.50571835\",\n \"0.50298\",\n \"0.50214815\",\n \"0.501945\",\n \"0.50129956\",\n \"0.5000925\",\n \"0.4991448\",\n \"0.49863955\",\n \"0.49858886\",\n \"0.49840045\",\n \"0.4981576\",\n \"0.4970059\",\n \"0.4949551\",\n \"0.4949551\",\n \"0.4949551\",\n \"0.4927342\",\n \"0.49235627\",\n \"0.49235627\",\n \"0.49235627\",\n \"0.49222878\",\n \"0.49209145\",\n \"0.4916484\",\n \"0.48980445\",\n \"0.48758933\",\n \"0.48758933\",\n \"0.48750284\",\n \"0.4857348\",\n \"0.48530325\",\n \"0.48530325\",\n \"0.48530325\",\n \"0.4848229\",\n \"0.4847861\",\n \"0.48425364\",\n \"0.48396116\",\n \"0.48373815\",\n \"0.48351088\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48342466\",\n \"0.48302492\",\n \"0.48184085\",\n \"0.48170963\",\n \"0.4817076\",\n \"0.48170155\",\n \"0.48130047\",\n \"0.48075417\",\n \"0.48001215\",\n \"0.48001215\",\n \"0.48001215\",\n \"0.48001215\",\n \"0.48001215\",\n \"0.48001215\",\n \"0.48001215\",\n \"0.47976673\",\n \"0.4785643\",\n \"0.477728\",\n \"0.47741026\",\n \"0.47708902\",\n \"0.47680405\",\n \"0.47660002\",\n \"0.47642508\",\n \"0.47642508\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80797,"cells":{"query":{"kind":"string","value":"v8 likes predictible objects"},"document":{"kind":"string","value":"function Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function compareLike(a,b){\n var al = a.idLikesProp.length;\n var bl = b.idLikesProp.length;\n if(al > bl) return -1;\n if(bl > al) return 1;\n return 0;\n}","function lookAround() {\n var objectDescription = \"\"\n tj.see().then(function(objects) {\n objects.forEach(function(each) {\n if (each.score >= 0.4) {\n objectDescription = objectDescription + \", \" + each.class\n }\n })\n tj.speak(\"The objects I see are: \" + objectDescription)\n });\n}","function recommendNewPosts() {\n model.loadModel();\n getNewPosts(function (err, posts) {\n var label\n ;\n posts.forEach(function (post) {\n label = model.classifyPost(post);\n if (label == 'like') {\n console.log(post);\n }\n });\n });\n }","function BOT_onLike() {\r\n\tBOT_traceString += \"GOTO command judge\" + \"\\n\"; // change performative\r\n\tBOT_theReqJudgement = \"likeable\";\r\n\tBOT_onJudge(); \t\r\n\tif(BOT_reqSuccess) {\r\n\t\tvar ta = [BOT_theReqTopic,BOT_theReqAttribute]; \r\n\t\tBOT_del(BOT_theUserTopicId,\"distaste\",\"VAL\",ta);\r\n\t\tBOT_add(BOT_theUserTopicId,\"preference\",\"VAL\",ta);\r\n\t}\r\n}","function like (data, archetype) {\n var name;\n\n for (name in archetype) {\n if (archetype.hasOwnProperty(name)) {\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof archetype[name]) {\n return false;\n }\n\n if (object(data[name]) && like(data[name], archetype[name]) === false) {\n return false;\n }\n }\n }\n\n return true;\n }","function LanguageUnderstandingModel() {\n }","function guess() {\n classifier.predict(video.elt, 5, gotResult);\n}","function theBigBang() {\n\t\tinitLibs();\n\t\tinitFuncs();\n\t\tObject.setPrototypeOf(Universe.prototype, universe.kjsclasses._primitive_prototype);\n\t\tObject.setPrototypeOf(Object.prototype, universe); // [0]\n\t}","function readOwn(obj, name, pumpkin) {\n if (typeof obj !== 'object' || !obj) {\n if (typeOf(obj) !== 'object') {\n return pumpkin;\n }\n }\n if (typeof name === 'number' && name >= 0) {\n if (myOriginalHOP.call(obj, name)) { return obj[name]; }\n return pumpkin;\n }\n name = String(name);\n if (obj[name + '_canRead___'] === obj) { return obj[name]; }\n if (!myOriginalHOP.call(obj, name)) { return pumpkin; }\n // inline remaining relevant cases from canReadPub\n if (endsWith__.test(name)) { return pumpkin; }\n if (name === 'toString') { return pumpkin; }\n if (!isJSONContainer(obj)) { return pumpkin; }\n fastpathRead(obj, name);\n return obj[name];\n }","function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach(function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)})}","function NXObject() {}","function isPrimative(val) { return (typeof val !== 'object') }","function like (data, duck) {\n var name;\n\n assert.object(data);\n assert.object(duck);\n\n for (name in duck) {\n if (duck.hasOwnProperty(name)) {\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof duck[name]) {\n return false;\n }\n\n if (object(data[name]) && like(data[name], duck[name]) === false) {\n return false;\n }\n }\n }\n\n return true;\n }","static get observedAttributes() {\n return ['rainbow', 'lang'];\n }","function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach((function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)}))}","function testSimpleHole_prototype() {\n var theHole = Object.create({ x: \"in proto\" });\n var theReplacement = \"yay\";\n var serialized = bidar.serialize(theHole, holeFilter);\n var parsed = bidar.parse(serialized, holeFiller);\n\n assert.equal(parsed, theReplacement);\n\n function holeFilter(x) {\n assert.equal(x, theHole);\n return { data: \"blort\" };\n }\n\n function holeFiller(x) {\n assert.equal(x, \"blort\");\n return theReplacement;\n }\n}","function test() {\n\t// \"ex nihilo\" object creation using the literal\n\t// object notation {}.\n\tvar foo = {\n\t\tname : \"foo\",\n\t\tone : 1,\n\t\ttwo : 2\n\t};\n\n\t// Another \"ex nihilo\" object.\n\tvar bar = {\n\t\ttwo : \"two\",\n\t\tthree : 3\n\t};\n\n\t// Gecko and Webkit JavaScript engines can directly\n\t// manipulate the internal prototype link.\n\t// For the sake of simplicity, let us pretend\n\t// that the following line works regardless of the\n\t// engine used:\n\tbar.__proto__ = foo; // foo is now the prototype of bar.\n\n\t// If we try to access foo's properties from bar\n\t// from now on, we'll succeed.\n\tlog(bar.one) // Resolves to 1.\n\n\t// The child object's properties are also accessible.\n\tlog(bar.three) // Resolves to 3.\n\n\t// Own properties shadow prototype properties\n\tlog(bar.two); // Resolves to \"two\"\n\tlog(foo.name); // unaffected, resolves to \"foo\"\n\tlog(bar.name); // Resolves to \"foo\"\n log(foo.__proto__);\n}","function wrappedPrimitivePreviewer(className, classObj, objectActor, grip) {\r\n let {_obj} = objectActor;\r\n\r\n if (!_obj.proto || _obj.proto.class != className) {\r\n return false;\r\n }\r\n\r\n let raw = _obj.unsafeDereference();\r\n let v = null;\r\n try {\r\n v = classObj.prototype.valueOf.call(raw);\r\n } catch (ex) {\r\n // valueOf() can throw if the raw JS object is \"misbehaved\".\r\n return false;\r\n }\r\n\r\n if (v === null) {\r\n return false;\r\n }\r\n\r\n let canHandle = GenericObject(objectActor, grip, className === \"String\");\r\n if (!canHandle) {\r\n return false;\r\n }\r\n\r\n grip.preview.wrappedValue = objectActor.getGrip(makeDebuggeeValueIfNeeded(_obj, v));\r\n return true;\r\n}","function DartObject(o) {\n this.o = o;\n}","function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}","function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}","function likeVsLikes(toyLikeCount){\n\t\tif (toyLikeCount == 1){\n\t\t\treturn 'Like';\n\t\t} else {\n\t\t\treturn 'Likes';\n\t\t}\n\t}","constructor(spec) {\n this.cached = /* @__PURE__ */ Object.create(null);\n let instanceSpec = this.spec = {};\n for (let prop in spec)\n instanceSpec[prop] = spec[prop];\n instanceSpec.nodes = OrderedMap.from(spec.nodes), instanceSpec.marks = OrderedMap.from(spec.marks || {}), this.nodes = NodeType$1.compile(this.spec.nodes, this);\n this.marks = MarkType.compile(this.spec.marks, this);\n let contentExprCache = /* @__PURE__ */ Object.create(null);\n for (let prop in this.nodes) {\n if (prop in this.marks)\n throw new RangeError(prop + \" can not be both a node and a mark\");\n let type = this.nodes[prop], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n type.contentMatch = contentExprCache[contentExpr] || (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\n type.inlineContent = type.contentMatch.inlineContent;\n type.markSet = markExpr == \"_\" ? null : markExpr ? gatherMarks(this, markExpr.split(\" \")) : markExpr == \"\" || !type.inlineContent ? [] : null;\n }\n for (let prop in this.marks) {\n let type = this.marks[prop], excl = type.spec.excludes;\n type.excluded = excl == null ? [type] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"));\n }\n this.nodeFromJSON = this.nodeFromJSON.bind(this);\n this.markFromJSON = this.markFromJSON.bind(this);\n this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n this.cached.wrappings = /* @__PURE__ */ Object.create(null);\n }","wordClass(word) {\r\n return {\r\n der: word.artikel == \"der\",\r\n die: word.artikel == \"die\",\r\n das: word.artikel == \"das\",\r\n marked: word.marker\r\n }\r\n }","function dummyObjects(name, age){\n this.name = name\n this.age = age\n}","function handleLikes() {\n // Get a random number\n let randomNumber = Math.random();\n // To make it unpredictable, only change the likes if =>\n if (randomNumber < REVEAL_PROBABILITY) {\n defineLikes();\n }\n}","constructor() { \n \n Like.initialize(this);\n }","like() {\r\n return this.clone(Comment, \"Like\").postCore();\r\n }","like() {\r\n return this.getItem().then(i => {\r\n return i.like();\r\n });\r\n }","added(vrobject){}","classify(phrase) { return this.clf.classify(phrase) }","function badIdea(){\n this.idea = \"bad\";\n}","shouldSerialize(prop, dataKey) {\n const contains = (str, re) => (str.match(re) || []).length > 0;\n const a = contains(dataKey, /\\./g);\n const b = contains(dataKey, /\\[/g);\n return !!prop.object && !(a || b);\n }","static get observedAttributes(){this.finalize();const e=[];// Use forEach so this works even if for/of loops are compiled to for loops\n// expecting arrays\nreturn this._classProperties.forEach((t,n)=>{const r=this._attributeNameForProperty(n,t);void 0!==r&&(this._attributeToPropertyMap.set(r,n),e.push(r))}),e}","function oldAndLoud(object){\n\tobject.age++;\n\tobject.name = object.name.toUpperCase();\n}","like() {\r\n return this.clone(Item, \"like\").postCore();\r\n }","function classifyPose() {\n if (pose && working) {\n inputs = [];\n for (let i = 0; i < pose.landmarks.length; i++) {\n inputs.push(pose.landmarks[i][0]);\n inputs.push(pose.landmarks[i][1]);\n inputs.push(pose.landmarks[i][2]);\n }\n brain.classify(inputs, gotResult)\n }\n }","function PropertyDetection() {}","constructor()\n {\n this.likes = [];\n }","async TestLikeDoctorPost(){\n var response = await entity.Likes(6,28,true,true);\n //console.log(response)\n if(response != null){\n console.log(\"\\x1b[32m%s\\x1b[0m\",\"TestDOctorRating Passed\");\n }else{\n console.log(\"\\x1b[31m%s\\x1b[0m\",\"TestDOctorRating Failed\");\n }\n\n }","function classifyVideo() {\n classifier.predict(gotResult);\n}","function classifyVideo() {\n classifier.predict(gotResult);\n}","function classifyVideo() {\n classifier.predict(gotResult);\n}","function showLikes(likes) {\n\tconsole.log(`THINGS I LIKE:\\n`);\n\tfor(let like of likes) {\n\t\tconsole.log(like);\n\t}\n}","function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}","function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}","function Nevis() {}","function Nevis() {}","function Nevis() {}","test_primitivesExtended() {\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.primitivesExtended);\n let object = translator.decode(text).getRoot();\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.PrimitivesExtended\", object.constructor.__getClass());\n Assert.equals(\"alpha16\", object.string);\n }","function buildObjectsObj(gCloudV, azureCV, minScore = 0.0){\n let objects = [];\n\n if(gCloudV) {// gcloud vision results are available\n let gCloudObjects = gCloudV['localizedObjectAnnotations'];\n\n //apply standard bounding box to all the detected objects\n if(azureCV)// azure computer vision results are available\n gCloudVObjsToCogniBoundingBox(gCloudObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\n\n else//need to retrieve image sizes from gcloud (already done and put in the metadata tag of gcloudv with appropriate calls)\n gCloudVObjsToCogniBoundingBox(gCloudObjects, gCloudV['metadata']['width'], gCloudV['metadata']['height']);\n\n for (let gCloudObj of gCloudObjects) {\n if (gCloudObj['score'] > minScore) { //filter out unwanted tags\n objects.push({\n name: gCloudObj['name'],\n mid: (gCloudObj['mid'] && gCloudObj['mid']!= '')? gCloudObj['mid']: undefined,\n confidence: gCloudObj['score'],\n boundingBox: gCloudObj['boundingBox']\n });\n }\n }\n }\n\n if(azureCV){// azure computer vision results are available\n let azureObjects = azureCV['objects'];\n //apply standard bounding box to all the detected objects\n azureCVObjsToCogniBoundingBox(azureObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\n for(let aObj of azureObjects){\n if(aObj['confidence'] > minScore) { //filter out unwanted tags\n objects.push({\n name: aObj['object'],\n confidence: aObj['confidence'],\n boundingBox: aObj['boundingBox']\n });\n }\n }\n }\n\n objects = combineObjectsArray(objects);// build an array where labels regarding the same exact object are combined with averaged confidence\n\n objects.sort((a, b) => {\n if(a['confidence']>b['confidence'])\n return -1;\n else if(a['confidence']==b['confidence'])\n return 0;\n else\n return 1;\n });\n\n return objects;\n}","function V(e){if(null===e||\"[object Object]\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}","function classifyVideo() {\r\n classifier.classify(vid, gotResult);\r\n\r\n}","function test_nountag_does_not_think_it_has_watch_tag_when_it_does_not() {\n Assert.equal(TagNoun.fromJSON(\"watch\"), undefined);\n}","function v11(v12,v13) {\n const v15 = v11(Object,Function);\n // v15 = .unknown\n const v16 = Object(v13,v8,0,v6);\n // v16 = .object()\n const v17 = 0;\n // v17 = .integer\n const v18 = 1;\n // v18 = .integer\n const v19 = 512;\n // v19 = .integer\n const v20 = \"-1024\";\n // v20 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v21 = isFinite;\n // v21 = .function([.anything] => .boolean)\n const v23 = [1337];\n // v23 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v24 = {};\n // v24 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v25 = v23;\n const v26 = -29897853;\n // v26 = .integer\n const v27 = \"replace\";\n // v27 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v28 = Boolean;\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v30 = [13.37,13.37];\n // v30 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v31 = 1337;\n // v31 = .integer\n let v32 = 13.37;\n const v36 = [13.37,13.37,13.37];\n // v36 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v38 = [1337,1337];\n // v38 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v39 = [13.37,1337,v38,1337,\"-128\",13.37,\"-128\",\"-128\",2147483647,1337];\n // v39 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v40 = {__proto__:v36,length:v39};\n // v40 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"length\"])\n const v41 = \"0\";\n // v41 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v42 = -4130093409;\n // v42 = .integer\n const v44 = {b:2147483647,e:v38,valueOf:v36};\n // v44 = .object(ofGroup: Object, withProperties: [\"__proto__\", \"b\", \"valueOf\", \"e\"])\n const v45 = \"k**baeaDif\";\n // v45 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v46 = 65536;\n // v46 = .integer\n const v47 = \"k**baeaDif\";\n // v47 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v48 = 13.37;\n // v48 = .float\n const v50 = [13.37,13.37];\n // v50 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v51 = ~v50;\n // v51 = .boolean\n const v53 = [13.37];\n // v53 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n let v54 = v53;\n const v55 = gc;\n // v55 = .function([] => .undefined)\n const v58 = [13.37,13.37,13.37,13.37];\n // v58 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v60 = [1337,1337,1337,1337];\n // v60 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v61 = [3697200800,v58,v60];\n // v61 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\n // v62 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"length\", \"constructor\", \"toString\", \"valueOf\"])\n const v65 = [13.37,13.37,13.37,13.37];\n // v65 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v67 = [1337,1337,1337,1337];\n // v67 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v68 = [3697200800,v65,v67];\n // v68 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\n // v69 = .object(ofGroup: Object, withProperties: [\"e\", \"constructor\", \"__proto__\", \"length\", \"toString\", \"valueOf\"])\n const v70 = Object;\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n function v71(v72) {\n }\n const v74 = [13.37];\n // v74 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v75 = 1337;\n // v75 = .integer\n const v76 = v44 ** 13.37;\n // v76 = .integer | .float | .bigint\n function v77(v78,v79,v80,v81,v82) {\n }\n let v83 = v74;\n const v84 = \"2\";\n // v84 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v85 = \"2\";\n // v85 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v88 = [13.37,13.37,1337,13.37];\n // v88 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v89(v90,v91,v92) {\n }\n const v94 = [1337,1337,1337,1337];\n // v94 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v95 = [3697200800,v88,v94];\n // v95 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n function v96(v97,v98) {\n }\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\n // v99 = .object(ofGroup: Object, withProperties: [\"toString\", \"length\", \"constructor\", \"__proto__\", \"e\", \"d\"])\n let v100 = 13.37;\n const v101 = typeof v74;\n // v101 = .string\n const v102 = \"symbol\";\n // v102 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v103 = 3697200800;\n // v103 = .integer\n const v104 = \"2\";\n // v104 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v105 = Boolean;\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\"prototype\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\n const v106 = Function;\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v107 = 13.37;\n // v107 = .float\n const v108 = 1337;\n // v108 = .integer\n const v109 = \"2\";\n // v109 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v110 = Function;\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v112 = [13.37,13.37,13.37,13.37];\n // v112 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v113 = 1337;\n // v113 = .integer\n let v114 = 13.37;\n const v116 = {...3697200800,...3697200800};\n // v116 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n const v117 = Object;\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v118 = Function;\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\"constructor\", \"arguments\", \"__proto__\", \"name\", \"caller\", \"prototype\", \"length\"], withMethods: [\"call\", \"bind\", \"apply\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\n const v119 = {};\n // v119 = .object(ofGroup: Object, withProperties: [\"__proto__\"])\n let v120 = v119;\n const v121 = (3697200800).constructor;\n // v121 = .unknown\n function v122(v123,v124) {\n }\n const v125 = Promise;\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\"prototype\"], withMethods: [\"race\", \"allSettled\", \"reject\", \"all\", \"resolve\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\"__proto__\"], withMethods: [\"finally\", \"then\", \"catch\"]))\n const v128 = 4;\n // v128 = .integer\n let v129 = 0;\n const v131 = [13.37,13.37,13.37,13.37];\n // v131 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v133 = [1337,1337,1337,1337];\n // v133 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v134 = [3697200800,v131,v133];\n // v134 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v135 = Object;\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v136 = -944747134;\n // v136 = .integer\n const v139 = [13.37,13.37,13.37,13.37];\n // v139 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v141 = [1337,1337,1337,1337];\n // v141 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v142 = [3697200800,v139,v141];\n // v142 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\n // v143 = .object(ofGroup: Object, withProperties: [\"toString\", \"constructor\", \"e\", \"__proto__\", \"valueOf\", \"length\"])\n let v144 = v143;\n const v145 = gc;\n // v145 = .function([] => .undefined)\n let v146 = 13.37;\n const v150 = [13.37,13.37,13.37,Function];\n // v150 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v152 = [1337,1337,1337,1337];\n // v152 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v153 = [3697200800,v150,v152];\n // v153 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v154 = v153 + 1;\n // v154 = .primitive\n let v155 = 0;\n const v156 = v155 + 1;\n // v156 = .primitive\n const v158 = \"2\";\n // v158 = .string + .object(ofGroup: String, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"padEnd\", \"split\", \"charAt\", \"match\", \"lastIndexOf\", \"charCodeAt\", \"trim\", \"startsWith\", \"includes\", \"repeat\", \"search\", \"slice\", \"endsWith\", \"matchAll\", \"indexOf\", \"concat\", \"replace\", \"padStart\", \"substring\", \"codePointAt\"])\n const v160 = [13.37,13.37,13.37,13.37];\n // v160 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v162 = 0;\n // v162 = .integer\n const v163 = [1337,1337,1337,1337];\n // v163 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v164 = [3697200800,1337,v163];\n // v164 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v166 = 1337;\n // v166 = .integer\n let v167 = 2594067260;\n const v169 = 4;\n // v169 = .integer\n let v170 = 0;\n const v171 = v167 + 1;\n // v171 = .primitive\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\n // v172 = .object(ofGroup: Object, withProperties: [\"e\", \"__proto__\", \"constructor\", \"valueOf\", \"length\", \"toString\"])\n const v173 = 0;\n // v173 = .integer\n const v174 = 5;\n // v174 = .integer\n const v175 = 2937513072;\n // v175 = .integer\n const v176 = Object;\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\"prototype\"], withMethods: [\"setPrototypeOf\", \"assign\", \"fromEntries\", \"seal\", \"getOwnPropertyNames\", \"freeze\", \"defineProperty\", \"create\", \"getPrototypeOf\", \"getOwnPropertySymbols\", \"keys\", \"values\", \"isExtensible\", \"entries\", \"is\", \"getOwnPropertyDescriptor\", \"preventExtensions\", \"defineProperties\", \"getOwnPropertyDescriptors\", \"isSealed\", \"isFrozen\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\n const v177 = v172.constructor;\n // v177 = .unknown\n const v178 = 0;\n // v178 = .integer\n const v179 = 1;\n // v179 = .integer\n try {\n } catch(v180) {\n const v182 = [13.37,13.37,13.37,13.37];\n // v182 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v183 = v182.__proto__;\n // v183 = .object()\n function v185(v186) {\n }\n const v187 = Object >>> v183;\n // v187 = .integer | .bigint\n }\n function v188(v189,v190,v191,v192,...v193) {\n }\n}","function markRaw(obj) {\r\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\r\n return obj;\r\n }\r\n // set the vue observable flag at obj\r\n var ob = createObserver();\r\n ob.__raw__ = true;\r\n def(obj, '__ob__', ob);\r\n // mark as Raw\r\n rawSet.set(obj, true);\r\n return obj;\r\n}","function markRaw(obj) {\r\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\r\n return obj;\r\n }\r\n // set the vue observable flag at obj\r\n var ob = createObserver();\r\n ob.__raw__ = true;\r\n def(obj, '__ob__', ob);\r\n // mark as Raw\r\n rawSet.set(obj, true);\r\n return obj;\r\n}","transient private internal function m185() {}","function rekognizeLabels(bucket, key) {\n let params = {\n Image: {\n S3Object: {\n Bucket: bucket,\n Name: key\n }\n },\n MaxLabels: 3,\n MinConfidence: 80\n };\n\n return rekognition.detectLabels(params).promise()\n}","test_doNotRetainAnno(){\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.doNotRetainAnno);\n let object1 = translator.decode(text).getRoot();\n let object2 = translator.decode(text).getRoot();\n\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\", object1.constructor.__getClass());\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\", object2.constructor.__getClass());\n Assert.notEquals(object1, object2);\n }","function LK_likeIt(elem) {\n var likeGroup = elem.getAttribute(LK_LIKEGROUP);\n var likeValue = elem.getAttribute(LK_LIKEVALUE);\n localStorage[likeGroup] = likeValue;\n\n // Change the style of the liker nodes\n var siblings = elem.parentNode.childNodes;\n for (var i = 0; i < siblings.length; i++) {\n if (siblings[i].style) { \n LK_applyNormalStyle(siblings[i]);\n }\n }\n LK_applySelectedStyle(elem, likeValue);\n\n // Change the value of any mini likers\n var allSpans = document.getElementsByTagName('span');\n for (var i = 0; i < allSpans.length; i++) {\n var span = allSpans[i];\n if (span.getAttribute(LK_LIKEGROUP) == likeGroup) {\n if (span.getAttribute(LK_LIKETYPE) == 'mini') {\n span.innerHTML = LK_MAPPINGS[likeValue].label;\n LK_applySelectedStyle(allSpans[i], likeValue);\n }\n }\n }\n}","function OOPExample(who) {\n this.me = who;\n}","getLikes(state, data) {\n state.likes = data\n }","function _isAlternativeRecognitionResult(obj) {\r\n return obj && typeof obj === 'object';\r\n}","function addLikes() {\n if (propLike?.includes(user.username)) {\n let index = propLike.indexOf(user.username);\n let removeLike = [\n ...propLike.slice(0, index),\n ...propLike.slice(index + 1),\n ];\n setLikeGet(removeLike);\n setPropLike(removeLike);\n setRedLike(\"\");\n\n addToLike(eventid, removeLike);\n } else {\n let likesArr = [...propLike, `${user.username}`];\n\n setLikeGet(likesArr);\n setPropLike(likesArr);\n setRedLike(\"red\");\n addToLike(eventid, likesArr);\n }\n }","function LiteralObject() {\r\n}","function Komunalne() {}","function Bevy() {}","function Prediction() {\n this.score = {};\n}","function Object() {}","function Object() {}","function canEnumPub(obj, name) {\n if (obj === null) { return false; }\n if (obj === void 0) { return false; }\n name = String(name);\n if (obj[name + '_canEnum___']) { return true; }\n if (endsWith__.test(name)) { return false; }\n if (!isJSONContainer(obj)) { return false; }\n if (!myOriginalHOP.call(obj, name)) { return false; }\n fastpathEnum(obj, name);\n if (name === 'toString') { return true; }\n fastpathRead(obj, name);\n return true;\n }","function Obj(){ return Literal.apply(this,arguments) }","test_primitives() {\n let translator = new Translator();\n translator.registerPackage(PackageFile);\n let text = JSON.stringify(this.json.primitives);\n let object = translator.decode(text).getRoot();\n Assert.equals(\"ca.frar.jjjrmi.translator.testclasses.Primitives\", object.constructor.__getClass());\n Assert.equals(\"alpha9\", object.string);\n }","function hello()\n{\n /* ATTRIBUTES */\n this.coolbeans = 'class';\n this.something = 'hello-class';\n\n}","function test_cluster_tagged_crosshair_op_vsphere65() {}","function classifyVideo() {\n classifier.classify(gotResult);\n}","function classifyVideo() {\n classifier.classify(gotResult);\n}","constructor(papa,mummy,sivlings,belongs,loving_bro,favs_bro){\n super(papa,mummy,sivlings,belongs)\n this.loving_bro=loving_bro\n this.favs_bro=favs_bro\n }","function v8(v9,v10) {\n const v16 = [1337,1337];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v17 = [\"536870912\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\n // v17 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = {constructor:13.37,e:v16};\n // v18 = .object(ofGroup: Object, withProperties: [\"constructor\", \"e\", \"__proto__\"])\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\n // v19 = .object(ofGroup: Object, withProperties: [\"d\", \"b\", \"a\", \"__proto__\", \"e\", \"constructor\", \"length\"])\n const v21 = new Float64Array(v19);\n // v21 = .object(ofGroup: Float64Array, withProperties: [\"byteOffset\", \"constructor\", \"buffer\", \"__proto__\", \"byteLength\", \"length\"], withMethods: [\"map\", \"values\", \"subarray\", \"find\", \"fill\", \"set\", \"findIndex\", \"some\", \"reduceRight\", \"reverse\", \"join\", \"includes\", \"entries\", \"reduce\", \"every\", \"copyWithin\", \"sort\", \"forEach\", \"lastIndexOf\", \"indexOf\", \"filter\", \"slice\", \"keys\"])\n v6[6] = v7;\n v7.toString = v9;\n }","function defineInspect(classObject) {\n var fn = classObject.prototype.toJSON;\n typeof fn === 'function' || invariant(0);\n classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n if (nodejsCustomInspectSymbol[\"a\" /* default */]) {\n classObject.prototype[nodejsCustomInspectSymbol[\"a\" /* default */]] = fn;\n }\n}","annotate(message: string, data: Object) {\n this.message = message;\n this.data = assign(this.data, data);\n }","function encodeObject(o) {\n if (_.isNumber(o)) {\n if (_.isNaN(o)) {\n return ['SPECIAL_FLOAT', 'NaN'];\n } else if (o === Infinity) {\n return ['SPECIAL_FLOAT', 'Infinity'];\n } else if (o === -Infinity) {\n return ['SPECIAL_FLOAT', '-Infinity'];\n } else {\n return o;\n }\n } else if (_.isString(o)) {\n return o;\n } else if (_.isBoolean(o) || _.isNull(o) || _.isUndefined(o)) {\n return ['JS_SPECIAL_VAL', String(o)];\n } else if (typeof o === 'symbol') {\n // ES6 symbol\n return ['JS_SPECIAL_VAL', String(o)];\n } else {\n // render these as heap objects\n\n // very important to use _.has since we don't want to\n // grab the property in your prototype, only in YOURSELF ... SUBTLE!\n if (!_.has(o, 'smallObjId_hidden_')) {\n // make this non-enumerable so that it doesn't show up in\n // console.log() or other inspector functions\n Object.defineProperty(o, 'smallObjId_hidden_', { value: smallObjId,\n enumerable: false });\n smallObjId++;\n }\n assert(o.smallObjId_hidden_ > 0);\n\n var ret = ['REF', o.smallObjId_hidden_];\n\n if (encodedHeapObjects[String(o.smallObjId_hidden_)] !== undefined) {\n return ret;\n }\n else {\n assert(_.isObject(o));\n\n var newEncodedObj = [];\n encodedHeapObjects[String(o.smallObjId_hidden_)] = newEncodedObj;\n\n var i;\n\n if (_.isFunction(o)) {\n var funcProperties = []; // each element is a pair of [name, encoded value]\n\n var encodedProto = null;\n if (_.isObject(o.prototype)) {\n // TRICKY TRICKY! for inheritance to be displayed properly, we\n // want to find the prototype of o.prototype and see if it's\n // non-empty. if that's true, then even if o.prototype is\n // empty (i.e., has no properties of its own), then we should\n // still encode it since its 'prototype' \"uber-hidden\n // property\" is non-empty\n var prototypeOfPrototype = Object.getPrototypeOf(o.prototype);\n if (!_.isEmpty(o.prototype) ||\n (_.isObject(prototypeOfPrototype) && !_.isEmpty(prototypeOfPrototype))) {\n encodedProto = encodeObject(o.prototype);\n }\n }\n\n if (encodedProto) {\n funcProperties.push(['prototype', encodedProto]);\n }\n\n // now get all of the normal properties out of this function\n // object (it's unusual to put properties in a function object,\n // but it's still legal!)\n var funcPropPairs = _.pairs(o);\n for (i = 0; i < funcPropPairs.length; i++) {\n funcProperties.push([funcPropPairs[i][0], encodeObject(funcPropPairs[i][1])]);\n }\n\n var funcCodeString = o.toString();\n\n /*\n\n #craftsmanship -- make nested functions look better by indenting\n the first line of a nested function definition by however much\n the LAST line is indented, ONLY if the last line is simply a\n single ending '}'. otherwise it will look ugly since the\n function definition doesn't start out indented, like so:\n\nfunction bar(x) {\n globalZ += 100;\n return x + y + globalZ;\n }\n\n */\n var codeLines = funcCodeString.split('\\n');\n if (codeLines.length > 1) {\n var lastLine = _.last(codeLines);\n if (lastLine.trim() === '}') {\n var lastLinePrefix = lastLine.slice(0, lastLine.indexOf('}'));\n funcCodeString = lastLinePrefix + funcCodeString; // prepend!\n }\n }\n\n newEncodedObj.push('JS_FUNCTION',\n o.name,\n funcCodeString, /* code string*/\n funcProperties.length ? funcProperties : null, /* OPTIONAL */\n null /* parent frame */);\n } else if (_.isArray(o)) {\n newEncodedObj.push('LIST');\n for (i = 0; i < o.length; i++) {\n newEncodedObj.push(encodeObject(o[i]));\n }\n } else if (o.__proto__.toString() === canonicalSet.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\n newEncodedObj.push('SET');\n // ES6 Set (TODO: add WeakSet)\n for (let item of o) {\n newEncodedObj.push(encodeObject(item));\n }\n } else if (o.__proto__.toString() === canonicalMap.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\n // ES6 Map (TODO: add WeakMap)\n newEncodedObj.push('DICT'); // use the Python 'DICT' type since it's close enough; adjust display in frontend\n for (let [key, value] of o) {\n newEncodedObj.push([encodeObject(key), encodeObject(value)]);\n }\n } else {\n // a true object\n\n // if there's a custom toString() function (note that a truly\n // prototypeless object won't have toString method, so check first to\n // see if toString is *anywhere* up the prototype chain)\n var s = (o.toString !== undefined) ? o.toString() : '';\n if (s !== '' && s !== '[object Object]') {\n newEncodedObj.push('INSTANCE_PPRINT', 'object', s);\n } else {\n newEncodedObj.push('INSTANCE', '');\n var pairs = _.pairs(o);\n for (i = 0; i < pairs.length; i++) {\n var e = pairs[i];\n newEncodedObj.push([encodeObject(e[0]), encodeObject(e[1])]);\n }\n\n var proto = Object.getPrototypeOf(o);\n if (_.isObject(proto) && !_.isEmpty(proto)) {\n //log('obj.prototype', proto, proto.smallObjId_hidden_);\n // I think __proto__ is the official term for this field,\n // *not* 'prototype'\n newEncodedObj.push(['__proto__', encodeObject(proto)]);\n }\n }\n }\n\n return ret;\n }\n\n }\n assert(false);\n}","function dist_index_esm_contains(obj,key){return Object.prototype.hasOwnProperty.call(obj,key);}","function isRawPostcodeObject(o, additionalAttr, blackListedAttr) {\n\tif (!additionalAttr) additionalAttr = [];\n\tif (!blackListedAttr) blackListedAttr = [];\n\tisSomeObject(o, rawPostcodeAttributes, additionalAttr, blackListedAttr);\n}","function _meta_(v,m){var ms=v['__meta__']||{};for(var k in m){ms[k]=m[k]};v['__meta__']=ms;return v}","function Animal() {\n this.kind = \"Dog\"\n}","function Kitten(name, photo, interests, isGoodWithKids, isGoodWithDogs, isGoodWithCats) {\n this.name = name;\n this.photo = photo;\n this.interests = interests;\n this.isGoodWithKids = isGoodWithKids;\n this.isGoodWithCats = isGoodWithCats;\n this.isGoodWithDogs = isGoodWithDogs;\n}","getMeta () {\n }","function np(e){return\"[object Object]\"===Object.prototype.toString.call(e)}","function Obj() {}","function isFriend(name, object) {\n//use hasWord function to check object names array\n// console.log(object);\n// console.log(name);\n//conditional to check for property\nif (object['friends'] !== undefined) {\nreturn hasWord(object.friends.join(' '), name);\n}\nelse {return false};\n \n}","function test_fail_hole_prototype() {\n var obj = Object.create({ stuff: \"in prototype\" });\n obj.foo = \"bar\";\n\n function f1() {\n bidar.serialize(obj);\n }\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\n}","function Person(saying) {\n this.saying = saying;\n /*\n return {\n dumbObject: true\n }\n */\n}","transient private protected internal function m182() {}","function kotlin(hljs) {\n const KEYWORDS = {\n keyword:\n 'abstract as val var vararg get set class object open private protected public noinline ' +\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\n 'import package is in fun override companion reified inline lateinit init ' +\n 'interface annotation data sealed internal infix operator out by constructor super ' +\n 'tailrec where const inner suspend typealias external expect actual',\n built_in:\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\n literal:\n 'true false null'\n };\n const KEYWORDS_WITH_LABEL = {\n className: 'keyword',\n begin: /\\b(break|continue|return|this)\\b/,\n starts: {\n contains: [\n {\n className: 'symbol',\n begin: /@\\w+/\n }\n ]\n }\n };\n const LABEL = {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\n };\n\n // for string templates\n const SUBST = {\n className: 'subst',\n begin: /\\$\\{/,\n end: /\\}/,\n contains: [ hljs.C_NUMBER_MODE ]\n };\n const VARIABLE = {\n className: 'variable',\n begin: '\\\\$' + hljs.UNDERSCORE_IDENT_RE\n };\n const STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"\"\"',\n end: '\"\"\"(?=[^\"])',\n contains: [\n VARIABLE,\n SUBST\n ]\n },\n // Can't use built-in modes easily, as we want to use STRING in the meta\n // context as 'meta-string' and there's no syntax to remove explicitly set\n // classNames in built-in modes.\n {\n begin: '\\'',\n end: '\\'',\n illegal: /\\n/,\n contains: [ hljs.BACKSLASH_ESCAPE ]\n },\n {\n begin: '\"',\n end: '\"',\n illegal: /\\n/,\n contains: [\n hljs.BACKSLASH_ESCAPE,\n VARIABLE,\n SUBST\n ]\n }\n ]\n };\n SUBST.contains.push(STRING);\n\n const ANNOTATION_USE_SITE = {\n className: 'meta',\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\s*:(?:\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\n };\n const ANNOTATION = {\n className: 'meta',\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\n contains: [\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [\n hljs.inherit(STRING, {\n className: 'meta-string'\n })\n ]\n }\n ]\n };\n\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\n // According to the doc above, the number mode of kotlin is the same as java 8,\n // so the code below is copied from java.js\n const KOTLIN_NUMBER_MODE = NUMERIC;\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\n '/\\\\*', '\\\\*/',\n {\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\n }\n );\n const KOTLIN_PAREN_TYPE = {\n variants: [\n {\n className: 'type',\n begin: hljs.UNDERSCORE_IDENT_RE\n },\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [] // defined later\n }\n ]\n };\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\n\n return {\n name: 'Kotlin',\n aliases: [ 'kt' ],\n keywords: KEYWORDS,\n contains: [\n hljs.COMMENT(\n '/\\\\*\\\\*',\n '\\\\*/',\n {\n relevance: 0,\n contains: [\n {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n }\n ]\n }\n ),\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n KEYWORDS_WITH_LABEL,\n LABEL,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n {\n className: 'function',\n beginKeywords: 'fun',\n end: '[(]|$',\n returnBegin: true,\n excludeEnd: true,\n keywords: KEYWORDS,\n relevance: 5,\n contains: [\n {\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\s*\\\\(',\n returnBegin: true,\n relevance: 0,\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\n },\n {\n className: 'type',\n begin: //,\n keywords: 'reified',\n relevance: 0\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n endsParent: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n begin: /:/,\n end: /[=,\\/]/,\n endsWithParent: true,\n contains: [\n KOTLIN_PAREN_TYPE,\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT\n ],\n relevance: 0\n },\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n STRING,\n hljs.C_NUMBER_MODE\n ]\n },\n KOTLIN_NESTED_COMMENT\n ]\n },\n {\n className: 'class',\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\n end: /[:\\{(]|$/,\n excludeEnd: true,\n illegal: 'extends implements',\n contains: [\n {\n beginKeywords: 'public protected internal private constructor'\n },\n hljs.UNDERSCORE_TITLE_MODE,\n {\n className: 'type',\n begin: //,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0\n },\n {\n className: 'type',\n begin: /[,:]\\s*/,\n end: /[<\\(,]|$/,\n excludeBegin: true,\n returnEnd: true\n },\n ANNOTATION_USE_SITE,\n ANNOTATION\n ]\n },\n STRING,\n {\n className: 'meta',\n begin: \"^#!/usr/bin/env\",\n end: '$',\n illegal: '\\n'\n },\n KOTLIN_NUMBER_MODE\n ]\n };\n}","function kotlin(hljs) {\n const KEYWORDS = {\n keyword:\n 'abstract as val var vararg get set class object open private protected public noinline ' +\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\n 'import package is in fun override companion reified inline lateinit init ' +\n 'interface annotation data sealed internal infix operator out by constructor super ' +\n 'tailrec where const inner suspend typealias external expect actual',\n built_in:\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\n literal:\n 'true false null'\n };\n const KEYWORDS_WITH_LABEL = {\n className: 'keyword',\n begin: /\\b(break|continue|return|this)\\b/,\n starts: {\n contains: [\n {\n className: 'symbol',\n begin: /@\\w+/\n }\n ]\n }\n };\n const LABEL = {\n className: 'symbol',\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\n };\n\n // for string templates\n const SUBST = {\n className: 'subst',\n begin: /\\$\\{/,\n end: /\\}/,\n contains: [ hljs.C_NUMBER_MODE ]\n };\n const VARIABLE = {\n className: 'variable',\n begin: '\\\\$' + hljs.UNDERSCORE_IDENT_RE\n };\n const STRING = {\n className: 'string',\n variants: [\n {\n begin: '\"\"\"',\n end: '\"\"\"(?=[^\"])',\n contains: [\n VARIABLE,\n SUBST\n ]\n },\n // Can't use built-in modes easily, as we want to use STRING in the meta\n // context as 'meta-string' and there's no syntax to remove explicitly set\n // classNames in built-in modes.\n {\n begin: '\\'',\n end: '\\'',\n illegal: /\\n/,\n contains: [ hljs.BACKSLASH_ESCAPE ]\n },\n {\n begin: '\"',\n end: '\"',\n illegal: /\\n/,\n contains: [\n hljs.BACKSLASH_ESCAPE,\n VARIABLE,\n SUBST\n ]\n }\n ]\n };\n SUBST.contains.push(STRING);\n\n const ANNOTATION_USE_SITE = {\n className: 'meta',\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\s*:(?:\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\n };\n const ANNOTATION = {\n className: 'meta',\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\n contains: [\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [\n hljs.inherit(STRING, {\n className: 'meta-string'\n })\n ]\n }\n ]\n };\n\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\n // According to the doc above, the number mode of kotlin is the same as java 8,\n // so the code below is copied from java.js\n const KOTLIN_NUMBER_MODE = NUMERIC;\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\n '/\\\\*', '\\\\*/',\n {\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\n }\n );\n const KOTLIN_PAREN_TYPE = {\n variants: [\n {\n className: 'type',\n begin: hljs.UNDERSCORE_IDENT_RE\n },\n {\n begin: /\\(/,\n end: /\\)/,\n contains: [] // defined later\n }\n ]\n };\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\n\n return {\n name: 'Kotlin',\n aliases: [ 'kt' ],\n keywords: KEYWORDS,\n contains: [\n hljs.COMMENT(\n '/\\\\*\\\\*',\n '\\\\*/',\n {\n relevance: 0,\n contains: [\n {\n className: 'doctag',\n begin: '@[A-Za-z]+'\n }\n ]\n }\n ),\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n KEYWORDS_WITH_LABEL,\n LABEL,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n {\n className: 'function',\n beginKeywords: 'fun',\n end: '[(]|$',\n returnBegin: true,\n excludeEnd: true,\n keywords: KEYWORDS,\n relevance: 5,\n contains: [\n {\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\s*\\\\(',\n returnBegin: true,\n relevance: 0,\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\n },\n {\n className: 'type',\n begin: //,\n keywords: 'reified',\n relevance: 0\n },\n {\n className: 'params',\n begin: /\\(/,\n end: /\\)/,\n endsParent: true,\n keywords: KEYWORDS,\n relevance: 0,\n contains: [\n {\n begin: /:/,\n end: /[=,\\/]/,\n endsWithParent: true,\n contains: [\n KOTLIN_PAREN_TYPE,\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT\n ],\n relevance: 0\n },\n hljs.C_LINE_COMMENT_MODE,\n KOTLIN_NESTED_COMMENT,\n ANNOTATION_USE_SITE,\n ANNOTATION,\n STRING,\n hljs.C_NUMBER_MODE\n ]\n },\n KOTLIN_NESTED_COMMENT\n ]\n },\n {\n className: 'class',\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\n end: /[:\\{(]|$/,\n excludeEnd: true,\n illegal: 'extends implements',\n contains: [\n {\n beginKeywords: 'public protected internal private constructor'\n },\n hljs.UNDERSCORE_TITLE_MODE,\n {\n className: 'type',\n begin: //,\n excludeBegin: true,\n excludeEnd: true,\n relevance: 0\n },\n {\n className: 'type',\n begin: /[,:]\\s*/,\n end: /[<\\(,]|$/,\n excludeBegin: true,\n returnEnd: true\n },\n ANNOTATION_USE_SITE,\n ANNOTATION\n ]\n },\n STRING,\n {\n className: 'meta',\n begin: \"^#!/usr/bin/env\",\n end: '$',\n illegal: '\\n'\n },\n KOTLIN_NUMBER_MODE\n ]\n };\n}","function Surrogate(){}","function Surrogate(){}","function Surrogate(){}","static serialize(obj, allowPrimitives, fallbackToJson, requireJsonType = false) {\n if (allowPrimitives) {\n if (typeof obj === \"string\") {\n return this.serializePrimitive(obj, \"string\");\n } else if (typeof obj === \"number\") {\n return this.serializePrimitive(obj, \"double\");\n } else if (Buffer.isBuffer(obj)) {\n return this.serializePrimitive(obj, \"bytes\");\n } else if (typeof obj === \"boolean\") {\n return this.serializePrimitive(obj, \"bool\");\n } else if (Long.isLong(obj)) {\n return this.serializePrimitive(obj, \"int64\");\n }\n }\n if (obj.constructor && typeof obj.constructor.encode === \"function\" && obj.constructor.$type) {\n return Any.create({\n // I have *no* idea why it's type_url and not typeUrl, but it is.\n type_url: \"type.googleapis.com/\" + AnySupport.fullNameOf(obj.constructor.$type),\n value: obj.constructor.encode(obj).finish()\n });\n } else if (fallbackToJson && typeof obj === \"object\") {\n let type = obj.type;\n if (type === undefined) {\n if (requireJsonType) {\n throw new Error(util.format(\"Fallback to JSON serialization supported, but object does not define a type property: %o\", obj));\n } else {\n type = \"object\";\n }\n }\n return Any.create({\n type_url: CloudStateJson + type,\n value: this.serializePrimitiveValue(stableJsonStringify(obj), \"string\")\n });\n } else {\n throw new Error(util.format(\"Object %o is not a protobuf object, and hence can't be dynamically \" +\n \"serialized. Try passing the object to the protobuf classes create function.\", obj));\n }\n }"],"string":"[\n \"function compareLike(a,b){\\n var al = a.idLikesProp.length;\\n var bl = b.idLikesProp.length;\\n if(al > bl) return -1;\\n if(bl > al) return 1;\\n return 0;\\n}\",\n \"function lookAround() {\\n var objectDescription = \\\"\\\"\\n tj.see().then(function(objects) {\\n objects.forEach(function(each) {\\n if (each.score >= 0.4) {\\n objectDescription = objectDescription + \\\", \\\" + each.class\\n }\\n })\\n tj.speak(\\\"The objects I see are: \\\" + objectDescription)\\n });\\n}\",\n \"function recommendNewPosts() {\\n model.loadModel();\\n getNewPosts(function (err, posts) {\\n var label\\n ;\\n posts.forEach(function (post) {\\n label = model.classifyPost(post);\\n if (label == 'like') {\\n console.log(post);\\n }\\n });\\n });\\n }\",\n \"function BOT_onLike() {\\r\\n\\tBOT_traceString += \\\"GOTO command judge\\\" + \\\"\\\\n\\\"; // change performative\\r\\n\\tBOT_theReqJudgement = \\\"likeable\\\";\\r\\n\\tBOT_onJudge(); \\t\\r\\n\\tif(BOT_reqSuccess) {\\r\\n\\t\\tvar ta = [BOT_theReqTopic,BOT_theReqAttribute]; \\r\\n\\t\\tBOT_del(BOT_theUserTopicId,\\\"distaste\\\",\\\"VAL\\\",ta);\\r\\n\\t\\tBOT_add(BOT_theUserTopicId,\\\"preference\\\",\\\"VAL\\\",ta);\\r\\n\\t}\\r\\n}\",\n \"function like (data, archetype) {\\n var name;\\n\\n for (name in archetype) {\\n if (archetype.hasOwnProperty(name)) {\\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof archetype[name]) {\\n return false;\\n }\\n\\n if (object(data[name]) && like(data[name], archetype[name]) === false) {\\n return false;\\n }\\n }\\n }\\n\\n return true;\\n }\",\n \"function LanguageUnderstandingModel() {\\n }\",\n \"function guess() {\\n classifier.predict(video.elt, 5, gotResult);\\n}\",\n \"function theBigBang() {\\n\\t\\tinitLibs();\\n\\t\\tinitFuncs();\\n\\t\\tObject.setPrototypeOf(Universe.prototype, universe.kjsclasses._primitive_prototype);\\n\\t\\tObject.setPrototypeOf(Object.prototype, universe); // [0]\\n\\t}\",\n \"function readOwn(obj, name, pumpkin) {\\n if (typeof obj !== 'object' || !obj) {\\n if (typeOf(obj) !== 'object') {\\n return pumpkin;\\n }\\n }\\n if (typeof name === 'number' && name >= 0) {\\n if (myOriginalHOP.call(obj, name)) { return obj[name]; }\\n return pumpkin;\\n }\\n name = String(name);\\n if (obj[name + '_canRead___'] === obj) { return obj[name]; }\\n if (!myOriginalHOP.call(obj, name)) { return pumpkin; }\\n // inline remaining relevant cases from canReadPub\\n if (endsWith__.test(name)) { return pumpkin; }\\n if (name === 'toString') { return pumpkin; }\\n if (!isJSONContainer(obj)) { return pumpkin; }\\n fastpathRead(obj, name);\\n return obj[name];\\n }\",\n \"function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach(function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)})}\",\n \"function NXObject() {}\",\n \"function isPrimative(val) { return (typeof val !== 'object') }\",\n \"function like (data, duck) {\\n var name;\\n\\n assert.object(data);\\n assert.object(duck);\\n\\n for (name in duck) {\\n if (duck.hasOwnProperty(name)) {\\n if (data.hasOwnProperty(name) === false || typeof data[name] !== typeof duck[name]) {\\n return false;\\n }\\n\\n if (object(data[name]) && like(data[name], duck[name]) === false) {\\n return false;\\n }\\n }\\n }\\n\\n return true;\\n }\",\n \"static get observedAttributes() {\\n return ['rainbow', 'lang'];\\n }\",\n \"function a(e,t,n){(n?Reflect.getOwnMetadataKeys(t,n):Reflect.getOwnMetadataKeys(t)).forEach((function(r){var i=n?Reflect.getOwnMetadata(r,t,n):Reflect.getOwnMetadata(r,t);n?Reflect.defineMetadata(r,i,e,n):Reflect.defineMetadata(r,i,e)}))}\",\n \"function testSimpleHole_prototype() {\\n var theHole = Object.create({ x: \\\"in proto\\\" });\\n var theReplacement = \\\"yay\\\";\\n var serialized = bidar.serialize(theHole, holeFilter);\\n var parsed = bidar.parse(serialized, holeFiller);\\n\\n assert.equal(parsed, theReplacement);\\n\\n function holeFilter(x) {\\n assert.equal(x, theHole);\\n return { data: \\\"blort\\\" };\\n }\\n\\n function holeFiller(x) {\\n assert.equal(x, \\\"blort\\\");\\n return theReplacement;\\n }\\n}\",\n \"function test() {\\n\\t// \\\"ex nihilo\\\" object creation using the literal\\n\\t// object notation {}.\\n\\tvar foo = {\\n\\t\\tname : \\\"foo\\\",\\n\\t\\tone : 1,\\n\\t\\ttwo : 2\\n\\t};\\n\\n\\t// Another \\\"ex nihilo\\\" object.\\n\\tvar bar = {\\n\\t\\ttwo : \\\"two\\\",\\n\\t\\tthree : 3\\n\\t};\\n\\n\\t// Gecko and Webkit JavaScript engines can directly\\n\\t// manipulate the internal prototype link.\\n\\t// For the sake of simplicity, let us pretend\\n\\t// that the following line works regardless of the\\n\\t// engine used:\\n\\tbar.__proto__ = foo; // foo is now the prototype of bar.\\n\\n\\t// If we try to access foo's properties from bar\\n\\t// from now on, we'll succeed.\\n\\tlog(bar.one) // Resolves to 1.\\n\\n\\t// The child object's properties are also accessible.\\n\\tlog(bar.three) // Resolves to 3.\\n\\n\\t// Own properties shadow prototype properties\\n\\tlog(bar.two); // Resolves to \\\"two\\\"\\n\\tlog(foo.name); // unaffected, resolves to \\\"foo\\\"\\n\\tlog(bar.name); // Resolves to \\\"foo\\\"\\n log(foo.__proto__);\\n}\",\n \"function wrappedPrimitivePreviewer(className, classObj, objectActor, grip) {\\r\\n let {_obj} = objectActor;\\r\\n\\r\\n if (!_obj.proto || _obj.proto.class != className) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n let raw = _obj.unsafeDereference();\\r\\n let v = null;\\r\\n try {\\r\\n v = classObj.prototype.valueOf.call(raw);\\r\\n } catch (ex) {\\r\\n // valueOf() can throw if the raw JS object is \\\"misbehaved\\\".\\r\\n return false;\\r\\n }\\r\\n\\r\\n if (v === null) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n let canHandle = GenericObject(objectActor, grip, className === \\\"String\\\");\\r\\n if (!canHandle) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n grip.preview.wrappedValue = objectActor.getGrip(makeDebuggeeValueIfNeeded(_obj, v));\\r\\n return true;\\r\\n}\",\n \"function DartObject(o) {\\n this.o = o;\\n}\",\n \"function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}\",\n \"function i(t,e,n){(n?Reflect.getOwnMetadataKeys(e,n):Reflect.getOwnMetadataKeys(e)).forEach(function(r){var o=n?Reflect.getOwnMetadata(r,e,n):Reflect.getOwnMetadata(r,e);n?Reflect.defineMetadata(r,o,t,n):Reflect.defineMetadata(r,o,t)})}\",\n \"function likeVsLikes(toyLikeCount){\\n\\t\\tif (toyLikeCount == 1){\\n\\t\\t\\treturn 'Like';\\n\\t\\t} else {\\n\\t\\t\\treturn 'Likes';\\n\\t\\t}\\n\\t}\",\n \"constructor(spec) {\\n this.cached = /* @__PURE__ */ Object.create(null);\\n let instanceSpec = this.spec = {};\\n for (let prop in spec)\\n instanceSpec[prop] = spec[prop];\\n instanceSpec.nodes = OrderedMap.from(spec.nodes), instanceSpec.marks = OrderedMap.from(spec.marks || {}), this.nodes = NodeType$1.compile(this.spec.nodes, this);\\n this.marks = MarkType.compile(this.spec.marks, this);\\n let contentExprCache = /* @__PURE__ */ Object.create(null);\\n for (let prop in this.nodes) {\\n if (prop in this.marks)\\n throw new RangeError(prop + \\\" can not be both a node and a mark\\\");\\n let type = this.nodes[prop], contentExpr = type.spec.content || \\\"\\\", markExpr = type.spec.marks;\\n type.contentMatch = contentExprCache[contentExpr] || (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\\n type.inlineContent = type.contentMatch.inlineContent;\\n type.markSet = markExpr == \\\"_\\\" ? null : markExpr ? gatherMarks(this, markExpr.split(\\\" \\\")) : markExpr == \\\"\\\" || !type.inlineContent ? [] : null;\\n }\\n for (let prop in this.marks) {\\n let type = this.marks[prop], excl = type.spec.excludes;\\n type.excluded = excl == null ? [type] : excl == \\\"\\\" ? [] : gatherMarks(this, excl.split(\\\" \\\"));\\n }\\n this.nodeFromJSON = this.nodeFromJSON.bind(this);\\n this.markFromJSON = this.markFromJSON.bind(this);\\n this.topNodeType = this.nodes[this.spec.topNode || \\\"doc\\\"];\\n this.cached.wrappings = /* @__PURE__ */ Object.create(null);\\n }\",\n \"wordClass(word) {\\r\\n return {\\r\\n der: word.artikel == \\\"der\\\",\\r\\n die: word.artikel == \\\"die\\\",\\r\\n das: word.artikel == \\\"das\\\",\\r\\n marked: word.marker\\r\\n }\\r\\n }\",\n \"function dummyObjects(name, age){\\n this.name = name\\n this.age = age\\n}\",\n \"function handleLikes() {\\n // Get a random number\\n let randomNumber = Math.random();\\n // To make it unpredictable, only change the likes if =>\\n if (randomNumber < REVEAL_PROBABILITY) {\\n defineLikes();\\n }\\n}\",\n \"constructor() { \\n \\n Like.initialize(this);\\n }\",\n \"like() {\\r\\n return this.clone(Comment, \\\"Like\\\").postCore();\\r\\n }\",\n \"like() {\\r\\n return this.getItem().then(i => {\\r\\n return i.like();\\r\\n });\\r\\n }\",\n \"added(vrobject){}\",\n \"classify(phrase) { return this.clf.classify(phrase) }\",\n \"function badIdea(){\\n this.idea = \\\"bad\\\";\\n}\",\n \"shouldSerialize(prop, dataKey) {\\n const contains = (str, re) => (str.match(re) || []).length > 0;\\n const a = contains(dataKey, /\\\\./g);\\n const b = contains(dataKey, /\\\\[/g);\\n return !!prop.object && !(a || b);\\n }\",\n \"static get observedAttributes(){this.finalize();const e=[];// Use forEach so this works even if for/of loops are compiled to for loops\\n// expecting arrays\\nreturn this._classProperties.forEach((t,n)=>{const r=this._attributeNameForProperty(n,t);void 0!==r&&(this._attributeToPropertyMap.set(r,n),e.push(r))}),e}\",\n \"function oldAndLoud(object){\\n\\tobject.age++;\\n\\tobject.name = object.name.toUpperCase();\\n}\",\n \"like() {\\r\\n return this.clone(Item, \\\"like\\\").postCore();\\r\\n }\",\n \"function classifyPose() {\\n if (pose && working) {\\n inputs = [];\\n for (let i = 0; i < pose.landmarks.length; i++) {\\n inputs.push(pose.landmarks[i][0]);\\n inputs.push(pose.landmarks[i][1]);\\n inputs.push(pose.landmarks[i][2]);\\n }\\n brain.classify(inputs, gotResult)\\n }\\n }\",\n \"function PropertyDetection() {}\",\n \"constructor()\\n {\\n this.likes = [];\\n }\",\n \"async TestLikeDoctorPost(){\\n var response = await entity.Likes(6,28,true,true);\\n //console.log(response)\\n if(response != null){\\n console.log(\\\"\\\\x1b[32m%s\\\\x1b[0m\\\",\\\"TestDOctorRating Passed\\\");\\n }else{\\n console.log(\\\"\\\\x1b[31m%s\\\\x1b[0m\\\",\\\"TestDOctorRating Failed\\\");\\n }\\n\\n }\",\n \"function classifyVideo() {\\n classifier.predict(gotResult);\\n}\",\n \"function classifyVideo() {\\n classifier.predict(gotResult);\\n}\",\n \"function classifyVideo() {\\n classifier.predict(gotResult);\\n}\",\n \"function showLikes(likes) {\\n\\tconsole.log(`THINGS I LIKE:\\\\n`);\\n\\tfor(let like of likes) {\\n\\t\\tconsole.log(like);\\n\\t}\\n}\",\n \"function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}\",\n \"function protoAugment(target,src,keys){/* eslint-disable no-proto */target.__proto__=src;/* eslint-enable no-proto */}\",\n \"function Nevis() {}\",\n \"function Nevis() {}\",\n \"function Nevis() {}\",\n \"test_primitivesExtended() {\\n let translator = new Translator();\\n translator.registerPackage(PackageFile);\\n let text = JSON.stringify(this.json.primitivesExtended);\\n let object = translator.decode(text).getRoot();\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.PrimitivesExtended\\\", object.constructor.__getClass());\\n Assert.equals(\\\"alpha16\\\", object.string);\\n }\",\n \"function buildObjectsObj(gCloudV, azureCV, minScore = 0.0){\\n let objects = [];\\n\\n if(gCloudV) {// gcloud vision results are available\\n let gCloudObjects = gCloudV['localizedObjectAnnotations'];\\n\\n //apply standard bounding box to all the detected objects\\n if(azureCV)// azure computer vision results are available\\n gCloudVObjsToCogniBoundingBox(gCloudObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\\n\\n else//need to retrieve image sizes from gcloud (already done and put in the metadata tag of gcloudv with appropriate calls)\\n gCloudVObjsToCogniBoundingBox(gCloudObjects, gCloudV['metadata']['width'], gCloudV['metadata']['height']);\\n\\n for (let gCloudObj of gCloudObjects) {\\n if (gCloudObj['score'] > minScore) { //filter out unwanted tags\\n objects.push({\\n name: gCloudObj['name'],\\n mid: (gCloudObj['mid'] && gCloudObj['mid']!= '')? gCloudObj['mid']: undefined,\\n confidence: gCloudObj['score'],\\n boundingBox: gCloudObj['boundingBox']\\n });\\n }\\n }\\n }\\n\\n if(azureCV){// azure computer vision results are available\\n let azureObjects = azureCV['objects'];\\n //apply standard bounding box to all the detected objects\\n azureCVObjsToCogniBoundingBox(azureObjects, azureCV['metadata']['width'], azureCV['metadata']['height']);\\n for(let aObj of azureObjects){\\n if(aObj['confidence'] > minScore) { //filter out unwanted tags\\n objects.push({\\n name: aObj['object'],\\n confidence: aObj['confidence'],\\n boundingBox: aObj['boundingBox']\\n });\\n }\\n }\\n }\\n\\n objects = combineObjectsArray(objects);// build an array where labels regarding the same exact object are combined with averaged confidence\\n\\n objects.sort((a, b) => {\\n if(a['confidence']>b['confidence'])\\n return -1;\\n else if(a['confidence']==b['confidence'])\\n return 0;\\n else\\n return 1;\\n });\\n\\n return objects;\\n}\",\n \"function V(e){if(null===e||\\\"[object Object]\\\"!==function(e){return Object.prototype.toString.call(e)}(e))return!1;var t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}\",\n \"function classifyVideo() {\\r\\n classifier.classify(vid, gotResult);\\r\\n\\r\\n}\",\n \"function test_nountag_does_not_think_it_has_watch_tag_when_it_does_not() {\\n Assert.equal(TagNoun.fromJSON(\\\"watch\\\"), undefined);\\n}\",\n \"function v11(v12,v13) {\\n const v15 = v11(Object,Function);\\n // v15 = .unknown\\n const v16 = Object(v13,v8,0,v6);\\n // v16 = .object()\\n const v17 = 0;\\n // v17 = .integer\\n const v18 = 1;\\n // v18 = .integer\\n const v19 = 512;\\n // v19 = .integer\\n const v20 = \\\"-1024\\\";\\n // v20 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v21 = isFinite;\\n // v21 = .function([.anything] => .boolean)\\n const v23 = [1337];\\n // v23 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v24 = {};\\n // v24 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n let v25 = v23;\\n const v26 = -29897853;\\n // v26 = .integer\\n const v27 = \\\"replace\\\";\\n // v27 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v28 = Boolean;\\n // v28 = .object(ofGroup: BooleanConstructor, withProperties: [\\\"prototype\\\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\\n const v30 = [13.37,13.37];\\n // v30 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v31 = 1337;\\n // v31 = .integer\\n let v32 = 13.37;\\n const v36 = [13.37,13.37,13.37];\\n // v36 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v38 = [1337,1337];\\n // v38 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v39 = [13.37,1337,v38,1337,\\\"-128\\\",13.37,\\\"-128\\\",\\\"-128\\\",2147483647,1337];\\n // v39 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v40 = {__proto__:v36,length:v39};\\n // v40 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\", \\\"length\\\"])\\n const v41 = \\\"0\\\";\\n // v41 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v42 = -4130093409;\\n // v42 = .integer\\n const v44 = {b:2147483647,e:v38,valueOf:v36};\\n // v44 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\", \\\"b\\\", \\\"valueOf\\\", \\\"e\\\"])\\n const v45 = \\\"k**baeaDif\\\";\\n // v45 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v46 = 65536;\\n // v46 = .integer\\n const v47 = \\\"k**baeaDif\\\";\\n // v47 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v48 = 13.37;\\n // v48 = .float\\n const v50 = [13.37,13.37];\\n // v50 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v51 = ~v50;\\n // v51 = .boolean\\n const v53 = [13.37];\\n // v53 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n let v54 = v53;\\n const v55 = gc;\\n // v55 = .function([] => .undefined)\\n const v58 = [13.37,13.37,13.37,13.37];\\n // v58 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v60 = [1337,1337,1337,1337];\\n // v60 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v61 = [3697200800,v58,v60];\\n // v61 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v62 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v61};\\n // v62 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"__proto__\\\", \\\"length\\\", \\\"constructor\\\", \\\"toString\\\", \\\"valueOf\\\"])\\n const v65 = [13.37,13.37,13.37,13.37];\\n // v65 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v67 = [1337,1337,1337,1337];\\n // v67 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v68 = [3697200800,v65,v67];\\n // v68 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v69 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v68};\\n // v69 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\", \\\"toString\\\", \\\"valueOf\\\"])\\n const v70 = Object;\\n // v70 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n function v71(v72) {\\n }\\n const v74 = [13.37];\\n // v74 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v75 = 1337;\\n // v75 = .integer\\n const v76 = v44 ** 13.37;\\n // v76 = .integer | .float | .bigint\\n function v77(v78,v79,v80,v81,v82) {\\n }\\n let v83 = v74;\\n const v84 = \\\"2\\\";\\n // v84 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v85 = \\\"2\\\";\\n // v85 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v88 = [13.37,13.37,1337,13.37];\\n // v88 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n function v89(v90,v91,v92) {\\n }\\n const v94 = [1337,1337,1337,1337];\\n // v94 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v95 = [3697200800,v88,v94];\\n // v95 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n function v96(v97,v98) {\\n }\\n const v99 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,d:v95};\\n // v99 = .object(ofGroup: Object, withProperties: [\\\"toString\\\", \\\"length\\\", \\\"constructor\\\", \\\"__proto__\\\", \\\"e\\\", \\\"d\\\"])\\n let v100 = 13.37;\\n const v101 = typeof v74;\\n // v101 = .string\\n const v102 = \\\"symbol\\\";\\n // v102 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v103 = 3697200800;\\n // v103 = .integer\\n const v104 = \\\"2\\\";\\n // v104 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v105 = Boolean;\\n // v105 = .object(ofGroup: BooleanConstructor, withProperties: [\\\"prototype\\\"]) + .function([.anything] => .boolean) + .constructor([.anything] => .boolean)\\n const v106 = Function;\\n // v106 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v107 = 13.37;\\n // v107 = .float\\n const v108 = 1337;\\n // v108 = .integer\\n const v109 = \\\"2\\\";\\n // v109 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v110 = Function;\\n // v110 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v112 = [13.37,13.37,13.37,13.37];\\n // v112 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v113 = 1337;\\n // v113 = .integer\\n let v114 = 13.37;\\n const v116 = {...3697200800,...3697200800};\\n // v116 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n const v117 = Object;\\n // v117 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v118 = Function;\\n // v118 = .constructor([.string] => .object(ofGroup: Function, withProperties: [\\\"constructor\\\", \\\"arguments\\\", \\\"__proto__\\\", \\\"name\\\", \\\"caller\\\", \\\"prototype\\\", \\\"length\\\"], withMethods: [\\\"call\\\", \\\"bind\\\", \\\"apply\\\"]) + .function([.anything...] => .unknown) + .constructor([.anything...] => .unknown))\\n const v119 = {};\\n // v119 = .object(ofGroup: Object, withProperties: [\\\"__proto__\\\"])\\n let v120 = v119;\\n const v121 = (3697200800).constructor;\\n // v121 = .unknown\\n function v122(v123,v124) {\\n }\\n const v125 = Promise;\\n // v125 = .object(ofGroup: PromiseConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"race\\\", \\\"allSettled\\\", \\\"reject\\\", \\\"all\\\", \\\"resolve\\\"]) + .constructor([.function()] => .object(ofGroup: Promise, withProperties: [\\\"__proto__\\\"], withMethods: [\\\"finally\\\", \\\"then\\\", \\\"catch\\\"]))\\n const v128 = 4;\\n // v128 = .integer\\n let v129 = 0;\\n const v131 = [13.37,13.37,13.37,13.37];\\n // v131 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v133 = [1337,1337,1337,1337];\\n // v133 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v134 = [3697200800,v131,v133];\\n // v134 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v135 = Object;\\n // v135 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v136 = -944747134;\\n // v136 = .integer\\n const v139 = [13.37,13.37,13.37,13.37];\\n // v139 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v141 = [1337,1337,1337,1337];\\n // v141 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v142 = [3697200800,v139,v141];\\n // v142 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v143 = {__proto__:3697200800,constructor:1337,e:3697200800,length:13.37,toString:3697200800,valueOf:v142};\\n // v143 = .object(ofGroup: Object, withProperties: [\\\"toString\\\", \\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\", \\\"valueOf\\\", \\\"length\\\"])\\n let v144 = v143;\\n const v145 = gc;\\n // v145 = .function([] => .undefined)\\n let v146 = 13.37;\\n const v150 = [13.37,13.37,13.37,Function];\\n // v150 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v152 = [1337,1337,1337,1337];\\n // v152 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v153 = [3697200800,v150,v152];\\n // v153 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v154 = v153 + 1;\\n // v154 = .primitive\\n let v155 = 0;\\n const v156 = v155 + 1;\\n // v156 = .primitive\\n const v158 = \\\"2\\\";\\n // v158 = .string + .object(ofGroup: String, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"padEnd\\\", \\\"split\\\", \\\"charAt\\\", \\\"match\\\", \\\"lastIndexOf\\\", \\\"charCodeAt\\\", \\\"trim\\\", \\\"startsWith\\\", \\\"includes\\\", \\\"repeat\\\", \\\"search\\\", \\\"slice\\\", \\\"endsWith\\\", \\\"matchAll\\\", \\\"indexOf\\\", \\\"concat\\\", \\\"replace\\\", \\\"padStart\\\", \\\"substring\\\", \\\"codePointAt\\\"])\\n const v160 = [13.37,13.37,13.37,13.37];\\n // v160 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v162 = 0;\\n // v162 = .integer\\n const v163 = [1337,1337,1337,1337];\\n // v163 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v164 = [3697200800,1337,v163];\\n // v164 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v166 = 1337;\\n // v166 = .integer\\n let v167 = 2594067260;\\n const v169 = 4;\\n // v169 = .integer\\n let v170 = 0;\\n const v171 = v167 + 1;\\n // v171 = .primitive\\n const v172 = {__proto__:3697200800,constructor:v163,e:3697200800,length:13.37,toString:3697200800,valueOf:v164};\\n // v172 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"__proto__\\\", \\\"constructor\\\", \\\"valueOf\\\", \\\"length\\\", \\\"toString\\\"])\\n const v173 = 0;\\n // v173 = .integer\\n const v174 = 5;\\n // v174 = .integer\\n const v175 = 2937513072;\\n // v175 = .integer\\n const v176 = Object;\\n // v176 = .object(ofGroup: ObjectConstructor, withProperties: [\\\"prototype\\\"], withMethods: [\\\"setPrototypeOf\\\", \\\"assign\\\", \\\"fromEntries\\\", \\\"seal\\\", \\\"getOwnPropertyNames\\\", \\\"freeze\\\", \\\"defineProperty\\\", \\\"create\\\", \\\"getPrototypeOf\\\", \\\"getOwnPropertySymbols\\\", \\\"keys\\\", \\\"values\\\", \\\"isExtensible\\\", \\\"entries\\\", \\\"is\\\", \\\"getOwnPropertyDescriptor\\\", \\\"preventExtensions\\\", \\\"defineProperties\\\", \\\"getOwnPropertyDescriptors\\\", \\\"isSealed\\\", \\\"isFrozen\\\"]) + .function([.anything...] => .object()) + .constructor([.anything...] => .object())\\n const v177 = v172.constructor;\\n // v177 = .unknown\\n const v178 = 0;\\n // v178 = .integer\\n const v179 = 1;\\n // v179 = .integer\\n try {\\n } catch(v180) {\\n const v182 = [13.37,13.37,13.37,13.37];\\n // v182 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v183 = v182.__proto__;\\n // v183 = .object()\\n function v185(v186) {\\n }\\n const v187 = Object >>> v183;\\n // v187 = .integer | .bigint\\n }\\n function v188(v189,v190,v191,v192,...v193) {\\n }\\n}\",\n \"function markRaw(obj) {\\r\\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\\r\\n return obj;\\r\\n }\\r\\n // set the vue observable flag at obj\\r\\n var ob = createObserver();\\r\\n ob.__raw__ = true;\\r\\n def(obj, '__ob__', ob);\\r\\n // mark as Raw\\r\\n rawSet.set(obj, true);\\r\\n return obj;\\r\\n}\",\n \"function markRaw(obj) {\\r\\n if (!(isPlainObject(obj) || isArray(obj)) || !Object.isExtensible(obj)) {\\r\\n return obj;\\r\\n }\\r\\n // set the vue observable flag at obj\\r\\n var ob = createObserver();\\r\\n ob.__raw__ = true;\\r\\n def(obj, '__ob__', ob);\\r\\n // mark as Raw\\r\\n rawSet.set(obj, true);\\r\\n return obj;\\r\\n}\",\n \"transient private internal function m185() {}\",\n \"function rekognizeLabels(bucket, key) {\\n let params = {\\n Image: {\\n S3Object: {\\n Bucket: bucket,\\n Name: key\\n }\\n },\\n MaxLabels: 3,\\n MinConfidence: 80\\n };\\n\\n return rekognition.detectLabels(params).promise()\\n}\",\n \"test_doNotRetainAnno(){\\n let translator = new Translator();\\n translator.registerPackage(PackageFile);\\n let text = JSON.stringify(this.json.doNotRetainAnno);\\n let object1 = translator.decode(text).getRoot();\\n let object2 = translator.decode(text).getRoot();\\n\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\\\", object1.constructor.__getClass());\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.DoNotRetainAnno\\\", object2.constructor.__getClass());\\n Assert.notEquals(object1, object2);\\n }\",\n \"function LK_likeIt(elem) {\\n var likeGroup = elem.getAttribute(LK_LIKEGROUP);\\n var likeValue = elem.getAttribute(LK_LIKEVALUE);\\n localStorage[likeGroup] = likeValue;\\n\\n // Change the style of the liker nodes\\n var siblings = elem.parentNode.childNodes;\\n for (var i = 0; i < siblings.length; i++) {\\n if (siblings[i].style) { \\n LK_applyNormalStyle(siblings[i]);\\n }\\n }\\n LK_applySelectedStyle(elem, likeValue);\\n\\n // Change the value of any mini likers\\n var allSpans = document.getElementsByTagName('span');\\n for (var i = 0; i < allSpans.length; i++) {\\n var span = allSpans[i];\\n if (span.getAttribute(LK_LIKEGROUP) == likeGroup) {\\n if (span.getAttribute(LK_LIKETYPE) == 'mini') {\\n span.innerHTML = LK_MAPPINGS[likeValue].label;\\n LK_applySelectedStyle(allSpans[i], likeValue);\\n }\\n }\\n }\\n}\",\n \"function OOPExample(who) {\\n this.me = who;\\n}\",\n \"getLikes(state, data) {\\n state.likes = data\\n }\",\n \"function _isAlternativeRecognitionResult(obj) {\\r\\n return obj && typeof obj === 'object';\\r\\n}\",\n \"function addLikes() {\\n if (propLike?.includes(user.username)) {\\n let index = propLike.indexOf(user.username);\\n let removeLike = [\\n ...propLike.slice(0, index),\\n ...propLike.slice(index + 1),\\n ];\\n setLikeGet(removeLike);\\n setPropLike(removeLike);\\n setRedLike(\\\"\\\");\\n\\n addToLike(eventid, removeLike);\\n } else {\\n let likesArr = [...propLike, `${user.username}`];\\n\\n setLikeGet(likesArr);\\n setPropLike(likesArr);\\n setRedLike(\\\"red\\\");\\n addToLike(eventid, likesArr);\\n }\\n }\",\n \"function LiteralObject() {\\r\\n}\",\n \"function Komunalne() {}\",\n \"function Bevy() {}\",\n \"function Prediction() {\\n this.score = {};\\n}\",\n \"function Object() {}\",\n \"function Object() {}\",\n \"function canEnumPub(obj, name) {\\n if (obj === null) { return false; }\\n if (obj === void 0) { return false; }\\n name = String(name);\\n if (obj[name + '_canEnum___']) { return true; }\\n if (endsWith__.test(name)) { return false; }\\n if (!isJSONContainer(obj)) { return false; }\\n if (!myOriginalHOP.call(obj, name)) { return false; }\\n fastpathEnum(obj, name);\\n if (name === 'toString') { return true; }\\n fastpathRead(obj, name);\\n return true;\\n }\",\n \"function Obj(){ return Literal.apply(this,arguments) }\",\n \"test_primitives() {\\n let translator = new Translator();\\n translator.registerPackage(PackageFile);\\n let text = JSON.stringify(this.json.primitives);\\n let object = translator.decode(text).getRoot();\\n Assert.equals(\\\"ca.frar.jjjrmi.translator.testclasses.Primitives\\\", object.constructor.__getClass());\\n Assert.equals(\\\"alpha9\\\", object.string);\\n }\",\n \"function hello()\\n{\\n /* ATTRIBUTES */\\n this.coolbeans = 'class';\\n this.something = 'hello-class';\\n\\n}\",\n \"function test_cluster_tagged_crosshair_op_vsphere65() {}\",\n \"function classifyVideo() {\\n classifier.classify(gotResult);\\n}\",\n \"function classifyVideo() {\\n classifier.classify(gotResult);\\n}\",\n \"constructor(papa,mummy,sivlings,belongs,loving_bro,favs_bro){\\n super(papa,mummy,sivlings,belongs)\\n this.loving_bro=loving_bro\\n this.favs_bro=favs_bro\\n }\",\n \"function v8(v9,v10) {\\n const v16 = [1337,1337];\\n // v16 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v17 = [\\\"536870912\\\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\\n // v17 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v18 = {constructor:13.37,e:v16};\\n // v18 = .object(ofGroup: Object, withProperties: [\\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\"])\\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\\n // v19 = .object(ofGroup: Object, withProperties: [\\\"d\\\", \\\"b\\\", \\\"a\\\", \\\"__proto__\\\", \\\"e\\\", \\\"constructor\\\", \\\"length\\\"])\\n const v21 = new Float64Array(v19);\\n // v21 = .object(ofGroup: Float64Array, withProperties: [\\\"byteOffset\\\", \\\"constructor\\\", \\\"buffer\\\", \\\"__proto__\\\", \\\"byteLength\\\", \\\"length\\\"], withMethods: [\\\"map\\\", \\\"values\\\", \\\"subarray\\\", \\\"find\\\", \\\"fill\\\", \\\"set\\\", \\\"findIndex\\\", \\\"some\\\", \\\"reduceRight\\\", \\\"reverse\\\", \\\"join\\\", \\\"includes\\\", \\\"entries\\\", \\\"reduce\\\", \\\"every\\\", \\\"copyWithin\\\", \\\"sort\\\", \\\"forEach\\\", \\\"lastIndexOf\\\", \\\"indexOf\\\", \\\"filter\\\", \\\"slice\\\", \\\"keys\\\"])\\n v6[6] = v7;\\n v7.toString = v9;\\n }\",\n \"function defineInspect(classObject) {\\n var fn = classObject.prototype.toJSON;\\n typeof fn === 'function' || invariant(0);\\n classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\\n\\n if (nodejsCustomInspectSymbol[\\\"a\\\" /* default */]) {\\n classObject.prototype[nodejsCustomInspectSymbol[\\\"a\\\" /* default */]] = fn;\\n }\\n}\",\n \"annotate(message: string, data: Object) {\\n this.message = message;\\n this.data = assign(this.data, data);\\n }\",\n \"function encodeObject(o) {\\n if (_.isNumber(o)) {\\n if (_.isNaN(o)) {\\n return ['SPECIAL_FLOAT', 'NaN'];\\n } else if (o === Infinity) {\\n return ['SPECIAL_FLOAT', 'Infinity'];\\n } else if (o === -Infinity) {\\n return ['SPECIAL_FLOAT', '-Infinity'];\\n } else {\\n return o;\\n }\\n } else if (_.isString(o)) {\\n return o;\\n } else if (_.isBoolean(o) || _.isNull(o) || _.isUndefined(o)) {\\n return ['JS_SPECIAL_VAL', String(o)];\\n } else if (typeof o === 'symbol') {\\n // ES6 symbol\\n return ['JS_SPECIAL_VAL', String(o)];\\n } else {\\n // render these as heap objects\\n\\n // very important to use _.has since we don't want to\\n // grab the property in your prototype, only in YOURSELF ... SUBTLE!\\n if (!_.has(o, 'smallObjId_hidden_')) {\\n // make this non-enumerable so that it doesn't show up in\\n // console.log() or other inspector functions\\n Object.defineProperty(o, 'smallObjId_hidden_', { value: smallObjId,\\n enumerable: false });\\n smallObjId++;\\n }\\n assert(o.smallObjId_hidden_ > 0);\\n\\n var ret = ['REF', o.smallObjId_hidden_];\\n\\n if (encodedHeapObjects[String(o.smallObjId_hidden_)] !== undefined) {\\n return ret;\\n }\\n else {\\n assert(_.isObject(o));\\n\\n var newEncodedObj = [];\\n encodedHeapObjects[String(o.smallObjId_hidden_)] = newEncodedObj;\\n\\n var i;\\n\\n if (_.isFunction(o)) {\\n var funcProperties = []; // each element is a pair of [name, encoded value]\\n\\n var encodedProto = null;\\n if (_.isObject(o.prototype)) {\\n // TRICKY TRICKY! for inheritance to be displayed properly, we\\n // want to find the prototype of o.prototype and see if it's\\n // non-empty. if that's true, then even if o.prototype is\\n // empty (i.e., has no properties of its own), then we should\\n // still encode it since its 'prototype' \\\"uber-hidden\\n // property\\\" is non-empty\\n var prototypeOfPrototype = Object.getPrototypeOf(o.prototype);\\n if (!_.isEmpty(o.prototype) ||\\n (_.isObject(prototypeOfPrototype) && !_.isEmpty(prototypeOfPrototype))) {\\n encodedProto = encodeObject(o.prototype);\\n }\\n }\\n\\n if (encodedProto) {\\n funcProperties.push(['prototype', encodedProto]);\\n }\\n\\n // now get all of the normal properties out of this function\\n // object (it's unusual to put properties in a function object,\\n // but it's still legal!)\\n var funcPropPairs = _.pairs(o);\\n for (i = 0; i < funcPropPairs.length; i++) {\\n funcProperties.push([funcPropPairs[i][0], encodeObject(funcPropPairs[i][1])]);\\n }\\n\\n var funcCodeString = o.toString();\\n\\n /*\\n\\n #craftsmanship -- make nested functions look better by indenting\\n the first line of a nested function definition by however much\\n the LAST line is indented, ONLY if the last line is simply a\\n single ending '}'. otherwise it will look ugly since the\\n function definition doesn't start out indented, like so:\\n\\nfunction bar(x) {\\n globalZ += 100;\\n return x + y + globalZ;\\n }\\n\\n */\\n var codeLines = funcCodeString.split('\\\\n');\\n if (codeLines.length > 1) {\\n var lastLine = _.last(codeLines);\\n if (lastLine.trim() === '}') {\\n var lastLinePrefix = lastLine.slice(0, lastLine.indexOf('}'));\\n funcCodeString = lastLinePrefix + funcCodeString; // prepend!\\n }\\n }\\n\\n newEncodedObj.push('JS_FUNCTION',\\n o.name,\\n funcCodeString, /* code string*/\\n funcProperties.length ? funcProperties : null, /* OPTIONAL */\\n null /* parent frame */);\\n } else if (_.isArray(o)) {\\n newEncodedObj.push('LIST');\\n for (i = 0; i < o.length; i++) {\\n newEncodedObj.push(encodeObject(o[i]));\\n }\\n } else if (o.__proto__.toString() === canonicalSet.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\\n newEncodedObj.push('SET');\\n // ES6 Set (TODO: add WeakSet)\\n for (let item of o) {\\n newEncodedObj.push(encodeObject(item));\\n }\\n } else if (o.__proto__.toString() === canonicalMap.__proto__.toString()) { // dunno why 'instanceof' doesn't work :(\\n // ES6 Map (TODO: add WeakMap)\\n newEncodedObj.push('DICT'); // use the Python 'DICT' type since it's close enough; adjust display in frontend\\n for (let [key, value] of o) {\\n newEncodedObj.push([encodeObject(key), encodeObject(value)]);\\n }\\n } else {\\n // a true object\\n\\n // if there's a custom toString() function (note that a truly\\n // prototypeless object won't have toString method, so check first to\\n // see if toString is *anywhere* up the prototype chain)\\n var s = (o.toString !== undefined) ? o.toString() : '';\\n if (s !== '' && s !== '[object Object]') {\\n newEncodedObj.push('INSTANCE_PPRINT', 'object', s);\\n } else {\\n newEncodedObj.push('INSTANCE', '');\\n var pairs = _.pairs(o);\\n for (i = 0; i < pairs.length; i++) {\\n var e = pairs[i];\\n newEncodedObj.push([encodeObject(e[0]), encodeObject(e[1])]);\\n }\\n\\n var proto = Object.getPrototypeOf(o);\\n if (_.isObject(proto) && !_.isEmpty(proto)) {\\n //log('obj.prototype', proto, proto.smallObjId_hidden_);\\n // I think __proto__ is the official term for this field,\\n // *not* 'prototype'\\n newEncodedObj.push(['__proto__', encodeObject(proto)]);\\n }\\n }\\n }\\n\\n return ret;\\n }\\n\\n }\\n assert(false);\\n}\",\n \"function dist_index_esm_contains(obj,key){return Object.prototype.hasOwnProperty.call(obj,key);}\",\n \"function isRawPostcodeObject(o, additionalAttr, blackListedAttr) {\\n\\tif (!additionalAttr) additionalAttr = [];\\n\\tif (!blackListedAttr) blackListedAttr = [];\\n\\tisSomeObject(o, rawPostcodeAttributes, additionalAttr, blackListedAttr);\\n}\",\n \"function _meta_(v,m){var ms=v['__meta__']||{};for(var k in m){ms[k]=m[k]};v['__meta__']=ms;return v}\",\n \"function Animal() {\\n this.kind = \\\"Dog\\\"\\n}\",\n \"function Kitten(name, photo, interests, isGoodWithKids, isGoodWithDogs, isGoodWithCats) {\\n this.name = name;\\n this.photo = photo;\\n this.interests = interests;\\n this.isGoodWithKids = isGoodWithKids;\\n this.isGoodWithCats = isGoodWithCats;\\n this.isGoodWithDogs = isGoodWithDogs;\\n}\",\n \"getMeta () {\\n }\",\n \"function np(e){return\\\"[object Object]\\\"===Object.prototype.toString.call(e)}\",\n \"function Obj() {}\",\n \"function isFriend(name, object) {\\n//use hasWord function to check object names array\\n// console.log(object);\\n// console.log(name);\\n//conditional to check for property\\nif (object['friends'] !== undefined) {\\nreturn hasWord(object.friends.join(' '), name);\\n}\\nelse {return false};\\n \\n}\",\n \"function test_fail_hole_prototype() {\\n var obj = Object.create({ stuff: \\\"in prototype\\\" });\\n obj.foo = \\\"bar\\\";\\n\\n function f1() {\\n bidar.serialize(obj);\\n }\\n assert.throws(f1, /Hole-ful graph, but no hole filter/);\\n}\",\n \"function Person(saying) {\\n this.saying = saying;\\n /*\\n return {\\n dumbObject: true\\n }\\n */\\n}\",\n \"transient private protected internal function m182() {}\",\n \"function kotlin(hljs) {\\n const KEYWORDS = {\\n keyword:\\n 'abstract as val var vararg get set class object open private protected public noinline ' +\\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\\n 'import package is in fun override companion reified inline lateinit init ' +\\n 'interface annotation data sealed internal infix operator out by constructor super ' +\\n 'tailrec where const inner suspend typealias external expect actual',\\n built_in:\\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\\n literal:\\n 'true false null'\\n };\\n const KEYWORDS_WITH_LABEL = {\\n className: 'keyword',\\n begin: /\\\\b(break|continue|return|this)\\\\b/,\\n starts: {\\n contains: [\\n {\\n className: 'symbol',\\n begin: /@\\\\w+/\\n }\\n ]\\n }\\n };\\n const LABEL = {\\n className: 'symbol',\\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\\n };\\n\\n // for string templates\\n const SUBST = {\\n className: 'subst',\\n begin: /\\\\$\\\\{/,\\n end: /\\\\}/,\\n contains: [ hljs.C_NUMBER_MODE ]\\n };\\n const VARIABLE = {\\n className: 'variable',\\n begin: '\\\\\\\\$' + hljs.UNDERSCORE_IDENT_RE\\n };\\n const STRING = {\\n className: 'string',\\n variants: [\\n {\\n begin: '\\\"\\\"\\\"',\\n end: '\\\"\\\"\\\"(?=[^\\\"])',\\n contains: [\\n VARIABLE,\\n SUBST\\n ]\\n },\\n // Can't use built-in modes easily, as we want to use STRING in the meta\\n // context as 'meta-string' and there's no syntax to remove explicitly set\\n // classNames in built-in modes.\\n {\\n begin: '\\\\'',\\n end: '\\\\'',\\n illegal: /\\\\n/,\\n contains: [ hljs.BACKSLASH_ESCAPE ]\\n },\\n {\\n begin: '\\\"',\\n end: '\\\"',\\n illegal: /\\\\n/,\\n contains: [\\n hljs.BACKSLASH_ESCAPE,\\n VARIABLE,\\n SUBST\\n ]\\n }\\n ]\\n };\\n SUBST.contains.push(STRING);\\n\\n const ANNOTATION_USE_SITE = {\\n className: 'meta',\\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\\\\\s*:(?:\\\\\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\\n };\\n const ANNOTATION = {\\n className: 'meta',\\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\\n contains: [\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [\\n hljs.inherit(STRING, {\\n className: 'meta-string'\\n })\\n ]\\n }\\n ]\\n };\\n\\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\\n // According to the doc above, the number mode of kotlin is the same as java 8,\\n // so the code below is copied from java.js\\n const KOTLIN_NUMBER_MODE = NUMERIC;\\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\\n '/\\\\\\\\*', '\\\\\\\\*/',\\n {\\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\\n }\\n );\\n const KOTLIN_PAREN_TYPE = {\\n variants: [\\n {\\n className: 'type',\\n begin: hljs.UNDERSCORE_IDENT_RE\\n },\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [] // defined later\\n }\\n ]\\n };\\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\\n\\n return {\\n name: 'Kotlin',\\n aliases: [ 'kt' ],\\n keywords: KEYWORDS,\\n contains: [\\n hljs.COMMENT(\\n '/\\\\\\\\*\\\\\\\\*',\\n '\\\\\\\\*/',\\n {\\n relevance: 0,\\n contains: [\\n {\\n className: 'doctag',\\n begin: '@[A-Za-z]+'\\n }\\n ]\\n }\\n ),\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n KEYWORDS_WITH_LABEL,\\n LABEL,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n {\\n className: 'function',\\n beginKeywords: 'fun',\\n end: '[(]|$',\\n returnBegin: true,\\n excludeEnd: true,\\n keywords: KEYWORDS,\\n relevance: 5,\\n contains: [\\n {\\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\\\\\s*\\\\\\\\(',\\n returnBegin: true,\\n relevance: 0,\\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\\n },\\n {\\n className: 'type',\\n begin: //,\\n keywords: 'reified',\\n relevance: 0\\n },\\n {\\n className: 'params',\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n endsParent: true,\\n keywords: KEYWORDS,\\n relevance: 0,\\n contains: [\\n {\\n begin: /:/,\\n end: /[=,\\\\/]/,\\n endsWithParent: true,\\n contains: [\\n KOTLIN_PAREN_TYPE,\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT\\n ],\\n relevance: 0\\n },\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n STRING,\\n hljs.C_NUMBER_MODE\\n ]\\n },\\n KOTLIN_NESTED_COMMENT\\n ]\\n },\\n {\\n className: 'class',\\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\\n end: /[:\\\\{(]|$/,\\n excludeEnd: true,\\n illegal: 'extends implements',\\n contains: [\\n {\\n beginKeywords: 'public protected internal private constructor'\\n },\\n hljs.UNDERSCORE_TITLE_MODE,\\n {\\n className: 'type',\\n begin: //,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0\\n },\\n {\\n className: 'type',\\n begin: /[,:]\\\\s*/,\\n end: /[<\\\\(,]|$/,\\n excludeBegin: true,\\n returnEnd: true\\n },\\n ANNOTATION_USE_SITE,\\n ANNOTATION\\n ]\\n },\\n STRING,\\n {\\n className: 'meta',\\n begin: \\\"^#!/usr/bin/env\\\",\\n end: '$',\\n illegal: '\\\\n'\\n },\\n KOTLIN_NUMBER_MODE\\n ]\\n };\\n}\",\n \"function kotlin(hljs) {\\n const KEYWORDS = {\\n keyword:\\n 'abstract as val var vararg get set class object open private protected public noinline ' +\\n 'crossinline dynamic final enum if else do while for when throw try catch finally ' +\\n 'import package is in fun override companion reified inline lateinit init ' +\\n 'interface annotation data sealed internal infix operator out by constructor super ' +\\n 'tailrec where const inner suspend typealias external expect actual',\\n built_in:\\n 'Byte Short Char Int Long Boolean Float Double Void Unit Nothing',\\n literal:\\n 'true false null'\\n };\\n const KEYWORDS_WITH_LABEL = {\\n className: 'keyword',\\n begin: /\\\\b(break|continue|return|this)\\\\b/,\\n starts: {\\n contains: [\\n {\\n className: 'symbol',\\n begin: /@\\\\w+/\\n }\\n ]\\n }\\n };\\n const LABEL = {\\n className: 'symbol',\\n begin: hljs.UNDERSCORE_IDENT_RE + '@'\\n };\\n\\n // for string templates\\n const SUBST = {\\n className: 'subst',\\n begin: /\\\\$\\\\{/,\\n end: /\\\\}/,\\n contains: [ hljs.C_NUMBER_MODE ]\\n };\\n const VARIABLE = {\\n className: 'variable',\\n begin: '\\\\\\\\$' + hljs.UNDERSCORE_IDENT_RE\\n };\\n const STRING = {\\n className: 'string',\\n variants: [\\n {\\n begin: '\\\"\\\"\\\"',\\n end: '\\\"\\\"\\\"(?=[^\\\"])',\\n contains: [\\n VARIABLE,\\n SUBST\\n ]\\n },\\n // Can't use built-in modes easily, as we want to use STRING in the meta\\n // context as 'meta-string' and there's no syntax to remove explicitly set\\n // classNames in built-in modes.\\n {\\n begin: '\\\\'',\\n end: '\\\\'',\\n illegal: /\\\\n/,\\n contains: [ hljs.BACKSLASH_ESCAPE ]\\n },\\n {\\n begin: '\\\"',\\n end: '\\\"',\\n illegal: /\\\\n/,\\n contains: [\\n hljs.BACKSLASH_ESCAPE,\\n VARIABLE,\\n SUBST\\n ]\\n }\\n ]\\n };\\n SUBST.contains.push(STRING);\\n\\n const ANNOTATION_USE_SITE = {\\n className: 'meta',\\n begin: '@(?:file|property|field|get|set|receiver|param|setparam|delegate)\\\\\\\\s*:(?:\\\\\\\\s*' + hljs.UNDERSCORE_IDENT_RE + ')?'\\n };\\n const ANNOTATION = {\\n className: 'meta',\\n begin: '@' + hljs.UNDERSCORE_IDENT_RE,\\n contains: [\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [\\n hljs.inherit(STRING, {\\n className: 'meta-string'\\n })\\n ]\\n }\\n ]\\n };\\n\\n // https://kotlinlang.org/docs/reference/whatsnew11.html#underscores-in-numeric-literals\\n // According to the doc above, the number mode of kotlin is the same as java 8,\\n // so the code below is copied from java.js\\n const KOTLIN_NUMBER_MODE = NUMERIC;\\n const KOTLIN_NESTED_COMMENT = hljs.COMMENT(\\n '/\\\\\\\\*', '\\\\\\\\*/',\\n {\\n contains: [ hljs.C_BLOCK_COMMENT_MODE ]\\n }\\n );\\n const KOTLIN_PAREN_TYPE = {\\n variants: [\\n {\\n className: 'type',\\n begin: hljs.UNDERSCORE_IDENT_RE\\n },\\n {\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n contains: [] // defined later\\n }\\n ]\\n };\\n const KOTLIN_PAREN_TYPE2 = KOTLIN_PAREN_TYPE;\\n KOTLIN_PAREN_TYPE2.variants[1].contains = [ KOTLIN_PAREN_TYPE ];\\n KOTLIN_PAREN_TYPE.variants[1].contains = [ KOTLIN_PAREN_TYPE2 ];\\n\\n return {\\n name: 'Kotlin',\\n aliases: [ 'kt' ],\\n keywords: KEYWORDS,\\n contains: [\\n hljs.COMMENT(\\n '/\\\\\\\\*\\\\\\\\*',\\n '\\\\\\\\*/',\\n {\\n relevance: 0,\\n contains: [\\n {\\n className: 'doctag',\\n begin: '@[A-Za-z]+'\\n }\\n ]\\n }\\n ),\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n KEYWORDS_WITH_LABEL,\\n LABEL,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n {\\n className: 'function',\\n beginKeywords: 'fun',\\n end: '[(]|$',\\n returnBegin: true,\\n excludeEnd: true,\\n keywords: KEYWORDS,\\n relevance: 5,\\n contains: [\\n {\\n begin: hljs.UNDERSCORE_IDENT_RE + '\\\\\\\\s*\\\\\\\\(',\\n returnBegin: true,\\n relevance: 0,\\n contains: [ hljs.UNDERSCORE_TITLE_MODE ]\\n },\\n {\\n className: 'type',\\n begin: //,\\n keywords: 'reified',\\n relevance: 0\\n },\\n {\\n className: 'params',\\n begin: /\\\\(/,\\n end: /\\\\)/,\\n endsParent: true,\\n keywords: KEYWORDS,\\n relevance: 0,\\n contains: [\\n {\\n begin: /:/,\\n end: /[=,\\\\/]/,\\n endsWithParent: true,\\n contains: [\\n KOTLIN_PAREN_TYPE,\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT\\n ],\\n relevance: 0\\n },\\n hljs.C_LINE_COMMENT_MODE,\\n KOTLIN_NESTED_COMMENT,\\n ANNOTATION_USE_SITE,\\n ANNOTATION,\\n STRING,\\n hljs.C_NUMBER_MODE\\n ]\\n },\\n KOTLIN_NESTED_COMMENT\\n ]\\n },\\n {\\n className: 'class',\\n beginKeywords: 'class interface trait', // remove 'trait' when removed from KEYWORDS\\n end: /[:\\\\{(]|$/,\\n excludeEnd: true,\\n illegal: 'extends implements',\\n contains: [\\n {\\n beginKeywords: 'public protected internal private constructor'\\n },\\n hljs.UNDERSCORE_TITLE_MODE,\\n {\\n className: 'type',\\n begin: //,\\n excludeBegin: true,\\n excludeEnd: true,\\n relevance: 0\\n },\\n {\\n className: 'type',\\n begin: /[,:]\\\\s*/,\\n end: /[<\\\\(,]|$/,\\n excludeBegin: true,\\n returnEnd: true\\n },\\n ANNOTATION_USE_SITE,\\n ANNOTATION\\n ]\\n },\\n STRING,\\n {\\n className: 'meta',\\n begin: \\\"^#!/usr/bin/env\\\",\\n end: '$',\\n illegal: '\\\\n'\\n },\\n KOTLIN_NUMBER_MODE\\n ]\\n };\\n}\",\n \"function Surrogate(){}\",\n \"function Surrogate(){}\",\n \"function Surrogate(){}\",\n \"static serialize(obj, allowPrimitives, fallbackToJson, requireJsonType = false) {\\n if (allowPrimitives) {\\n if (typeof obj === \\\"string\\\") {\\n return this.serializePrimitive(obj, \\\"string\\\");\\n } else if (typeof obj === \\\"number\\\") {\\n return this.serializePrimitive(obj, \\\"double\\\");\\n } else if (Buffer.isBuffer(obj)) {\\n return this.serializePrimitive(obj, \\\"bytes\\\");\\n } else if (typeof obj === \\\"boolean\\\") {\\n return this.serializePrimitive(obj, \\\"bool\\\");\\n } else if (Long.isLong(obj)) {\\n return this.serializePrimitive(obj, \\\"int64\\\");\\n }\\n }\\n if (obj.constructor && typeof obj.constructor.encode === \\\"function\\\" && obj.constructor.$type) {\\n return Any.create({\\n // I have *no* idea why it's type_url and not typeUrl, but it is.\\n type_url: \\\"type.googleapis.com/\\\" + AnySupport.fullNameOf(obj.constructor.$type),\\n value: obj.constructor.encode(obj).finish()\\n });\\n } else if (fallbackToJson && typeof obj === \\\"object\\\") {\\n let type = obj.type;\\n if (type === undefined) {\\n if (requireJsonType) {\\n throw new Error(util.format(\\\"Fallback to JSON serialization supported, but object does not define a type property: %o\\\", obj));\\n } else {\\n type = \\\"object\\\";\\n }\\n }\\n return Any.create({\\n type_url: CloudStateJson + type,\\n value: this.serializePrimitiveValue(stableJsonStringify(obj), \\\"string\\\")\\n });\\n } else {\\n throw new Error(util.format(\\\"Object %o is not a protobuf object, and hence can't be dynamically \\\" +\\n \\\"serialized. Try passing the object to the protobuf classes create function.\\\", obj));\\n }\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.527866","0.52612406","0.51951283","0.518796","0.51302594","0.5044646","0.48934332","0.4857401","0.484017","0.48302925","0.482028","0.4812441","0.4808473","0.47852293","0.47828078","0.47574478","0.47493434","0.4739314","0.47239366","0.4703992","0.4703992","0.46990207","0.4690639","0.46904448","0.46862254","0.46716532","0.46667543","0.46522382","0.46354175","0.46053663","0.46017453","0.45926702","0.45891586","0.45877746","0.458541","0.45851982","0.45847243","0.4584686","0.458378","0.45767823","0.45753202","0.45753202","0.45753202","0.45713404","0.45637134","0.45637134","0.4557141","0.4557141","0.4557141","0.45494914","0.45366898","0.45342454","0.4533338","0.45322663","0.45229813","0.452288","0.452288","0.45159692","0.45102093","0.45099118","0.45062032","0.4506134","0.45033473","0.4502599","0.44998378","0.4497197","0.44843012","0.44764578","0.44738895","0.44715428","0.44715428","0.4471341","0.44594073","0.44552016","0.44538808","0.44522536","0.44464657","0.44464657","0.4443469","0.4443427","0.44433454","0.4437557","0.4436382","0.4430658","0.4429719","0.4428169","0.44260293","0.4420813","0.44155774","0.44130567","0.4406073","0.4401904","0.44010627","0.43994573","0.43948644","0.43847254","0.43847254","0.43830302","0.43830302","0.43830302","0.4381413"],"string":"[\n \"0.527866\",\n \"0.52612406\",\n \"0.51951283\",\n \"0.518796\",\n \"0.51302594\",\n \"0.5044646\",\n \"0.48934332\",\n \"0.4857401\",\n \"0.484017\",\n \"0.48302925\",\n \"0.482028\",\n \"0.4812441\",\n \"0.4808473\",\n \"0.47852293\",\n \"0.47828078\",\n \"0.47574478\",\n \"0.47493434\",\n \"0.4739314\",\n \"0.47239366\",\n \"0.4703992\",\n \"0.4703992\",\n \"0.46990207\",\n \"0.4690639\",\n \"0.46904448\",\n \"0.46862254\",\n \"0.46716532\",\n \"0.46667543\",\n \"0.46522382\",\n \"0.46354175\",\n \"0.46053663\",\n \"0.46017453\",\n \"0.45926702\",\n \"0.45891586\",\n \"0.45877746\",\n \"0.458541\",\n \"0.45851982\",\n \"0.45847243\",\n \"0.4584686\",\n \"0.458378\",\n \"0.45767823\",\n \"0.45753202\",\n \"0.45753202\",\n \"0.45753202\",\n \"0.45713404\",\n \"0.45637134\",\n \"0.45637134\",\n \"0.4557141\",\n \"0.4557141\",\n \"0.4557141\",\n \"0.45494914\",\n \"0.45366898\",\n \"0.45342454\",\n \"0.4533338\",\n \"0.45322663\",\n \"0.45229813\",\n \"0.452288\",\n \"0.452288\",\n \"0.45159692\",\n \"0.45102093\",\n \"0.45099118\",\n \"0.45062032\",\n \"0.4506134\",\n \"0.45033473\",\n \"0.4502599\",\n \"0.44998378\",\n \"0.4497197\",\n \"0.44843012\",\n \"0.44764578\",\n \"0.44738895\",\n \"0.44715428\",\n \"0.44715428\",\n \"0.4471341\",\n \"0.44594073\",\n \"0.44552016\",\n \"0.44538808\",\n \"0.44522536\",\n \"0.44464657\",\n \"0.44464657\",\n \"0.4443469\",\n \"0.4443427\",\n \"0.44433454\",\n \"0.4437557\",\n \"0.4436382\",\n \"0.4430658\",\n \"0.4429719\",\n \"0.4428169\",\n \"0.44260293\",\n \"0.4420813\",\n \"0.44155774\",\n \"0.44130567\",\n \"0.4406073\",\n \"0.4401904\",\n \"0.44010627\",\n \"0.43994573\",\n \"0.43948644\",\n \"0.43847254\",\n \"0.43847254\",\n \"0.43830302\",\n \"0.43830302\",\n \"0.43830302\",\n \"0.4381413\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80798,"cells":{"query":{"kind":"string","value":"if it's past the high water mark, we can push in some more. Also, if we have no data yet, we can stand some more bytes. This is to work around cases where hwm=0, such as the repl. Also, if the push() triggered a readable event, and the user called read(largeNumber) such that needReadable was set, then we ought to push more, so that another 'readable' event will be triggered."},"document":{"kind":"string","value":"function needMoreData(state) {\n return !state.ended && (state.needReadable || state.length < state.highWaterMark || state.length === 0);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function push(){if(pushes>PUSHCOUNT)return;if(pushes++===PUSHCOUNT){console.error(\" push(EOF)\");return r.push(null)}console.error(\" push #%d\",pushes);r.push(new Buffer(PUSHSIZE))&&setTimeout(push)}","tryPush() {\n\t\t// Get the total length of what would be pushed.\n\t\tconst amountToPush = Math.min(this.buffer.length, this.requestedSize);\n\n\t\t// Check if it's possible to push right now.\n\t\tif (this.canPush &&\n\t\t\tamountToPush > 0 &&\n\t\t\t(this.initialPass || this.finished || this.buffer.length >= this.initial)) {\n\t\t\tthis.initialPass = true;\n\n\t\t\t// Push the data.\n\t\t\tthis.requestedSize = -1;\n\t\t\tthis.canPush = this.push(Buffer.from(this.buffer.shift(amountToPush)));\n\t\t}\n\n\t\t// Append part of the waiting chunk if possible.\n\t\tif (this.waiting) {\n\t\t\tconst chunk = this.waiting.chunk;\n\t\t\tconst callback = this.waiting.callback;\n\n\t\t\t// Append the data to the buffer.\n\t\t\tconst toPush = Math.min(this.buffer.remaining, chunk.length);\n\t\t\tthis.buffer.push(chunk.slice(0, toPush));\n\n\t\t\t// Adjust the waiting chunk.\n\t\t\tthis.waiting.chunk = chunk.slice(toPush);\n\n\t\t\t// If the waiting chunk is gone, callback and reset.\n\t\t\tif (this.waiting.chunk.length == 0) {\n\t\t\t\tthis.waiting = null;\n\t\t\t\tcallback();\n\t\t\t}\n\n\t\t\t// Try pushing.\n\t\t\tif (toPush > 0) this.tryPush();\n\t\t}\n\t}","function needMoreData(state){return!state.ended&&(state.needReadable||state.length 0 && reader.readOffset < writer.writeOffset) {\n\t\t\t\tconst bytes = writer.bytes.slice(reader.readOffset, writer.writeOffset);\n\t\t\t\tthis.overflow.unshift(bytes);\n\t\t\t}\n\t\t}"],"string":"[\n \"function push(){if(pushes>PUSHCOUNT)return;if(pushes++===PUSHCOUNT){console.error(\\\" push(EOF)\\\");return r.push(null)}console.error(\\\" push #%d\\\",pushes);r.push(new Buffer(PUSHSIZE))&&setTimeout(push)}\",\n \"tryPush() {\\n\\t\\t// Get the total length of what would be pushed.\\n\\t\\tconst amountToPush = Math.min(this.buffer.length, this.requestedSize);\\n\\n\\t\\t// Check if it's possible to push right now.\\n\\t\\tif (this.canPush &&\\n\\t\\t\\tamountToPush > 0 &&\\n\\t\\t\\t(this.initialPass || this.finished || this.buffer.length >= this.initial)) {\\n\\t\\t\\tthis.initialPass = true;\\n\\n\\t\\t\\t// Push the data.\\n\\t\\t\\tthis.requestedSize = -1;\\n\\t\\t\\tthis.canPush = this.push(Buffer.from(this.buffer.shift(amountToPush)));\\n\\t\\t}\\n\\n\\t\\t// Append part of the waiting chunk if possible.\\n\\t\\tif (this.waiting) {\\n\\t\\t\\tconst chunk = this.waiting.chunk;\\n\\t\\t\\tconst callback = this.waiting.callback;\\n\\n\\t\\t\\t// Append the data to the buffer.\\n\\t\\t\\tconst toPush = Math.min(this.buffer.remaining, chunk.length);\\n\\t\\t\\tthis.buffer.push(chunk.slice(0, toPush));\\n\\n\\t\\t\\t// Adjust the waiting chunk.\\n\\t\\t\\tthis.waiting.chunk = chunk.slice(toPush);\\n\\n\\t\\t\\t// If the waiting chunk is gone, callback and reset.\\n\\t\\t\\tif (this.waiting.chunk.length == 0) {\\n\\t\\t\\t\\tthis.waiting = null;\\n\\t\\t\\t\\tcallback();\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Try pushing.\\n\\t\\t\\tif (toPush > 0) this.tryPush();\\n\\t\\t}\\n\\t}\",\n \"function needMoreData(state){return!state.ended&&(state.needReadable||state.length 0 && reader.readOffset < writer.writeOffset) {\\n\\t\\t\\t\\tconst bytes = writer.bytes.slice(reader.readOffset, writer.writeOffset);\\n\\t\\t\\t\\tthis.overflow.unshift(bytes);\\n\\t\\t\\t}\\n\\t\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.65658844","0.64052856","0.6392542","0.6380758","0.6350603","0.6350603","0.6241856","0.6212878","0.6170371","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.6164681","0.61635274","0.6123655","0.6123655","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61124796","0.61010766","0.60951054","0.60607934","0.60361964"],"string":"[\n \"0.65658844\",\n \"0.64052856\",\n \"0.6392542\",\n \"0.6380758\",\n \"0.6350603\",\n \"0.6350603\",\n \"0.6241856\",\n \"0.6212878\",\n \"0.6170371\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.6164681\",\n \"0.61635274\",\n \"0.6123655\",\n \"0.6123655\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61124796\",\n \"0.61010766\",\n \"0.60951054\",\n \"0.60607934\",\n \"0.60361964\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80799,"cells":{"query":{"kind":"string","value":"This function is designed to be inlinable, so please take care when making changes to the function body."},"document":{"kind":"string","value":"function howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private internal function m248() {}","private public function m246() {}","protected internal function m252() {}","transient protected internal function m189() {}","transient private protected internal function m182() {}","transient private internal function m185() {}","transient final protected internal function m174() {}","static private internal function m121() {}","static private protected internal function m118() {}","transient final private protected internal function m167() {}","static final private internal function m106() {}","transient private protected public internal function m181() {}","function StupidBug() {}","static transient final protected internal function m47() {}","static private protected public internal function m117() {}","static transient final private internal function m43() {}","static transient private protected internal function m55() {}","transient private public function m183() {}","function miFuncion (){}","static transient final protected public internal function m46() {}","static final private protected internal function m103() {}","transient final private internal function m170() {}","function fn() {\n\t\t }","function _____SHARED_functions_____(){}","transient final private protected public internal function m166() {}","static transient private protected public internal function m54() {}","static protected internal function m125() {}","static transient final private protected internal function m40() {}","function miFuncion(){}","function miFuncion(){}","function miFuncion(){}","static final private protected public internal function m102() {}","static transient final protected function m44() {}","function fuction() {\n\n}","function Scdr() {\r\n}","static transient private internal function m58() {}","static final private public function m104() {}","function TMP(){return;}","function TMP(){return;}","static transient private public function m56() {}","static transient final private public function m41() {}","static final protected internal function m110() {}","function normal() {}","function accessesingData2() {\n\n}","function accessesingData2() {\n\n}","static transient final private protected public internal function m39() {}","static private public function m119() {}","function dummy(){}","function dummy(){}","function dummy(){}","function oi(){}","function Expt() {\r\n}","function TMP() {\n return;\n }","function ea(){}","hacky(){\n return\n }","function fm(){}","function makeBigger() {\n\n}","transient final private public function m168() {}","static transient final private protected public function m38() {}","preorder() {\n throw new Error(\"This method hasn't been implemented yet!\");\n }","function main(){\n\n\n}","apply () {}","function reserved(){}","function lalalala() {\n\n}","function updateroster() {\n\n}","function fuctionPanier(){\n\n}","function Intialize() {\n return;\n}","function tempConvert(){\n \n}","function Efw() {\n}","function __func(){}","function StackFunctionSupport() {\r\n}","function dummyReturn(){\n}","function customHandling() { }","static transient protected internal function m62() {}","function redactInfo (obj) {\n \n}// CODE HERE","sinceFunction() {}","function Ha(){}","function dummy() {}","function dummy() {}","function dummy() {}","function wa(){}","function ba(){}","function ba(){}","function ba(){}","function ba(){}","function es1(params) {\n \n}","function Main()\n {\n \n }","function s(){}","function Yielder() {}","prepare() {}","function Macex() {\r\n}","function comportement (){\n\t }","function yst_overrideElemFunction() {\n\treturn;\n}","function startPoint()\n{\n\n}","function miFuncion(){\n\n}","function beetle_lvl4() {}","function sprinkles() {\n\n\t}","function FunctionUtils() {}","function Sread() {\r\n}","function Rebelizer() {\n\n}","function noop(){}// No operation performed."],"string":"[\n \"private internal function m248() {}\",\n \"private public function m246() {}\",\n \"protected internal function m252() {}\",\n \"transient protected internal function m189() {}\",\n \"transient private protected internal function m182() {}\",\n \"transient private internal function m185() {}\",\n \"transient final protected internal function m174() {}\",\n \"static private internal function m121() {}\",\n \"static private protected internal function m118() {}\",\n \"transient final private protected internal function m167() {}\",\n \"static final private internal function m106() {}\",\n \"transient private protected public internal function m181() {}\",\n \"function StupidBug() {}\",\n \"static transient final protected internal function m47() {}\",\n \"static private protected public internal function m117() {}\",\n \"static transient final private internal function m43() {}\",\n \"static transient private protected internal function m55() {}\",\n \"transient private public function m183() {}\",\n \"function miFuncion (){}\",\n \"static transient final protected public internal function m46() {}\",\n \"static final private protected internal function m103() {}\",\n \"transient final private internal function m170() {}\",\n \"function fn() {\\n\\t\\t }\",\n \"function _____SHARED_functions_____(){}\",\n \"transient final private protected public internal function m166() {}\",\n \"static transient private protected public internal function m54() {}\",\n \"static protected internal function m125() {}\",\n \"static transient final private protected internal function m40() {}\",\n \"function miFuncion(){}\",\n \"function miFuncion(){}\",\n \"function miFuncion(){}\",\n \"static final private protected public internal function m102() {}\",\n \"static transient final protected function m44() {}\",\n \"function fuction() {\\n\\n}\",\n \"function Scdr() {\\r\\n}\",\n \"static transient private internal function m58() {}\",\n \"static final private public function m104() {}\",\n \"function TMP(){return;}\",\n \"function TMP(){return;}\",\n \"static transient private public function m56() {}\",\n \"static transient final private public function m41() {}\",\n \"static final protected internal function m110() {}\",\n \"function normal() {}\",\n \"function accessesingData2() {\\n\\n}\",\n \"function accessesingData2() {\\n\\n}\",\n \"static transient final private protected public internal function m39() {}\",\n \"static private public function m119() {}\",\n \"function dummy(){}\",\n \"function dummy(){}\",\n \"function dummy(){}\",\n \"function oi(){}\",\n \"function Expt() {\\r\\n}\",\n \"function TMP() {\\n return;\\n }\",\n \"function ea(){}\",\n \"hacky(){\\n return\\n }\",\n \"function fm(){}\",\n \"function makeBigger() {\\n\\n}\",\n \"transient final private public function m168() {}\",\n \"static transient final private protected public function m38() {}\",\n \"preorder() {\\n throw new Error(\\\"This method hasn't been implemented yet!\\\");\\n }\",\n \"function main(){\\n\\n\\n}\",\n \"apply () {}\",\n \"function reserved(){}\",\n \"function lalalala() {\\n\\n}\",\n \"function updateroster() {\\n\\n}\",\n \"function fuctionPanier(){\\n\\n}\",\n \"function Intialize() {\\n return;\\n}\",\n \"function tempConvert(){\\n \\n}\",\n \"function Efw() {\\n}\",\n \"function __func(){}\",\n \"function StackFunctionSupport() {\\r\\n}\",\n \"function dummyReturn(){\\n}\",\n \"function customHandling() { }\",\n \"static transient protected internal function m62() {}\",\n \"function redactInfo (obj) {\\n \\n}// CODE HERE\",\n \"sinceFunction() {}\",\n \"function Ha(){}\",\n \"function dummy() {}\",\n \"function dummy() {}\",\n \"function dummy() {}\",\n \"function wa(){}\",\n \"function ba(){}\",\n \"function ba(){}\",\n \"function ba(){}\",\n \"function ba(){}\",\n \"function es1(params) {\\n \\n}\",\n \"function Main()\\n {\\n \\n }\",\n \"function s(){}\",\n \"function Yielder() {}\",\n \"prepare() {}\",\n \"function Macex() {\\r\\n}\",\n \"function comportement (){\\n\\t }\",\n \"function yst_overrideElemFunction() {\\n\\treturn;\\n}\",\n \"function startPoint()\\n{\\n\\n}\",\n \"function miFuncion(){\\n\\n}\",\n \"function beetle_lvl4() {}\",\n \"function sprinkles() {\\n\\n\\t}\",\n \"function FunctionUtils() {}\",\n \"function Sread() {\\r\\n}\",\n \"function Rebelizer() {\\n\\n}\",\n \"function noop(){}// No operation performed.\"\n]"},"negative_scores":{"kind":"list like","value":["0.6834781","0.67074317","0.6685873","0.6599575","0.6528078","0.6306303","0.63039434","0.62592036","0.6209561","0.612205","0.6071775","0.59868515","0.59800345","0.590985","0.5897201","0.58810145","0.5879038","0.57503766","0.572729","0.5717947","0.57138914","0.57042855","0.5703867","0.5694151","0.5686834","0.568582","0.5641935","0.56288594","0.5587808","0.5587808","0.5587808","0.55543095","0.5466298","0.5453683","0.5448801","0.54374784","0.5404681","0.53649175","0.53649175","0.5363937","0.53297824","0.5317933","0.52905476","0.52807754","0.52807754","0.52757865","0.5268943","0.5263605","0.5263605","0.5263605","0.52603436","0.52543753","0.5235096","0.52277523","0.52156323","0.5188561","0.5188098","0.5184612","0.51811624","0.5173923","0.5160381","0.516014","0.515129","0.5148374","0.5144869","0.5131615","0.5130324","0.51302814","0.51176786","0.5112052","0.51012963","0.5093534","0.5092389","0.5090806","0.5087576","0.5058577","0.50491154","0.5038768","0.5038768","0.5038768","0.5036851","0.50352824","0.50352824","0.50352824","0.50352824","0.50332475","0.5030561","0.5027701","0.50201863","0.5013752","0.50090057","0.50024545","0.5000754","0.49940035","0.49922147","0.49850562","0.4967037","0.49650136","0.49564183","0.49471217","0.4940361"],"string":"[\n \"0.6834781\",\n \"0.67074317\",\n \"0.6685873\",\n \"0.6599575\",\n \"0.6528078\",\n \"0.6306303\",\n \"0.63039434\",\n \"0.62592036\",\n \"0.6209561\",\n \"0.612205\",\n \"0.6071775\",\n \"0.59868515\",\n \"0.59800345\",\n \"0.590985\",\n \"0.5897201\",\n \"0.58810145\",\n \"0.5879038\",\n \"0.57503766\",\n \"0.572729\",\n \"0.5717947\",\n \"0.57138914\",\n \"0.57042855\",\n \"0.5703867\",\n \"0.5694151\",\n \"0.5686834\",\n \"0.568582\",\n \"0.5641935\",\n \"0.56288594\",\n \"0.5587808\",\n \"0.5587808\",\n \"0.5587808\",\n \"0.55543095\",\n \"0.5466298\",\n \"0.5453683\",\n \"0.5448801\",\n \"0.54374784\",\n \"0.5404681\",\n \"0.53649175\",\n \"0.53649175\",\n \"0.5363937\",\n \"0.53297824\",\n \"0.5317933\",\n \"0.52905476\",\n \"0.52807754\",\n \"0.52807754\",\n \"0.52757865\",\n \"0.5268943\",\n \"0.5263605\",\n \"0.5263605\",\n \"0.5263605\",\n \"0.52603436\",\n \"0.52543753\",\n \"0.5235096\",\n \"0.52277523\",\n \"0.52156323\",\n \"0.5188561\",\n \"0.5188098\",\n \"0.5184612\",\n \"0.51811624\",\n \"0.5173923\",\n \"0.5160381\",\n \"0.516014\",\n \"0.515129\",\n \"0.5148374\",\n \"0.5144869\",\n \"0.5131615\",\n \"0.5130324\",\n \"0.51302814\",\n \"0.51176786\",\n \"0.5112052\",\n \"0.51012963\",\n \"0.5093534\",\n \"0.5092389\",\n \"0.5090806\",\n \"0.5087576\",\n \"0.5058577\",\n \"0.50491154\",\n \"0.5038768\",\n \"0.5038768\",\n \"0.5038768\",\n \"0.5036851\",\n \"0.50352824\",\n \"0.50352824\",\n \"0.50352824\",\n \"0.50352824\",\n \"0.50332475\",\n \"0.5030561\",\n \"0.5027701\",\n \"0.50201863\",\n \"0.5013752\",\n \"0.50090057\",\n \"0.50024545\",\n \"0.5000754\",\n \"0.49940035\",\n \"0.49922147\",\n \"0.49850562\",\n \"0.4967037\",\n \"0.49650136\",\n \"0.49564183\",\n \"0.49471217\",\n \"0.4940361\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":807,"numItemsPerPage":100,"numTotalItems":82052,"offset":80700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc0NzM1MTYxMCwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhc2NyaXB0LXYxIiwiZXhwIjoxNzQ3MzU1MjEwLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.gbIMRe6eVo1kJkF-623ycLAZwBoyeZyf9KSXAjVBqZkeyTnZ-B7k5fEF9evE9R7YX-qdxIkI26JsglI2dcoABw","displayUrls":true},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
\");\n// var delayLine = new Array;\n// var pointer = 0;\n// var delayLength = oneSecond / 2;\n// for (var ijj = 0; ijj < groove.lineLength; ijj++){\n//\t\tdelayLine[ijj] = 0;\n// }\n for (var repeat = 1 ; repeat < repeats; repeat++){\n for (var jj = 0 ; jj < ii ; jj++){\n samples[jj + ii * repeat] = samples[jj];\n\t if (delay){\n//\t\tsamples[jj + ii * repeat] = samples[jj + ii * repeat] - 0.5*delayLine[pointer];\n//\t\tdelayLine[pointer] = samples[jj + ii * repeat];\n//\t\tpointer = (pointer+1)%lineLength;\n }\n\t }\n\t}\n return samples;\n}","function addEqualiser() {\n\n var gainDb = -40.0; // atenuation When it takes a positive value it is a real gain, when negative it is an attenuation. It is expressed in dB, has a default value of 0 and can take a value in a nominal range of -40 to 40.\n var bandSplit = [360, 3600];\n context_player = new AudioContext();\n\n for (var i = 0; i < 2; i++) {\n\n mediaElement_player.push(null);\n sourceNode_player.push(null);\n source_player.push(null);\n lGain_player.push(null);\n mGain_player.push(null);\n hGain_player.push(null);\n sum_player.push(null);\n volumeNodes.push(null);\n\n\n mediaElement_player[i] = document.getElementById('jp_audio_' + i);\n source_player[i] = context_player.createMediaElementSource(mediaElement_player[i]);\n\n initFrequencyQuality(i);\n\n // affects the ammount of treble in a sound - treble knob - atenuates the sounds below the 3600 frequencies\n var lBand_player = context_player.createBiquadFilter();\n lBand_player.type = \"lowshelf\";\n lBand_player.frequency.value = bandSplit[1];\n lBand_player.gain.value = gainDb;\n\n // affects the ammount of bass in a sound - bass knob - atenuates the sounds higher than 360 frequencies\n var hBand_player = context_player.createBiquadFilter();\n hBand_player.type = \"highshelf\";\n hBand_player.frequency.value = bandSplit[0];\n hBand_player.gain.value = gainDb;\n\n var hInvert_player = context_player.createGain();\n hInvert_player.gain.value = -1.0;\n\n //Subtract low and high frequencies (add invert) from the source for the mid frequencies\n var mBand_player = context_player.createGain();\n\n //or use picking\n //mBand_player = context_player.createBiquadFilter();\n //mBand_player.type = \"peaking\";\n //mBand_player.frequency.value = bandSplit[0];\n //mBand_player.gain.value = gainDb;\n\n var lInvert_player = context_player.createGain();\n lInvert_player.gain.value = -1.0;\n\n sourceNode_player[i].connect(lBand_player);\n sourceNode_player[i].connect(mBand_player);\n sourceNode_player[i].connect(hBand_player);\n\n hBand_player.connect(hInvert_player);\n lBand_player.connect(lInvert_player);\n\n hInvert_player.connect(mBand_player);\n lInvert_player.connect(mBand_player);\n\n\n lGain_player[i] = context_player.createGain();\n mGain_player[i] = context_player.createGain();\n hGain_player[i] = context_player.createGain();\n\n lBand_player.connect(lGain_player[i]);\n mBand_player.connect(mGain_player[i]);\n hBand_player.connect(hGain_player[i]);\n\n sum_player[i] = context_player.createGain();\n lGain_player[i].connect(sum_player[i]);\n mGain_player[i].connect(sum_player[i]);\n hGain_player[i].connect(sum_player[i]);\n\n lGain_player[i].gain.value = 1;\n mGain_player[i].gain.value = 1;\n hGain_player[i].gain.value = 1;\n\n volumeNodes[i] = context_player.createGain();\n sum_player[i].connect(volumeNodes[i]);\n volumeNodes[i].connect(context_player.destination);\n }\n\n //set volume\n var x = 50 / 100;\n // Use an equal-power crossfading curve:\n var gain1 = Math.cos(x * 0.5 * Math.PI);\n var gain2 = Math.cos((1.0 - x) * 0.5 * Math.PI);\n volumeNodes[0].gain.value = gain1;\n volumeNodes[1].gain.value = gain2;\n\n //create audio Recording node\n audioRecordNode = context_player.createGain();\n volumeNodes[0].connect(audioRecordNode);\n volumeNodes[1].connect(audioRecordNode);\n audioRecorder = new Recorder(audioRecordNode);\n}","function sha1_ft(t, b, c, d) {\n if (t < 20) return (b & c) | ((~b) & d);\n if (t < 40) return b ^ c ^ d;\n if (t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function adapt(delta,numPoints,firstTime){var k=0;delta=firstTime?floor(delta/damp):delta>>1;delta+=floor(delta/numPoints);for(;delta>baseMinusTMin*tMax>>1;k+=base){delta=floor(delta/baseMinusTMin)}return floor(k+(baseMinusTMin+1)*delta/(delta+skew))}","function setupAudioNodes(audioContext, drawWaveformFunction, drawSpectrumFunction, drawSpectrogramFunction, htmlIds, colorScale)\n{\n // Setup a script node\n let scriptNode = audioContext.createScriptProcessor();\n // Connect to destination\n scriptNode.connect(audioContext.destination);\n \n // Setup an analyzer\n let analyser = audioContext.createAnalyser();\n analyser.smoothingTimeConstant = 0;\n // Higher FFT size means more bins. More bins mean more points to graph.\n // Also means each bin has a smaller range of frequencies so it's kind of like more precise.\n analyser.fftSize = 2048 * 2;\n \n // Create a buffer source node\n let sourceNode = audioContext.createBufferSource();\n sourceNode.connect(analyser);\n analyser.connect(scriptNode);\n \n sourceNode.connect(audioContext.destination);\n \n console.log(\"Sample rate: \" + audioContext.sampleRate + \" Hz\");\n console.log(\"FFT size: \" + analyser.fftSize);\n // FrequencyBinCount is half of FFT size\n console.log(\"FrequencyBinCount: \" + analyser.frequencyBinCount);\n \n let frequencyPerBin = (audioContext.sampleRate / 2) / analyser.frequencyBinCount;\n console.log(\"Each frequency bin represents \" + frequencyPerBin + \" Hz of range\");\n console.log(\"frequencyData[0]\" + \" is the strength of frequencies from \" + (0 * frequencyPerBin) + \" Hz to \" + ((0 + 1)*frequencyPerBin) + \" Hz\");\n console.log(\"frequencyData[1]\" + \" is the strength of frequencies from \" + (1 * frequencyPerBin) + \" Hz to \" + ((1 + 1)*frequencyPerBin) + \" Hz\");\n console.log(\"frequencyData[2]\" + \" is the strength of frequencies from \" + (2 * frequencyPerBin) + \" Hz to \" + ((2 + 1)*frequencyPerBin) + \" Hz\");\n console.log(\"frequencyData[\" + (analyser.frequencyBinCount - 1) + \"]\" + \" is the strength of frequencies from \" + (analyser.frequencyBinCount - 1) * frequencyPerBin + \" Hz to \" + (((analyser.frequencyBinCount - 1) + 1) * frequencyPerBin) + \" Hz\");\n \n // When the script node is called we use information from the analyzer node to draw\n scriptNode.onaudioprocess = function()\n {\n let frequencyData = new Uint8Array(analyser.frequencyBinCount);\n analyser.getByteFrequencyData(frequencyData);\n \n let timeDomainData = new Uint8Array(analyser.frequencyBinCount);\n analyser.getByteTimeDomainData(timeDomainData);\n \n if (sourceNode.buffer !== null)\n {\n //console.log(frequencyData);\n //console.log(timeDomainData);\n drawWaveformFunction(timeDomainData, htmlIds.waveformCanvas, colorScale);\n drawSpectrumFunction(frequencyData, htmlIds.spectrumCanvas, colorScale);\n drawSpectrogramFunction(frequencyData, htmlIds.spectrogramCanvas, colorScale);\n }\n }\n \n return sourceNode;\n}","function draw(data)\n{\n var spectrum = []; // an array that will hold noise cancelled data\n var i, x, L=0, ldata=0, nBins=0, binNum=0, c=0; // uint8\n var minLvl, maxLvl; //uint\n var level, y, sum; //int\n var offsetIndex = 0;\n var FFT_N = 128; //data.length;\n\n samplePos = 0;\n // Remove noise and apply EQ levels\n for(x=0; x < FFT_N/2; x++ ) {\n L = noise[x];\n spectrum[x] = data[x+ offsetIndex];\n if ( spectrum[x] < L ) {\n spectrum[x] = 0;\n } else {\n spectrum[x] = ((spectrum[x] - L) * (256 - eq[x] >> peakHeight));\n }\n }\n //fill colors first, then we will erase idle sections.\n for(i=0; i < totalColumns; i++) {\n client.setPixelColor(i, LED_RED); // row 0, RED\n client.setPixelColor(8 + i, LED_BLUE); // Rwo 1, Blue\n client.setPixelColor(16+ i, LED_BLUE); // Row 2, Blue\n client.setPixelColor(24+ i, LED_GREEN); // Row 3, Green\n client.setPixelColor(32+ i, LED_GREEN); // Row 4, Green\n }\n\n for(x=0; x < totalColumns; x++ ) {\n ldata = colData[x];\n nBins = ldata[0] + 2;\n binNum = ldata[1];\n for(sum=0, i=2; i < nBins; i++ ) {\n sum += spectrum[binNum++] * ldata[i]; // Weighted\n colDiv[x] += data[x];\n }\n col[x][colCount] = sum / colDiv[x]; // Average\n minLvl = maxLvl = col[x][0];\n for(i=1; i < totalFrames; i++ ) {\n if(col[x][i] < minLvl) {\n minLvl = col[x][i];\n } else if( col[x][i] > maxLvl ) {\n maxLvl = col[x][i];\n }\n }\n // minLvl and maxLvl indicate the extents of the FFT output, used\n // for vertically scaling the output graph (so it looks interesting\n // regardless of volume level). If they're too close together though\n // (e.g. at very low volume levels) the graph becomes super coarse\n // and 'jumpy'...so keep some minimum distance between them (this\n // also lets the graph go to zero when no sound is playing):\n\n if( maxLvl-minLvl < peakHeight) {\n maxLvl = minLvl + peakHeight;\n }\n minLvAvg[x] = (minLvAvg[x] * 7 + minLvl) >> 3; // Dampen min/max levels\n maxLvAvg[x] = (maxLvAvg[x] * 7 + maxLvl) >> 3; // fake rolling average\n // Second fixed-point scale based on dynamic min/max levels\n level = 10 * (col[x][colCount] - minLvAvg[x]) / parseInt(maxLvAvg[x] - minLvAvg[x]);\n // clip output and convert to byte\n if( level < 0) { c = 0; }\n else if ( level > peakOffTop ) { c = peakOffTop; } // Allow dot to go a few pixels off the top\n else { c = parseInt(level); }\n\n if( c > peak[x] ) { peak[x] = c; } // keep dot on top\n if(peak[x] < 0 ) { // empty the column\n clearColumnLeds(x,peakHeight);\n //continue;\n } else if(c < peakHeight ) { // empty partial column\n clearColumnLeds(x, peakHeight - c);\n }\n // the peak dot color varies but doesn't necessarily match\n // the three screen regions.. yellow has a little more influence.\n y = peakHeight - peak[x];\n\n /******************** DO NOT DELETE **********************/\n /* Save this section for a high Peak Array of LEDs - It is not so useful for 5 pixel High\n if( y < 1 ) { setColumnRowPixelColor(x,y, LED_RED); }\n else if( y < 5 ) { setColumnRowPixelColor(x,y, LED_BLUE); }\n else { setColumnRowPixelColor(x,y, LED_GREEN); }\n */\n /******************** DO NOT DELETE **********************/\n\n }\n client.writePixels();\n\n /******************** Important **************************/\n // Every third frame, make the peak pixels drop by 1:\n if ( ++dotCount >= 3 ) {\n dotCount = 0;\n // reset Averages, col dividers and peaks\n for ( i = 0; i < totalColumns; i++ ) {\n minLvAvg[i] = 0;\n maxLvAvg[i] = 512;\n colDiv[i] = 0;\n //peak[i] = 0; // We are dropping the peaks below\n }\n for ( x = 0; x < peakHeight; x++ ) {\n peak[x] -= (peak[x] > 0) ? 1 : 0; // if peak is above 0, then subtract 1\n }\n // rotate hue over LEDs\n LED_RED = OPC.rotateColor(1, LED_RED);\n LED_BLUE = OPC.rotateColor(1, LED_BLUE);\n LED_GREEN = OPC.rotateColor(1, LED_GREEN);\n }\n // Adjust the Frame Count\n if ( ++colCount >= totalFrames ) {\n colCount = 0;\n }\n\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}","function sha1_ft(t, b, c, d)\n{\n if(t < 20) return (b & c) | ((~b) & d);\n if(t < 40) return b ^ c ^ d;\n if(t < 60) return (b & c) | (b & d) | (c & d);\n return b ^ c ^ d;\n}"],"string":"[\n \"function FFTNayuki(n) {\\n \\n this.n = n;\\n this.levels = -1;\\n\\n for (var i = 0; i < 32; i++) {\\n if (1 << i == n) {\\n this.levels = i; // Equal to log2(n)\\n }\\n }\\n if (this.levels == -1) {\\n throw \\\"Length is not a power of 2\\\";\\n }\\n\\n this.cosTable = new Array(n / 2);\\n this.sinTable = new Array(n / 2);\\n for (var i = 0; i < n / 2; i++) {\\n this.cosTable[i] = Math.cos(2 * Math.PI * i / n);\\n this.sinTable[i] = Math.sin(2 * Math.PI * i / n);\\n }\\n\\n /* \\n * Computes the discrete Fourier transform (DFT) of the given complex vector, storing the result back into the vector.\\n * The vector's length must be equal to the size n that was passed to the object constructor, and this must be a power of 2. Uses the Cooley-Tukey decimation-in-time radix-2 algorithm.\\n */\\n this.forward = function(real, imag) {\\n\\n var n = this.n;\\n \\n // Bit-reversed addressing permutation\\n for (var i = 0; i < n; i++) {\\n var j = reverseBits(i, this.levels);\\n if (j > i) {\\n var temp = real[i];\\n real[i] = real[j];\\n real[j] = temp;\\n temp = imag[i];\\n imag[i] = imag[j];\\n imag[j] = temp;\\n }\\n }\\n \\n // Cooley-Tukey decimation-in-time radix-2 FFT\\n for (var size = 2; size <= n; size *= 2) {\\n var halfsize = size / 2;\\n var tablestep = n / size;\\n for (var i = 0; i < n; i += size) {\\n for (var j = i, k = 0; j < i + halfsize; j++, k += tablestep) {\\n var tpre = real[j+halfsize] * this.cosTable[k] +\\n imag[j+halfsize] * this.sinTable[k];\\n var tpim = -real[j+halfsize] * this.sinTable[k] +\\n imag[j+halfsize] * this.cosTable[k];\\n real[j + halfsize] = real[j] - tpre;\\n imag[j + halfsize] = imag[j] - tpim;\\n real[j] += tpre;\\n imag[j] += tpim;\\n }\\n }\\n }\\n \\n // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\\n function reverseBits(x, bits) {\\n var y = 0;\\n for (var i = 0; i < bits; i++) {\\n y = (y << 1) | (x & 1);\\n x >>>= 1;\\n }\\n return y;\\n }\\n }\\n\\n /* \\n * Computes the inverse discrete Fourier transform (IDFT) of the given complex vector, storing the result back into the vector.\\n * The vector's length must be equal to the size n that was passed to the object constructor, and this must be a power of 2. This is a wrapper function. This transform does not perform scaling, so the inverse is not a true inverse.\\n */\\n this.inverse = function(real, imag) {\\n forward(imag, real);\\n }\\n}\",\n \"function realFft(input, output) {\\n\\n var n = input.length,\\n x = output, \\n TWO_PI = 2*Math.PI,\\n sqrt = Math.sqrt,\\n n2, n4, n8, nn, \\n t1, t2, t3, t4, \\n i1, i2, i3, i4, i5, i6, i7, i8, \\n st1, cc1, ss1, cc3, ss3,\\n e, \\n a,\\n rval, ival, mag; \\n\\n _reverseBinPermute(output, input);\\n\\n for (var ix = 0, id = 4; ix < n; id *= 4) {\\n for (var i0 = ix; i0 < n; i0 += id) {\\n //sumdiff(x[i0], x[i0+1]); // {a, b} <--| {a+b, a-b}\\n st1 = x[i0] - x[i0+1];\\n x[i0] += x[i0+1];\\n x[i0+1] = st1;\\n } \\n ix = 2*(id-1);\\n }\\n\\n n2 = 2;\\n nn = n >>> 1;\\n\\n while((nn = nn >>> 1)) {\\n ix = 0;\\n n2 = n2 << 1;\\n id = n2 << 1;\\n n4 = n2 >>> 2;\\n n8 = n2 >>> 3;\\n do {\\n if(n4 !== 1) {\\n for(i0 = ix; i0 < n; i0 += id) {\\n i1 = i0;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n \\n //diffsum3_r(x[i3], x[i4], t1); // {a, b, s} <--| {a, b-a, a+b}\\n t1 = x[i3] + x[i4];\\n x[i4] -= x[i3];\\n //sumdiff3(x[i1], t1, x[i3]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i3] = x[i1] - t1; \\n x[i1] += t1;\\n \\n i1 += n8;\\n i2 += n8;\\n i3 += n8;\\n i4 += n8;\\n \\n //sumdiff(x[i3], x[i4], t1, t2); // {s, d} <--| {a+b, a-b}\\n t1 = x[i3] + x[i4];\\n t2 = x[i3] - x[i4];\\n \\n t1 = -t1 * Math.SQRT1_2;\\n t2 *= Math.SQRT1_2;\\n \\n // sumdiff(t1, x[i2], x[i4], x[i3]); // {s, d} <--| {a+b, a-b}\\n st1 = x[i2];\\n x[i4] = t1 + st1; \\n x[i3] = t1 - st1;\\n \\n //sumdiff3(x[i1], t2, x[i2]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i2] = x[i1] - t2;\\n x[i1] += t2;\\n }\\n } else {\\n for(i0 = ix; i0 < n; i0 += id) {\\n i1 = i0;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n \\n //diffsum3_r(x[i3], x[i4], t1); // {a, b, s} <--| {a, b-a, a+b}\\n t1 = x[i3] + x[i4]; \\n x[i4] -= x[i3];\\n \\n //sumdiff3(x[i1], t1, x[i3]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i3] = x[i1] - t1; \\n x[i1] += t1;\\n }\\n }\\n \\n ix = (id << 1) - n2;\\n id = id << 2;\\n } while (ix < n);\\n \\n e = TWO_PI / n2;\\n\\n for (var j = 1; j < n8; j++) {\\n a = j * e;\\n ss1 = Math.sin(a);\\n cc1 = Math.cos(a);\\n\\n //ss3 = sin(3*a); cc3 = cos(3*a);\\n cc3 = 4*cc1*(cc1*cc1-0.75);\\n ss3 = 4*ss1*(0.75-ss1*ss1);\\n \\n ix = 0; id = n2 << 1;\\n do {\\n for (i0 = ix; i0 < n; i0 += id) {\\n i1 = i0 + j;\\n i2 = i1 + n4;\\n i3 = i2 + n4;\\n i4 = i3 + n4;\\n \\n i5 = i0 + n4 - j;\\n i6 = i5 + n4;\\n i7 = i6 + n4;\\n i8 = i7 + n4;\\n \\n //cmult(c, s, x, y, &u, &v)\\n //cmult(cc1, ss1, x[i7], x[i3], t2, t1); // {u,v} <--| {x*c-y*s, x*s+y*c}\\n t2 = x[i7]*cc1 - x[i3]*ss1; \\n t1 = x[i7]*ss1 + x[i3]*cc1;\\n \\n //cmult(cc3, ss3, x[i8], x[i4], t4, t3);\\n t4 = x[i8]*cc3 - x[i4]*ss3; \\n t3 = x[i8]*ss3 + x[i4]*cc3;\\n \\n //sumdiff(t2, t4); // {a, b} <--| {a+b, a-b}\\n st1 = t2 - t4;\\n t2 += t4;\\n t4 = st1;\\n \\n //sumdiff(t2, x[i6], x[i8], x[i3]); // {s, d} <--| {a+b, a-b}\\n //st1 = x[i6]; x[i8] = t2 + st1; x[i3] = t2 - st1;\\n x[i8] = t2 + x[i6]; \\n x[i3] = t2 - x[i6];\\n \\n //sumdiff_r(t1, t3); // {a, b} <--| {a+b, b-a}\\n st1 = t3 - t1;\\n t1 += t3;\\n t3 = st1;\\n \\n //sumdiff(t3, x[i2], x[i4], x[i7]); // {s, d} <--| {a+b, a-b}\\n //st1 = x[i2]; x[i4] = t3 + st1; x[i7] = t3 - st1;\\n x[i4] = t3 + x[i2]; \\n x[i7] = t3 - x[i2];\\n \\n //sumdiff3(x[i1], t1, x[i6]); // {a, b, d} <--| {a+b, b, a-b}\\n x[i6] = x[i1] - t1; \\n x[i1] += t1;\\n \\n //diffsum3_r(t4, x[i5], x[i2]); // {a, b, s} <--| {a, b-a, a+b}\\n x[i2] = t4 + x[i5]; \\n x[i5] -= t4;\\n }\\n \\n ix = (id << 1) - n2;\\n id = id << 2;\\n \\n } while (ix < n);\\n }\\n }\\n \\n /* Scale output to have same norm as input. */\\n var f = 1 / sqrt(n);\\n for (var i = 0; i < n; i++)\\n\\t x[i] *= f;\\n\\n}\",\n \"function FFT$1(){var _n=0,// order\\n_bitrev=null,// bit reversal table\\n_cstb=null;// sin/cos table\\nvar _tre,_tim;this.init=function(n){if(n!==0&&(n&n-1)===0){_n=n;_setVariables();_makeBitReversal();_makeCosSinTable();}else{throw new Error('init: radix-2 required');}};// 1D-FFT\\nthis.fft1d=function(re,im){fft(re,im,1);};// 1D-IFFT\\nthis.ifft1d=function(re,im){var n=1/_n;fft(re,im,-1);for(var i=0;i<_n;i++){re[i]*=n;im[i]*=n;}};// 2D-FFT\\nthis.fft2d=function(re,im){var i=0;// x-axis\\nfor(var y=0;y<_n;y++){i=y*_n;for(var x1=0;x1<_n;x1++){_tre[x1]=re[x1+i];_tim[x1]=im[x1+i];}this.fft1d(_tre,_tim);for(var x2=0;x2<_n;x2++){re[x2+i]=_tre[x2];im[x2+i]=_tim[x2];}}// y-axis\\nfor(var x=0;x<_n;x++){for(var y1=0;y1<_n;y1++){i=x+y1*_n;_tre[y1]=re[i];_tim[y1]=im[i];}this.fft1d(_tre,_tim);for(var y2=0;y2<_n;y2++){i=x+y2*_n;re[i]=_tre[y2];im[i]=_tim[y2];}}};// 2D-IFFT\\nthis.ifft2d=function(re,im){var i=0;// x-axis\\nfor(var y=0;y<_n;y++){i=y*_n;for(var x1=0;x1<_n;x1++){_tre[x1]=re[x1+i];_tim[x1]=im[x1+i];}this.ifft1d(_tre,_tim);for(var x2=0;x2<_n;x2++){re[x2+i]=_tre[x2];im[x2+i]=_tim[x2];}}// y-axis\\nfor(var x=0;x<_n;x++){for(var y1=0;y1<_n;y1++){i=x+y1*_n;_tre[y1]=re[i];_tim[y1]=im[i];}this.ifft1d(_tre,_tim);for(var y2=0;y2<_n;y2++){i=x+y2*_n;re[i]=_tre[y2];im[i]=_tim[y2];}}};// 2D-IFFT, real-valued\\n// only outputs the real valued part\\nthis.real_ifft2d=function(re,im){var i2;var i=0;// x-axis\\nfor(var y=0;y<_n;y++){i=y*_n;for(var x1=0;x1<_n;x1++){_tre[x1]=re[x1+i];_tim[x1]=im[x1+i];}this.ifft1d(_tre,_tim);for(var x2=0;x2<_n;x2++){re[x2+i]=_tre[x2];im[x2+i]=_tim[x2];}}// y-axis\\nvar halfn=_n/2;var rowIdx=0;for(var x=0;x<_n;x+=2){//untangle\\ni=x;i2=x+1;_tre[0]=re[0+i];_tim[0]=re[0+i2];_tre[_n/2]=re[halfn*_n+i];_tim[_n/2]=re[halfn*_n+i2];for(var x2=1;x2
\\\" + scanrate + \\\"Hz\\\" \\n + \\\"
\\\" + \\\"It means your keyboard refreshes every \\\" + mean + \\\"ms\\\" \\n + \\\"
\\\" + \\\"The computing approach is to look in to the pressing time that your keyboard is able to recognize. More data lies around specific time points, the interval of them is right the refreshing period of your keyboard.\\\";\\n }\",\n \"function fftRadix2(realVals, imagVals, size, inverse, cpuBackend) {\\n if (size === 1) {\\n return { real: realVals, imag: imagVals };\\n }\\n const data = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].mergeRealAndImagArrays(realVals, imagVals);\\n const half = size / 2;\\n const evenComplex = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].complexWithEvenIndex(data);\\n const evenRealVals = evenComplex.real;\\n const evenImagVals = evenComplex.imag;\\n const evenShape = [evenRealVals.length];\\n const evenRealInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenRealVals);\\n const evenImagInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenImagVals);\\n const evenTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: evenRealInfo, imag: evenImagInfo }, backend: cpuBackend });\\n const oddComplex = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].complexWithOddIndex(data);\\n const oddRealVals = oddComplex.real;\\n const oddImagVals = oddComplex.imag;\\n const oddShape = [oddRealVals.length];\\n const oddRealInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddRealVals);\\n const oddImagInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddImagVals);\\n const oddTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: oddRealInfo, imag: oddImagInfo }, backend: cpuBackend });\\n // Recursive call for half part of original input.\\n const $evenComplex = fftRadix2(evenRealVals, evenImagVals, half, inverse, cpuBackend);\\n const $evenRealVals = $evenComplex.real;\\n const $evenImagVals = $evenComplex.imag;\\n const $evenShape = [$evenRealVals.length];\\n const $evenRealInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenRealVals);\\n const $evenImagInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenImagVals);\\n const $evenTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({\\n inputs: { real: $evenRealInfo, imag: $evenImagInfo },\\n backend: cpuBackend\\n });\\n const $oddComplex = fftRadix2(oddRealVals, oddImagVals, half, inverse, cpuBackend);\\n const $oddRealVals = $oddComplex.real;\\n const $oddImagVals = $oddComplex.imag;\\n const $oddShape = [$oddRealVals.length];\\n const $oddRealInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddRealVals);\\n const $oddImagInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddImagVals);\\n const $oddTensorInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: $oddRealInfo, imag: $oddImagInfo }, backend: cpuBackend });\\n const e = _tensorflow_tfjs_core__WEBPACK_IMPORTED_MODULE_0__[\\\"backend_util\\\"].exponents(size, inverse);\\n const eShape = [e.real.length];\\n const eRealInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.real);\\n const eImagInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.imag);\\n const complexInfo = Object(_kernels_Complex__WEBPACK_IMPORTED_MODULE_2__[\\\"complex\\\"])({ inputs: { real: eRealInfo, imag: eImagInfo }, backend: cpuBackend });\\n const exponentInfo = Object(_kernels_Multiply__WEBPACK_IMPORTED_MODULE_6__[\\\"multiply\\\"])({ inputs: { a: complexInfo, b: $oddTensorInfo }, backend: cpuBackend });\\n const addPart = Object(_kernels_Add__WEBPACK_IMPORTED_MODULE_1__[\\\"add\\\"])({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const subPart = Object(_kernels_Sub__WEBPACK_IMPORTED_MODULE_10__[\\\"sub\\\"])({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const addPartReal = Object(_kernels_Real__WEBPACK_IMPORTED_MODULE_7__[\\\"real\\\"])({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartReal = Object(_kernels_Real__WEBPACK_IMPORTED_MODULE_7__[\\\"real\\\"])({ inputs: { input: subPart }, backend: cpuBackend });\\n const addPartImag = Object(_kernels_Imag__WEBPACK_IMPORTED_MODULE_5__[\\\"imag\\\"])({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartImag = Object(_kernels_Imag__WEBPACK_IMPORTED_MODULE_5__[\\\"imag\\\"])({ inputs: { input: subPart }, backend: cpuBackend });\\n const $real = Object(_kernels_Concat__WEBPACK_IMPORTED_MODULE_3__[\\\"concat\\\"])({\\n inputs: [addPartReal, subPartReal],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $imag = Object(_kernels_Concat__WEBPACK_IMPORTED_MODULE_3__[\\\"concat\\\"])({\\n inputs: [addPartImag, subPartImag],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $realVals = cpuBackend.data.get($real.dataId).values;\\n const $imagVals = cpuBackend.data.get($imag.dataId).values;\\n cpuBackend.disposeIntermediateTensorInfo(evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(complexInfo);\\n cpuBackend.disposeIntermediateTensorInfo(exponentInfo);\\n cpuBackend.disposeIntermediateTensorInfo(addPart);\\n cpuBackend.disposeIntermediateTensorInfo(subPart);\\n cpuBackend.disposeIntermediateTensorInfo(addPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(addPartImag);\\n cpuBackend.disposeIntermediateTensorInfo(subPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(subPartImag);\\n cpuBackend.disposeIntermediateTensorInfo($real);\\n cpuBackend.disposeIntermediateTensorInfo($imag);\\n return { real: $realVals, imag: $imagVals };\\n}\",\n \"function FFTDrawer(canvas, channel) {\\n var canvasContext = canvas.getContext('2d');\\n var curveColor = 'rgb(255,160,122)';\\n var binCount = FFT_SIZE / 2;\\n var data = new Float32Array(binCount);\\n\\n function drawCurve() {\\n var width = canvas.width;\\n var height = canvas.height;\\n var pixelsPerDb = height / 96.0;\\n\\n canvasContext.clearRect(0, 0, width, height);\\n\\n /* Get the proper analyzer from the audio graph */\\n var analyzer = (channel == 0) ? analyzer_left : analyzer_right;\\n if (!analyzer || !get_global('enable_fft')) {\\n requestAnimationFrame(drawCurve);\\n return;\\n }\\n\\n /* Draw decibel scale. */\\n for (var db = -96.0; db <= 0; db += 12) {\\n var y = height - (db + 96) * pixelsPerDb;\\n canvasContext.strokeStyle = curveColor;\\n canvasContext.strokeText(db.toFixed(0) + 'dB', 10, y);\\n }\\n\\n /* Draw FFT */\\n analyzer.getFloatFrequencyData(data);\\n canvasContext.beginPath();\\n canvasContext.lineWidth = 1;\\n canvasContext.strokeStyle = curveColor;\\n canvasContext.moveTo(0, height);\\n\\n var frequencyHz = new Float32Array(width);\\n for (var i = 0; i < binCount; ++i) {\\n var f = i / binCount;\\n\\n /* Convert to log frequency scale (octaves). */\\n var noctaves = 10;\\n f = 1 + Math.log(f) / (noctaves * Math.LN2);\\n\\n /* Draw the magnitude */\\n var x = f * width;\\n var y = height - (data[i] + 96) * pixelsPerDb;\\n\\n canvasContext.lineTo(x, y);\\n }\\n\\n canvasContext.stroke();\\n requestAnimationFrame(drawCurve);\\n }\\n\\n function init() {\\n requestAnimationFrame(drawCurve);\\n }\\n\\n this.init = init;\\n}\",\n \"function fft(x) {\\n return fftComplexDirection(x,false);\\n}\",\n \"function transformRadix2(real, imag) {\\n // Initialization\\n var i, j, k;\\n if (real.length !== imag.length)\\n throw \\\"Mismatched lengths\\\";\\n var n = real.length;\\n if (n === 1) // Trivial transform\\n return;\\n var levels = -1;\\n for (i = 0; i < 32; i++) {\\n if (1 << i === n)\\n levels = i; // Equal to log2(n)\\n }\\n if (levels === -1)\\n throw \\\"Length is not a power of 2\\\";\\n var cosTable = new Array(n / 2);\\n var sinTable = new Array(n / 2);\\n for (i = 0; i < n / 2; i++) {\\n cosTable[i] = Math.cos(2 * Math.PI * i / n);\\n sinTable[i] = Math.sin(2 * Math.PI * i / n);\\n }\\n\\n // Bit-reversed addressing permutation\\n for (i = 0; i < n; i++) {\\n j = reverseBits(i, levels);\\n if (j > i) {\\n var temp = real[i];\\n real[i] = real[j];\\n real[j] = temp;\\n temp = imag[i];\\n imag[i] = imag[j];\\n imag[j] = temp;\\n }\\n }\\n\\n // Cooley-Tukey decimation-in-time radix-2 FFT\\n for (var size = 2; size <= n; size *= 2) {\\n var halfsize = size / 2;\\n var tablestep = n / size;\\n for (i = 0; i < n; i += size) {\\n for (j = i, k = 0; j < i + halfsize; j++, k += tablestep) {\\n var tpre = real[j + halfsize] * cosTable[k] + imag[j + halfsize] * sinTable[k];\\n var tpim = -real[j + halfsize] * sinTable[k] + imag[j + halfsize] * cosTable[k];\\n real[j + halfsize] = real[j] - tpre;\\n imag[j + halfsize] = imag[j] - tpim;\\n real[j] += tpre;\\n imag[j] += tpim;\\n }\\n }\\n }\\n\\n // Returns the integer whose value is the reverse of the lowest 'bits' bits of the integer 'x'.\\n function reverseBits(x, bits) {\\n var y = 0;\\n for (var i = 0; i < bits; i++) {\\n y = (y << 1) | (x & 1);\\n x >>>= 1;\\n }\\n return y;\\n }\\n}\",\n \"function naiveDft(inreal, inimag, outreal, outimag, inverse) {\\n\\tconst n = inreal.length;\\n\\tif (n != inimag.length || n != outreal.length || n != outimag.length)\\n\\t\\tthrow new RangeError(\\\"Mismatched lengths\\\");\\n\\t\\n\\tconst coef = (inverse ? 2 : -2) * Math.PI;\\n\\tfor (let k = 0; k < n; k++) { // For each output element\\n\\t\\tlet sumreal = 0;\\n\\t\\tlet sumimag = 0;\\n\\t\\tfor (let t = 0; t < n; t++) { // For each input element\\n\\t\\t\\tconst angle = coef * (t * k % n) / n; // This is more accurate than t * k\\n\\t\\t\\tsumreal += inreal[t] * Math.cos(angle) - inimag[t] * Math.sin(angle);\\n\\t\\t\\tsumimag += inreal[t] * Math.sin(angle) + inimag[t] * Math.cos(angle);\\n\\t\\t}\\n\\t\\toutreal[k] = sumreal;\\n\\t\\toutimag[k] = sumimag;\\n\\t}\\n}\",\n \"_transform(chunk,encoding,cb) {\\n\\n const uint8_view = new Uint8Array(chunk, 0, chunk.length);\\n var dataView = new DataView(uint8_view.buffer);\\n\\n let iFloat = Array(this.sz*2);\\n let asComplex = Array(this.sz);\\n\\n\\n // for(let i = 0; i < this.sz*2; i+=1) {\\n // iFloat[i] = dataView.getFloat64(i*8, true);\\n // }\\n\\n for(let i = 0; i < this.sz*2; i+=2) {\\n let re = dataView.getFloat64(i*8, true);\\n let im = dataView.getFloat64((i*8)+8, true);\\n\\n asComplex[i/2] = mt.complex(re,im);\\n\\n iFloat[i] = re;\\n iFloat[i+1] = im;\\n\\n // if( i < 16 ) {\\n // console.log(re);\\n // }\\n\\n }\\n\\n let iShort = mutil.IFloatToIShortMulti(iFloat);\\n\\n if( this.onFrameIShort !== null ) {\\n this.onFrameIShort(iShort);\\n }\\n\\n // console.log(\\\"iFloat length \\\" + iFloat.length);\\n // console.log(iFloat.slice(0,16));\\n\\n // console.log(\\\"iShort length \\\" + iShort.length);\\n // console.log(iShort.slice(0,16));\\n\\n\\n this.handleDefaultStream(iFloat,iShort,asComplex);\\n this.handleFineSync(iFloat,iShort,asComplex);\\n this.handleAllSubcarriers(iFloat,iShort,asComplex);\\n this.handleDemodData(iFloat,iShort,asComplex);\\n\\n\\n // for(x of iFloat) {\\n // console.log(x);\\n // }\\n\\n\\n this.uint.frame_track_counter++;\\n cb();\\n }\",\n \"function PowerSpectrum( NumSamples, In, Out)\\n{\\n var Half = NumSamples / 2;\\n var i;\\n\\n var theta = Math.PI / Half;\\n\\n var tmpReal = new Float32Array(Half);\\n var tmpImag = new Float32Array(Half);\\n var RealOut = new Float32Array(Half);\\n var ImagOut = new Float32Array(Half);\\n\\n for (var i = 0; i < Half; i++) {\\n tmpReal[i] = In[2 * i];\\n tmpImag[i] = In[2 * i + 1];\\n }\\n\\n ACFFT(Half, 0, tmpReal, tmpImag, RealOut, ImagOut);\\n\\n var wtemp = (Math.sin(0.5 * theta));\\n\\n var wpr = -2.0 * wtemp * wtemp;\\n var wpi = -1.0 * (Math.sin(theta));\\n var wr = 1.0 + wpr;\\n var wi = wpi;\\n\\n var i3;\\n\\n var h1r, h1i, h2r, h2i, rt, it;\\n\\n for (var i = 1; i < Half / 2; i++) {\\n\\n i3 = Half - i;\\n\\n h1r = 0.5 * (RealOut[i] + RealOut[i3]);\\n h1i = 0.5 * (ImagOut[i] - ImagOut[i3]);\\n h2r = 0.5 * (ImagOut[i] + ImagOut[i3]);\\n h2i = -0.5 * (RealOut[i] - RealOut[i3]);\\n\\n rt = h1r + wr * h2r - wi * h2i;\\n it = h1i + wr * h2i + wi * h2r;\\n\\n Out[i] = rt * rt + it * it;\\n\\n rt = h1r - wr * h2r + wi * h2i;\\n it = -h1i + wr * h2i + wi * h2r;\\n\\n Out[i3] = rt * rt + it * it;\\n\\n wr = (wtemp = wr) * wpr - wi * wpi + wr;\\n wi = wi * wpr + wtemp * wpi + wi;\\n }\\n\\n rt = (h1r = RealOut[0]) + ImagOut[0];\\n it = h1r - ImagOut[0];\\n Out[0] = rt * rt + it * it;\\n\\n rt = RealOut[Half / 2];\\n it = ImagOut[Half / 2];\\n Out[Half / 2] = rt * rt + it * it;\\n}\",\n \"pow22523(z) {\\r\\n const t0 = new FieldElement();\\r\\n const t1 = new FieldElement();\\r\\n const t2 = new FieldElement();\\r\\n let i;\\r\\n t0.square(z);\\r\\n // for (i = 1; i < 1; i++) {\\r\\n // t0.square(t0);\\r\\n // }\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 2; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(z, t1);\\r\\n t0.mul(t0, t1);\\r\\n t0.square(t0);\\r\\n // for (i = 1; i < 1; i++) {\\r\\n // t0.square(t0);\\r\\n // }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 5; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 10; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(t1, t0);\\r\\n t2.square(t1);\\r\\n for (i = 1; i < 20; i++) {\\r\\n t2.square(t2);\\r\\n }\\r\\n t1.mul(t2, t1);\\r\\n t1.square(t1);\\r\\n for (i = 1; i < 10; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t1.square(t0);\\r\\n for (i = 1; i < 50; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t1.mul(t1, t0);\\r\\n t2.square(t1);\\r\\n for (i = 1; i < 100; i++) {\\r\\n t2.square(t2);\\r\\n }\\r\\n t1.mul(t2, t1);\\r\\n t1.square(t1);\\r\\n for (i = 1; i < 50; i++) {\\r\\n t1.square(t1);\\r\\n }\\r\\n t0.mul(t1, t0);\\r\\n t0.square(t0);\\r\\n for (i = 1; i < 2; i++) {\\r\\n t0.square(t0);\\r\\n }\\r\\n this.mul(t0, z);\\r\\n }\",\n \"function calculateNext(data){\\n \\n var AM, BM, TAU_M, AH, BH, TAU_H, AJ, BJ, TAU_J, axr1, bxr1, TAU_Xr1,\\n axr2, bxr2, TAU_Xr2, Axs, Bxs, TAU_Xs, TAU_R, TAU_S, Ad, Bd, Cd, TAU_D, \\n Af, Bf, Cf, TAU_F, Af2, Bf2, Cf2, TAU_F2, temp, temp2, Ak1, Bk1,\\n Ek, Ena, Eks, Eca, FCaSS_INF, exptaufcass, kCaSR, k1, k2, dRR,\\n CaCSQN, dCaSR, bjsr, cjsr, CaSSBuf, dCaSS, bcss, ccss, CaBuf, dCai, bc, cc,\\n dNai, dKi, sOO; \\n\\n var minft_t, exptaumt_t, hinft_t, exptauht_t, jinft_t, exptaujt_t, xr1inft_t,\\n exptauxr1t_t, xr2inft_t, exptauxr2t_t, xsinft_t, exptauxst_t, rinft_t , sinft_t,\\n exptaurt_t, exptaust_t, dinft_t, exptaudt_t, finft_t, exptauft_t, f2inft_t, \\n exptauf2t_t, inakcoefft_t, ipkcoefft_t, ical1t_t, ical2t_t, inaca1t_t, inaca2t_t,\\n ik1coefft_t, fcassinft_t, exptaufcasst_t; \\n\\n\\n sOO = ( cS[iType] === 'epi') ? 8.958e-8 : ( cS[iType] === 'endo' ) ? 8.848e-8 : 1.142e-7; // (cS.itype === 'M')\\n \\n\\n //table setup starts\\n AM = 1.0/(1.+ Math.exp((-60.-cS.v)/5.));\\n BM = 0.1/(1.+ Math.exp((cS.v+35.)/5.))+0.10/(1.+Math.exp((cS.v-50.)/200.));\\n minft_t = 1.0/((1.+Math.exp((-56.86-cS.v)/9.03))*(1.+Math.exp((-56.86-cS.v)/9.03)));\\n TAU_M = AM*BM;\\n exptaumt_t = Math.exp(-cS.timestep/TAU_M);\\n\\n hinft_t = 1.0/((1.+Math.exp((cS.v+71.55)/7.43))*(1.+Math.exp((cS.v+71.55)/7.43)));\\n \\n AH = (cS.v > -40) ? 0. : (0.057*Math.exp(-(cS.v+80.)/6.8));\\n BH = (cS.v > -40) ? (0.77/(0.13*(1.+Math.exp(-(cS.v+10.66)/11.1)))) \\n : (2.7*Math.exp(0.079*cS.v)+(3.1e5)*Math.exp(0.3485*cS.v));\\n TAU_H = 1.0/(AH+BH);\\n exptauht_t = Math.exp(-cS.timestep/TAU_H);\\n\\n AJ = (cS.v > -40) ? 0. : (((-2.5428e4)*Math.exp(0.2444*cS.v)-(6.948e-6)*Math.exp(-0.04391*cS.v))*(cS.v+37.78)/(1.+Math.exp(0.311*(cS.v+79.23))));\\n BJ = (cS.v > -40) ? (0.6*Math.exp((0.057)*cS.v)/(1.+Math.exp(-0.1*(cS.v+32.))))\\n : (0.02424*Math.exp(-0.01052*cS.v)/(1.+Math.exp(-0.1378*(cS.v+40.14))));\\n TAU_J = 1.0/(AJ+BJ);\\n exptaujt_t = Math.exp(-cS.timestep/TAU_J);\\n\\n jinft_t = hinft_t;\\n\\n xr1inft_t = 1.0/(1.+Math.exp((-26.-cS.v)/7.));\\n\\n axr1 = 450.0/(1.+Math.exp((-45.-cS.v)/10.));\\n bxr1 = 6.0/(1.+Math.exp((cS.v-(-30.))/11.5));\\n TAU_Xr1 = axr1*bxr1;\\n exptauxr1t_t = Math.exp(-cS.timestep/TAU_Xr1);\\n\\n\\n xr2inft_t = 1.0/(1.+Math.exp((cS.v-(-88.))/24.));\\n \\n axr2 = 3.0/(1.+Math.exp((-60.-cS.v)/20.));\\n bxr2 = 1.12/(1.+Math.exp((cS.v-60.)/20.));\\n TAU_Xr2 = axr2*bxr2;\\n exptauxr2t_t = Math.exp(-cS.timestep/TAU_Xr2);\\n\\n xsinft_t = 1.0/(1.+ Math.exp((-5.-cS.v)/14.));\\n\\n Axs = (1400.0/(Math.sqrt(1.+Math.exp((5.-cS.v)/6.))));\\n Bxs = (1.0/(1.+ Math.exp((cS.v-35.)/15.)));\\n TAU_Xs = Axs*Bxs+80.;\\n exptauxst_t = Math.exp(-cS.timestep/TAU_Xs);\\n\\n rinft_t = ( cS.itype === 'epi') ? 1.0/(1.+ Math.exp((20.- cS.v)/6.)) \\n : ( cS.itype === 'endo' ) ? 1.0/(1.+Math.exp((20.-cS.v)/6.))\\n : 1.0/(1.+ Math.exp((20.-cS.v)/6.)) ; // (cS.itype === 'M')\\n\\n sinft_t = ( cS.itype === 'epi') ? 1.0/(1.+Math.exp((cS.v+20.)/5.))\\n : ( cS.itype === 'endo' ) ? 1.0/(1.+ Math.exp((cS.v+28.)/5.))\\n : 1.0/(1.+ Math.exp((cS.v+20.)/5.)); // (cS.itype === 'M')\\n\\n TAU_R = ( cS.itype === 'epi') ? 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8\\n : ( cS.itype === 'endo' ) ? 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8\\n : 9.5* Math.exp(-(cS.v+40.)*(cS.v+40.)/1800.)+0.8; // (cS.itype === 'M')\\n\\n TAU_S = ( cS.itype === 'epi') ? 85.* Math.exp(-(cS.v+45.)*(cS.v+45.)/320.) +5.0/(1.+Math.exp((cS.v-20.)/5.))+3. \\n : ( cS.itype === 'endo' ) ? 1000.*Math.exp(-(cS.v+67.)*(cS.v+67.)/1000.)+8.\\n : 85.*Math.exp(-(cS.v+45.)*(cS.v+45.)/320.)+5.0/(1.+Math.exp((cS.v-20.)/5.))+3.; // (cS.itype === 'M')\\n \\n exptaurt_t = Math.exp(-cS.timestep/TAU_R);\\n exptaust_t = Math.exp(-cS.timestep/TAU_S);\\n \\n dinft_t = 1.0/(1.+Math.exp((-8.-cS.v)/7.5));\\n \\n Ad = 1.4/(1.+Math.exp((-35.-cS.v)/13.))+0.25;\\n Bd = 1.4/(1.+Math.exp((cS.v+5.)/5.));\\n Cd = 1.0/(1.+Math.exp((50.-cS.v)/20.));\\n TAU_D = Ad*Bd+Cd;\\n exptaudt_t = Math.exp(-cS.timestep/TAU_D);\\n\\n finft_t = 1.0/(1.+Math.exp((cS.v+20.)/7.));\\n\\n Af = 1102.5*Math.exp(-(cS.v+27.)*(cS.v+27.)/225.);\\n Bf = 200.0/(1.+Math.exp((13.-cS.v)/10.));\\n Cf = (180.0/(1.+Math.exp((cS.v+30.)/10.)))+20.;\\n TAU_F = Af+Bf+Cf;\\n exptauft_t = Math.exp(-cS.timestep/TAU_F);\\n\\n f2inft_t = 0.67/(1.+Math.exp((cS.v+35.)/7.))+0.33;\\n\\n //original code had the following, but paper uses denom of 170**2, not 7**2\\n\\n Af2 = 600.*Math.exp(-(cS.v+25.)*(cS.v+25.)/49.);\\n\\n // paper value for Af2 is INCORRECT to match the figure\\n //Af2=600.*exp(-(vv+25.)*(vv+25.)/(170.*170.))\\n \\n Bf2 = 31.0/(1.+Math.exp((25.-cS.v)/10.));\\n Cf2 = 16.0/(1.+Math.exp((cS.v+30.)/10.));\\n TAU_F2 = Af2+Bf2+Cf2\\n exptauf2t_t = Math.exp(-cS.timestep/TAU_F2);\\n\\n inakcoefft_t = (1.0/(1.+0.1245*Math.exp(-0.1*cS.v*cC.fort)+0.0353*Math.exp(-cS.v*cC.fort)))*cS.knak*(cS.Ko/(cS.Ko+cS.KmK)); \\n ipkcoefft_t = cS.GpK/(1.+Math.exp((25.-cS.v)/5.98)); \\n temp = Math.exp(2*(cS.v-15)*cC.fort);\\n\\n if(!(Math.abs(cS.v-15.) < 1e-4)){\\n // need implemented\\n ical1t_t = cS.GCaL*4.*(cS.v-15.)*(cS.FF*cC.fort)* (0.25*temp)/(temp-1.);\\n ical2t_t = cS.GCaL*4.*(cS.v-15.)*(cS.FF*cC.fort)*cS.Cao/(temp-1.);\\n }\\n \\n temp = Math.exp((cS.n-1.)*cS.v*cC.fort);\\n temp2 = cS.knaca/((cC.KmNai3+cC.Nao3)*(cS.KmCa+cS.Cao)*(1.+cS.ksat*temp));\\n inaca1t_t = temp2*Math.exp(cS.n*cS.v*cC.fort)*cS.Cao;\\n inaca2t_t = temp2*temp*cC.Nao3*cS.alphanaca; \\n\\n\\n //reversal potentials\\n Ek = cC.rtof*(Math.log((cS.Ko/cS.ki)));\\n Ena = cC.rtof*(Math.log((cS.Nao/cS.nai)));\\n Eks = cC.rtof*(Math.log((cS.Ko+cS.pKNa*cS.Nao)/(cS.ki+cS.pKNa*cS.nai)));\\n Eca = 0.5*cC.rtof*(Math.log((cS.Cao/cS.cai)));\\n \\n // need to figure out vmek is (cS.v - Ek) \\n Ak1 = 0.1/(1.+Math.exp(0.06*((cS.v - Ek)-200.)));\\n Bk1 = (3.*Math.exp(0.0002*((cS.v - Ek)+100.))+Math.exp(0.1*((cS.v - Ek)-10.)))/(1.+Math.exp(-0.5*((cS.v - Ek)))); \\n ik1coefft_t = cS.GK1*Ak1/(Ak1+Bk1); \\n \\n fcassinft_t = 0.6/(1+(cS.cass/0.05)*(cS.cass/0.05))+0.4;\\n temp = 80.0/(1+(cS.cass/0.05)*(cS.cass/0.05))+2.;\\n exptaufcasst_t = Math.exp(-cS.timestep/temp); \\n\\n //stimulus\\n\\n cS.Istim = _s1s2Stimulus(count, settings);\\n \\n //Compute currents\\n\\n cS.sm = minft_t - (minft_t-cS.sm)*exptaumt_t;\\n cS.sh = hinft_t - (hinft_t-cS.sh)*exptauht_t;\\n cS.sj = jinft_t - (jinft_t-cS.sj)*exptaujt_t;\\n cS.ina = cS.GNa*cS.sm *cS.sm *cS.sm *cS.sh*cS.sj*(cS.v-Ena); \\n\\n cS.sxr1 = xr1inft_t-(xr1inft_t - cS.sxr1) * exptauxr1t_t;\\n\\n \\n cS.sxr2 = xr2inft_t-(xr2inft_t - cS.sxr2) * exptauxr2t_t;\\n \\n cS.ikr = cS.Gkr*cC.Gkrfactor*cS.sxr1*cS.sxr2*(cS.v-Ek); \\n \\n cS.sxs = xsinft_t-(xsinft_t-cS.sxs)*exptauxst_t;\\n\\n cS.iks = cS.Gks*cS.sxs*cS.sxs*(cS.v-Eks);\\n\\n cS.sr = rinft_t-(rinft_t-cS.sr)*exptaurt_t;\\n\\n cS.ss = sinft_t-(sinft_t-cS.ss)*exptaust_t;\\n\\n cS.ito = cS.Gto*cS.sr*cS.ss*(cS.v-Ek);\\n\\n cS.sd = dinft_t-(dinft_t-cS.sd)*exptaudt_t;\\n\\n cS.sf = finft_t-(finft_t-cS.sf)*exptauft_t;\\n\\n cS.sf2 = f2inft_t-(f2inft_t-cS.sf2)*exptauf2t_t; \\n\\n FCaSS_INF = (cS.cass > cS.casshi) ? 0.4 : fcassinft_t ;\\n\\n exptaufcass = (cS.cass > cS.casshi) ? cC.exptaufcassinf : exptaufcasst_t;\\n\\n cS.sfcass = FCaSS_INF-(FCaSS_INF- cS.sfcass)*exptaufcass;\\n\\n cS.ical = cS.sd*cS.sf*cS.sf2*cS.sfcass*(ical1t_t* cS.cass - ical2t_t);\\n\\n cS.ik1 = ik1coefft_t*(cS.v-Ek);\\n\\n cS.ipk = ipkcoefft_t*(cS.v-Ek);\\n\\n cS.inaca = inaca1t_t*cS.nai*cS.nai*cS.nai-inaca2t_t*cS.cai;\\n\\n cS.inak = inakcoefft_t*(cS.nai/(cS.nai+cS.KmNa));\\n\\n cS.ipca = cS.GpCa*cS.cai/(cS.KpCa+cS.cai);\\n\\n cS.ibna = cS.GbNa*(cS.v-Ena);\\n\\n cS.ibca = cS.GbCa*(cS.v-Eca);\\n\\n //total current\\n cS.sItot = cS.ikr+ cS.iks+ cS.ik1+ cS.ito+ cS.ina+ cS.ibna+ cS.ical+ cS.ibca+ cS.inak+ cS.inaca+ cS.ipca+ cS.ipk+ cS.Istim;\\n\\n //console.log(cS.ikr, cS.iks, cS.ik1, cS.ito, cS.ina, cS.ibna, cS.ical, cS.ibca, cS.inak, cS.inaca, cS.ipca, cS.ipk, cS.Istim);\\n\\n //update concentrations\\n\\n kCaSR = cS.maxsr-((cS.maxsr-cS.minsr)/(1+(cS.EC/cS.casr*(cS.EC/cS.casr))));\\n k1 = cS.k1prime/kCaSR;\\n k2 = cS.k2prime*kCaSR;\\n dRR = cS.k4*(1.-cS.srr)-k2*cS.cass*cS.srr;\\n cS.srr = cS.srr+cS.timestep*dRR;\\n sOO = k1*cS.cass*cS.cass*cS.srr/(cS.k3+k1*cS.cass*cS.cass);\\n\\n //intracellular calcium currents\\n\\n cS.Irel = cS.Vrel*sOO*(cS.casr- cS.cass);\\n cS.Ileak = cS.Vleak*(cS.casr-cS.cai);\\n cS.Iup = cS.Vmaxup/(1.+((cS.Kup*cS.Kup)/(cS.cai*cS.cai)));\\n cS.Ixfer = cS.Vxfer*(cS.cass - cS.cai);\\n\\n\\n CaCSQN = cS.Bufsr*cS.casr/(cS.casr+cS.Kbufsr);\\n dCaSR = cS.timestep*(cS.Iup-cS.Irel-cS.Ileak);\\n bjsr = cS.Bufsr-CaCSQN-dCaSR-cS.casr+cS.Kbufsr;\\n cjsr = cS.Kbufsr*(CaCSQN+dCaSR+cS.casr);\\n cS.casr = (Math.sqrt(bjsr*bjsr+4.*cjsr)-bjsr)/2.;\\n\\n CaSSBuf = cS.Bufss * cS.cass/(cS.cass+cS.Kbufss);\\n dCaSS = cS.timestep * (-cS.Ixfer*(cS.Vc/cS.Vss)+cS.Irel*(cS.Vsr/cS.Vss)+(-cS.ical*cC.inversevssF2*cS.CAPACITANCE)); \\n bcss = cS.Bufss - CaSSBuf - dCaSS - cS.cass+cS.Kbufss;\\n ccss = cS.Kbufss*(CaSSBuf+dCaSS+cS.cass);\\n cS.cass = (Math.sqrt(bcss*bcss+4.*ccss)-bcss)/2.;\\n\\n CaBuf = cS.Bufc*cS.cai/(cS.cai+cS.Kbufc);\\n dCai = cS.timestep *((-(cS.ibca+cS.ipca-2*cS.inaca)*cC.inverseVcF2*cS.CAPACITANCE)-(cS.Iup-cS.Ileak)*(cS.Vsr/cS.Vc)+cS.Ixfer); \\n bc = cS.Bufc-CaBuf-dCai-cS.cai+cS.Kbufc;\\n cc = cS.Kbufc*(CaBuf+dCai+cS.cai);\\n cS.cai = (Math.sqrt(bc*bc+4.*cc)-bc)/2.;\\n\\n dNai = -(cS.ina+cS.ibna+3.*cS.inak+3.*cS.inaca)*cC.inverseVcF*cS.CAPACITANCE;\\n cS.nai = cS.nai+cS.timestep*dNai;\\n\\n dKi = -(cS.Istim+cS.ik1+cS.ito+cS.ikr+cS.iks-2.*cS.inak+cS.ipk)*cC.inverseVcF*cS.CAPACITANCE; \\n cS.ki = cS.ki+cS.timestep*dKi;\\n cS.v = cS.v - cS.sItot * cS.timestep ;\\n \\n\\n //cal ends\\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n \\n // iterate the count\\n count++;\\n\\n return data; \\n }\",\n \"function calculateNext(data) {\\n \\n\\t\\tvar yinft_t, exptauyt_t, xinft_t, exptauxt_t, ikcoefft_t, rinft_t, exptaurt_t, itoterm1t_t, itoterm2t_t, itoterm3t_t,\\n\\t\\tinacaterm1t_t, inacaterm2t_t, minft_t, exptaumt_t, hinft_t, exptauht_t, dinft_t, exptaudt_t, finft_t, exptauft_t,\\n\\t\\tisicaterm1t_t, isikterm1t_t, isikterm2t_t, pinft_t, exptaupt_t, ik1term1t_t, \\n\\n\\t\\tadum, bdum, ena, ek, emh, eca, vmek, yinf, exptauy, ikc, inac, ionc, xinf, exptaux, ikcoeff, ik1term1, rinf, exptaur,\\n\\t\\titoterm1, itoterm2, itoterm3, icac, inacaterm1, inacaterm2, nai3, dum2, dum3, dum4, minf, exptaum, hinf, exptauh, \\n\\t\\tdinf, exptaud, finf, exptauf, tvar, inf, isicaterm1, isikterm1, isikterm2, imk, imna, imca, iion,\\n\\t\\tfactor, derv, pinf, exptaup, iup, itr, irel, dcaup, dcarel, dcai, dna, dk ;\\n\\n\\t\\tadum = 0.05 * Math.exp(-0.067 * (cS.v + 42.));\\n bdum = (Math.abs(cS.v + 42.) <= 1e-6) ? 2.5 : (cS.v + 42.) / (1.- Math.exp(-0.2 * (cS.v + 42.)));\\n cS.tau = adum + bdum;\\n yinft_t = adum / cS.tau;\\n exptauyt_t = Math.exp(-cS.timestep * cS.tau);\\n adum = 0.5 * Math.exp(0.0826 * (cS.v + 50.)) / (1.0 + Math.exp(0.057 * (cS.v + 50.)));\\n bdum = 1.3 * Math.exp(-0.06 * (cS.v + 20.)) / (1. + Math.exp(-0.04 * (cS.v + 20.)));\\n cS.tau = adum + bdum;\\n xinft_t = adum / cS.tau;\\n exptauxt_t = Math.exp(-cS.timestep * cS.tau);\\n ikcoefft_t = Math.exp(-cS.v * cC.fort);\\n adum = 0.033 * Math.exp(-cS.v / 17.);\\n bdum = 33. / (1. + Math.exp(-(cS.v + 10.) / 8.));\\n cS.tau = adum + bdum;\\n rinft_t = adum / cS.tau;\\n exptaurt_t = Math.exp(-cS.timestep * cS.tau);\\n itoterm1t_t = (Math.abs(cS.v + 10.) <= (10e-6)) ? 5. : (cS.v + 10.) / (1.-Math.exp(-2. * (cS.v + 10.)));\\n itoterm2t_t = Math.exp(.02 * cS.v);\\n itoterm3t_t = Math.exp(-.02 * cS.v);\\n inacaterm1t_t = Math.exp(cS.gamma * cS.v * cC.fort);\\n inacaterm2t_t = Math.exp((cS.gamma - 1.) * cS.v * cC.fort);\\n adum = (Math.abs(cS.v + 41.) <= 1e-6) ? 2000 : 200. * (cS.v + 41.) / (1.-Math.exp(-0.1 * (cS.v + 41.)));\\n bdum = 8000. * Math.exp(-0.056 * (cS.v + 66.));\\n cS.tau = adum + bdum;\\n minft_t = adum / cS.tau;\\n exptaumt_t = Math.exp(-cS.timestep * cS.tau);\\n adum = 20. * Math.exp(-0.125 * (cS.v + 75.));\\n bdum = 2000. / (1. + 320. * Math.exp(-0.1 * (cS.v + 75.)));\\n cS.tau = adum + bdum;\\n hinft_t = adum / cS.tau;\\n exptauht_t = Math.exp(-cS.timestep * cS.tau);\\n if(Math.abs(cS.v + 19.) <= 1e-6){\\n adum = 120.;\\n bdum = 120.;\\n }\\n else{\\n adum = 30. * (cS.v + 19.) / (1.-Math.exp(-(cS.v + 19.) / 4.));\\n bdum = 12. * (cS.v + 19.) / (Math.exp((cS.v + 19.) / 10.)-1.);\\n }\\n cS.tau = adum + bdum;\\n dinft_t = adum / cS.tau;\\n exptaudt_t = Math.exp(-cS.timestep * cS.tau);\\n adum = (Math.abs((cS.v + 34.)) <= 1e-6) ? 25. : 6.25 * (cS.v + 34.) / (Math.exp((cS.v + 34.) / 4.)-1.);\\n bdum = 50. / (1. + Math.exp(-(cS.v + 34.) / 4.));\\n cS.tau = adum + bdum;\\n finft_t = adum / cS.tau;\\n exptauft_t = Math.exp(-cS.timestep * cS.tau);\\n isicaterm1t_t = Math.exp(-2. * (cS.v - 50.) * cC.fort);\\n isikterm1t_t = (1.- Math.exp(-(cS.v - 50.) * cC.fort));\\n isikterm2t_t = Math.exp((50. - cS.v) * cC.fort);\\n adum = (Math.abs((cS.v + 34.)) <= 1e-6) ? 2.5 : .625 * (cS.v + 34.) / (Math.exp((cS.v + 34.) / 4.)-1.);\\n bdum = 5.0 / (1. + Math.exp(-(cS.v + 34.) / 4.));\\n cS.tau = adum + bdum;\\n pinft_t = adum / cS.tau;\\n exptaupt_t = Math.exp(-cS.timestep * cS.tau);\\n\\n // compute equilibrium potentials\\n\\t\\t\\n\\t\\tena = cC.rtof * Math.log(cS.nao / cS.nai);\\n ek = cC.rtof * Math.log(cS.kc / cS.ki);\\n emh = cC.rtof * Math.log((cS.nao + 0.12 * cS.kc) / (cS.nai + 0.12 * cS.ki));\\n eca = 0.5 * cC.rtof * Math.log(cS.cao / cS.cai);\\n \\n vmek = cS.v - ek;\\n ik1term1t_t = cS.gk1 * (vmek) / (1. + Math.exp(2. * (vmek + 10.) * cC.fort));\\n\\t\\t\\n\\t\\t// hyperpolarizing-activated current\\n yinf = yinft_t;\\n exptauy = exptauyt_t;\\n cS.y = yinf - (yinf - cS.y) * exptauy;\\n\\n cS.ifk = cS.y * (cS.kc / (cS.kc + cS.kmf)) * cS.gfk * (cS.v - ek);\\n cS.ifna = cS.y * (cS.kc / (cS.kc + cS.kmf)) * cS.gfna * (cS.v - ena);\\n// cS.ifk = 0.0\\n// cS.ifna = 0.0\\n ikc = cS.ifk;\\n inac = cS.ifna;\\n ionc = cS.ifk + cS.ifna;\\n\\n// time-dependent (delayed K + current)\\n xinf = xinft_t;\\n exptaux = exptauxt_t;\\n cS.x = xinf - (xinf - cS.x) * exptaux;\\n\\n ikcoeff = ikcoefft_t;\\n cS.ik = cS.x * cS.ikmax * (cS.ki - cS.kc * ikcoeff) / 140.;\\n ikc = ikc + cS.ik;\\n ionc = ionc + cS.ik;\\n\\n// time-independent (background) K + current\\n ik1term1 = ik1term1t_t;\\n cS.ik1 = (cS.kc / (cS.kc + cS.km1)) * ik1term1;\\n ikc = ikc + cS.ik1;\\n ionc = ionc + cS.ik1;\\n\\n\\t\\t// transient outward current\\n rinf = rinft_t;\\n exptaur = exptaurt_t;\\n cS.r = rinf - (rinf - cS.r) * exptaur;\\n\\n itoterm1 = itoterm1t_t;\\n itoterm2 = itoterm2t_t;\\n itoterm3 = itoterm3t_t;\\n cS.ito = (cS.r * cS.gto * (0.2 + (cS.kc / (cS.kc + cS.kmt))) * (cS.cai / \\n (cS.kact + cS.cai)) * itoterm1) * (cS.ki * itoterm2-cS.kc * itoterm3); // gto = 0.28\\n ikc = ikc + cS.ito;\\n ionc = ionc + cS.ito;\\n\\t\\t \\n// background sodium current\\n cS.ibna = cS.gbna * (cS.v - ena);\\n inac = inac + cS.ibna;\\n ionc = ionc + cS.ibna;\\n\\n// background calcium current\\n cS.ibca = cS.gbca * (cS.v - eca);\\n icac = cS.ibca;\\n ionc = ionc + cS.ibca;\\n\\n// na-k pump exchange current\\n cS.inak = cS.ipmax * (cS.kc / (cS.kmk + cS.kc)) * (cS.nai / (cS.kmna + cS.nai));\\n ikc = ikc - 2. * cS.inak;\\n inac = inac + 3. * cS.inak;\\n ionc = ionc + cS.inak;\\n\\n// na-ca pump exchange current\\n inacaterm1 = inacaterm1t_t;\\n inacaterm2 = inacaterm2t_t;\\n nai3 = cS.nai * cS.nai * cS.nai;\\n dum2 = nai3 * cS.cao * inacaterm1;\\n dum3 = cC.nao3 * (cS.cai) * inacaterm2;\\n dum4 = 1. + cS.dnaca * ((cS.cai) * cC.nao3 + cS.cao * nai3);\\n cS.inaca = cS.knaca * (dum2 - dum3) / dum4;\\n inac = inac + 3 * cS.inaca;\\n icac = icac - 2. * cS.inaca;\\n ionc = ionc + cS.inaca;\\n\\n// fast sodium current\\n minf = minft_t;\\n exptaum = exptaumt_t;\\n cS.m = minf - (minf - cS.m) * exptaum;\\n\\n hinf = hinft_t;\\n exptauh = exptauht_t;\\n cS.h = hinf - (hinf - cS.h) * exptauh;\\n\\n cS.ina = cS.m * cS.m * cS.m * cS.h * cS.gna * (cS.v - emh);\\n inac = inac + cS.ina;\\n ionc = ionc + cS.ina; \\n\\n// fast second inward current (calcium)\\n dinf = dinft_t;\\n exptaud = exptaudt_t;\\n cS.d = dinf - (dinf - cS.d) * exptaud;\\n\\n finf = finft_t;\\n exptauf = exptauft_t;\\n cS.f = finf - (finf - cS.f) * exptauf;\\n\\n adum = 5.;\\n bdum = cS.cai * adum / cS.kmf2;\\n tvar = adum + bdum;\\n inf = adum / (adum + bdum);\\n cS.f2 = inf - (inf - cS.f2) * Math.exp(-cS.timestep * tvar);\\n\\n dum2 = cS.d * cS.f * cS.f2 * (4. * cS.psi * (cS.v - 50.) * cC.fort);\\n isicaterm1 = isicaterm1t_t;\\n dum3 = (1. - isicaterm1);\\n dum4 = cS.cai * cC.exp100fort - cS.cao * isicaterm1;\\n cS.isica = dum2 * dum4 / dum3;\\n icac = icac + cS.isica;\\n ionc = ionc + cS.isica;\\n\\n// more fast inward current\\n isikterm1 = isikterm1t_t;\\n isikterm2 = isikterm2t_t;\\n dum3 = isikterm1;\\n dum4 = cS.ki * cC.exp50fort - cS.kc * isikterm2;\\n cS.isik = dum2 * dum4 / (400. * dum3);\\n ikc = ikc + cS.isik;\\n ionc = ionc + cS.isik;\\n\\n// total currents used to update each ion concentration\\n imk = ikc;\\n imna = inac;\\n imca = icac;\\n\\n// convert from nanoamperes to microampers per square cm\\n\\n// iion = 0.015 * ionc\\n\\n// derv = -1000. * iion / cm\\n\\n imna = cS.ifna + cS.ina + 3. * cS.inaca + 3. * cS.inak + cS.ibna;\\n imk = cS.ifk + cS.ik + cS.ik1 + cS.ito + cS.isik - 2. * cS.inak;\\n imca = cS.isica - 2. * cS.inaca + cS.ibca;\\n iion = imna + imk + imca;\\n\\n\\n// stimulus\\n// if(ttim * 1000.0.le.1.0) then\\n// if(mod(it,icycle).le.istimdur) then\\n// if(ttim * 1000.0.le.1.0.or.\\n// & (ttim * 1000.0.gt.500.0.and.ttim * 1000.0.le.501.0)) then\\n// ionc = ionc-10000.0\\n// endif\\n// 1750 works, 1800 does not so use 1750 as diast. thresh, 3500 = 2 * \\n // if(mod(ntime,icycle).le.istimdur) then\\n factor = _s1s2Stimulus(count,data);\\n iion = iion - factor;\\n imk = imk - factor;\\n \\n derv = iion / cS.cm;\\n\\n \\n// change in intracellular sodium \\n dna = (-imna / (cC.vi * cS.fcon)) * cS.timestep;\\n cS.nai = cS.nai + dna;\\n\\n// change in extracellular potassium\\n dk = (-cS.prate * (cS.kc - cS.kb) + imk / (cC.ve * cS.fcon)) * cS.timestep;\\n cS.kc = cS.kc + dk;\\n\\n// change in intracellular potassium\\n dk = (-imk / (cC.vi * cS.fcon)) * cS.timestep;\\n cS.ki = cS.ki + dk;\\n\\t\\t\\n// intracellular calcium handling\\n pinf = pinft_t;\\n exptaup = exptaupt_t;\\n cS.p = pinf - (pinf - cS.p) * exptaup;\\n\\n iup = cC.aup * cS.cai * (cS.cabarup - cS.caup);\\n itr = cC.atr * cS.p * (cS.caup - cS.carel);\\n irel = cC.arel * cS.carel * (((cS.cai) * cS.cai) / ((cS.cai) * cS.cai + cS.kmca * cS.kmca));\\n\\n dcaup = ((iup - itr) / (2. * cC.vup * cS.fcon)) * cS.timestep;\\n cS.caup = cS.caup + dcaup;\\n\\n dcarel = ((itr - irel) / (2. * cC.vrel * cS.fcon)) * cS.timestep;\\n cS.carel = cS.carel + dcarel;\\n\\n dcai = (-(imca + iup - irel) / (2. * cC.vi * cS.fcon)) * cS.timestep;\\n cS.cai = cS.cai + dcai;\\n\\n// update voltage\\n cS.v = cS.v - cS.timestep * derv;\\n\\t\\t\\n // sets voltage variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.voltageVariables);\\n \\n // sets current variables after calculations\\n utils.copySpecific(data.calculationSettings, cS, data.calculationSettings.currentVariables);\\n \\n // iterate the count\\n count++;\\n return data; \\n }\",\n \"function dft_direct (re, im) {\\n let N = re.length;\\n // is this necessary? should be able to do DFT with any N\\n //if (N.toString(2) % 10) return; // check that N is a power of 2\\n\\n // array containing N evenly spaced points around the unit circle\\n let W = discrete_circle(N);\\n\\n // debugger;\\n // initialize imaginary values to zero if not provided\\n im = im || re.map( a => 0 );\\n\\n // sum (x * W) over N points (0 to N-1), for all frequencies k in N\\n return re.map( (_, k) =>\\n re.map( (_, n) => cpx_mult([re[n], im[n]], W[n * k % N]) )\\n .reduce( (a, b) => cpx_add(a, b) ));\\n}\",\n \"function fftRadix2(realVals, imagVals, size, inverse, cpuBackend) {\\n if (size === 1) {\\n return { real: realVals, imag: imagVals };\\n }\\n const data = backend_util.mergeRealAndImagArrays(realVals, imagVals);\\n const half = size / 2;\\n const evenComplex = backend_util.complexWithEvenIndex(data);\\n const evenRealVals = evenComplex.real;\\n const evenImagVals = evenComplex.imag;\\n const evenShape = [evenRealVals.length];\\n const evenRealInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenRealVals);\\n const evenImagInfo = cpuBackend.makeTensorInfo(evenShape, 'float32', evenImagVals);\\n const evenTensorInfo = complex({ inputs: { real: evenRealInfo, imag: evenImagInfo }, backend: cpuBackend });\\n const oddComplex = backend_util.complexWithOddIndex(data);\\n const oddRealVals = oddComplex.real;\\n const oddImagVals = oddComplex.imag;\\n const oddShape = [oddRealVals.length];\\n const oddRealInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddRealVals);\\n const oddImagInfo = cpuBackend.makeTensorInfo(oddShape, 'float32', oddImagVals);\\n const oddTensorInfo = complex({ inputs: { real: oddRealInfo, imag: oddImagInfo }, backend: cpuBackend });\\n // Recursive call for half part of original input.\\n const $evenComplex = fftRadix2(evenRealVals, evenImagVals, half, inverse, cpuBackend);\\n const $evenRealVals = $evenComplex.real;\\n const $evenImagVals = $evenComplex.imag;\\n const $evenShape = [$evenRealVals.length];\\n const $evenRealInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenRealVals);\\n const $evenImagInfo = cpuBackend.makeTensorInfo($evenShape, 'float32', $evenImagVals);\\n const $evenTensorInfo = complex({\\n inputs: { real: $evenRealInfo, imag: $evenImagInfo },\\n backend: cpuBackend\\n });\\n const $oddComplex = fftRadix2(oddRealVals, oddImagVals, half, inverse, cpuBackend);\\n const $oddRealVals = $oddComplex.real;\\n const $oddImagVals = $oddComplex.imag;\\n const $oddShape = [$oddRealVals.length];\\n const $oddRealInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddRealVals);\\n const $oddImagInfo = cpuBackend.makeTensorInfo($oddShape, 'float32', $oddImagVals);\\n const $oddTensorInfo = complex({ inputs: { real: $oddRealInfo, imag: $oddImagInfo }, backend: cpuBackend });\\n const e = backend_util.exponents(size, inverse);\\n const eShape = [e.real.length];\\n const eRealInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.real);\\n const eImagInfo = cpuBackend.makeTensorInfo(eShape, 'float32', e.imag);\\n const complexInfo = complex({ inputs: { real: eRealInfo, imag: eImagInfo }, backend: cpuBackend });\\n const exponentInfo = multiply({ inputs: { a: complexInfo, b: $oddTensorInfo }, backend: cpuBackend });\\n const addPart = add({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const subPart = sub({\\n inputs: { a: $evenTensorInfo, b: exponentInfo },\\n backend: cpuBackend\\n });\\n const addPartReal = real({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartReal = real({ inputs: { input: subPart }, backend: cpuBackend });\\n const addPartImag = imag({ inputs: { input: addPart }, backend: cpuBackend });\\n const subPartImag = imag({ inputs: { input: subPart }, backend: cpuBackend });\\n const $real = concat({\\n inputs: [addPartReal, subPartReal],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $imag = concat({\\n inputs: [addPartImag, subPartImag],\\n backend: cpuBackend,\\n attrs: { axis: 0 }\\n });\\n const $realVals = cpuBackend.data.get($real.dataId).values;\\n const $imagVals = cpuBackend.data.get($imag.dataId).values;\\n cpuBackend.disposeIntermediateTensorInfo(evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($evenTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo($oddTensorInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eRealInfo);\\n cpuBackend.disposeIntermediateTensorInfo(eImagInfo);\\n cpuBackend.disposeIntermediateTensorInfo(complexInfo);\\n cpuBackend.disposeIntermediateTensorInfo(exponentInfo);\\n cpuBackend.disposeIntermediateTensorInfo(addPart);\\n cpuBackend.disposeIntermediateTensorInfo(subPart);\\n cpuBackend.disposeIntermediateTensorInfo(addPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(addPartImag);\\n cpuBackend.disposeIntermediateTensorInfo(subPartReal);\\n cpuBackend.disposeIntermediateTensorInfo(subPartImag);\\n cpuBackend.disposeIntermediateTensorInfo($real);\\n cpuBackend.disposeIntermediateTensorInfo($imag);\\n return { real: $realVals, imag: $imagVals };\\n}\",\n \"function doFFT(values) {\\n\\tvar data = new complex_array.ComplexArray(values.length);\\n\\tdata.real = new Float32Array(values);\\n\\tvar frequencies = data.FFT();\\n\\n\\treturn frequencies;\\n}\",\n \"calculateLoudness(buffer) {\\n\\n // first call or after resetMemory\\n if (this.copybuffer == undefined) {\\n // how long should the copybuffer be at least? \\n // --> at least maxT should fit in and length shall be an integer fraction of buffer length\\n let length = Math.floor(this.sampleRate * this.loudnessprops.maxT / buffer.length + 1) * buffer.length;\\n this.copybuffer = new CircularAudioBuffer(context, this.nChannels, length, this.sampleRate);\\n }\\n\\n //accumulate buffer to previous call\\n this.copybuffer.concat(buffer);\\n\\n // must be gt nSamplesPerInterval\\n // or: wait at least one interval time T to be able to calculate loudness\\n if (this.copybuffer.getLength() < this.nSamplesPerInterval) {\\n console.log('buffer too small ... have to eat more data');\\n return NaN;\\n }\\n\\n // get array of meansquares from buffer of overlapping intervals\\n let meanSquares = this.getBufferMeanSquares(this.copybuffer, this.nSamplesPerInterval, this.nStepsize);\\n\\n // first stage filter\\n this.filterBlocks(meanSquares, this.gamma_a);\\n\\n // second stage filter\\n let gamma_r = 0.;\\n for (let chIdx = 0; chIdx < this.nChannels; chIdx++) {\\n let mean = 0.;\\n for (let idx = 0; idx < meanSquares[chIdx].length; idx++) {\\n mean += meanSquares[chIdx][idx];\\n }\\n mean /= meanSquares[chIdx].length;\\n gamma_r += (this.channelWeight[chIdx] * mean);\\n }\\n gamma_r = -0.691 + 10.0 * Math.log10(gamma_r) - 10.;\\n\\n this.filterBlocks(meanSquares, gamma_r);\\n\\n // gated loudness from filtered blocks\\n let gatedLoudness = 0.;\\n for (let chIdx = 0; chIdx < this.nChannels; chIdx++) {\\n let mean = 0.;\\n for (let idx = 0; idx < meanSquares[chIdx].length; idx++) {\\n mean += meanSquares[chIdx][idx];\\n }\\n mean /= meanSquares[chIdx].length;\\n\\n gatedLoudness += (this.channelWeight[chIdx] * mean);\\n }\\n gatedLoudness = -0.691 + 10.0 * Math.log10(gatedLoudness);\\n\\n //console.log(this.id, '- gatedLoudness:', gatedLoudness);\\n\\n return gatedLoudness;\\n }\",\n \"function yt(t){var S,k,_,A,e,u=Math.floor,I=new Array(64),C=new Array(64),T=new Array(64),F=new Array(64),w=new Array(65535),y=new Array(65535),Q=new Array(64),v=new Array(64),P=[],E=0,q=7,O=new Array(64),B=new Array(64),R=new Array(64),n=new Array(256),j=new Array(2048),b=[0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18,24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63],D=[0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0],M=[0,1,2,3,4,5,6,7,8,9,10,11],U=[0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,125],N=[1,2,3,0,4,17,5,18,33,49,65,6,19,81,97,7,34,113,20,50,129,145,161,8,35,66,177,193,21,82,209,240,36,51,98,114,130,9,10,22,23,24,25,26,37,38,39,40,41,42,52,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,225,226,227,228,229,230,231,232,233,234,241,242,243,244,245,246,247,248,249,250],z=[0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0],L=[0,1,2,3,4,5,6,7,8,9,10,11],H=[0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,119],W=[0,1,2,3,17,4,5,33,49,6,18,65,81,7,97,113,19,34,50,129,8,20,66,145,161,177,193,9,35,51,82,240,21,98,114,209,10,22,36,52,225,37,241,23,24,25,26,38,39,40,41,42,53,54,55,56,57,58,67,68,69,70,71,72,73,74,83,84,85,86,87,88,89,90,99,100,101,102,103,104,105,106,115,116,117,118,119,120,121,122,130,131,132,133,134,135,136,137,138,146,147,148,149,150,151,152,153,154,162,163,164,165,166,167,168,169,170,178,179,180,181,182,183,184,185,186,194,195,196,197,198,199,200,201,202,210,211,212,213,214,215,216,217,218,226,227,228,229,230,231,232,233,234,242,243,244,245,246,247,248,249,250];function r(t,e){for(var n=0,r=0,i=new Array,o=1;o<=16;o++){for(var a=1;a<=t[o];a++)i[e[r]]=[],i[e[r]][0]=n,i[e[r]][1]=o,r++,n++;n*=2}return i}function G(t){for(var e=t[0],n=t[1]-1;0<=n;)e&1<
\\\");\\n// var delayLine = new Array;\\n// var pointer = 0;\\n// var delayLength = oneSecond / 2;\\n// for (var ijj = 0; ijj < groove.lineLength; ijj++){\\n//\\t\\tdelayLine[ijj] = 0;\\n// }\\n for (var repeat = 1 ; repeat < repeats; repeat++){\\n for (var jj = 0 ; jj < ii ; jj++){\\n samples[jj + ii * repeat] = samples[jj];\\n\\t if (delay){\\n//\\t\\tsamples[jj + ii * repeat] = samples[jj + ii * repeat] - 0.5*delayLine[pointer];\\n//\\t\\tdelayLine[pointer] = samples[jj + ii * repeat];\\n//\\t\\tpointer = (pointer+1)%lineLength;\\n }\\n\\t }\\n\\t}\\n return samples;\\n}\",\n \"function addEqualiser() {\\n\\n var gainDb = -40.0; // atenuation When it takes a positive value it is a real gain, when negative it is an attenuation. It is expressed in dB, has a default value of 0 and can take a value in a nominal range of -40 to 40.\\n var bandSplit = [360, 3600];\\n context_player = new AudioContext();\\n\\n for (var i = 0; i < 2; i++) {\\n\\n mediaElement_player.push(null);\\n sourceNode_player.push(null);\\n source_player.push(null);\\n lGain_player.push(null);\\n mGain_player.push(null);\\n hGain_player.push(null);\\n sum_player.push(null);\\n volumeNodes.push(null);\\n\\n\\n mediaElement_player[i] = document.getElementById('jp_audio_' + i);\\n source_player[i] = context_player.createMediaElementSource(mediaElement_player[i]);\\n\\n initFrequencyQuality(i);\\n\\n // affects the ammount of treble in a sound - treble knob - atenuates the sounds below the 3600 frequencies\\n var lBand_player = context_player.createBiquadFilter();\\n lBand_player.type = \\\"lowshelf\\\";\\n lBand_player.frequency.value = bandSplit[1];\\n lBand_player.gain.value = gainDb;\\n\\n // affects the ammount of bass in a sound - bass knob - atenuates the sounds higher than 360 frequencies\\n var hBand_player = context_player.createBiquadFilter();\\n hBand_player.type = \\\"highshelf\\\";\\n hBand_player.frequency.value = bandSplit[0];\\n hBand_player.gain.value = gainDb;\\n\\n var hInvert_player = context_player.createGain();\\n hInvert_player.gain.value = -1.0;\\n\\n //Subtract low and high frequencies (add invert) from the source for the mid frequencies\\n var mBand_player = context_player.createGain();\\n\\n //or use picking\\n //mBand_player = context_player.createBiquadFilter();\\n //mBand_player.type = \\\"peaking\\\";\\n //mBand_player.frequency.value = bandSplit[0];\\n //mBand_player.gain.value = gainDb;\\n\\n var lInvert_player = context_player.createGain();\\n lInvert_player.gain.value = -1.0;\\n\\n sourceNode_player[i].connect(lBand_player);\\n sourceNode_player[i].connect(mBand_player);\\n sourceNode_player[i].connect(hBand_player);\\n\\n hBand_player.connect(hInvert_player);\\n lBand_player.connect(lInvert_player);\\n\\n hInvert_player.connect(mBand_player);\\n lInvert_player.connect(mBand_player);\\n\\n\\n lGain_player[i] = context_player.createGain();\\n mGain_player[i] = context_player.createGain();\\n hGain_player[i] = context_player.createGain();\\n\\n lBand_player.connect(lGain_player[i]);\\n mBand_player.connect(mGain_player[i]);\\n hBand_player.connect(hGain_player[i]);\\n\\n sum_player[i] = context_player.createGain();\\n lGain_player[i].connect(sum_player[i]);\\n mGain_player[i].connect(sum_player[i]);\\n hGain_player[i].connect(sum_player[i]);\\n\\n lGain_player[i].gain.value = 1;\\n mGain_player[i].gain.value = 1;\\n hGain_player[i].gain.value = 1;\\n\\n volumeNodes[i] = context_player.createGain();\\n sum_player[i].connect(volumeNodes[i]);\\n volumeNodes[i].connect(context_player.destination);\\n }\\n\\n //set volume\\n var x = 50 / 100;\\n // Use an equal-power crossfading curve:\\n var gain1 = Math.cos(x * 0.5 * Math.PI);\\n var gain2 = Math.cos((1.0 - x) * 0.5 * Math.PI);\\n volumeNodes[0].gain.value = gain1;\\n volumeNodes[1].gain.value = gain2;\\n\\n //create audio Recording node\\n audioRecordNode = context_player.createGain();\\n volumeNodes[0].connect(audioRecordNode);\\n volumeNodes[1].connect(audioRecordNode);\\n audioRecorder = new Recorder(audioRecordNode);\\n}\",\n \"function sha1_ft(t, b, c, d) {\\n if (t < 20) return (b & c) | ((~b) & d);\\n if (t < 40) return b ^ c ^ d;\\n if (t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function adapt(delta,numPoints,firstTime){var k=0;delta=firstTime?floor(delta/damp):delta>>1;delta+=floor(delta/numPoints);for(;delta>baseMinusTMin*tMax>>1;k+=base){delta=floor(delta/baseMinusTMin)}return floor(k+(baseMinusTMin+1)*delta/(delta+skew))}\",\n \"function setupAudioNodes(audioContext, drawWaveformFunction, drawSpectrumFunction, drawSpectrogramFunction, htmlIds, colorScale)\\n{\\n // Setup a script node\\n let scriptNode = audioContext.createScriptProcessor();\\n // Connect to destination\\n scriptNode.connect(audioContext.destination);\\n \\n // Setup an analyzer\\n let analyser = audioContext.createAnalyser();\\n analyser.smoothingTimeConstant = 0;\\n // Higher FFT size means more bins. More bins mean more points to graph.\\n // Also means each bin has a smaller range of frequencies so it's kind of like more precise.\\n analyser.fftSize = 2048 * 2;\\n \\n // Create a buffer source node\\n let sourceNode = audioContext.createBufferSource();\\n sourceNode.connect(analyser);\\n analyser.connect(scriptNode);\\n \\n sourceNode.connect(audioContext.destination);\\n \\n console.log(\\\"Sample rate: \\\" + audioContext.sampleRate + \\\" Hz\\\");\\n console.log(\\\"FFT size: \\\" + analyser.fftSize);\\n // FrequencyBinCount is half of FFT size\\n console.log(\\\"FrequencyBinCount: \\\" + analyser.frequencyBinCount);\\n \\n let frequencyPerBin = (audioContext.sampleRate / 2) / analyser.frequencyBinCount;\\n console.log(\\\"Each frequency bin represents \\\" + frequencyPerBin + \\\" Hz of range\\\");\\n console.log(\\\"frequencyData[0]\\\" + \\\" is the strength of frequencies from \\\" + (0 * frequencyPerBin) + \\\" Hz to \\\" + ((0 + 1)*frequencyPerBin) + \\\" Hz\\\");\\n console.log(\\\"frequencyData[1]\\\" + \\\" is the strength of frequencies from \\\" + (1 * frequencyPerBin) + \\\" Hz to \\\" + ((1 + 1)*frequencyPerBin) + \\\" Hz\\\");\\n console.log(\\\"frequencyData[2]\\\" + \\\" is the strength of frequencies from \\\" + (2 * frequencyPerBin) + \\\" Hz to \\\" + ((2 + 1)*frequencyPerBin) + \\\" Hz\\\");\\n console.log(\\\"frequencyData[\\\" + (analyser.frequencyBinCount - 1) + \\\"]\\\" + \\\" is the strength of frequencies from \\\" + (analyser.frequencyBinCount - 1) * frequencyPerBin + \\\" Hz to \\\" + (((analyser.frequencyBinCount - 1) + 1) * frequencyPerBin) + \\\" Hz\\\");\\n \\n // When the script node is called we use information from the analyzer node to draw\\n scriptNode.onaudioprocess = function()\\n {\\n let frequencyData = new Uint8Array(analyser.frequencyBinCount);\\n analyser.getByteFrequencyData(frequencyData);\\n \\n let timeDomainData = new Uint8Array(analyser.frequencyBinCount);\\n analyser.getByteTimeDomainData(timeDomainData);\\n \\n if (sourceNode.buffer !== null)\\n {\\n //console.log(frequencyData);\\n //console.log(timeDomainData);\\n drawWaveformFunction(timeDomainData, htmlIds.waveformCanvas, colorScale);\\n drawSpectrumFunction(frequencyData, htmlIds.spectrumCanvas, colorScale);\\n drawSpectrogramFunction(frequencyData, htmlIds.spectrogramCanvas, colorScale);\\n }\\n }\\n \\n return sourceNode;\\n}\",\n \"function draw(data)\\n{\\n var spectrum = []; // an array that will hold noise cancelled data\\n var i, x, L=0, ldata=0, nBins=0, binNum=0, c=0; // uint8\\n var minLvl, maxLvl; //uint\\n var level, y, sum; //int\\n var offsetIndex = 0;\\n var FFT_N = 128; //data.length;\\n\\n samplePos = 0;\\n // Remove noise and apply EQ levels\\n for(x=0; x < FFT_N/2; x++ ) {\\n L = noise[x];\\n spectrum[x] = data[x+ offsetIndex];\\n if ( spectrum[x] < L ) {\\n spectrum[x] = 0;\\n } else {\\n spectrum[x] = ((spectrum[x] - L) * (256 - eq[x] >> peakHeight));\\n }\\n }\\n //fill colors first, then we will erase idle sections.\\n for(i=0; i < totalColumns; i++) {\\n client.setPixelColor(i, LED_RED); // row 0, RED\\n client.setPixelColor(8 + i, LED_BLUE); // Rwo 1, Blue\\n client.setPixelColor(16+ i, LED_BLUE); // Row 2, Blue\\n client.setPixelColor(24+ i, LED_GREEN); // Row 3, Green\\n client.setPixelColor(32+ i, LED_GREEN); // Row 4, Green\\n }\\n\\n for(x=0; x < totalColumns; x++ ) {\\n ldata = colData[x];\\n nBins = ldata[0] + 2;\\n binNum = ldata[1];\\n for(sum=0, i=2; i < nBins; i++ ) {\\n sum += spectrum[binNum++] * ldata[i]; // Weighted\\n colDiv[x] += data[x];\\n }\\n col[x][colCount] = sum / colDiv[x]; // Average\\n minLvl = maxLvl = col[x][0];\\n for(i=1; i < totalFrames; i++ ) {\\n if(col[x][i] < minLvl) {\\n minLvl = col[x][i];\\n } else if( col[x][i] > maxLvl ) {\\n maxLvl = col[x][i];\\n }\\n }\\n // minLvl and maxLvl indicate the extents of the FFT output, used\\n // for vertically scaling the output graph (so it looks interesting\\n // regardless of volume level). If they're too close together though\\n // (e.g. at very low volume levels) the graph becomes super coarse\\n // and 'jumpy'...so keep some minimum distance between them (this\\n // also lets the graph go to zero when no sound is playing):\\n\\n if( maxLvl-minLvl < peakHeight) {\\n maxLvl = minLvl + peakHeight;\\n }\\n minLvAvg[x] = (minLvAvg[x] * 7 + minLvl) >> 3; // Dampen min/max levels\\n maxLvAvg[x] = (maxLvAvg[x] * 7 + maxLvl) >> 3; // fake rolling average\\n // Second fixed-point scale based on dynamic min/max levels\\n level = 10 * (col[x][colCount] - minLvAvg[x]) / parseInt(maxLvAvg[x] - minLvAvg[x]);\\n // clip output and convert to byte\\n if( level < 0) { c = 0; }\\n else if ( level > peakOffTop ) { c = peakOffTop; } // Allow dot to go a few pixels off the top\\n else { c = parseInt(level); }\\n\\n if( c > peak[x] ) { peak[x] = c; } // keep dot on top\\n if(peak[x] < 0 ) { // empty the column\\n clearColumnLeds(x,peakHeight);\\n //continue;\\n } else if(c < peakHeight ) { // empty partial column\\n clearColumnLeds(x, peakHeight - c);\\n }\\n // the peak dot color varies but doesn't necessarily match\\n // the three screen regions.. yellow has a little more influence.\\n y = peakHeight - peak[x];\\n\\n /******************** DO NOT DELETE **********************/\\n /* Save this section for a high Peak Array of LEDs - It is not so useful for 5 pixel High\\n if( y < 1 ) { setColumnRowPixelColor(x,y, LED_RED); }\\n else if( y < 5 ) { setColumnRowPixelColor(x,y, LED_BLUE); }\\n else { setColumnRowPixelColor(x,y, LED_GREEN); }\\n */\\n /******************** DO NOT DELETE **********************/\\n\\n }\\n client.writePixels();\\n\\n /******************** Important **************************/\\n // Every third frame, make the peak pixels drop by 1:\\n if ( ++dotCount >= 3 ) {\\n dotCount = 0;\\n // reset Averages, col dividers and peaks\\n for ( i = 0; i < totalColumns; i++ ) {\\n minLvAvg[i] = 0;\\n maxLvAvg[i] = 512;\\n colDiv[i] = 0;\\n //peak[i] = 0; // We are dropping the peaks below\\n }\\n for ( x = 0; x < peakHeight; x++ ) {\\n peak[x] -= (peak[x] > 0) ? 1 : 0; // if peak is above 0, then subtract 1\\n }\\n // rotate hue over LEDs\\n LED_RED = OPC.rotateColor(1, LED_RED);\\n LED_BLUE = OPC.rotateColor(1, LED_BLUE);\\n LED_GREEN = OPC.rotateColor(1, LED_GREEN);\\n }\\n // Adjust the Frame Count\\n if ( ++colCount >= totalFrames ) {\\n colCount = 0;\\n }\\n\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\",\n \"function sha1_ft(t, b, c, d)\\n{\\n if(t < 20) return (b & c) | ((~b) & d);\\n if(t < 40) return b ^ c ^ d;\\n if(t < 60) return (b & c) | (b & d) | (c & d);\\n return b ^ c ^ d;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.65954375","0.6168972","0.6044958","0.6022759","0.591924","0.58853126","0.5843347","0.577806","0.57772064","0.5703021","0.562801","0.55890924","0.5570078","0.5464318","0.54534","0.5339202","0.5326124","0.5318228","0.53027326","0.52718914","0.52644837","0.5250019","0.51002055","0.5096984","0.5089478","0.5085867","0.50818896","0.5062489","0.50592065","0.5053552","0.50457776","0.50395507","0.50318575","0.49991494","0.4997923","0.49906737","0.49865484","0.49865484","0.49596334","0.49486697","0.49455962","0.49007112","0.48839712","0.48683113","0.48617876","0.48600242","0.48516387","0.48220733","0.48169217","0.4816723","0.48098448","0.48025116","0.48025116","0.48025116","0.48025116","0.47310892","0.47233245","0.47233245","0.4707004","0.47061676","0.47017288","0.47017288","0.47017288","0.47017288","0.47017288","0.4687284","0.46807086","0.46659926","0.46513113","0.46496043","0.46476468","0.46458715","0.46238944","0.46099308","0.45991912","0.45899886","0.4589064","0.4589064","0.45789668","0.4576599","0.45682994","0.45675915","0.45629087","0.45546445","0.45448613","0.45376247","0.45360956","0.45337763","0.45290184","0.45245162","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879","0.4517879"],"string":"[\n \"0.65954375\",\n \"0.6168972\",\n \"0.6044958\",\n \"0.6022759\",\n \"0.591924\",\n \"0.58853126\",\n \"0.5843347\",\n \"0.577806\",\n \"0.57772064\",\n \"0.5703021\",\n \"0.562801\",\n \"0.55890924\",\n \"0.5570078\",\n \"0.5464318\",\n \"0.54534\",\n \"0.5339202\",\n \"0.5326124\",\n \"0.5318228\",\n \"0.53027326\",\n \"0.52718914\",\n \"0.52644837\",\n \"0.5250019\",\n \"0.51002055\",\n \"0.5096984\",\n \"0.5089478\",\n \"0.5085867\",\n \"0.50818896\",\n \"0.5062489\",\n \"0.50592065\",\n \"0.5053552\",\n \"0.50457776\",\n \"0.50395507\",\n \"0.50318575\",\n \"0.49991494\",\n \"0.4997923\",\n \"0.49906737\",\n \"0.49865484\",\n \"0.49865484\",\n \"0.49596334\",\n \"0.49486697\",\n \"0.49455962\",\n \"0.49007112\",\n \"0.48839712\",\n \"0.48683113\",\n \"0.48617876\",\n \"0.48600242\",\n \"0.48516387\",\n \"0.48220733\",\n \"0.48169217\",\n \"0.4816723\",\n \"0.48098448\",\n \"0.48025116\",\n \"0.48025116\",\n \"0.48025116\",\n \"0.48025116\",\n \"0.47310892\",\n \"0.47233245\",\n \"0.47233245\",\n \"0.4707004\",\n \"0.47061676\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.47017288\",\n \"0.4687284\",\n \"0.46807086\",\n \"0.46659926\",\n \"0.46513113\",\n \"0.46496043\",\n \"0.46476468\",\n \"0.46458715\",\n \"0.46238944\",\n \"0.46099308\",\n \"0.45991912\",\n \"0.45899886\",\n \"0.4589064\",\n \"0.4589064\",\n \"0.45789668\",\n \"0.4576599\",\n \"0.45682994\",\n \"0.45675915\",\n \"0.45629087\",\n \"0.45546445\",\n \"0.45448613\",\n \"0.45376247\",\n \"0.45360956\",\n \"0.45337763\",\n \"0.45290184\",\n \"0.45245162\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\",\n \"0.4517879\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":80785,"cells":{"query":{"kind":"string","value":"Class: Buffer ============= The Buffer constructor returns instances of `Uint8Array` that are augmented with function properties for all the node `Buffer` API functions. We use `Uint8Array` so that square bracket notation works as expected it returns a single octet. By augmenting the instances, we can avoid modifying the `Uint8Array` prototype."},"document":{"kind":"string","value":"function Buffer (arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\n return new Buffer(arg)\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0\n this.parent = undefined\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg)\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n }\n\n // Unusual.\n return fromObject(this, arg)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0\n\t this.parent = undefined\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding) {\n var self = this\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\n\n var type = typeof subject\n var length\n\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) {\n // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\n kMaxLength.toString(16) + ' bytes')\n }\n\n if (length < 0) length = 0\n else length >>>= 0 // coerce to uint32\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++) {\n self[i] = subject.readUInt8(i)\n }\n } else {\n for (i = 0; i < length; i++) {\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\n\n return self\n}","function Buffer(arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n\t return new Buffer(arg);\n\t }\n\t\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0;\n\t this.parent = undefined;\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg);\n\t }\n\t\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n\t }\n\t\n\t // Unusual.\n\t return fromObject(this, arg);\n\t}","function Buffer(arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n\t return new Buffer(arg);\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0;\n\t this.parent = undefined;\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg);\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg);\n\t}","function Buffer(arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n\t return new Buffer(arg);\n\t }\n\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t this.length = 0;\n\t this.parent = undefined;\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg);\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg);\n\t}","function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\n\tif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}","function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}","function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}","function Buffer (arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\n return new Buffer(arg)\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0\n this.parent = undefined\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg)\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n }\n\n // Unusual.\n return fromObject(this, arg)\n }","function Buffer(arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1)\n return new Buffer(arg, arguments[1]);\n return new Buffer(arg);\n }\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0;\n this.parent = undefined;\n }\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg);\n }\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n }\n // Unusual.\n return fromObject(this, arg);\n }","function Buffer(arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\n return new Buffer(arg)\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0\n this.parent = undefined\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg)\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n }\n\n // Unusual.\n return fromObject(this, arg)\n }","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function BufferToArrayBuffer () {\n return (new Buffer(this)).buffer\n}","function Buffer(arg){if(!(this instanceof Buffer)){ // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\nif(arguments.length>1)return new Buffer(arg,arguments[1]);return new Buffer(arg);}if(!Buffer.TYPED_ARRAY_SUPPORT){this.length=0;this.parent=undefined;} // Common case.\nif(typeof arg==='number'){return fromNumber(this,arg);} // Slightly less common case.\nif(typeof arg==='string'){return fromString(this,arg,arguments.length>1?arguments[1]:'utf8');} // Unusual.\nreturn fromObject(this,arg);}","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n \n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer(arg) {\n if (!(this instanceof Buffer)) {\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n if (arguments.length > 1) return new Buffer(arg, arguments[1]);\n return new Buffer(arg);\n }\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n this.length = 0;\n this.parent = undefined;\n }\n\n // Common case.\n if (typeof arg === 'number') {\n return fromNumber(this, arg);\n }\n\n // Slightly less common case.\n if (typeof arg === 'string') {\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\n }\n\n // Unusual.\n return fromObject(this, arg);\n }","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\t\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n }","function Buffer (arg) {\n\t\t if (!(this instanceof Buffer)) {\n\t\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t\t return new Buffer(arg)\n\t\t }\n\t\t\n\t\t this.length = 0\n\t\t this.parent = undefined\n\t\t\n\t\t // Common case.\n\t\t if (typeof arg === 'number') {\n\t\t return fromNumber(this, arg)\n\t\t }\n\t\t\n\t\t // Slightly less common case.\n\t\t if (typeof arg === 'string') {\n\t\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t\t }\n\t\t\n\t\t // Unusual.\n\t\t return fromObject(this, arg)\n\t\t}","function createByteContainer() {\n if (HAS_BUFFER)\n return new Buffer(0);\n\n return new Uint8Array();\n }","function createByteContainer() {\n if (HAS_BUFFER)\n return new Buffer(0);\n\n return new Uint8Array();\n }","function Buffer (subject, encoding, noZero) {\n if (!(this instanceof Buffer))\n return new Buffer(subject, encoding, noZero)\n\n var type = typeof subject\n\n // Find the length\n var length\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) { // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data))\n subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength)\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\n\n if (length < 0)\n length = 0\n else\n length >>>= 0 // Coerce to uint32.\n\n var self = this\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n /*eslint-disable consistent-this */\n self = Buffer._augment(new Uint8Array(length))\n /*eslint-enable consistent-this */\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++)\n self[i] = subject.readUInt8(i)\n } else {\n for (i = 0; i < length; i++)\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize)\n self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding, noZero) {\n if (!(this instanceof Buffer))\n return new Buffer(subject, encoding, noZero)\n\n var type = typeof subject\n\n // Find the length\n var length\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) { // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data))\n subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength)\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\n\n if (length < 0)\n length = 0\n else\n length >>>= 0 // Coerce to uint32.\n\n var self = this\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n /*eslint-disable consistent-this */\n self = Buffer._augment(new Uint8Array(length))\n /*eslint-enable consistent-this */\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++)\n self[i] = subject.readUInt8(i)\n } else {\n for (i = 0; i < length; i++)\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize)\n self.parent = rootParent\n\n return self\n}","function Buffer (subject, encoding, noZero) {\n if (!(this instanceof Buffer))\n return new Buffer(subject, encoding, noZero)\n\n var type = typeof subject\n\n // Find the length\n var length\n if (type === 'number') {\n length = +subject\n } else if (type === 'string') {\n length = Buffer.byteLength(subject, encoding)\n } else if (type === 'object' && subject !== null) { // assume object is array-like\n if (subject.type === 'Buffer' && isArray(subject.data))\n subject = subject.data\n length = +subject.length\n } else {\n throw new TypeError('must start with number, buffer, array or string')\n }\n\n if (length > kMaxLength)\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\n\n if (length < 0)\n length = 0\n else\n length >>>= 0 // Coerce to uint32.\n\n var self = this\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Preferred: Return an augmented `Uint8Array` instance for best performance\n /*eslint-disable consistent-this */\n self = Buffer._augment(new Uint8Array(length))\n /*eslint-enable consistent-this */\n } else {\n // Fallback: Return THIS instance of Buffer (created by `new`)\n self.length = length\n self._isBuffer = true\n }\n\n var i\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\n // Speed optimization -- use set if we're copying from a typed array\n self._set(subject)\n } else if (isArrayish(subject)) {\n // Treat array-ish objects as a byte array\n if (Buffer.isBuffer(subject)) {\n for (i = 0; i < length; i++)\n self[i] = subject.readUInt8(i)\n } else {\n for (i = 0; i < length; i++)\n self[i] = ((subject[i] % 256) + 256) % 256\n }\n } else if (type === 'string') {\n self.write(subject, 0, encoding)\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\n for (i = 0; i < length; i++) {\n self[i] = 0\n }\n }\n\n if (length > 0 && length <= Buffer.poolSize)\n self.parent = rootParent\n\n return self\n}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg) {\n\t if (!(this instanceof Buffer)) {\n\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\n\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\n\t return new Buffer(arg)\n\t }\n\n\t this.length = 0\n\t this.parent = undefined\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t return fromNumber(this, arg)\n\t }\n\n\t // Slightly less common case.\n\t if (typeof arg === 'string') {\n\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\n\t }\n\n\t // Unusual.\n\t return fromObject(this, arg)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}","function Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}"],"string":"[\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding) {\\n var self = this\\n if (!(self instanceof Buffer)) return new Buffer(subject, encoding)\\n\\n var type = typeof subject\\n var length\\n\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) {\\n // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength) {\\n throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' +\\n kMaxLength.toString(16) + ' bytes')\\n }\\n\\n if (length < 0) length = 0\\n else length >>>= 0 // coerce to uint32\\n\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++) {\\n self[i] = subject.readUInt8(i)\\n }\\n } else {\\n for (i = 0; i < length; i++) {\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer(arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n\\t return new Buffer(arg);\\n\\t }\\n\\t\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0;\\n\\t this.parent = undefined;\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg);\\n\\t }\\n\\t\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n\\t }\\n\\t\\n\\t // Unusual.\\n\\t return fromObject(this, arg);\\n\\t}\",\n \"function Buffer(arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n\\t return new Buffer(arg);\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0;\\n\\t this.parent = undefined;\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg);\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg);\\n\\t}\",\n \"function Buffer(arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n\\t return new Buffer(arg);\\n\\t }\\n\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n\\t this.length = 0;\\n\\t this.parent = undefined;\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg);\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg);\\n\\t}\",\n \"function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\\n\\tif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}\",\n \"function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}\",\n \"function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.\\nif(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}\",\n \"function Buffer (arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n return new Buffer(arg)\\n }\\n\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0\\n this.parent = undefined\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg)\\n }\\n\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n }\\n\\n // Unusual.\\n return fromObject(this, arg)\\n }\",\n \"function Buffer(arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1)\\n return new Buffer(arg, arguments[1]);\\n return new Buffer(arg);\\n }\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0;\\n this.parent = undefined;\\n }\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg);\\n }\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n }\\n // Unusual.\\n return fromObject(this, arg);\\n }\",\n \"function Buffer(arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n return new Buffer(arg)\\n }\\n\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0\\n this.parent = undefined\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg)\\n }\\n\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n }\\n\\n // Unusual.\\n return fromObject(this, arg)\\n }\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function BufferToArrayBuffer () {\\n return (new Buffer(this)).buffer\\n}\",\n \"function Buffer(arg){if(!(this instanceof Buffer)){ // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\nif(arguments.length>1)return new Buffer(arg,arguments[1]);return new Buffer(arg);}if(!Buffer.TYPED_ARRAY_SUPPORT){this.length=0;this.parent=undefined;} // Common case.\\nif(typeof arg==='number'){return fromNumber(this,arg);} // Slightly less common case.\\nif(typeof arg==='string'){return fromString(this,arg,arguments.length>1?arguments[1]:'utf8');} // Unusual.\\nreturn fromObject(this,arg);}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n \\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer(arg) {\\n if (!(this instanceof Buffer)) {\\n // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n if (arguments.length > 1) return new Buffer(arg, arguments[1]);\\n return new Buffer(arg);\\n }\\n\\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\\n this.length = 0;\\n this.parent = undefined;\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n return fromNumber(this, arg);\\n }\\n\\n // Slightly less common case.\\n if (typeof arg === 'string') {\\n return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8');\\n }\\n\\n // Unusual.\\n return fromObject(this, arg);\\n }\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\t\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n return new Buffer(arg, encodingOrOffset, length)\\n }\\n\\n // Common case.\\n if (typeof arg === 'number') {\\n if (typeof encodingOrOffset === 'string') {\\n throw new Error(\\n 'If encoding is specified then the first argument must be a string'\\n )\\n }\\n return allocUnsafe(this, arg)\\n }\\n return from(this, arg, encodingOrOffset, length)\\n }\",\n \"function Buffer (arg) {\\n\\t\\t if (!(this instanceof Buffer)) {\\n\\t\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t\\t return new Buffer(arg)\\n\\t\\t }\\n\\t\\t\\n\\t\\t this.length = 0\\n\\t\\t this.parent = undefined\\n\\t\\t\\n\\t\\t // Common case.\\n\\t\\t if (typeof arg === 'number') {\\n\\t\\t return fromNumber(this, arg)\\n\\t\\t }\\n\\t\\t\\n\\t\\t // Slightly less common case.\\n\\t\\t if (typeof arg === 'string') {\\n\\t\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t\\t }\\n\\t\\t\\n\\t\\t // Unusual.\\n\\t\\t return fromObject(this, arg)\\n\\t\\t}\",\n \"function createByteContainer() {\\n if (HAS_BUFFER)\\n return new Buffer(0);\\n\\n return new Uint8Array();\\n }\",\n \"function createByteContainer() {\\n if (HAS_BUFFER)\\n return new Buffer(0);\\n\\n return new Uint8Array();\\n }\",\n \"function Buffer (subject, encoding, noZero) {\\n if (!(this instanceof Buffer))\\n return new Buffer(subject, encoding, noZero)\\n\\n var type = typeof subject\\n\\n // Find the length\\n var length\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) { // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data))\\n subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength)\\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\\n\\n if (length < 0)\\n length = 0\\n else\\n length >>>= 0 // Coerce to uint32.\\n\\n var self = this\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n /*eslint-disable consistent-this */\\n self = Buffer._augment(new Uint8Array(length))\\n /*eslint-enable consistent-this */\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++)\\n self[i] = subject.readUInt8(i)\\n } else {\\n for (i = 0; i < length; i++)\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize)\\n self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding, noZero) {\\n if (!(this instanceof Buffer))\\n return new Buffer(subject, encoding, noZero)\\n\\n var type = typeof subject\\n\\n // Find the length\\n var length\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) { // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data))\\n subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength)\\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\\n\\n if (length < 0)\\n length = 0\\n else\\n length >>>= 0 // Coerce to uint32.\\n\\n var self = this\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n /*eslint-disable consistent-this */\\n self = Buffer._augment(new Uint8Array(length))\\n /*eslint-enable consistent-this */\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++)\\n self[i] = subject.readUInt8(i)\\n } else {\\n for (i = 0; i < length; i++)\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize)\\n self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (subject, encoding, noZero) {\\n if (!(this instanceof Buffer))\\n return new Buffer(subject, encoding, noZero)\\n\\n var type = typeof subject\\n\\n // Find the length\\n var length\\n if (type === 'number') {\\n length = +subject\\n } else if (type === 'string') {\\n length = Buffer.byteLength(subject, encoding)\\n } else if (type === 'object' && subject !== null) { // assume object is array-like\\n if (subject.type === 'Buffer' && isArray(subject.data))\\n subject = subject.data\\n length = +subject.length\\n } else {\\n throw new TypeError('must start with number, buffer, array or string')\\n }\\n\\n if (length > kMaxLength)\\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\\n 'size: 0x' + kMaxLength.toString(16) + ' bytes')\\n\\n if (length < 0)\\n length = 0\\n else\\n length >>>= 0 // Coerce to uint32.\\n\\n var self = this\\n if (Buffer.TYPED_ARRAY_SUPPORT) {\\n // Preferred: Return an augmented `Uint8Array` instance for best performance\\n /*eslint-disable consistent-this */\\n self = Buffer._augment(new Uint8Array(length))\\n /*eslint-enable consistent-this */\\n } else {\\n // Fallback: Return THIS instance of Buffer (created by `new`)\\n self.length = length\\n self._isBuffer = true\\n }\\n\\n var i\\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {\\n // Speed optimization -- use set if we're copying from a typed array\\n self._set(subject)\\n } else if (isArrayish(subject)) {\\n // Treat array-ish objects as a byte array\\n if (Buffer.isBuffer(subject)) {\\n for (i = 0; i < length; i++)\\n self[i] = subject.readUInt8(i)\\n } else {\\n for (i = 0; i < length; i++)\\n self[i] = ((subject[i] % 256) + 256) % 256\\n }\\n } else if (type === 'string') {\\n self.write(subject, 0, encoding)\\n } else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {\\n for (i = 0; i < length; i++) {\\n self[i] = 0\\n }\\n }\\n\\n if (length > 0 && length <= Buffer.poolSize)\\n self.parent = rootParent\\n\\n return self\\n}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg) {\\n\\t if (!(this instanceof Buffer)) {\\n\\t // Avoid going through an ArgumentsAdaptorTrampoline in the common case.\\n\\t if (arguments.length > 1) return new Buffer(arg, arguments[1])\\n\\t return new Buffer(arg)\\n\\t }\\n\\n\\t this.length = 0\\n\\t this.parent = undefined\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t return fromNumber(this, arg)\\n\\t }\\n\\n\\t // Slightly less common case.\\n\\t if (typeof arg === 'string') {\\n\\t return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')\\n\\t }\\n\\n\\t // Unusual.\\n\\t return fromObject(this, arg)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\",\n \"function Buffer (arg, encodingOrOffset, length) {\\n\\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\\n\\t return new Buffer(arg, encodingOrOffset, length)\\n\\t }\\n\\n\\t // Common case.\\n\\t if (typeof arg === 'number') {\\n\\t if (typeof encodingOrOffset === 'string') {\\n\\t throw new Error(\\n\\t 'If encoding is specified then the first argument must be a string'\\n\\t )\\n\\t }\\n\\t return allocUnsafe(this, arg)\\n\\t }\\n\\t return from(this, arg, encodingOrOffset, length)\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7387608","0.7387608","0.7387608","0.7387608","0.7387608","0.7387608","0.7387608","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73838997","0.73214823","0.73214823","0.73214823","0.73214823","0.73214823","0.7310611","0.7306889","0.7306889","0.7272222","0.7244172","0.7244172","0.71993977","0.71977997","0.71967536","0.71846634","0.71846634","0.71846634","0.71846634","0.71622974","0.71517247","0.71415156","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.7121521","0.71168745","0.71168745","0.71168745","0.7110093","0.7100295","0.7100295","0.70932084","0.70932084","0.70932084","0.7091139","0.7091139","0.7091139","0.7091139","0.7091139","0.7091139","0.70889336","0.70889336"],"string":"[\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.7387608\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73838997\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.73214823\",\n \"0.7310611\",\n \"0.7306889\",\n \"0.7306889\",\n \"0.7272222\",\n \"0.7244172\",\n \"0.7244172\",\n \"0.71993977\",\n \"0.71977997\",\n \"0.71967536\",\n \"0.71846634\",\n \"0.71846634\",\n \"0.71846634\",\n \"0.71846634\",\n \"0.71622974\",\n \"0.71517247\",\n \"0.71415156\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.7121521\",\n \"0.71168745\",\n \"0.71168745\",\n \"0.71168745\",\n \"0.7110093\",\n \"0.7100295\",\n \"0.7100295\",\n \"0.70932084\",\n \"0.70932084\",\n \"0.70932084\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.7091139\",\n \"0.70889336\",\n \"0.70889336\"\n]"},"document_score":{"kind":"string","value":"0.71254957"},"document_rank":{"kind":"string","value":"65"}}},{"rowIdx":80786,"cells":{"query":{"kind":"string","value":"Duplicate of fromArray() to keep fromArray() monomorphic."},"document":{"kind":"string","value":"function fromTypedArray (that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function fromArray(as) {\n // For some reason, TypeScript does not infer this type correctly\n var b = build;\n var f = as.reduce(b, []);\n return f;\n }","function __spreadArray(to, from) {\n for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\n to[j] = from[i];\n return to;\n }","function cloneArrFrom(arr) {\n let newArr = Array.from(arr);\n return newArr;\n}","function fromTypedArray(that, array) {\n var length = checked(array.length) | 0;\n that = allocate(that, length);\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255;\n }\n return that;\n }","function fromTypedArray(that, array) {\n var length = checked(array.length) | 0;\n that = allocate(that, length);\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255;\n }\n return that;\n }","function fromTypedArray(that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n }","function copyArray() {\n return new Array(...array);\n}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray(that, array) {\n\t var length = checked(array.length) | 0;\n\t that = allocate(that, length);\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255;\n\t }\n\t return that;\n\t}","function fromTypedArray (that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n }","function fromTypedArray (that, array) {\n var length = checked(array.length) | 0\n that = allocate(that, length)\n // Truncating the elements is probably not what people expect from typed\n // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n // of the old Buffer constructor.\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n }","function fromArray(as) {\n return as.reduce(build, {});\n }","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","function fromTypedArray (that, array) {\n\t var length = checked(array.length) | 0\n\t that = allocate(that, length)\n\t // Truncating the elements is probably not what people expect from typed\n\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t // of the old Buffer constructor.\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}","static fromArray(arr) {\n return Matrix.map(new Matrix(arr.length, 1), (_, i) => arr[i]);\n }","function fromTypedArray (that, array) {\n\t\t var length = checked(array.length) | 0\n\t\t that = allocate(that, length)\n\t\t // Truncating the elements is probably not what people expect from typed\n\t\t // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior\n\t\t // of the old Buffer constructor.\n\t\t for (var i = 0; i < length; i += 1) {\n\t\t that[i] = array[i] & 255\n\t\t }\n\t\t return that\n\t\t}","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }","copyArray(arr) {\n\t\treturn Array.from(arr).map((val, ind) => Array.from(arr[ind]));\n\t}","function _toConsumableArray(arr){if(Array.isArray(arr)){for(var i=0,arr2=Array(arr.length);i
