ry-vue-map 0.1.2 → 0.1.4

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