LercDecode.js 87 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324
  1. /* jshint forin: false, bitwise: false */
  2. /*
  3. Copyright 2015-2021 Esri
  4. Licensed under the Apache License, Version 2.0 (the "License");
  5. you may not use this file except in compliance with the License.
  6. You may obtain a copy of the License at
  7. http://www.apache.org/licenses/LICENSE-2.0
  8. Unless required by applicable law or agreed to in writing, software
  9. distributed under the License is distributed on an "AS IS" BASIS,
  10. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  11. See the License for the specific language governing permissions and
  12. limitations under the License.
  13. A copy of the license and additional notices are located with the
  14. source distribution at:
  15. http://github.com/Esri/lerc/
  16. Contributors: Johannes Schmid, (LERC v1)
  17. Chayanika Khatua, (LERC v1)
  18. Wenxue Ju (LERC v1, v2.x)
  19. */
  20. /* Copyright 2015-2021 Esri. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 @preserve */
  21. /**
  22. * a module for decoding LERC blobs
  23. * @module Lerc
  24. */
  25. (function() {
  26. //this decoder supports all lerc versions, each version has its own class (LercDecode and Lerc2Decode).
  27. //the exported module handles format variation autoamtically.
  28. //the original LercDecode for Version 1
  29. var LercDecode = (function() {
  30. // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of
  31. // the class was chosen to be future proof.
  32. var CntZImage = {};
  33. CntZImage.defaultNoDataValue = -3.4027999387901484e+38; // smallest Float32 value
  34. /**
  35. * Decode a LERC byte stream and return an object containing the pixel data and some required and optional
  36. * information about it, such as the image's width and height.
  37. *
  38. * @param {ArrayBuffer} input The LERC input byte stream
  39. * @param {object} [options] Decoding options, containing any of the following properties:
  40. * @config {number} [inputOffset = 0]
  41. * Skip the first inputOffset bytes of the input byte stream. A valid LERC file is expected at that position.
  42. * @config {Uint8Array} [encodedMask = null]
  43. * If specified, the decoder will not read mask information from the input and use the specified encoded
  44. * mask data instead. Mask header/data must not be present in the LERC byte stream in this case.
  45. * @config {number} [noDataValue = LercCode.defaultNoDataValue]
  46. * Pixel value to use for masked pixels.
  47. * @config {ArrayBufferView|Array} [pixelType = Float32Array]
  48. * The desired type of the pixelData array in the return value. Note that it is the caller's responsibility to
  49. * provide an appropriate noDataValue if the default pixelType is overridden.
  50. * @config {boolean} [returnMask = false]
  51. * If true, the return value will contain a maskData property of type Uint8Array which has one element per
  52. * pixel, the value of which is 1 or 0 depending on whether that pixel's data is present or masked. If the
  53. * input LERC data does not contain a mask, maskData will not be returned.
  54. * @config {boolean} [returnEncodedMask = false]
  55. * If true, the return value will contain a encodedMaskData property, which can be passed into encode() as
  56. * encodedMask.
  57. * @config {boolean} [returnFileInfo = false]
  58. * If true, the return value will have a fileInfo property that contains metadata obtained from the
  59. * LERC headers and the decoding process.
  60. * @config {boolean} [computeUsedBitDepths = false]
  61. * If true, the fileInfo property in the return value will contain the set of all block bit depths
  62. * encountered during decoding. Will only have an effect if returnFileInfo option is true.
  63. * @returns {{width, height, pixelData, minValue, maxValue, noDataValue, maskData, encodedMaskData, fileInfo}}
  64. */
  65. CntZImage.decode = function(input, options) {
  66. options = options || {};
  67. var skipMask = options.encodedMaskData || (options.encodedMaskData === null);
  68. var parsedData = parse(input, options.inputOffset || 0, skipMask);
  69. var noDataValue = (options.noDataValue !== null) ? options.noDataValue : CntZImage.defaultNoDataValue;
  70. var uncompressedData = uncompressPixelValues(parsedData, options.pixelType || Float32Array,
  71. options.encodedMaskData, noDataValue, options.returnMask);
  72. var result = {
  73. width: parsedData.width,
  74. height: parsedData.height,
  75. pixelData: uncompressedData.resultPixels,
  76. minValue: uncompressedData.minValue,
  77. maxValue: parsedData.pixels.maxValue,
  78. noDataValue: noDataValue
  79. };
  80. if (uncompressedData.resultMask) {
  81. result.maskData = uncompressedData.resultMask;
  82. }
  83. if (options.returnEncodedMask && parsedData.mask) {
  84. result.encodedMaskData = parsedData.mask.bitset ? parsedData.mask.bitset : null;
  85. }
  86. if (options.returnFileInfo) {
  87. result.fileInfo = formatFileInfo(parsedData);
  88. if (options.computeUsedBitDepths) {
  89. result.fileInfo.bitDepths = computeUsedBitDepths(parsedData);
  90. }
  91. }
  92. return result;
  93. };
  94. var uncompressPixelValues = function(data, TypedArrayClass, maskBitset, noDataValue, storeDecodedMask) {
  95. var blockIdx = 0;
  96. var numX = data.pixels.numBlocksX;
  97. var numY = data.pixels.numBlocksY;
  98. var blockWidth = Math.floor(data.width / numX);
  99. var blockHeight = Math.floor(data.height / numY);
  100. var scale = 2 * data.maxZError;
  101. var minValue = Number.MAX_VALUE, currentValue;
  102. maskBitset = maskBitset || ((data.mask) ? data.mask.bitset : null);
  103. var resultPixels, resultMask;
  104. resultPixels = new TypedArrayClass(data.width * data.height);
  105. if (storeDecodedMask && maskBitset) {
  106. resultMask = new Uint8Array(data.width * data.height);
  107. }
  108. var blockDataBuffer = new Float32Array(blockWidth * blockHeight);
  109. var xx, yy;
  110. for (var y = 0; y <= numY; y++) {
  111. var thisBlockHeight = (y !== numY) ? blockHeight : (data.height % numY);
  112. if (thisBlockHeight === 0) {
  113. continue;
  114. }
  115. for (var x = 0; x <= numX; x++) {
  116. var thisBlockWidth = (x !== numX) ? blockWidth : (data.width % numX);
  117. if (thisBlockWidth === 0) {
  118. continue;
  119. }
  120. var outPtr = y * data.width * blockHeight + x * blockWidth;
  121. var outStride = data.width - thisBlockWidth;
  122. var block = data.pixels.blocks[blockIdx];
  123. var blockData, blockPtr, constValue;
  124. if (block.encoding < 2) {
  125. // block is either uncompressed or bit-stuffed (encodings 0 and 1)
  126. if (block.encoding === 0) {
  127. // block is uncompressed
  128. blockData = block.rawData;
  129. } else {
  130. // block is bit-stuffed
  131. unstuff(block.stuffedData, block.bitsPerPixel, block.numValidPixels, block.offset, scale, blockDataBuffer, data.pixels.maxValue);
  132. blockData = blockDataBuffer;
  133. }
  134. blockPtr = 0;
  135. }
  136. else if (block.encoding === 2) {
  137. // block is all 0
  138. constValue = 0;
  139. }
  140. else {
  141. // block has constant value (encoding === 3)
  142. constValue = block.offset;
  143. }
  144. var maskByte;
  145. if (maskBitset) {
  146. for (yy = 0; yy < thisBlockHeight; yy++) {
  147. if (outPtr & 7) {
  148. //
  149. maskByte = maskBitset[outPtr >> 3];
  150. maskByte <<= outPtr & 7;
  151. }
  152. for (xx = 0; xx < thisBlockWidth; xx++) {
  153. if (!(outPtr & 7)) {
  154. // read next byte from mask
  155. maskByte = maskBitset[outPtr >> 3];
  156. }
  157. if (maskByte & 128) {
  158. // pixel data present
  159. if (resultMask) {
  160. resultMask[outPtr] = 1;
  161. }
  162. currentValue = (block.encoding < 2) ? blockData[blockPtr++] : constValue;
  163. minValue = minValue > currentValue ? currentValue : minValue;
  164. resultPixels[outPtr++] = currentValue;
  165. } else {
  166. // pixel data not present
  167. if (resultMask) {
  168. resultMask[outPtr] = 0;
  169. }
  170. resultPixels[outPtr++] = noDataValue;
  171. }
  172. maskByte <<= 1;
  173. }
  174. outPtr += outStride;
  175. }
  176. } else {
  177. // mask not present, simply copy block over
  178. if (block.encoding < 2) {
  179. // duplicating this code block for performance reasons
  180. // blockData case:
  181. for (yy = 0; yy < thisBlockHeight; yy++) {
  182. for (xx = 0; xx < thisBlockWidth; xx++) {
  183. currentValue = blockData[blockPtr++];
  184. minValue = minValue > currentValue ? currentValue : minValue;
  185. resultPixels[outPtr++] = currentValue;
  186. }
  187. outPtr += outStride;
  188. }
  189. }
  190. else {
  191. // constValue case:
  192. minValue = minValue > constValue ? constValue : minValue;
  193. for (yy = 0; yy < thisBlockHeight; yy++) {
  194. for (xx = 0; xx < thisBlockWidth; xx++) {
  195. resultPixels[outPtr++] = constValue;
  196. }
  197. outPtr += outStride;
  198. }
  199. }
  200. }
  201. if ((block.encoding === 1) && (blockPtr !== block.numValidPixels)) {
  202. throw "Block and Mask do not match";
  203. }
  204. blockIdx++;
  205. }
  206. }
  207. return {
  208. resultPixels: resultPixels,
  209. resultMask: resultMask,
  210. minValue: minValue
  211. };
  212. };
  213. var formatFileInfo = function(data) {
  214. return {
  215. "fileIdentifierString": data.fileIdentifierString,
  216. "fileVersion": data.fileVersion,
  217. "imageType": data.imageType,
  218. "height": data.height,
  219. "width": data.width,
  220. "maxZError": data.maxZError,
  221. "eofOffset": data.eofOffset,
  222. "mask": data.mask ? {
  223. "numBlocksX": data.mask.numBlocksX,
  224. "numBlocksY": data.mask.numBlocksY,
  225. "numBytes": data.mask.numBytes,
  226. "maxValue": data.mask.maxValue
  227. } : null,
  228. "pixels": {
  229. "numBlocksX": data.pixels.numBlocksX,
  230. "numBlocksY": data.pixels.numBlocksY,
  231. "numBytes": data.pixels.numBytes,
  232. "maxValue": data.pixels.maxValue,
  233. "noDataValue": data.noDataValue
  234. }
  235. };
  236. };
  237. var computeUsedBitDepths = function(data) {
  238. var numBlocks = data.pixels.numBlocksX * data.pixels.numBlocksY;
  239. var bitDepths = {};
  240. for (var i = 0; i < numBlocks; i++) {
  241. var block = data.pixels.blocks[i];
  242. if (block.encoding === 0) {
  243. bitDepths.float32 = true;
  244. } else if (block.encoding === 1) {
  245. bitDepths[block.bitsPerPixel] = true;
  246. } else {
  247. bitDepths[0] = true;
  248. }
  249. }
  250. return Object.keys(bitDepths);
  251. };
  252. var parse = function(input, fp, skipMask) {
  253. var data = {};
  254. // File header
  255. var fileIdView = new Uint8Array(input, fp, 10);
  256. data.fileIdentifierString = String.fromCharCode.apply(null, fileIdView);
  257. if (data.fileIdentifierString.trim() !== "CntZImage") {
  258. throw "Unexpected file identifier string: " + data.fileIdentifierString;
  259. }
  260. fp += 10;
  261. var view = new DataView(input, fp, 24);
  262. data.fileVersion = view.getInt32(0, true);
  263. data.imageType = view.getInt32(4, true);
  264. data.height = view.getUint32(8, true);
  265. data.width = view.getUint32(12, true);
  266. data.maxZError = view.getFloat64(16, true);
  267. fp += 24;
  268. // Mask Header
  269. if (!skipMask) {
  270. view = new DataView(input, fp, 16);
  271. data.mask = {};
  272. data.mask.numBlocksY = view.getUint32(0, true);
  273. data.mask.numBlocksX = view.getUint32(4, true);
  274. data.mask.numBytes = view.getUint32(8, true);
  275. data.mask.maxValue = view.getFloat32(12, true);
  276. fp += 16;
  277. // Mask Data
  278. if (data.mask.numBytes > 0) {
  279. var bitset = new Uint8Array(Math.ceil(data.width * data.height / 8));
  280. view = new DataView(input, fp, data.mask.numBytes);
  281. var cnt = view.getInt16(0, true);
  282. var ip = 2, op = 0;
  283. do {
  284. if (cnt > 0) {
  285. while (cnt--) { bitset[op++] = view.getUint8(ip++); }
  286. } else {
  287. var val = view.getUint8(ip++);
  288. cnt = -cnt;
  289. while (cnt--) { bitset[op++] = val; }
  290. }
  291. cnt = view.getInt16(ip, true);
  292. ip += 2;
  293. } while (ip < data.mask.numBytes);
  294. if ((cnt !== -32768) || (op < bitset.length)) {
  295. throw "Unexpected end of mask RLE encoding";
  296. }
  297. data.mask.bitset = bitset;
  298. fp += data.mask.numBytes;
  299. }
  300. else if ((data.mask.numBytes | data.mask.numBlocksY | data.mask.maxValue) === 0) { // Special case, all nodata
  301. data.mask.bitset = new Uint8Array(Math.ceil(data.width * data.height / 8));
  302. }
  303. }
  304. // Pixel Header
  305. view = new DataView(input, fp, 16);
  306. data.pixels = {};
  307. data.pixels.numBlocksY = view.getUint32(0, true);
  308. data.pixels.numBlocksX = view.getUint32(4, true);
  309. data.pixels.numBytes = view.getUint32(8, true);
  310. data.pixels.maxValue = view.getFloat32(12, true);
  311. fp += 16;
  312. var numBlocksX = data.pixels.numBlocksX;
  313. var numBlocksY = data.pixels.numBlocksY;
  314. // the number of blocks specified in the header does not take into account the blocks at the end of
  315. // each row/column with a special width/height that make the image complete in case the width is not
  316. // evenly divisible by the number of blocks.
  317. var actualNumBlocksX = numBlocksX + ((data.width % numBlocksX) > 0 ? 1 : 0);
  318. var actualNumBlocksY = numBlocksY + ((data.height % numBlocksY) > 0 ? 1 : 0);
  319. data.pixels.blocks = new Array(actualNumBlocksX * actualNumBlocksY);
  320. var blockI = 0;
  321. for (var blockY = 0; blockY < actualNumBlocksY; blockY++) {
  322. for (var blockX = 0; blockX < actualNumBlocksX; blockX++) {
  323. // Block
  324. var size = 0;
  325. var bytesLeft = input.byteLength - fp;
  326. view = new DataView(input, fp, Math.min(10, bytesLeft));
  327. var block = {};
  328. data.pixels.blocks[blockI++] = block;
  329. var headerByte = view.getUint8(0); size++;
  330. block.encoding = headerByte & 63;
  331. if (block.encoding > 3) {
  332. throw "Invalid block encoding (" + block.encoding + ")";
  333. }
  334. if (block.encoding === 2) {
  335. fp++;
  336. continue;
  337. }
  338. if ((headerByte !== 0) && (headerByte !== 2)) {
  339. headerByte >>= 6;
  340. block.offsetType = headerByte;
  341. if (headerByte === 2) {
  342. block.offset = view.getInt8(1); size++;
  343. } else if (headerByte === 1) {
  344. block.offset = view.getInt16(1, true); size += 2;
  345. } else if (headerByte === 0) {
  346. block.offset = view.getFloat32(1, true); size += 4;
  347. } else {
  348. throw "Invalid block offset type";
  349. }
  350. if (block.encoding === 1) {
  351. headerByte = view.getUint8(size); size++;
  352. block.bitsPerPixel = headerByte & 63;
  353. headerByte >>= 6;
  354. block.numValidPixelsType = headerByte;
  355. if (headerByte === 2) {
  356. block.numValidPixels = view.getUint8(size); size++;
  357. } else if (headerByte === 1) {
  358. block.numValidPixels = view.getUint16(size, true); size += 2;
  359. } else if (headerByte === 0) {
  360. block.numValidPixels = view.getUint32(size, true); size += 4;
  361. } else {
  362. throw "Invalid valid pixel count type";
  363. }
  364. }
  365. }
  366. fp += size;
  367. if (block.encoding === 3) {
  368. continue;
  369. }
  370. var arrayBuf, store8;
  371. if (block.encoding === 0) {
  372. var numPixels = (data.pixels.numBytes - 1) / 4;
  373. if (numPixels !== Math.floor(numPixels)) {
  374. throw "uncompressed block has invalid length";
  375. }
  376. arrayBuf = new ArrayBuffer(numPixels * 4);
  377. store8 = new Uint8Array(arrayBuf);
  378. store8.set(new Uint8Array(input, fp, numPixels * 4));
  379. var rawData = new Float32Array(arrayBuf);
  380. block.rawData = rawData;
  381. fp += numPixels * 4;
  382. } else if (block.encoding === 1) {
  383. var dataBytes = Math.ceil(block.numValidPixels * block.bitsPerPixel / 8);
  384. var dataWords = Math.ceil(dataBytes / 4);
  385. arrayBuf = new ArrayBuffer(dataWords * 4);
  386. store8 = new Uint8Array(arrayBuf);
  387. store8.set(new Uint8Array(input, fp, dataBytes));
  388. block.stuffedData = new Uint32Array(arrayBuf);
  389. fp += dataBytes;
  390. }
  391. }
  392. }
  393. data.eofOffset = fp;
  394. return data;
  395. };
  396. var unstuff = function(src, bitsPerPixel, numPixels, offset, scale, dest, maxValue) {
  397. var bitMask = (1 << bitsPerPixel) - 1;
  398. var i = 0, o;
  399. var bitsLeft = 0;
  400. var n, buffer;
  401. var nmax = Math.ceil((maxValue - offset) / scale);
  402. // get rid of trailing bytes that are already part of next block
  403. var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
  404. src[src.length - 1] <<= 8 * numInvalidTailBytes;
  405. for (o = 0; o < numPixels; o++) {
  406. if (bitsLeft === 0) {
  407. buffer = src[i++];
  408. bitsLeft = 32;
  409. }
  410. if (bitsLeft >= bitsPerPixel) {
  411. n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
  412. bitsLeft -= bitsPerPixel;
  413. } else {
  414. var missingBits = (bitsPerPixel - bitsLeft);
  415. n = ((buffer & bitMask) << missingBits) & bitMask;
  416. buffer = src[i++];
  417. bitsLeft = 32 - missingBits;
  418. n += (buffer >>> bitsLeft);
  419. }
  420. //pixel values may exceed max due to quantization
  421. dest[o] = n < nmax ? offset + n * scale : maxValue;
  422. }
  423. return dest;
  424. };
  425. return CntZImage;
  426. })();
  427. //version 2. Supports 2.1, 2.2, 2.3
  428. var Lerc2Decode = (function() {
  429. "use strict";
  430. // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of
  431. // the class was chosen to be future proof, following LercDecode.
  432. /*****************************************
  433. * private static class bitsutffer used by Lerc2Decode
  434. *******************************************/
  435. var BitStuffer = {
  436. //methods ending with 2 are for the new byte order used by Lerc2.3 and above.
  437. //originalUnstuff is used to unpack Huffman code table. code is duplicated to unstuffx for performance reasons.
  438. unstuff: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) {
  439. var bitMask = (1 << bitsPerPixel) - 1;
  440. var i = 0, o;
  441. var bitsLeft = 0;
  442. var n, buffer, missingBits, nmax;
  443. // get rid of trailing bytes that are already part of next block
  444. var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
  445. src[src.length - 1] <<= 8 * numInvalidTailBytes;
  446. if (lutArr) {
  447. for (o = 0; o < numPixels; o++) {
  448. if (bitsLeft === 0) {
  449. buffer = src[i++];
  450. bitsLeft = 32;
  451. }
  452. if (bitsLeft >= bitsPerPixel) {
  453. n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
  454. bitsLeft -= bitsPerPixel;
  455. }
  456. else {
  457. missingBits = (bitsPerPixel - bitsLeft);
  458. n = ((buffer & bitMask) << missingBits) & bitMask;
  459. buffer = src[i++];
  460. bitsLeft = 32 - missingBits;
  461. n += (buffer >>> bitsLeft);
  462. }
  463. dest[o] = lutArr[n];//offset + lutArr[n] * scale;
  464. }
  465. }
  466. else {
  467. nmax = Math.ceil((maxValue - offset) / scale);
  468. for (o = 0; o < numPixels; o++) {
  469. if (bitsLeft === 0) {
  470. buffer = src[i++];
  471. bitsLeft = 32;
  472. }
  473. if (bitsLeft >= bitsPerPixel) {
  474. n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
  475. bitsLeft -= bitsPerPixel;
  476. }
  477. else {
  478. missingBits = (bitsPerPixel - bitsLeft);
  479. n = ((buffer & bitMask) << missingBits) & bitMask;
  480. buffer = src[i++];
  481. bitsLeft = 32 - missingBits;
  482. n += (buffer >>> bitsLeft);
  483. }
  484. //pixel values may exceed max due to quantization
  485. dest[o] = n < nmax ? offset + n * scale : maxValue;
  486. }
  487. }
  488. },
  489. unstuffLUT: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) {
  490. var bitMask = (1 << bitsPerPixel) - 1;
  491. var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0;
  492. var buffer;
  493. var dest = [];
  494. // get rid of trailing bytes that are already part of next block
  495. var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
  496. src[src.length - 1] <<= 8 * numInvalidTailBytes;
  497. var nmax = Math.ceil((maxValue - offset) / scale);
  498. for (o = 0; o < numPixels; o++) {
  499. if (bitsLeft === 0) {
  500. buffer = src[i++];
  501. bitsLeft = 32;
  502. }
  503. if (bitsLeft >= bitsPerPixel) {
  504. n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
  505. bitsLeft -= bitsPerPixel;
  506. } else {
  507. missingBits = (bitsPerPixel - bitsLeft);
  508. n = ((buffer & bitMask) << missingBits) & bitMask;
  509. buffer = src[i++];
  510. bitsLeft = 32 - missingBits;
  511. n += (buffer >>> bitsLeft);
  512. }
  513. //dest.push(n);
  514. dest[o] = n < nmax ? offset + n * scale : maxValue;
  515. }
  516. dest.unshift(offset);//1st one
  517. return dest;
  518. },
  519. unstuff2: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) {
  520. var bitMask = (1 << bitsPerPixel) - 1;
  521. var i = 0, o;
  522. var bitsLeft = 0, bitPos = 0;
  523. var n, buffer, missingBits;
  524. if (lutArr) {
  525. for (o = 0; o < numPixels; o++) {
  526. if (bitsLeft === 0) {
  527. buffer = src[i++];
  528. bitsLeft = 32;
  529. bitPos = 0;
  530. }
  531. if (bitsLeft >= bitsPerPixel) {
  532. n = ((buffer >>> bitPos) & bitMask);
  533. bitsLeft -= bitsPerPixel;
  534. bitPos += bitsPerPixel;
  535. } else {
  536. missingBits = (bitsPerPixel - bitsLeft);
  537. n = (buffer >>> bitPos) & bitMask;
  538. buffer = src[i++];
  539. bitsLeft = 32 - missingBits;
  540. n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
  541. bitPos = missingBits;
  542. }
  543. dest[o] = lutArr[n];
  544. }
  545. }
  546. else {
  547. var nmax = Math.ceil((maxValue - offset) / scale);
  548. for (o = 0; o < numPixels; o++) {
  549. if (bitsLeft === 0) {
  550. buffer = src[i++];
  551. bitsLeft = 32;
  552. bitPos = 0;
  553. }
  554. if (bitsLeft >= bitsPerPixel) {
  555. //no unsigned left shift
  556. n = ((buffer >>> bitPos) & bitMask);
  557. bitsLeft -= bitsPerPixel;
  558. bitPos += bitsPerPixel;
  559. } else {
  560. missingBits = (bitsPerPixel - bitsLeft);
  561. n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;
  562. buffer = src[i++];
  563. bitsLeft = 32 - missingBits;
  564. n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
  565. bitPos = missingBits;
  566. }
  567. //pixel values may exceed max due to quantization
  568. dest[o] = n < nmax ? offset + n * scale : maxValue;
  569. }
  570. }
  571. return dest;
  572. },
  573. unstuffLUT2: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) {
  574. var bitMask = (1 << bitsPerPixel) - 1;
  575. var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0, bitPos = 0;
  576. var buffer;
  577. var dest = [];
  578. var nmax = Math.ceil((maxValue - offset) / scale);
  579. for (o = 0; o < numPixels; o++) {
  580. if (bitsLeft === 0) {
  581. buffer = src[i++];
  582. bitsLeft = 32;
  583. bitPos = 0;
  584. }
  585. if (bitsLeft >= bitsPerPixel) {
  586. //no unsigned left shift
  587. n = ((buffer >>> bitPos) & bitMask);
  588. bitsLeft -= bitsPerPixel;
  589. bitPos += bitsPerPixel;
  590. } else {
  591. missingBits = (bitsPerPixel - bitsLeft);
  592. n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;
  593. buffer = src[i++];
  594. bitsLeft = 32 - missingBits;
  595. n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
  596. bitPos = missingBits;
  597. }
  598. //dest.push(n);
  599. dest[o] = n < nmax ? offset + n * scale : maxValue;
  600. }
  601. dest.unshift(offset);
  602. return dest;
  603. },
  604. originalUnstuff: function(src, dest, bitsPerPixel, numPixels) {
  605. var bitMask = (1 << bitsPerPixel) - 1;
  606. var i = 0, o;
  607. var bitsLeft = 0;
  608. var n, buffer, missingBits;
  609. // get rid of trailing bytes that are already part of next block
  610. var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
  611. src[src.length - 1] <<= 8 * numInvalidTailBytes;
  612. for (o = 0; o < numPixels; o++) {
  613. if (bitsLeft === 0) {
  614. buffer = src[i++];
  615. bitsLeft = 32;
  616. }
  617. if (bitsLeft >= bitsPerPixel) {
  618. n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
  619. bitsLeft -= bitsPerPixel;
  620. }
  621. else {
  622. missingBits = (bitsPerPixel - bitsLeft);
  623. n = ((buffer & bitMask) << missingBits) & bitMask;
  624. buffer = src[i++];
  625. bitsLeft = 32 - missingBits;
  626. n += (buffer >>> bitsLeft);
  627. }
  628. dest[o] = n;
  629. }
  630. return dest;
  631. },
  632. originalUnstuff2: function(src, dest, bitsPerPixel, numPixels) {
  633. var bitMask = (1 << bitsPerPixel) - 1;
  634. var i = 0, o;
  635. var bitsLeft = 0, bitPos = 0;
  636. var n, buffer, missingBits;
  637. //micro-optimizations
  638. for (o = 0; o < numPixels; o++) {
  639. if (bitsLeft === 0) {
  640. buffer = src[i++];
  641. bitsLeft = 32;
  642. bitPos = 0;
  643. }
  644. if (bitsLeft >= bitsPerPixel) {
  645. //no unsigned left shift
  646. n = ((buffer >>> bitPos) & bitMask);
  647. bitsLeft -= bitsPerPixel;
  648. bitPos += bitsPerPixel;
  649. } else {
  650. missingBits = (bitsPerPixel - bitsLeft);
  651. n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;
  652. buffer = src[i++];
  653. bitsLeft = 32 - missingBits;
  654. n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
  655. bitPos = missingBits;
  656. }
  657. dest[o] = n;
  658. }
  659. return dest;
  660. }
  661. };
  662. /*****************************************
  663. *private static class used by Lerc2Decode
  664. ******************************************/
  665. var Lerc2Helpers = {
  666. HUFFMAN_LUT_BITS_MAX: 12, //use 2^12 lut, treat it like constant
  667. computeChecksumFletcher32: function(input) {
  668. var sum1 = 0xffff, sum2 = 0xffff;
  669. var len = input.length;
  670. var words = Math.floor(len / 2);
  671. var i = 0;
  672. while (words) {
  673. var tlen = (words >= 359) ? 359 : words;
  674. words -= tlen;
  675. do {
  676. sum1 += (input[i++] << 8);
  677. sum2 += sum1 += input[i++];
  678. } while (--tlen);
  679. sum1 = (sum1 & 0xffff) + (sum1 >>> 16);
  680. sum2 = (sum2 & 0xffff) + (sum2 >>> 16);
  681. }
  682. // add the straggler byte if it exists
  683. if (len & 1) {
  684. sum2 += sum1 += (input[i] << 8);
  685. }
  686. // second reduction step to reduce sums to 16 bits
  687. sum1 = (sum1 & 0xffff) + (sum1 >>> 16);
  688. sum2 = (sum2 & 0xffff) + (sum2 >>> 16);
  689. return (sum2 << 16 | sum1) >>> 0;
  690. },
  691. readHeaderInfo: function(input, data) {
  692. var ptr = data.ptr;
  693. var fileIdView = new Uint8Array(input, ptr, 6);
  694. var headerInfo = {};
  695. headerInfo.fileIdentifierString = String.fromCharCode.apply(null, fileIdView);
  696. if (headerInfo.fileIdentifierString.lastIndexOf("Lerc2", 0) !== 0) {
  697. throw "Unexpected file identifier string (expect Lerc2 ): " + headerInfo.fileIdentifierString;
  698. }
  699. ptr += 6;
  700. var view = new DataView(input, ptr, 8);
  701. var fileVersion = view.getInt32(0, true);
  702. headerInfo.fileVersion = fileVersion;
  703. ptr += 4;
  704. if (fileVersion >= 3) {
  705. headerInfo.checksum = view.getUint32(4, true); //nrows
  706. ptr += 4;
  707. }
  708. //keys start from here
  709. view = new DataView(input, ptr, 12);
  710. headerInfo.height = view.getUint32(0, true); //nrows
  711. headerInfo.width = view.getUint32(4, true); //ncols
  712. ptr += 8;
  713. if (fileVersion >= 4) {
  714. headerInfo.numDims = view.getUint32(8, true);
  715. ptr += 4;
  716. }
  717. else {
  718. headerInfo.numDims = 1;
  719. }
  720. view = new DataView(input, ptr, 40);
  721. headerInfo.numValidPixel = view.getUint32(0, true);
  722. headerInfo.microBlockSize = view.getInt32(4, true);
  723. headerInfo.blobSize = view.getInt32(8, true);
  724. headerInfo.imageType = view.getInt32(12, true);
  725. headerInfo.maxZError = view.getFloat64(16, true);
  726. headerInfo.zMin = view.getFloat64(24, true);
  727. headerInfo.zMax = view.getFloat64(32, true);
  728. ptr += 40;
  729. data.headerInfo = headerInfo;
  730. data.ptr = ptr;
  731. var checksum, keyLength;
  732. if (fileVersion >= 3) {
  733. keyLength = fileVersion >= 4 ? 52 : 48;
  734. checksum = this.computeChecksumFletcher32(new Uint8Array(input, ptr - keyLength, headerInfo.blobSize - 14));
  735. if (checksum !== headerInfo.checksum) {
  736. throw "Checksum failed.";
  737. }
  738. }
  739. return true;
  740. },
  741. checkMinMaxRanges: function(input, data) {
  742. var headerInfo = data.headerInfo;
  743. var OutPixelTypeArray = this.getDataTypeArray(headerInfo.imageType);
  744. var rangeBytes = headerInfo.numDims * this.getDataTypeSize(headerInfo.imageType);
  745. var minValues = this.readSubArray(input, data.ptr, OutPixelTypeArray, rangeBytes);
  746. var maxValues = this.readSubArray(input, data.ptr + rangeBytes, OutPixelTypeArray, rangeBytes);
  747. data.ptr += (2 * rangeBytes);
  748. var i, equal = true;
  749. for (i = 0; i < headerInfo.numDims; i++) {
  750. if (minValues[i] !== maxValues[i]) {
  751. equal = false;
  752. break;
  753. }
  754. }
  755. headerInfo.minValues = minValues;
  756. headerInfo.maxValues = maxValues;
  757. return equal;
  758. },
  759. readSubArray: function(input, ptr, OutPixelTypeArray, numBytes) {
  760. var rawData;
  761. if (OutPixelTypeArray === Uint8Array) {
  762. rawData = new Uint8Array(input, ptr, numBytes);
  763. }
  764. else {
  765. var arrayBuf = new ArrayBuffer(numBytes);
  766. var store8 = new Uint8Array(arrayBuf);
  767. store8.set(new Uint8Array(input, ptr, numBytes));
  768. rawData = new OutPixelTypeArray(arrayBuf);
  769. }
  770. return rawData;
  771. },
  772. readMask: function(input, data) {
  773. var ptr = data.ptr;
  774. var headerInfo = data.headerInfo;
  775. var numPixels = headerInfo.width * headerInfo.height;
  776. var numValidPixel = headerInfo.numValidPixel;
  777. var view = new DataView(input, ptr, 4);
  778. var mask = {};
  779. mask.numBytes = view.getUint32(0, true);
  780. ptr += 4;
  781. // Mask Data
  782. if ((0 === numValidPixel || numPixels === numValidPixel) && 0 !== mask.numBytes) {
  783. throw ("invalid mask");
  784. }
  785. var bitset, resultMask;
  786. if (numValidPixel === 0) {
  787. bitset = new Uint8Array(Math.ceil(numPixels / 8));
  788. mask.bitset = bitset;
  789. resultMask = new Uint8Array(numPixels);
  790. data.pixels.resultMask = resultMask;
  791. ptr += mask.numBytes;
  792. }// ????? else if (data.mask.numBytes > 0 && data.mask.numBytes< data.numValidPixel) {
  793. else if (mask.numBytes > 0) {
  794. bitset = new Uint8Array(Math.ceil(numPixels / 8));
  795. view = new DataView(input, ptr, mask.numBytes);
  796. var cnt = view.getInt16(0, true);
  797. var ip = 2, op = 0, val = 0;
  798. do {
  799. if (cnt > 0) {
  800. while (cnt--) { bitset[op++] = view.getUint8(ip++); }
  801. } else {
  802. val = view.getUint8(ip++);
  803. cnt = -cnt;
  804. while (cnt--) { bitset[op++] = val; }
  805. }
  806. cnt = view.getInt16(ip, true);
  807. ip += 2;
  808. } while (ip < mask.numBytes);
  809. if ((cnt !== -32768) || (op < bitset.length)) {
  810. throw "Unexpected end of mask RLE encoding";
  811. }
  812. resultMask = new Uint8Array(numPixels);
  813. var mb = 0, k = 0;
  814. for (k = 0; k < numPixels; k++) {
  815. if (k & 7) {
  816. mb = bitset[k >> 3];
  817. mb <<= k & 7;
  818. }
  819. else {
  820. mb = bitset[k >> 3];
  821. }
  822. if (mb & 128) {
  823. resultMask[k] = 1;
  824. }
  825. }
  826. data.pixels.resultMask = resultMask;
  827. mask.bitset = bitset;
  828. ptr += mask.numBytes;
  829. }
  830. data.ptr = ptr;
  831. data.mask = mask;
  832. return true;
  833. },
  834. readDataOneSweep: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {
  835. var ptr = data.ptr;
  836. var headerInfo = data.headerInfo;
  837. var numDims = headerInfo.numDims;
  838. var numPixels = headerInfo.width * headerInfo.height;
  839. var imageType = headerInfo.imageType;
  840. var numBytes = headerInfo.numValidPixel * Lerc2Helpers.getDataTypeSize(imageType) * numDims;
  841. //data.pixels.numBytes = numBytes;
  842. var rawData;
  843. var mask = data.pixels.resultMask;
  844. if (OutPixelTypeArray === Uint8Array) {
  845. rawData = new Uint8Array(input, ptr, numBytes);
  846. }
  847. else {
  848. var arrayBuf = new ArrayBuffer(numBytes);
  849. var store8 = new Uint8Array(arrayBuf);
  850. store8.set(new Uint8Array(input, ptr, numBytes));
  851. rawData = new OutPixelTypeArray(arrayBuf);
  852. }
  853. if (rawData.length === numPixels * numDims) {
  854. if (useBSQForOutputDim) {
  855. data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(rawData, numPixels, numDims, OutPixelTypeArray, true);
  856. }
  857. else {
  858. data.pixels.resultPixels = rawData;
  859. }
  860. }
  861. else //mask
  862. {
  863. data.pixels.resultPixels = new OutPixelTypeArray(numPixels * numDims);
  864. var z = 0, k = 0, i = 0, nStart = 0;
  865. if (numDims > 1) {
  866. if (useBSQForOutputDim) {
  867. for (k = 0; k < numPixels; k++) {
  868. if (mask[k]) {
  869. nStart = k;
  870. for (i = 0; i < numDims; i++, nStart+=numPixels) {
  871. data.pixels.resultPixels[nStart] = rawData[z++];
  872. }
  873. }
  874. }
  875. }
  876. else {
  877. for (k = 0; k < numPixels; k++) {
  878. if (mask[k]) {
  879. nStart = k * numDims;
  880. for (i = 0; i < numDims; i++) {
  881. data.pixels.resultPixels[nStart + i] = rawData[z++];
  882. }
  883. }
  884. }
  885. }
  886. }
  887. else {
  888. for (k = 0; k < numPixels; k++) {
  889. if (mask[k]) {
  890. data.pixels.resultPixels[k] = rawData[z++];
  891. }
  892. }
  893. }
  894. }
  895. ptr += numBytes;
  896. data.ptr = ptr; //return data;
  897. return true;
  898. },
  899. readHuffmanTree: function(input, data) {
  900. var BITS_MAX = this.HUFFMAN_LUT_BITS_MAX; //8 is slow for the large test image
  901. //var size_max = 1 << BITS_MAX;
  902. /* ************************
  903. * reading code table
  904. *************************/
  905. var view = new DataView(input, data.ptr, 16);
  906. data.ptr += 16;
  907. var version = view.getInt32(0, true);
  908. if (version < 2) {
  909. throw "unsupported Huffman version";
  910. }
  911. var size = view.getInt32(4, true);
  912. var i0 = view.getInt32(8, true);
  913. var i1 = view.getInt32(12, true);
  914. if (i0 >= i1) {
  915. return false;
  916. }
  917. var blockDataBuffer = new Uint32Array(i1 - i0);
  918. Lerc2Helpers.decodeBits(input, data, blockDataBuffer);
  919. var codeTable = []; //size
  920. var i, j, k, len;
  921. for (i = i0; i < i1; i++) {
  922. j = i - (i < size ? 0 : size);//wrap around
  923. codeTable[j] = { first: blockDataBuffer[i - i0], second: null };
  924. }
  925. var dataBytes = input.byteLength - data.ptr;
  926. var dataWords = Math.ceil(dataBytes / 4);
  927. var arrayBuf = new ArrayBuffer(dataWords * 4);
  928. var store8 = new Uint8Array(arrayBuf);
  929. store8.set(new Uint8Array(input, data.ptr, dataBytes));
  930. var stuffedData = new Uint32Array(arrayBuf); //must start from x*4
  931. var bitPos = 0, word, srcPtr = 0;
  932. word = stuffedData[0];
  933. for (i = i0; i < i1; i++) {
  934. j = i - (i < size ? 0 : size);//wrap around
  935. len = codeTable[j].first;
  936. if (len > 0) {
  937. codeTable[j].second = (word << bitPos) >>> (32 - len);
  938. if (32 - bitPos >= len) {
  939. bitPos += len;
  940. if (bitPos === 32) {
  941. bitPos = 0;
  942. srcPtr++;
  943. word = stuffedData[srcPtr];
  944. }
  945. }
  946. else {
  947. bitPos += len - 32;
  948. srcPtr++;
  949. word = stuffedData[srcPtr];
  950. codeTable[j].second |= word >>> (32 - bitPos);
  951. }
  952. }
  953. }
  954. //finished reading code table
  955. /* ************************
  956. * building lut
  957. *************************/
  958. var numBitsLUT = 0, numBitsLUTQick = 0;
  959. var tree = new TreeNode();
  960. for (i = 0; i < codeTable.length; i++) {
  961. if (codeTable[i] !== undefined) {
  962. numBitsLUT = Math.max(numBitsLUT, codeTable[i].first);
  963. }
  964. }
  965. if (numBitsLUT >= BITS_MAX) {
  966. numBitsLUTQick = BITS_MAX;
  967. }
  968. else {
  969. numBitsLUTQick = numBitsLUT;
  970. }
  971. // for debugging purpose
  972. // if (numBitsLUT >= 30) {
  973. // console.log("WARning, large NUM LUT BITS IS " + numBitsLUT);
  974. // }
  975. var decodeLut = [], entry, code, numEntries, jj, currentBit, node;
  976. for (i = i0; i < i1; i++) {
  977. j = i - (i < size ? 0 : size);//wrap around
  978. len = codeTable[j].first;
  979. if (len > 0) {
  980. entry = [len, j];
  981. if (len <= numBitsLUTQick) {
  982. code = codeTable[j].second << (numBitsLUTQick - len);
  983. numEntries = 1 << (numBitsLUTQick - len);
  984. for (k = 0; k < numEntries; k++) {
  985. decodeLut[code | k] = entry;
  986. }
  987. }
  988. else {
  989. //build tree
  990. code = codeTable[j].second;
  991. node = tree;
  992. for (jj = len - 1; jj >= 0; jj--) {
  993. currentBit = code >>> jj & 1; //no left shift as length could be 30,31
  994. if (currentBit) {
  995. if (!node.right) {
  996. node.right = new TreeNode();
  997. }
  998. node = node.right;
  999. }
  1000. else {
  1001. if (!node.left) {
  1002. node.left = new TreeNode();
  1003. }
  1004. node = node.left;
  1005. }
  1006. if (jj === 0 && !node.val) {
  1007. node.val = entry[1];
  1008. }
  1009. }
  1010. }
  1011. }
  1012. }
  1013. return {
  1014. decodeLut: decodeLut,
  1015. numBitsLUTQick: numBitsLUTQick,
  1016. numBitsLUT: numBitsLUT,
  1017. tree: tree,
  1018. stuffedData: stuffedData,
  1019. srcPtr: srcPtr,
  1020. bitPos: bitPos
  1021. };
  1022. },
  1023. readHuffman: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {
  1024. var headerInfo = data.headerInfo;
  1025. var numDims = headerInfo.numDims;
  1026. var height = data.headerInfo.height;
  1027. var width = data.headerInfo.width;
  1028. var numPixels = width * height;
  1029. //var size_max = 1 << BITS_MAX;
  1030. /* ************************
  1031. * reading huffman structure info
  1032. *************************/
  1033. var huffmanInfo = this.readHuffmanTree(input, data);
  1034. var decodeLut = huffmanInfo.decodeLut;
  1035. var tree = huffmanInfo.tree;
  1036. //stuffedData includes huffman headers
  1037. var stuffedData = huffmanInfo.stuffedData;
  1038. var srcPtr = huffmanInfo.srcPtr;
  1039. var bitPos = huffmanInfo.bitPos;
  1040. var numBitsLUTQick = huffmanInfo.numBitsLUTQick;
  1041. var numBitsLUT = huffmanInfo.numBitsLUT;
  1042. var offset = data.headerInfo.imageType === 0 ? 128 : 0;
  1043. /*************************
  1044. * decode
  1045. ***************************/
  1046. var node, val, delta, mask = data.pixels.resultMask, valTmp, valTmpQuick, currentBit;
  1047. var i, j, k, ii;
  1048. var prevVal = 0;
  1049. if (bitPos > 0) {
  1050. srcPtr++;
  1051. bitPos = 0;
  1052. }
  1053. var word = stuffedData[srcPtr];
  1054. var deltaEncode = data.encodeMode === 1;
  1055. var resultPixelsAllDim = new OutPixelTypeArray(numPixels * numDims);
  1056. var resultPixels = resultPixelsAllDim;
  1057. var iDim;
  1058. // TODO: reevaluate the need to keep inlined decoding code as IE support is phasing out
  1059. if (numDims < 2 || deltaEncode) {
  1060. for (iDim = 0; iDim < numDims; iDim++) {
  1061. if (numDims > 1) {
  1062. //get the mem block of current dimension
  1063. resultPixels = new OutPixelTypeArray(resultPixelsAllDim.buffer, numPixels * iDim, numPixels);
  1064. prevVal = 0;
  1065. }
  1066. if (data.headerInfo.numValidPixel === width * height) { //all valid
  1067. for (k = 0, i = 0; i < height; i++) {
  1068. for (j = 0; j < width; j++, k++) {
  1069. val = 0;
  1070. valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);
  1071. valTmpQuick = valTmp;// >>> deltaBits;
  1072. if (32 - bitPos < numBitsLUTQick) {
  1073. valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));
  1074. valTmpQuick = valTmp;// >>> deltaBits;
  1075. }
  1076. if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done
  1077. {
  1078. val = decodeLut[valTmpQuick][1];
  1079. bitPos += decodeLut[valTmpQuick][0];
  1080. }
  1081. else {
  1082. valTmp = (word << bitPos) >>> (32 - numBitsLUT);
  1083. valTmpQuick = valTmp;// >>> deltaBits;
  1084. if (32 - bitPos < numBitsLUT) {
  1085. valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));
  1086. valTmpQuick = valTmp;// >>> deltaBits;
  1087. }
  1088. node = tree;
  1089. for (ii = 0; ii < numBitsLUT; ii++) {
  1090. currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;
  1091. node = currentBit ? node.right : node.left;
  1092. if (!(node.left || node.right)) {
  1093. val = node.val;
  1094. bitPos = bitPos + ii + 1;
  1095. break;
  1096. }
  1097. }
  1098. }
  1099. if (bitPos >= 32) {
  1100. bitPos -= 32;
  1101. srcPtr++;
  1102. word = stuffedData[srcPtr];
  1103. }
  1104. delta = val - offset;
  1105. if (deltaEncode) {
  1106. if (j > 0) {
  1107. delta += prevVal; // use overflow
  1108. }
  1109. else if (i > 0) {
  1110. delta += resultPixels[k - width];
  1111. }
  1112. else {
  1113. delta += prevVal;
  1114. }
  1115. delta &= 0xFF; //overflow
  1116. resultPixels[k] = delta;//overflow
  1117. prevVal = delta;
  1118. }
  1119. else {
  1120. resultPixels[k] = delta;
  1121. }
  1122. }
  1123. }
  1124. }
  1125. else { //not all valid, use mask
  1126. for (k = 0, i = 0; i < height; i++) {
  1127. for (j = 0; j < width; j++, k++) {
  1128. if (mask[k]) {
  1129. val = 0;
  1130. valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);
  1131. valTmpQuick = valTmp;// >>> deltaBits;
  1132. if (32 - bitPos < numBitsLUTQick) {
  1133. valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));
  1134. valTmpQuick = valTmp;// >>> deltaBits;
  1135. }
  1136. if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done
  1137. {
  1138. val = decodeLut[valTmpQuick][1];
  1139. bitPos += decodeLut[valTmpQuick][0];
  1140. }
  1141. else {
  1142. valTmp = (word << bitPos) >>> (32 - numBitsLUT);
  1143. valTmpQuick = valTmp;// >>> deltaBits;
  1144. if (32 - bitPos < numBitsLUT) {
  1145. valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));
  1146. valTmpQuick = valTmp;// >>> deltaBits;
  1147. }
  1148. node = tree;
  1149. for (ii = 0; ii < numBitsLUT; ii++) {
  1150. currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;
  1151. node = currentBit ? node.right : node.left;
  1152. if (!(node.left || node.right)) {
  1153. val = node.val;
  1154. bitPos = bitPos + ii + 1;
  1155. break;
  1156. }
  1157. }
  1158. }
  1159. if (bitPos >= 32) {
  1160. bitPos -= 32;
  1161. srcPtr++;
  1162. word = stuffedData[srcPtr];
  1163. }
  1164. delta = val - offset;
  1165. if (deltaEncode) {
  1166. if (j > 0 && mask[k - 1]) {
  1167. delta += prevVal; // use overflow
  1168. }
  1169. else if (i > 0 && mask[k - width]) {
  1170. delta += resultPixels[k - width];
  1171. }
  1172. else {
  1173. delta += prevVal;
  1174. }
  1175. delta &= 0xFF; //overflow
  1176. resultPixels[k] = delta;//overflow
  1177. prevVal = delta;
  1178. }
  1179. else {
  1180. resultPixels[k] = delta;
  1181. }
  1182. }
  1183. }
  1184. }
  1185. }
  1186. }
  1187. }
  1188. else {
  1189. for (k = 0, i = 0; i < height; i++) {
  1190. for (j = 0; j < width; j++) {
  1191. k = i * width + j;
  1192. if (!mask || mask[k]) {
  1193. for (iDim = 0; iDim < numDims; iDim++, k+=numPixels) {
  1194. val = 0;
  1195. valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);
  1196. valTmpQuick = valTmp;
  1197. if (32 - bitPos < numBitsLUTQick) {
  1198. valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));
  1199. valTmpQuick = valTmp;
  1200. }
  1201. if (decodeLut[valTmpQuick])
  1202. {
  1203. val = decodeLut[valTmpQuick][1];
  1204. bitPos += decodeLut[valTmpQuick][0];
  1205. }
  1206. else {
  1207. valTmp = (word << bitPos) >>> (32 - numBitsLUT);
  1208. valTmpQuick = valTmp;
  1209. if (32 - bitPos < numBitsLUT) {
  1210. valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));
  1211. valTmpQuick = valTmp;
  1212. }
  1213. node = tree;
  1214. for (ii = 0; ii < numBitsLUT; ii++) {
  1215. currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;
  1216. node = currentBit ? node.right : node.left;
  1217. if (!(node.left || node.right)) {
  1218. val = node.val;
  1219. bitPos = bitPos + ii + 1;
  1220. break;
  1221. }
  1222. }
  1223. }
  1224. if (bitPos >= 32) {
  1225. bitPos -= 32;
  1226. srcPtr++;
  1227. word = stuffedData[srcPtr];
  1228. }
  1229. delta = val - offset;
  1230. resultPixels[k] = delta;
  1231. }
  1232. }
  1233. }
  1234. }
  1235. }
  1236. data.ptr = data.ptr + (srcPtr + 1) * 4 + (bitPos > 0 ? 4 : 0);
  1237. data.pixels.resultPixels = resultPixelsAllDim;
  1238. //swap for BIP layout
  1239. if (numDims > 1 && !useBSQForOutputDim) {
  1240. data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(resultPixelsAllDim, numPixels, numDims, OutPixelTypeArray);
  1241. }
  1242. },
  1243. decodeBits: function(input, data, blockDataBuffer, offset, iDim) {
  1244. {
  1245. //bitstuff encoding is 3
  1246. var headerInfo = data.headerInfo;
  1247. var fileVersion = headerInfo.fileVersion;
  1248. //var block = {};
  1249. var blockPtr = 0;
  1250. var viewByteLength = ((input.byteLength - data.ptr) >= 5) ? 5 : (input.byteLength - data.ptr);
  1251. var view = new DataView(input, data.ptr, viewByteLength);
  1252. var headerByte = view.getUint8(0);
  1253. blockPtr++;
  1254. var bits67 = headerByte >> 6;
  1255. var n = (bits67 === 0) ? 4 : 3 - bits67;
  1256. var doLut = (headerByte & 32) > 0 ? true : false;//5th bit
  1257. var numBits = headerByte & 31;
  1258. var numElements = 0;
  1259. if (n === 1) {
  1260. numElements = view.getUint8(blockPtr); blockPtr++;
  1261. } else if (n === 2) {
  1262. numElements = view.getUint16(blockPtr, true); blockPtr += 2;
  1263. } else if (n === 4) {
  1264. numElements = view.getUint32(blockPtr, true); blockPtr += 4;
  1265. } else {
  1266. throw "Invalid valid pixel count type";
  1267. }
  1268. //fix: huffman codes are bit stuffed, but not bound by data's max value, so need to use originalUnstuff
  1269. //offset = offset || 0;
  1270. var scale = 2 * headerInfo.maxZError;
  1271. var stuffedData, arrayBuf, store8, dataBytes, dataWords;
  1272. var lutArr, lutData, lutBytes, lutBitsPerElement, bitsPerPixel;
  1273. var zMax = headerInfo.numDims > 1 ? headerInfo.maxValues[iDim] : headerInfo.zMax;
  1274. if (doLut) {
  1275. data.counter.lut++;
  1276. lutBytes = view.getUint8(blockPtr);
  1277. lutBitsPerElement = numBits;
  1278. blockPtr++;
  1279. dataBytes = Math.ceil((lutBytes - 1) * numBits / 8);
  1280. dataWords = Math.ceil(dataBytes / 4);
  1281. arrayBuf = new ArrayBuffer(dataWords * 4);
  1282. store8 = new Uint8Array(arrayBuf);
  1283. data.ptr += blockPtr;
  1284. store8.set(new Uint8Array(input, data.ptr, dataBytes));
  1285. lutData = new Uint32Array(arrayBuf);
  1286. data.ptr += dataBytes;
  1287. bitsPerPixel = 0;
  1288. while ((lutBytes - 1) >>> bitsPerPixel) {
  1289. bitsPerPixel++;
  1290. }
  1291. dataBytes = Math.ceil(numElements * bitsPerPixel / 8);
  1292. dataWords = Math.ceil(dataBytes / 4);
  1293. arrayBuf = new ArrayBuffer(dataWords * 4);
  1294. store8 = new Uint8Array(arrayBuf);
  1295. store8.set(new Uint8Array(input, data.ptr, dataBytes));
  1296. stuffedData = new Uint32Array(arrayBuf);
  1297. data.ptr += dataBytes;
  1298. if (fileVersion >= 3) {
  1299. lutArr = BitStuffer.unstuffLUT2(lutData, numBits, lutBytes - 1, offset, scale, zMax);
  1300. }
  1301. else {
  1302. lutArr = BitStuffer.unstuffLUT(lutData, numBits, lutBytes - 1, offset, scale, zMax);
  1303. }
  1304. //lutArr.unshift(0);
  1305. if (fileVersion >= 3) {
  1306. //BitStuffer.unstuff2(block, blockDataBuffer, headerInfo.zMax);
  1307. BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr);
  1308. }
  1309. else {
  1310. BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr);
  1311. }
  1312. }
  1313. else {
  1314. //console.debug("bitstuffer");
  1315. data.counter.bitstuffer++;
  1316. bitsPerPixel = numBits;
  1317. data.ptr += blockPtr;
  1318. if (bitsPerPixel > 0) {
  1319. dataBytes = Math.ceil(numElements * bitsPerPixel / 8);
  1320. dataWords = Math.ceil(dataBytes / 4);
  1321. arrayBuf = new ArrayBuffer(dataWords * 4);
  1322. store8 = new Uint8Array(arrayBuf);
  1323. store8.set(new Uint8Array(input, data.ptr, dataBytes));
  1324. stuffedData = new Uint32Array(arrayBuf);
  1325. data.ptr += dataBytes;
  1326. if (fileVersion >= 3) {
  1327. if (offset == null) {
  1328. BitStuffer.originalUnstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements);
  1329. }
  1330. else {
  1331. BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax);
  1332. }
  1333. }
  1334. else {
  1335. if (offset == null) {
  1336. BitStuffer.originalUnstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements);
  1337. }
  1338. else {
  1339. BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax);
  1340. }
  1341. }
  1342. }
  1343. }
  1344. }
  1345. },
  1346. readTiles: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {
  1347. var headerInfo = data.headerInfo;
  1348. var width = headerInfo.width;
  1349. var height = headerInfo.height;
  1350. var numPixels = width * height;
  1351. var microBlockSize = headerInfo.microBlockSize;
  1352. var imageType = headerInfo.imageType;
  1353. var dataTypeSize = Lerc2Helpers.getDataTypeSize(imageType);
  1354. var numBlocksX = Math.ceil(width / microBlockSize);
  1355. var numBlocksY = Math.ceil(height / microBlockSize);
  1356. data.pixels.numBlocksY = numBlocksY;
  1357. data.pixels.numBlocksX = numBlocksX;
  1358. data.pixels.ptr = 0;
  1359. var row = 0, col = 0, blockY = 0, blockX = 0, thisBlockHeight = 0, thisBlockWidth = 0, bytesLeft = 0, headerByte = 0, bits67 = 0, testCode = 0, outPtr = 0, outStride = 0, numBytes = 0, bytesleft = 0, z = 0, blockPtr = 0;
  1360. var view, block, arrayBuf, store8, rawData;
  1361. var blockEncoding;
  1362. var blockDataBuffer = new OutPixelTypeArray(microBlockSize * microBlockSize);
  1363. var lastBlockHeight = (height % microBlockSize) || microBlockSize;
  1364. var lastBlockWidth = (width % microBlockSize) || microBlockSize;
  1365. var offsetType, offset;
  1366. var numDims = headerInfo.numDims, iDim;
  1367. var mask = data.pixels.resultMask;
  1368. var resultPixels = data.pixels.resultPixels;
  1369. var fileVersion = headerInfo.fileVersion;
  1370. var fileVersionCheckNum = fileVersion >= 5 ? 14 : 15;
  1371. var isDiffEncoding;
  1372. var zMax = headerInfo.zMax;
  1373. //var resultPixelsAllDim = resultPixels;
  1374. var resultPixelsPrevDim;
  1375. for (blockY = 0; blockY < numBlocksY; blockY++) {
  1376. thisBlockHeight = (blockY !== numBlocksY - 1) ? microBlockSize : lastBlockHeight;
  1377. for (blockX = 0; blockX < numBlocksX; blockX++) {
  1378. //console.debug("y" + blockY + " x" + blockX);
  1379. thisBlockWidth = (blockX !== numBlocksX - 1) ? microBlockSize : lastBlockWidth;
  1380. outPtr = blockY * width * microBlockSize + blockX * microBlockSize;
  1381. outStride = width - thisBlockWidth;
  1382. for (iDim = 0; iDim < numDims; iDim++) {
  1383. if (numDims > 1) {
  1384. resultPixelsPrevDim = resultPixels;
  1385. outPtr = blockY * width * microBlockSize + blockX * microBlockSize;
  1386. resultPixels = new OutPixelTypeArray(data.pixels.resultPixels.buffer, numPixels * iDim * dataTypeSize, numPixels);
  1387. zMax = headerInfo.maxValues[iDim];
  1388. } else {
  1389. resultPixelsPrevDim = null;
  1390. }
  1391. bytesLeft = input.byteLength - data.ptr;
  1392. view = new DataView(input, data.ptr, Math.min(10, bytesLeft));
  1393. block = {};
  1394. blockPtr = 0;
  1395. headerByte = view.getUint8(0);
  1396. blockPtr++;
  1397. isDiffEncoding = headerInfo.fileVersion >= 5 ? headerByte & 4 : 0;
  1398. bits67 = (headerByte >> 6) & 0xFF;
  1399. testCode = (headerByte >> 2) & fileVersionCheckNum; // use bits 2345 for integrity check
  1400. if (testCode !== (((blockX * microBlockSize) >> 3) & fileVersionCheckNum)) {
  1401. throw "integrity issue";
  1402. }
  1403. if (isDiffEncoding && iDim === 0) {
  1404. throw "integrity issue";
  1405. }
  1406. blockEncoding = headerByte & 3;
  1407. if (blockEncoding > 3) {
  1408. data.ptr += blockPtr;
  1409. throw "Invalid block encoding (" + blockEncoding + ")";
  1410. }
  1411. else if (blockEncoding === 2) { //constant 0
  1412. if (isDiffEncoding) {
  1413. if (mask) {
  1414. for (row = 0; row < thisBlockHeight; row++) {
  1415. for (col = 0; col < thisBlockWidth; col++) {
  1416. if (mask[outPtr]) {
  1417. resultPixels[outPtr] = resultPixelsPrevDim[outPtr];
  1418. }
  1419. outPtr++;
  1420. }
  1421. }
  1422. }
  1423. else {
  1424. for (row = 0; row < thisBlockHeight; row++) {
  1425. for (col = 0; col < thisBlockWidth; col++) {
  1426. resultPixels[outPtr] = resultPixelsPrevDim[outPtr];
  1427. outPtr++;
  1428. }
  1429. }
  1430. }
  1431. }
  1432. data.counter.constant++;
  1433. data.ptr += blockPtr;
  1434. continue;
  1435. }
  1436. else if (blockEncoding === 0) { //uncompressed
  1437. if (isDiffEncoding) {
  1438. // doesn't make sense, should not happen
  1439. throw "integrity issue";
  1440. }
  1441. data.counter.uncompressed++;
  1442. data.ptr += blockPtr;
  1443. numBytes = thisBlockHeight * thisBlockWidth * dataTypeSize;
  1444. bytesleft = input.byteLength - data.ptr;
  1445. numBytes = numBytes < bytesleft ? numBytes : bytesleft;
  1446. //bit alignment
  1447. arrayBuf = new ArrayBuffer((numBytes % dataTypeSize) === 0 ? numBytes : (numBytes + dataTypeSize - numBytes % dataTypeSize));
  1448. store8 = new Uint8Array(arrayBuf);
  1449. store8.set(new Uint8Array(input, data.ptr, numBytes));
  1450. rawData = new OutPixelTypeArray(arrayBuf);
  1451. z = 0;
  1452. if (mask) {
  1453. for (row = 0; row < thisBlockHeight; row++) {
  1454. for (col = 0; col < thisBlockWidth; col++) {
  1455. if (mask[outPtr]) {
  1456. resultPixels[outPtr] = rawData[z++];
  1457. }
  1458. outPtr++;
  1459. }
  1460. outPtr += outStride;
  1461. }
  1462. }
  1463. else {//all valid
  1464. for (row = 0; row < thisBlockHeight; row++) {
  1465. for (col = 0; col < thisBlockWidth; col++) {
  1466. resultPixels[outPtr++] = rawData[z++];
  1467. }
  1468. outPtr += outStride;
  1469. }
  1470. }
  1471. data.ptr += z * dataTypeSize;
  1472. }
  1473. else { //1 or 3
  1474. offsetType = Lerc2Helpers.getDataTypeUsed((isDiffEncoding && imageType < 6) ? 4 : imageType, bits67);
  1475. offset = Lerc2Helpers.getOnePixel(block, blockPtr, offsetType, view);
  1476. blockPtr += Lerc2Helpers.getDataTypeSize(offsetType);
  1477. if (blockEncoding === 3) //constant offset value
  1478. {
  1479. data.ptr += blockPtr;
  1480. data.counter.constantoffset++;
  1481. //you can delete the following resultMask case in favor of performance because val is constant and users use nodata mask, otherwise nodatavalue post processing handles it too.
  1482. //while the above statement is true, we're not doing it as we want to keep invalid pixel value at 0 rather than arbitrary values
  1483. if (mask) {
  1484. for (row = 0; row < thisBlockHeight; row++) {
  1485. for (col = 0; col < thisBlockWidth; col++) {
  1486. if (mask[outPtr]) {
  1487. resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset;
  1488. }
  1489. outPtr++;
  1490. }
  1491. outPtr += outStride;
  1492. }
  1493. }
  1494. else {
  1495. for (row = 0; row < thisBlockHeight; row++) {
  1496. for (col = 0; col < thisBlockWidth; col++) {
  1497. resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset;
  1498. outPtr++;
  1499. }
  1500. outPtr += outStride;
  1501. }
  1502. }
  1503. }
  1504. else { //bitstuff encoding is 3
  1505. data.ptr += blockPtr;
  1506. //heavy lifting
  1507. Lerc2Helpers.decodeBits(input, data, blockDataBuffer, offset, iDim);
  1508. blockPtr = 0;
  1509. // duplicate code to favor performance, diff encoding is for multidimension only
  1510. if (isDiffEncoding) {
  1511. if (mask) {
  1512. for (row = 0; row < thisBlockHeight; row++) {
  1513. for (col = 0; col < thisBlockWidth; col++) {
  1514. if (mask[outPtr]) {
  1515. resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr];
  1516. }
  1517. outPtr++;
  1518. }
  1519. outPtr += outStride;
  1520. }
  1521. }
  1522. else {
  1523. for (row = 0; row < thisBlockHeight; row++) {
  1524. for (col = 0; col < thisBlockWidth; col++) {
  1525. resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr];
  1526. outPtr++;
  1527. }
  1528. outPtr += outStride;
  1529. }
  1530. }
  1531. }
  1532. else if (mask) {
  1533. for (row = 0; row < thisBlockHeight; row++) {
  1534. for (col = 0; col < thisBlockWidth; col++) {
  1535. if (mask[outPtr]) {
  1536. resultPixels[outPtr] = blockDataBuffer[blockPtr++];
  1537. }
  1538. outPtr++;
  1539. }
  1540. outPtr += outStride;
  1541. }
  1542. }
  1543. else {
  1544. for (row = 0; row < thisBlockHeight; row++) {
  1545. for (col = 0; col < thisBlockWidth; col++) {
  1546. resultPixels[outPtr++] = blockDataBuffer[blockPtr++];
  1547. }
  1548. outPtr += outStride;
  1549. }
  1550. }
  1551. }
  1552. }
  1553. }
  1554. }
  1555. }
  1556. //swap for BIP: it's always easier for clients to handle BSQ so we keep existing logic and introduce a swap here to minimze changes
  1557. if (numDims > 1 && !useBSQForOutputDim) {
  1558. data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(data.pixels.resultPixels, numPixels, numDims, OutPixelTypeArray);
  1559. }
  1560. },
  1561. /*****************
  1562. * private methods (helper methods)
  1563. *****************/
  1564. formatFileInfo: function(data) {
  1565. return {
  1566. "fileIdentifierString": data.headerInfo.fileIdentifierString,
  1567. "fileVersion": data.headerInfo.fileVersion,
  1568. "imageType": data.headerInfo.imageType,
  1569. "height": data.headerInfo.height,
  1570. "width": data.headerInfo.width,
  1571. "numValidPixel": data.headerInfo.numValidPixel,
  1572. "microBlockSize": data.headerInfo.microBlockSize,
  1573. "blobSize": data.headerInfo.blobSize,
  1574. "maxZError": data.headerInfo.maxZError,
  1575. "pixelType": Lerc2Helpers.getPixelType(data.headerInfo.imageType),
  1576. "eofOffset": data.eofOffset,
  1577. "mask": data.mask ? {
  1578. "numBytes": data.mask.numBytes
  1579. } : null,
  1580. "pixels": {
  1581. "numBlocksX": data.pixels.numBlocksX,
  1582. "numBlocksY": data.pixels.numBlocksY,
  1583. //"numBytes": data.pixels.numBytes,
  1584. "maxValue": data.headerInfo.zMax,
  1585. "minValue": data.headerInfo.zMin,
  1586. "noDataValue": data.noDataValue
  1587. }
  1588. };
  1589. },
  1590. constructConstantSurface: function(data, useBSQForOutputDim) {
  1591. var val = data.headerInfo.zMax;
  1592. var valMin = data.headerInfo.zMin;
  1593. var maxValues = data.headerInfo.maxValues;
  1594. var numDims = data.headerInfo.numDims;
  1595. var numPixels = data.headerInfo.height * data.headerInfo.width;
  1596. var i = 0, k = 0, nStart = 0;
  1597. var mask = data.pixels.resultMask;
  1598. var resultPixels = data.pixels.resultPixels;
  1599. if (mask) {
  1600. if (numDims > 1) {
  1601. if (useBSQForOutputDim) {
  1602. for (i = 0; i < numDims; i++) {
  1603. nStart = i * numPixels;
  1604. val = maxValues[i];
  1605. for (k = 0; k < numPixels; k++) {
  1606. if (mask[k]) {
  1607. resultPixels[nStart + k] = val;
  1608. }
  1609. }
  1610. }
  1611. }
  1612. else {
  1613. for (k = 0; k < numPixels; k++) {
  1614. if (mask[k]) {
  1615. nStart = k * numDims;
  1616. for (i = 0; i < numDims; i++) {
  1617. resultPixels[nStart + numDims] = maxValues[i];
  1618. }
  1619. }
  1620. }
  1621. }
  1622. }
  1623. else {
  1624. for (k = 0; k < numPixels; k++) {
  1625. if (mask[k]) {
  1626. resultPixels[k] = val;
  1627. }
  1628. }
  1629. }
  1630. }
  1631. else {
  1632. if (numDims > 1 && valMin !== val) {
  1633. if (useBSQForOutputDim) {
  1634. for (i = 0; i < numDims; i++) {
  1635. nStart = i * numPixels;
  1636. val = maxValues[i];
  1637. for (k = 0; k < numPixels; k++) {
  1638. resultPixels[nStart + k] = val;
  1639. }
  1640. }
  1641. }
  1642. else {
  1643. for (k = 0; k < numPixels; k++) {
  1644. nStart = k * numDims;
  1645. for (i = 0; i < numDims; i++) {
  1646. resultPixels[nStart + i] = maxValues[i];
  1647. }
  1648. }
  1649. }
  1650. }
  1651. else {
  1652. for (k = 0; k < numPixels * numDims; k++) {
  1653. resultPixels[k] = val;
  1654. }
  1655. }
  1656. }
  1657. return;
  1658. },
  1659. getDataTypeArray: function(t) {
  1660. var tp;
  1661. switch (t) {
  1662. case 0: //char
  1663. tp = Int8Array;
  1664. break;
  1665. case 1: //byte
  1666. tp = Uint8Array;
  1667. break;
  1668. case 2: //short
  1669. tp = Int16Array;
  1670. break;
  1671. case 3: //ushort
  1672. tp = Uint16Array;
  1673. break;
  1674. case 4:
  1675. tp = Int32Array;
  1676. break;
  1677. case 5:
  1678. tp = Uint32Array;
  1679. break;
  1680. case 6:
  1681. tp = Float32Array;
  1682. break;
  1683. case 7:
  1684. tp = Float64Array;
  1685. break;
  1686. default:
  1687. tp = Float32Array;
  1688. }
  1689. return tp;
  1690. },
  1691. getPixelType: function(t) {
  1692. var tp;
  1693. switch (t) {
  1694. case 0: //char
  1695. tp = "S8";
  1696. break;
  1697. case 1: //byte
  1698. tp = "U8";
  1699. break;
  1700. case 2: //short
  1701. tp = "S16";
  1702. break;
  1703. case 3: //ushort
  1704. tp = "U16";
  1705. break;
  1706. case 4:
  1707. tp = "S32";
  1708. break;
  1709. case 5:
  1710. tp = "U32";
  1711. break;
  1712. case 6:
  1713. tp = "F32";
  1714. break;
  1715. case 7:
  1716. tp = "F64";
  1717. break;
  1718. default:
  1719. tp = "F32";
  1720. }
  1721. return tp;
  1722. },
  1723. isValidPixelValue: function(t, val) {
  1724. if (val == null) {
  1725. return false;
  1726. }
  1727. var isValid;
  1728. switch (t) {
  1729. case 0: //char
  1730. isValid = val >= -128 && val <= 127;
  1731. break;
  1732. case 1: //byte (unsigned char)
  1733. isValid = val >= 0 && val <= 255;
  1734. break;
  1735. case 2: //short
  1736. isValid = val >= -32768 && val <= 32767;
  1737. break;
  1738. case 3: //ushort
  1739. isValid = val >= 0 && val <= 65536;
  1740. break;
  1741. case 4: //int 32
  1742. isValid = val >= -2147483648 && val <= 2147483647;
  1743. break;
  1744. case 5: //uinit 32
  1745. isValid = val >= 0 && val <= 4294967296;
  1746. break;
  1747. case 6:
  1748. isValid = val >= -3.4027999387901484e+38 && val <= 3.4027999387901484e+38;
  1749. break;
  1750. case 7:
  1751. isValid = val >= -1.7976931348623157e+308 && val <= 1.7976931348623157e+308;
  1752. break;
  1753. default:
  1754. isValid = false;
  1755. }
  1756. return isValid;
  1757. },
  1758. getDataTypeSize: function(t) {
  1759. var s = 0;
  1760. switch (t) {
  1761. case 0: //ubyte
  1762. case 1: //byte
  1763. s = 1;
  1764. break;
  1765. case 2: //short
  1766. case 3: //ushort
  1767. s = 2;
  1768. break;
  1769. case 4:
  1770. case 5:
  1771. case 6:
  1772. s = 4;
  1773. break;
  1774. case 7:
  1775. s = 8;
  1776. break;
  1777. default:
  1778. s = t;
  1779. }
  1780. return s;
  1781. },
  1782. getDataTypeUsed: function(dt, tc) {
  1783. var t = dt;
  1784. switch (dt) {
  1785. case 2: //short
  1786. case 4: //long
  1787. t = dt - tc;
  1788. break;
  1789. case 3: //ushort
  1790. case 5: //ulong
  1791. t = dt - 2 * tc;
  1792. break;
  1793. case 6: //float
  1794. if (0 === tc) {
  1795. t = dt;
  1796. }
  1797. else if (1 === tc) {
  1798. t = 2;
  1799. }
  1800. else {
  1801. t = 1;//byte
  1802. }
  1803. break;
  1804. case 7: //double
  1805. if (0 === tc) {
  1806. t = dt;
  1807. }
  1808. else {
  1809. t = dt - 2 * tc + 1;
  1810. }
  1811. break;
  1812. default:
  1813. t = dt;
  1814. break;
  1815. }
  1816. return t;
  1817. },
  1818. getOnePixel: function(block, blockPtr, offsetType, view) {
  1819. var temp = 0;
  1820. switch (offsetType) {
  1821. case 0: //char
  1822. temp = view.getInt8(blockPtr);
  1823. break;
  1824. case 1: //byte
  1825. temp = view.getUint8(blockPtr);
  1826. break;
  1827. case 2:
  1828. temp = view.getInt16(blockPtr, true);
  1829. break;
  1830. case 3:
  1831. temp = view.getUint16(blockPtr, true);
  1832. break;
  1833. case 4:
  1834. temp = view.getInt32(blockPtr, true);
  1835. break;
  1836. case 5:
  1837. temp = view.getUInt32(blockPtr, true);
  1838. break;
  1839. case 6:
  1840. temp = view.getFloat32(blockPtr, true);
  1841. break;
  1842. case 7:
  1843. temp = view.getFloat64(blockPtr, true);
  1844. break;
  1845. default:
  1846. throw ("the decoder does not understand this pixel type");
  1847. }
  1848. return temp;
  1849. },
  1850. swapDimensionOrder: function(pixels, numPixels, numDims, OutPixelTypeArray, inputIsBIP) {
  1851. var i = 0, j = 0, iDim = 0, temp = 0, swap = pixels;
  1852. if (numDims > 1) {
  1853. swap = new OutPixelTypeArray(numPixels * numDims);
  1854. if (inputIsBIP) {
  1855. for (i=0; i<numPixels; i++) {
  1856. temp = i;
  1857. for (iDim=0; iDim < numDims; iDim++, temp += numPixels) {
  1858. swap[temp] = pixels[j++];
  1859. }
  1860. }
  1861. }
  1862. else {
  1863. for (i=0; i<numPixels; i++) {
  1864. temp = i;
  1865. for (iDim=0; iDim < numDims; iDim++, temp += numPixels) {
  1866. swap[j++] = pixels[temp];
  1867. }
  1868. }
  1869. }
  1870. }
  1871. return swap;
  1872. }
  1873. };
  1874. /***************************************************
  1875. *private class for a tree node. Huffman code is in Lerc2Helpers
  1876. ****************************************************/
  1877. var TreeNode = function(val, left, right) {
  1878. this.val = val;
  1879. this.left = left;
  1880. this.right = right;
  1881. };
  1882. var Lerc2Decode = {
  1883. /*
  1884. * ********removed options compared to LERC1. We can bring some of them back if needed.
  1885. * removed pixel type. LERC2 is typed and doesn't require user to give pixel type
  1886. * changed encodedMaskData to maskData. LERC2 's js version make it faster to use maskData directly.
  1887. * removed returnMask. mask is used by LERC2 internally and is cost free. In case of user input mask, it's returned as well and has neglible cost.
  1888. * removed nodatavalue. Because LERC2 pixels are typed, nodatavalue will sacrify a useful value for many types (8bit, 16bit) etc,
  1889. * user has to be knowledgable enough about raster and their data to avoid usability issues. so nodata value is simply removed now.
  1890. * We can add it back later if their's a clear requirement.
  1891. * removed encodedMask. This option was not implemented in LercDecode. It can be done after decoding (less efficient)
  1892. * removed computeUsedBitDepths.
  1893. *
  1894. *
  1895. * response changes compared to LERC1
  1896. * 1. encodedMaskData is not available
  1897. * 2. noDataValue is optional (returns only if user's noDataValue is with in the valid data type range)
  1898. * 3. maskData is always available
  1899. */
  1900. /*****************
  1901. * public properties
  1902. ******************/
  1903. //HUFFMAN_LUT_BITS_MAX: 12, //use 2^12 lut, not configurable
  1904. /*****************
  1905. * public methods
  1906. *****************/
  1907. /**
  1908. * Decode a LERC2 byte stream and return an object containing the pixel data and optional metadata.
  1909. *
  1910. * @param {ArrayBuffer} input The LERC input byte stream
  1911. * @param {object} [options] options Decoding options
  1912. * @param {number} [options.inputOffset] The number of bytes to skip in the input byte stream. A valid LERC file is expected at that position
  1913. * @param {boolean} [options.returnFileInfo] If true, the return value will have a fileInfo property that contains metadata obtained from the LERC headers and the decoding process
  1914. * @param {boolean} [options.returnPixelInterleavedDims] If true, returned dimensions are pixel-interleaved, a.k.a [p1_dim0, p1_dim1, p1_dimn, p2_dim0...], default is [p1_dim0, p2_dim0, ..., p1_dim1, p2_dim1...]
  1915. */
  1916. decode: function(/*byte array*/ input, /*object*/ options) {
  1917. //currently there's a bug in the sparse array, so please do not set to false
  1918. options = options || {};
  1919. var noDataValue = options.noDataValue;
  1920. //initialize
  1921. var i = 0, data = {};
  1922. data.ptr = options.inputOffset || 0;
  1923. data.pixels = {};
  1924. // File header
  1925. if (!Lerc2Helpers.readHeaderInfo(input, data)) {
  1926. return;
  1927. }
  1928. var headerInfo = data.headerInfo;
  1929. var fileVersion = headerInfo.fileVersion;
  1930. var OutPixelTypeArray = Lerc2Helpers.getDataTypeArray(headerInfo.imageType);
  1931. // version check
  1932. if (fileVersion > 5) {
  1933. throw "unsupported lerc version 2." + fileVersion;
  1934. }
  1935. // Mask Header
  1936. Lerc2Helpers.readMask(input, data);
  1937. if (headerInfo.numValidPixel !== headerInfo.width * headerInfo.height && !data.pixels.resultMask) {
  1938. data.pixels.resultMask = options.maskData;
  1939. }
  1940. var numPixels = headerInfo.width * headerInfo.height;
  1941. data.pixels.resultPixels = new OutPixelTypeArray(numPixels * headerInfo.numDims);
  1942. data.counter = {
  1943. onesweep: 0,
  1944. uncompressed: 0,
  1945. lut: 0,
  1946. bitstuffer: 0,
  1947. constant: 0,
  1948. constantoffset: 0
  1949. };
  1950. var useBSQForOutputDim = !options.returnPixelInterleavedDims;
  1951. if (headerInfo.numValidPixel !== 0) {
  1952. //not tested
  1953. if (headerInfo.zMax === headerInfo.zMin) //constant surface
  1954. {
  1955. Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim);
  1956. }
  1957. else if (fileVersion >= 4 && Lerc2Helpers.checkMinMaxRanges(input, data)) {
  1958. Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim);
  1959. }
  1960. else {
  1961. var view = new DataView(input, data.ptr, 2);
  1962. var bReadDataOneSweep = view.getUint8(0);
  1963. data.ptr++;
  1964. if (bReadDataOneSweep) {
  1965. //console.debug("OneSweep");
  1966. Lerc2Helpers.readDataOneSweep(input, data, OutPixelTypeArray, useBSQForOutputDim);
  1967. }
  1968. else {
  1969. //lerc2.1: //bitstuffing + lut
  1970. //lerc2.2: //bitstuffing + lut + huffman
  1971. //lerc2.3: new bitstuffer
  1972. if (fileVersion > 1 && headerInfo.imageType <= 1 && Math.abs(headerInfo.maxZError - 0.5) < 0.00001) {
  1973. //this is 2.x plus 8 bit (unsigned and signed) data, possiblity of Huffman
  1974. var flagHuffman = view.getUint8(1);
  1975. data.ptr++;
  1976. data.encodeMode = flagHuffman;
  1977. if (flagHuffman > 2 || (fileVersion < 4 && flagHuffman > 1)) {
  1978. throw "Invalid Huffman flag " + flagHuffman;
  1979. }
  1980. if (flagHuffman) {//1 - delta Huffman, 2 - Huffman
  1981. //console.log("Huffman");
  1982. Lerc2Helpers.readHuffman(input, data, OutPixelTypeArray, useBSQForOutputDim);
  1983. }
  1984. else {
  1985. //console.log("Tiles");
  1986. Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim);
  1987. }
  1988. }
  1989. else { //lerc2.x non-8 bit data
  1990. //console.log("Tiles");
  1991. Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim);
  1992. }
  1993. }
  1994. }
  1995. }
  1996. data.eofOffset = data.ptr;
  1997. var diff;
  1998. if (options.inputOffset) {
  1999. diff = data.headerInfo.blobSize + options.inputOffset - data.ptr;
  2000. if (Math.abs(diff) >= 1) {
  2001. //console.debug("incorrect eof: dataptr " + data.ptr + " offset " + options.inputOffset + " blobsize " + data.headerInfo.blobSize + " diff: " + diff);
  2002. data.eofOffset = options.inputOffset + data.headerInfo.blobSize;
  2003. }
  2004. }
  2005. else {
  2006. diff = data.headerInfo.blobSize - data.ptr;
  2007. if (Math.abs(diff) >= 1) {
  2008. //console.debug("incorrect first band eof: dataptr " + data.ptr + " blobsize " + data.headerInfo.blobSize + " diff: " + diff);
  2009. data.eofOffset = data.headerInfo.blobSize;
  2010. }
  2011. }
  2012. var result = {
  2013. width: headerInfo.width,
  2014. height: headerInfo.height,
  2015. pixelData: data.pixels.resultPixels,
  2016. minValue: headerInfo.zMin,
  2017. maxValue: headerInfo.zMax,
  2018. validPixelCount: headerInfo.numValidPixel,
  2019. dimCount: headerInfo.numDims,
  2020. dimStats: {
  2021. minValues: headerInfo.minValues,
  2022. maxValues: headerInfo.maxValues
  2023. },
  2024. maskData: data.pixels.resultMask
  2025. //noDataValue: noDataValue
  2026. };
  2027. //we should remove this if there's no existing client
  2028. //optional noDataValue processing, it's user's responsiblity
  2029. if (data.pixels.resultMask && Lerc2Helpers.isValidPixelValue(headerInfo.imageType, noDataValue)) {
  2030. var mask = data.pixels.resultMask;
  2031. for (i = 0; i < numPixels; i++) {
  2032. if (!mask[i]) {
  2033. result.pixelData[i] = noDataValue;
  2034. }
  2035. }
  2036. result.noDataValue = noDataValue;
  2037. }
  2038. data.noDataValue = noDataValue;
  2039. if (options.returnFileInfo) {
  2040. result.fileInfo = Lerc2Helpers.formatFileInfo(data);
  2041. }
  2042. return result;
  2043. },
  2044. getBandCount: function(/*byte array*/ input) {
  2045. var count = 0;
  2046. var i = 0;
  2047. var temp = {};
  2048. temp.ptr = 0;
  2049. temp.pixels = {};
  2050. while (i < input.byteLength - 58) {
  2051. Lerc2Helpers.readHeaderInfo(input, temp);
  2052. i += temp.headerInfo.blobSize;
  2053. count++;
  2054. temp.ptr = i;
  2055. }
  2056. return count;
  2057. }
  2058. };
  2059. return Lerc2Decode;
  2060. })();
  2061. var isPlatformLittleEndian = (function() {
  2062. var a = new ArrayBuffer(4);
  2063. var b = new Uint8Array(a);
  2064. var c = new Uint32Array(a);
  2065. c[0] = 1;
  2066. return b[0] === 1;
  2067. })();
  2068. var Lerc = {
  2069. /************wrapper**********************************************/
  2070. /**
  2071. * A wrapper for decoding both LERC1 and LERC2 byte streams capable of handling multiband pixel blocks for various pixel types.
  2072. *
  2073. * @alias module:Lerc
  2074. * @param {ArrayBuffer} input The LERC input byte stream
  2075. * @param {object} [options] The decoding options below are optional.
  2076. * @param {number} [options.inputOffset] The number of bytes to skip in the input byte stream. A valid Lerc file is expected at that position.
  2077. * @param {string} [options.pixelType] (LERC1 only) Default value is F32. Valid pixel types for input are U8/S8/S16/U16/S32/U32/F32.
  2078. * @param {number} [options.noDataValue] (LERC1 only). It is recommended to use the returned mask instead of setting this value.
  2079. * @param {boolean} [options.returnPixelInterleavedDims] (nDim LERC2 only) If true, returned dimensions are pixel-interleaved, a.k.a [p1_dim0, p1_dim1, p1_dimn, p2_dim0...], default is [p1_dim0, p2_dim0, ..., p1_dim1, p2_dim1...]
  2080. * @returns {{width, height, pixels, pixelType, mask, statistics}}
  2081. * @property {number} width Width of decoded image.
  2082. * @property {number} height Height of decoded image.
  2083. * @property {array} pixels [band1, band2, …] Each band is a typed array of width*height.
  2084. * @property {string} pixelType The type of pixels represented in the output.
  2085. * @property {mask} mask Typed array with a size of width*height, or null if all pixels are valid.
  2086. * @property {array} statistics [statistics_band1, statistics_band2, …] Each element is a statistics object representing min and max values
  2087. **/
  2088. decode: function(encodedData, options) {
  2089. if (!isPlatformLittleEndian) {
  2090. throw "Big endian system is not supported.";
  2091. }
  2092. options = options || {};
  2093. var inputOffset = options.inputOffset || 0;
  2094. var fileIdView = new Uint8Array(encodedData, inputOffset, 10);
  2095. var fileIdentifierString = String.fromCharCode.apply(null, fileIdView);
  2096. var lerc, majorVersion;
  2097. if (fileIdentifierString.trim() === "CntZImage") {
  2098. lerc = LercDecode;
  2099. majorVersion = 1;
  2100. }
  2101. else if (fileIdentifierString.substring(0, 5) === "Lerc2") {
  2102. lerc = Lerc2Decode;
  2103. majorVersion = 2;
  2104. }
  2105. else {
  2106. throw "Unexpected file identifier string: " + fileIdentifierString;
  2107. }
  2108. var iPlane = 0, eof = encodedData.byteLength - 10, encodedMaskData, bandMasks = [], bandMask, maskData;
  2109. var decodedPixelBlock = {
  2110. width: 0,
  2111. height: 0,
  2112. pixels: [],
  2113. pixelType: options.pixelType,
  2114. mask: null,
  2115. statistics: []
  2116. };
  2117. var uniqueBandMaskCount = 0;
  2118. while (inputOffset < eof) {
  2119. var result = lerc.decode(encodedData, {
  2120. inputOffset: inputOffset,//for both lerc1 and lerc2
  2121. encodedMaskData: encodedMaskData,//lerc1 only
  2122. maskData: maskData,//lerc2 only
  2123. returnMask: iPlane === 0 ? true : false,//lerc1 only
  2124. returnEncodedMask: iPlane === 0 ? true : false,//lerc1 only
  2125. returnFileInfo: true,//for both lerc1 and lerc2
  2126. returnPixelInterleavedDims: options.returnPixelInterleavedDims,//for ndim lerc2 only
  2127. pixelType: options.pixelType || null,//lerc1 only
  2128. noDataValue: options.noDataValue || null//lerc1 only
  2129. });
  2130. inputOffset = result.fileInfo.eofOffset;
  2131. maskData = result.maskData;//lerc2
  2132. if (iPlane === 0) {
  2133. encodedMaskData = result.encodedMaskData;//lerc1
  2134. decodedPixelBlock.width = result.width;
  2135. decodedPixelBlock.height = result.height;
  2136. decodedPixelBlock.dimCount = result.dimCount || 1;
  2137. //decodedPixelBlock.dimStats = decodedPixelBlock.dimStats;
  2138. decodedPixelBlock.pixelType = result.pixelType || result.fileInfo.pixelType;
  2139. decodedPixelBlock.mask = maskData;
  2140. }
  2141. if (majorVersion > 1) {
  2142. if (maskData) {
  2143. bandMasks.push(maskData);
  2144. }
  2145. if (result.fileInfo.mask && result.fileInfo.mask.numBytes > 0) {
  2146. uniqueBandMaskCount++;
  2147. }
  2148. }
  2149. iPlane++;
  2150. decodedPixelBlock.pixels.push(result.pixelData);
  2151. decodedPixelBlock.statistics.push({
  2152. minValue: result.minValue,
  2153. maxValue: result.maxValue,
  2154. noDataValue: result.noDataValue,
  2155. dimStats: result.dimStats
  2156. });
  2157. }
  2158. var i, j, numPixels;
  2159. if (majorVersion > 1 && uniqueBandMaskCount > 1) {
  2160. numPixels = decodedPixelBlock.width * decodedPixelBlock.height;
  2161. decodedPixelBlock.bandMasks = bandMasks;
  2162. maskData = new Uint8Array(numPixels);
  2163. maskData.set(bandMasks[0]);
  2164. for (i = 1; i < bandMasks.length; i++) {
  2165. bandMask = bandMasks[i];
  2166. for (j = 0; j < numPixels; j++) {
  2167. maskData[j] = maskData[j] & bandMask[j];
  2168. }
  2169. }
  2170. decodedPixelBlock.maskData = maskData;
  2171. }
  2172. return decodedPixelBlock;
  2173. }
  2174. };
  2175. if (typeof define === "function" && define.amd) {/* jshint ignore:line */
  2176. //amd loaders such as dojo and requireJS
  2177. //http://wiki.commonjs.org/wiki/Modules/AsynchronousDefinition
  2178. define([], function() { return Lerc; });/* jshint ignore:line */
  2179. }
  2180. else if (typeof module !== "undefined" && module.exports) {/* jshint ignore:line */
  2181. //commonJS module 1.0/1.1/1.1.1 systems, such as nodeJS
  2182. //http://wiki.commonjs.org/wiki/Modules
  2183. module.exports = Lerc;/* jshint ignore:line */
  2184. }
  2185. else {
  2186. //assign to this, most likely window
  2187. this.Lerc = Lerc;
  2188. }
  2189. })();