RGBMLoader.js 30 KB

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