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.
- package/README.MD +1 -1
- package/lib/ryui.common.js +38444 -73751
- package/lib/ryui.common.js.gz +0 -0
- package/lib/ryui.css +1 -1
- package/lib/ryui.umd.js +38444 -73751
- package/lib/ryui.umd.js.gz +0 -0
- package/lib/ryui.umd.min.js +6 -13
- package/lib/ryui.umd.min.js.gz +0 -0
- package/package.json +1 -1
- package/src/components/maps/ryClustersMarker/src/index.vue +1 -1
- package/src/components/maps/ryMap/src/index.vue +3 -2
- package/src/utils/lMapServices.js +2 -3
- package/src/views/map/index.vue +11 -3
- package/lib/ryui.common.0.js +0 -6852
- package/lib/ryui.common.0.js.gz +0 -0
- package/lib/ryui.common.2.js +0 -1034
- package/lib/ryui.common.2.js.gz +0 -0
- package/lib/ryui.common.3.js +0 -268
- package/lib/ryui.common.4.js +0 -163
- package/lib/ryui.common.5.js +0 -144
- package/lib/ryui.common.6.js +0 -177
- package/lib/ryui.common.7.js +0 -2373
- package/lib/ryui.common.7.js.gz +0 -0
- package/lib/ryui.common.8.js +0 -47
- package/lib/ryui.common.8.js.gz +0 -0
- package/lib/ryui.common.9.js +0 -23
- package/lib/ryui.umd.0.js +0 -6852
- package/lib/ryui.umd.0.js.gz +0 -0
- package/lib/ryui.umd.2.js +0 -1034
- package/lib/ryui.umd.2.js.gz +0 -0
- package/lib/ryui.umd.3.js +0 -268
- package/lib/ryui.umd.4.js +0 -163
- package/lib/ryui.umd.5.js +0 -144
- package/lib/ryui.umd.6.js +0 -177
- package/lib/ryui.umd.7.js +0 -2373
- package/lib/ryui.umd.7.js.gz +0 -0
- package/lib/ryui.umd.8.js +0 -47
- package/lib/ryui.umd.8.js.gz +0 -0
- package/lib/ryui.umd.9.js +0 -23
- package/lib/ryui.umd.min.0.js +0 -3
- package/lib/ryui.umd.min.0.js.gz +0 -0
- package/lib/ryui.umd.min.2.js +0 -1
- package/lib/ryui.umd.min.2.js.gz +0 -0
- package/lib/ryui.umd.min.3.js +0 -1
- package/lib/ryui.umd.min.4.js +0 -1
- package/lib/ryui.umd.min.5.js +0 -1
- package/lib/ryui.umd.min.6.js +0 -1
- package/lib/ryui.umd.min.7.js +0 -2
- package/lib/ryui.umd.min.7.js.gz +0 -0
- package/lib/ryui.umd.min.8.js +0 -1
- package/lib/ryui.umd.min.8.js.gz +0 -0
- package/lib/ryui.umd.min.9.js +0 -1
package/lib/ryui.common.2.js.gz
DELETED
|
Binary file
|
package/lib/ryui.common.3.js
DELETED
|
@@ -1,268 +0,0 @@
|
|
|
1
|
-
((typeof self !== 'undefined' ? self : this)["webpackJsonpryui"] = (typeof self !== 'undefined' ? self : this)["webpackJsonpryui"] || []).push([[3],{
|
|
2
|
-
|
|
3
|
-
/***/ "852f":
|
|
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 LZWDecoder; });
|
|
9
|
-
/* harmony import */ var _basedecoder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("b3f7");
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
const MIN_BITS = 9;
|
|
13
|
-
const CLEAR_CODE = 256; // clear code
|
|
14
|
-
const EOI_CODE = 257; // end of information
|
|
15
|
-
const MAX_BYTELENGTH = 12;
|
|
16
|
-
|
|
17
|
-
function getByte(array, position, length) {
|
|
18
|
-
const d = position % 8;
|
|
19
|
-
const a = Math.floor(position / 8);
|
|
20
|
-
const de = 8 - d;
|
|
21
|
-
const ef = (position + length) - ((a + 1) * 8);
|
|
22
|
-
let fg = (8 * (a + 2)) - (position + length);
|
|
23
|
-
const dg = ((a + 2) * 8) - position;
|
|
24
|
-
fg = Math.max(0, fg);
|
|
25
|
-
if (a >= array.length) {
|
|
26
|
-
console.warn('ran off the end of the buffer before finding EOI_CODE (end on input code)');
|
|
27
|
-
return EOI_CODE;
|
|
28
|
-
}
|
|
29
|
-
let chunk1 = array[a] & ((2 ** (8 - d)) - 1);
|
|
30
|
-
chunk1 <<= (length - de);
|
|
31
|
-
let chunks = chunk1;
|
|
32
|
-
if (a + 1 < array.length) {
|
|
33
|
-
let chunk2 = array[a + 1] >>> fg;
|
|
34
|
-
chunk2 <<= Math.max(0, (length - dg));
|
|
35
|
-
chunks += chunk2;
|
|
36
|
-
}
|
|
37
|
-
if (ef > 8 && a + 2 < array.length) {
|
|
38
|
-
const hi = ((a + 3) * 8) - (position + length);
|
|
39
|
-
const chunk3 = array[a + 2] >>> hi;
|
|
40
|
-
chunks += chunk3;
|
|
41
|
-
}
|
|
42
|
-
return chunks;
|
|
43
|
-
}
|
|
44
|
-
|
|
45
|
-
function appendReversed(dest, source) {
|
|
46
|
-
for (let i = source.length - 1; i >= 0; i--) {
|
|
47
|
-
dest.push(source[i]);
|
|
48
|
-
}
|
|
49
|
-
return dest;
|
|
50
|
-
}
|
|
51
|
-
|
|
52
|
-
function decompress(input) {
|
|
53
|
-
const dictionaryIndex = new Uint16Array(4093);
|
|
54
|
-
const dictionaryChar = new Uint8Array(4093);
|
|
55
|
-
for (let i = 0; i <= 257; i++) {
|
|
56
|
-
dictionaryIndex[i] = 4096;
|
|
57
|
-
dictionaryChar[i] = i;
|
|
58
|
-
}
|
|
59
|
-
let dictionaryLength = 258;
|
|
60
|
-
let byteLength = MIN_BITS;
|
|
61
|
-
let position = 0;
|
|
62
|
-
|
|
63
|
-
function initDictionary() {
|
|
64
|
-
dictionaryLength = 258;
|
|
65
|
-
byteLength = MIN_BITS;
|
|
66
|
-
}
|
|
67
|
-
function getNext(array) {
|
|
68
|
-
const byte = getByte(array, position, byteLength);
|
|
69
|
-
position += byteLength;
|
|
70
|
-
return byte;
|
|
71
|
-
}
|
|
72
|
-
function addToDictionary(i, c) {
|
|
73
|
-
dictionaryChar[dictionaryLength] = c;
|
|
74
|
-
dictionaryIndex[dictionaryLength] = i;
|
|
75
|
-
dictionaryLength++;
|
|
76
|
-
return dictionaryLength - 1;
|
|
77
|
-
}
|
|
78
|
-
function getDictionaryReversed(n) {
|
|
79
|
-
const rev = [];
|
|
80
|
-
for (let i = n; i !== 4096; i = dictionaryIndex[i]) {
|
|
81
|
-
rev.push(dictionaryChar[i]);
|
|
82
|
-
}
|
|
83
|
-
return rev;
|
|
84
|
-
}
|
|
85
|
-
|
|
86
|
-
const result = [];
|
|
87
|
-
initDictionary();
|
|
88
|
-
const array = new Uint8Array(input);
|
|
89
|
-
let code = getNext(array);
|
|
90
|
-
let oldCode;
|
|
91
|
-
while (code !== EOI_CODE) {
|
|
92
|
-
if (code === CLEAR_CODE) {
|
|
93
|
-
initDictionary();
|
|
94
|
-
code = getNext(array);
|
|
95
|
-
while (code === CLEAR_CODE) {
|
|
96
|
-
code = getNext(array);
|
|
97
|
-
}
|
|
98
|
-
|
|
99
|
-
if (code === EOI_CODE) {
|
|
100
|
-
break;
|
|
101
|
-
} else if (code > CLEAR_CODE) {
|
|
102
|
-
throw new Error(`corrupted code at scanline ${code}`);
|
|
103
|
-
} else {
|
|
104
|
-
const val = getDictionaryReversed(code);
|
|
105
|
-
appendReversed(result, val);
|
|
106
|
-
oldCode = code;
|
|
107
|
-
}
|
|
108
|
-
} else if (code < dictionaryLength) {
|
|
109
|
-
const val = getDictionaryReversed(code);
|
|
110
|
-
appendReversed(result, val);
|
|
111
|
-
addToDictionary(oldCode, val[val.length - 1]);
|
|
112
|
-
oldCode = code;
|
|
113
|
-
} else {
|
|
114
|
-
const oldVal = getDictionaryReversed(oldCode);
|
|
115
|
-
if (!oldVal) {
|
|
116
|
-
throw new Error(`Bogus entry. Not in dictionary, ${oldCode} / ${dictionaryLength}, position: ${position}`);
|
|
117
|
-
}
|
|
118
|
-
appendReversed(result, oldVal);
|
|
119
|
-
result.push(oldVal[oldVal.length - 1]);
|
|
120
|
-
addToDictionary(oldCode, oldVal[oldVal.length - 1]);
|
|
121
|
-
oldCode = code;
|
|
122
|
-
}
|
|
123
|
-
|
|
124
|
-
if (dictionaryLength + 1 >= (2 ** byteLength)) {
|
|
125
|
-
if (byteLength === MAX_BYTELENGTH) {
|
|
126
|
-
oldCode = undefined;
|
|
127
|
-
} else {
|
|
128
|
-
byteLength++;
|
|
129
|
-
}
|
|
130
|
-
}
|
|
131
|
-
code = getNext(array);
|
|
132
|
-
}
|
|
133
|
-
return new Uint8Array(result);
|
|
134
|
-
}
|
|
135
|
-
|
|
136
|
-
class LZWDecoder extends _basedecoder_js__WEBPACK_IMPORTED_MODULE_0__[/* default */ "a"] {
|
|
137
|
-
decodeBlock(buffer) {
|
|
138
|
-
return decompress(buffer, false).buffer;
|
|
139
|
-
}
|
|
140
|
-
}
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
/***/ }),
|
|
144
|
-
|
|
145
|
-
/***/ "b3f7":
|
|
146
|
-
/***/ (function(module, __webpack_exports__, __webpack_require__) {
|
|
147
|
-
|
|
148
|
-
"use strict";
|
|
149
|
-
|
|
150
|
-
// EXPORTS
|
|
151
|
-
__webpack_require__.d(__webpack_exports__, "a", function() { return /* binding */ basedecoder_BaseDecoder; });
|
|
152
|
-
|
|
153
|
-
// CONCATENATED MODULE: ./node_modules/geotiff/dist-module/predictor.js
|
|
154
|
-
function decodeRowAcc(row, stride) {
|
|
155
|
-
let length = row.length - stride;
|
|
156
|
-
let offset = 0;
|
|
157
|
-
do {
|
|
158
|
-
for (let i = stride; i > 0; i--) {
|
|
159
|
-
row[offset + stride] += row[offset];
|
|
160
|
-
offset++;
|
|
161
|
-
}
|
|
162
|
-
|
|
163
|
-
length -= stride;
|
|
164
|
-
} while (length > 0);
|
|
165
|
-
}
|
|
166
|
-
|
|
167
|
-
function decodeRowFloatingPoint(row, stride, bytesPerSample) {
|
|
168
|
-
let index = 0;
|
|
169
|
-
let count = row.length;
|
|
170
|
-
const wc = count / bytesPerSample;
|
|
171
|
-
|
|
172
|
-
while (count > stride) {
|
|
173
|
-
for (let i = stride; i > 0; --i) {
|
|
174
|
-
row[index + stride] += row[index];
|
|
175
|
-
++index;
|
|
176
|
-
}
|
|
177
|
-
count -= stride;
|
|
178
|
-
}
|
|
179
|
-
|
|
180
|
-
const copy = row.slice();
|
|
181
|
-
for (let i = 0; i < wc; ++i) {
|
|
182
|
-
for (let b = 0; b < bytesPerSample; ++b) {
|
|
183
|
-
row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];
|
|
184
|
-
}
|
|
185
|
-
}
|
|
186
|
-
}
|
|
187
|
-
|
|
188
|
-
function applyPredictor(block, predictor, width, height, bitsPerSample,
|
|
189
|
-
planarConfiguration) {
|
|
190
|
-
if (!predictor || predictor === 1) {
|
|
191
|
-
return block;
|
|
192
|
-
}
|
|
193
|
-
|
|
194
|
-
for (let i = 0; i < bitsPerSample.length; ++i) {
|
|
195
|
-
if (bitsPerSample[i] % 8 !== 0) {
|
|
196
|
-
throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');
|
|
197
|
-
}
|
|
198
|
-
if (bitsPerSample[i] !== bitsPerSample[0]) {
|
|
199
|
-
throw new Error('When decoding with predictor, all samples must have the same size.');
|
|
200
|
-
}
|
|
201
|
-
}
|
|
202
|
-
|
|
203
|
-
const bytesPerSample = bitsPerSample[0] / 8;
|
|
204
|
-
const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;
|
|
205
|
-
|
|
206
|
-
for (let i = 0; i < height; ++i) {
|
|
207
|
-
// Last strip will be truncated if height % stripHeight != 0
|
|
208
|
-
if (i * stride * width * bytesPerSample >= block.byteLength) {
|
|
209
|
-
break;
|
|
210
|
-
}
|
|
211
|
-
let row;
|
|
212
|
-
if (predictor === 2) { // horizontal prediction
|
|
213
|
-
switch (bitsPerSample[0]) {
|
|
214
|
-
case 8:
|
|
215
|
-
row = new Uint8Array(
|
|
216
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,
|
|
217
|
-
);
|
|
218
|
-
break;
|
|
219
|
-
case 16:
|
|
220
|
-
row = new Uint16Array(
|
|
221
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,
|
|
222
|
-
);
|
|
223
|
-
break;
|
|
224
|
-
case 32:
|
|
225
|
-
row = new Uint32Array(
|
|
226
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,
|
|
227
|
-
);
|
|
228
|
-
break;
|
|
229
|
-
default:
|
|
230
|
-
throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);
|
|
231
|
-
}
|
|
232
|
-
decodeRowAcc(row, stride, bytesPerSample);
|
|
233
|
-
} else if (predictor === 3) { // horizontal floating point
|
|
234
|
-
row = new Uint8Array(
|
|
235
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,
|
|
236
|
-
);
|
|
237
|
-
decodeRowFloatingPoint(row, stride, bytesPerSample);
|
|
238
|
-
}
|
|
239
|
-
}
|
|
240
|
-
return block;
|
|
241
|
-
}
|
|
242
|
-
|
|
243
|
-
// CONCATENATED MODULE: ./node_modules/geotiff/dist-module/compression/basedecoder.js
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
class basedecoder_BaseDecoder {
|
|
247
|
-
async decode(fileDirectory, buffer) {
|
|
248
|
-
const decoded = await this.decodeBlock(buffer);
|
|
249
|
-
const predictor = fileDirectory.Predictor || 1;
|
|
250
|
-
if (predictor !== 1) {
|
|
251
|
-
const isTiled = !fileDirectory.StripOffsets;
|
|
252
|
-
const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;
|
|
253
|
-
const tileHeight = isTiled ? fileDirectory.TileLength : (
|
|
254
|
-
fileDirectory.RowsPerStrip || fileDirectory.ImageLength
|
|
255
|
-
);
|
|
256
|
-
return applyPredictor(
|
|
257
|
-
decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,
|
|
258
|
-
fileDirectory.PlanarConfiguration,
|
|
259
|
-
);
|
|
260
|
-
}
|
|
261
|
-
return decoded;
|
|
262
|
-
}
|
|
263
|
-
}
|
|
264
|
-
|
|
265
|
-
|
|
266
|
-
/***/ })
|
|
267
|
-
|
|
268
|
-
}]);
|
package/lib/ryui.common.4.js
DELETED
|
@@ -1,163 +0,0 @@
|
|
|
1
|
-
((typeof self !== 'undefined' ? self : this)["webpackJsonpryui"] = (typeof self !== 'undefined' ? self : this)["webpackJsonpryui"] || []).push([[4],{
|
|
2
|
-
|
|
3
|
-
/***/ "45bf":
|
|
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 PackbitsDecoder; });
|
|
9
|
-
/* harmony import */ var _basedecoder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("b3f7");
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
class PackbitsDecoder extends _basedecoder_js__WEBPACK_IMPORTED_MODULE_0__[/* default */ "a"] {
|
|
13
|
-
decodeBlock(buffer) {
|
|
14
|
-
const dataView = new DataView(buffer);
|
|
15
|
-
const out = [];
|
|
16
|
-
|
|
17
|
-
for (let i = 0; i < buffer.byteLength; ++i) {
|
|
18
|
-
let header = dataView.getInt8(i);
|
|
19
|
-
if (header < 0) {
|
|
20
|
-
const next = dataView.getUint8(i + 1);
|
|
21
|
-
header = -header;
|
|
22
|
-
for (let j = 0; j <= header; ++j) {
|
|
23
|
-
out.push(next);
|
|
24
|
-
}
|
|
25
|
-
i += 1;
|
|
26
|
-
} else {
|
|
27
|
-
for (let j = 0; j <= header; ++j) {
|
|
28
|
-
out.push(dataView.getUint8(i + j + 1));
|
|
29
|
-
}
|
|
30
|
-
i += header + 1;
|
|
31
|
-
}
|
|
32
|
-
}
|
|
33
|
-
return new Uint8Array(out).buffer;
|
|
34
|
-
}
|
|
35
|
-
}
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
/***/ }),
|
|
39
|
-
|
|
40
|
-
/***/ "b3f7":
|
|
41
|
-
/***/ (function(module, __webpack_exports__, __webpack_require__) {
|
|
42
|
-
|
|
43
|
-
"use strict";
|
|
44
|
-
|
|
45
|
-
// EXPORTS
|
|
46
|
-
__webpack_require__.d(__webpack_exports__, "a", function() { return /* binding */ basedecoder_BaseDecoder; });
|
|
47
|
-
|
|
48
|
-
// CONCATENATED MODULE: ./node_modules/geotiff/dist-module/predictor.js
|
|
49
|
-
function decodeRowAcc(row, stride) {
|
|
50
|
-
let length = row.length - stride;
|
|
51
|
-
let offset = 0;
|
|
52
|
-
do {
|
|
53
|
-
for (let i = stride; i > 0; i--) {
|
|
54
|
-
row[offset + stride] += row[offset];
|
|
55
|
-
offset++;
|
|
56
|
-
}
|
|
57
|
-
|
|
58
|
-
length -= stride;
|
|
59
|
-
} while (length > 0);
|
|
60
|
-
}
|
|
61
|
-
|
|
62
|
-
function decodeRowFloatingPoint(row, stride, bytesPerSample) {
|
|
63
|
-
let index = 0;
|
|
64
|
-
let count = row.length;
|
|
65
|
-
const wc = count / bytesPerSample;
|
|
66
|
-
|
|
67
|
-
while (count > stride) {
|
|
68
|
-
for (let i = stride; i > 0; --i) {
|
|
69
|
-
row[index + stride] += row[index];
|
|
70
|
-
++index;
|
|
71
|
-
}
|
|
72
|
-
count -= stride;
|
|
73
|
-
}
|
|
74
|
-
|
|
75
|
-
const copy = row.slice();
|
|
76
|
-
for (let i = 0; i < wc; ++i) {
|
|
77
|
-
for (let b = 0; b < bytesPerSample; ++b) {
|
|
78
|
-
row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];
|
|
79
|
-
}
|
|
80
|
-
}
|
|
81
|
-
}
|
|
82
|
-
|
|
83
|
-
function applyPredictor(block, predictor, width, height, bitsPerSample,
|
|
84
|
-
planarConfiguration) {
|
|
85
|
-
if (!predictor || predictor === 1) {
|
|
86
|
-
return block;
|
|
87
|
-
}
|
|
88
|
-
|
|
89
|
-
for (let i = 0; i < bitsPerSample.length; ++i) {
|
|
90
|
-
if (bitsPerSample[i] % 8 !== 0) {
|
|
91
|
-
throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');
|
|
92
|
-
}
|
|
93
|
-
if (bitsPerSample[i] !== bitsPerSample[0]) {
|
|
94
|
-
throw new Error('When decoding with predictor, all samples must have the same size.');
|
|
95
|
-
}
|
|
96
|
-
}
|
|
97
|
-
|
|
98
|
-
const bytesPerSample = bitsPerSample[0] / 8;
|
|
99
|
-
const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;
|
|
100
|
-
|
|
101
|
-
for (let i = 0; i < height; ++i) {
|
|
102
|
-
// Last strip will be truncated if height % stripHeight != 0
|
|
103
|
-
if (i * stride * width * bytesPerSample >= block.byteLength) {
|
|
104
|
-
break;
|
|
105
|
-
}
|
|
106
|
-
let row;
|
|
107
|
-
if (predictor === 2) { // horizontal prediction
|
|
108
|
-
switch (bitsPerSample[0]) {
|
|
109
|
-
case 8:
|
|
110
|
-
row = new Uint8Array(
|
|
111
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,
|
|
112
|
-
);
|
|
113
|
-
break;
|
|
114
|
-
case 16:
|
|
115
|
-
row = new Uint16Array(
|
|
116
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,
|
|
117
|
-
);
|
|
118
|
-
break;
|
|
119
|
-
case 32:
|
|
120
|
-
row = new Uint32Array(
|
|
121
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,
|
|
122
|
-
);
|
|
123
|
-
break;
|
|
124
|
-
default:
|
|
125
|
-
throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);
|
|
126
|
-
}
|
|
127
|
-
decodeRowAcc(row, stride, bytesPerSample);
|
|
128
|
-
} else if (predictor === 3) { // horizontal floating point
|
|
129
|
-
row = new Uint8Array(
|
|
130
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,
|
|
131
|
-
);
|
|
132
|
-
decodeRowFloatingPoint(row, stride, bytesPerSample);
|
|
133
|
-
}
|
|
134
|
-
}
|
|
135
|
-
return block;
|
|
136
|
-
}
|
|
137
|
-
|
|
138
|
-
// CONCATENATED MODULE: ./node_modules/geotiff/dist-module/compression/basedecoder.js
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
class basedecoder_BaseDecoder {
|
|
142
|
-
async decode(fileDirectory, buffer) {
|
|
143
|
-
const decoded = await this.decodeBlock(buffer);
|
|
144
|
-
const predictor = fileDirectory.Predictor || 1;
|
|
145
|
-
if (predictor !== 1) {
|
|
146
|
-
const isTiled = !fileDirectory.StripOffsets;
|
|
147
|
-
const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;
|
|
148
|
-
const tileHeight = isTiled ? fileDirectory.TileLength : (
|
|
149
|
-
fileDirectory.RowsPerStrip || fileDirectory.ImageLength
|
|
150
|
-
);
|
|
151
|
-
return applyPredictor(
|
|
152
|
-
decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,
|
|
153
|
-
fileDirectory.PlanarConfiguration,
|
|
154
|
-
);
|
|
155
|
-
}
|
|
156
|
-
return decoded;
|
|
157
|
-
}
|
|
158
|
-
}
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
/***/ })
|
|
162
|
-
|
|
163
|
-
}]);
|
package/lib/ryui.common.5.js
DELETED
|
@@ -1,144 +0,0 @@
|
|
|
1
|
-
((typeof self !== 'undefined' ? self : this)["webpackJsonpryui"] = (typeof self !== 'undefined' ? self : this)["webpackJsonpryui"] || []).push([[5],{
|
|
2
|
-
|
|
3
|
-
/***/ "9a7b":
|
|
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 RawDecoder; });
|
|
9
|
-
/* harmony import */ var _basedecoder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("b3f7");
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
class RawDecoder extends _basedecoder_js__WEBPACK_IMPORTED_MODULE_0__[/* default */ "a"] {
|
|
13
|
-
decodeBlock(buffer) {
|
|
14
|
-
return buffer;
|
|
15
|
-
}
|
|
16
|
-
}
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
/***/ }),
|
|
20
|
-
|
|
21
|
-
/***/ "b3f7":
|
|
22
|
-
/***/ (function(module, __webpack_exports__, __webpack_require__) {
|
|
23
|
-
|
|
24
|
-
"use strict";
|
|
25
|
-
|
|
26
|
-
// EXPORTS
|
|
27
|
-
__webpack_require__.d(__webpack_exports__, "a", function() { return /* binding */ basedecoder_BaseDecoder; });
|
|
28
|
-
|
|
29
|
-
// CONCATENATED MODULE: ./node_modules/geotiff/dist-module/predictor.js
|
|
30
|
-
function decodeRowAcc(row, stride) {
|
|
31
|
-
let length = row.length - stride;
|
|
32
|
-
let offset = 0;
|
|
33
|
-
do {
|
|
34
|
-
for (let i = stride; i > 0; i--) {
|
|
35
|
-
row[offset + stride] += row[offset];
|
|
36
|
-
offset++;
|
|
37
|
-
}
|
|
38
|
-
|
|
39
|
-
length -= stride;
|
|
40
|
-
} while (length > 0);
|
|
41
|
-
}
|
|
42
|
-
|
|
43
|
-
function decodeRowFloatingPoint(row, stride, bytesPerSample) {
|
|
44
|
-
let index = 0;
|
|
45
|
-
let count = row.length;
|
|
46
|
-
const wc = count / bytesPerSample;
|
|
47
|
-
|
|
48
|
-
while (count > stride) {
|
|
49
|
-
for (let i = stride; i > 0; --i) {
|
|
50
|
-
row[index + stride] += row[index];
|
|
51
|
-
++index;
|
|
52
|
-
}
|
|
53
|
-
count -= stride;
|
|
54
|
-
}
|
|
55
|
-
|
|
56
|
-
const copy = row.slice();
|
|
57
|
-
for (let i = 0; i < wc; ++i) {
|
|
58
|
-
for (let b = 0; b < bytesPerSample; ++b) {
|
|
59
|
-
row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];
|
|
60
|
-
}
|
|
61
|
-
}
|
|
62
|
-
}
|
|
63
|
-
|
|
64
|
-
function applyPredictor(block, predictor, width, height, bitsPerSample,
|
|
65
|
-
planarConfiguration) {
|
|
66
|
-
if (!predictor || predictor === 1) {
|
|
67
|
-
return block;
|
|
68
|
-
}
|
|
69
|
-
|
|
70
|
-
for (let i = 0; i < bitsPerSample.length; ++i) {
|
|
71
|
-
if (bitsPerSample[i] % 8 !== 0) {
|
|
72
|
-
throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');
|
|
73
|
-
}
|
|
74
|
-
if (bitsPerSample[i] !== bitsPerSample[0]) {
|
|
75
|
-
throw new Error('When decoding with predictor, all samples must have the same size.');
|
|
76
|
-
}
|
|
77
|
-
}
|
|
78
|
-
|
|
79
|
-
const bytesPerSample = bitsPerSample[0] / 8;
|
|
80
|
-
const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;
|
|
81
|
-
|
|
82
|
-
for (let i = 0; i < height; ++i) {
|
|
83
|
-
// Last strip will be truncated if height % stripHeight != 0
|
|
84
|
-
if (i * stride * width * bytesPerSample >= block.byteLength) {
|
|
85
|
-
break;
|
|
86
|
-
}
|
|
87
|
-
let row;
|
|
88
|
-
if (predictor === 2) { // horizontal prediction
|
|
89
|
-
switch (bitsPerSample[0]) {
|
|
90
|
-
case 8:
|
|
91
|
-
row = new Uint8Array(
|
|
92
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,
|
|
93
|
-
);
|
|
94
|
-
break;
|
|
95
|
-
case 16:
|
|
96
|
-
row = new Uint16Array(
|
|
97
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,
|
|
98
|
-
);
|
|
99
|
-
break;
|
|
100
|
-
case 32:
|
|
101
|
-
row = new Uint32Array(
|
|
102
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,
|
|
103
|
-
);
|
|
104
|
-
break;
|
|
105
|
-
default:
|
|
106
|
-
throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);
|
|
107
|
-
}
|
|
108
|
-
decodeRowAcc(row, stride, bytesPerSample);
|
|
109
|
-
} else if (predictor === 3) { // horizontal floating point
|
|
110
|
-
row = new Uint8Array(
|
|
111
|
-
block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,
|
|
112
|
-
);
|
|
113
|
-
decodeRowFloatingPoint(row, stride, bytesPerSample);
|
|
114
|
-
}
|
|
115
|
-
}
|
|
116
|
-
return block;
|
|
117
|
-
}
|
|
118
|
-
|
|
119
|
-
// CONCATENATED MODULE: ./node_modules/geotiff/dist-module/compression/basedecoder.js
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
class basedecoder_BaseDecoder {
|
|
123
|
-
async decode(fileDirectory, buffer) {
|
|
124
|
-
const decoded = await this.decodeBlock(buffer);
|
|
125
|
-
const predictor = fileDirectory.Predictor || 1;
|
|
126
|
-
if (predictor !== 1) {
|
|
127
|
-
const isTiled = !fileDirectory.StripOffsets;
|
|
128
|
-
const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;
|
|
129
|
-
const tileHeight = isTiled ? fileDirectory.TileLength : (
|
|
130
|
-
fileDirectory.RowsPerStrip || fileDirectory.ImageLength
|
|
131
|
-
);
|
|
132
|
-
return applyPredictor(
|
|
133
|
-
decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,
|
|
134
|
-
fileDirectory.PlanarConfiguration,
|
|
135
|
-
);
|
|
136
|
-
}
|
|
137
|
-
return decoded;
|
|
138
|
-
}
|
|
139
|
-
}
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
/***/ })
|
|
143
|
-
|
|
144
|
-
}]);
|