RGBMLoader.js 30 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148
  1. import {
  2. DataTextureLoader,
  3. RGBAFormat,
  4. LinearFilter,
  5. CubeTexture,
  6. HalfFloatType,
  7. DataUtils
  8. } from 'three';
  9. /**
  10. * A loader for the RGBM HDR texture format.
  11. *
  12. * ```js
  13. * const loader = new RGBMLoader();
  14. * loader.setMaxRange( 16 );
  15. *
  16. * const texture = await loader.loadAsync( 'textures/memorial.png' );
  17. * ```
  18. *
  19. * @augments DataTextureLoader
  20. * @three_import import { RGBMLoader } from 'three/addons/loaders/RGBMLoader.js';
  21. */
  22. class RGBMLoader extends DataTextureLoader {
  23. /**
  24. * Constructs a new RGBM loader.
  25. *
  26. * @param {LoadingManager} [manager] - The loading manager.
  27. */
  28. constructor( manager ) {
  29. super( manager );
  30. /**
  31. * The texture type.
  32. *
  33. * @type {(HalfFloatType|FloatType)}
  34. * @default HalfFloatType
  35. */
  36. this.type = HalfFloatType;
  37. /**
  38. * More information about this property at [The difference between RGBM and RGBD]{@link https://iwasbeingirony.blogspot.com/2010/06/difference-between-rgbm-and-rgbd.html}
  39. *
  40. * @type {(7|16)}
  41. * @default 7
  42. */
  43. this.maxRange = 7;
  44. }
  45. /**
  46. * Sets the texture type.
  47. *
  48. * @param {(HalfFloatType|FloatType)} value - The texture type to set.
  49. * @return {RGBMLoader} A reference to this loader.
  50. */
  51. setDataType( value ) {
  52. this.type = value;
  53. return this;
  54. }
  55. /**
  56. * Sets the maximum range.
  57. *
  58. * @param {(7|16)} value - The maximum range to set.
  59. * @return {RGBMLoader} A reference to this loader.
  60. */
  61. setMaxRange( value ) {
  62. this.maxRange = value;
  63. return this;
  64. }
  65. /**
  66. * Starts loading from the given URLs and passes the loaded RGBM cube map
  67. * to the `onLoad()` callback.
  68. *
  69. * @param {Array<string>} urls - The paths/URLs of the files to be loaded. This can also be a data URIs.
  70. * @param {function(CubeTexture)} onLoad - Executed when the loading process has been finished.
  71. * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
  72. * @param {onErrorCallback} onError - Executed when errors occur.
  73. * @return {CubeTexture} The cube texture.
  74. */
  75. loadCubemap( urls, onLoad, onProgress, onError ) {
  76. const texture = new CubeTexture();
  77. for ( let i = 0; i < 6; i ++ ) {
  78. texture.images[ i ] = undefined;
  79. }
  80. let loaded = 0;
  81. const scope = this;
  82. function loadTexture( i ) {
  83. scope.load( urls[ i ], function ( image ) {
  84. texture.images[ i ] = image;
  85. loaded ++;
  86. if ( loaded === 6 ) {
  87. texture.needsUpdate = true;
  88. if ( onLoad ) onLoad( texture );
  89. }
  90. }, undefined, onError );
  91. }
  92. for ( let i = 0; i < urls.length; ++ i ) {
  93. loadTexture( i );
  94. }
  95. texture.type = this.type;
  96. texture.format = RGBAFormat;
  97. texture.minFilter = LinearFilter;
  98. texture.generateMipmaps = false;
  99. return texture;
  100. }
  101. /**
  102. * Async version of {@link RGBMLoader#loadCubemap}.
  103. *
  104. * @async
  105. * @param {Array<string>} urls - The paths/URLs of the files to be loaded. This can also be a data URIs.
  106. * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
  107. * @return {Promise<CubeTexture>} A Promise that resolves with the loaded cube map.
  108. */
  109. loadCubemapAsync( urls, onProgress ) {
  110. return new Promise( ( resolve, reject ) => {
  111. this.loadCubemap( urls, resolve, onProgress, reject );
  112. } );
  113. }
  114. /**
  115. * Parses the given RGBM texture data.
  116. *
  117. * @param {ArrayBuffer} buffer - The raw texture data.
  118. * @return {DataTextureLoader~TexData} An object representing the parsed texture data.
  119. */
  120. parse( buffer ) {
  121. const img = UPNG.decode( buffer );
  122. const rgba = UPNG.toRGBA8( img )[ 0 ];
  123. const data = new Uint8Array( rgba );
  124. const size = img.width * img.height * 4;
  125. const output = ( this.type === HalfFloatType ) ? new Uint16Array( size ) : new Float32Array( size );
  126. // decode RGBM
  127. for ( let i = 0; i < data.length; i += 4 ) {
  128. const r = data[ i + 0 ] / 255;
  129. const g = data[ i + 1 ] / 255;
  130. const b = data[ i + 2 ] / 255;
  131. const a = data[ i + 3 ] / 255;
  132. if ( this.type === HalfFloatType ) {
  133. output[ i + 0 ] = DataUtils.toHalfFloat( Math.min( r * a * this.maxRange, 65504 ) );
  134. output[ i + 1 ] = DataUtils.toHalfFloat( Math.min( g * a * this.maxRange, 65504 ) );
  135. output[ i + 2 ] = DataUtils.toHalfFloat( Math.min( b * a * this.maxRange, 65504 ) );
  136. output[ i + 3 ] = DataUtils.toHalfFloat( 1 );
  137. } else {
  138. output[ i + 0 ] = r * a * this.maxRange;
  139. output[ i + 1 ] = g * a * this.maxRange;
  140. output[ i + 2 ] = b * a * this.maxRange;
  141. output[ i + 3 ] = 1;
  142. }
  143. }
  144. return {
  145. width: img.width,
  146. height: img.height,
  147. data: output,
  148. format: RGBAFormat,
  149. type: this.type,
  150. flipY: true
  151. };
  152. }
  153. }
  154. // from https://github.com/photopea/UPNG.js (MIT License)
  155. var UPNG = {};
  156. UPNG.toRGBA8 = function ( out ) {
  157. var w = out.width, h = out.height;
  158. if ( out.tabs.acTL == null ) return [ UPNG.toRGBA8.decodeImage( out.data, w, h, out ).buffer ];
  159. var frms = [];
  160. if ( out.frames[ 0 ].data == null ) out.frames[ 0 ].data = out.data;
  161. var len = w * h * 4, img = new Uint8Array( len ), empty = new Uint8Array( len ), prev = new Uint8Array( len );
  162. for ( var i = 0; i < out.frames.length; i ++ ) {
  163. var frm = out.frames[ i ];
  164. var fx = frm.rect.x, fy = frm.rect.y, fw = frm.rect.width, fh = frm.rect.height;
  165. var fdata = UPNG.toRGBA8.decodeImage( frm.data, fw, fh, out );
  166. if ( i != 0 ) for ( var j = 0; j < len; j ++ ) prev[ j ] = img[ j ];
  167. if ( frm.blend == 0 ) UPNG._copyTile( fdata, fw, fh, img, w, h, fx, fy, 0 );
  168. else if ( frm.blend == 1 ) UPNG._copyTile( fdata, fw, fh, img, w, h, fx, fy, 1 );
  169. frms.push( img.buffer.slice( 0 ) );
  170. if ( frm.dispose == 1 ) UPNG._copyTile( empty, fw, fh, img, w, h, fx, fy, 0 );
  171. else if ( frm.dispose == 2 ) for ( var j = 0; j < len; j ++ ) img[ j ] = prev[ j ];
  172. }
  173. return frms;
  174. };
  175. UPNG.toRGBA8.decodeImage = function ( data, w, h, out ) {
  176. var area = w * h, bpp = UPNG.decode._getBPP( out );
  177. var bpl = Math.ceil( w * bpp / 8 ); // bytes per line
  178. var bf = new Uint8Array( area * 4 ), bf32 = new Uint32Array( bf.buffer );
  179. var ctype = out.ctype, depth = out.depth;
  180. var rs = UPNG._bin.readUshort;
  181. if ( ctype == 6 ) { // RGB + alpha
  182. var qarea = area << 2;
  183. if ( depth == 8 ) for ( var i = 0; i < qarea; i += 4 ) {
  184. bf[ i ] = data[ i ]; bf[ i + 1 ] = data[ i + 1 ]; bf[ i + 2 ] = data[ i + 2 ]; bf[ i + 3 ] = data[ i + 3 ];
  185. }
  186. if ( depth == 16 ) for ( var i = 0; i < qarea; i ++ ) {
  187. bf[ i ] = data[ i << 1 ];
  188. }
  189. } else if ( ctype == 2 ) { // RGB
  190. var ts = out.tabs[ 'tRNS' ];
  191. if ( ts == null ) {
  192. if ( depth == 8 ) for ( var i = 0; i < area; i ++ ) {
  193. var ti = i * 3; bf32[ i ] = ( 255 << 24 ) | ( data[ ti + 2 ] << 16 ) | ( data[ ti + 1 ] << 8 ) | data[ ti ];
  194. }
  195. if ( depth == 16 ) for ( var i = 0; i < area; i ++ ) {
  196. var ti = i * 6; bf32[ i ] = ( 255 << 24 ) | ( data[ ti + 4 ] << 16 ) | ( data[ ti + 2 ] << 8 ) | data[ ti ];
  197. }
  198. } else {
  199. var tr = ts[ 0 ], tg = ts[ 1 ], tb = ts[ 2 ];
  200. if ( depth == 8 ) for ( var i = 0; i < area; i ++ ) {
  201. var qi = i << 2, ti = i * 3; bf32[ i ] = ( 255 << 24 ) | ( data[ ti + 2 ] << 16 ) | ( data[ ti + 1 ] << 8 ) | data[ ti ];
  202. if ( data[ ti ] == tr && data[ ti + 1 ] == tg && data[ ti + 2 ] == tb ) bf[ qi + 3 ] = 0;
  203. }
  204. if ( depth == 16 ) for ( var i = 0; i < area; i ++ ) {
  205. var qi = i << 2, ti = i * 6; bf32[ i ] = ( 255 << 24 ) | ( data[ ti + 4 ] << 16 ) | ( data[ ti + 2 ] << 8 ) | data[ ti ];
  206. if ( rs( data, ti ) == tr && rs( data, ti + 2 ) == tg && rs( data, ti + 4 ) == tb ) bf[ qi + 3 ] = 0;
  207. }
  208. }
  209. } else if ( ctype == 3 ) { // palette
  210. var p = out.tabs[ 'PLTE' ], ap = out.tabs[ 'tRNS' ], tl = ap ? ap.length : 0;
  211. //console.log(p, ap);
  212. if ( depth == 1 ) for ( var y = 0; y < h; y ++ ) {
  213. var s0 = y * bpl, t0 = y * w;
  214. for ( var i = 0; i < w; i ++ ) {
  215. var qi = ( t0 + i ) << 2, j = ( ( data[ s0 + ( i >> 3 ) ] >> ( 7 - ( ( i & 7 ) << 0 ) ) ) & 1 ), cj = 3 * j; bf[ qi ] = p[ cj ]; bf[ qi + 1 ] = p[ cj + 1 ]; bf[ qi + 2 ] = p[ cj + 2 ]; bf[ qi + 3 ] = ( j < tl ) ? ap[ j ] : 255;
  216. }
  217. }
  218. if ( depth == 2 ) for ( var y = 0; y < h; y ++ ) {
  219. var s0 = y * bpl, t0 = y * w;
  220. for ( var i = 0; i < w; i ++ ) {
  221. var qi = ( t0 + i ) << 2, j = ( ( data[ s0 + ( i >> 2 ) ] >> ( 6 - ( ( i & 3 ) << 1 ) ) ) & 3 ), cj = 3 * j; bf[ qi ] = p[ cj ]; bf[ qi + 1 ] = p[ cj + 1 ]; bf[ qi + 2 ] = p[ cj + 2 ]; bf[ qi + 3 ] = ( j < tl ) ? ap[ j ] : 255;
  222. }
  223. }
  224. if ( depth == 4 ) for ( var y = 0; y < h; y ++ ) {
  225. var s0 = y * bpl, t0 = y * w;
  226. for ( var i = 0; i < w; i ++ ) {
  227. var qi = ( t0 + i ) << 2, j = ( ( data[ s0 + ( i >> 1 ) ] >> ( 4 - ( ( i & 1 ) << 2 ) ) ) & 15 ), cj = 3 * j; bf[ qi ] = p[ cj ]; bf[ qi + 1 ] = p[ cj + 1 ]; bf[ qi + 2 ] = p[ cj + 2 ]; bf[ qi + 3 ] = ( j < tl ) ? ap[ j ] : 255;
  228. }
  229. }
  230. if ( depth == 8 ) for ( var i = 0; i < area; i ++ ) {
  231. var qi = i << 2, j = data[ i ], cj = 3 * j; bf[ qi ] = p[ cj ]; bf[ qi + 1 ] = p[ cj + 1 ]; bf[ qi + 2 ] = p[ cj + 2 ]; bf[ qi + 3 ] = ( j < tl ) ? ap[ j ] : 255;
  232. }
  233. } else if ( ctype == 4 ) { // gray + alpha
  234. if ( depth == 8 ) for ( var i = 0; i < area; i ++ ) {
  235. var qi = i << 2, di = i << 1, gr = data[ di ]; bf[ qi ] = gr; bf[ qi + 1 ] = gr; bf[ qi + 2 ] = gr; bf[ qi + 3 ] = data[ di + 1 ];
  236. }
  237. if ( depth == 16 ) for ( var i = 0; i < area; i ++ ) {
  238. var qi = i << 2, di = i << 2, gr = data[ di ]; bf[ qi ] = gr; bf[ qi + 1 ] = gr; bf[ qi + 2 ] = gr; bf[ qi + 3 ] = data[ di + 2 ];
  239. }
  240. } else if ( ctype == 0 ) { // gray
  241. var tr = out.tabs[ 'tRNS' ] ? out.tabs[ 'tRNS' ] : - 1;
  242. for ( var y = 0; y < h; y ++ ) {
  243. var off = y * bpl, to = y * w;
  244. if ( depth == 1 ) for ( var x = 0; x < w; x ++ ) {
  245. var gr = 255 * ( ( data[ off + ( x >>> 3 ) ] >>> ( 7 - ( x & 7 ) ) ) & 1 ), al = ( gr == tr * 255 ) ? 0 : 255; bf32[ to + x ] = ( al << 24 ) | ( gr << 16 ) | ( gr << 8 ) | gr;
  246. }
  247. else if ( depth == 2 ) for ( var x = 0; x < w; x ++ ) {
  248. var gr = 85 * ( ( data[ off + ( x >>> 2 ) ] >>> ( 6 - ( ( x & 3 ) << 1 ) ) ) & 3 ), al = ( gr == tr * 85 ) ? 0 : 255; bf32[ to + x ] = ( al << 24 ) | ( gr << 16 ) | ( gr << 8 ) | gr;
  249. }
  250. else if ( depth == 4 ) for ( var x = 0; x < w; x ++ ) {
  251. var gr = 17 * ( ( data[ off + ( x >>> 1 ) ] >>> ( 4 - ( ( x & 1 ) << 2 ) ) ) & 15 ), al = ( gr == tr * 17 ) ? 0 : 255; bf32[ to + x ] = ( al << 24 ) | ( gr << 16 ) | ( gr << 8 ) | gr;
  252. }
  253. else if ( depth == 8 ) for ( var x = 0; x < w; x ++ ) {
  254. var gr = data[ off + x ], al = ( gr == tr ) ? 0 : 255; bf32[ to + x ] = ( al << 24 ) | ( gr << 16 ) | ( gr << 8 ) | gr;
  255. }
  256. else if ( depth == 16 ) for ( var x = 0; x < w; x ++ ) {
  257. var gr = data[ off + ( x << 1 ) ], al = ( rs( data, off + ( x << 1 ) ) == tr ) ? 0 : 255; bf32[ to + x ] = ( al << 24 ) | ( gr << 16 ) | ( gr << 8 ) | gr;
  258. }
  259. }
  260. }
  261. //console.log(Date.now()-time);
  262. return bf;
  263. };
  264. UPNG.decode = function ( buff ) {
  265. var data = new Uint8Array( buff ), offset = 8, bin = UPNG._bin, rUs = bin.readUshort, rUi = bin.readUint;
  266. var out = { tabs: {}, frames: [] };
  267. var dd = new Uint8Array( data.length ), doff = 0; // put all IDAT data into it
  268. var fd, foff = 0; // frames
  269. var text, keyw, bfr;
  270. var mgck = [ 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a ];
  271. for ( var i = 0; i < 8; i ++ ) if ( data[ i ] != mgck[ i ] ) throw new Error( 'The input is not a PNG file!' );
  272. while ( offset < data.length ) {
  273. var len = bin.readUint( data, offset ); offset += 4;
  274. var type = bin.readASCII( data, offset, 4 ); offset += 4;
  275. //console.log(type,len);
  276. if ( type == 'IHDR' ) {
  277. UPNG.decode._IHDR( data, offset, out );
  278. } else if ( type == 'CgBI' ) {
  279. out.tabs[ type ] = data.slice( offset, offset + 4 );
  280. } else if ( type == 'IDAT' ) {
  281. for ( var i = 0; i < len; i ++ ) dd[ doff + i ] = data[ offset + i ];
  282. doff += len;
  283. } else if ( type == 'acTL' ) {
  284. out.tabs[ type ] = { num_frames: rUi( data, offset ), num_plays: rUi( data, offset + 4 ) };
  285. fd = new Uint8Array( data.length );
  286. } else if ( type == 'fcTL' ) {
  287. if ( foff != 0 ) {
  288. var fr = out.frames[ out.frames.length - 1 ];
  289. fr.data = UPNG.decode._decompress( out, fd.slice( 0, foff ), fr.rect.width, fr.rect.height ); foff = 0;
  290. }
  291. var rct = { x: rUi( data, offset + 12 ), y: rUi( data, offset + 16 ), width: rUi( data, offset + 4 ), height: rUi( data, offset + 8 ) };
  292. var del = rUs( data, offset + 22 ); del = rUs( data, offset + 20 ) / ( del == 0 ? 100 : del );
  293. var frm = { rect: rct, delay: Math.round( del * 1000 ), dispose: data[ offset + 24 ], blend: data[ offset + 25 ] };
  294. //console.log(frm);
  295. out.frames.push( frm );
  296. } else if ( type == 'fdAT' ) {
  297. for ( var i = 0; i < len - 4; i ++ ) fd[ foff + i ] = data[ offset + i + 4 ];
  298. foff += len - 4;
  299. } else if ( type == 'pHYs' ) {
  300. out.tabs[ type ] = [ bin.readUint( data, offset ), bin.readUint( data, offset + 4 ), data[ offset + 8 ] ];
  301. } else if ( type == 'cHRM' ) {
  302. out.tabs[ type ] = [];
  303. for ( var i = 0; i < 8; i ++ ) out.tabs[ type ].push( bin.readUint( data, offset + i * 4 ) );
  304. } else if ( type == 'tEXt' || type == 'zTXt' ) {
  305. if ( out.tabs[ type ] == null ) out.tabs[ type ] = {};
  306. var nz = bin.nextZero( data, offset );
  307. keyw = bin.readASCII( data, offset, nz - offset );
  308. var tl = offset + len - nz - 1;
  309. if ( type == 'tEXt' ) text = bin.readASCII( data, nz + 1, tl );
  310. else {
  311. bfr = UPNG.decode._inflate( data.slice( nz + 2, nz + 2 + tl ) );
  312. text = bin.readUTF8( bfr, 0, bfr.length );
  313. }
  314. out.tabs[ type ][ keyw ] = text;
  315. } else if ( type == 'iTXt' ) {
  316. if ( out.tabs[ type ] == null ) out.tabs[ type ] = {};
  317. var nz = 0, off = offset;
  318. nz = bin.nextZero( data, off );
  319. keyw = bin.readASCII( data, off, nz - off ); off = nz + 1;
  320. var cflag = data[ off ]; off += 2;
  321. nz = bin.nextZero( data, off );
  322. bin.readASCII( data, off, nz - off ); off = nz + 1;
  323. nz = bin.nextZero( data, off );
  324. bin.readUTF8( data, off, nz - off ); off = nz + 1;
  325. var tl = len - ( off - offset );
  326. if ( cflag == 0 ) text = bin.readUTF8( data, off, tl );
  327. else {
  328. bfr = UPNG.decode._inflate( data.slice( off, off + tl ) );
  329. text = bin.readUTF8( bfr, 0, bfr.length );
  330. }
  331. out.tabs[ type ][ keyw ] = text;
  332. } else if ( type == 'PLTE' ) {
  333. out.tabs[ type ] = bin.readBytes( data, offset, len );
  334. } else if ( type == 'hIST' ) {
  335. var pl = out.tabs[ 'PLTE' ].length / 3;
  336. out.tabs[ type ] = []; for ( var i = 0; i < pl; i ++ ) out.tabs[ type ].push( rUs( data, offset + i * 2 ) );
  337. } else if ( type == 'tRNS' ) {
  338. if ( out.ctype == 3 ) out.tabs[ type ] = bin.readBytes( data, offset, len );
  339. else if ( out.ctype == 0 ) out.tabs[ type ] = rUs( data, offset );
  340. else if ( out.ctype == 2 ) out.tabs[ type ] = [ rUs( data, offset ), rUs( data, offset + 2 ), rUs( data, offset + 4 ) ];
  341. //else console.log("tRNS for unsupported color type",out.ctype, len);
  342. } else if ( type == 'gAMA' ) out.tabs[ type ] = bin.readUint( data, offset ) / 100000;
  343. else if ( type == 'sRGB' ) out.tabs[ type ] = data[ offset ];
  344. else if ( type == 'bKGD' ) {
  345. if ( out.ctype == 0 || out.ctype == 4 ) out.tabs[ type ] = [ rUs( data, offset ) ];
  346. else if ( out.ctype == 2 || out.ctype == 6 ) out.tabs[ type ] = [ rUs( data, offset ), rUs( data, offset + 2 ), rUs( data, offset + 4 ) ];
  347. else if ( out.ctype == 3 ) out.tabs[ type ] = data[ offset ];
  348. } else if ( type == 'IEND' ) {
  349. break;
  350. }
  351. //else { console.log("unknown chunk type", type, len); out.tabs[type]=data.slice(offset,offset+len); }
  352. offset += len;
  353. bin.readUint( data, offset ); offset += 4;
  354. }
  355. if ( foff != 0 ) {
  356. var fr = out.frames[ out.frames.length - 1 ];
  357. fr.data = UPNG.decode._decompress( out, fd.slice( 0, foff ), fr.rect.width, fr.rect.height );
  358. }
  359. out.data = UPNG.decode._decompress( out, dd, out.width, out.height );
  360. delete out.compress; delete out.interlace; delete out.filter;
  361. return out;
  362. };
  363. UPNG.decode._decompress = function ( out, dd, w, h ) {
  364. var bpp = UPNG.decode._getBPP( out ), bpl = Math.ceil( w * bpp / 8 ), buff = new Uint8Array( ( bpl + 1 + out.interlace ) * h );
  365. if ( out.tabs[ 'CgBI' ] ) dd = UPNG.inflateRaw( dd, buff );
  366. else dd = UPNG.decode._inflate( dd, buff );
  367. if ( out.interlace == 0 ) dd = UPNG.decode._filterZero( dd, out, 0, w, h );
  368. else if ( out.interlace == 1 ) dd = UPNG.decode._readInterlace( dd, out );
  369. return dd;
  370. };
  371. UPNG.decode._inflate = function ( data, buff ) {
  372. var out = UPNG[ 'inflateRaw' ]( new Uint8Array( data.buffer, 2, data.length - 6 ), buff ); return out;
  373. };
  374. UPNG.inflateRaw = function () {
  375. var H = {}; H.H = {}; H.H.N = function ( N, W ) {
  376. var R = Uint8Array, i = 0, m = 0, J = 0, h = 0, Q = 0, X = 0, u = 0, w = 0, d = 0, v, C;
  377. if ( N[ 0 ] == 3 && N[ 1 ] == 0 ) return W ? W : new R( 0 ); var V = H.H, n = V.b, A = V.e, l = V.R, M = V.n, I = V.A, e = V.Z, b = V.m, Z = W == null;
  378. if ( Z )W = new R( N.length >>> 2 << 5 ); while ( i == 0 ) {
  379. i = n( N, d, 1 ); m = n( N, d + 1, 2 ); d += 3; if ( m == 0 ) {
  380. if ( ( d & 7 ) != 0 )d += 8 - ( d & 7 );
  381. var D = ( d >>> 3 ) + 4, q = N[ D - 4 ] | N[ D - 3 ] << 8; if ( Z )W = H.H.W( W, w + q ); W.set( new R( N.buffer, N.byteOffset + D, q ), w ); d = D + q << 3;
  382. w += q; continue
  383. ;
  384. }
  385. if ( Z )W = H.H.W( W, w + ( 1 << 17 ) ); if ( m == 1 ) {
  386. v = b.J; C = b.h; X = ( 1 << 9 ) - 1; u = ( 1 << 5 ) - 1;
  387. }
  388. if ( m == 2 ) {
  389. J = A( N, d, 5 ) + 257;
  390. h = A( N, d + 5, 5 ) + 1; Q = A( N, d + 10, 4 ) + 4; d += 14; var j = 1; for ( var c = 0; c < 38; c += 2 ) {
  391. b.Q[ c ] = 0; b.Q[ c + 1 ] = 0;
  392. }
  393. for ( var c = 0;
  394. c < Q; c ++ ) {
  395. var K = A( N, d + c * 3, 3 ); b.Q[ ( b.X[ c ] << 1 ) + 1 ] = K; if ( K > j )j = K
  396. ;
  397. }
  398. d += 3 * Q; M( b.Q, j ); I( b.Q, j, b.u ); v = b.w; C = b.d;
  399. d = l( b.u, ( 1 << j ) - 1, J + h, N, d, b.v ); var r = V.V( b.v, 0, J, b.C ); X = ( 1 << r ) - 1; var S = V.V( b.v, J, h, b.D ); u = ( 1 << S ) - 1; M( b.C, r );
  400. I( b.C, r, v ); M( b.D, S ); I( b.D, S, C )
  401. ;
  402. }
  403. while ( ! 0 ) {
  404. var T = v[ e( N, d ) & X ]; d += T & 15; var p = T >>> 4; if ( p >>> 8 == 0 ) {
  405. W[ w ++ ] = p;
  406. } else if ( p == 256 ) {
  407. break;
  408. } else {
  409. var z = w + p - 254;
  410. if ( p > 264 ) {
  411. var _ = b.q[ p - 257 ]; z = w + ( _ >>> 3 ) + A( N, d, _ & 7 ); d += _ & 7;
  412. }
  413. var $ = C[ e( N, d ) & u ]; d += $ & 15; var s = $ >>> 4, Y = b.c[ s ], a = ( Y >>> 4 ) + n( N, d, Y & 15 );
  414. d += Y & 15; while ( w < z ) {
  415. W[ w ] = W[ w ++ - a ]; W[ w ] = W[ w ++ - a ]; W[ w ] = W[ w ++ - a ]; W[ w ] = W[ w ++ - a ];
  416. }
  417. w = z
  418. ;
  419. }
  420. }
  421. }
  422. return W.length == w ? W : W.slice( 0, w )
  423. ;
  424. };
  425. H.H.W = function ( N, W ) {
  426. var R = N.length; if ( W <= R ) return N; var V = new Uint8Array( R << 1 ); V.set( N, 0 ); return V;
  427. };
  428. H.H.R = function ( N, W, R, V, n, A ) {
  429. var l = H.H.e, M = H.H.Z, I = 0; while ( I < R ) {
  430. var e = N[ M( V, n ) & W ]; n += e & 15; var b = e >>> 4;
  431. if ( b <= 15 ) {
  432. A[ I ] = b; I ++;
  433. } else {
  434. var Z = 0, m = 0; if ( b == 16 ) {
  435. m = 3 + l( V, n, 2 ); n += 2; Z = A[ I - 1 ];
  436. } else if ( b == 17 ) {
  437. m = 3 + l( V, n, 3 );
  438. n += 3
  439. ;
  440. } else if ( b == 18 ) {
  441. m = 11 + l( V, n, 7 ); n += 7;
  442. }
  443. var J = I + m; while ( I < J ) {
  444. A[ I ] = Z; I ++;
  445. }
  446. }
  447. }
  448. return n
  449. ;
  450. };
  451. H.H.V = function ( N, W, R, V ) {
  452. var n = 0, A = 0, l = V.length >>> 1;
  453. while ( A < R ) {
  454. var M = N[ A + W ]; V[ A << 1 ] = 0; V[ ( A << 1 ) + 1 ] = M; if ( M > n )n = M; A ++;
  455. }
  456. while ( A < l ) {
  457. V[ A << 1 ] = 0; V[ ( A << 1 ) + 1 ] = 0; A ++;
  458. }
  459. return n
  460. ;
  461. };
  462. H.H.n = function ( N, W ) {
  463. var R = H.H.m, V = N.length, n, A, l, M, I, e = R.j; for ( var M = 0; M <= W; M ++ )e[ M ] = 0; for ( M = 1; M < V; M += 2 )e[ N[ M ] ] ++;
  464. var b = R.K; n = 0; e[ 0 ] = 0; for ( A = 1; A <= W; A ++ ) {
  465. n = n + e[ A - 1 ] << 1; b[ A ] = n;
  466. }
  467. for ( l = 0; l < V; l += 2 ) {
  468. I = N[ l + 1 ]; if ( I != 0 ) {
  469. N[ l ] = b[ I ];
  470. b[ I ] ++
  471. ;
  472. }
  473. }
  474. };
  475. H.H.A = function ( N, W, R ) {
  476. var V = N.length, n = H.H.m, A = n.r; for ( var l = 0; l < V; l += 2 ) if ( N[ l + 1 ] != 0 ) {
  477. var M = l >> 1, I = N[ l + 1 ], e = M << 4 | I, b = W - I, Z = N[ l ] << b, m = Z + ( 1 << b );
  478. while ( Z != m ) {
  479. var J = A[ Z ] >>> 15 - W; R[ J ] = e; Z ++;
  480. }
  481. }
  482. };
  483. H.H.l = function ( N, W ) {
  484. var R = H.H.m.r, V = 15 - W; for ( var n = 0; n < N.length;
  485. n += 2 ) {
  486. var A = N[ n ] << W - N[ n + 1 ]; N[ n ] = R[ A ] >>> V;
  487. }
  488. };
  489. H.H.M = function ( N, W, R ) {
  490. R = R << ( W & 7 ); var V = W >>> 3; N[ V ] |= R; N[ V + 1 ] |= R >>> 8;
  491. };
  492. H.H.I = function ( N, W, R ) {
  493. R = R << ( W & 7 ); var V = W >>> 3; N[ V ] |= R; N[ V + 1 ] |= R >>> 8; N[ V + 2 ] |= R >>> 16;
  494. };
  495. H.H.e = function ( N, W, R ) {
  496. return ( N[ W >>> 3 ] | N[ ( W >>> 3 ) + 1 ] << 8 ) >>> ( W & 7 ) & ( 1 << R ) - 1;
  497. };
  498. H.H.b = function ( N, W, R ) {
  499. return ( N[ W >>> 3 ] | N[ ( W >>> 3 ) + 1 ] << 8 | N[ ( W >>> 3 ) + 2 ] << 16 ) >>> ( W & 7 ) & ( 1 << R ) - 1;
  500. };
  501. H.H.Z = function ( N, W ) {
  502. return ( N[ W >>> 3 ] | N[ ( W >>> 3 ) + 1 ] << 8 | N[ ( W >>> 3 ) + 2 ] << 16 ) >>> ( W & 7 );
  503. };
  504. H.H.i = function ( N, W ) {
  505. return ( N[ W >>> 3 ] | N[ ( W >>> 3 ) + 1 ] << 8 | N[ ( W >>> 3 ) + 2 ] << 16 | N[ ( W >>> 3 ) + 3 ] << 24 ) >>> ( W & 7 );
  506. };
  507. H.H.m = function () {
  508. var N = Uint16Array, W = Uint32Array;
  509. return { K: new N( 16 ), j: new N( 16 ), X: [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ], S: [ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 999, 999, 999 ], T: [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0, 0 ], q: new N( 32 ), p: [ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 65535, 65535 ], z: [ 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 0, 0 ], c: new W( 32 ), J: new N( 512 ), _: [], h: new N( 32 ), $: [], w: new N( 32768 ), C: [], v: [], d: new N( 32768 ), D: [], u: new N( 512 ), Q: [], r: new N( 1 << 15 ), s: new W( 286 ), Y: new W( 30 ), a: new W( 19 ), t: new W( 15e3 ), k: new N( 1 << 16 ), g: new N( 1 << 15 ) }
  510. ;
  511. }();
  512. ( function () {
  513. var N = H.H.m, W = 1 << 15; for ( var R = 0; R < W; R ++ ) {
  514. var V = R; V = ( V & 2863311530 ) >>> 1 | ( V & 1431655765 ) << 1;
  515. V = ( V & 3435973836 ) >>> 2 | ( V & 858993459 ) << 2; V = ( V & 4042322160 ) >>> 4 | ( V & 252645135 ) << 4; V = ( V & 4278255360 ) >>> 8 | ( V & 16711935 ) << 8;
  516. N.r[ R ] = ( V >>> 16 | V << 16 ) >>> 17
  517. ;
  518. }
  519. function n( A, l, M ) {
  520. while ( l -- != 0 )A.push( 0, M )
  521. ;
  522. }
  523. for ( var R = 0; R < 32; R ++ ) {
  524. N.q[ R ] = N.S[ R ] << 3 | N.T[ R ];
  525. N.c[ R ] = N.p[ R ] << 4 | N.z[ R ]
  526. ;
  527. }
  528. n( N._, 144, 8 ); n( N._, 255 - 143, 9 ); n( N._, 279 - 255, 7 ); n( N._, 287 - 279, 8 ); H.H.n( N._, 9 );
  529. H.H.A( N._, 9, N.J ); H.H.l( N._, 9 ); n( N.$, 32, 5 ); H.H.n( N.$, 5 ); H.H.A( N.$, 5, N.h ); H.H.l( N.$, 5 ); n( N.Q, 19, 0 ); n( N.C, 286, 0 );
  530. n( N.D, 30, 0 ); n( N.v, 320, 0 )
  531. ;
  532. }() );
  533. return H.H.N
  534. ;
  535. }();
  536. UPNG.decode._readInterlace = function ( data, out ) {
  537. var w = out.width, h = out.height;
  538. var bpp = UPNG.decode._getBPP( out ), cbpp = bpp >> 3, bpl = Math.ceil( w * bpp / 8 );
  539. var img = new Uint8Array( h * bpl );
  540. var di = 0;
  541. var starting_row = [ 0, 0, 4, 0, 2, 0, 1 ];
  542. var starting_col = [ 0, 4, 0, 2, 0, 1, 0 ];
  543. var row_increment = [ 8, 8, 8, 4, 4, 2, 2 ];
  544. var col_increment = [ 8, 8, 4, 4, 2, 2, 1 ];
  545. var pass = 0;
  546. while ( pass < 7 ) {
  547. var ri = row_increment[ pass ], ci = col_increment[ pass ];
  548. var sw = 0, sh = 0;
  549. var cr = starting_row[ pass ]; while ( cr < h ) {
  550. cr += ri; sh ++;
  551. }
  552. var cc = starting_col[ pass ]; while ( cc < w ) {
  553. cc += ci; sw ++;
  554. }
  555. var bpll = Math.ceil( sw * bpp / 8 );
  556. UPNG.decode._filterZero( data, out, di, sw, sh );
  557. var y = 0, row = starting_row[ pass ];
  558. var val;
  559. while ( row < h ) {
  560. var col = starting_col[ pass ];
  561. var cdi = ( di + y * bpll ) << 3;
  562. while ( col < w ) {
  563. if ( bpp == 1 ) {
  564. val = data[ cdi >> 3 ]; val = ( val >> ( 7 - ( cdi & 7 ) ) ) & 1;
  565. img[ row * bpl + ( col >> 3 ) ] |= ( val << ( 7 - ( ( col & 7 ) << 0 ) ) );
  566. }
  567. if ( bpp == 2 ) {
  568. val = data[ cdi >> 3 ]; val = ( val >> ( 6 - ( cdi & 7 ) ) ) & 3;
  569. img[ row * bpl + ( col >> 2 ) ] |= ( val << ( 6 - ( ( col & 3 ) << 1 ) ) );
  570. }
  571. if ( bpp == 4 ) {
  572. val = data[ cdi >> 3 ]; val = ( val >> ( 4 - ( cdi & 7 ) ) ) & 15;
  573. img[ row * bpl + ( col >> 1 ) ] |= ( val << ( 4 - ( ( col & 1 ) << 2 ) ) );
  574. }
  575. if ( bpp >= 8 ) {
  576. var ii = row * bpl + col * cbpp;
  577. for ( var j = 0; j < cbpp; j ++ ) img[ ii + j ] = data[ ( cdi >> 3 ) + j ];
  578. }
  579. cdi += bpp; col += ci;
  580. }
  581. y ++; row += ri;
  582. }
  583. if ( sw * sh != 0 ) di += sh * ( 1 + bpll );
  584. pass = pass + 1;
  585. }
  586. return img;
  587. };
  588. UPNG.decode._getBPP = function ( out ) {
  589. var noc = [ 1, null, 3, 1, 2, null, 4 ][ out.ctype ];
  590. return noc * out.depth;
  591. };
  592. UPNG.decode._filterZero = function ( data, out, off, w, h ) {
  593. var bpp = UPNG.decode._getBPP( out ), bpl = Math.ceil( w * bpp / 8 ), paeth = UPNG.decode._paeth;
  594. bpp = Math.ceil( bpp / 8 );
  595. var i, di, type = data[ off ], x = 0;
  596. if ( type > 1 ) data[ off ] = [ 0, 0, 1 ][ type - 2 ];
  597. if ( type == 3 ) for ( x = bpp; x < bpl; x ++ ) data[ x + 1 ] = ( data[ x + 1 ] + ( data[ x + 1 - bpp ] >>> 1 ) ) & 255;
  598. for ( var y = 0; y < h; y ++ ) {
  599. i = off + y * bpl; di = i + y + 1;
  600. type = data[ di - 1 ]; x = 0;
  601. if ( type == 0 ) for ( ; x < bpl; x ++ ) data[ i + x ] = data[ di + x ];
  602. else if ( type == 1 ) {
  603. for ( ; x < bpp; x ++ ) data[ i + x ] = data[ di + x ];
  604. for ( ; x < bpl; x ++ ) data[ i + x ] = ( data[ di + x ] + data[ i + x - bpp ] );
  605. } else if ( type == 2 ) {
  606. for ( ; x < bpl; x ++ ) data[ i + x ] = ( data[ di + x ] + data[ i + x - bpl ] );
  607. } else if ( type == 3 ) {
  608. for ( ; x < bpp; x ++ ) data[ i + x ] = ( data[ di + x ] + ( data[ i + x - bpl ] >>> 1 ) );
  609. for ( ; x < bpl; x ++ ) data[ i + x ] = ( data[ di + x ] + ( ( data[ i + x - bpl ] + data[ i + x - bpp ] ) >>> 1 ) );
  610. } else {
  611. for ( ; x < bpp; x ++ ) data[ i + x ] = ( data[ di + x ] + paeth( 0, data[ i + x - bpl ], 0 ) );
  612. for ( ; x < bpl; x ++ ) data[ i + x ] = ( data[ di + x ] + paeth( data[ i + x - bpp ], data[ i + x - bpl ], data[ i + x - bpp - bpl ] ) );
  613. }
  614. }
  615. return data;
  616. };
  617. UPNG.decode._paeth = function ( a, b, c ) {
  618. var p = a + b - c, pa = ( p - a ), pb = ( p - b ), pc = ( p - c );
  619. if ( pa * pa <= pb * pb && pa * pa <= pc * pc ) return a;
  620. else if ( pb * pb <= pc * pc ) return b;
  621. return c;
  622. };
  623. UPNG.decode._IHDR = function ( data, offset, out ) {
  624. var bin = UPNG._bin;
  625. out.width = bin.readUint( data, offset ); offset += 4;
  626. out.height = bin.readUint( data, offset ); offset += 4;
  627. out.depth = data[ offset ]; offset ++;
  628. out.ctype = data[ offset ]; offset ++;
  629. out.compress = data[ offset ]; offset ++;
  630. out.filter = data[ offset ]; offset ++;
  631. out.interlace = data[ offset ]; offset ++;
  632. };
  633. UPNG._bin = {
  634. nextZero: function ( data, p ) {
  635. while ( data[ p ] != 0 ) p ++; return p;
  636. },
  637. readUshort: function ( buff, p ) {
  638. return ( buff[ p ] << 8 ) | buff[ p + 1 ];
  639. },
  640. writeUshort: function ( buff, p, n ) {
  641. buff[ p ] = ( n >> 8 ) & 255; buff[ p + 1 ] = n & 255;
  642. },
  643. readUint: function ( buff, p ) {
  644. return ( buff[ p ] * ( 256 * 256 * 256 ) ) + ( ( buff[ p + 1 ] << 16 ) | ( buff[ p + 2 ] << 8 ) | buff[ p + 3 ] );
  645. },
  646. writeUint: function ( buff, p, n ) {
  647. buff[ p ] = ( n >> 24 ) & 255; buff[ p + 1 ] = ( n >> 16 ) & 255; buff[ p + 2 ] = ( n >> 8 ) & 255; buff[ p + 3 ] = n & 255;
  648. },
  649. readASCII: function ( buff, p, l ) {
  650. var s = ''; for ( var i = 0; i < l; i ++ ) s += String.fromCharCode( buff[ p + i ] ); return s;
  651. },
  652. writeASCII: function ( data, p, s ) {
  653. for ( var i = 0; i < s.length; i ++ ) data[ p + i ] = s.charCodeAt( i );
  654. },
  655. readBytes: function ( buff, p, l ) {
  656. var arr = []; for ( var i = 0; i < l; i ++ ) arr.push( buff[ p + i ] ); return arr;
  657. },
  658. pad: function ( n ) {
  659. return n.length < 2 ? '0' + n : n;
  660. },
  661. readUTF8: function ( buff, p, l ) {
  662. var s = '', ns;
  663. for ( var i = 0; i < l; i ++ ) s += '%' + UPNG._bin.pad( buff[ p + i ].toString( 16 ) );
  664. try {
  665. ns = decodeURIComponent( s );
  666. } catch ( e ) {
  667. return UPNG._bin.readASCII( buff, p, l );
  668. }
  669. return ns;
  670. }
  671. };
  672. UPNG._copyTile = function ( sb, sw, sh, tb, tw, th, xoff, yoff, mode ) {
  673. var w = Math.min( sw, tw ), h = Math.min( sh, th );
  674. var si = 0, ti = 0;
  675. for ( var y = 0; y < h; y ++ )
  676. for ( var x = 0; x < w; x ++ ) {
  677. if ( xoff >= 0 && yoff >= 0 ) {
  678. si = ( y * sw + x ) << 2; ti = ( ( yoff + y ) * tw + xoff + x ) << 2;
  679. } else {
  680. si = ( ( - yoff + y ) * sw - xoff + x ) << 2; ti = ( y * tw + x ) << 2;
  681. }
  682. if ( mode == 0 ) {
  683. tb[ ti ] = sb[ si ]; tb[ ti + 1 ] = sb[ si + 1 ]; tb[ ti + 2 ] = sb[ si + 2 ]; tb[ ti + 3 ] = sb[ si + 3 ];
  684. } else if ( mode == 1 ) {
  685. var fa = sb[ si + 3 ] * ( 1 / 255 ), fr = sb[ si ] * fa, fg = sb[ si + 1 ] * fa, fb = sb[ si + 2 ] * fa;
  686. var ba = tb[ ti + 3 ] * ( 1 / 255 ), br = tb[ ti ] * ba, bg = tb[ ti + 1 ] * ba, bb = tb[ ti + 2 ] * ba;
  687. var ifa = 1 - fa, oa = fa + ba * ifa, ioa = ( oa == 0 ? 0 : 1 / oa );
  688. tb[ ti + 3 ] = 255 * oa;
  689. tb[ ti + 0 ] = ( fr + br * ifa ) * ioa;
  690. tb[ ti + 1 ] = ( fg + bg * ifa ) * ioa;
  691. tb[ ti + 2 ] = ( fb + bb * ifa ) * ioa;
  692. } else if ( mode == 2 ) { // copy only differences, otherwise zero
  693. var fa = sb[ si + 3 ], fr = sb[ si ], fg = sb[ si + 1 ], fb = sb[ si + 2 ];
  694. var ba = tb[ ti + 3 ], br = tb[ ti ], bg = tb[ ti + 1 ], bb = tb[ ti + 2 ];
  695. if ( fa == ba && fr == br && fg == bg && fb == bb ) {
  696. tb[ ti ] = 0; tb[ ti + 1 ] = 0; tb[ ti + 2 ] = 0; tb[ ti + 3 ] = 0;
  697. } else {
  698. tb[ ti ] = fr; tb[ ti + 1 ] = fg; tb[ ti + 2 ] = fb; tb[ ti + 3 ] = fa;
  699. }
  700. } else if ( mode == 3 ) { // check if can be blended
  701. var fa = sb[ si + 3 ], fr = sb[ si ], fg = sb[ si + 1 ], fb = sb[ si + 2 ];
  702. var ba = tb[ ti + 3 ], br = tb[ ti ], bg = tb[ ti + 1 ], bb = tb[ ti + 2 ];
  703. if ( fa == ba && fr == br && fg == bg && fb == bb ) continue;
  704. //if(fa!=255 && ba!=0) return false;
  705. if ( fa < 220 && ba > 20 ) return false;
  706. }
  707. }
  708. return true;
  709. };
  710. export { RGBMLoader };