-
Notifications
You must be signed in to change notification settings - Fork 105
/
Copy pathgif.worker.js.map
executable file
·1 lines (1 loc) · 54 KB
/
gif.worker.js.map
1
{"version":3,"sources":["node_modules/browser-pack/_prelude.js","src/GIFEncoder.js","src/LZWEncoder.js","src/TypedNeuQuant.js","src/gif.worker.coffee"],"names":["e","t","n","r","s","o","u","a","require","i","f","Error","code","l","exports","call","length","1","module","NeuQuant","LZWEncoder","ByteArray","this","page","pages","newPage","pageSize","charMap","String","fromCharCode","prototype","Uint8Array","cursor","getData","rv","p","writeByte","val","writeUTFBytes","string","charCodeAt","writeBytes","array","offset","GIFEncoder","width","height","transparent","transIndex","repeat","delay","image","pixels","indexedPixels","colorDepth","colorTab","neuQuant","usedEntry","Array","palSize","dispose","firstFrame","sample","dither","globalPalette","out","setDelay","milliseconds","Math","round","setFrameRate","fps","setDispose","disposalCode","setRepeat","setTransparent","color","addFrame","imageData","slice","getImagePixels","analyzePixels","writeLSD","writePalette","writeNetscapeExt","writeGraphicCtrlExt","writeImageDesc","writePixels","finish","setQuality","quality","setDither","setGlobalPalette","palette","getGlobalPalette","writeHeader","buildColormap","getColormap","ditherPixels","replace","match","indexPixels","findClosest","imgq","nPix","k","j","index","findClosestRGB","kernel","serpentine","kernels","FalseFloydSteinberg","FloydSteinberg","Stucki","Atkinson","ds","data","direction","y","x","xend","idx","r1","g1","b1","r2","g2","b2","er","eg","eb","end","x1","y1","d","max","min","c","used","g","b","lookupRGB","minpos","dmin","len","dr","dg","db","w","h","srcPos","count","transp","disp","writeShort","pValue","enc","encode","stream","EOF","BITS","HSIZE","masks","initCodeSize","accum","htab","Int32Array","codetab","cur_accum","cur_bits","a_count","free_ent","maxcode","clear_flg","g_init_bits","ClearCode","EOFCode","char_out","outs","flush_char","cl_block","cl_hash","output","hsize","compress","init_bits","fcode","ent","hsize_reg","hshift","n_bits","MAXCODE","nextPixel","outer_loop","remaining","curPixel","pix","ncycles","netsize","maxnetpos","netbiasshift","intbiasshift","intbias","gammashift","gamma","betashift","beta","betagamma","initrad","radiusbiasshift","radiusbias","initradius","radiusdec","alphabiasshift","initalpha","alphadec","radbiasshift","radbias","alpharadbshift","alpharadbias","prime1","prime2","prime3","prime4","minpicturebytes","samplefac","network","netindex","bias","freq","radpower","init","v","Float64Array","unbiasnet","altersingle","alpha","alterneigh","radius","lo","abs","hi","m","contest","bestd","bestbiasd","bestpos","bestbiaspos","dist","biasdist","betafreq","inxbuild","q","smallpos","smallval","previouscol","startpos","inxsearch","best","learn","lengthcount","samplepixels","delta","rad","step","map","renderFrame","frame","encoder","transfer","last","constructor","canTransfer","ref","results","buffer","self","postMessage","onmessage","event"],"mappings":";CAAA,QAAAA,GAAAC,EAAAC,EAAAC,GAAA,QAAAC,GAAAC,EAAAC,GAAA,IAAAJ,EAAAG,GAAA,CAAA,IAAAJ,EAAAI,GAAA,CAAA,GAAAE,SAAAC,UAAA,YAAAA,OAAA,KAAAF,GAAAC,EAAA,MAAAA,GAAAF,GAAA,EAAA,IAAAI,EAAA,MAAAA,GAAAJ,GAAA,EAAA,IAAAK,GAAA,GAAAC,OAAA,uBAAAN,EAAA,IAAA,MAAAK,GAAAE,KAAA,mBAAAF,EAAA,GAAAG,GAAAX,EAAAG,IAAAS,WAAAb,GAAAI,GAAA,GAAAU,KAAAF,EAAAC,QAAA,SAAAd,GAAA,GAAAE,GAAAD,EAAAI,GAAA,GAAAL,EAAA,OAAAI,GAAAF,EAAAA,EAAAF,IAAAa,EAAAA,EAAAC,QAAAd,EAAAC,EAAAC,EAAAC,GAAA,MAAAD,GAAAG,GAAAS,QAAA,GAAAL,SAAAD,UAAA,YAAAA,OAAA,KAAA,GAAAH,GAAA,EAAAA,EAAAF,EAAAa,OAAAX,IAAAD,EAAAD,EAAAE,GAAA,OAAAD,MAAAa,GAAA,SAAAT,QAAAU,OAAAJ,SCSA,GAAAK,UAAAX,QAAA,qBACA,IAAAY,YAAAZ,QAAA,kBAEA,SAAAa,aACAC,KAAAC,MAAA,CACAD,MAAAE,QACAF,MAAAG,UAGAJ,UAAAK,SAAA,IACAL,WAAAM,UAEA,KAAA,GAAAlB,GAAA,EAAAA,EAAA,IAAAA,IACAY,UAAAM,QAAAlB,GAAAmB,OAAAC,aAAApB,EAEAY,WAAAS,UAAAL,QAAA,WACAH,KAAAE,QAAAF,KAAAC,MAAA,GAAAQ,YAAAV,UAAAK,SACAJ,MAAAU,OAAA,EAGAX,WAAAS,UAAAG,QAAA,WACA,GAAAC,IAAA,EACA,KAAA,GAAAC,GAAA,EAAAA,EAAAb,KAAAE,MAAAR,OAAAmB,IAAA,CACA,IAAA,GAAA1B,GAAA,EAAAA,EAAAY,UAAAK,SAAAjB,IAAA,CACAyB,IAAAb,UAAAM,QAAAL,KAAAE,MAAAW,GAAA1B,KAGA,MAAAyB,IAGAb,WAAAS,UAAAM,UAAA,SAAAC,KACA,GAAAf,KAAAU,QAAAX,UAAAK,SAAAJ,KAAAG,SACAH,MAAAE,MAAAF,KAAAC,MAAAD,KAAAU,UAAAK,IAGAhB,WAAAS,UAAAQ,cAAA,SAAAC,QACA,IAAA,GAAA1B,GAAA0B,OAAAvB,OAAAP,EAAA,EAAAA,EAAAI,EAAAJ,IACAa,KAAAc,UAAAG,OAAAC,WAAA/B,IAGAY,WAAAS,UAAAW,WAAA,SAAAC,MAAAC,OAAA3B,QACA,IAAA,GAAAH,GAAAG,QAAA0B,MAAA1B,OAAAP,EAAAkC,QAAA,EAAAlC,EAAAI,EAAAJ,IACAa,KAAAc,UAAAM,MAAAjC,IAGA,SAAAmC,YAAAC,MAAAC,QAEAxB,KAAAuB,QAAAA,KACAvB,MAAAwB,SAAAA,MAGAxB,MAAAyB,YAAA,IAGAzB,MAAA0B,WAAA,CAGA1B,MAAA2B,QAAA,CAGA3B,MAAA4B,MAAA,CAEA5B,MAAA6B,MAAA,IACA7B,MAAA8B,OAAA,IACA9B,MAAA+B,cAAA,IACA/B,MAAAgC,WAAA,IACAhC,MAAAiC,SAAA,IACAjC,MAAAkC,SAAA,IACAlC,MAAAmC,UAAA,GAAAC,MACApC,MAAAqC,QAAA,CACArC,MAAAsC,SAAA,CACAtC,MAAAuC,WAAA,IACAvC,MAAAwC,OAAA,EACAxC,MAAAyC,OAAA,KACAzC,MAAA0C,cAAA,KAEA1C,MAAA2C,IAAA,GAAA5C,WAOAuB,WAAAd,UAAAoC,SAAA,SAAAC,cACA7C,KAAA4B,MAAAkB,KAAAC,MAAAF,aAAA,IAMAvB,YAAAd,UAAAwC,aAAA,SAAAC,KACAjD,KAAA4B,MAAAkB,KAAAC,MAAA,IAAAE,KASA3B,YAAAd,UAAA0C,WAAA,SAAAC,cACA,GAAAA,cAAA,EAAAnD,KAAAsC,QAAAa,aAcA7B,YAAAd,UAAA4C,UAAA,SAAAzB,QACA3B,KAAA2B,OAAAA,OAUAL,YAAAd,UAAA6C,eAAA,SAAAC,OACAtD,KAAAyB,YAAA6B,MAQAhC,YAAAd,UAAA+C,SAAA,SAAAC,WACAxD,KAAA6B,MAAA2B,SAEAxD,MAAAiC,SAAAjC,KAAA0C,eAAA1C,KAAA0C,cAAAe,MAAAzD,KAAA0C,cAAA,IAEA1C,MAAA0D,gBACA1D,MAAA2D,eAEA,IAAA3D,KAAA0C,gBAAA,KAAA1C,KAAA0C,cAAA1C,KAAAiC,QAEA,IAAAjC,KAAAuC,WAAA,CACAvC,KAAA4D,UACA5D,MAAA6D,cACA,IAAA7D,KAAA2B,QAAA,EAAA,CAEA3B,KAAA8D,oBAIA9D,KAAA+D,qBACA/D,MAAAgE,gBACA,KAAAhE,KAAAuC,aAAAvC,KAAA0C,cAAA1C,KAAA6D,cACA7D,MAAAiE,aAEAjE,MAAAuC,WAAA,MAOAjB,YAAAd,UAAA0D,OAAA,WACAlE,KAAA2C,IAAA7B,UAAA,IAUAQ,YAAAd,UAAA2D,WAAA,SAAAC,SACA,GAAAA,QAAA,EAAAA,QAAA,CACApE,MAAAwC,OAAA4B,QAYA9C,YAAAd,UAAA6D,UAAA,SAAA5B,QACA,GAAAA,SAAA,KAAAA,OAAA,gBACAzC,MAAAyC,OAAAA,OAQAnB,YAAAd,UAAA8D,iBAAA,SAAAC,SACAvE,KAAA0C,cAAA6B,QAQAjD,YAAAd,UAAAgE,iBAAA,WACA,MAAAxE,MAAA0C,eAAA1C,KAAA0C,cAAAe,OAAAzD,KAAA0C,cAAAe,MAAA,IAAAzD,KAAA0C,cAMApB,YAAAd,UAAAiE,YAAA,WACAzE,KAAA2C,IAAA3B,cAAA,UAMAM,YAAAd,UAAAmD,cAAA,WACA,IAAA3D,KAAAiC,SAAA,CACAjC,KAAAkC,SAAA,GAAArC,UAAAG,KAAA8B,OAAA9B,KAAAwC,OACAxC,MAAAkC,SAAAwC,eACA1E,MAAAiC,SAAAjC,KAAAkC,SAAAyC,cAIA,GAAA3E,KAAAyC,OAAA,CACAzC,KAAA4E,aAAA5E,KAAAyC,OAAAoC,QAAA,cAAA,IAAA7E,KAAAyC,OAAAqC,MAAA,iBAAA,UACA,CACA9E,KAAA+E,cAGA/E,KAAA8B,OAAA,IACA9B,MAAAgC,WAAA,CACAhC,MAAAqC,QAAA,CAGA,IAAArC,KAAAyB,cAAA,KAAA,CACAzB,KAAA0B,WAAA1B,KAAAgF,YAAAhF,KAAAyB,YAAA,OAOAH,YAAAd,UAAAuE,YAAA,SAAAE,MACA,GAAAC,MAAAlF,KAAA8B,OAAApC,OAAA,CACAM,MAAA+B,cAAA,GAAAtB,YAAAyE,KACA,IAAAC,GAAA,CACA,KAAA,GAAAC,GAAA,EAAAA,EAAAF,KAAAE,IAAA,CACA,GAAAC,OAAArF,KAAAsF,eACAtF,KAAA8B,OAAAqD,KAAA,IACAnF,KAAA8B,OAAAqD,KAAA,IACAnF,KAAA8B,OAAAqD,KAAA,IAEAnF,MAAAmC,UAAAkD,OAAA,IACArF,MAAA+B,cAAAqD,GAAAC,OAOA/D,YAAAd,UAAAoE,aAAA,SAAAW,OAAAC,YACA,GAAAC,UACAC,sBACA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,IAEAC,iBACA,EAAA,GAAA,EAAA,IACA,EAAA,IAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IAEAC,SACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,IAAA,EAAA,IACA,EAAA,IAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,IAAA,EAAA,IACA,EAAA,IAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IAEAC,WACA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,IAIA,KAAAN,SAAAE,QAAAF,QAAA,CACA,KAAA,6BAAAA,OAGA,GAAAO,IAAAL,QAAAF,OACA,IAAAF,OAAA,EACA7D,OAAAxB,KAAAwB,OACAD,MAAAvB,KAAAuB,MACAwE,KAAA/F,KAAA8B,MACA,IAAAkE,WAAAR,YAAA,EAAA,CAEAxF,MAAA+B,cAAA,GAAAtB,YAAAT,KAAA8B,OAAApC,OAAA,EAEA,KAAA,GAAAuG,GAAA,EAAAA,EAAAzE,OAAAyE,IAAA,CAEA,GAAAT,WAAAQ,UAAAA,WAAA,CAEA,KAAA,GAAAE,GAAAF,WAAA,EAAA,EAAAzE,MAAA,EAAA4E,KAAAH,WAAA,EAAAzE,MAAA,EAAA2E,IAAAC,KAAAD,GAAAF,UAAA,CAEAX,MAAAY,EAAA1E,MAAA2E,CAEA,IAAAE,KAAAf,MAAA,CACA,IAAAgB,IAAAN,KAAAK,IACA,IAAAE,IAAAP,KAAAK,IAAA,EACA,IAAAG,IAAAR,KAAAK,IAAA,EAGAA,KAAApG,KAAAsF,eAAAe,GAAAC,GAAAC,GACAvG,MAAAmC,UAAAiE,KAAA,IACApG,MAAA+B,cAAAsD,OAAAe,GACAA,MAAA,CACA,IAAAI,IAAAxG,KAAAiC,SAAAmE,IACA,IAAAK,IAAAzG,KAAAiC,SAAAmE,IAAA,EACA,IAAAM,IAAA1G,KAAAiC,SAAAmE,IAAA,EAEA,IAAAO,IAAAN,GAAAG,EACA,IAAAI,IAAAN,GAAAG,EACA,IAAAI,IAAAN,GAAAG,EAEA,KAAA,GAAAvH,GAAA6G,WAAA,EAAA,EAAAF,GAAApG,OAAA,EAAAoH,IAAAd,WAAA,EAAAF,GAAApG,OAAA,EAAAP,IAAA2H,IAAA3H,GAAA6G,UAAA,CACA,GAAAe,IAAAjB,GAAA3G,GAAA,EACA,IAAA6H,IAAAlB,GAAA3G,GAAA,EACA,IAAA4H,GAAAb,GAAA,GAAAa,GAAAb,EAAA3E,OAAAyF,GAAAf,GAAA,GAAAe,GAAAf,EAAAzE,OAAA,CACA,GAAAyF,GAAAnB,GAAA3G,GAAA,EACAiH,KAAAf,MAAA0B,GAAAC,GAAAzF,KACA6E,MAAA,CAEAL,MAAAK,KAAAtD,KAAAoE,IAAA,EAAApE,KAAAqE,IAAA,IAAApB,KAAAK,KAAAO,GAAAM,GACAlB,MAAAK,IAAA,GAAAtD,KAAAoE,IAAA,EAAApE,KAAAqE,IAAA,IAAApB,KAAAK,IAAA,GAAAQ,GAAAK,GACAlB,MAAAK,IAAA,GAAAtD,KAAAoE,IAAA,EAAApE,KAAAqE,IAAA,IAAApB,KAAAK,IAAA,GAAAS,GAAAI,QAUA3F,YAAAd,UAAAwE,YAAA,SAAAoC,EAAAC,MACA,MAAArH,MAAAsF,gBAAA8B,EAAA,WAAA,IAAAA,EAAA,QAAA,EAAAA,EAAA,IAAAC,MAGA/F,YAAAd,UAAA8E,eAAA,SAAAzG,EAAAyI,EAAAC,EAAAF,MACA,GAAArH,KAAAiC,WAAA,KAAA,OAAA,CAEA,IAAAjC,KAAAkC,WAAAmF,KAAA,CACA,MAAArH,MAAAkC,SAAAsF,UAAA3I,EAAAyI,EAAAC,GAGA,GAAAH,GAAAG,EAAAD,GAAA,EAAAzI,GAAA,EAEA,IAAA4I,QAAA,CACA,IAAAC,MAAA,IAAA,IAAA,GACA,IAAAC,KAAA3H,KAAAiC,SAAAvC,MAEA,KAAA,GAAAP,GAAA,EAAAkG,MAAA,EAAAlG,EAAAwI,IAAAtC,QAAA,CACA,GAAAuC,IAAA/I,GAAAmB,KAAAiC,SAAA9C,KAAA,IACA,IAAA0I,IAAAP,GAAAtH,KAAAiC,SAAA9C,KAAA,IACA,IAAA2I,IAAAP,GAAAvH,KAAAiC,SAAA9C,KAAA,IACA,IAAA8H,GAAAW,GAAAA,GAAAC,GAAAA,GAAAC,GAAAA,EACA,MAAAT,MAAArH,KAAAmC,UAAAkD,SAAA4B,EAAAS,KAAA,CACAA,KAAAT,CACAQ,QAAApC,OAIA,MAAAoC,QAOAnG,YAAAd,UAAAkD,eAAA,WACA,GAAAqE,GAAA/H,KAAAuB,KACA,IAAAyG,GAAAhI,KAAAwB,MACAxB,MAAA8B,OAAA,GAAArB,YAAAsH,EAAAC,EAAA,EAEA,IAAAjC,MAAA/F,KAAA6B,KACA,IAAAoG,QAAA,CACA,IAAAC,OAAA,CAEA,KAAA,GAAA/I,GAAA,EAAAA,EAAA6I,EAAA7I,IAAA,CACA,IAAA,GAAAiG,GAAA,EAAAA,EAAA2C,EAAA3C,IAAA,CACApF,KAAA8B,OAAAoG,SAAAnC,KAAAkC,SACAjI,MAAA8B,OAAAoG,SAAAnC,KAAAkC,SACAjI,MAAA8B,OAAAoG,SAAAnC,KAAAkC,SACAA,YAQA3G,YAAAd,UAAAuD,oBAAA,WACA/D,KAAA2C,IAAA7B,UAAA,GACAd,MAAA2C,IAAA7B,UAAA,IACAd,MAAA2C,IAAA7B,UAAA,EAEA,IAAAqH,QAAAC,IACA,IAAApI,KAAAyB,cAAA,KAAA,CACA0G,OAAA,CACAC,MAAA,MACA,CACAD,OAAA,CACAC,MAAA,EAGA,GAAApI,KAAAsC,SAAA,EAAA,CACA8F,KAAA9F,QAAA,EAEA8F,OAAA,CAGApI,MAAA2C,IAAA7B,UACA,EACAsH,KACA,EACAD,OAGAnI,MAAAqI,WAAArI,KAAA4B,MACA5B,MAAA2C,IAAA7B,UAAAd,KAAA0B,WACA1B,MAAA2C,IAAA7B,UAAA,GAMAQ,YAAAd,UAAAwD,eAAA,WACAhE,KAAA2C,IAAA7B,UAAA,GACAd,MAAAqI,WAAA,EACArI,MAAAqI,WAAA,EACArI,MAAAqI,WAAArI,KAAAuB,MACAvB,MAAAqI,WAAArI,KAAAwB,OAGA,IAAAxB,KAAAuC,YAAAvC,KAAA0C,cAAA,CAEA1C,KAAA2C,IAAA7B,UAAA,OACA,CAEAd,KAAA2C,IAAA7B,UACA,IACA,EACA,EACA,EACAd,KAAAqC,UAQAf,YAAAd,UAAAoD,SAAA,WAEA5D,KAAAqI,WAAArI,KAAAuB,MACAvB,MAAAqI,WAAArI,KAAAwB,OAGAxB,MAAA2C,IAAA7B,UACA,IACA,IACA,EACAd,KAAAqC,QAGArC,MAAA2C,IAAA7B,UAAA,EACAd,MAAA2C,IAAA7B,UAAA,GAMAQ,YAAAd,UAAAsD,iBAAA,WACA9D,KAAA2C,IAAA7B,UAAA,GACAd,MAAA2C,IAAA7B,UAAA,IACAd,MAAA2C,IAAA7B,UAAA,GACAd,MAAA2C,IAAA3B,cAAA,cACAhB,MAAA2C,IAAA7B,UAAA,EACAd,MAAA2C,IAAA7B,UAAA,EACAd,MAAAqI,WAAArI,KAAA2B,OACA3B,MAAA2C,IAAA7B,UAAA,GAMAQ,YAAAd,UAAAqD,aAAA,WACA7D,KAAA2C,IAAAxB,WAAAnB,KAAAiC,SACA,IAAArD,GAAA,EAAA,IAAAoB,KAAAiC,SAAAvC,MACA,KAAA,GAAAP,GAAA,EAAAA,EAAAP,EAAAO,IACAa,KAAA2C,IAAA7B,UAAA,GAGAQ,YAAAd,UAAA6H,WAAA,SAAAC,QACAtI,KAAA2C,IAAA7B,UAAAwH,OAAA,IACAtI,MAAA2C,IAAA7B,UAAAwH,QAAA,EAAA,KAMAhH,YAAAd,UAAAyD,YAAA,WACA,GAAAsE,KAAA,GAAAzI,YAAAE,KAAAuB,MAAAvB,KAAAwB,OAAAxB,KAAA+B,cAAA/B,KAAAgC,WACAuG,KAAAC,OAAAxI,KAAA2C,KAMArB,YAAAd,UAAAiI,OAAA,WACA,MAAAzI,MAAA2C,IAGA/C,QAAAJ,QAAA8B,8FCnhBA,GAAAoH,MAAA,CACA,IAAAC,MAAA,EACA,IAAAC,OAAA,IACA,IAAAC,QAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GACA,GAAA,IAAA,IAAA,IAAA,KAAA,KACA,KAAA,KAAA,MAAA,MAAA,MAEA,SAAA/I,YAAAyB,MAAAC,OAAAM,OAAAE,YACA,GAAA8G,cAAAhG,KAAAoE,IAAA,EAAAlF,WAEA,IAAA+G,OAAA,GAAAtI,YAAA,IACA,IAAAuI,MAAA,GAAAC,YAAAL,MACA,IAAAM,SAAA,GAAAD,YAAAL,MAEA,IAAAO,WAAAC,SAAA,CACA,IAAAC,QACA,IAAAC,UAAA,CACA,IAAAC,QAIA,IAAAC,WAAA,KAaA,IAAAC,aAAAC,UAAAC,OAIA,SAAAC,UAAAxC,EAAAyC,MACAd,MAAAM,WAAAjC,CACA,IAAAiC,SAAA,IAAAS,WAAAD,MAKA,QAAAE,UAAAF,MACAG,QAAApB,MACAU,UAAAI,UAAA,CACAF,WAAA,IACAS,QAAAP,UAAAG,MAIA,QAAAG,SAAAE,OACA,IAAA,GAAA/K,GAAA,EAAAA,EAAA+K,QAAA/K,EAAA6J,KAAA7J,IAAA,EAGA,QAAAgL,UAAAC,UAAAP,MACA,GAAAQ,OAAAjD,EAAAjI,EAAAmL,IAAAlC,KAAAmC,UAAAC,MAGAf,aAAAW,SAGAZ,WAAA,KACAiB,QAAAhB,WACAF,SAAAmB,QAAAD,OAEAf,WAAA,GAAAU,UAAA,CACAT,SAAAD,UAAA,CACAJ,UAAAI,UAAA,CAEAL,SAAA,CAEAiB,KAAAK,WAEAH,QAAA,CACA,KAAAH,MAAAzB,MAAAyB,MAAA,MAAAA,OAAA,IAAAG,MACAA,QAAA,EAAAA,MACAD,WAAA3B,KACAoB,SAAAO,UAEAN,QAAAP,UAAAG,KAEAe,YAAA,OAAAxD,EAAAuD,cAAAjC,IAAA,CACA2B,OAAAjD,GAAAuB,MAAA2B,GACAnL,GAAAiI,GAAAoD,OAAAF,GACA,IAAAtB,KAAA7J,KAAAkL,MAAA,CACAC,IAAApB,QAAA/J,EACA,cACA,IAAA6J,KAAA7J,IAAA,EAAA,CACAiJ,KAAAmC,UAAApL,CACA,IAAAA,IAAA,EAAAiJ,KAAA,CACA,GAAA,CACA,IAAAjJ,GAAAiJ,MAAA,EAAAjJ,GAAAoL,SACA,IAAAvB,KAAA7J,KAAAkL,MAAA,CACAC,IAAApB,QAAA/J,EACA,SAAAyL,mBAEA5B,KAAA7J,IAAA,GAEA8K,OAAAK,IAAAT,KACAS,KAAAlD,CACA,IAAAkC,SAAA,GAAAX,KAAA,CACAO,QAAA/J,GAAAmK,UACAN,MAAA7J,GAAAkL,UACA,CACAN,SAAAF,OAKAI,OAAAK,IAAAT,KACAI,QAAAN,QAAAE,MAGA,QAAArB,QAAAqB,MACAA,KAAA/I,UAAAgI,aACA+B,WAAAtJ,MAAAC,MACAsJ,UAAA,CACAX,UAAArB,aAAA,EAAAe,KACAA,MAAA/I,UAAA,GAIA,QAAAgJ,YAAAD,MACA,GAAAR,QAAA,EAAA,CACAQ,KAAA/I,UAAAuI,QACAQ,MAAA1I,WAAA4H,MAAA,EAAAM,QACAA,SAAA,GAIA,QAAAqB,SAAAD,QACA,OAAA,GAAAA,QAAA,EAIA,QAAAE,aACA,GAAAE,YAAA,EAAA,MAAAnC,OACAmC,SACA,IAAAE,KAAAjJ,OAAAgJ,WACA,OAAAC,KAAA,IAGA,QAAAd,QAAA3K,KAAAuK,MACAV,WAAAN,MAAAO,SAEA,IAAAA,SAAA,EAAAD,WAAA7J,MAAA8J,aACAD,WAAA7J,IAEA8J,WAAAqB,MAEA,OAAArB,UAAA,EAAA,CACAQ,SAAAT,UAAA,IAAAU,KACAV,aAAA,CACAC,WAAA,EAKA,GAAAE,SAAAC,SAAAC,UAAA,CACA,GAAAA,UAAA,CACAD,QAAAmB,QAAAD,OAAAhB,YACAD,WAAA,UACA,GACAiB,MACA,IAAAA,QAAA9B,KAAAY,QAAA,GAAAZ,SACAY,SAAAmB,QAAAD,SAIA,GAAAnL,MAAAqK,QAAA,CAEA,MAAAP,SAAA,EAAA,CACAQ,SAAAT,UAAA,IAAAU,KACAV,aAAA,CACAC,WAAA,EAEAU,WAAAD,OAIA7J,KAAAwI,OAAAA,OAGA5I,OAAAJ,QAAAM,oDCzLA,GAAAkL,SAAA,GACA,IAAAC,SAAA,GACA,IAAAC,WAAAD,QAAA,CAGA,IAAAE,cAAA,CACA,IAAAC,cAAA,EACA,IAAAC,SAAA,GAAAD,YACA,IAAAE,YAAA,EACA,IAAAC,OAAA,GAAAD,UACA,IAAAE,WAAA,EACA,IAAAC,MAAAJ,SAAAG,SACA,IAAAE,WAAAL,SAAAC,WAAAE,SAGA,IAAAG,SAAAV,SAAA,CACA,IAAAW,iBAAA,CACA,IAAAC,YAAA,GAAAD,eACA,IAAAE,YAAAH,QAAAE,UACA,IAAAE,WAAA,EAGA,IAAAC,gBAAA,EACA,IAAAC,WAAA,GAAAD,cACA,IAAAE,SAGA,IAAAC,cAAA,CACA,IAAAC,SAAA,GAAAD,YACA,IAAAE,gBAAAL,eAAAG,YACA,IAAAG,cAAA,GAAAD,cAIA,IAAAE,QAAA,GACA,IAAAC,QAAA,GACA,IAAAC,QAAA,GACA,IAAAC,QAAA,GACA,IAAAC,iBAAA,EAAAD,MAcA,SAAA7M,UAAAiC,OAAA8K,WACA,GAAAC,QACA,IAAAC,SAGA,IAAAC,KACA,IAAAC,KACA,IAAAC,SAOA,SAAAC,QACAL,UACAC,UAAA,GAAA7D,YAAA,IACA8D,MAAA,GAAA9D,YAAAgC,QACA+B,MAAA,GAAA/D,YAAAgC,QACAgC,UAAA,GAAAhE,YAAAgC,SAAA,EAEA,IAAA9L,GAAAgO,CACA,KAAAhO,EAAA,EAAAA,EAAA8L,QAAA9L,IAAA,CACAgO,GAAAhO,GAAAgM,aAAA,GAAAF,OACA4B,SAAA1N,GAAA,GAAAiO,eAAAD,EAAAA,EAAAA,EAAA,GAEAH,MAAA7N,GAAAkM,QAAAJ,OACA8B,MAAA5N,GAAA,GASA,QAAAkO,aACA,IAAA,GAAAlO,GAAA,EAAAA,EAAA8L,QAAA9L,IAAA,CACA0N,QAAA1N,GAAA,KAAAgM,YACA0B,SAAA1N,GAAA,KAAAgM,YACA0B,SAAA1N,GAAA,KAAAgM,YACA0B,SAAA1N,GAAA,GAAAA,GASA,QAAAmO,aAAAC,MAAApO,EAAAoI,EAAAD,EAAAzI,GACAgO,QAAA1N,GAAA,IAAAoO,OAAAV,QAAA1N,GAAA,GAAAoI,GAAA0E,SACAY,SAAA1N,GAAA,IAAAoO,OAAAV,QAAA1N,GAAA,GAAAmI,GAAA2E,SACAY,SAAA1N,GAAA,IAAAoO,OAAAV,QAAA1N,GAAA,GAAAN,GAAAoN,UAQA,QAAAuB,YAAAC,OAAAtO,EAAAoI,EAAAD,EAAAzI,GACA,GAAA6O,IAAA5K,KAAA6K,IAAAxO,EAAAsO,OACA,IAAAG,IAAA9K,KAAAqE,IAAAhI,EAAAsO,OAAAxC,QAEA,IAAA7F,GAAAjG,EAAA,CACA,IAAAgG,GAAAhG,EAAA,CACA,IAAA0O,GAAA,CAEA,IAAAhN,GAAA5B,CACA,OAAAmG,EAAAwI,IAAAzI,EAAAuI,GAAA,CACAzO,EAAAgO,SAAAY,IAEA,IAAAzI,EAAAwI,GAAA,CACA/M,EAAAgM,QAAAzH,IACAvE,GAAA,IAAA5B,GAAA4B,EAAA,GAAA0G,GAAA+E,YACAzL,GAAA,IAAA5B,GAAA4B,EAAA,GAAAyG,GAAAgF,YACAzL,GAAA,IAAA5B,GAAA4B,EAAA,GAAAhC,GAAAyN,aAGA,GAAAnH,EAAAuI,GAAA,CACA7M,EAAAgM,QAAA1H,IACAtE,GAAA,IAAA5B,GAAA4B,EAAA,GAAA0G,GAAA+E,YACAzL,GAAA,IAAA5B,GAAA4B,EAAA,GAAAyG,GAAAgF,YACAzL,GAAA,IAAA5B,GAAA4B,EAAA,GAAAhC,GAAAyN,eAUA,QAAAwB,SAAAvG,EAAAD,EAAAzI,GAQA,GAAAkP,SAAA,GAAA,GACA,IAAAC,WAAAD,KACA,IAAAE,UAAA,CACA,IAAAC,aAAAD,OAEA,IAAA9O,GAAAP,EAAAuP,KAAAC,SAAAC,QACA,KAAAlP,EAAA,EAAAA,EAAA8L,QAAA9L,IAAA,CACAP,EAAAiO,QAAA1N,EAEAgP,MAAArL,KAAA6K,IAAA/O,EAAA,GAAA2I,GAAAzE,KAAA6K,IAAA/O,EAAA,GAAA0I,GAAAxE,KAAA6K,IAAA/O,EAAA,GAAAC,EACA,IAAAsP,KAAAJ,MAAA,CACAA,MAAAI,IACAF,SAAA9O,EAGAiP,SAAAD,MAAApB,KAAA5N,IAAAiM,aAAAD,aACA,IAAAiD,SAAAJ,UAAA,CACAA,UAAAI,QACAF,aAAA/O,EAGAkP,SAAArB,KAAA7N,IAAAqM,SACAwB,MAAA7N,IAAAkP,QACAtB,MAAA5N,IAAAkP,UAAA/C,WAGA0B,KAAAiB,UAAAxC,IACAsB,MAAAkB,UAAAvC,SAEA,OAAAwC,aAQA,QAAAI,YACA,GAAAnP,GAAAiG,EAAAvE,EAAA0N,EAAAC,SAAAC,SAAAC,YAAA,EAAAC,SAAA,CACA,KAAAxP,EAAA,EAAAA,EAAA8L,QAAA9L,IAAA,CACA0B,EAAAgM,QAAA1N,EACAqP,UAAArP,CACAsP,UAAA5N,EAAA,EAEA,KAAAuE,EAAAjG,EAAA,EAAAiG,EAAA6F,QAAA7F,IAAA,CACAmJ,EAAA1B,QAAAzH,EACA,IAAAmJ,EAAA,GAAAE,SAAA,CACAD,SAAApJ,CACAqJ,UAAAF,EAAA,IAGAA,EAAA1B,QAAA2B,SAEA,IAAArP,GAAAqP,SAAA,CACApJ,EAAAmJ,EAAA,EAAAA,GAAA,GAAA1N,EAAA,EAAAA,GAAA,GAAAuE,CACAA,GAAAmJ,EAAA,EAAAA,GAAA,GAAA1N,EAAA,EAAAA,GAAA,GAAAuE,CACAA,GAAAmJ,EAAA,EAAAA,GAAA,GAAA1N,EAAA,EAAAA,GAAA,GAAAuE,CACAA,GAAAmJ,EAAA,EAAAA,GAAA,GAAA1N,EAAA,EAAAA,GAAA,GAAAuE,EAIA,GAAAqJ,UAAAC,YAAA,CACA5B,SAAA4B,aAAAC,SAAAxP,GAAA,CACA,KAAAiG,EAAAsJ,YAAA,EAAAtJ,EAAAqJ,SAAArJ,IACA0H,SAAA1H,GAAAjG,CACAuP,aAAAD,QACAE,UAAAxP,GAGA2N,SAAA4B,aAAAC,SAAAzD,WAAA,CACA,KAAA9F,EAAAsJ,YAAA,EAAAtJ,EAAA,IAAAA,IACA0H,SAAA1H,GAAA8F,UAQA,QAAA0D,WAAArH,EAAAD,EAAAzI,GACA,GAAAI,GAAA4B,EAAAsN,IAEA,IAAAJ,OAAA,GACA,IAAAc,OAAA,CAEA,IAAA1P,GAAA2N,SAAAxF,EACA,IAAAlC,GAAAjG,EAAA,CAEA,OAAAA,EAAA8L,SAAA7F,GAAA,EAAA,CACA,GAAAjG,EAAA8L,QAAA,CACApK,EAAAgM,QAAA1N,EACAgP,MAAAtN,EAAA,GAAAyG,CACA,IAAA6G,MAAAJ,MAAA5O,EAAA8L,YACA,CACA9L,GACA,IAAAgP,KAAA,EAAAA,MAAAA,IACAlP,GAAA4B,EAAA,GAAA0G,CAAA,IAAAtI,EAAA,EAAAA,GAAAA,CACAkP,OAAAlP,CACA,IAAAkP,KAAAJ,MAAA,CACA9O,EAAA4B,EAAA,GAAAhC,CAAA,IAAAI,EAAA,EAAAA,GAAAA,CACAkP,OAAAlP,CACA,IAAAkP,KAAAJ,MAAA,CACAA,MAAAI,IACAU,MAAAhO,EAAA,MAKA,GAAAuE,GAAA,EAAA,CACAvE,EAAAgM,QAAAzH,EACA+I,MAAA7G,EAAAzG,EAAA,EACA,IAAAsN,MAAAJ,MAAA3I,GAAA,MACA,CACAA,GACA,IAAA+I,KAAA,EAAAA,MAAAA,IACAlP,GAAA4B,EAAA,GAAA0G,CAAA,IAAAtI,EAAA,EAAAA,GAAAA,CACAkP,OAAAlP,CACA,IAAAkP,KAAAJ,MAAA,CACA9O,EAAA4B,EAAA,GAAAhC,CAAA,IAAAI,EAAA,EAAAA,GAAAA,CACAkP,OAAAlP,CACA,IAAAkP,KAAAJ,MAAA,CACAA,MAAAI,IACAU,MAAAhO,EAAA,OAOA,MAAAgO,MAQA,QAAAC,SACA,GAAA3P,EAEA,IAAA4P,aAAAjN,OAAApC,MACA,IAAAwM,UAAA,IAAAU,UAAA,GAAA,CACA,IAAAoC,cAAAD,aAAA,EAAAnC,UACA,IAAAqC,UAAAD,aAAAhE,QACA,IAAAuC,OAAAtB,SACA,IAAAwB,QAAA3B,UAEA,IAAAoD,KAAAzB,QAAA7B,eAEA,IAAAsD,KAAA,EAAAA,IAAA,CACA,KAAA/P,EAAA,EAAAA,EAAA+P,IAAA/P,IACA8N,SAAA9N,GAAAoO,QAAA2B,IAAAA,IAAA/P,EAAAA,GAAAiN,SAAA8C,IAAAA,KAEA,IAAAC,KACA,IAAAJ,YAAApC,gBAAA,CACAC,UAAA,CACAuC,MAAA,MACA,IAAAJ,YAAAxC,SAAA,EAAA,CACA4C,KAAA,EAAA5C,WACA,IAAAwC,YAAAvC,SAAA,EAAA,CACA2C,KAAA,EAAA3C,WACA,IAAAuC,YAAAtC,SAAA,EAAA,CACA0C,KAAA,EAAA1C,WACA,CACA0C,KAAA,EAAAzC,OAGA,GAAAnF,GAAAD,EAAAzI,EAAAuG,CACA,IAAA2F,KAAA,CAEA5L,GAAA,CACA,OAAAA,EAAA6P,aAAA,CACAzH,GAAAzF,OAAAiJ,KAAA,MAAAI,YACA7D,IAAAxF,OAAAiJ,IAAA,GAAA,MAAAI,YACAtM,IAAAiD,OAAAiJ,IAAA,GAAA,MAAAI,YAEA/F,GAAA0I,QAAAvG,EAAAD,EAAAzI,EAEAyO,aAAAC,MAAAnI,EAAAmC,EAAAD,EAAAzI,EACA,IAAAqQ,MAAA,EAAA1B,WAAA0B,IAAA9J,EAAAmC,EAAAD,EAAAzI,EAEAkM,MAAAoE,IACA,IAAApE,KAAAgE,YAAAhE,KAAAgE,WAEA5P,IAEA,IAAA8P,QAAA,EAAAA,MAAA,CACA,IAAA9P,EAAA8P,QAAA,EAAA,CACA1B,OAAAA,MAAArB,QACAuB,SAAAA,OAAA1B,SACAmD,KAAAzB,QAAA7B,eAEA,IAAAsD,KAAA,EAAAA,IAAA,CACA,KAAA9J,EAAA,EAAAA,EAAA8J,IAAA9J,IACA6H,SAAA7H,GAAAmI,QAAA2B,IAAAA,IAAA9J,EAAAA,GAAAgH,SAAA8C,IAAAA,QAaA,QAAAxK,iBACAwI,MACA4B,QACAzB,YACAiB,YAEAtO,KAAA0E,cAAAA,aAaA,SAAAC,eACA,GAAAyK,OACA,IAAA/J,SAEA,KAAA,GAAAlG,GAAA,EAAAA,EAAA8L,QAAA9L,IACAkG,MAAAwH,QAAA1N,GAAA,IAAAA,CAEA,IAAAgG,GAAA,CACA,KAAA,GAAA5F,GAAA,EAAAA,EAAA0L,QAAA1L,IAAA,CACA,GAAA6F,GAAAC,MAAA9F,EACA6P,KAAAjK,KAAA0H,QAAAzH,GAAA,EACAgK,KAAAjK,KAAA0H,QAAAzH,GAAA,EACAgK,KAAAjK,KAAA0H,QAAAzH,GAAA,GAEA,MAAAgK,KAEApP,KAAA2E,YAAAA,WAQA3E,MAAAwH,UAAAoH,UAGAhP,OAAAJ,QAAAK,kDC9aA,GAAAyB,YAAA+N,WAAA/N,YAAapC,QAAQ,kBAErBmQ,aAAc,SAACC,OACb,GAAAC,SAAAtP,KAAAwI,OAAA+G,QAAAD,SAAc,GAAAjO,YAAWgO,MAAM/N,MAAO+N,MAAM9N,OAE5C,IAAG8N,MAAMjK,QAAS,EAAlB,CACEkK,QAAQ9K,kBADV,CAGE8K,QAAQhN,WAAa,MAEvBgN,QAAQlM,eAAeiM,MAAM7N,YAC7B8N,SAAQnM,UAAUkM,MAAM3N,OACxB4N,SAAQ3M,SAAS0M,MAAM1N,MACvB2N,SAAQpL,WAAWmL,MAAMlL,QACzBmL,SAAQlL,UAAUiL,MAAM7M,OACxB8M,SAAQjL,iBAAiBgL,MAAM5M,cAC/B6M,SAAQhM,SAAS+L,MAAMvJ,KACvB,IAAoBuJ,MAAMG,KAA1B,CAAAF,QAAQrL,SACR,GAAGoL,MAAM5M,gBAAiB,KAA1B,CACE4M,MAAM5M,cAAgB6M,QAAQ/K,mBAEhCiE,OAAS8G,QAAQ9G,QACjB6G,OAAMvJ,KAAO0C,OAAOvI,KACpBoP,OAAM5O,OAAS+H,OAAO/H,MACtB4O,OAAMlP,SAAWqI,OAAOiH,YAAYtP,QAEpC,IAAGkP,MAAMK,YAAT,CACEH,SAAA,gCAAYI,KAAAN,MAAAvJ,IAAA8J,gBAAA1Q,EAAA,EAAAwI,IAAAiI,IAAAlQ,OAAAP,EAAAwI,IAAAxI,IAAA,0BAAAc,KAAK6P,gCACjBC,MAAKC,YAAYV,MAAOE,cAF1B,OAIEO,MAAKC,YAAYV,QAErBS,MAAKE,UAAY,SAACC,aAAUb,aAAYa,MAAMnK","sourceRoot":"","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})","/*\n GIFEncoder.js\n\n Authors\n Kevin Weiner (original Java version - [email protected])\n Thibault Imbert (AS3 version - bytearray.org)\n Johan Nordberg (JS version - [email protected])\n*/\n\nvar NeuQuant = require('./TypedNeuQuant.js');\nvar LZWEncoder = require('./LZWEncoder.js');\n\nfunction ByteArray() {\n this.page = -1;\n this.pages = [];\n this.newPage();\n}\n\nByteArray.pageSize = 4096;\nByteArray.charMap = {};\n\nfor (var i = 0; i < 256; i++)\n ByteArray.charMap[i] = String.fromCharCode(i);\n\nByteArray.prototype.newPage = function() {\n this.pages[++this.page] = new Uint8Array(ByteArray.pageSize);\n this.cursor = 0;\n};\n\nByteArray.prototype.getData = function() {\n var rv = '';\n for (var p = 0; p < this.pages.length; p++) {\n for (var i = 0; i < ByteArray.pageSize; i++) {\n rv += ByteArray.charMap[this.pages[p][i]];\n }\n }\n return rv;\n};\n\nByteArray.prototype.writeByte = function(val) {\n if (this.cursor >= ByteArray.pageSize) this.newPage();\n this.pages[this.page][this.cursor++] = val;\n};\n\nByteArray.prototype.writeUTFBytes = function(string) {\n for (var l = string.length, i = 0; i < l; i++)\n this.writeByte(string.charCodeAt(i));\n};\n\nByteArray.prototype.writeBytes = function(array, offset, length) {\n for (var l = length || array.length, i = offset || 0; i < l; i++)\n this.writeByte(array[i]);\n};\n\nfunction GIFEncoder(width, height) {\n // image size\n this.width = ~~width;\n this.height = ~~height;\n\n // transparent color if given\n this.transparent = null;\n\n // transparent index in color table\n this.transIndex = 0;\n\n // -1 = no repeat, 0 = forever. anything else is repeat count\n this.repeat = -1;\n\n // frame delay (hundredths)\n this.delay = 0;\n\n this.image = null; // current frame\n this.pixels = null; // BGR byte array from frame\n this.indexedPixels = null; // converted frame indexed to palette\n this.colorDepth = null; // number of bit planes\n this.colorTab = null; // RGB palette\n this.neuQuant = null; // NeuQuant instance that was used to generate this.colorTab.\n this.usedEntry = new Array(); // active palette entries\n this.palSize = 7; // color table size (bits-1)\n this.dispose = -1; // disposal code (-1 = use default)\n this.firstFrame = true;\n this.sample = 10; // default sample interval for quantizer\n this.dither = false; // default dithering\n this.globalPalette = false;\n\n this.out = new ByteArray();\n}\n\n/*\n Sets the delay time between each frame, or changes it for subsequent frames\n (applies to last frame added)\n*/\nGIFEncoder.prototype.setDelay = function(milliseconds) {\n this.delay = Math.round(milliseconds / 10);\n};\n\n/*\n Sets frame rate in frames per second.\n*/\nGIFEncoder.prototype.setFrameRate = function(fps) {\n this.delay = Math.round(100 / fps);\n};\n\n/*\n Sets the GIF frame disposal code for the last added frame and any\n subsequent frames.\n\n Default is 0 if no transparent color has been set, otherwise 2.\n*/\nGIFEncoder.prototype.setDispose = function(disposalCode) {\n if (disposalCode >= 0) this.dispose = disposalCode;\n};\n\n/*\n Sets the number of times the set of GIF frames should be played.\n\n -1 = play once\n 0 = repeat indefinitely\n\n Default is -1\n\n Must be invoked before the first image is added\n*/\n\nGIFEncoder.prototype.setRepeat = function(repeat) {\n this.repeat = repeat;\n};\n\n/*\n Sets the transparent color for the last added frame and any subsequent\n frames. Since all colors are subject to modification in the quantization\n process, the color in the final palette for each frame closest to the given\n color becomes the transparent color for that frame. May be set to null to\n indicate no transparent color.\n*/\nGIFEncoder.prototype.setTransparent = function(color) {\n this.transparent = color;\n};\n\n/*\n Adds next GIF frame. The frame is not written immediately, but is\n actually deferred until the next frame is received so that timing\n data can be inserted. Invoking finish() flushes all frames.\n*/\nGIFEncoder.prototype.addFrame = function(imageData) {\n this.image = imageData;\n\n this.colorTab = this.globalPalette && this.globalPalette.slice ? this.globalPalette : null;\n\n this.getImagePixels(); // convert to correct format if necessary\n this.analyzePixels(); // build color table & map pixels\n\n if (this.globalPalette === true) this.globalPalette = this.colorTab;\n\n if (this.firstFrame) {\n this.writeLSD(); // logical screen descriptior\n this.writePalette(); // global color table\n if (this.repeat >= 0) {\n // use NS app extension to indicate reps\n this.writeNetscapeExt();\n }\n }\n\n this.writeGraphicCtrlExt(); // write graphic control extension\n this.writeImageDesc(); // image descriptor\n if (!this.firstFrame && !this.globalPalette) this.writePalette(); // local color table\n this.writePixels(); // encode and write pixel data\n\n this.firstFrame = false;\n};\n\n/*\n Adds final trailer to the GIF stream, if you don't call the finish method\n the GIF stream will not be valid.\n*/\nGIFEncoder.prototype.finish = function() {\n this.out.writeByte(0x3b); // gif trailer\n};\n\n/*\n Sets quality of color quantization (conversion of images to the maximum 256\n colors allowed by the GIF specification). Lower values (minimum = 1)\n produce better colors, but slow processing significantly. 10 is the\n default, and produces good color mapping at reasonable speeds. Values\n greater than 20 do not yield significant improvements in speed.\n*/\nGIFEncoder.prototype.setQuality = function(quality) {\n if (quality < 1) quality = 1;\n this.sample = quality;\n};\n\n/*\n Sets dithering method. Available are:\n - FALSE no dithering\n - TRUE or FloydSteinberg\n - FalseFloydSteinberg\n - Stucki\n - Atkinson\n You can add '-serpentine' to use serpentine scanning\n*/\nGIFEncoder.prototype.setDither = function(dither) {\n if (dither === true) dither = 'FloydSteinberg';\n this.dither = dither;\n};\n\n/*\n Sets global palette for all frames.\n You can provide TRUE to create global palette from first picture.\n Or an array of r,g,b,r,g,b,...\n*/\nGIFEncoder.prototype.setGlobalPalette = function(palette) {\n this.globalPalette = palette;\n};\n\n/*\n Returns global palette used for all frames.\n If setGlobalPalette(true) was used, then this function will return\n calculated palette after the first frame is added.\n*/\nGIFEncoder.prototype.getGlobalPalette = function() {\n return (this.globalPalette && this.globalPalette.slice && this.globalPalette.slice(0)) || this.globalPalette;\n};\n\n/*\n Writes GIF file header\n*/\nGIFEncoder.prototype.writeHeader = function() {\n this.out.writeUTFBytes(\"GIF89a\");\n};\n\n/*\n Analyzes current frame colors and creates color map.\n*/\nGIFEncoder.prototype.analyzePixels = function() {\n if (!this.colorTab) {\n this.neuQuant = new NeuQuant(this.pixels, this.sample);\n this.neuQuant.buildColormap(); // create reduced palette\n this.colorTab = this.neuQuant.getColormap();\n }\n\n // map image pixels to new palette\n if (this.dither) {\n this.ditherPixels(this.dither.replace('-serpentine', ''), this.dither.match(/-serpentine/) !== null);\n } else {\n this.indexPixels();\n }\n\n this.pixels = null;\n this.colorDepth = 8;\n this.palSize = 7;\n\n // get closest match to transparent color if specified\n if (this.transparent !== null) {\n this.transIndex = this.findClosest(this.transparent, true);\n }\n};\n\n/*\n Index pixels, without dithering\n*/\nGIFEncoder.prototype.indexPixels = function(imgq) {\n var nPix = this.pixels.length / 3;\n this.indexedPixels = new Uint8Array(nPix);\n var k = 0;\n for (var j = 0; j < nPix; j++) {\n var index = this.findClosestRGB(\n this.pixels[k++] & 0xff,\n this.pixels[k++] & 0xff,\n this.pixels[k++] & 0xff\n );\n this.usedEntry[index] = true;\n this.indexedPixels[j] = index;\n }\n};\n\n/*\n Taken from http://jsbin.com/iXofIji/2/edit by PAEz\n*/\nGIFEncoder.prototype.ditherPixels = function(kernel, serpentine) {\n var kernels = {\n FalseFloydSteinberg: [\n [3 / 8, 1, 0],\n [3 / 8, 0, 1],\n [2 / 8, 1, 1]\n ],\n FloydSteinberg: [\n [7 / 16, 1, 0],\n [3 / 16, -1, 1],\n [5 / 16, 0, 1],\n [1 / 16, 1, 1]\n ],\n Stucki: [\n [8 / 42, 1, 0],\n [4 / 42, 2, 0],\n [2 / 42, -2, 1],\n [4 / 42, -1, 1],\n [8 / 42, 0, 1],\n [4 / 42, 1, 1],\n [2 / 42, 2, 1],\n [1 / 42, -2, 2],\n [2 / 42, -1, 2],\n [4 / 42, 0, 2],\n [2 / 42, 1, 2],\n [1 / 42, 2, 2]\n ],\n Atkinson: [\n [1 / 8, 1, 0],\n [1 / 8, 2, 0],\n [1 / 8, -1, 1],\n [1 / 8, 0, 1],\n [1 / 8, 1, 1],\n [1 / 8, 0, 2]\n ]\n };\n\n if (!kernel || !kernels[kernel]) {\n throw 'Unknown dithering kernel: ' + kernel;\n }\n\n var ds = kernels[kernel];\n var index = 0,\n height = this.height,\n width = this.width,\n data = this.pixels;\n var direction = serpentine ? -1 : 1;\n\n this.indexedPixels = new Uint8Array(this.pixels.length / 3);\n\n for (var y = 0; y < height; y++) {\n\n if (serpentine) direction = direction * -1;\n\n for (var x = (direction == 1 ? 0 : width - 1), xend = (direction == 1 ? width : 0); x !== xend; x += direction) {\n\n index = (y * width) + x;\n // Get original colour\n var idx = index * 3;\n var r1 = data[idx];\n var g1 = data[idx + 1];\n var b1 = data[idx + 2];\n\n // Get converted colour\n idx = this.findClosestRGB(r1, g1, b1);\n this.usedEntry[idx] = true;\n this.indexedPixels[index] = idx;\n idx *= 3;\n var r2 = this.colorTab[idx];\n var g2 = this.colorTab[idx + 1];\n var b2 = this.colorTab[idx + 2];\n\n var er = r1 - r2;\n var eg = g1 - g2;\n var eb = b1 - b2;\n\n for (var i = (direction == 1 ? 0: ds.length - 1), end = (direction == 1 ? ds.length : 0); i !== end; i += direction) {\n var x1 = ds[i][1]; // *direction; // Should this by timesd by direction?..to make the kernel go in the opposite direction....got no idea....\n var y1 = ds[i][2];\n if (x1 + x >= 0 && x1 + x < width && y1 + y >= 0 && y1 + y < height) {\n var d = ds[i][0];\n idx = index + x1 + (y1 * width);\n idx *= 3;\n\n data[idx] = Math.max(0, Math.min(255, data[idx] + er * d));\n data[idx + 1] = Math.max(0, Math.min(255, data[idx + 1] + eg * d));\n data[idx + 2] = Math.max(0, Math.min(255, data[idx + 2] + eb * d));\n }\n }\n }\n }\n};\n\n/*\n Returns index of palette color closest to c\n*/\nGIFEncoder.prototype.findClosest = function(c, used) {\n return this.findClosestRGB((c & 0xFF0000) >> 16, (c & 0x00FF00) >> 8, (c & 0x0000FF), used);\n};\n\nGIFEncoder.prototype.findClosestRGB = function(r, g, b, used) {\n if (this.colorTab === null) return -1;\n\n if (this.neuQuant && !used) {\n return this.neuQuant.lookupRGB(r, g, b);\n }\n \n var c = b | (g << 8) | (r << 16);\n\n var minpos = 0;\n var dmin = 256 * 256 * 256;\n var len = this.colorTab.length;\n\n for (var i = 0, index = 0; i < len; index++) {\n var dr = r - (this.colorTab[i++] & 0xff);\n var dg = g - (this.colorTab[i++] & 0xff);\n var db = b - (this.colorTab[i++] & 0xff);\n var d = dr * dr + dg * dg + db * db;\n if ((!used || this.usedEntry[index]) && (d < dmin)) {\n dmin = d;\n minpos = index;\n }\n }\n\n return minpos;\n};\n\n/*\n Extracts image pixels into byte array pixels\n (removes alphachannel from canvas imagedata)\n*/\nGIFEncoder.prototype.getImagePixels = function() {\n var w = this.width;\n var h = this.height;\n this.pixels = new Uint8Array(w * h * 3);\n\n var data = this.image;\n var srcPos = 0;\n var count = 0;\n\n for (var i = 0; i < h; i++) {\n for (var j = 0; j < w; j++) {\n this.pixels[count++] = data[srcPos++];\n this.pixels[count++] = data[srcPos++];\n this.pixels[count++] = data[srcPos++];\n srcPos++;\n }\n }\n};\n\n/*\n Writes Graphic Control Extension\n*/\nGIFEncoder.prototype.writeGraphicCtrlExt = function() {\n this.out.writeByte(0x21); // extension introducer\n this.out.writeByte(0xf9); // GCE label\n this.out.writeByte(4); // data block size\n\n var transp, disp;\n if (this.transparent === null) {\n transp = 0;\n disp = 0; // dispose = no action\n } else {\n transp = 1;\n disp = 2; // force clear if using transparent color\n }\n\n if (this.dispose >= 0) {\n disp = dispose & 7; // user override\n }\n disp <<= 2;\n\n // packed fields\n this.out.writeByte(\n 0 | // 1:3 reserved\n disp | // 4:6 disposal\n 0 | // 7 user input - 0 = none\n transp // 8 transparency flag\n );\n\n this.writeShort(this.delay); // delay x 1/100 sec\n this.out.writeByte(this.transIndex); // transparent color index\n this.out.writeByte(0); // block terminator\n};\n\n/*\n Writes Image Descriptor\n*/\nGIFEncoder.prototype.writeImageDesc = function() {\n this.out.writeByte(0x2c); // image separator\n this.writeShort(0); // image position x,y = 0,0\n this.writeShort(0);\n this.writeShort(this.width); // image size\n this.writeShort(this.height);\n\n // packed fields\n if (this.firstFrame || this.globalPalette) {\n // no LCT - GCT is used for first (or only) frame\n this.out.writeByte(0);\n } else {\n // specify normal LCT\n this.out.writeByte(\n 0x80 | // 1 local color table 1=yes\n 0 | // 2 interlace - 0=no\n 0 | // 3 sorted - 0=no\n 0 | // 4-5 reserved\n this.palSize // 6-8 size of color table\n );\n }\n};\n\n/*\n Writes Logical Screen Descriptor\n*/\nGIFEncoder.prototype.writeLSD = function() {\n // logical screen size\n this.writeShort(this.width);\n this.writeShort(this.height);\n\n // packed fields\n this.out.writeByte(\n 0x80 | // 1 : global color table flag = 1 (gct used)\n 0x70 | // 2-4 : color resolution = 7\n 0x00 | // 5 : gct sort flag = 0\n this.palSize // 6-8 : gct size\n );\n\n this.out.writeByte(0); // background color index\n this.out.writeByte(0); // pixel aspect ratio - assume 1:1\n};\n\n/*\n Writes Netscape application extension to define repeat count.\n*/\nGIFEncoder.prototype.writeNetscapeExt = function() {\n this.out.writeByte(0x21); // extension introducer\n this.out.writeByte(0xff); // app extension label\n this.out.writeByte(11); // block size\n this.out.writeUTFBytes('NETSCAPE2.0'); // app id + auth code\n this.out.writeByte(3); // sub-block size\n this.out.writeByte(1); // loop sub-block id\n this.writeShort(this.repeat); // loop count (extra iterations, 0=repeat forever)\n this.out.writeByte(0); // block terminator\n};\n\n/*\n Writes color table\n*/\nGIFEncoder.prototype.writePalette = function() {\n this.out.writeBytes(this.colorTab);\n var n = (3 * 256) - this.colorTab.length;\n for (var i = 0; i < n; i++)\n this.out.writeByte(0);\n};\n\nGIFEncoder.prototype.writeShort = function(pValue) {\n this.out.writeByte(pValue & 0xFF);\n this.out.writeByte((pValue >> 8) & 0xFF);\n};\n\n/*\n Encodes and writes pixel data\n*/\nGIFEncoder.prototype.writePixels = function() {\n var enc = new LZWEncoder(this.width, this.height, this.indexedPixels, this.colorDepth);\n enc.encode(this.out);\n};\n\n/*\n Retrieves the GIF stream\n*/\nGIFEncoder.prototype.stream = function() {\n return this.out;\n};\n\nmodule.exports = GIFEncoder;\n","/*\n LZWEncoder.js\n\n Authors\n Kevin Weiner (original Java version - [email protected])\n Thibault Imbert (AS3 version - bytearray.org)\n Johan Nordberg (JS version - [email protected])\n\n Acknowledgements\n GIFCOMPR.C - GIF Image compression routines\n Lempel-Ziv compression based on 'compress'. GIF modifications by\n David Rowley ([email protected])\n GIF Image compression - modified 'compress'\n Based on: compress.c - File compression ala IEEE Computer, June 1984.\n By Authors: Spencer W. Thomas (decvax!harpo!utah-cs!utah-gr!thomas)\n Jim McKie (decvax!mcvax!jim)\n Steve Davies (decvax!vax135!petsd!peora!srd)\n Ken Turkowski (decvax!decwrl!turtlevax!ken)\n James A. Woods (decvax!ihnp4!ames!jaw)\n Joe Orost (decvax!vax135!petsd!joe)\n*/\n\nvar EOF = -1;\nvar BITS = 12;\nvar HSIZE = 5003; // 80% occupancy\nvar masks = [0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F,\n 0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF,\n 0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF];\n\nfunction LZWEncoder(width, height, pixels, colorDepth) {\n var initCodeSize = Math.max(2, colorDepth);\n\n var accum = new Uint8Array(256);\n var htab = new Int32Array(HSIZE);\n var codetab = new Int32Array(HSIZE);\n\n var cur_accum, cur_bits = 0;\n var a_count;\n var free_ent = 0; // first unused entry\n var maxcode;\n\n // block compression parameters -- after all codes are used up,\n // and compression rate changes, start over.\n var clear_flg = false;\n\n // Algorithm: use open addressing double hashing (no chaining) on the\n // prefix code / next character combination. We do a variant of Knuth's\n // algorithm D (vol. 3, sec. 6.4) along with G. Knott's relatively-prime\n // secondary probe. Here, the modular division first probe is gives way\n // to a faster exclusive-or manipulation. Also do block compression with\n // an adaptive reset, whereby the code table is cleared when the compression\n // ratio decreases, but after the table fills. The variable-length output\n // codes are re-sized at this point, and a special CLEAR code is generated\n // for the decompressor. Late addition: construct the table according to\n // file size for noticeable speed improvement on small files. Please direct\n // questions about this implementation to ames!jaw.\n var g_init_bits, ClearCode, EOFCode;\n\n // Add a character to the end of the current packet, and if it is 254\n // characters, flush the packet to disk.\n function char_out(c, outs) {\n accum[a_count++] = c;\n if (a_count >= 254) flush_char(outs);\n }\n\n // Clear out the hash table\n // table clear for block compress\n function cl_block(outs) {\n cl_hash(HSIZE);\n free_ent = ClearCode + 2;\n clear_flg = true;\n output(ClearCode, outs);\n }\n\n // Reset code table\n function cl_hash(hsize) {\n for (var i = 0; i < hsize; ++i) htab[i] = -1;\n }\n\n function compress(init_bits, outs) {\n var fcode, c, i, ent, disp, hsize_reg, hshift;\n\n // Set up the globals: g_init_bits - initial number of bits\n g_init_bits = init_bits;\n\n // Set up the necessary values\n clear_flg = false;\n n_bits = g_init_bits;\n maxcode = MAXCODE(n_bits);\n\n ClearCode = 1 << (init_bits - 1);\n EOFCode = ClearCode + 1;\n free_ent = ClearCode + 2;\n\n a_count = 0; // clear packet\n\n ent = nextPixel();\n\n hshift = 0;\n for (fcode = HSIZE; fcode < 65536; fcode *= 2) ++hshift;\n hshift = 8 - hshift; // set hash code range bound\n hsize_reg = HSIZE;\n cl_hash(hsize_reg); // clear hash table\n\n output(ClearCode, outs);\n\n outer_loop: while ((c = nextPixel()) != EOF) {\n fcode = (c << BITS) + ent;\n i = (c << hshift) ^ ent; // xor hashing\n if (htab[i] === fcode) {\n ent = codetab[i];\n continue;\n } else if (htab[i] >= 0) { // non-empty slot\n disp = hsize_reg - i; // secondary hash (after G. Knott)\n if (i === 0) disp = 1;\n do {\n if ((i -= disp) < 0) i += hsize_reg;\n if (htab[i] === fcode) {\n ent = codetab[i];\n continue outer_loop;\n }\n } while (htab[i] >= 0);\n }\n output(ent, outs);\n ent = c;\n if (free_ent < 1 << BITS) {\n codetab[i] = free_ent++; // code -> hashtable\n htab[i] = fcode;\n } else {\n cl_block(outs);\n }\n }\n\n // Put out the final code.\n output(ent, outs);\n output(EOFCode, outs);\n }\n\n function encode(outs) {\n outs.writeByte(initCodeSize); // write \"initial code size\" byte\n remaining = width * height; // reset navigation variables\n curPixel = 0;\n compress(initCodeSize + 1, outs); // compress and write the pixel data\n outs.writeByte(0); // write block terminator\n }\n\n // Flush the packet to disk, and reset the accumulator\n function flush_char(outs) {\n if (a_count > 0) {\n outs.writeByte(a_count);\n outs.writeBytes(accum, 0, a_count);\n a_count = 0;\n }\n }\n\n function MAXCODE(n_bits) {\n return (1 << n_bits) - 1;\n }\n\n // Return the next pixel from the image\n function nextPixel() {\n if (remaining === 0) return EOF;\n --remaining;\n var pix = pixels[curPixel++];\n return pix & 0xff;\n }\n\n function output(code, outs) {\n cur_accum &= masks[cur_bits];\n\n if (cur_bits > 0) cur_accum |= (code << cur_bits);\n else cur_accum = code;\n\n cur_bits += n_bits;\n\n while (cur_bits >= 8) {\n char_out((cur_accum & 0xff), outs);\n cur_accum >>= 8;\n cur_bits -= 8;\n }\n\n // If the next entry is going to be too big for the code size,\n // then increase it, if possible.\n if (free_ent > maxcode || clear_flg) {\n if (clear_flg) {\n maxcode = MAXCODE(n_bits = g_init_bits);\n clear_flg = false;\n } else {\n ++n_bits;\n if (n_bits == BITS) maxcode = 1 << BITS;\n else maxcode = MAXCODE(n_bits);\n }\n }\n\n if (code == EOFCode) {\n // At EOF, write the rest of the buffer.\n while (cur_bits > 0) {\n char_out((cur_accum & 0xff), outs);\n cur_accum >>= 8;\n cur_bits -= 8;\n }\n flush_char(outs);\n }\n }\n\n this.encode = encode;\n}\n\nmodule.exports = LZWEncoder;\n","/* NeuQuant Neural-Net Quantization Algorithm\n * ------------------------------------------\n *\n * Copyright (c) 1994 Anthony Dekker\n *\n * NEUQUANT Neural-Net quantization algorithm by Anthony Dekker, 1994.\n * See \"Kohonen neural networks for optimal colour quantization\"\n * in \"Network: Computation in Neural Systems\" Vol. 5 (1994) pp 351-367.\n * for a discussion of the algorithm.\n * See also http://members.ozemail.com.au/~dekker/NEUQUANT.HTML\n *\n * Any party obtaining a copy of these files from the author, directly or\n * indirectly, is granted, free of charge, a full and unrestricted irrevocable,\n * world-wide, paid up, royalty-free, nonexclusive right and license to deal\n * in this software and documentation files (the \"Software\"), including without\n * limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons who receive\n * copies from any such party to do so, with the only requirement being\n * that this copyright notice remain intact.\n *\n * (JavaScript port 2012 by Johan Nordberg)\n */\n\nvar ncycles = 100; // number of learning cycles\nvar netsize = 256; // number of colors used\nvar maxnetpos = netsize - 1;\n\n// defs for freq and bias\nvar netbiasshift = 4; // bias for colour values\nvar intbiasshift = 16; // bias for fractions\nvar intbias = (1 << intbiasshift);\nvar gammashift = 10;\nvar gamma = (1 << gammashift);\nvar betashift = 10;\nvar beta = (intbias >> betashift); /* beta = 1/1024 */\nvar betagamma = (intbias << (gammashift - betashift));\n\n// defs for decreasing radius factor\nvar initrad = (netsize >> 3); // for 256 cols, radius starts\nvar radiusbiasshift = 6; // at 32.0 biased by 6 bits\nvar radiusbias = (1 << radiusbiasshift);\nvar initradius = (initrad * radiusbias); //and decreases by a\nvar radiusdec = 30; // factor of 1/30 each cycle\n\n// defs for decreasing alpha factor\nvar alphabiasshift = 10; // alpha starts at 1.0\nvar initalpha = (1 << alphabiasshift);\nvar alphadec; // biased by 10 bits\n\n/* radbias and alpharadbias used for radpower calculation */\nvar radbiasshift = 8;\nvar radbias = (1 << radbiasshift);\nvar alpharadbshift = (alphabiasshift + radbiasshift);\nvar alpharadbias = (1 << alpharadbshift);\n\n// four primes near 500 - assume no image has a length so large that it is\n// divisible by all four primes\nvar prime1 = 499;\nvar prime2 = 491;\nvar prime3 = 487;\nvar prime4 = 503;\nvar minpicturebytes = (3 * prime4);\n\n/*\n Constructor: NeuQuant\n\n Arguments:\n\n pixels - array of pixels in RGB format\n samplefac - sampling factor 1 to 30 where lower is better quality\n\n >\n > pixels = [r, g, b, r, g, b, r, g, b, ..]\n >\n*/\nfunction NeuQuant(pixels, samplefac) {\n var network; // int[netsize][4]\n var netindex; // for network lookup - really 256\n\n // bias and freq arrays for learning\n var bias;\n var freq;\n var radpower;\n\n /*\n Private Method: init\n\n sets up arrays\n */\n function init() {\n network = [];\n netindex = new Int32Array(256);\n bias = new Int32Array(netsize);\n freq = new Int32Array(netsize);\n radpower = new Int32Array(netsize >> 3);\n\n var i, v;\n for (i = 0; i < netsize; i++) {\n v = (i << (netbiasshift + 8)) / netsize;\n network[i] = new Float64Array([v, v, v, 0]);\n //network[i] = [v, v, v, 0]\n freq[i] = intbias / netsize;\n bias[i] = 0;\n }\n }\n\n /*\n Private Method: unbiasnet\n\n unbiases network to give byte values 0..255 and record position i to prepare for sort\n */\n function unbiasnet() {\n for (var i = 0; i < netsize; i++) {\n network[i][0] >>= netbiasshift;\n network[i][1] >>= netbiasshift;\n network[i][2] >>= netbiasshift;\n network[i][3] = i; // record color number\n }\n }\n\n /*\n Private Method: altersingle\n\n moves neuron *i* towards biased (b,g,r) by factor *alpha*\n */\n function altersingle(alpha, i, b, g, r) {\n network[i][0] -= (alpha * (network[i][0] - b)) / initalpha;\n network[i][1] -= (alpha * (network[i][1] - g)) / initalpha;\n network[i][2] -= (alpha * (network[i][2] - r)) / initalpha;\n }\n\n /*\n Private Method: alterneigh\n\n moves neurons in *radius* around index *i* towards biased (b,g,r) by factor *alpha*\n */\n function alterneigh(radius, i, b, g, r) {\n var lo = Math.abs(i - radius);\n var hi = Math.min(i + radius, netsize);\n\n var j = i + 1;\n var k = i - 1;\n var m = 1;\n\n var p, a;\n while ((j < hi) || (k > lo)) {\n a = radpower[m++];\n\n if (j < hi) {\n p = network[j++];\n p[0] -= (a * (p[0] - b)) / alpharadbias;\n p[1] -= (a * (p[1] - g)) / alpharadbias;\n p[2] -= (a * (p[2] - r)) / alpharadbias;\n }\n\n if (k > lo) {\n p = network[k--];\n p[0] -= (a * (p[0] - b)) / alpharadbias;\n p[1] -= (a * (p[1] - g)) / alpharadbias;\n p[2] -= (a * (p[2] - r)) / alpharadbias;\n }\n }\n }\n\n /*\n Private Method: contest\n\n searches for biased BGR values\n */\n function contest(b, g, r) {\n /*\n finds closest neuron (min dist) and updates freq\n finds best neuron (min dist-bias) and returns position\n for frequently chosen neurons, freq[i] is high and bias[i] is negative\n bias[i] = gamma * ((1 / netsize) - freq[i])\n */\n\n var bestd = ~(1 << 31);\n var bestbiasd = bestd;\n var bestpos = -1;\n var bestbiaspos = bestpos;\n\n var i, n, dist, biasdist, betafreq;\n for (i = 0; i < netsize; i++) {\n n = network[i];\n\n dist = Math.abs(n[0] - b) + Math.abs(n[1] - g) + Math.abs(n[2] - r);\n if (dist < bestd) {\n bestd = dist;\n bestpos = i;\n }\n\n biasdist = dist - ((bias[i]) >> (intbiasshift - netbiasshift));\n if (biasdist < bestbiasd) {\n bestbiasd = biasdist;\n bestbiaspos = i;\n }\n\n betafreq = (freq[i] >> betashift);\n freq[i] -= betafreq;\n bias[i] += (betafreq << gammashift);\n }\n\n freq[bestpos] += beta;\n bias[bestpos] -= betagamma;\n\n return bestbiaspos;\n }\n\n /*\n Private Method: inxbuild\n\n sorts network and builds netindex[0..255]\n */\n function inxbuild() {\n var i, j, p, q, smallpos, smallval, previouscol = 0, startpos = 0;\n for (i = 0; i < netsize; i++) {\n p = network[i];\n smallpos = i;\n smallval = p[1]; // index on g\n // find smallest in i..netsize-1\n for (j = i + 1; j < netsize; j++) {\n q = network[j];\n if (q[1] < smallval) { // index on g\n smallpos = j;\n smallval = q[1]; // index on g\n }\n }\n q = network[smallpos];\n // swap p (i) and q (smallpos) entries\n if (i != smallpos) {\n j = q[0]; q[0] = p[0]; p[0] = j;\n j = q[1]; q[1] = p[1]; p[1] = j;\n j = q[2]; q[2] = p[2]; p[2] = j;\n j = q[3]; q[3] = p[3]; p[3] = j;\n }\n // smallval entry is now in position i\n\n if (smallval != previouscol) {\n netindex[previouscol] = (startpos + i) >> 1;\n for (j = previouscol + 1; j < smallval; j++)\n netindex[j] = i;\n previouscol = smallval;\n startpos = i;\n }\n }\n netindex[previouscol] = (startpos + maxnetpos) >> 1;\n for (j = previouscol + 1; j < 256; j++)\n netindex[j] = maxnetpos; // really 256\n }\n\n /*\n Private Method: inxsearch\n\n searches for BGR values 0..255 and returns a color index\n */\n function inxsearch(b, g, r) {\n var a, p, dist;\n\n var bestd = 1000; // biggest possible dist is 256*3\n var best = -1;\n\n var i = netindex[g]; // index on g\n var j = i - 1; // start at netindex[g] and work outwards\n\n while ((i < netsize) || (j >= 0)) {\n if (i < netsize) {\n p = network[i];\n dist = p[1] - g; // inx key\n if (dist >= bestd) i = netsize; // stop iter\n else {\n i++;\n if (dist < 0) dist = -dist;\n a = p[0] - b; if (a < 0) a = -a;\n dist += a;\n if (dist < bestd) {\n a = p[2] - r; if (a < 0) a = -a;\n dist += a;\n if (dist < bestd) {\n bestd = dist;\n best = p[3];\n }\n }\n }\n }\n if (j >= 0) {\n p = network[j];\n dist = g - p[1]; // inx key - reverse dif\n if (dist >= bestd) j = -1; // stop iter\n else {\n j--;\n if (dist < 0) dist = -dist;\n a = p[0] - b; if (a < 0) a = -a;\n dist += a;\n if (dist < bestd) {\n a = p[2] - r; if (a < 0) a = -a;\n dist += a;\n if (dist < bestd) {\n bestd = dist;\n best = p[3];\n }\n }\n }\n }\n }\n\n return best;\n }\n\n /*\n Private Method: learn\n\n \"Main Learning Loop\"\n */\n function learn() {\n var i;\n\n var lengthcount = pixels.length;\n var alphadec = 30 + ((samplefac - 1) / 3);\n var samplepixels = lengthcount / (3 * samplefac);\n var delta = ~~(samplepixels / ncycles);\n var alpha = initalpha;\n var radius = initradius;\n\n var rad = radius >> radiusbiasshift;\n\n if (rad <= 1) rad = 0;\n for (i = 0; i < rad; i++)\n radpower[i] = alpha * (((rad * rad - i * i) * radbias) / (rad * rad));\n\n var step;\n if (lengthcount < minpicturebytes) {\n samplefac = 1;\n step = 3;\n } else if ((lengthcount % prime1) !== 0) {\n step = 3 * prime1;\n } else if ((lengthcount % prime2) !== 0) {\n step = 3 * prime2;\n } else if ((lengthcount % prime3) !== 0) {\n step = 3 * prime3;\n } else {\n step = 3 * prime4;\n }\n\n var b, g, r, j;\n var pix = 0; // current pixel\n\n i = 0;\n while (i < samplepixels) {\n b = (pixels[pix] & 0xff) << netbiasshift;\n g = (pixels[pix + 1] & 0xff) << netbiasshift;\n r = (pixels[pix + 2] & 0xff) << netbiasshift;\n\n j = contest(b, g, r);\n\n altersingle(alpha, j, b, g, r);\n if (rad !== 0) alterneigh(rad, j, b, g, r); // alter neighbours\n\n pix += step;\n if (pix >= lengthcount) pix -= lengthcount;\n\n i++;\n\n if (delta === 0) delta = 1;\n if (i % delta === 0) {\n alpha -= alpha / alphadec;\n radius -= radius / radiusdec;\n rad = radius >> radiusbiasshift;\n\n if (rad <= 1) rad = 0;\n for (j = 0; j < rad; j++)\n radpower[j] = alpha * (((rad * rad - j * j) * radbias) / (rad * rad));\n }\n }\n }\n\n /*\n Method: buildColormap\n\n 1. initializes network\n 2. trains it\n 3. removes misconceptions\n 4. builds colorindex\n */\n function buildColormap() {\n init();\n learn();\n unbiasnet();\n inxbuild();\n }\n this.buildColormap = buildColormap;\n\n /*\n Method: getColormap\n\n builds colormap from the index\n\n returns array in the format:\n\n >\n > [r, g, b, r, g, b, r, g, b, ..]\n >\n */\n function getColormap() {\n var map = [];\n var index = [];\n\n for (var i = 0; i < netsize; i++)\n index[network[i][3]] = i;\n\n var k = 0;\n for (var l = 0; l < netsize; l++) {\n var j = index[l];\n map[k++] = (network[j][0]);\n map[k++] = (network[j][1]);\n map[k++] = (network[j][2]);\n }\n return map;\n }\n this.getColormap = getColormap;\n\n /*\n Method: lookupRGB\n\n looks for the closest *r*, *g*, *b* color in the map and\n returns its index\n */\n this.lookupRGB = inxsearch;\n}\n\nmodule.exports = NeuQuant;\n","GIFEncoder = require './GIFEncoder.js'\n\nrenderFrame = (frame) ->\n encoder = new GIFEncoder frame.width, frame.height\n\n if frame.index is 0\n encoder.writeHeader()\n else\n encoder.firstFrame = false\n\n encoder.setTransparent frame.transparent\n encoder.setRepeat frame.repeat\n encoder.setDelay frame.delay\n encoder.setQuality frame.quality\n encoder.setDither frame.dither\n encoder.setGlobalPalette frame.globalPalette\n encoder.addFrame frame.data\n encoder.finish() if frame.last\n if frame.globalPalette == true\n frame.globalPalette = encoder.getGlobalPalette()\n\n stream = encoder.stream()\n frame.data = stream.pages\n frame.cursor = stream.cursor\n frame.pageSize = stream.constructor.pageSize\n\n if frame.canTransfer\n transfer = (page.buffer for page in frame.data)\n self.postMessage frame, transfer\n else\n self.postMessage frame\n\nself.onmessage = (event) -> renderFrame event.data\n"]}