blue-chestnut-solar-expert 0.0.52 → 0.0.54

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 (223) hide show
  1. package/dist/stencil-library/api-90JQS7b6.js +104 -0
  2. package/dist/stencil-library/api-90JQS7b6.js.map +1 -0
  3. package/dist/stencil-library/api-B5514wut.js +102 -0
  4. package/dist/stencil-library/api-B5514wut.js.map +1 -0
  5. package/dist/stencil-library/api-CLbMaqt3.js +103 -0
  6. package/dist/stencil-library/api-CLbMaqt3.js.map +1 -0
  7. package/dist/stencil-library/api-Cfi-C6kT.js +104 -0
  8. package/dist/stencil-library/api-Cfi-C6kT.js.map +1 -0
  9. package/dist/stencil-library/api-CiNFC5mG.js +104 -0
  10. package/dist/stencil-library/api-CiNFC5mG.js.map +1 -0
  11. package/dist/stencil-library/api-D_61gY2X.js +102 -0
  12. package/dist/stencil-library/api-D_61gY2X.js.map +1 -0
  13. package/dist/{components/p-CU_Hozfq.js → stencil-library/api-Did5lAE0.js} +4 -7
  14. package/dist/stencil-library/api-Did5lAE0.js.map +1 -0
  15. package/dist/stencil-library/api-S3oJcLL5.js +103 -0
  16. package/dist/stencil-library/api-S3oJcLL5.js.map +1 -0
  17. package/dist/stencil-library/api-iAs1ZQr1.js +104 -0
  18. package/dist/stencil-library/api-iAs1ZQr1.js.map +1 -0
  19. package/dist/stencil-library/{api-CU_Hozfq.js → api-vropRvpT.js} +5 -4
  20. package/dist/stencil-library/api-vropRvpT.js.map +1 -0
  21. package/dist/stencil-library/{decoder-BdybtJ-v.js → decoder-BDfrXE7e.js} +3 -3
  22. package/dist/stencil-library/{decoder-BdybtJ-v.js.map → decoder-BDfrXE7e.js.map} +1 -1
  23. package/dist/stencil-library/{deflate-BSCfm6tE.js → deflate-BrCNE9ec.js} +3 -3
  24. package/dist/stencil-library/{deflate-BSCfm6tE.js.map → deflate-BrCNE9ec.js.map} +1 -1
  25. package/dist/stencil-library/eraser-icon.entry.esm.js.map +1 -1
  26. package/dist/stencil-library/eraser-icon.entry.js +1 -1
  27. package/dist/stencil-library/eraser-icon.entry.js.map +1 -1
  28. package/dist/stencil-library/house-icon.entry.esm.js.map +1 -1
  29. package/dist/stencil-library/house-icon.entry.js +1 -1
  30. package/dist/stencil-library/house-icon.entry.js.map +1 -1
  31. package/dist/stencil-library/icon-selector.entry.esm.js.map +1 -1
  32. package/dist/stencil-library/icon-selector.entry.js +1 -1
  33. package/dist/stencil-library/icon-selector.entry.js.map +1 -1
  34. package/dist/stencil-library/index.esm.js +13 -1
  35. package/dist/stencil-library/index.esm.js.map +1 -1
  36. package/dist/stencil-library/{jpeg-B7s0bMQh.js → jpeg-CjOJHUd1.js} +3 -3
  37. package/dist/stencil-library/{jpeg-B7s0bMQh.js.map → jpeg-CjOJHUd1.js.map} +1 -1
  38. package/dist/stencil-library/{lerc-BRJzMsmm.js → lerc-BQF80JgE.js} +3 -3
  39. package/dist/stencil-library/{lerc-BRJzMsmm.js.map → lerc-BQF80JgE.js.map} +1 -1
  40. package/dist/stencil-library/loading-widget.entry.esm.js.map +1 -1
  41. package/dist/stencil-library/loading-widget.entry.js +2 -2
  42. package/dist/stencil-library/loading-widget.entry.js.map +1 -1
  43. package/dist/stencil-library/{lzw-B1L94-gJ.js → lzw-PA2aOuVK.js} +3 -3
  44. package/dist/stencil-library/{lzw-B1L94-gJ.js.map → lzw-PA2aOuVK.js.map} +1 -1
  45. package/dist/stencil-library/{map-draw-Dbj9dYlX.js → map-draw-CaQc1QTP.js} +11 -11
  46. package/dist/stencil-library/{map-draw-Dbj9dYlX.js.map → map-draw-CaQc1QTP.js.map} +1 -1
  47. package/dist/stencil-library/map-draw.entry.js +1 -1
  48. package/dist/stencil-library/map-selector.entry.esm.js.map +1 -1
  49. package/dist/stencil-library/map-selector.entry.js +19 -3
  50. package/dist/stencil-library/map-selector.entry.js.map +1 -1
  51. package/dist/stencil-library/move-icon.entry.esm.js.map +1 -1
  52. package/dist/stencil-library/move-icon.entry.js +1 -1
  53. package/dist/stencil-library/move-icon.entry.js.map +1 -1
  54. package/dist/stencil-library/octagon-minus-icon.entry.esm.js.map +1 -1
  55. package/dist/stencil-library/octagon-minus-icon.entry.js +1 -1
  56. package/dist/stencil-library/octagon-minus-icon.entry.js.map +1 -1
  57. package/dist/stencil-library/{packbits-Roq2Ecwq.js → packbits-BMYGgS0z.js} +3 -3
  58. package/dist/stencil-library/{packbits-Roq2Ecwq.js.map → packbits-BMYGgS0z.js.map} +1 -1
  59. package/dist/stencil-library/polygon-buttons.entry.esm.js.map +1 -1
  60. package/dist/stencil-library/polygon-buttons.entry.js +3 -3
  61. package/dist/stencil-library/polygon-buttons.entry.js.map +1 -1
  62. package/dist/stencil-library/polygon-information.entry.esm.js.map +1 -1
  63. package/dist/stencil-library/polygon-information.entry.js +2 -2
  64. package/dist/stencil-library/polygon-information.entry.js.map +1 -1
  65. package/dist/stencil-library/{raw-BSypeTBq.js → raw-D-Vfg78n.js} +3 -3
  66. package/dist/stencil-library/{raw-BSypeTBq.js.map → raw-D-Vfg78n.js.map} +1 -1
  67. package/dist/stencil-library/search-icon.entry.esm.js.map +1 -1
  68. package/dist/stencil-library/search-icon.entry.js +1 -1
  69. package/dist/stencil-library/search-icon.entry.js.map +1 -1
  70. package/dist/stencil-library/settings-icon.entry.esm.js.map +1 -1
  71. package/dist/stencil-library/settings-icon.entry.js +1 -1
  72. package/dist/stencil-library/settings-icon.entry.js.map +1 -1
  73. package/dist/stencil-library/settings-modal.entry.esm.js.map +1 -1
  74. package/dist/stencil-library/settings-modal.entry.js +9 -9
  75. package/dist/stencil-library/settings-modal.entry.js.map +1 -1
  76. package/dist/stencil-library/solar-calculator.entry.esm.js.map +1 -1
  77. package/dist/stencil-library/solar-calculator.entry.js +3 -3
  78. package/dist/stencil-library/solar-calculator.entry.js.map +1 -1
  79. package/dist/stencil-library/solar-expert.entry.esm.js.map +1 -1
  80. package/dist/stencil-library/solar-expert.entry.js +3 -3
  81. package/dist/stencil-library/solar-expert.entry.js.map +1 -1
  82. package/dist/stencil-library/solar-system-form.entry.esm.js.map +1 -1
  83. package/dist/stencil-library/solar-system-form.entry.js +39 -39
  84. package/dist/stencil-library/solar-system-form.entry.js.map +1 -1
  85. package/dist/stencil-library/stencil-library.esm.js +52 -1
  86. package/dist/stencil-library/stencil-library.esm.js.map +1 -1
  87. package/dist/stencil-library/tool-box.entry.esm.js.map +1 -1
  88. package/dist/stencil-library/tool-box.entry.js +3 -3
  89. package/dist/stencil-library/tool-box.entry.js.map +1 -1
  90. package/dist/stencil-library/undo-icon.entry.esm.js.map +1 -1
  91. package/dist/stencil-library/undo-icon.entry.js +1 -1
  92. package/dist/stencil-library/undo-icon.entry.js.map +1 -1
  93. package/dist/stencil-library/{webimage-BZX1CuW8.js → webimage-V5ihYILu.js} +3 -3
  94. package/dist/stencil-library/{webimage-BZX1CuW8.js.map → webimage-V5ihYILu.js.map} +1 -1
  95. package/dist/types/components/map-draw/map-selector.d.ts +1 -0
  96. package/package.json +1 -1
  97. package/dist/components/eraser-icon.js +0 -11
  98. package/dist/components/eraser-icon.js.map +0 -1
  99. package/dist/components/house-icon.js +0 -11
  100. package/dist/components/house-icon.js.map +0 -1
  101. package/dist/components/icon-selector.js +0 -11
  102. package/dist/components/icon-selector.js.map +0 -1
  103. package/dist/components/index.js +0 -1269
  104. package/dist/components/index.js.map +0 -1
  105. package/dist/components/loading-widget.js +0 -38
  106. package/dist/components/loading-widget.js.map +0 -1
  107. package/dist/components/map-draw.js +0 -11
  108. package/dist/components/map-draw.js.map +0 -1
  109. package/dist/components/map-selector.js +0 -11
  110. package/dist/components/map-selector.js.map +0 -1
  111. package/dist/components/move-icon.js +0 -11
  112. package/dist/components/move-icon.js.map +0 -1
  113. package/dist/components/octagon-minus-icon.js +0 -11
  114. package/dist/components/octagon-minus-icon.js.map +0 -1
  115. package/dist/components/p-0Ymx0I1T.js +0 -76
  116. package/dist/components/p-0Ymx0I1T.js.map +0 -1
  117. package/dist/components/p-B-Rps0Lf.js +0 -40
  118. package/dist/components/p-B-Rps0Lf.js.map +0 -1
  119. package/dist/components/p-B54Ul0nf.js +0 -15
  120. package/dist/components/p-B54Ul0nf.js.map +0 -1
  121. package/dist/components/p-B5WTRCh8.js +0 -3241
  122. package/dist/components/p-B5WTRCh8.js.map +0 -1
  123. package/dist/components/p-BGoSj_DR.js +0 -902
  124. package/dist/components/p-BGoSj_DR.js.map +0 -1
  125. package/dist/components/p-BYoCVGKQ.js +0 -105
  126. package/dist/components/p-BYoCVGKQ.js.map +0 -1
  127. package/dist/components/p-BhS0AFyx.js +0 -161
  128. package/dist/components/p-BhS0AFyx.js.map +0 -1
  129. package/dist/components/p-BxeHuNQ0.js +0 -653
  130. package/dist/components/p-BxeHuNQ0.js.map +0 -1
  131. package/dist/components/p-ByX6QP-E.js +0 -33
  132. package/dist/components/p-ByX6QP-E.js.map +0 -1
  133. package/dist/components/p-C61RS5xJ.js +0 -40
  134. package/dist/components/p-C61RS5xJ.js.map +0 -1
  135. package/dist/components/p-CLe0s2gK.js +0 -40
  136. package/dist/components/p-CLe0s2gK.js.map +0 -1
  137. package/dist/components/p-CQxP2hZl.js +0 -414
  138. package/dist/components/p-CQxP2hZl.js.map +0 -1
  139. package/dist/components/p-CU_Hozfq.js.map +0 -1
  140. package/dist/components/p-Cfy4oCWb.js +0 -1909
  141. package/dist/components/p-Cfy4oCWb.js.map +0 -1
  142. package/dist/components/p-Cgchl6bA.js +0 -47
  143. package/dist/components/p-Cgchl6bA.js.map +0 -1
  144. package/dist/components/p-Cqkh0K8d.js +0 -50
  145. package/dist/components/p-Cqkh0K8d.js.map +0 -1
  146. package/dist/components/p-D0KrIPIK.js +0 -40
  147. package/dist/components/p-D0KrIPIK.js.map +0 -1
  148. package/dist/components/p-DSHWNE3m.js +0 -102
  149. package/dist/components/p-DSHWNE3m.js.map +0 -1
  150. package/dist/components/p-DZAFvfH1.js +0 -40
  151. package/dist/components/p-DZAFvfH1.js.map +0 -1
  152. package/dist/components/p-DiLO6lb_.js +0 -15822
  153. package/dist/components/p-DiLO6lb_.js.map +0 -1
  154. package/dist/components/p-DwozqyC_.js +0 -40
  155. package/dist/components/p-DwozqyC_.js.map +0 -1
  156. package/dist/components/p-Mv9J4znK.js +0 -40
  157. package/dist/components/p-Mv9J4znK.js.map +0 -1
  158. package/dist/components/p-Sf357vTW.js +0 -188
  159. package/dist/components/p-Sf357vTW.js.map +0 -1
  160. package/dist/components/p-WmcSqXD8.js +0 -14
  161. package/dist/components/p-WmcSqXD8.js.map +0 -1
  162. package/dist/components/p-XKzdTp2a.js +0 -4423
  163. package/dist/components/p-XKzdTp2a.js.map +0 -1
  164. package/dist/components/p-j-vOrhhh.js +0 -114
  165. package/dist/components/p-j-vOrhhh.js.map +0 -1
  166. package/dist/components/p-q8auDIJ2.js +0 -138
  167. package/dist/components/p-q8auDIJ2.js.map +0 -1
  168. package/dist/components/polygon-buttons.js +0 -11
  169. package/dist/components/polygon-buttons.js.map +0 -1
  170. package/dist/components/polygon-information.js +0 -11
  171. package/dist/components/polygon-information.js.map +0 -1
  172. package/dist/components/search-icon.js +0 -11
  173. package/dist/components/search-icon.js.map +0 -1
  174. package/dist/components/settings-icon.js +0 -11
  175. package/dist/components/settings-icon.js.map +0 -1
  176. package/dist/components/settings-modal.js +0 -11
  177. package/dist/components/settings-modal.js.map +0 -1
  178. package/dist/components/solar-calculator.js +0 -246
  179. package/dist/components/solar-calculator.js.map +0 -1
  180. package/dist/components/solar-expert.js +0 -360
  181. package/dist/components/solar-expert.js.map +0 -1
  182. package/dist/components/solar-system-form.js +0 -11
  183. package/dist/components/solar-system-form.js.map +0 -1
  184. package/dist/components/tool-box.js +0 -11
  185. package/dist/components/tool-box.js.map +0 -1
  186. package/dist/components/undo-icon.js +0 -11
  187. package/dist/components/undo-icon.js.map +0 -1
  188. package/dist/index.cjs.js +0 -1
  189. package/dist/index.js +0 -1
  190. package/dist/stencil-library/api-CU_Hozfq.js.map +0 -1
  191. package/dist/stencil-library/eraser-icon.house-icon.icon-selector.map-draw.map-selector.move-icon.octagon-minus-icon.polygon-buttons.polygon-information.search-icon.settings-icon.settings-modal.solar-expert.solar-system-form.tool-box.undo-icon.entry.esm.js.map +0 -1
  192. package/dist/stencil-library/p-6f2848a5.entry.js +0 -2
  193. package/dist/stencil-library/p-6f2848a5.entry.js.map +0 -1
  194. package/dist/stencil-library/p-B54Ul0nf.js +0 -2
  195. package/dist/stencil-library/p-B54Ul0nf.js.map +0 -1
  196. package/dist/stencil-library/p-B5WTRCh8.js +0 -2
  197. package/dist/stencil-library/p-B5WTRCh8.js.map +0 -1
  198. package/dist/stencil-library/p-BGoSj_DR.js +0 -2
  199. package/dist/stencil-library/p-BGoSj_DR.js.map +0 -1
  200. package/dist/stencil-library/p-Brw-XSJB.js +0 -2
  201. package/dist/stencil-library/p-Brw-XSJB.js.map +0 -1
  202. package/dist/stencil-library/p-ByX6QP-E.js +0 -2
  203. package/dist/stencil-library/p-ByX6QP-E.js.map +0 -1
  204. package/dist/stencil-library/p-CX8V3eiN.js +0 -2
  205. package/dist/stencil-library/p-CX8V3eiN.js.map +0 -1
  206. package/dist/stencil-library/p-Cgchl6bA.js +0 -2
  207. package/dist/stencil-library/p-Cgchl6bA.js.map +0 -1
  208. package/dist/stencil-library/p-DXlWibwG.js +0 -10
  209. package/dist/stencil-library/p-DXlWibwG.js.map +0 -1
  210. package/dist/stencil-library/p-LebgAmeq.js +0 -2
  211. package/dist/stencil-library/p-LebgAmeq.js.map +0 -1
  212. package/dist/stencil-library/p-WmcSqXD8.js +0 -2
  213. package/dist/stencil-library/p-WmcSqXD8.js.map +0 -1
  214. package/dist/stencil-library/p-X54eOLJv.js +0 -3
  215. package/dist/stencil-library/p-X54eOLJv.js.map +0 -1
  216. package/dist/stencil-library/p-af021538.entry.js +0 -2
  217. package/dist/stencil-library/p-af021538.entry.js.map +0 -1
  218. package/dist/stencil-library/p-bde0ce8e.entry.js +0 -32
  219. package/dist/stencil-library/p-bde0ce8e.entry.js.map +0 -1
  220. package/dist/stencil-library/p-j-vOrhhh.js +0 -2
  221. package/dist/stencil-library/p-j-vOrhhh.js.map +0 -1
  222. package/dist/stencil-library/p-q8auDIJ2.js +0 -2
  223. package/dist/stencil-library/p-q8auDIJ2.js.map +0 -1
@@ -1,4423 +0,0 @@
1
-
2
- if (typeof global === "undefined") { var global = globalThis || window || self; }
3
- import { i as inflate_1 } from './p-B5WTRCh8.js';
4
- import { g as global, L as LercParameters, a as LercAddCompression } from './p-DiLO6lb_.js';
5
- import { B as BaseDecoder } from './p-j-vOrhhh.js';
6
-
7
- var lookup = [];
8
- var revLookup = [];
9
- var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;
10
- var inited = false;
11
- function init$1 () {
12
- inited = true;
13
- var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
14
- for (var i = 0, len = code.length; i < len; ++i) {
15
- lookup[i] = code[i];
16
- revLookup[code.charCodeAt(i)] = i;
17
- }
18
-
19
- revLookup['-'.charCodeAt(0)] = 62;
20
- revLookup['_'.charCodeAt(0)] = 63;
21
- }
22
-
23
- function toByteArray (b64) {
24
- if (!inited) {
25
- init$1();
26
- }
27
- var i, j, l, tmp, placeHolders, arr;
28
- var len = b64.length;
29
-
30
- if (len % 4 > 0) {
31
- throw new Error('Invalid string. Length must be a multiple of 4')
32
- }
33
-
34
- // the number of equal signs (place holders)
35
- // if there are two placeholders, than the two characters before it
36
- // represent one byte
37
- // if there is only one, then the three characters before it represent 2 bytes
38
- // this is just a cheap hack to not do indexOf twice
39
- placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0;
40
-
41
- // base64 is 4/3 + up to two characters of the original data
42
- arr = new Arr(len * 3 / 4 - placeHolders);
43
-
44
- // if there are placeholders, only get up to the last complete 4 chars
45
- l = placeHolders > 0 ? len - 4 : len;
46
-
47
- var L = 0;
48
-
49
- for (i = 0, j = 0; i < l; i += 4, j += 3) {
50
- tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)];
51
- arr[L++] = (tmp >> 16) & 0xFF;
52
- arr[L++] = (tmp >> 8) & 0xFF;
53
- arr[L++] = tmp & 0xFF;
54
- }
55
-
56
- if (placeHolders === 2) {
57
- tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4);
58
- arr[L++] = tmp & 0xFF;
59
- } else if (placeHolders === 1) {
60
- tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2);
61
- arr[L++] = (tmp >> 8) & 0xFF;
62
- arr[L++] = tmp & 0xFF;
63
- }
64
-
65
- return arr
66
- }
67
-
68
- function tripletToBase64 (num) {
69
- return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F]
70
- }
71
-
72
- function encodeChunk (uint8, start, end) {
73
- var tmp;
74
- var output = [];
75
- for (var i = start; i < end; i += 3) {
76
- tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]);
77
- output.push(tripletToBase64(tmp));
78
- }
79
- return output.join('')
80
- }
81
-
82
- function fromByteArray (uint8) {
83
- if (!inited) {
84
- init$1();
85
- }
86
- var tmp;
87
- var len = uint8.length;
88
- var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes
89
- var output = '';
90
- var parts = [];
91
- var maxChunkLength = 16383; // must be multiple of 3
92
-
93
- // go through the array every three bytes, we'll deal with trailing stuff later
94
- for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
95
- parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)));
96
- }
97
-
98
- // pad the end with zeros, but make sure to not forget the extra bytes
99
- if (extraBytes === 1) {
100
- tmp = uint8[len - 1];
101
- output += lookup[tmp >> 2];
102
- output += lookup[(tmp << 4) & 0x3F];
103
- output += '==';
104
- } else if (extraBytes === 2) {
105
- tmp = (uint8[len - 2] << 8) + (uint8[len - 1]);
106
- output += lookup[tmp >> 10];
107
- output += lookup[(tmp >> 4) & 0x3F];
108
- output += lookup[(tmp << 2) & 0x3F];
109
- output += '=';
110
- }
111
-
112
- parts.push(output);
113
-
114
- return parts.join('')
115
- }
116
-
117
- function read (buffer, offset, isLE, mLen, nBytes) {
118
- var e, m;
119
- var eLen = nBytes * 8 - mLen - 1;
120
- var eMax = (1 << eLen) - 1;
121
- var eBias = eMax >> 1;
122
- var nBits = -7;
123
- var i = isLE ? (nBytes - 1) : 0;
124
- var d = isLE ? -1 : 1;
125
- var s = buffer[offset + i];
126
-
127
- i += d;
128
-
129
- e = s & ((1 << (-nBits)) - 1);
130
- s >>= (-nBits);
131
- nBits += eLen;
132
- for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {}
133
-
134
- m = e & ((1 << (-nBits)) - 1);
135
- e >>= (-nBits);
136
- nBits += mLen;
137
- for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {}
138
-
139
- if (e === 0) {
140
- e = 1 - eBias;
141
- } else if (e === eMax) {
142
- return m ? NaN : ((s ? -1 : 1) * Infinity)
143
- } else {
144
- m = m + Math.pow(2, mLen);
145
- e = e - eBias;
146
- }
147
- return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
148
- }
149
-
150
- function write (buffer, value, offset, isLE, mLen, nBytes) {
151
- var e, m, c;
152
- var eLen = nBytes * 8 - mLen - 1;
153
- var eMax = (1 << eLen) - 1;
154
- var eBias = eMax >> 1;
155
- var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0);
156
- var i = isLE ? 0 : (nBytes - 1);
157
- var d = isLE ? 1 : -1;
158
- var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
159
-
160
- value = Math.abs(value);
161
-
162
- if (isNaN(value) || value === Infinity) {
163
- m = isNaN(value) ? 1 : 0;
164
- e = eMax;
165
- } else {
166
- e = Math.floor(Math.log(value) / Math.LN2);
167
- if (value * (c = Math.pow(2, -e)) < 1) {
168
- e--;
169
- c *= 2;
170
- }
171
- if (e + eBias >= 1) {
172
- value += rt / c;
173
- } else {
174
- value += rt * Math.pow(2, 1 - eBias);
175
- }
176
- if (value * c >= 2) {
177
- e++;
178
- c /= 2;
179
- }
180
-
181
- if (e + eBias >= eMax) {
182
- m = 0;
183
- e = eMax;
184
- } else if (e + eBias >= 1) {
185
- m = (value * c - 1) * Math.pow(2, mLen);
186
- e = e + eBias;
187
- } else {
188
- m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
189
- e = 0;
190
- }
191
- }
192
-
193
- for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
194
-
195
- e = (e << mLen) | m;
196
- eLen += mLen;
197
- for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
198
-
199
- buffer[offset + i - d] |= s * 128;
200
- }
201
-
202
- var toString = {}.toString;
203
-
204
- var isArray = Array.isArray || function (arr) {
205
- return toString.call(arr) == '[object Array]';
206
- };
207
-
208
- /*!
209
- * The buffer module from node.js, for the browser.
210
- *
211
- * @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
212
- * @license MIT
213
- */
214
-
215
- var INSPECT_MAX_BYTES = 50;
216
-
217
- /**
218
- * If `Buffer.TYPED_ARRAY_SUPPORT`:
219
- * === true Use Uint8Array implementation (fastest)
220
- * === false Use Object implementation (most compatible, even IE6)
221
- *
222
- * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
223
- * Opera 11.6+, iOS 4.2+.
224
- *
225
- * Due to various browser bugs, sometimes the Object implementation will be used even
226
- * when the browser supports typed arrays.
227
- *
228
- * Note:
229
- *
230
- * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,
231
- * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.
232
- *
233
- * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.
234
- *
235
- * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of
236
- * incorrect length in some situations.
237
-
238
- * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they
239
- * get the Object implementation, which is slower but behaves correctly.
240
- */
241
- Buffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined
242
- ? global.TYPED_ARRAY_SUPPORT
243
- : true;
244
-
245
- function kMaxLength () {
246
- return Buffer.TYPED_ARRAY_SUPPORT
247
- ? 0x7fffffff
248
- : 0x3fffffff
249
- }
250
-
251
- function createBuffer (that, length) {
252
- if (kMaxLength() < length) {
253
- throw new RangeError('Invalid typed array length')
254
- }
255
- if (Buffer.TYPED_ARRAY_SUPPORT) {
256
- // Return an augmented `Uint8Array` instance, for best performance
257
- that = new Uint8Array(length);
258
- that.__proto__ = Buffer.prototype;
259
- } else {
260
- // Fallback: Return an object instance of the Buffer class
261
- if (that === null) {
262
- that = new Buffer(length);
263
- }
264
- that.length = length;
265
- }
266
-
267
- return that
268
- }
269
-
270
- /**
271
- * The Buffer constructor returns instances of `Uint8Array` that have their
272
- * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
273
- * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
274
- * and the `Uint8Array` methods. Square bracket notation works as expected -- it
275
- * returns a single octet.
276
- *
277
- * The `Uint8Array` prototype remains unmodified.
278
- */
279
-
280
- function Buffer (arg, encodingOrOffset, length) {
281
- if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {
282
- return new Buffer(arg, encodingOrOffset, length)
283
- }
284
-
285
- // Common case.
286
- if (typeof arg === 'number') {
287
- if (typeof encodingOrOffset === 'string') {
288
- throw new Error(
289
- 'If encoding is specified then the first argument must be a string'
290
- )
291
- }
292
- return allocUnsafe(this, arg)
293
- }
294
- return from(this, arg, encodingOrOffset, length)
295
- }
296
-
297
- Buffer.poolSize = 8192; // not used by this implementation
298
-
299
- // TODO: Legacy, not needed anymore. Remove in next major version.
300
- Buffer._augment = function (arr) {
301
- arr.__proto__ = Buffer.prototype;
302
- return arr
303
- };
304
-
305
- function from (that, value, encodingOrOffset, length) {
306
- if (typeof value === 'number') {
307
- throw new TypeError('"value" argument must not be a number')
308
- }
309
-
310
- if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {
311
- return fromArrayBuffer(that, value, encodingOrOffset, length)
312
- }
313
-
314
- if (typeof value === 'string') {
315
- return fromString(that, value, encodingOrOffset)
316
- }
317
-
318
- return fromObject(that, value)
319
- }
320
-
321
- /**
322
- * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
323
- * if value is a number.
324
- * Buffer.from(str[, encoding])
325
- * Buffer.from(array)
326
- * Buffer.from(buffer)
327
- * Buffer.from(arrayBuffer[, byteOffset[, length]])
328
- **/
329
- Buffer.from = function (value, encodingOrOffset, length) {
330
- return from(null, value, encodingOrOffset, length)
331
- };
332
-
333
- if (Buffer.TYPED_ARRAY_SUPPORT) {
334
- Buffer.prototype.__proto__ = Uint8Array.prototype;
335
- Buffer.__proto__ = Uint8Array;
336
- }
337
-
338
- function assertSize (size) {
339
- if (typeof size !== 'number') {
340
- throw new TypeError('"size" argument must be a number')
341
- } else if (size < 0) {
342
- throw new RangeError('"size" argument must not be negative')
343
- }
344
- }
345
-
346
- function alloc (that, size, fill, encoding) {
347
- assertSize(size);
348
- if (size <= 0) {
349
- return createBuffer(that, size)
350
- }
351
- if (fill !== undefined) {
352
- // Only pay attention to encoding if it's a string. This
353
- // prevents accidentally sending in a number that would
354
- // be interpretted as a start offset.
355
- return typeof encoding === 'string'
356
- ? createBuffer(that, size).fill(fill, encoding)
357
- : createBuffer(that, size).fill(fill)
358
- }
359
- return createBuffer(that, size)
360
- }
361
-
362
- /**
363
- * Creates a new filled Buffer instance.
364
- * alloc(size[, fill[, encoding]])
365
- **/
366
- Buffer.alloc = function (size, fill, encoding) {
367
- return alloc(null, size, fill, encoding)
368
- };
369
-
370
- function allocUnsafe (that, size) {
371
- assertSize(size);
372
- that = createBuffer(that, size < 0 ? 0 : checked(size) | 0);
373
- if (!Buffer.TYPED_ARRAY_SUPPORT) {
374
- for (var i = 0; i < size; ++i) {
375
- that[i] = 0;
376
- }
377
- }
378
- return that
379
- }
380
-
381
- /**
382
- * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
383
- * */
384
- Buffer.allocUnsafe = function (size) {
385
- return allocUnsafe(null, size)
386
- };
387
- /**
388
- * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
389
- */
390
- Buffer.allocUnsafeSlow = function (size) {
391
- return allocUnsafe(null, size)
392
- };
393
-
394
- function fromString (that, string, encoding) {
395
- if (typeof encoding !== 'string' || encoding === '') {
396
- encoding = 'utf8';
397
- }
398
-
399
- if (!Buffer.isEncoding(encoding)) {
400
- throw new TypeError('"encoding" must be a valid string encoding')
401
- }
402
-
403
- var length = byteLength(string, encoding) | 0;
404
- that = createBuffer(that, length);
405
-
406
- var actual = that.write(string, encoding);
407
-
408
- if (actual !== length) {
409
- // Writing a hex string, for example, that contains invalid characters will
410
- // cause everything after the first invalid character to be ignored. (e.g.
411
- // 'abxxcd' will be treated as 'ab')
412
- that = that.slice(0, actual);
413
- }
414
-
415
- return that
416
- }
417
-
418
- function fromArrayLike (that, array) {
419
- var length = array.length < 0 ? 0 : checked(array.length) | 0;
420
- that = createBuffer(that, length);
421
- for (var i = 0; i < length; i += 1) {
422
- that[i] = array[i] & 255;
423
- }
424
- return that
425
- }
426
-
427
- function fromArrayBuffer (that, array, byteOffset, length) {
428
-
429
- if (byteOffset < 0 || array.byteLength < byteOffset) {
430
- throw new RangeError('\'offset\' is out of bounds')
431
- }
432
-
433
- if (array.byteLength < byteOffset + (length || 0)) {
434
- throw new RangeError('\'length\' is out of bounds')
435
- }
436
-
437
- if (byteOffset === undefined && length === undefined) {
438
- array = new Uint8Array(array);
439
- } else if (length === undefined) {
440
- array = new Uint8Array(array, byteOffset);
441
- } else {
442
- array = new Uint8Array(array, byteOffset, length);
443
- }
444
-
445
- if (Buffer.TYPED_ARRAY_SUPPORT) {
446
- // Return an augmented `Uint8Array` instance, for best performance
447
- that = array;
448
- that.__proto__ = Buffer.prototype;
449
- } else {
450
- // Fallback: Return an object instance of the Buffer class
451
- that = fromArrayLike(that, array);
452
- }
453
- return that
454
- }
455
-
456
- function fromObject (that, obj) {
457
- if (internalIsBuffer(obj)) {
458
- var len = checked(obj.length) | 0;
459
- that = createBuffer(that, len);
460
-
461
- if (that.length === 0) {
462
- return that
463
- }
464
-
465
- obj.copy(that, 0, 0, len);
466
- return that
467
- }
468
-
469
- if (obj) {
470
- if ((typeof ArrayBuffer !== 'undefined' &&
471
- obj.buffer instanceof ArrayBuffer) || 'length' in obj) {
472
- if (typeof obj.length !== 'number' || isnan(obj.length)) {
473
- return createBuffer(that, 0)
474
- }
475
- return fromArrayLike(that, obj)
476
- }
477
-
478
- if (obj.type === 'Buffer' && isArray(obj.data)) {
479
- return fromArrayLike(that, obj.data)
480
- }
481
- }
482
-
483
- throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')
484
- }
485
-
486
- function checked (length) {
487
- // Note: cannot use `length < kMaxLength()` here because that fails when
488
- // length is NaN (which is otherwise coerced to zero.)
489
- if (length >= kMaxLength()) {
490
- throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
491
- 'size: 0x' + kMaxLength().toString(16) + ' bytes')
492
- }
493
- return length | 0
494
- }
495
- Buffer.isBuffer = isBuffer;
496
- function internalIsBuffer (b) {
497
- return !!(b != null && b._isBuffer)
498
- }
499
-
500
- Buffer.compare = function compare (a, b) {
501
- if (!internalIsBuffer(a) || !internalIsBuffer(b)) {
502
- throw new TypeError('Arguments must be Buffers')
503
- }
504
-
505
- if (a === b) return 0
506
-
507
- var x = a.length;
508
- var y = b.length;
509
-
510
- for (var i = 0, len = Math.min(x, y); i < len; ++i) {
511
- if (a[i] !== b[i]) {
512
- x = a[i];
513
- y = b[i];
514
- break
515
- }
516
- }
517
-
518
- if (x < y) return -1
519
- if (y < x) return 1
520
- return 0
521
- };
522
-
523
- Buffer.isEncoding = function isEncoding (encoding) {
524
- switch (String(encoding).toLowerCase()) {
525
- case 'hex':
526
- case 'utf8':
527
- case 'utf-8':
528
- case 'ascii':
529
- case 'latin1':
530
- case 'binary':
531
- case 'base64':
532
- case 'ucs2':
533
- case 'ucs-2':
534
- case 'utf16le':
535
- case 'utf-16le':
536
- return true
537
- default:
538
- return false
539
- }
540
- };
541
-
542
- Buffer.concat = function concat (list, length) {
543
- if (!isArray(list)) {
544
- throw new TypeError('"list" argument must be an Array of Buffers')
545
- }
546
-
547
- if (list.length === 0) {
548
- return Buffer.alloc(0)
549
- }
550
-
551
- var i;
552
- if (length === undefined) {
553
- length = 0;
554
- for (i = 0; i < list.length; ++i) {
555
- length += list[i].length;
556
- }
557
- }
558
-
559
- var buffer = Buffer.allocUnsafe(length);
560
- var pos = 0;
561
- for (i = 0; i < list.length; ++i) {
562
- var buf = list[i];
563
- if (!internalIsBuffer(buf)) {
564
- throw new TypeError('"list" argument must be an Array of Buffers')
565
- }
566
- buf.copy(buffer, pos);
567
- pos += buf.length;
568
- }
569
- return buffer
570
- };
571
-
572
- function byteLength (string, encoding) {
573
- if (internalIsBuffer(string)) {
574
- return string.length
575
- }
576
- if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&
577
- (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {
578
- return string.byteLength
579
- }
580
- if (typeof string !== 'string') {
581
- string = '' + string;
582
- }
583
-
584
- var len = string.length;
585
- if (len === 0) return 0
586
-
587
- // Use a for loop to avoid recursion
588
- var loweredCase = false;
589
- for (;;) {
590
- switch (encoding) {
591
- case 'ascii':
592
- case 'latin1':
593
- case 'binary':
594
- return len
595
- case 'utf8':
596
- case 'utf-8':
597
- case undefined:
598
- return utf8ToBytes(string).length
599
- case 'ucs2':
600
- case 'ucs-2':
601
- case 'utf16le':
602
- case 'utf-16le':
603
- return len * 2
604
- case 'hex':
605
- return len >>> 1
606
- case 'base64':
607
- return base64ToBytes(string).length
608
- default:
609
- if (loweredCase) return utf8ToBytes(string).length // assume utf8
610
- encoding = ('' + encoding).toLowerCase();
611
- loweredCase = true;
612
- }
613
- }
614
- }
615
- Buffer.byteLength = byteLength;
616
-
617
- function slowToString (encoding, start, end) {
618
- var loweredCase = false;
619
-
620
- // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
621
- // property of a typed array.
622
-
623
- // This behaves neither like String nor Uint8Array in that we set start/end
624
- // to their upper/lower bounds if the value passed is out of range.
625
- // undefined is handled specially as per ECMA-262 6th Edition,
626
- // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
627
- if (start === undefined || start < 0) {
628
- start = 0;
629
- }
630
- // Return early if start > this.length. Done here to prevent potential uint32
631
- // coercion fail below.
632
- if (start > this.length) {
633
- return ''
634
- }
635
-
636
- if (end === undefined || end > this.length) {
637
- end = this.length;
638
- }
639
-
640
- if (end <= 0) {
641
- return ''
642
- }
643
-
644
- // Force coersion to uint32. This will also coerce falsey/NaN values to 0.
645
- end >>>= 0;
646
- start >>>= 0;
647
-
648
- if (end <= start) {
649
- return ''
650
- }
651
-
652
- if (!encoding) encoding = 'utf8';
653
-
654
- while (true) {
655
- switch (encoding) {
656
- case 'hex':
657
- return hexSlice(this, start, end)
658
-
659
- case 'utf8':
660
- case 'utf-8':
661
- return utf8Slice(this, start, end)
662
-
663
- case 'ascii':
664
- return asciiSlice(this, start, end)
665
-
666
- case 'latin1':
667
- case 'binary':
668
- return latin1Slice(this, start, end)
669
-
670
- case 'base64':
671
- return base64Slice(this, start, end)
672
-
673
- case 'ucs2':
674
- case 'ucs-2':
675
- case 'utf16le':
676
- case 'utf-16le':
677
- return utf16leSlice(this, start, end)
678
-
679
- default:
680
- if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
681
- encoding = (encoding + '').toLowerCase();
682
- loweredCase = true;
683
- }
684
- }
685
- }
686
-
687
- // The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect
688
- // Buffer instances.
689
- Buffer.prototype._isBuffer = true;
690
-
691
- function swap (b, n, m) {
692
- var i = b[n];
693
- b[n] = b[m];
694
- b[m] = i;
695
- }
696
-
697
- Buffer.prototype.swap16 = function swap16 () {
698
- var len = this.length;
699
- if (len % 2 !== 0) {
700
- throw new RangeError('Buffer size must be a multiple of 16-bits')
701
- }
702
- for (var i = 0; i < len; i += 2) {
703
- swap(this, i, i + 1);
704
- }
705
- return this
706
- };
707
-
708
- Buffer.prototype.swap32 = function swap32 () {
709
- var len = this.length;
710
- if (len % 4 !== 0) {
711
- throw new RangeError('Buffer size must be a multiple of 32-bits')
712
- }
713
- for (var i = 0; i < len; i += 4) {
714
- swap(this, i, i + 3);
715
- swap(this, i + 1, i + 2);
716
- }
717
- return this
718
- };
719
-
720
- Buffer.prototype.swap64 = function swap64 () {
721
- var len = this.length;
722
- if (len % 8 !== 0) {
723
- throw new RangeError('Buffer size must be a multiple of 64-bits')
724
- }
725
- for (var i = 0; i < len; i += 8) {
726
- swap(this, i, i + 7);
727
- swap(this, i + 1, i + 6);
728
- swap(this, i + 2, i + 5);
729
- swap(this, i + 3, i + 4);
730
- }
731
- return this
732
- };
733
-
734
- Buffer.prototype.toString = function toString () {
735
- var length = this.length | 0;
736
- if (length === 0) return ''
737
- if (arguments.length === 0) return utf8Slice(this, 0, length)
738
- return slowToString.apply(this, arguments)
739
- };
740
-
741
- Buffer.prototype.equals = function equals (b) {
742
- if (!internalIsBuffer(b)) throw new TypeError('Argument must be a Buffer')
743
- if (this === b) return true
744
- return Buffer.compare(this, b) === 0
745
- };
746
-
747
- Buffer.prototype.inspect = function inspect () {
748
- var str = '';
749
- var max = INSPECT_MAX_BYTES;
750
- if (this.length > 0) {
751
- str = this.toString('hex', 0, max).match(/.{2}/g).join(' ');
752
- if (this.length > max) str += ' ... ';
753
- }
754
- return '<Buffer ' + str + '>'
755
- };
756
-
757
- Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {
758
- if (!internalIsBuffer(target)) {
759
- throw new TypeError('Argument must be a Buffer')
760
- }
761
-
762
- if (start === undefined) {
763
- start = 0;
764
- }
765
- if (end === undefined) {
766
- end = target ? target.length : 0;
767
- }
768
- if (thisStart === undefined) {
769
- thisStart = 0;
770
- }
771
- if (thisEnd === undefined) {
772
- thisEnd = this.length;
773
- }
774
-
775
- if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {
776
- throw new RangeError('out of range index')
777
- }
778
-
779
- if (thisStart >= thisEnd && start >= end) {
780
- return 0
781
- }
782
- if (thisStart >= thisEnd) {
783
- return -1
784
- }
785
- if (start >= end) {
786
- return 1
787
- }
788
-
789
- start >>>= 0;
790
- end >>>= 0;
791
- thisStart >>>= 0;
792
- thisEnd >>>= 0;
793
-
794
- if (this === target) return 0
795
-
796
- var x = thisEnd - thisStart;
797
- var y = end - start;
798
- var len = Math.min(x, y);
799
-
800
- var thisCopy = this.slice(thisStart, thisEnd);
801
- var targetCopy = target.slice(start, end);
802
-
803
- for (var i = 0; i < len; ++i) {
804
- if (thisCopy[i] !== targetCopy[i]) {
805
- x = thisCopy[i];
806
- y = targetCopy[i];
807
- break
808
- }
809
- }
810
-
811
- if (x < y) return -1
812
- if (y < x) return 1
813
- return 0
814
- };
815
-
816
- // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,
817
- // OR the last index of `val` in `buffer` at offset <= `byteOffset`.
818
- //
819
- // Arguments:
820
- // - buffer - a Buffer to search
821
- // - val - a string, Buffer, or number
822
- // - byteOffset - an index into `buffer`; will be clamped to an int32
823
- // - encoding - an optional encoding, relevant is val is a string
824
- // - dir - true for indexOf, false for lastIndexOf
825
- function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {
826
- // Empty buffer means no match
827
- if (buffer.length === 0) return -1
828
-
829
- // Normalize byteOffset
830
- if (typeof byteOffset === 'string') {
831
- encoding = byteOffset;
832
- byteOffset = 0;
833
- } else if (byteOffset > 0x7fffffff) {
834
- byteOffset = 0x7fffffff;
835
- } else if (byteOffset < -2147483648) {
836
- byteOffset = -2147483648;
837
- }
838
- byteOffset = +byteOffset; // Coerce to Number.
839
- if (isNaN(byteOffset)) {
840
- // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer
841
- byteOffset = dir ? 0 : (buffer.length - 1);
842
- }
843
-
844
- // Normalize byteOffset: negative offsets start from the end of the buffer
845
- if (byteOffset < 0) byteOffset = buffer.length + byteOffset;
846
- if (byteOffset >= buffer.length) {
847
- if (dir) return -1
848
- else byteOffset = buffer.length - 1;
849
- } else if (byteOffset < 0) {
850
- if (dir) byteOffset = 0;
851
- else return -1
852
- }
853
-
854
- // Normalize val
855
- if (typeof val === 'string') {
856
- val = Buffer.from(val, encoding);
857
- }
858
-
859
- // Finally, search either indexOf (if dir is true) or lastIndexOf
860
- if (internalIsBuffer(val)) {
861
- // Special case: looking for empty string/buffer always fails
862
- if (val.length === 0) {
863
- return -1
864
- }
865
- return arrayIndexOf(buffer, val, byteOffset, encoding, dir)
866
- } else if (typeof val === 'number') {
867
- val = val & 0xFF; // Search for a byte value [0-255]
868
- if (Buffer.TYPED_ARRAY_SUPPORT &&
869
- typeof Uint8Array.prototype.indexOf === 'function') {
870
- if (dir) {
871
- return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)
872
- } else {
873
- return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)
874
- }
875
- }
876
- return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)
877
- }
878
-
879
- throw new TypeError('val must be string, number or Buffer')
880
- }
881
-
882
- function arrayIndexOf (arr, val, byteOffset, encoding, dir) {
883
- var indexSize = 1;
884
- var arrLength = arr.length;
885
- var valLength = val.length;
886
-
887
- if (encoding !== undefined) {
888
- encoding = String(encoding).toLowerCase();
889
- if (encoding === 'ucs2' || encoding === 'ucs-2' ||
890
- encoding === 'utf16le' || encoding === 'utf-16le') {
891
- if (arr.length < 2 || val.length < 2) {
892
- return -1
893
- }
894
- indexSize = 2;
895
- arrLength /= 2;
896
- valLength /= 2;
897
- byteOffset /= 2;
898
- }
899
- }
900
-
901
- function read (buf, i) {
902
- if (indexSize === 1) {
903
- return buf[i]
904
- } else {
905
- return buf.readUInt16BE(i * indexSize)
906
- }
907
- }
908
-
909
- var i;
910
- if (dir) {
911
- var foundIndex = -1;
912
- for (i = byteOffset; i < arrLength; i++) {
913
- if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
914
- if (foundIndex === -1) foundIndex = i;
915
- if (i - foundIndex + 1 === valLength) return foundIndex * indexSize
916
- } else {
917
- if (foundIndex !== -1) i -= i - foundIndex;
918
- foundIndex = -1;
919
- }
920
- }
921
- } else {
922
- if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;
923
- for (i = byteOffset; i >= 0; i--) {
924
- var found = true;
925
- for (var j = 0; j < valLength; j++) {
926
- if (read(arr, i + j) !== read(val, j)) {
927
- found = false;
928
- break
929
- }
930
- }
931
- if (found) return i
932
- }
933
- }
934
-
935
- return -1
936
- }
937
-
938
- Buffer.prototype.includes = function includes (val, byteOffset, encoding) {
939
- return this.indexOf(val, byteOffset, encoding) !== -1
940
- };
941
-
942
- Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {
943
- return bidirectionalIndexOf(this, val, byteOffset, encoding, true)
944
- };
945
-
946
- Buffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {
947
- return bidirectionalIndexOf(this, val, byteOffset, encoding, false)
948
- };
949
-
950
- function hexWrite (buf, string, offset, length) {
951
- offset = Number(offset) || 0;
952
- var remaining = buf.length - offset;
953
- if (!length) {
954
- length = remaining;
955
- } else {
956
- length = Number(length);
957
- if (length > remaining) {
958
- length = remaining;
959
- }
960
- }
961
-
962
- // must be an even number of digits
963
- var strLen = string.length;
964
- if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')
965
-
966
- if (length > strLen / 2) {
967
- length = strLen / 2;
968
- }
969
- for (var i = 0; i < length; ++i) {
970
- var parsed = parseInt(string.substr(i * 2, 2), 16);
971
- if (isNaN(parsed)) return i
972
- buf[offset + i] = parsed;
973
- }
974
- return i
975
- }
976
-
977
- function utf8Write (buf, string, offset, length) {
978
- return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
979
- }
980
-
981
- function asciiWrite (buf, string, offset, length) {
982
- return blitBuffer(asciiToBytes(string), buf, offset, length)
983
- }
984
-
985
- function latin1Write (buf, string, offset, length) {
986
- return asciiWrite(buf, string, offset, length)
987
- }
988
-
989
- function base64Write (buf, string, offset, length) {
990
- return blitBuffer(base64ToBytes(string), buf, offset, length)
991
- }
992
-
993
- function ucs2Write (buf, string, offset, length) {
994
- return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)
995
- }
996
-
997
- Buffer.prototype.write = function write (string, offset, length, encoding) {
998
- // Buffer#write(string)
999
- if (offset === undefined) {
1000
- encoding = 'utf8';
1001
- length = this.length;
1002
- offset = 0;
1003
- // Buffer#write(string, encoding)
1004
- } else if (length === undefined && typeof offset === 'string') {
1005
- encoding = offset;
1006
- length = this.length;
1007
- offset = 0;
1008
- // Buffer#write(string, offset[, length][, encoding])
1009
- } else if (isFinite(offset)) {
1010
- offset = offset | 0;
1011
- if (isFinite(length)) {
1012
- length = length | 0;
1013
- if (encoding === undefined) encoding = 'utf8';
1014
- } else {
1015
- encoding = length;
1016
- length = undefined;
1017
- }
1018
- // legacy write(string, encoding, offset, length) - remove in v0.13
1019
- } else {
1020
- throw new Error(
1021
- 'Buffer.write(string, encoding, offset[, length]) is no longer supported'
1022
- )
1023
- }
1024
-
1025
- var remaining = this.length - offset;
1026
- if (length === undefined || length > remaining) length = remaining;
1027
-
1028
- if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {
1029
- throw new RangeError('Attempt to write outside buffer bounds')
1030
- }
1031
-
1032
- if (!encoding) encoding = 'utf8';
1033
-
1034
- var loweredCase = false;
1035
- for (;;) {
1036
- switch (encoding) {
1037
- case 'hex':
1038
- return hexWrite(this, string, offset, length)
1039
-
1040
- case 'utf8':
1041
- case 'utf-8':
1042
- return utf8Write(this, string, offset, length)
1043
-
1044
- case 'ascii':
1045
- return asciiWrite(this, string, offset, length)
1046
-
1047
- case 'latin1':
1048
- case 'binary':
1049
- return latin1Write(this, string, offset, length)
1050
-
1051
- case 'base64':
1052
- // Warning: maxLength not taken into account in base64Write
1053
- return base64Write(this, string, offset, length)
1054
-
1055
- case 'ucs2':
1056
- case 'ucs-2':
1057
- case 'utf16le':
1058
- case 'utf-16le':
1059
- return ucs2Write(this, string, offset, length)
1060
-
1061
- default:
1062
- if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
1063
- encoding = ('' + encoding).toLowerCase();
1064
- loweredCase = true;
1065
- }
1066
- }
1067
- };
1068
-
1069
- Buffer.prototype.toJSON = function toJSON () {
1070
- return {
1071
- type: 'Buffer',
1072
- data: Array.prototype.slice.call(this._arr || this, 0)
1073
- }
1074
- };
1075
-
1076
- function base64Slice (buf, start, end) {
1077
- if (start === 0 && end === buf.length) {
1078
- return fromByteArray(buf)
1079
- } else {
1080
- return fromByteArray(buf.slice(start, end))
1081
- }
1082
- }
1083
-
1084
- function utf8Slice (buf, start, end) {
1085
- end = Math.min(buf.length, end);
1086
- var res = [];
1087
-
1088
- var i = start;
1089
- while (i < end) {
1090
- var firstByte = buf[i];
1091
- var codePoint = null;
1092
- var bytesPerSequence = (firstByte > 0xEF) ? 4
1093
- : (firstByte > 0xDF) ? 3
1094
- : (firstByte > 0xBF) ? 2
1095
- : 1;
1096
-
1097
- if (i + bytesPerSequence <= end) {
1098
- var secondByte, thirdByte, fourthByte, tempCodePoint;
1099
-
1100
- switch (bytesPerSequence) {
1101
- case 1:
1102
- if (firstByte < 0x80) {
1103
- codePoint = firstByte;
1104
- }
1105
- break
1106
- case 2:
1107
- secondByte = buf[i + 1];
1108
- if ((secondByte & 0xC0) === 0x80) {
1109
- tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F);
1110
- if (tempCodePoint > 0x7F) {
1111
- codePoint = tempCodePoint;
1112
- }
1113
- }
1114
- break
1115
- case 3:
1116
- secondByte = buf[i + 1];
1117
- thirdByte = buf[i + 2];
1118
- if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {
1119
- tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F);
1120
- if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
1121
- codePoint = tempCodePoint;
1122
- }
1123
- }
1124
- break
1125
- case 4:
1126
- secondByte = buf[i + 1];
1127
- thirdByte = buf[i + 2];
1128
- fourthByte = buf[i + 3];
1129
- if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {
1130
- tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F);
1131
- if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
1132
- codePoint = tempCodePoint;
1133
- }
1134
- }
1135
- }
1136
- }
1137
-
1138
- if (codePoint === null) {
1139
- // we did not generate a valid codePoint so insert a
1140
- // replacement char (U+FFFD) and advance only 1 byte
1141
- codePoint = 0xFFFD;
1142
- bytesPerSequence = 1;
1143
- } else if (codePoint > 0xFFFF) {
1144
- // encode to utf16 (surrogate pair dance)
1145
- codePoint -= 0x10000;
1146
- res.push(codePoint >>> 10 & 0x3FF | 0xD800);
1147
- codePoint = 0xDC00 | codePoint & 0x3FF;
1148
- }
1149
-
1150
- res.push(codePoint);
1151
- i += bytesPerSequence;
1152
- }
1153
-
1154
- return decodeCodePointsArray(res)
1155
- }
1156
-
1157
- // Based on http://stackoverflow.com/a/22747272/680742, the browser with
1158
- // the lowest limit is Chrome, with 0x10000 args.
1159
- // We go 1 magnitude less, for safety
1160
- var MAX_ARGUMENTS_LENGTH = 0x1000;
1161
-
1162
- function decodeCodePointsArray (codePoints) {
1163
- var len = codePoints.length;
1164
- if (len <= MAX_ARGUMENTS_LENGTH) {
1165
- return String.fromCharCode.apply(String, codePoints) // avoid extra slice()
1166
- }
1167
-
1168
- // Decode in chunks to avoid "call stack size exceeded".
1169
- var res = '';
1170
- var i = 0;
1171
- while (i < len) {
1172
- res += String.fromCharCode.apply(
1173
- String,
1174
- codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)
1175
- );
1176
- }
1177
- return res
1178
- }
1179
-
1180
- function asciiSlice (buf, start, end) {
1181
- var ret = '';
1182
- end = Math.min(buf.length, end);
1183
-
1184
- for (var i = start; i < end; ++i) {
1185
- ret += String.fromCharCode(buf[i] & 0x7F);
1186
- }
1187
- return ret
1188
- }
1189
-
1190
- function latin1Slice (buf, start, end) {
1191
- var ret = '';
1192
- end = Math.min(buf.length, end);
1193
-
1194
- for (var i = start; i < end; ++i) {
1195
- ret += String.fromCharCode(buf[i]);
1196
- }
1197
- return ret
1198
- }
1199
-
1200
- function hexSlice (buf, start, end) {
1201
- var len = buf.length;
1202
-
1203
- if (!start || start < 0) start = 0;
1204
- if (!end || end < 0 || end > len) end = len;
1205
-
1206
- var out = '';
1207
- for (var i = start; i < end; ++i) {
1208
- out += toHex(buf[i]);
1209
- }
1210
- return out
1211
- }
1212
-
1213
- function utf16leSlice (buf, start, end) {
1214
- var bytes = buf.slice(start, end);
1215
- var res = '';
1216
- for (var i = 0; i < bytes.length; i += 2) {
1217
- res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);
1218
- }
1219
- return res
1220
- }
1221
-
1222
- Buffer.prototype.slice = function slice (start, end) {
1223
- var len = this.length;
1224
- start = ~~start;
1225
- end = end === undefined ? len : ~~end;
1226
-
1227
- if (start < 0) {
1228
- start += len;
1229
- if (start < 0) start = 0;
1230
- } else if (start > len) {
1231
- start = len;
1232
- }
1233
-
1234
- if (end < 0) {
1235
- end += len;
1236
- if (end < 0) end = 0;
1237
- } else if (end > len) {
1238
- end = len;
1239
- }
1240
-
1241
- if (end < start) end = start;
1242
-
1243
- var newBuf;
1244
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1245
- newBuf = this.subarray(start, end);
1246
- newBuf.__proto__ = Buffer.prototype;
1247
- } else {
1248
- var sliceLen = end - start;
1249
- newBuf = new Buffer(sliceLen, undefined);
1250
- for (var i = 0; i < sliceLen; ++i) {
1251
- newBuf[i] = this[i + start];
1252
- }
1253
- }
1254
-
1255
- return newBuf
1256
- };
1257
-
1258
- /*
1259
- * Need to make sure that buffer isn't trying to write out of bounds.
1260
- */
1261
- function checkOffset (offset, ext, length) {
1262
- if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')
1263
- if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')
1264
- }
1265
-
1266
- Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {
1267
- offset = offset | 0;
1268
- byteLength = byteLength | 0;
1269
- if (!noAssert) checkOffset(offset, byteLength, this.length);
1270
-
1271
- var val = this[offset];
1272
- var mul = 1;
1273
- var i = 0;
1274
- while (++i < byteLength && (mul *= 0x100)) {
1275
- val += this[offset + i] * mul;
1276
- }
1277
-
1278
- return val
1279
- };
1280
-
1281
- Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {
1282
- offset = offset | 0;
1283
- byteLength = byteLength | 0;
1284
- if (!noAssert) {
1285
- checkOffset(offset, byteLength, this.length);
1286
- }
1287
-
1288
- var val = this[offset + --byteLength];
1289
- var mul = 1;
1290
- while (byteLength > 0 && (mul *= 0x100)) {
1291
- val += this[offset + --byteLength] * mul;
1292
- }
1293
-
1294
- return val
1295
- };
1296
-
1297
- Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {
1298
- if (!noAssert) checkOffset(offset, 1, this.length);
1299
- return this[offset]
1300
- };
1301
-
1302
- Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
1303
- if (!noAssert) checkOffset(offset, 2, this.length);
1304
- return this[offset] | (this[offset + 1] << 8)
1305
- };
1306
-
1307
- Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
1308
- if (!noAssert) checkOffset(offset, 2, this.length);
1309
- return (this[offset] << 8) | this[offset + 1]
1310
- };
1311
-
1312
- Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
1313
- if (!noAssert) checkOffset(offset, 4, this.length);
1314
-
1315
- return ((this[offset]) |
1316
- (this[offset + 1] << 8) |
1317
- (this[offset + 2] << 16)) +
1318
- (this[offset + 3] * 0x1000000)
1319
- };
1320
-
1321
- Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {
1322
- if (!noAssert) checkOffset(offset, 4, this.length);
1323
-
1324
- return (this[offset] * 0x1000000) +
1325
- ((this[offset + 1] << 16) |
1326
- (this[offset + 2] << 8) |
1327
- this[offset + 3])
1328
- };
1329
-
1330
- Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {
1331
- offset = offset | 0;
1332
- byteLength = byteLength | 0;
1333
- if (!noAssert) checkOffset(offset, byteLength, this.length);
1334
-
1335
- var val = this[offset];
1336
- var mul = 1;
1337
- var i = 0;
1338
- while (++i < byteLength && (mul *= 0x100)) {
1339
- val += this[offset + i] * mul;
1340
- }
1341
- mul *= 0x80;
1342
-
1343
- if (val >= mul) val -= Math.pow(2, 8 * byteLength);
1344
-
1345
- return val
1346
- };
1347
-
1348
- Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {
1349
- offset = offset | 0;
1350
- byteLength = byteLength | 0;
1351
- if (!noAssert) checkOffset(offset, byteLength, this.length);
1352
-
1353
- var i = byteLength;
1354
- var mul = 1;
1355
- var val = this[offset + --i];
1356
- while (i > 0 && (mul *= 0x100)) {
1357
- val += this[offset + --i] * mul;
1358
- }
1359
- mul *= 0x80;
1360
-
1361
- if (val >= mul) val -= Math.pow(2, 8 * byteLength);
1362
-
1363
- return val
1364
- };
1365
-
1366
- Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) {
1367
- if (!noAssert) checkOffset(offset, 1, this.length);
1368
- if (!(this[offset] & 0x80)) return (this[offset])
1369
- return ((0xff - this[offset] + 1) * -1)
1370
- };
1371
-
1372
- Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {
1373
- if (!noAssert) checkOffset(offset, 2, this.length);
1374
- var val = this[offset] | (this[offset + 1] << 8);
1375
- return (val & 0x8000) ? val | 0xFFFF0000 : val
1376
- };
1377
-
1378
- Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {
1379
- if (!noAssert) checkOffset(offset, 2, this.length);
1380
- var val = this[offset + 1] | (this[offset] << 8);
1381
- return (val & 0x8000) ? val | 0xFFFF0000 : val
1382
- };
1383
-
1384
- Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
1385
- if (!noAssert) checkOffset(offset, 4, this.length);
1386
-
1387
- return (this[offset]) |
1388
- (this[offset + 1] << 8) |
1389
- (this[offset + 2] << 16) |
1390
- (this[offset + 3] << 24)
1391
- };
1392
-
1393
- Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {
1394
- if (!noAssert) checkOffset(offset, 4, this.length);
1395
-
1396
- return (this[offset] << 24) |
1397
- (this[offset + 1] << 16) |
1398
- (this[offset + 2] << 8) |
1399
- (this[offset + 3])
1400
- };
1401
-
1402
- Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
1403
- if (!noAssert) checkOffset(offset, 4, this.length);
1404
- return read(this, offset, true, 23, 4)
1405
- };
1406
-
1407
- Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
1408
- if (!noAssert) checkOffset(offset, 4, this.length);
1409
- return read(this, offset, false, 23, 4)
1410
- };
1411
-
1412
- Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
1413
- if (!noAssert) checkOffset(offset, 8, this.length);
1414
- return read(this, offset, true, 52, 8)
1415
- };
1416
-
1417
- Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
1418
- if (!noAssert) checkOffset(offset, 8, this.length);
1419
- return read(this, offset, false, 52, 8)
1420
- };
1421
-
1422
- function checkInt (buf, value, offset, ext, max, min) {
1423
- if (!internalIsBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance')
1424
- if (value > max || value < min) throw new RangeError('"value" argument is out of bounds')
1425
- if (offset + ext > buf.length) throw new RangeError('Index out of range')
1426
- }
1427
-
1428
- Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {
1429
- value = +value;
1430
- offset = offset | 0;
1431
- byteLength = byteLength | 0;
1432
- if (!noAssert) {
1433
- var maxBytes = Math.pow(2, 8 * byteLength) - 1;
1434
- checkInt(this, value, offset, byteLength, maxBytes, 0);
1435
- }
1436
-
1437
- var mul = 1;
1438
- var i = 0;
1439
- this[offset] = value & 0xFF;
1440
- while (++i < byteLength && (mul *= 0x100)) {
1441
- this[offset + i] = (value / mul) & 0xFF;
1442
- }
1443
-
1444
- return offset + byteLength
1445
- };
1446
-
1447
- Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {
1448
- value = +value;
1449
- offset = offset | 0;
1450
- byteLength = byteLength | 0;
1451
- if (!noAssert) {
1452
- var maxBytes = Math.pow(2, 8 * byteLength) - 1;
1453
- checkInt(this, value, offset, byteLength, maxBytes, 0);
1454
- }
1455
-
1456
- var i = byteLength - 1;
1457
- var mul = 1;
1458
- this[offset + i] = value & 0xFF;
1459
- while (--i >= 0 && (mul *= 0x100)) {
1460
- this[offset + i] = (value / mul) & 0xFF;
1461
- }
1462
-
1463
- return offset + byteLength
1464
- };
1465
-
1466
- Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {
1467
- value = +value;
1468
- offset = offset | 0;
1469
- if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);
1470
- if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);
1471
- this[offset] = (value & 0xff);
1472
- return offset + 1
1473
- };
1474
-
1475
- function objectWriteUInt16 (buf, value, offset, littleEndian) {
1476
- if (value < 0) value = 0xffff + value + 1;
1477
- for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {
1478
- buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
1479
- (littleEndian ? i : 1 - i) * 8;
1480
- }
1481
- }
1482
-
1483
- Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
1484
- value = +value;
1485
- offset = offset | 0;
1486
- if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);
1487
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1488
- this[offset] = (value & 0xff);
1489
- this[offset + 1] = (value >>> 8);
1490
- } else {
1491
- objectWriteUInt16(this, value, offset, true);
1492
- }
1493
- return offset + 2
1494
- };
1495
-
1496
- Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
1497
- value = +value;
1498
- offset = offset | 0;
1499
- if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);
1500
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1501
- this[offset] = (value >>> 8);
1502
- this[offset + 1] = (value & 0xff);
1503
- } else {
1504
- objectWriteUInt16(this, value, offset, false);
1505
- }
1506
- return offset + 2
1507
- };
1508
-
1509
- function objectWriteUInt32 (buf, value, offset, littleEndian) {
1510
- if (value < 0) value = 0xffffffff + value + 1;
1511
- for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {
1512
- buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff;
1513
- }
1514
- }
1515
-
1516
- Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
1517
- value = +value;
1518
- offset = offset | 0;
1519
- if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);
1520
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1521
- this[offset + 3] = (value >>> 24);
1522
- this[offset + 2] = (value >>> 16);
1523
- this[offset + 1] = (value >>> 8);
1524
- this[offset] = (value & 0xff);
1525
- } else {
1526
- objectWriteUInt32(this, value, offset, true);
1527
- }
1528
- return offset + 4
1529
- };
1530
-
1531
- Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {
1532
- value = +value;
1533
- offset = offset | 0;
1534
- if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);
1535
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1536
- this[offset] = (value >>> 24);
1537
- this[offset + 1] = (value >>> 16);
1538
- this[offset + 2] = (value >>> 8);
1539
- this[offset + 3] = (value & 0xff);
1540
- } else {
1541
- objectWriteUInt32(this, value, offset, false);
1542
- }
1543
- return offset + 4
1544
- };
1545
-
1546
- Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {
1547
- value = +value;
1548
- offset = offset | 0;
1549
- if (!noAssert) {
1550
- var limit = Math.pow(2, 8 * byteLength - 1);
1551
-
1552
- checkInt(this, value, offset, byteLength, limit - 1, -limit);
1553
- }
1554
-
1555
- var i = 0;
1556
- var mul = 1;
1557
- var sub = 0;
1558
- this[offset] = value & 0xFF;
1559
- while (++i < byteLength && (mul *= 0x100)) {
1560
- if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
1561
- sub = 1;
1562
- }
1563
- this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;
1564
- }
1565
-
1566
- return offset + byteLength
1567
- };
1568
-
1569
- Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {
1570
- value = +value;
1571
- offset = offset | 0;
1572
- if (!noAssert) {
1573
- var limit = Math.pow(2, 8 * byteLength - 1);
1574
-
1575
- checkInt(this, value, offset, byteLength, limit - 1, -limit);
1576
- }
1577
-
1578
- var i = byteLength - 1;
1579
- var mul = 1;
1580
- var sub = 0;
1581
- this[offset + i] = value & 0xFF;
1582
- while (--i >= 0 && (mul *= 0x100)) {
1583
- if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
1584
- sub = 1;
1585
- }
1586
- this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;
1587
- }
1588
-
1589
- return offset + byteLength
1590
- };
1591
-
1592
- Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {
1593
- value = +value;
1594
- offset = offset | 0;
1595
- if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -128);
1596
- if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);
1597
- if (value < 0) value = 0xff + value + 1;
1598
- this[offset] = (value & 0xff);
1599
- return offset + 1
1600
- };
1601
-
1602
- Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
1603
- value = +value;
1604
- offset = offset | 0;
1605
- if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -32768);
1606
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1607
- this[offset] = (value & 0xff);
1608
- this[offset + 1] = (value >>> 8);
1609
- } else {
1610
- objectWriteUInt16(this, value, offset, true);
1611
- }
1612
- return offset + 2
1613
- };
1614
-
1615
- Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
1616
- value = +value;
1617
- offset = offset | 0;
1618
- if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -32768);
1619
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1620
- this[offset] = (value >>> 8);
1621
- this[offset + 1] = (value & 0xff);
1622
- } else {
1623
- objectWriteUInt16(this, value, offset, false);
1624
- }
1625
- return offset + 2
1626
- };
1627
-
1628
- Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {
1629
- value = +value;
1630
- offset = offset | 0;
1631
- if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -2147483648);
1632
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1633
- this[offset] = (value & 0xff);
1634
- this[offset + 1] = (value >>> 8);
1635
- this[offset + 2] = (value >>> 16);
1636
- this[offset + 3] = (value >>> 24);
1637
- } else {
1638
- objectWriteUInt32(this, value, offset, true);
1639
- }
1640
- return offset + 4
1641
- };
1642
-
1643
- Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {
1644
- value = +value;
1645
- offset = offset | 0;
1646
- if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -2147483648);
1647
- if (value < 0) value = 0xffffffff + value + 1;
1648
- if (Buffer.TYPED_ARRAY_SUPPORT) {
1649
- this[offset] = (value >>> 24);
1650
- this[offset + 1] = (value >>> 16);
1651
- this[offset + 2] = (value >>> 8);
1652
- this[offset + 3] = (value & 0xff);
1653
- } else {
1654
- objectWriteUInt32(this, value, offset, false);
1655
- }
1656
- return offset + 4
1657
- };
1658
-
1659
- function checkIEEE754 (buf, value, offset, ext, max, min) {
1660
- if (offset + ext > buf.length) throw new RangeError('Index out of range')
1661
- if (offset < 0) throw new RangeError('Index out of range')
1662
- }
1663
-
1664
- function writeFloat (buf, value, offset, littleEndian, noAssert) {
1665
- if (!noAssert) {
1666
- checkIEEE754(buf, value, offset, 4);
1667
- }
1668
- write(buf, value, offset, littleEndian, 23, 4);
1669
- return offset + 4
1670
- }
1671
-
1672
- Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {
1673
- return writeFloat(this, value, offset, true, noAssert)
1674
- };
1675
-
1676
- Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {
1677
- return writeFloat(this, value, offset, false, noAssert)
1678
- };
1679
-
1680
- function writeDouble (buf, value, offset, littleEndian, noAssert) {
1681
- if (!noAssert) {
1682
- checkIEEE754(buf, value, offset, 8);
1683
- }
1684
- write(buf, value, offset, littleEndian, 52, 8);
1685
- return offset + 8
1686
- }
1687
-
1688
- Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {
1689
- return writeDouble(this, value, offset, true, noAssert)
1690
- };
1691
-
1692
- Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {
1693
- return writeDouble(this, value, offset, false, noAssert)
1694
- };
1695
-
1696
- // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
1697
- Buffer.prototype.copy = function copy (target, targetStart, start, end) {
1698
- if (!start) start = 0;
1699
- if (!end && end !== 0) end = this.length;
1700
- if (targetStart >= target.length) targetStart = target.length;
1701
- if (!targetStart) targetStart = 0;
1702
- if (end > 0 && end < start) end = start;
1703
-
1704
- // Copy 0 bytes; we're done
1705
- if (end === start) return 0
1706
- if (target.length === 0 || this.length === 0) return 0
1707
-
1708
- // Fatal error conditions
1709
- if (targetStart < 0) {
1710
- throw new RangeError('targetStart out of bounds')
1711
- }
1712
- if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')
1713
- if (end < 0) throw new RangeError('sourceEnd out of bounds')
1714
-
1715
- // Are we oob?
1716
- if (end > this.length) end = this.length;
1717
- if (target.length - targetStart < end - start) {
1718
- end = target.length - targetStart + start;
1719
- }
1720
-
1721
- var len = end - start;
1722
- var i;
1723
-
1724
- if (this === target && start < targetStart && targetStart < end) {
1725
- // descending copy from end
1726
- for (i = len - 1; i >= 0; --i) {
1727
- target[i + targetStart] = this[i + start];
1728
- }
1729
- } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {
1730
- // ascending copy from start
1731
- for (i = 0; i < len; ++i) {
1732
- target[i + targetStart] = this[i + start];
1733
- }
1734
- } else {
1735
- Uint8Array.prototype.set.call(
1736
- target,
1737
- this.subarray(start, start + len),
1738
- targetStart
1739
- );
1740
- }
1741
-
1742
- return len
1743
- };
1744
-
1745
- // Usage:
1746
- // buffer.fill(number[, offset[, end]])
1747
- // buffer.fill(buffer[, offset[, end]])
1748
- // buffer.fill(string[, offset[, end]][, encoding])
1749
- Buffer.prototype.fill = function fill (val, start, end, encoding) {
1750
- // Handle string cases:
1751
- if (typeof val === 'string') {
1752
- if (typeof start === 'string') {
1753
- encoding = start;
1754
- start = 0;
1755
- end = this.length;
1756
- } else if (typeof end === 'string') {
1757
- encoding = end;
1758
- end = this.length;
1759
- }
1760
- if (val.length === 1) {
1761
- var code = val.charCodeAt(0);
1762
- if (code < 256) {
1763
- val = code;
1764
- }
1765
- }
1766
- if (encoding !== undefined && typeof encoding !== 'string') {
1767
- throw new TypeError('encoding must be a string')
1768
- }
1769
- if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {
1770
- throw new TypeError('Unknown encoding: ' + encoding)
1771
- }
1772
- } else if (typeof val === 'number') {
1773
- val = val & 255;
1774
- }
1775
-
1776
- // Invalid ranges are not set to a default, so can range check early.
1777
- if (start < 0 || this.length < start || this.length < end) {
1778
- throw new RangeError('Out of range index')
1779
- }
1780
-
1781
- if (end <= start) {
1782
- return this
1783
- }
1784
-
1785
- start = start >>> 0;
1786
- end = end === undefined ? this.length : end >>> 0;
1787
-
1788
- if (!val) val = 0;
1789
-
1790
- var i;
1791
- if (typeof val === 'number') {
1792
- for (i = start; i < end; ++i) {
1793
- this[i] = val;
1794
- }
1795
- } else {
1796
- var bytes = internalIsBuffer(val)
1797
- ? val
1798
- : utf8ToBytes(new Buffer(val, encoding).toString());
1799
- var len = bytes.length;
1800
- for (i = 0; i < end - start; ++i) {
1801
- this[i + start] = bytes[i % len];
1802
- }
1803
- }
1804
-
1805
- return this
1806
- };
1807
-
1808
- // HELPER FUNCTIONS
1809
- // ================
1810
-
1811
- var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g;
1812
-
1813
- function base64clean (str) {
1814
- // Node strips out invalid characters like \n and \t from the string, base64-js does not
1815
- str = stringtrim(str).replace(INVALID_BASE64_RE, '');
1816
- // Node converts strings with length < 2 to ''
1817
- if (str.length < 2) return ''
1818
- // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
1819
- while (str.length % 4 !== 0) {
1820
- str = str + '=';
1821
- }
1822
- return str
1823
- }
1824
-
1825
- function stringtrim (str) {
1826
- if (str.trim) return str.trim()
1827
- return str.replace(/^\s+|\s+$/g, '')
1828
- }
1829
-
1830
- function toHex (n) {
1831
- if (n < 16) return '0' + n.toString(16)
1832
- return n.toString(16)
1833
- }
1834
-
1835
- function utf8ToBytes (string, units) {
1836
- units = units || Infinity;
1837
- var codePoint;
1838
- var length = string.length;
1839
- var leadSurrogate = null;
1840
- var bytes = [];
1841
-
1842
- for (var i = 0; i < length; ++i) {
1843
- codePoint = string.charCodeAt(i);
1844
-
1845
- // is surrogate component
1846
- if (codePoint > 0xD7FF && codePoint < 0xE000) {
1847
- // last char was a lead
1848
- if (!leadSurrogate) {
1849
- // no lead yet
1850
- if (codePoint > 0xDBFF) {
1851
- // unexpected trail
1852
- if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
1853
- continue
1854
- } else if (i + 1 === length) {
1855
- // unpaired lead
1856
- if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
1857
- continue
1858
- }
1859
-
1860
- // valid lead
1861
- leadSurrogate = codePoint;
1862
-
1863
- continue
1864
- }
1865
-
1866
- // 2 leads in a row
1867
- if (codePoint < 0xDC00) {
1868
- if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
1869
- leadSurrogate = codePoint;
1870
- continue
1871
- }
1872
-
1873
- // valid surrogate pair
1874
- codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000;
1875
- } else if (leadSurrogate) {
1876
- // valid bmp char, but last char was a lead
1877
- if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
1878
- }
1879
-
1880
- leadSurrogate = null;
1881
-
1882
- // encode utf8
1883
- if (codePoint < 0x80) {
1884
- if ((units -= 1) < 0) break
1885
- bytes.push(codePoint);
1886
- } else if (codePoint < 0x800) {
1887
- if ((units -= 2) < 0) break
1888
- bytes.push(
1889
- codePoint >> 0x6 | 0xC0,
1890
- codePoint & 0x3F | 0x80
1891
- );
1892
- } else if (codePoint < 0x10000) {
1893
- if ((units -= 3) < 0) break
1894
- bytes.push(
1895
- codePoint >> 0xC | 0xE0,
1896
- codePoint >> 0x6 & 0x3F | 0x80,
1897
- codePoint & 0x3F | 0x80
1898
- );
1899
- } else if (codePoint < 0x110000) {
1900
- if ((units -= 4) < 0) break
1901
- bytes.push(
1902
- codePoint >> 0x12 | 0xF0,
1903
- codePoint >> 0xC & 0x3F | 0x80,
1904
- codePoint >> 0x6 & 0x3F | 0x80,
1905
- codePoint & 0x3F | 0x80
1906
- );
1907
- } else {
1908
- throw new Error('Invalid code point')
1909
- }
1910
- }
1911
-
1912
- return bytes
1913
- }
1914
-
1915
- function asciiToBytes (str) {
1916
- var byteArray = [];
1917
- for (var i = 0; i < str.length; ++i) {
1918
- // Node's code seems to be doing this and not & 0x7F..
1919
- byteArray.push(str.charCodeAt(i) & 0xFF);
1920
- }
1921
- return byteArray
1922
- }
1923
-
1924
- function utf16leToBytes (str, units) {
1925
- var c, hi, lo;
1926
- var byteArray = [];
1927
- for (var i = 0; i < str.length; ++i) {
1928
- if ((units -= 2) < 0) break
1929
-
1930
- c = str.charCodeAt(i);
1931
- hi = c >> 8;
1932
- lo = c % 256;
1933
- byteArray.push(lo);
1934
- byteArray.push(hi);
1935
- }
1936
-
1937
- return byteArray
1938
- }
1939
-
1940
-
1941
- function base64ToBytes (str) {
1942
- return toByteArray(base64clean(str))
1943
- }
1944
-
1945
- function blitBuffer (src, dst, offset, length) {
1946
- for (var i = 0; i < length; ++i) {
1947
- if ((i + offset >= dst.length) || (i >= src.length)) break
1948
- dst[i + offset] = src[i];
1949
- }
1950
- return i
1951
- }
1952
-
1953
- function isnan (val) {
1954
- return val !== val // eslint-disable-line no-self-compare
1955
- }
1956
-
1957
-
1958
- // the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence
1959
- // The _isBuffer check is for Safari 5-7 support, because it's missing
1960
- // Object.prototype.constructor. Remove this eventually
1961
- function isBuffer(obj) {
1962
- return obj != null && (!!obj._isBuffer || isFastBuffer(obj) || isSlowBuffer(obj))
1963
- }
1964
-
1965
- function isFastBuffer (obj) {
1966
- return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)
1967
- }
1968
-
1969
- // For Node v0.10 support. Remove this eventually.
1970
- function isSlowBuffer (obj) {
1971
- return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isFastBuffer(obj.slice(0, 0))
1972
- }
1973
-
1974
- var LercDecode = {exports: {}};
1975
-
1976
- /* jshint forin: false, bitwise: false */
1977
-
1978
- var hasRequiredLercDecode;
1979
-
1980
- function requireLercDecode () {
1981
- if (hasRequiredLercDecode) return LercDecode.exports;
1982
- hasRequiredLercDecode = 1;
1983
- (function (module) {
1984
- /*
1985
- Copyright 2015-2021 Esri
1986
-
1987
- Licensed under the Apache License, Version 2.0 (the "License");
1988
- you may not use this file except in compliance with the License.
1989
- You may obtain a copy of the License at
1990
-
1991
- http://www.apache.org/licenses/LICENSE-2.0
1992
-
1993
- Unless required by applicable law or agreed to in writing, software
1994
- distributed under the License is distributed on an "AS IS" BASIS,
1995
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
1996
- See the License for the specific language governing permissions and
1997
- limitations under the License.
1998
-
1999
- A copy of the license and additional notices are located with the
2000
- source distribution at:
2001
-
2002
- http://github.com/Esri/lerc/
2003
-
2004
- Contributors: Johannes Schmid, (LERC v1)
2005
- Chayanika Khatua, (LERC v1)
2006
- Wenxue Ju (LERC v1, v2.x)
2007
- */
2008
-
2009
- /* 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 */
2010
-
2011
- /**
2012
- * a module for decoding LERC blobs
2013
- * @module Lerc
2014
- */
2015
- (function() {
2016
- //this decoder supports all lerc versions, each version has its own class (LercDecode and Lerc2Decode).
2017
- //the exported module handles format variation autoamtically.
2018
-
2019
- //the original LercDecode for Version 1
2020
- var LercDecode = (function() {
2021
-
2022
- // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of
2023
- // the class was chosen to be future proof.
2024
-
2025
- var CntZImage = {};
2026
-
2027
- CntZImage.defaultNoDataValue = -34027999387901484e22; // smallest Float32 value
2028
-
2029
- /**
2030
- * Decode a LERC byte stream and return an object containing the pixel data and some required and optional
2031
- * information about it, such as the image's width and height.
2032
- *
2033
- * @param {ArrayBuffer} input The LERC input byte stream
2034
- * @param {object} [options] Decoding options, containing any of the following properties:
2035
- * @config {number} [inputOffset = 0]
2036
- * Skip the first inputOffset bytes of the input byte stream. A valid LERC file is expected at that position.
2037
- * @config {Uint8Array} [encodedMask = null]
2038
- * If specified, the decoder will not read mask information from the input and use the specified encoded
2039
- * mask data instead. Mask header/data must not be present in the LERC byte stream in this case.
2040
- * @config {number} [noDataValue = LercCode.defaultNoDataValue]
2041
- * Pixel value to use for masked pixels.
2042
- * @config {ArrayBufferView|Array} [pixelType = Float32Array]
2043
- * The desired type of the pixelData array in the return value. Note that it is the caller's responsibility to
2044
- * provide an appropriate noDataValue if the default pixelType is overridden.
2045
- * @config {boolean} [returnMask = false]
2046
- * If true, the return value will contain a maskData property of type Uint8Array which has one element per
2047
- * pixel, the value of which is 1 or 0 depending on whether that pixel's data is present or masked. If the
2048
- * input LERC data does not contain a mask, maskData will not be returned.
2049
- * @config {boolean} [returnEncodedMask = false]
2050
- * If true, the return value will contain a encodedMaskData property, which can be passed into encode() as
2051
- * encodedMask.
2052
- * @config {boolean} [returnFileInfo = false]
2053
- * If true, the return value will have a fileInfo property that contains metadata obtained from the
2054
- * LERC headers and the decoding process.
2055
- * @config {boolean} [computeUsedBitDepths = false]
2056
- * If true, the fileInfo property in the return value will contain the set of all block bit depths
2057
- * encountered during decoding. Will only have an effect if returnFileInfo option is true.
2058
- * @returns {{width, height, pixelData, minValue, maxValue, noDataValue, maskData, encodedMaskData, fileInfo}}
2059
- */
2060
- CntZImage.decode = function(input, options) {
2061
- options = options || {};
2062
-
2063
- var skipMask = options.encodedMaskData || (options.encodedMaskData === null);
2064
- var parsedData = parse(input, options.inputOffset || 0, skipMask);
2065
-
2066
- var noDataValue = (options.noDataValue !== null) ? options.noDataValue : CntZImage.defaultNoDataValue;
2067
-
2068
- var uncompressedData = uncompressPixelValues(parsedData, options.pixelType || Float32Array,
2069
- options.encodedMaskData, noDataValue, options.returnMask);
2070
-
2071
- var result = {
2072
- width: parsedData.width,
2073
- height: parsedData.height,
2074
- pixelData: uncompressedData.resultPixels,
2075
- minValue: uncompressedData.minValue,
2076
- maxValue: parsedData.pixels.maxValue,
2077
- noDataValue: noDataValue
2078
- };
2079
-
2080
- if (uncompressedData.resultMask) {
2081
- result.maskData = uncompressedData.resultMask;
2082
- }
2083
-
2084
- if (options.returnEncodedMask && parsedData.mask) {
2085
- result.encodedMaskData = parsedData.mask.bitset ? parsedData.mask.bitset : null;
2086
- }
2087
-
2088
- if (options.returnFileInfo) {
2089
- result.fileInfo = formatFileInfo(parsedData);
2090
- if (options.computeUsedBitDepths) {
2091
- result.fileInfo.bitDepths = computeUsedBitDepths(parsedData);
2092
- }
2093
- }
2094
-
2095
- return result;
2096
- };
2097
-
2098
- var uncompressPixelValues = function(data, TypedArrayClass, maskBitset, noDataValue, storeDecodedMask) {
2099
- var blockIdx = 0;
2100
- var numX = data.pixels.numBlocksX;
2101
- var numY = data.pixels.numBlocksY;
2102
- var blockWidth = Math.floor(data.width / numX);
2103
- var blockHeight = Math.floor(data.height / numY);
2104
- var scale = 2 * data.maxZError;
2105
- var minValue = Number.MAX_VALUE, currentValue;
2106
- maskBitset = maskBitset || ((data.mask) ? data.mask.bitset : null);
2107
-
2108
- var resultPixels, resultMask;
2109
- resultPixels = new TypedArrayClass(data.width * data.height);
2110
- if (storeDecodedMask && maskBitset) {
2111
- resultMask = new Uint8Array(data.width * data.height);
2112
- }
2113
- var blockDataBuffer = new Float32Array(blockWidth * blockHeight);
2114
-
2115
- var xx, yy;
2116
- for (var y = 0; y <= numY; y++) {
2117
- var thisBlockHeight = (y !== numY) ? blockHeight : (data.height % numY);
2118
- if (thisBlockHeight === 0) {
2119
- continue;
2120
- }
2121
- for (var x = 0; x <= numX; x++) {
2122
- var thisBlockWidth = (x !== numX) ? blockWidth : (data.width % numX);
2123
- if (thisBlockWidth === 0) {
2124
- continue;
2125
- }
2126
-
2127
- var outPtr = y * data.width * blockHeight + x * blockWidth;
2128
- var outStride = data.width - thisBlockWidth;
2129
-
2130
- var block = data.pixels.blocks[blockIdx];
2131
-
2132
- var blockData, blockPtr, constValue;
2133
- if (block.encoding < 2) {
2134
- // block is either uncompressed or bit-stuffed (encodings 0 and 1)
2135
- if (block.encoding === 0) {
2136
- // block is uncompressed
2137
- blockData = block.rawData;
2138
- } else {
2139
- // block is bit-stuffed
2140
- unstuff(block.stuffedData, block.bitsPerPixel, block.numValidPixels, block.offset, scale, blockDataBuffer, data.pixels.maxValue);
2141
- blockData = blockDataBuffer;
2142
- }
2143
- blockPtr = 0;
2144
- }
2145
- else if (block.encoding === 2) {
2146
- // block is all 0
2147
- constValue = 0;
2148
- }
2149
- else {
2150
- // block has constant value (encoding === 3)
2151
- constValue = block.offset;
2152
- }
2153
-
2154
- var maskByte;
2155
- if (maskBitset) {
2156
- for (yy = 0; yy < thisBlockHeight; yy++) {
2157
- if (outPtr & 7) {
2158
- //
2159
- maskByte = maskBitset[outPtr >> 3];
2160
- maskByte <<= outPtr & 7;
2161
- }
2162
- for (xx = 0; xx < thisBlockWidth; xx++) {
2163
- if (!(outPtr & 7)) {
2164
- // read next byte from mask
2165
- maskByte = maskBitset[outPtr >> 3];
2166
- }
2167
- if (maskByte & 128) {
2168
- // pixel data present
2169
- if (resultMask) {
2170
- resultMask[outPtr] = 1;
2171
- }
2172
- currentValue = (block.encoding < 2) ? blockData[blockPtr++] : constValue;
2173
- minValue = minValue > currentValue ? currentValue : minValue;
2174
- resultPixels[outPtr++] = currentValue;
2175
- } else {
2176
- // pixel data not present
2177
- if (resultMask) {
2178
- resultMask[outPtr] = 0;
2179
- }
2180
- resultPixels[outPtr++] = noDataValue;
2181
- }
2182
- maskByte <<= 1;
2183
- }
2184
- outPtr += outStride;
2185
- }
2186
- } else {
2187
- // mask not present, simply copy block over
2188
- if (block.encoding < 2) {
2189
- // duplicating this code block for performance reasons
2190
- // blockData case:
2191
- for (yy = 0; yy < thisBlockHeight; yy++) {
2192
- for (xx = 0; xx < thisBlockWidth; xx++) {
2193
- currentValue = blockData[blockPtr++];
2194
- minValue = minValue > currentValue ? currentValue : minValue;
2195
- resultPixels[outPtr++] = currentValue;
2196
- }
2197
- outPtr += outStride;
2198
- }
2199
- }
2200
- else {
2201
- // constValue case:
2202
- minValue = minValue > constValue ? constValue : minValue;
2203
- for (yy = 0; yy < thisBlockHeight; yy++) {
2204
- for (xx = 0; xx < thisBlockWidth; xx++) {
2205
- resultPixels[outPtr++] = constValue;
2206
- }
2207
- outPtr += outStride;
2208
- }
2209
- }
2210
- }
2211
- if ((block.encoding === 1) && (blockPtr !== block.numValidPixels)) {
2212
- throw "Block and Mask do not match";
2213
- }
2214
- blockIdx++;
2215
- }
2216
- }
2217
-
2218
- return {
2219
- resultPixels: resultPixels,
2220
- resultMask: resultMask,
2221
- minValue: minValue
2222
- };
2223
- };
2224
-
2225
- var formatFileInfo = function(data) {
2226
- return {
2227
- "fileIdentifierString": data.fileIdentifierString,
2228
- "fileVersion": data.fileVersion,
2229
- "imageType": data.imageType,
2230
- "height": data.height,
2231
- "width": data.width,
2232
- "maxZError": data.maxZError,
2233
- "eofOffset": data.eofOffset,
2234
- "mask": data.mask ? {
2235
- "numBlocksX": data.mask.numBlocksX,
2236
- "numBlocksY": data.mask.numBlocksY,
2237
- "numBytes": data.mask.numBytes,
2238
- "maxValue": data.mask.maxValue
2239
- } : null,
2240
- "pixels": {
2241
- "numBlocksX": data.pixels.numBlocksX,
2242
- "numBlocksY": data.pixels.numBlocksY,
2243
- "numBytes": data.pixels.numBytes,
2244
- "maxValue": data.pixels.maxValue,
2245
- "noDataValue": data.noDataValue
2246
- }
2247
- };
2248
- };
2249
-
2250
- var computeUsedBitDepths = function(data) {
2251
- var numBlocks = data.pixels.numBlocksX * data.pixels.numBlocksY;
2252
- var bitDepths = {};
2253
- for (var i = 0; i < numBlocks; i++) {
2254
- var block = data.pixels.blocks[i];
2255
- if (block.encoding === 0) {
2256
- bitDepths.float32 = true;
2257
- } else if (block.encoding === 1) {
2258
- bitDepths[block.bitsPerPixel] = true;
2259
- } else {
2260
- bitDepths[0] = true;
2261
- }
2262
- }
2263
-
2264
- return Object.keys(bitDepths);
2265
- };
2266
-
2267
- var parse = function(input, fp, skipMask) {
2268
- var data = {};
2269
-
2270
- // File header
2271
- var fileIdView = new Uint8Array(input, fp, 10);
2272
- data.fileIdentifierString = String.fromCharCode.apply(null, fileIdView);
2273
- if (data.fileIdentifierString.trim() !== "CntZImage") {
2274
- throw "Unexpected file identifier string: " + data.fileIdentifierString;
2275
- }
2276
- fp += 10;
2277
- var view = new DataView(input, fp, 24);
2278
- data.fileVersion = view.getInt32(0, true);
2279
- data.imageType = view.getInt32(4, true);
2280
- data.height = view.getUint32(8, true);
2281
- data.width = view.getUint32(12, true);
2282
- data.maxZError = view.getFloat64(16, true);
2283
- fp += 24;
2284
-
2285
- // Mask Header
2286
- if (!skipMask) {
2287
- view = new DataView(input, fp, 16);
2288
- data.mask = {};
2289
- data.mask.numBlocksY = view.getUint32(0, true);
2290
- data.mask.numBlocksX = view.getUint32(4, true);
2291
- data.mask.numBytes = view.getUint32(8, true);
2292
- data.mask.maxValue = view.getFloat32(12, true);
2293
- fp += 16;
2294
-
2295
- // Mask Data
2296
- if (data.mask.numBytes > 0) {
2297
- var bitset = new Uint8Array(Math.ceil(data.width * data.height / 8));
2298
- view = new DataView(input, fp, data.mask.numBytes);
2299
- var cnt = view.getInt16(0, true);
2300
- var ip = 2, op = 0;
2301
- do {
2302
- if (cnt > 0) {
2303
- while (cnt--) { bitset[op++] = view.getUint8(ip++); }
2304
- } else {
2305
- var val = view.getUint8(ip++);
2306
- cnt = -cnt;
2307
- while (cnt--) { bitset[op++] = val; }
2308
- }
2309
- cnt = view.getInt16(ip, true);
2310
- ip += 2;
2311
- } while (ip < data.mask.numBytes);
2312
- if ((cnt !== -32768) || (op < bitset.length)) {
2313
- throw "Unexpected end of mask RLE encoding";
2314
- }
2315
- data.mask.bitset = bitset;
2316
- fp += data.mask.numBytes;
2317
- }
2318
- else if ((data.mask.numBytes | data.mask.numBlocksY | data.mask.maxValue) === 0) { // Special case, all nodata
2319
- data.mask.bitset = new Uint8Array(Math.ceil(data.width * data.height / 8));
2320
- }
2321
- }
2322
-
2323
- // Pixel Header
2324
- view = new DataView(input, fp, 16);
2325
- data.pixels = {};
2326
- data.pixels.numBlocksY = view.getUint32(0, true);
2327
- data.pixels.numBlocksX = view.getUint32(4, true);
2328
- data.pixels.numBytes = view.getUint32(8, true);
2329
- data.pixels.maxValue = view.getFloat32(12, true);
2330
- fp += 16;
2331
-
2332
- var numBlocksX = data.pixels.numBlocksX;
2333
- var numBlocksY = data.pixels.numBlocksY;
2334
- // the number of blocks specified in the header does not take into account the blocks at the end of
2335
- // each row/column with a special width/height that make the image complete in case the width is not
2336
- // evenly divisible by the number of blocks.
2337
- var actualNumBlocksX = numBlocksX + ((data.width % numBlocksX) > 0 ? 1 : 0);
2338
- var actualNumBlocksY = numBlocksY + ((data.height % numBlocksY) > 0 ? 1 : 0);
2339
- data.pixels.blocks = new Array(actualNumBlocksX * actualNumBlocksY);
2340
- var blockI = 0;
2341
- for (var blockY = 0; blockY < actualNumBlocksY; blockY++) {
2342
- for (var blockX = 0; blockX < actualNumBlocksX; blockX++) {
2343
-
2344
- // Block
2345
- var size = 0;
2346
- var bytesLeft = input.byteLength - fp;
2347
- view = new DataView(input, fp, Math.min(10, bytesLeft));
2348
- var block = {};
2349
- data.pixels.blocks[blockI++] = block;
2350
- var headerByte = view.getUint8(0); size++;
2351
- block.encoding = headerByte & 63;
2352
- if (block.encoding > 3) {
2353
- throw "Invalid block encoding (" + block.encoding + ")";
2354
- }
2355
- if (block.encoding === 2) {
2356
- fp++;
2357
- continue;
2358
- }
2359
- if ((headerByte !== 0) && (headerByte !== 2)) {
2360
- headerByte >>= 6;
2361
- block.offsetType = headerByte;
2362
- if (headerByte === 2) {
2363
- block.offset = view.getInt8(1); size++;
2364
- } else if (headerByte === 1) {
2365
- block.offset = view.getInt16(1, true); size += 2;
2366
- } else if (headerByte === 0) {
2367
- block.offset = view.getFloat32(1, true); size += 4;
2368
- } else {
2369
- throw "Invalid block offset type";
2370
- }
2371
-
2372
- if (block.encoding === 1) {
2373
- headerByte = view.getUint8(size); size++;
2374
- block.bitsPerPixel = headerByte & 63;
2375
- headerByte >>= 6;
2376
- block.numValidPixelsType = headerByte;
2377
- if (headerByte === 2) {
2378
- block.numValidPixels = view.getUint8(size); size++;
2379
- } else if (headerByte === 1) {
2380
- block.numValidPixels = view.getUint16(size, true); size += 2;
2381
- } else if (headerByte === 0) {
2382
- block.numValidPixels = view.getUint32(size, true); size += 4;
2383
- } else {
2384
- throw "Invalid valid pixel count type";
2385
- }
2386
- }
2387
- }
2388
- fp += size;
2389
-
2390
- if (block.encoding === 3) {
2391
- continue;
2392
- }
2393
-
2394
- var arrayBuf, store8;
2395
- if (block.encoding === 0) {
2396
- var numPixels = (data.pixels.numBytes - 1) / 4;
2397
- if (numPixels !== Math.floor(numPixels)) {
2398
- throw "uncompressed block has invalid length";
2399
- }
2400
- arrayBuf = new ArrayBuffer(numPixels * 4);
2401
- store8 = new Uint8Array(arrayBuf);
2402
- store8.set(new Uint8Array(input, fp, numPixels * 4));
2403
- var rawData = new Float32Array(arrayBuf);
2404
- block.rawData = rawData;
2405
- fp += numPixels * 4;
2406
- } else if (block.encoding === 1) {
2407
- var dataBytes = Math.ceil(block.numValidPixels * block.bitsPerPixel / 8);
2408
- var dataWords = Math.ceil(dataBytes / 4);
2409
- arrayBuf = new ArrayBuffer(dataWords * 4);
2410
- store8 = new Uint8Array(arrayBuf);
2411
- store8.set(new Uint8Array(input, fp, dataBytes));
2412
- block.stuffedData = new Uint32Array(arrayBuf);
2413
- fp += dataBytes;
2414
- }
2415
- }
2416
- }
2417
- data.eofOffset = fp;
2418
- return data;
2419
- };
2420
-
2421
- var unstuff = function(src, bitsPerPixel, numPixels, offset, scale, dest, maxValue) {
2422
- var bitMask = (1 << bitsPerPixel) - 1;
2423
- var i = 0, o;
2424
- var bitsLeft = 0;
2425
- var n, buffer;
2426
- var nmax = Math.ceil((maxValue - offset) / scale);
2427
- // get rid of trailing bytes that are already part of next block
2428
- var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
2429
- src[src.length - 1] <<= 8 * numInvalidTailBytes;
2430
-
2431
- for (o = 0; o < numPixels; o++) {
2432
- if (bitsLeft === 0) {
2433
- buffer = src[i++];
2434
- bitsLeft = 32;
2435
- }
2436
- if (bitsLeft >= bitsPerPixel) {
2437
- n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
2438
- bitsLeft -= bitsPerPixel;
2439
- } else {
2440
- var missingBits = (bitsPerPixel - bitsLeft);
2441
- n = ((buffer & bitMask) << missingBits) & bitMask;
2442
- buffer = src[i++];
2443
- bitsLeft = 32 - missingBits;
2444
- n += (buffer >>> bitsLeft);
2445
- }
2446
- //pixel values may exceed max due to quantization
2447
- dest[o] = n < nmax ? offset + n * scale : maxValue;
2448
- }
2449
- return dest;
2450
- };
2451
-
2452
- return CntZImage;
2453
- })();
2454
-
2455
- //version 2. Supports 2.1, 2.2, 2.3
2456
- var Lerc2Decode = (function() {
2457
- // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of
2458
- // the class was chosen to be future proof, following LercDecode.
2459
-
2460
- /*****************************************
2461
- * private static class bitsutffer used by Lerc2Decode
2462
- *******************************************/
2463
- var BitStuffer = {
2464
- //methods ending with 2 are for the new byte order used by Lerc2.3 and above.
2465
- //originalUnstuff is used to unpack Huffman code table. code is duplicated to unstuffx for performance reasons.
2466
- unstuff: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) {
2467
- var bitMask = (1 << bitsPerPixel) - 1;
2468
- var i = 0, o;
2469
- var bitsLeft = 0;
2470
- var n, buffer, missingBits, nmax;
2471
-
2472
- // get rid of trailing bytes that are already part of next block
2473
- var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
2474
- src[src.length - 1] <<= 8 * numInvalidTailBytes;
2475
- if (lutArr) {
2476
- for (o = 0; o < numPixels; o++) {
2477
- if (bitsLeft === 0) {
2478
- buffer = src[i++];
2479
- bitsLeft = 32;
2480
- }
2481
- if (bitsLeft >= bitsPerPixel) {
2482
- n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
2483
- bitsLeft -= bitsPerPixel;
2484
- }
2485
- else {
2486
- missingBits = (bitsPerPixel - bitsLeft);
2487
- n = ((buffer & bitMask) << missingBits) & bitMask;
2488
- buffer = src[i++];
2489
- bitsLeft = 32 - missingBits;
2490
- n += (buffer >>> bitsLeft);
2491
- }
2492
- dest[o] = lutArr[n];//offset + lutArr[n] * scale;
2493
- }
2494
- }
2495
- else {
2496
- nmax = Math.ceil((maxValue - offset) / scale);
2497
- for (o = 0; o < numPixels; o++) {
2498
- if (bitsLeft === 0) {
2499
- buffer = src[i++];
2500
- bitsLeft = 32;
2501
- }
2502
- if (bitsLeft >= bitsPerPixel) {
2503
- n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
2504
- bitsLeft -= bitsPerPixel;
2505
- }
2506
- else {
2507
- missingBits = (bitsPerPixel - bitsLeft);
2508
- n = ((buffer & bitMask) << missingBits) & bitMask;
2509
- buffer = src[i++];
2510
- bitsLeft = 32 - missingBits;
2511
- n += (buffer >>> bitsLeft);
2512
- }
2513
- //pixel values may exceed max due to quantization
2514
- dest[o] = n < nmax ? offset + n * scale : maxValue;
2515
- }
2516
- }
2517
- },
2518
-
2519
- unstuffLUT: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) {
2520
- var bitMask = (1 << bitsPerPixel) - 1;
2521
- var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0;
2522
- var buffer;
2523
- var dest = [];
2524
-
2525
- // get rid of trailing bytes that are already part of next block
2526
- var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
2527
- src[src.length - 1] <<= 8 * numInvalidTailBytes;
2528
-
2529
- var nmax = Math.ceil((maxValue - offset) / scale);
2530
- for (o = 0; o < numPixels; o++) {
2531
- if (bitsLeft === 0) {
2532
- buffer = src[i++];
2533
- bitsLeft = 32;
2534
- }
2535
- if (bitsLeft >= bitsPerPixel) {
2536
- n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
2537
- bitsLeft -= bitsPerPixel;
2538
- } else {
2539
- missingBits = (bitsPerPixel - bitsLeft);
2540
- n = ((buffer & bitMask) << missingBits) & bitMask;
2541
- buffer = src[i++];
2542
- bitsLeft = 32 - missingBits;
2543
- n += (buffer >>> bitsLeft);
2544
- }
2545
- //dest.push(n);
2546
- dest[o] = n < nmax ? offset + n * scale : maxValue;
2547
- }
2548
- dest.unshift(offset);//1st one
2549
- return dest;
2550
- },
2551
-
2552
- unstuff2: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) {
2553
- var bitMask = (1 << bitsPerPixel) - 1;
2554
- var i = 0, o;
2555
- var bitsLeft = 0, bitPos = 0;
2556
- var n, buffer, missingBits;
2557
- if (lutArr) {
2558
- for (o = 0; o < numPixels; o++) {
2559
- if (bitsLeft === 0) {
2560
- buffer = src[i++];
2561
- bitsLeft = 32;
2562
- bitPos = 0;
2563
- }
2564
- if (bitsLeft >= bitsPerPixel) {
2565
- n = ((buffer >>> bitPos) & bitMask);
2566
- bitsLeft -= bitsPerPixel;
2567
- bitPos += bitsPerPixel;
2568
- } else {
2569
- missingBits = (bitsPerPixel - bitsLeft);
2570
- n = (buffer >>> bitPos) & bitMask;
2571
- buffer = src[i++];
2572
- bitsLeft = 32 - missingBits;
2573
- n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
2574
- bitPos = missingBits;
2575
- }
2576
- dest[o] = lutArr[n];
2577
- }
2578
- }
2579
- else {
2580
- var nmax = Math.ceil((maxValue - offset) / scale);
2581
- for (o = 0; o < numPixels; o++) {
2582
- if (bitsLeft === 0) {
2583
- buffer = src[i++];
2584
- bitsLeft = 32;
2585
- bitPos = 0;
2586
- }
2587
- if (bitsLeft >= bitsPerPixel) {
2588
- //no unsigned left shift
2589
- n = ((buffer >>> bitPos) & bitMask);
2590
- bitsLeft -= bitsPerPixel;
2591
- bitPos += bitsPerPixel;
2592
- } else {
2593
- missingBits = (bitsPerPixel - bitsLeft);
2594
- n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;
2595
- buffer = src[i++];
2596
- bitsLeft = 32 - missingBits;
2597
- n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
2598
- bitPos = missingBits;
2599
- }
2600
- //pixel values may exceed max due to quantization
2601
- dest[o] = n < nmax ? offset + n * scale : maxValue;
2602
- }
2603
- }
2604
- return dest;
2605
- },
2606
-
2607
- unstuffLUT2: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) {
2608
- var bitMask = (1 << bitsPerPixel) - 1;
2609
- var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0, bitPos = 0;
2610
- var buffer;
2611
- var dest = [];
2612
- var nmax = Math.ceil((maxValue - offset) / scale);
2613
- for (o = 0; o < numPixels; o++) {
2614
- if (bitsLeft === 0) {
2615
- buffer = src[i++];
2616
- bitsLeft = 32;
2617
- bitPos = 0;
2618
- }
2619
- if (bitsLeft >= bitsPerPixel) {
2620
- //no unsigned left shift
2621
- n = ((buffer >>> bitPos) & bitMask);
2622
- bitsLeft -= bitsPerPixel;
2623
- bitPos += bitsPerPixel;
2624
- } else {
2625
- missingBits = (bitsPerPixel - bitsLeft);
2626
- n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;
2627
- buffer = src[i++];
2628
- bitsLeft = 32 - missingBits;
2629
- n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
2630
- bitPos = missingBits;
2631
- }
2632
- //dest.push(n);
2633
- dest[o] = n < nmax ? offset + n * scale : maxValue;
2634
- }
2635
- dest.unshift(offset);
2636
- return dest;
2637
- },
2638
-
2639
- originalUnstuff: function(src, dest, bitsPerPixel, numPixels) {
2640
- var bitMask = (1 << bitsPerPixel) - 1;
2641
- var i = 0, o;
2642
- var bitsLeft = 0;
2643
- var n, buffer, missingBits;
2644
-
2645
- // get rid of trailing bytes that are already part of next block
2646
- var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);
2647
- src[src.length - 1] <<= 8 * numInvalidTailBytes;
2648
-
2649
- for (o = 0; o < numPixels; o++) {
2650
- if (bitsLeft === 0) {
2651
- buffer = src[i++];
2652
- bitsLeft = 32;
2653
- }
2654
- if (bitsLeft >= bitsPerPixel) {
2655
- n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;
2656
- bitsLeft -= bitsPerPixel;
2657
- }
2658
- else {
2659
- missingBits = (bitsPerPixel - bitsLeft);
2660
- n = ((buffer & bitMask) << missingBits) & bitMask;
2661
- buffer = src[i++];
2662
- bitsLeft = 32 - missingBits;
2663
- n += (buffer >>> bitsLeft);
2664
- }
2665
- dest[o] = n;
2666
- }
2667
- return dest;
2668
- },
2669
-
2670
- originalUnstuff2: function(src, dest, bitsPerPixel, numPixels) {
2671
- var bitMask = (1 << bitsPerPixel) - 1;
2672
- var i = 0, o;
2673
- var bitsLeft = 0, bitPos = 0;
2674
- var n, buffer, missingBits;
2675
- //micro-optimizations
2676
- for (o = 0; o < numPixels; o++) {
2677
- if (bitsLeft === 0) {
2678
- buffer = src[i++];
2679
- bitsLeft = 32;
2680
- bitPos = 0;
2681
- }
2682
- if (bitsLeft >= bitsPerPixel) {
2683
- //no unsigned left shift
2684
- n = ((buffer >>> bitPos) & bitMask);
2685
- bitsLeft -= bitsPerPixel;
2686
- bitPos += bitsPerPixel;
2687
- } else {
2688
- missingBits = (bitsPerPixel - bitsLeft);
2689
- n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;
2690
- buffer = src[i++];
2691
- bitsLeft = 32 - missingBits;
2692
- n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);
2693
- bitPos = missingBits;
2694
- }
2695
- dest[o] = n;
2696
- }
2697
- return dest;
2698
- }
2699
- };
2700
-
2701
- /*****************************************
2702
- *private static class used by Lerc2Decode
2703
- ******************************************/
2704
- var Lerc2Helpers = {
2705
- HUFFMAN_LUT_BITS_MAX: 12, //use 2^12 lut, treat it like constant
2706
- computeChecksumFletcher32: function(input) {
2707
-
2708
- var sum1 = 0xffff, sum2 = 0xffff;
2709
- var len = input.length;
2710
- var words = Math.floor(len / 2);
2711
- var i = 0;
2712
- while (words) {
2713
- var tlen = (words >= 359) ? 359 : words;
2714
- words -= tlen;
2715
- do {
2716
- sum1 += (input[i++] << 8);
2717
- sum2 += sum1 += input[i++];
2718
- } while (--tlen);
2719
-
2720
- sum1 = (sum1 & 0xffff) + (sum1 >>> 16);
2721
- sum2 = (sum2 & 0xffff) + (sum2 >>> 16);
2722
- }
2723
-
2724
- // add the straggler byte if it exists
2725
- if (len & 1) {
2726
- sum2 += sum1 += (input[i] << 8);
2727
- }
2728
- // second reduction step to reduce sums to 16 bits
2729
- sum1 = (sum1 & 0xffff) + (sum1 >>> 16);
2730
- sum2 = (sum2 & 0xffff) + (sum2 >>> 16);
2731
-
2732
- return (sum2 << 16 | sum1) >>> 0;
2733
- },
2734
-
2735
- readHeaderInfo: function(input, data) {
2736
- var ptr = data.ptr;
2737
- var fileIdView = new Uint8Array(input, ptr, 6);
2738
- var headerInfo = {};
2739
- headerInfo.fileIdentifierString = String.fromCharCode.apply(null, fileIdView);
2740
- if (headerInfo.fileIdentifierString.lastIndexOf("Lerc2", 0) !== 0) {
2741
- throw "Unexpected file identifier string (expect Lerc2 ): " + headerInfo.fileIdentifierString;
2742
- }
2743
- ptr += 6;
2744
- var view = new DataView(input, ptr, 8);
2745
- var fileVersion = view.getInt32(0, true);
2746
- headerInfo.fileVersion = fileVersion;
2747
- ptr += 4;
2748
- if (fileVersion >= 3) {
2749
- headerInfo.checksum = view.getUint32(4, true); //nrows
2750
- ptr += 4;
2751
- }
2752
-
2753
- //keys start from here
2754
- view = new DataView(input, ptr, 12);
2755
- headerInfo.height = view.getUint32(0, true); //nrows
2756
- headerInfo.width = view.getUint32(4, true); //ncols
2757
- ptr += 8;
2758
- if (fileVersion >= 4) {
2759
- headerInfo.numDims = view.getUint32(8, true);
2760
- ptr += 4;
2761
- }
2762
- else {
2763
- headerInfo.numDims = 1;
2764
- }
2765
-
2766
- view = new DataView(input, ptr, 40);
2767
- headerInfo.numValidPixel = view.getUint32(0, true);
2768
- headerInfo.microBlockSize = view.getInt32(4, true);
2769
- headerInfo.blobSize = view.getInt32(8, true);
2770
- headerInfo.imageType = view.getInt32(12, true);
2771
-
2772
- headerInfo.maxZError = view.getFloat64(16, true);
2773
- headerInfo.zMin = view.getFloat64(24, true);
2774
- headerInfo.zMax = view.getFloat64(32, true);
2775
- ptr += 40;
2776
- data.headerInfo = headerInfo;
2777
- data.ptr = ptr;
2778
-
2779
- var checksum, keyLength;
2780
- if (fileVersion >= 3) {
2781
- keyLength = fileVersion >= 4 ? 52 : 48;
2782
- checksum = this.computeChecksumFletcher32(new Uint8Array(input, ptr - keyLength, headerInfo.blobSize - 14));
2783
- if (checksum !== headerInfo.checksum) {
2784
- throw "Checksum failed.";
2785
- }
2786
- }
2787
- return true;
2788
- },
2789
-
2790
- checkMinMaxRanges: function(input, data) {
2791
- var headerInfo = data.headerInfo;
2792
- var OutPixelTypeArray = this.getDataTypeArray(headerInfo.imageType);
2793
- var rangeBytes = headerInfo.numDims * this.getDataTypeSize(headerInfo.imageType);
2794
- var minValues = this.readSubArray(input, data.ptr, OutPixelTypeArray, rangeBytes);
2795
- var maxValues = this.readSubArray(input, data.ptr + rangeBytes, OutPixelTypeArray, rangeBytes);
2796
- data.ptr += (2 * rangeBytes);
2797
- var i, equal = true;
2798
- for (i = 0; i < headerInfo.numDims; i++) {
2799
- if (minValues[i] !== maxValues[i]) {
2800
- equal = false;
2801
- break;
2802
- }
2803
- }
2804
- headerInfo.minValues = minValues;
2805
- headerInfo.maxValues = maxValues;
2806
- return equal;
2807
- },
2808
-
2809
- readSubArray: function(input, ptr, OutPixelTypeArray, numBytes) {
2810
- var rawData;
2811
- if (OutPixelTypeArray === Uint8Array) {
2812
- rawData = new Uint8Array(input, ptr, numBytes);
2813
- }
2814
- else {
2815
- var arrayBuf = new ArrayBuffer(numBytes);
2816
- var store8 = new Uint8Array(arrayBuf);
2817
- store8.set(new Uint8Array(input, ptr, numBytes));
2818
- rawData = new OutPixelTypeArray(arrayBuf);
2819
- }
2820
- return rawData;
2821
- },
2822
-
2823
- readMask: function(input, data) {
2824
- var ptr = data.ptr;
2825
- var headerInfo = data.headerInfo;
2826
- var numPixels = headerInfo.width * headerInfo.height;
2827
- var numValidPixel = headerInfo.numValidPixel;
2828
-
2829
- var view = new DataView(input, ptr, 4);
2830
- var mask = {};
2831
- mask.numBytes = view.getUint32(0, true);
2832
- ptr += 4;
2833
-
2834
- // Mask Data
2835
- if ((0 === numValidPixel || numPixels === numValidPixel) && 0 !== mask.numBytes) {
2836
- throw ("invalid mask");
2837
- }
2838
- var bitset, resultMask;
2839
- if (numValidPixel === 0) {
2840
- bitset = new Uint8Array(Math.ceil(numPixels / 8));
2841
- mask.bitset = bitset;
2842
- resultMask = new Uint8Array(numPixels);
2843
- data.pixels.resultMask = resultMask;
2844
- ptr += mask.numBytes;
2845
- }// ????? else if (data.mask.numBytes > 0 && data.mask.numBytes< data.numValidPixel) {
2846
- else if (mask.numBytes > 0) {
2847
- bitset = new Uint8Array(Math.ceil(numPixels / 8));
2848
- view = new DataView(input, ptr, mask.numBytes);
2849
- var cnt = view.getInt16(0, true);
2850
- var ip = 2, op = 0, val = 0;
2851
- do {
2852
- if (cnt > 0) {
2853
- while (cnt--) { bitset[op++] = view.getUint8(ip++); }
2854
- } else {
2855
- val = view.getUint8(ip++);
2856
- cnt = -cnt;
2857
- while (cnt--) { bitset[op++] = val; }
2858
- }
2859
- cnt = view.getInt16(ip, true);
2860
- ip += 2;
2861
- } while (ip < mask.numBytes);
2862
- if ((cnt !== -32768) || (op < bitset.length)) {
2863
- throw "Unexpected end of mask RLE encoding";
2864
- }
2865
-
2866
- resultMask = new Uint8Array(numPixels);
2867
- var mb = 0, k = 0;
2868
-
2869
- for (k = 0; k < numPixels; k++) {
2870
- if (k & 7) {
2871
- mb = bitset[k >> 3];
2872
- mb <<= k & 7;
2873
- }
2874
- else {
2875
- mb = bitset[k >> 3];
2876
- }
2877
- if (mb & 128) {
2878
- resultMask[k] = 1;
2879
- }
2880
- }
2881
- data.pixels.resultMask = resultMask;
2882
-
2883
- mask.bitset = bitset;
2884
- ptr += mask.numBytes;
2885
- }
2886
- data.ptr = ptr;
2887
- data.mask = mask;
2888
- return true;
2889
- },
2890
-
2891
- readDataOneSweep: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {
2892
- var ptr = data.ptr;
2893
- var headerInfo = data.headerInfo;
2894
- var numDims = headerInfo.numDims;
2895
- var numPixels = headerInfo.width * headerInfo.height;
2896
- var imageType = headerInfo.imageType;
2897
- var numBytes = headerInfo.numValidPixel * Lerc2Helpers.getDataTypeSize(imageType) * numDims;
2898
- //data.pixels.numBytes = numBytes;
2899
- var rawData;
2900
- var mask = data.pixels.resultMask;
2901
- if (OutPixelTypeArray === Uint8Array) {
2902
- rawData = new Uint8Array(input, ptr, numBytes);
2903
- }
2904
- else {
2905
- var arrayBuf = new ArrayBuffer(numBytes);
2906
- var store8 = new Uint8Array(arrayBuf);
2907
- store8.set(new Uint8Array(input, ptr, numBytes));
2908
- rawData = new OutPixelTypeArray(arrayBuf);
2909
- }
2910
- if (rawData.length === numPixels * numDims) {
2911
- if (useBSQForOutputDim) {
2912
- data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(rawData, numPixels, numDims, OutPixelTypeArray, true);
2913
- }
2914
- else {
2915
- data.pixels.resultPixels = rawData;
2916
- }
2917
- }
2918
- else //mask
2919
- {
2920
- data.pixels.resultPixels = new OutPixelTypeArray(numPixels * numDims);
2921
- var z = 0, k = 0, i = 0, nStart = 0;
2922
- if (numDims > 1) {
2923
- if (useBSQForOutputDim) {
2924
- for (k = 0; k < numPixels; k++) {
2925
- if (mask[k]) {
2926
- nStart = k;
2927
- for (i = 0; i < numDims; i++, nStart+=numPixels) {
2928
- data.pixels.resultPixels[nStart] = rawData[z++];
2929
- }
2930
- }
2931
- }
2932
- }
2933
- else {
2934
- for (k = 0; k < numPixels; k++) {
2935
- if (mask[k]) {
2936
- nStart = k * numDims;
2937
- for (i = 0; i < numDims; i++) {
2938
- data.pixels.resultPixels[nStart + i] = rawData[z++];
2939
- }
2940
- }
2941
- }
2942
- }
2943
- }
2944
- else {
2945
- for (k = 0; k < numPixels; k++) {
2946
- if (mask[k]) {
2947
- data.pixels.resultPixels[k] = rawData[z++];
2948
- }
2949
- }
2950
- }
2951
- }
2952
- ptr += numBytes;
2953
- data.ptr = ptr; //return data;
2954
- return true;
2955
- },
2956
-
2957
- readHuffmanTree: function(input, data) {
2958
- var BITS_MAX = this.HUFFMAN_LUT_BITS_MAX; //8 is slow for the large test image
2959
- //var size_max = 1 << BITS_MAX;
2960
- /* ************************
2961
- * reading code table
2962
- *************************/
2963
- var view = new DataView(input, data.ptr, 16);
2964
- data.ptr += 16;
2965
- var version = view.getInt32(0, true);
2966
- if (version < 2) {
2967
- throw "unsupported Huffman version";
2968
- }
2969
- var size = view.getInt32(4, true);
2970
- var i0 = view.getInt32(8, true);
2971
- var i1 = view.getInt32(12, true);
2972
- if (i0 >= i1) {
2973
- return false;
2974
- }
2975
- var blockDataBuffer = new Uint32Array(i1 - i0);
2976
- Lerc2Helpers.decodeBits(input, data, blockDataBuffer);
2977
- var codeTable = []; //size
2978
- var i, j, k, len;
2979
-
2980
- for (i = i0; i < i1; i++) {
2981
- j = i - (i < size ? 0 : size);//wrap around
2982
- codeTable[j] = { first: blockDataBuffer[i - i0], second: null };
2983
- }
2984
-
2985
- var dataBytes = input.byteLength - data.ptr;
2986
- var dataWords = Math.ceil(dataBytes / 4);
2987
- var arrayBuf = new ArrayBuffer(dataWords * 4);
2988
- var store8 = new Uint8Array(arrayBuf);
2989
- store8.set(new Uint8Array(input, data.ptr, dataBytes));
2990
- var stuffedData = new Uint32Array(arrayBuf); //must start from x*4
2991
- var bitPos = 0, word, srcPtr = 0;
2992
- word = stuffedData[0];
2993
- for (i = i0; i < i1; i++) {
2994
- j = i - (i < size ? 0 : size);//wrap around
2995
- len = codeTable[j].first;
2996
- if (len > 0) {
2997
- codeTable[j].second = (word << bitPos) >>> (32 - len);
2998
-
2999
- if (32 - bitPos >= len) {
3000
- bitPos += len;
3001
- if (bitPos === 32) {
3002
- bitPos = 0;
3003
- srcPtr++;
3004
- word = stuffedData[srcPtr];
3005
- }
3006
- }
3007
- else {
3008
- bitPos += len - 32;
3009
- srcPtr++;
3010
- word = stuffedData[srcPtr];
3011
- codeTable[j].second |= word >>> (32 - bitPos);
3012
- }
3013
- }
3014
- }
3015
-
3016
- //finished reading code table
3017
-
3018
- /* ************************
3019
- * building lut
3020
- *************************/
3021
- var numBitsLUT = 0, numBitsLUTQick = 0;
3022
- var tree = new TreeNode();
3023
- for (i = 0; i < codeTable.length; i++) {
3024
- if (codeTable[i] !== undefined) {
3025
- numBitsLUT = Math.max(numBitsLUT, codeTable[i].first);
3026
- }
3027
- }
3028
- if (numBitsLUT >= BITS_MAX) {
3029
- numBitsLUTQick = BITS_MAX;
3030
- }
3031
- else {
3032
- numBitsLUTQick = numBitsLUT;
3033
- }
3034
- // for debugging purpose
3035
- // if (numBitsLUT >= 30) {
3036
- // console.log("WARning, large NUM LUT BITS IS " + numBitsLUT);
3037
- // }
3038
- var decodeLut = [], entry, code, numEntries, jj, currentBit, node;
3039
- for (i = i0; i < i1; i++) {
3040
- j = i - (i < size ? 0 : size);//wrap around
3041
- len = codeTable[j].first;
3042
- if (len > 0) {
3043
- entry = [len, j];
3044
- if (len <= numBitsLUTQick) {
3045
- code = codeTable[j].second << (numBitsLUTQick - len);
3046
- numEntries = 1 << (numBitsLUTQick - len);
3047
- for (k = 0; k < numEntries; k++) {
3048
- decodeLut[code | k] = entry;
3049
- }
3050
- }
3051
- else {
3052
- //build tree
3053
- code = codeTable[j].second;
3054
- node = tree;
3055
- for (jj = len - 1; jj >= 0; jj--) {
3056
- currentBit = code >>> jj & 1; //no left shift as length could be 30,31
3057
- if (currentBit) {
3058
- if (!node.right) {
3059
- node.right = new TreeNode();
3060
- }
3061
- node = node.right;
3062
- }
3063
- else {
3064
- if (!node.left) {
3065
- node.left = new TreeNode();
3066
- }
3067
- node = node.left;
3068
- }
3069
- if (jj === 0 && !node.val) {
3070
- node.val = entry[1];
3071
- }
3072
- }
3073
- }
3074
- }
3075
- }
3076
- return {
3077
- decodeLut: decodeLut,
3078
- numBitsLUTQick: numBitsLUTQick,
3079
- numBitsLUT: numBitsLUT,
3080
- tree: tree,
3081
- stuffedData: stuffedData,
3082
- srcPtr: srcPtr,
3083
- bitPos: bitPos
3084
- };
3085
- },
3086
-
3087
- readHuffman: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {
3088
- var headerInfo = data.headerInfo;
3089
- var numDims = headerInfo.numDims;
3090
- var height = data.headerInfo.height;
3091
- var width = data.headerInfo.width;
3092
- var numPixels = width * height;
3093
- //var size_max = 1 << BITS_MAX;
3094
- /* ************************
3095
- * reading huffman structure info
3096
- *************************/
3097
- var huffmanInfo = this.readHuffmanTree(input, data);
3098
- var decodeLut = huffmanInfo.decodeLut;
3099
- var tree = huffmanInfo.tree;
3100
- //stuffedData includes huffman headers
3101
- var stuffedData = huffmanInfo.stuffedData;
3102
- var srcPtr = huffmanInfo.srcPtr;
3103
- var bitPos = huffmanInfo.bitPos;
3104
- var numBitsLUTQick = huffmanInfo.numBitsLUTQick;
3105
- var numBitsLUT = huffmanInfo.numBitsLUT;
3106
- var offset = data.headerInfo.imageType === 0 ? 128 : 0;
3107
- /*************************
3108
- * decode
3109
- ***************************/
3110
- var node, val, delta, mask = data.pixels.resultMask, valTmp, valTmpQuick, currentBit;
3111
- var i, j, k, ii;
3112
- var prevVal = 0;
3113
- if (bitPos > 0) {
3114
- srcPtr++;
3115
- bitPos = 0;
3116
- }
3117
- var word = stuffedData[srcPtr];
3118
- var deltaEncode = data.encodeMode === 1;
3119
- var resultPixelsAllDim = new OutPixelTypeArray(numPixels * numDims);
3120
- var resultPixels = resultPixelsAllDim;
3121
- var iDim;
3122
- // TODO: reevaluate the need to keep inlined decoding code as IE support is phasing out
3123
- if (numDims < 2 || deltaEncode) {
3124
- for (iDim = 0; iDim < numDims; iDim++) {
3125
- if (numDims > 1) {
3126
- //get the mem block of current dimension
3127
- resultPixels = new OutPixelTypeArray(resultPixelsAllDim.buffer, numPixels * iDim, numPixels);
3128
- prevVal = 0;
3129
- }
3130
- if (data.headerInfo.numValidPixel === width * height) { //all valid
3131
- for (k = 0, i = 0; i < height; i++) {
3132
- for (j = 0; j < width; j++, k++) {
3133
- val = 0;
3134
- valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);
3135
- valTmpQuick = valTmp;// >>> deltaBits;
3136
- if (32 - bitPos < numBitsLUTQick) {
3137
- valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));
3138
- valTmpQuick = valTmp;// >>> deltaBits;
3139
- }
3140
- if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done
3141
- {
3142
- val = decodeLut[valTmpQuick][1];
3143
- bitPos += decodeLut[valTmpQuick][0];
3144
- }
3145
- else {
3146
- valTmp = (word << bitPos) >>> (32 - numBitsLUT);
3147
- valTmpQuick = valTmp;// >>> deltaBits;
3148
- if (32 - bitPos < numBitsLUT) {
3149
- valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));
3150
- valTmpQuick = valTmp;// >>> deltaBits;
3151
- }
3152
- node = tree;
3153
- for (ii = 0; ii < numBitsLUT; ii++) {
3154
- currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;
3155
- node = currentBit ? node.right : node.left;
3156
- if (!(node.left || node.right)) {
3157
- val = node.val;
3158
- bitPos = bitPos + ii + 1;
3159
- break;
3160
- }
3161
- }
3162
- }
3163
-
3164
- if (bitPos >= 32) {
3165
- bitPos -= 32;
3166
- srcPtr++;
3167
- word = stuffedData[srcPtr];
3168
- }
3169
-
3170
- delta = val - offset;
3171
- if (deltaEncode) {
3172
- if (j > 0) {
3173
- delta += prevVal; // use overflow
3174
- }
3175
- else if (i > 0) {
3176
- delta += resultPixels[k - width];
3177
- }
3178
- else {
3179
- delta += prevVal;
3180
- }
3181
- delta &= 0xFF; //overflow
3182
- resultPixels[k] = delta;//overflow
3183
- prevVal = delta;
3184
- }
3185
- else {
3186
- resultPixels[k] = delta;
3187
- }
3188
- }
3189
- }
3190
- }
3191
- else { //not all valid, use mask
3192
- for (k = 0, i = 0; i < height; i++) {
3193
- for (j = 0; j < width; j++, k++) {
3194
- if (mask[k]) {
3195
- val = 0;
3196
- valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);
3197
- valTmpQuick = valTmp;// >>> deltaBits;
3198
- if (32 - bitPos < numBitsLUTQick) {
3199
- valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));
3200
- valTmpQuick = valTmp;// >>> deltaBits;
3201
- }
3202
- if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done
3203
- {
3204
- val = decodeLut[valTmpQuick][1];
3205
- bitPos += decodeLut[valTmpQuick][0];
3206
- }
3207
- else {
3208
- valTmp = (word << bitPos) >>> (32 - numBitsLUT);
3209
- valTmpQuick = valTmp;// >>> deltaBits;
3210
- if (32 - bitPos < numBitsLUT) {
3211
- valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));
3212
- valTmpQuick = valTmp;// >>> deltaBits;
3213
- }
3214
- node = tree;
3215
- for (ii = 0; ii < numBitsLUT; ii++) {
3216
- currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;
3217
- node = currentBit ? node.right : node.left;
3218
- if (!(node.left || node.right)) {
3219
- val = node.val;
3220
- bitPos = bitPos + ii + 1;
3221
- break;
3222
- }
3223
- }
3224
- }
3225
-
3226
- if (bitPos >= 32) {
3227
- bitPos -= 32;
3228
- srcPtr++;
3229
- word = stuffedData[srcPtr];
3230
- }
3231
-
3232
- delta = val - offset;
3233
- if (deltaEncode) {
3234
- if (j > 0 && mask[k - 1]) {
3235
- delta += prevVal; // use overflow
3236
- }
3237
- else if (i > 0 && mask[k - width]) {
3238
- delta += resultPixels[k - width];
3239
- }
3240
- else {
3241
- delta += prevVal;
3242
- }
3243
-
3244
- delta &= 0xFF; //overflow
3245
- resultPixels[k] = delta;//overflow
3246
- prevVal = delta;
3247
- }
3248
- else {
3249
- resultPixels[k] = delta;
3250
- }
3251
- }
3252
- }
3253
- }
3254
- }
3255
- }
3256
- }
3257
- else {
3258
- for (k = 0, i = 0; i < height; i++) {
3259
- for (j = 0; j < width; j++) {
3260
- k = i * width + j;
3261
- if (!mask || mask[k]) {
3262
- for (iDim = 0; iDim < numDims; iDim++, k+=numPixels) {
3263
- val = 0;
3264
- valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);
3265
- valTmpQuick = valTmp;
3266
- if (32 - bitPos < numBitsLUTQick) {
3267
- valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));
3268
- valTmpQuick = valTmp;
3269
- }
3270
- if (decodeLut[valTmpQuick])
3271
- {
3272
- val = decodeLut[valTmpQuick][1];
3273
- bitPos += decodeLut[valTmpQuick][0];
3274
- }
3275
- else {
3276
- valTmp = (word << bitPos) >>> (32 - numBitsLUT);
3277
- valTmpQuick = valTmp;
3278
- if (32 - bitPos < numBitsLUT) {
3279
- valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));
3280
- valTmpQuick = valTmp;
3281
- }
3282
- node = tree;
3283
- for (ii = 0; ii < numBitsLUT; ii++) {
3284
- currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;
3285
- node = currentBit ? node.right : node.left;
3286
- if (!(node.left || node.right)) {
3287
- val = node.val;
3288
- bitPos = bitPos + ii + 1;
3289
- break;
3290
- }
3291
- }
3292
- }
3293
-
3294
- if (bitPos >= 32) {
3295
- bitPos -= 32;
3296
- srcPtr++;
3297
- word = stuffedData[srcPtr];
3298
- }
3299
-
3300
- delta = val - offset;
3301
- resultPixels[k] = delta;
3302
- }
3303
- }
3304
- }
3305
- }
3306
- }
3307
- data.ptr = data.ptr + (srcPtr + 1) * 4 + (bitPos > 0 ? 4 : 0);
3308
- data.pixels.resultPixels = resultPixelsAllDim;
3309
- //swap for BIP layout
3310
- if (numDims > 1 && !useBSQForOutputDim) {
3311
- data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(resultPixelsAllDim, numPixels, numDims, OutPixelTypeArray);
3312
- }
3313
- },
3314
-
3315
- decodeBits: function(input, data, blockDataBuffer, offset, iDim) {
3316
- {
3317
- //bitstuff encoding is 3
3318
- var headerInfo = data.headerInfo;
3319
- var fileVersion = headerInfo.fileVersion;
3320
- //var block = {};
3321
- var blockPtr = 0;
3322
- var viewByteLength = ((input.byteLength - data.ptr) >= 5) ? 5 : (input.byteLength - data.ptr);
3323
- var view = new DataView(input, data.ptr, viewByteLength);
3324
- var headerByte = view.getUint8(0);
3325
- blockPtr++;
3326
- var bits67 = headerByte >> 6;
3327
- var n = (bits67 === 0) ? 4 : 3 - bits67;
3328
- var doLut = (headerByte & 32) > 0 ? true : false;//5th bit
3329
- var numBits = headerByte & 31;
3330
- var numElements = 0;
3331
- if (n === 1) {
3332
- numElements = view.getUint8(blockPtr); blockPtr++;
3333
- } else if (n === 2) {
3334
- numElements = view.getUint16(blockPtr, true); blockPtr += 2;
3335
- } else if (n === 4) {
3336
- numElements = view.getUint32(blockPtr, true); blockPtr += 4;
3337
- } else {
3338
- throw "Invalid valid pixel count type";
3339
- }
3340
- //fix: huffman codes are bit stuffed, but not bound by data's max value, so need to use originalUnstuff
3341
- //offset = offset || 0;
3342
- var scale = 2 * headerInfo.maxZError;
3343
- var stuffedData, arrayBuf, store8, dataBytes, dataWords;
3344
- var lutArr, lutData, lutBytes, bitsPerPixel;
3345
- var zMax = headerInfo.numDims > 1 ? headerInfo.maxValues[iDim] : headerInfo.zMax;
3346
- if (doLut) {
3347
- data.counter.lut++;
3348
- lutBytes = view.getUint8(blockPtr);
3349
- blockPtr++;
3350
- dataBytes = Math.ceil((lutBytes - 1) * numBits / 8);
3351
- dataWords = Math.ceil(dataBytes / 4);
3352
- arrayBuf = new ArrayBuffer(dataWords * 4);
3353
- store8 = new Uint8Array(arrayBuf);
3354
-
3355
- data.ptr += blockPtr;
3356
- store8.set(new Uint8Array(input, data.ptr, dataBytes));
3357
-
3358
- lutData = new Uint32Array(arrayBuf);
3359
- data.ptr += dataBytes;
3360
-
3361
- bitsPerPixel = 0;
3362
- while ((lutBytes - 1) >>> bitsPerPixel) {
3363
- bitsPerPixel++;
3364
- }
3365
- dataBytes = Math.ceil(numElements * bitsPerPixel / 8);
3366
- dataWords = Math.ceil(dataBytes / 4);
3367
- arrayBuf = new ArrayBuffer(dataWords * 4);
3368
- store8 = new Uint8Array(arrayBuf);
3369
- store8.set(new Uint8Array(input, data.ptr, dataBytes));
3370
- stuffedData = new Uint32Array(arrayBuf);
3371
- data.ptr += dataBytes;
3372
- if (fileVersion >= 3) {
3373
- lutArr = BitStuffer.unstuffLUT2(lutData, numBits, lutBytes - 1, offset, scale, zMax);
3374
- }
3375
- else {
3376
- lutArr = BitStuffer.unstuffLUT(lutData, numBits, lutBytes - 1, offset, scale, zMax);
3377
- }
3378
- //lutArr.unshift(0);
3379
- if (fileVersion >= 3) {
3380
- //BitStuffer.unstuff2(block, blockDataBuffer, headerInfo.zMax);
3381
- BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr);
3382
- }
3383
- else {
3384
- BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr);
3385
- }
3386
- }
3387
- else {
3388
- //console.debug("bitstuffer");
3389
- data.counter.bitstuffer++;
3390
- bitsPerPixel = numBits;
3391
- data.ptr += blockPtr;
3392
- if (bitsPerPixel > 0) {
3393
- dataBytes = Math.ceil(numElements * bitsPerPixel / 8);
3394
- dataWords = Math.ceil(dataBytes / 4);
3395
- arrayBuf = new ArrayBuffer(dataWords * 4);
3396
- store8 = new Uint8Array(arrayBuf);
3397
- store8.set(new Uint8Array(input, data.ptr, dataBytes));
3398
- stuffedData = new Uint32Array(arrayBuf);
3399
- data.ptr += dataBytes;
3400
- if (fileVersion >= 3) {
3401
- if (offset == null) {
3402
- BitStuffer.originalUnstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements);
3403
- }
3404
- else {
3405
- BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax);
3406
- }
3407
- }
3408
- else {
3409
- if (offset == null) {
3410
- BitStuffer.originalUnstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements);
3411
- }
3412
- else {
3413
- BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax);
3414
- }
3415
- }
3416
- }
3417
- }
3418
- }
3419
-
3420
- },
3421
-
3422
- readTiles: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {
3423
- var headerInfo = data.headerInfo;
3424
- var width = headerInfo.width;
3425
- var height = headerInfo.height;
3426
- var numPixels = width * height;
3427
- var microBlockSize = headerInfo.microBlockSize;
3428
- var imageType = headerInfo.imageType;
3429
- var dataTypeSize = Lerc2Helpers.getDataTypeSize(imageType);
3430
- var numBlocksX = Math.ceil(width / microBlockSize);
3431
- var numBlocksY = Math.ceil(height / microBlockSize);
3432
- data.pixels.numBlocksY = numBlocksY;
3433
- data.pixels.numBlocksX = numBlocksX;
3434
- data.pixels.ptr = 0;
3435
- 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;
3436
- var view, block, arrayBuf, store8, rawData;
3437
- var blockEncoding;
3438
- var blockDataBuffer = new OutPixelTypeArray(microBlockSize * microBlockSize);
3439
- var lastBlockHeight = (height % microBlockSize) || microBlockSize;
3440
- var lastBlockWidth = (width % microBlockSize) || microBlockSize;
3441
- var offsetType, offset;
3442
- var numDims = headerInfo.numDims, iDim;
3443
- var mask = data.pixels.resultMask;
3444
- var resultPixels = data.pixels.resultPixels;
3445
- var fileVersion = headerInfo.fileVersion;
3446
- var fileVersionCheckNum = fileVersion >= 5 ? 14 : 15;
3447
- var isDiffEncoding;
3448
- var zMax = headerInfo.zMax;
3449
- //var resultPixelsAllDim = resultPixels;
3450
- var resultPixelsPrevDim;
3451
- for (blockY = 0; blockY < numBlocksY; blockY++) {
3452
- thisBlockHeight = (blockY !== numBlocksY - 1) ? microBlockSize : lastBlockHeight;
3453
- for (blockX = 0; blockX < numBlocksX; blockX++) {
3454
- //console.debug("y" + blockY + " x" + blockX);
3455
- thisBlockWidth = (blockX !== numBlocksX - 1) ? microBlockSize : lastBlockWidth;
3456
-
3457
- outPtr = blockY * width * microBlockSize + blockX * microBlockSize;
3458
- outStride = width - thisBlockWidth;
3459
-
3460
- for (iDim = 0; iDim < numDims; iDim++) {
3461
- if (numDims > 1) {
3462
- resultPixelsPrevDim = resultPixels;
3463
- outPtr = blockY * width * microBlockSize + blockX * microBlockSize;
3464
- resultPixels = new OutPixelTypeArray(data.pixels.resultPixels.buffer, numPixels * iDim * dataTypeSize, numPixels);
3465
- zMax = headerInfo.maxValues[iDim];
3466
- } else {
3467
- resultPixelsPrevDim = null;
3468
- }
3469
- bytesLeft = input.byteLength - data.ptr;
3470
- view = new DataView(input, data.ptr, Math.min(10, bytesLeft));
3471
- block = {};
3472
- blockPtr = 0;
3473
- headerByte = view.getUint8(0);
3474
- blockPtr++;
3475
- isDiffEncoding = headerInfo.fileVersion >= 5 ? headerByte & 4 : 0;
3476
- bits67 = (headerByte >> 6) & 0xFF;
3477
- testCode = (headerByte >> 2) & fileVersionCheckNum; // use bits 2345 for integrity check
3478
- if (testCode !== (((blockX * microBlockSize) >> 3) & fileVersionCheckNum)) {
3479
- throw "integrity issue";
3480
- }
3481
-
3482
- if (isDiffEncoding && iDim === 0) {
3483
- throw "integrity issue";
3484
- }
3485
-
3486
- blockEncoding = headerByte & 3;
3487
- if (blockEncoding > 3) {
3488
- data.ptr += blockPtr;
3489
- throw "Invalid block encoding (" + blockEncoding + ")";
3490
- }
3491
- else if (blockEncoding === 2) { //constant 0
3492
- if (isDiffEncoding) {
3493
- if (mask) {
3494
- for (row = 0; row < thisBlockHeight; row++) {
3495
- for (col = 0; col < thisBlockWidth; col++) {
3496
- if (mask[outPtr]) {
3497
- resultPixels[outPtr] = resultPixelsPrevDim[outPtr];
3498
- }
3499
- outPtr++;
3500
- }
3501
- }
3502
- }
3503
- else {
3504
- for (row = 0; row < thisBlockHeight; row++) {
3505
- for (col = 0; col < thisBlockWidth; col++) {
3506
- resultPixels[outPtr] = resultPixelsPrevDim[outPtr];
3507
- outPtr++;
3508
- }
3509
- }
3510
- }
3511
- }
3512
- data.counter.constant++;
3513
- data.ptr += blockPtr;
3514
- continue;
3515
- }
3516
- else if (blockEncoding === 0) { //uncompressed
3517
- if (isDiffEncoding) {
3518
- // doesn't make sense, should not happen
3519
- throw "integrity issue";
3520
- }
3521
- data.counter.uncompressed++;
3522
- data.ptr += blockPtr;
3523
- numBytes = thisBlockHeight * thisBlockWidth * dataTypeSize;
3524
- bytesleft = input.byteLength - data.ptr;
3525
- numBytes = numBytes < bytesleft ? numBytes : bytesleft;
3526
- //bit alignment
3527
- arrayBuf = new ArrayBuffer((numBytes % dataTypeSize) === 0 ? numBytes : (numBytes + dataTypeSize - numBytes % dataTypeSize));
3528
- store8 = new Uint8Array(arrayBuf);
3529
- store8.set(new Uint8Array(input, data.ptr, numBytes));
3530
- rawData = new OutPixelTypeArray(arrayBuf);
3531
- z = 0;
3532
- if (mask) {
3533
- for (row = 0; row < thisBlockHeight; row++) {
3534
- for (col = 0; col < thisBlockWidth; col++) {
3535
- if (mask[outPtr]) {
3536
- resultPixels[outPtr] = rawData[z++];
3537
- }
3538
- outPtr++;
3539
- }
3540
- outPtr += outStride;
3541
- }
3542
- }
3543
- else {//all valid
3544
- for (row = 0; row < thisBlockHeight; row++) {
3545
- for (col = 0; col < thisBlockWidth; col++) {
3546
- resultPixels[outPtr++] = rawData[z++];
3547
- }
3548
- outPtr += outStride;
3549
- }
3550
- }
3551
- data.ptr += z * dataTypeSize;
3552
- }
3553
- else { //1 or 3
3554
- offsetType = Lerc2Helpers.getDataTypeUsed((isDiffEncoding && imageType < 6) ? 4 : imageType, bits67);
3555
- offset = Lerc2Helpers.getOnePixel(block, blockPtr, offsetType, view);
3556
- blockPtr += Lerc2Helpers.getDataTypeSize(offsetType);
3557
- if (blockEncoding === 3) //constant offset value
3558
- {
3559
- data.ptr += blockPtr;
3560
- data.counter.constantoffset++;
3561
- //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.
3562
- //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
3563
- if (mask) {
3564
- for (row = 0; row < thisBlockHeight; row++) {
3565
- for (col = 0; col < thisBlockWidth; col++) {
3566
- if (mask[outPtr]) {
3567
- resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset;
3568
- }
3569
- outPtr++;
3570
- }
3571
- outPtr += outStride;
3572
- }
3573
- }
3574
- else {
3575
- for (row = 0; row < thisBlockHeight; row++) {
3576
- for (col = 0; col < thisBlockWidth; col++) {
3577
- resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset;
3578
- outPtr++;
3579
- }
3580
- outPtr += outStride;
3581
- }
3582
- }
3583
- }
3584
- else { //bitstuff encoding is 3
3585
- data.ptr += blockPtr;
3586
- //heavy lifting
3587
- Lerc2Helpers.decodeBits(input, data, blockDataBuffer, offset, iDim);
3588
- blockPtr = 0;
3589
- // duplicate code to favor performance, diff encoding is for multidimension only
3590
- if (isDiffEncoding) {
3591
- if (mask) {
3592
- for (row = 0; row < thisBlockHeight; row++) {
3593
- for (col = 0; col < thisBlockWidth; col++) {
3594
- if (mask[outPtr]) {
3595
- resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr];
3596
- }
3597
- outPtr++;
3598
- }
3599
- outPtr += outStride;
3600
- }
3601
- }
3602
- else {
3603
- for (row = 0; row < thisBlockHeight; row++) {
3604
- for (col = 0; col < thisBlockWidth; col++) {
3605
- resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr];
3606
- outPtr++;
3607
- }
3608
- outPtr += outStride;
3609
- }
3610
- }
3611
- }
3612
- else if (mask) {
3613
- for (row = 0; row < thisBlockHeight; row++) {
3614
- for (col = 0; col < thisBlockWidth; col++) {
3615
- if (mask[outPtr]) {
3616
- resultPixels[outPtr] = blockDataBuffer[blockPtr++];
3617
- }
3618
- outPtr++;
3619
- }
3620
- outPtr += outStride;
3621
- }
3622
- }
3623
- else {
3624
- for (row = 0; row < thisBlockHeight; row++) {
3625
- for (col = 0; col < thisBlockWidth; col++) {
3626
- resultPixels[outPtr++] = blockDataBuffer[blockPtr++];
3627
- }
3628
- outPtr += outStride;
3629
- }
3630
- }
3631
- }
3632
- }
3633
- }
3634
- }
3635
- }
3636
- //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
3637
- if (numDims > 1 && !useBSQForOutputDim) {
3638
- data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(data.pixels.resultPixels, numPixels, numDims, OutPixelTypeArray);
3639
- }
3640
- },
3641
-
3642
- /*****************
3643
- * private methods (helper methods)
3644
- *****************/
3645
-
3646
- formatFileInfo: function(data) {
3647
- return {
3648
- "fileIdentifierString": data.headerInfo.fileIdentifierString,
3649
- "fileVersion": data.headerInfo.fileVersion,
3650
- "imageType": data.headerInfo.imageType,
3651
- "height": data.headerInfo.height,
3652
- "width": data.headerInfo.width,
3653
- "numValidPixel": data.headerInfo.numValidPixel,
3654
- "microBlockSize": data.headerInfo.microBlockSize,
3655
- "blobSize": data.headerInfo.blobSize,
3656
- "maxZError": data.headerInfo.maxZError,
3657
- "pixelType": Lerc2Helpers.getPixelType(data.headerInfo.imageType),
3658
- "eofOffset": data.eofOffset,
3659
- "mask": data.mask ? {
3660
- "numBytes": data.mask.numBytes
3661
- } : null,
3662
- "pixels": {
3663
- "numBlocksX": data.pixels.numBlocksX,
3664
- "numBlocksY": data.pixels.numBlocksY,
3665
- //"numBytes": data.pixels.numBytes,
3666
- "maxValue": data.headerInfo.zMax,
3667
- "minValue": data.headerInfo.zMin,
3668
- "noDataValue": data.noDataValue
3669
- }
3670
- };
3671
- },
3672
-
3673
- constructConstantSurface: function(data, useBSQForOutputDim) {
3674
- var val = data.headerInfo.zMax;
3675
- var valMin = data.headerInfo.zMin;
3676
- var maxValues = data.headerInfo.maxValues;
3677
- var numDims = data.headerInfo.numDims;
3678
- var numPixels = data.headerInfo.height * data.headerInfo.width;
3679
- var i = 0, k = 0, nStart = 0;
3680
- var mask = data.pixels.resultMask;
3681
- var resultPixels = data.pixels.resultPixels;
3682
- if (mask) {
3683
- if (numDims > 1) {
3684
- if (useBSQForOutputDim) {
3685
- for (i = 0; i < numDims; i++) {
3686
- nStart = i * numPixels;
3687
- val = maxValues[i];
3688
- for (k = 0; k < numPixels; k++) {
3689
- if (mask[k]) {
3690
- resultPixels[nStart + k] = val;
3691
- }
3692
- }
3693
- }
3694
- }
3695
- else {
3696
- for (k = 0; k < numPixels; k++) {
3697
- if (mask[k]) {
3698
- nStart = k * numDims;
3699
- for (i = 0; i < numDims; i++) {
3700
- resultPixels[nStart + numDims] = maxValues[i];
3701
- }
3702
- }
3703
- }
3704
- }
3705
- }
3706
- else {
3707
- for (k = 0; k < numPixels; k++) {
3708
- if (mask[k]) {
3709
- resultPixels[k] = val;
3710
- }
3711
- }
3712
- }
3713
- }
3714
- else {
3715
- if (numDims > 1 && valMin !== val) {
3716
- if (useBSQForOutputDim) {
3717
- for (i = 0; i < numDims; i++) {
3718
- nStart = i * numPixels;
3719
- val = maxValues[i];
3720
- for (k = 0; k < numPixels; k++) {
3721
- resultPixels[nStart + k] = val;
3722
- }
3723
- }
3724
- }
3725
- else {
3726
- for (k = 0; k < numPixels; k++) {
3727
- nStart = k * numDims;
3728
- for (i = 0; i < numDims; i++) {
3729
- resultPixels[nStart + i] = maxValues[i];
3730
- }
3731
- }
3732
- }
3733
- }
3734
- else {
3735
- for (k = 0; k < numPixels * numDims; k++) {
3736
- resultPixels[k] = val;
3737
- }
3738
- }
3739
- }
3740
- return;
3741
- },
3742
-
3743
- getDataTypeArray: function(t) {
3744
- var tp;
3745
- switch (t) {
3746
- case 0: //char
3747
- tp = Int8Array;
3748
- break;
3749
- case 1: //byte
3750
- tp = Uint8Array;
3751
- break;
3752
- case 2: //short
3753
- tp = Int16Array;
3754
- break;
3755
- case 3: //ushort
3756
- tp = Uint16Array;
3757
- break;
3758
- case 4:
3759
- tp = Int32Array;
3760
- break;
3761
- case 5:
3762
- tp = Uint32Array;
3763
- break;
3764
- case 6:
3765
- tp = Float32Array;
3766
- break;
3767
- case 7:
3768
- tp = Float64Array;
3769
- break;
3770
- default:
3771
- tp = Float32Array;
3772
- }
3773
- return tp;
3774
- },
3775
-
3776
- getPixelType: function(t) {
3777
- var tp;
3778
- switch (t) {
3779
- case 0: //char
3780
- tp = "S8";
3781
- break;
3782
- case 1: //byte
3783
- tp = "U8";
3784
- break;
3785
- case 2: //short
3786
- tp = "S16";
3787
- break;
3788
- case 3: //ushort
3789
- tp = "U16";
3790
- break;
3791
- case 4:
3792
- tp = "S32";
3793
- break;
3794
- case 5:
3795
- tp = "U32";
3796
- break;
3797
- case 6:
3798
- tp = "F32";
3799
- break;
3800
- case 7:
3801
- tp = "F64";
3802
- break;
3803
- default:
3804
- tp = "F32";
3805
- }
3806
- return tp;
3807
- },
3808
-
3809
- isValidPixelValue: function(t, val) {
3810
- if (val == null) {
3811
- return false;
3812
- }
3813
- var isValid;
3814
- switch (t) {
3815
- case 0: //char
3816
- isValid = val >= -128 && val <= 127;
3817
- break;
3818
- case 1: //byte (unsigned char)
3819
- isValid = val >= 0 && val <= 255;
3820
- break;
3821
- case 2: //short
3822
- isValid = val >= -32768 && val <= 32767;
3823
- break;
3824
- case 3: //ushort
3825
- isValid = val >= 0 && val <= 65536;
3826
- break;
3827
- case 4: //int 32
3828
- isValid = val >= -2147483648 && val <= 2147483647;
3829
- break;
3830
- case 5: //uinit 32
3831
- isValid = val >= 0 && val <= 4294967296;
3832
- break;
3833
- case 6:
3834
- isValid = val >= -34027999387901484e22 && val <= 3.4027999387901484e+38;
3835
- break;
3836
- case 7:
3837
- isValid = val >= -17976931348623157e292 && val <= 1.7976931348623157e+308;
3838
- break;
3839
- default:
3840
- isValid = false;
3841
- }
3842
- return isValid;
3843
- },
3844
-
3845
- getDataTypeSize: function(t) {
3846
- var s = 0;
3847
- switch (t) {
3848
- case 0: //ubyte
3849
- case 1: //byte
3850
- s = 1;
3851
- break;
3852
- case 2: //short
3853
- case 3: //ushort
3854
- s = 2;
3855
- break;
3856
- case 4:
3857
- case 5:
3858
- case 6:
3859
- s = 4;
3860
- break;
3861
- case 7:
3862
- s = 8;
3863
- break;
3864
- default:
3865
- s = t;
3866
- }
3867
- return s;
3868
- },
3869
-
3870
- getDataTypeUsed: function(dt, tc) {
3871
- var t = dt;
3872
- switch (dt) {
3873
- case 2: //short
3874
- case 4: //long
3875
- t = dt - tc;
3876
- break;
3877
- case 3: //ushort
3878
- case 5: //ulong
3879
- t = dt - 2 * tc;
3880
- break;
3881
- case 6: //float
3882
- if (0 === tc) {
3883
- t = dt;
3884
- }
3885
- else if (1 === tc) {
3886
- t = 2;
3887
- }
3888
- else {
3889
- t = 1;//byte
3890
- }
3891
- break;
3892
- case 7: //double
3893
- if (0 === tc) {
3894
- t = dt;
3895
- }
3896
- else {
3897
- t = dt - 2 * tc + 1;
3898
- }
3899
- break;
3900
- default:
3901
- t = dt;
3902
- break;
3903
- }
3904
- return t;
3905
- },
3906
-
3907
- getOnePixel: function(block, blockPtr, offsetType, view) {
3908
- var temp = 0;
3909
- switch (offsetType) {
3910
- case 0: //char
3911
- temp = view.getInt8(blockPtr);
3912
- break;
3913
- case 1: //byte
3914
- temp = view.getUint8(blockPtr);
3915
- break;
3916
- case 2:
3917
- temp = view.getInt16(blockPtr, true);
3918
- break;
3919
- case 3:
3920
- temp = view.getUint16(blockPtr, true);
3921
- break;
3922
- case 4:
3923
- temp = view.getInt32(blockPtr, true);
3924
- break;
3925
- case 5:
3926
- temp = view.getUInt32(blockPtr, true);
3927
- break;
3928
- case 6:
3929
- temp = view.getFloat32(blockPtr, true);
3930
- break;
3931
- case 7:
3932
- temp = view.getFloat64(blockPtr, true);
3933
- break;
3934
- default:
3935
- throw ("the decoder does not understand this pixel type");
3936
- }
3937
- return temp;
3938
- },
3939
-
3940
- swapDimensionOrder: function(pixels, numPixels, numDims, OutPixelTypeArray, inputIsBIP) {
3941
- var i = 0, j = 0, iDim = 0, temp = 0, swap = pixels;
3942
- if (numDims > 1) {
3943
- swap = new OutPixelTypeArray(numPixels * numDims);
3944
- if (inputIsBIP) {
3945
- for (i=0; i<numPixels; i++) {
3946
- temp = i;
3947
- for (iDim=0; iDim < numDims; iDim++, temp += numPixels) {
3948
- swap[temp] = pixels[j++];
3949
- }
3950
- }
3951
- }
3952
- else {
3953
- for (i=0; i<numPixels; i++) {
3954
- temp = i;
3955
- for (iDim=0; iDim < numDims; iDim++, temp += numPixels) {
3956
- swap[j++] = pixels[temp];
3957
- }
3958
- }
3959
- }
3960
- }
3961
- return swap;
3962
- }
3963
- };
3964
-
3965
- /***************************************************
3966
- *private class for a tree node. Huffman code is in Lerc2Helpers
3967
- ****************************************************/
3968
- var TreeNode = function(val, left, right) {
3969
- this.val = val;
3970
- this.left = left;
3971
- this.right = right;
3972
- };
3973
-
3974
- var Lerc2Decode = {
3975
- /*
3976
- * ********removed options compared to LERC1. We can bring some of them back if needed.
3977
- * removed pixel type. LERC2 is typed and doesn't require user to give pixel type
3978
- * changed encodedMaskData to maskData. LERC2 's js version make it faster to use maskData directly.
3979
- * 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.
3980
- * removed nodatavalue. Because LERC2 pixels are typed, nodatavalue will sacrify a useful value for many types (8bit, 16bit) etc,
3981
- * user has to be knowledgable enough about raster and their data to avoid usability issues. so nodata value is simply removed now.
3982
- * We can add it back later if their's a clear requirement.
3983
- * removed encodedMask. This option was not implemented in LercDecode. It can be done after decoding (less efficient)
3984
- * removed computeUsedBitDepths.
3985
- *
3986
- *
3987
- * response changes compared to LERC1
3988
- * 1. encodedMaskData is not available
3989
- * 2. noDataValue is optional (returns only if user's noDataValue is with in the valid data type range)
3990
- * 3. maskData is always available
3991
- */
3992
- /*****************
3993
- * public properties
3994
- ******************/
3995
- //HUFFMAN_LUT_BITS_MAX: 12, //use 2^12 lut, not configurable
3996
-
3997
- /*****************
3998
- * public methods
3999
- *****************/
4000
-
4001
- /**
4002
- * Decode a LERC2 byte stream and return an object containing the pixel data and optional metadata.
4003
- *
4004
- * @param {ArrayBuffer} input The LERC input byte stream
4005
- * @param {object} [options] options Decoding options
4006
- * @param {number} [options.inputOffset] The number of bytes to skip in the input byte stream. A valid LERC file is expected at that position
4007
- * @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
4008
- * @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...]
4009
- */
4010
- decode: function(/*byte array*/ input, /*object*/ options) {
4011
- //currently there's a bug in the sparse array, so please do not set to false
4012
- options = options || {};
4013
- var noDataValue = options.noDataValue;
4014
-
4015
- //initialize
4016
- var i = 0, data = {};
4017
- data.ptr = options.inputOffset || 0;
4018
- data.pixels = {};
4019
-
4020
- // File header
4021
- if (!Lerc2Helpers.readHeaderInfo(input, data)) {
4022
- return;
4023
- }
4024
-
4025
- var headerInfo = data.headerInfo;
4026
- var fileVersion = headerInfo.fileVersion;
4027
- var OutPixelTypeArray = Lerc2Helpers.getDataTypeArray(headerInfo.imageType);
4028
-
4029
- // version check
4030
- if (fileVersion > 5) {
4031
- throw "unsupported lerc version 2." + fileVersion;
4032
- }
4033
-
4034
- // Mask Header
4035
- Lerc2Helpers.readMask(input, data);
4036
- if (headerInfo.numValidPixel !== headerInfo.width * headerInfo.height && !data.pixels.resultMask) {
4037
- data.pixels.resultMask = options.maskData;
4038
- }
4039
-
4040
- var numPixels = headerInfo.width * headerInfo.height;
4041
- data.pixels.resultPixels = new OutPixelTypeArray(numPixels * headerInfo.numDims);
4042
-
4043
- data.counter = {
4044
- onesweep: 0,
4045
- uncompressed: 0,
4046
- lut: 0,
4047
- bitstuffer: 0,
4048
- constant: 0,
4049
- constantoffset: 0
4050
- };
4051
- var useBSQForOutputDim = !options.returnPixelInterleavedDims;
4052
- if (headerInfo.numValidPixel !== 0) {
4053
- //not tested
4054
- if (headerInfo.zMax === headerInfo.zMin) //constant surface
4055
- {
4056
- Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim);
4057
- }
4058
- else if (fileVersion >= 4 && Lerc2Helpers.checkMinMaxRanges(input, data)) {
4059
- Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim);
4060
- }
4061
- else {
4062
- var view = new DataView(input, data.ptr, 2);
4063
- var bReadDataOneSweep = view.getUint8(0);
4064
- data.ptr++;
4065
- if (bReadDataOneSweep) {
4066
- //console.debug("OneSweep");
4067
- Lerc2Helpers.readDataOneSweep(input, data, OutPixelTypeArray, useBSQForOutputDim);
4068
- }
4069
- else {
4070
- //lerc2.1: //bitstuffing + lut
4071
- //lerc2.2: //bitstuffing + lut + huffman
4072
- //lerc2.3: new bitstuffer
4073
- if (fileVersion > 1 && headerInfo.imageType <= 1 && Math.abs(headerInfo.maxZError - 0.5) < 0.00001) {
4074
- //this is 2.x plus 8 bit (unsigned and signed) data, possiblity of Huffman
4075
- var flagHuffman = view.getUint8(1);
4076
- data.ptr++;
4077
- data.encodeMode = flagHuffman;
4078
- if (flagHuffman > 2 || (fileVersion < 4 && flagHuffman > 1)) {
4079
- throw "Invalid Huffman flag " + flagHuffman;
4080
- }
4081
- if (flagHuffman) {//1 - delta Huffman, 2 - Huffman
4082
- //console.log("Huffman");
4083
- Lerc2Helpers.readHuffman(input, data, OutPixelTypeArray, useBSQForOutputDim);
4084
- }
4085
- else {
4086
- //console.log("Tiles");
4087
- Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim);
4088
- }
4089
- }
4090
- else { //lerc2.x non-8 bit data
4091
- //console.log("Tiles");
4092
- Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim);
4093
- }
4094
- }
4095
- }
4096
- }
4097
-
4098
- data.eofOffset = data.ptr;
4099
- var diff;
4100
- if (options.inputOffset) {
4101
- diff = data.headerInfo.blobSize + options.inputOffset - data.ptr;
4102
- if (Math.abs(diff) >= 1) {
4103
- //console.debug("incorrect eof: dataptr " + data.ptr + " offset " + options.inputOffset + " blobsize " + data.headerInfo.blobSize + " diff: " + diff);
4104
- data.eofOffset = options.inputOffset + data.headerInfo.blobSize;
4105
- }
4106
- }
4107
- else {
4108
- diff = data.headerInfo.blobSize - data.ptr;
4109
- if (Math.abs(diff) >= 1) {
4110
- //console.debug("incorrect first band eof: dataptr " + data.ptr + " blobsize " + data.headerInfo.blobSize + " diff: " + diff);
4111
- data.eofOffset = data.headerInfo.blobSize;
4112
- }
4113
- }
4114
-
4115
- var result = {
4116
- width: headerInfo.width,
4117
- height: headerInfo.height,
4118
- pixelData: data.pixels.resultPixels,
4119
- minValue: headerInfo.zMin,
4120
- maxValue: headerInfo.zMax,
4121
- validPixelCount: headerInfo.numValidPixel,
4122
- dimCount: headerInfo.numDims,
4123
- dimStats: {
4124
- minValues: headerInfo.minValues,
4125
- maxValues: headerInfo.maxValues
4126
- },
4127
- maskData: data.pixels.resultMask
4128
- //noDataValue: noDataValue
4129
- };
4130
-
4131
- //we should remove this if there's no existing client
4132
- //optional noDataValue processing, it's user's responsiblity
4133
- if (data.pixels.resultMask && Lerc2Helpers.isValidPixelValue(headerInfo.imageType, noDataValue)) {
4134
- var mask = data.pixels.resultMask;
4135
- for (i = 0; i < numPixels; i++) {
4136
- if (!mask[i]) {
4137
- result.pixelData[i] = noDataValue;
4138
- }
4139
- }
4140
- result.noDataValue = noDataValue;
4141
- }
4142
- data.noDataValue = noDataValue;
4143
- if (options.returnFileInfo) {
4144
- result.fileInfo = Lerc2Helpers.formatFileInfo(data);
4145
- }
4146
- return result;
4147
- },
4148
-
4149
- getBandCount: function(/*byte array*/ input) {
4150
- var count = 0;
4151
- var i = 0;
4152
- var temp = {};
4153
- temp.ptr = 0;
4154
- temp.pixels = {};
4155
- while (i < input.byteLength - 58) {
4156
- Lerc2Helpers.readHeaderInfo(input, temp);
4157
- i += temp.headerInfo.blobSize;
4158
- count++;
4159
- temp.ptr = i;
4160
- }
4161
- return count;
4162
- }
4163
- };
4164
-
4165
- return Lerc2Decode;
4166
- })();
4167
-
4168
- var isPlatformLittleEndian = (function() {
4169
- var a = new ArrayBuffer(4);
4170
- var b = new Uint8Array(a);
4171
- var c = new Uint32Array(a);
4172
- c[0] = 1;
4173
- return b[0] === 1;
4174
- })();
4175
-
4176
- var Lerc = {
4177
- /************wrapper**********************************************/
4178
- /**
4179
- * A wrapper for decoding both LERC1 and LERC2 byte streams capable of handling multiband pixel blocks for various pixel types.
4180
- *
4181
- * @alias module:Lerc
4182
- * @param {ArrayBuffer} input The LERC input byte stream
4183
- * @param {object} [options] The decoding options below are optional.
4184
- * @param {number} [options.inputOffset] The number of bytes to skip in the input byte stream. A valid Lerc file is expected at that position.
4185
- * @param {string} [options.pixelType] (LERC1 only) Default value is F32. Valid pixel types for input are U8/S8/S16/U16/S32/U32/F32.
4186
- * @param {number} [options.noDataValue] (LERC1 only). It is recommended to use the returned mask instead of setting this value.
4187
- * @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...]
4188
- * @returns {{width, height, pixels, pixelType, mask, statistics}}
4189
- * @property {number} width Width of decoded image.
4190
- * @property {number} height Height of decoded image.
4191
- * @property {array} pixels [band1, band2, …] Each band is a typed array of width*height.
4192
- * @property {string} pixelType The type of pixels represented in the output.
4193
- * @property {mask} mask Typed array with a size of width*height, or null if all pixels are valid.
4194
- * @property {array} statistics [statistics_band1, statistics_band2, …] Each element is a statistics object representing min and max values
4195
- **/
4196
- decode: function(encodedData, options) {
4197
- if (!isPlatformLittleEndian) {
4198
- throw "Big endian system is not supported.";
4199
- }
4200
- options = options || {};
4201
- var inputOffset = options.inputOffset || 0;
4202
- var fileIdView = new Uint8Array(encodedData, inputOffset, 10);
4203
- var fileIdentifierString = String.fromCharCode.apply(null, fileIdView);
4204
- var lerc, majorVersion;
4205
- if (fileIdentifierString.trim() === "CntZImage") {
4206
- lerc = LercDecode;
4207
- majorVersion = 1;
4208
- }
4209
- else if (fileIdentifierString.substring(0, 5) === "Lerc2") {
4210
- lerc = Lerc2Decode;
4211
- majorVersion = 2;
4212
- }
4213
- else {
4214
- throw "Unexpected file identifier string: " + fileIdentifierString;
4215
- }
4216
-
4217
- var iPlane = 0, eof = encodedData.byteLength - 10, encodedMaskData, bandMasks = [], bandMask, maskData;
4218
- var decodedPixelBlock = {
4219
- width: 0,
4220
- height: 0,
4221
- pixels: [],
4222
- pixelType: options.pixelType,
4223
- mask: null,
4224
- statistics: []
4225
- };
4226
- var uniqueBandMaskCount = 0;
4227
-
4228
- while (inputOffset < eof) {
4229
- var result = lerc.decode(encodedData, {
4230
- inputOffset: inputOffset,//for both lerc1 and lerc2
4231
- encodedMaskData: encodedMaskData,//lerc1 only
4232
- maskData: maskData,//lerc2 only
4233
- returnMask: iPlane === 0 ? true : false,//lerc1 only
4234
- returnEncodedMask: iPlane === 0 ? true : false,//lerc1 only
4235
- returnFileInfo: true,//for both lerc1 and lerc2
4236
- returnPixelInterleavedDims: options.returnPixelInterleavedDims,//for ndim lerc2 only
4237
- pixelType: options.pixelType || null,//lerc1 only
4238
- noDataValue: options.noDataValue || null//lerc1 only
4239
- });
4240
-
4241
- inputOffset = result.fileInfo.eofOffset;
4242
- maskData = result.maskData;//lerc2
4243
- if (iPlane === 0) {
4244
- encodedMaskData = result.encodedMaskData;//lerc1
4245
- decodedPixelBlock.width = result.width;
4246
- decodedPixelBlock.height = result.height;
4247
- decodedPixelBlock.dimCount = result.dimCount || 1;
4248
- //decodedPixelBlock.dimStats = decodedPixelBlock.dimStats;
4249
- decodedPixelBlock.pixelType = result.pixelType || result.fileInfo.pixelType;
4250
- decodedPixelBlock.mask = maskData;
4251
- }
4252
- if (majorVersion > 1) {
4253
- if (maskData) {
4254
- bandMasks.push(maskData);
4255
- }
4256
- if (result.fileInfo.mask && result.fileInfo.mask.numBytes > 0) {
4257
- uniqueBandMaskCount++;
4258
- }
4259
- }
4260
-
4261
- iPlane++;
4262
- decodedPixelBlock.pixels.push(result.pixelData);
4263
- decodedPixelBlock.statistics.push({
4264
- minValue: result.minValue,
4265
- maxValue: result.maxValue,
4266
- noDataValue: result.noDataValue,
4267
- dimStats: result.dimStats
4268
- });
4269
- }
4270
- var i, j, numPixels;
4271
- if (majorVersion > 1 && uniqueBandMaskCount > 1) {
4272
- numPixels = decodedPixelBlock.width * decodedPixelBlock.height;
4273
- decodedPixelBlock.bandMasks = bandMasks;
4274
- maskData = new Uint8Array(numPixels);
4275
- maskData.set(bandMasks[0]);
4276
- for (i = 1; i < bandMasks.length; i++) {
4277
- bandMask = bandMasks[i];
4278
- for (j = 0; j < numPixels; j++) {
4279
- maskData[j] = maskData[j] & bandMask[j];
4280
- }
4281
- }
4282
- decodedPixelBlock.maskData = maskData;
4283
- }
4284
-
4285
- return decodedPixelBlock;
4286
- }
4287
- };
4288
-
4289
- if (module.exports) {/* jshint ignore:line */
4290
- //commonJS module 1.0/1.1/1.1.1 systems, such as nodeJS
4291
- //http://wiki.commonjs.org/wiki/Modules
4292
- module.exports = Lerc;/* jshint ignore:line */
4293
- }
4294
- else {
4295
- //assign to this, most likely window
4296
- this.Lerc = Lerc;
4297
- }
4298
-
4299
- })();
4300
- } (LercDecode));
4301
- return LercDecode.exports;
4302
- }
4303
-
4304
- var LercDecodeExports = requireLercDecode();
4305
-
4306
- let init;
4307
- let instance;
4308
- let heap;
4309
- const IMPORT_OBJECT = {
4310
- env: {
4311
- emscripten_notify_memory_growth: function (index) {
4312
- heap = new Uint8Array(instance.exports.memory.buffer);
4313
- }
4314
- }
4315
- };
4316
- /**
4317
- * ZSTD (Zstandard) decoder.
4318
- */
4319
- class ZSTDDecoder {
4320
- init() {
4321
- if (init) return init;
4322
- if (typeof fetch !== 'undefined') {
4323
- // Web.
4324
- init = fetch('data:application/wasm;base64,' + wasm).then(response => response.arrayBuffer()).then(arrayBuffer => WebAssembly.instantiate(arrayBuffer, IMPORT_OBJECT)).then(this._init);
4325
- } else {
4326
- // Node.js.
4327
- init = WebAssembly.instantiate(Buffer.from(wasm, 'base64'), IMPORT_OBJECT).then(this._init);
4328
- }
4329
- return init;
4330
- }
4331
- _init(result) {
4332
- instance = result.instance;
4333
- IMPORT_OBJECT.env.emscripten_notify_memory_growth(0); // initialize heap.
4334
- }
4335
-
4336
- decode(array, uncompressedSize = 0) {
4337
- if (!instance) throw new Error(`ZSTDDecoder: Await .init() before decoding.`);
4338
- // Write compressed data into WASM memory.
4339
- const compressedSize = array.byteLength;
4340
- const compressedPtr = instance.exports.malloc(compressedSize);
4341
- heap.set(array, compressedPtr);
4342
- // Decompress into WASM memory.
4343
- uncompressedSize = uncompressedSize || Number(instance.exports.ZSTD_findDecompressedSize(compressedPtr, compressedSize));
4344
- const uncompressedPtr = instance.exports.malloc(uncompressedSize);
4345
- const actualSize = instance.exports.ZSTD_decompress(uncompressedPtr, uncompressedSize, compressedPtr, compressedSize);
4346
- // Read decompressed data and free WASM memory.
4347
- const dec = heap.slice(uncompressedPtr, uncompressedPtr + actualSize);
4348
- instance.exports.free(compressedPtr);
4349
- instance.exports.free(uncompressedPtr);
4350
- return dec;
4351
- }
4352
- }
4353
- /**
4354
- * BSD License
4355
- *
4356
- * For Zstandard software
4357
- *
4358
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc. All rights reserved.
4359
- *
4360
- * Redistribution and use in source and binary forms, with or without modification,
4361
- * are permitted provided that the following conditions are met:
4362
- *
4363
- * * Redistributions of source code must retain the above copyright notice, this
4364
- * list of conditions and the following disclaimer.
4365
- *
4366
- * * Redistributions in binary form must reproduce the above copyright notice,
4367
- * this list of conditions and the following disclaimer in the documentation
4368
- * and/or other materials provided with the distribution.
4369
- *
4370
- * * Neither the name Facebook nor the names of its contributors may be used to
4371
- * endorse or promote products derived from this software without specific
4372
- * prior written permission.
4373
- *
4374
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
4375
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
4376
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
4377
- * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
4378
- * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
4379
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
4380
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
4381
- * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
4382
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
4383
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
4384
- */
4385
- // wasm:begin
4386
- const wasm = 'AGFzbQEAAAABpQEVYAF/AX9gAn9/AGADf39/AX9gBX9/f39/AX9gAX8AYAJ/fwF/YAR/f39/AX9gA39/fwBgBn9/f39/fwF/YAd/f39/f39/AX9gAn9/AX5gAn5+AX5gAABgBX9/f39/AGAGf39/f39/AGAIf39/f39/f38AYAl/f39/f39/f38AYAABf2AIf39/f39/f38Bf2ANf39/f39/f39/f39/fwF/YAF/AX4CJwEDZW52H2Vtc2NyaXB0ZW5fbm90aWZ5X21lbW9yeV9ncm93dGgABANpaAEFAAAFAgEFCwACAQABAgIFBQcAAwABDgsBAQcAEhMHAAUBDAQEAAANBwQCAgYCBAgDAwMDBgEACQkHBgICAAYGAgQUBwYGAwIGAAMCAQgBBwUGCgoEEQAEBAEIAwgDBQgDEA8IAAcABAUBcAECAgUEAQCAAgYJAX8BQaCgwAILB2AHBm1lbW9yeQIABm1hbGxvYwAoBGZyZWUAJgxaU1REX2lzRXJyb3IAaBlaU1REX2ZpbmREZWNvbXByZXNzZWRTaXplAFQPWlNURF9kZWNvbXByZXNzAEoGX3N0YXJ0ACQJBwEAQQELASQKussBaA8AIAAgACgCBCABajYCBAsZACAAKAIAIAAoAgRBH3F0QQAgAWtBH3F2CwgAIABBiH9LC34BBH9BAyEBIAAoAgQiA0EgTQRAIAAoAggiASAAKAIQTwRAIAAQDQ8LIAAoAgwiAiABRgRAQQFBAiADQSBJGw8LIAAgASABIAJrIANBA3YiBCABIARrIAJJIgEbIgJrIgQ2AgggACADIAJBA3RrNgIEIAAgBCgAADYCAAsgAQsUAQF/IAAgARACIQIgACABEAEgAgv3AQECfyACRQRAIABCADcCACAAQQA2AhAgAEIANwIIQbh/DwsgACABNgIMIAAgAUEEajYCECACQQRPBEAgACABIAJqIgFBfGoiAzYCCCAAIAMoAAA2AgAgAUF/ai0AACIBBEAgAEEIIAEQFGs2AgQgAg8LIABBADYCBEF/DwsgACABNgIIIAAgAS0AACIDNgIAIAJBfmoiBEEBTQRAIARBAWtFBEAgACABLQACQRB0IANyIgM2AgALIAAgAS0AAUEIdCADajYCAAsgASACakF/ai0AACIBRQRAIABBADYCBEFsDwsgAEEoIAEQFCACQQN0ams2AgQgAgsWACAAIAEpAAA3AAAgACABKQAINwAICy8BAX8gAUECdEGgHWooAgAgACgCAEEgIAEgACgCBGprQR9xdnEhAiAAIAEQASACCyEAIAFCz9bTvtLHq9lCfiAAfEIfiUKHla+vmLbem55/fgsdAQF/IAAoAgggACgCDEYEfyAAKAIEQSBGBUEACwuCBAEDfyACQYDAAE8EQCAAIAEgAhBnIAAPCyAAIAJqIQMCQCAAIAFzQQNxRQRAAkAgAkEBSARAIAAhAgwBCyAAQQNxRQRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAiADTw0BIAJBA3ENAAsLAkAgA0F8cSIEQcAASQ0AIAIgBEFAaiIFSw0AA0AgAiABKAIANgIAIAIgASgCBDYCBCACIAEoAgg2AgggAiABKAIMNgIMIAIgASgCEDYCECACIAEoAhQ2AhQgAiABKAIYNgIYIAIgASgCHDYCHCACIAEoAiA2AiAgAiABKAIkNgIkIAIgASgCKDYCKCACIAEoAiw2AiwgAiABKAIwNgIwIAIgASgCNDYCNCACIAEoAjg2AjggAiABKAI8NgI8IAFBQGshASACQUBrIgIgBU0NAAsLIAIgBE8NAQNAIAIgASgCADYCACABQQRqIQEgAkEEaiICIARJDQALDAELIANBBEkEQCAAIQIMAQsgA0F8aiIEIABJBEAgACECDAELIAAhAgNAIAIgAS0AADoAACACIAEtAAE6AAEgAiABLQACOgACIAIgAS0AAzoAAyABQQRqIQEgAkEEaiICIARNDQALCyACIANJBEADQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAiADRw0ACwsgAAsMACAAIAEpAAA3AAALQQECfyAAKAIIIgEgACgCEEkEQEEDDwsgACAAKAIEIgJBB3E2AgQgACABIAJBA3ZrIgE2AgggACABKAAANgIAQQALDAAgACABKAIANgAAC/cCAQJ/AkAgACABRg0AAkAgASACaiAASwRAIAAgAmoiBCABSw0BCyAAIAEgAhALDwsgACABc0EDcSEDAkACQCAAIAFJBEAgAwRAIAAhAwwDCyAAQQNxRQRAIAAhAwwCCyAAIQMDQCACRQ0EIAMgAS0AADoAACABQQFqIQEgAkF/aiECIANBAWoiA0EDcQ0ACwwBCwJAIAMNACAEQQNxBEADQCACRQ0FIAAgAkF/aiICaiIDIAEgAmotAAA6AAAgA0EDcQ0ACwsgAkEDTQ0AA0AgACACQXxqIgJqIAEgAmooAgA2AgAgAkEDSw0ACwsgAkUNAgNAIAAgAkF/aiICaiABIAJqLQAAOgAAIAINAAsMAgsgAkEDTQ0AIAIhBANAIAMgASgCADYCACABQQRqIQEgA0EEaiEDIARBfGoiBEEDSw0ACyACQQNxIQILIAJFDQADQCADIAEtAAA6AAAgA0EBaiEDIAFBAWohASACQX9qIgINAAsLIAAL8wICAn8BfgJAIAJFDQAgACACaiIDQX9qIAE6AAAgACABOgAAIAJBA0kNACADQX5qIAE6AAAgACABOgABIANBfWogAToAACAAIAE6AAIgAkEHSQ0AIANBfGogAToAACAAIAE6AAMgAkEJSQ0AIABBACAAa0EDcSIEaiIDIAFB/wFxQYGChAhsIgE2AgAgAyACIARrQXxxIgRqIgJBfGogATYCACAEQQlJDQAgAyABNgIIIAMgATYCBCACQXhqIAE2AgAgAkF0aiABNgIAIARBGUkNACADIAE2AhggAyABNgIUIAMgATYCECADIAE2AgwgAkFwaiABNgIAIAJBbGogATYCACACQWhqIAE2AgAgAkFkaiABNgIAIAQgA0EEcUEYciIEayICQSBJDQAgAa0iBUIghiAFhCEFIAMgBGohAQNAIAEgBTcDGCABIAU3AxAgASAFNwMIIAEgBTcDACABQSBqIQEgAkFgaiICQR9LDQALCyAACy8BAn8gACgCBCAAKAIAQQJ0aiICLQACIQMgACACLwEAIAEgAi0AAxAIajYCACADCy8BAn8gACgCBCAAKAIAQQJ0aiICLQACIQMgACACLwEAIAEgAi0AAxAFajYCACADCx8AIAAgASACKAIEEAg2AgAgARAEGiAAIAJBCGo2AgQLCAAgAGdBH3MLugUBDX8jAEEQayIKJAACfyAEQQNNBEAgCkEANgIMIApBDGogAyAEEAsaIAAgASACIApBDGpBBBAVIgBBbCAAEAMbIAAgACAESxsMAQsgAEEAIAEoAgBBAXRBAmoQECENQVQgAygAACIGQQ9xIgBBCksNABogAiAAQQVqNgIAIAMgBGoiAkF8aiEMIAJBeWohDiACQXtqIRAgAEEGaiELQQQhBSAGQQR2IQRBICAAdCIAQQFyIQkgASgCACEPQQAhAiADIQYCQANAIAlBAkggAiAPS3JFBEAgAiEHAkAgCARAA0AgBEH//wNxQf//A0YEQCAHQRhqIQcgBiAQSQR/IAZBAmoiBigAACAFdgUgBUEQaiEFIARBEHYLIQQMAQsLA0AgBEEDcSIIQQNGBEAgBUECaiEFIARBAnYhBCAHQQNqIQcMAQsLIAcgCGoiByAPSw0EIAVBAmohBQNAIAIgB0kEQCANIAJBAXRqQQA7AQAgAkEBaiECDAELCyAGIA5LQQAgBiAFQQN1aiIHIAxLG0UEQCAHKAAAIAVBB3EiBXYhBAwCCyAEQQJ2IQQLIAYhBwsCfyALQX9qIAQgAEF/anEiBiAAQQF0QX9qIgggCWsiEUkNABogBCAIcSIEQQAgESAEIABIG2shBiALCyEIIA0gAkEBdGogBkF/aiIEOwEAIAlBASAGayAEIAZBAUgbayEJA0AgCSAASARAIABBAXUhACALQX9qIQsMAQsLAn8gByAOS0EAIAcgBSAIaiIFQQN1aiIGIAxLG0UEQCAFQQdxDAELIAUgDCIGIAdrQQN0awshBSACQQFqIQIgBEUhCCAGKAAAIAVBH3F2IQQMAQsLQWwgCUEBRyAFQSBKcg0BGiABIAJBf2o2AgAgBiAFQQdqQQN1aiADawwBC0FQCyEAIApBEGokACAACwkAQQFBBSAAGwsMACAAIAEoAAA2AAALqgMBCn8jAEHwAGsiCiQAIAJBAWohDiAAQQhqIQtBgIAEIAVBf2p0QRB1IQxBACECQQEhBkEBIAV0IglBf2oiDyEIA0AgAiAORkUEQAJAIAEgAkEBdCINai8BACIHQf//A0YEQCALIAhBA3RqIAI2AgQgCEF/aiEIQQEhBwwBCyAGQQAgDCAHQRB0QRB1ShshBgsgCiANaiAHOwEAIAJBAWohAgwBCwsgACAFNgIEIAAgBjYCACAJQQN2IAlBAXZqQQNqIQxBACEAQQAhBkEAIQIDQCAGIA5GBEADQAJAIAAgCUYNACAKIAsgAEEDdGoiASgCBCIGQQF0aiICIAIvAQAiAkEBajsBACABIAUgAhAUayIIOgADIAEgAiAIQf8BcXQgCWs7AQAgASAEIAZBAnQiAmooAgA6AAIgASACIANqKAIANgIEIABBAWohAAwBCwsFIAEgBkEBdGouAQAhDUEAIQcDQCAHIA1ORQRAIAsgAkEDdGogBjYCBANAIAIgDGogD3EiAiAISw0ACyAHQQFqIQcMAQsLIAZBAWohBgwBCwsgCkHwAGokAAsjAEIAIAEQCSAAhUKHla+vmLbem55/fkLj3MqV/M7y9YV/fAsQACAAQn43AwggACABNgIACyQBAX8gAARAIAEoAgQiAgRAIAEoAgggACACEQEADwsgABAmCwsfACAAIAEgAi8BABAINgIAIAEQBBogACACQQRqNgIEC0oBAX9BoCAoAgAiASAAaiIAQX9MBEBBiCBBMDYCAEF/DwsCQCAAPwBBEHRNDQAgABBmDQBBiCBBMDYCAEF/DwtBoCAgADYCACABC9cBAQh/Qbp/IQoCQCACKAIEIgggAigCACIJaiIOIAEgAGtLDQBBbCEKIAkgBCADKAIAIgtrSw0AIAAgCWoiBCACKAIIIgxrIQ0gACABQWBqIg8gCyAJQQAQKSADIAkgC2o2AgACQAJAIAwgBCAFa00EQCANIQUMAQsgDCAEIAZrSw0CIAcgDSAFayIAaiIBIAhqIAdNBEAgBCABIAgQDxoMAgsgBCABQQAgAGsQDyEBIAIgACAIaiIINgIEIAEgAGshBAsgBCAPIAUgCEEBECkLIA4hCgsgCgubAgEBfyMAQYABayINJAAgDSADNgJ8AkAgAkEDSwRAQX8hCQwBCwJAAkACQAJAIAJBAWsOAwADAgELIAZFBEBBuH8hCQwEC0FsIQkgBS0AACICIANLDQMgACAHIAJBAnQiAmooAgAgAiAIaigCABA7IAEgADYCAEEBIQkMAwsgASAJNgIAQQAhCQwCCyAKRQRAQWwhCQwCC0EAIQkgC0UgDEEZSHINAUEIIAR0QQhqIQBBACECA0AgAiAATw0CIAJBQGshAgwAAAsAC0FsIQkgDSANQfwAaiANQfgAaiAFIAYQFSICEAMNACANKAJ4IgMgBEsNACAAIA0gDSgCfCAHIAggAxAYIAEgADYCACACIQkLIA1BgAFqJAAgCQsLACAAIAEgAhALGgsQACAALwAAIAAtAAJBEHRyCy8AAn9BuH8gAUEISQ0AGkFyIAAoAAQiAEF3Sw0AGkG4fyAAQQhqIgAgACABSxsLCwkAIAAgATsAAAsDAAELigYBBX8gACAAKAIAIgVBfnE2AgBBACAAIAVBAXZqQYQgKAIAIgQgAEYbIQECQAJAIAAoAgQiAkUNACACKAIAIgNBAXENACACQQhqIgUgA0EBdkF4aiIDQQggA0EISxtnQR9zQQJ0QYAfaiIDKAIARgRAIAMgAigCDDYCAAsgAigCCCIDBEAgAyACKAIMNgIECyACKAIMIgMEQCADIAIoAgg2AgALIAIgAigCACAAKAIAQX5xajYCAEGEICEAAkACQCABRQ0AIAEgAjYCBCABKAIAIgNBAXENASADQQF2QXhqIgNBCCADQQhLG2dBH3NBAnRBgB9qIgMoAgAgAUEIakYEQCADIAEoAgw2AgALIAEoAggiAwRAIAMgASgCDDYCBAsgASgCDCIDBEAgAyABKAIINgIAQYQgKAIAIQQLIAIgAigCACABKAIAQX5xajYCACABIARGDQAgASABKAIAQQF2akEEaiEACyAAIAI2AgALIAIoAgBBAXZBeGoiAEEIIABBCEsbZ0Efc0ECdEGAH2oiASgCACEAIAEgBTYCACACIAA2AgwgAkEANgIIIABFDQEgACAFNgIADwsCQCABRQ0AIAEoAgAiAkEBcQ0AIAJBAXZBeGoiAkEIIAJBCEsbZ0Efc0ECdEGAH2oiAigCACABQQhqRgRAIAIgASgCDDYCAAsgASgCCCICBEAgAiABKAIMNgIECyABKAIMIgIEQCACIAEoAgg2AgBBhCAoAgAhBAsgACAAKAIAIAEoAgBBfnFqIgI2AgACQCABIARHBEAgASABKAIAQQF2aiAANgIEIAAoAgAhAgwBC0GEICAANgIACyACQQF2QXhqIgFBCCABQQhLG2dBH3NBAnRBgB9qIgIoAgAhASACIABBCGoiAjYCACAAIAE2AgwgAEEANgIIIAFFDQEgASACNgIADwsgBUEBdkF4aiIBQQggAUEISxtnQR9zQQJ0QYAfaiICKAIAIQEgAiAAQQhqIgI2AgAgACABNgIMIABBADYCCCABRQ0AIAEgAjYCAAsLDgAgAARAIABBeGoQJQsLgAIBA38CQCAAQQ9qQXhxQYQgKAIAKAIAQQF2ayICEB1Bf0YNAAJAQYQgKAIAIgAoAgAiAUEBcQ0AIAFBAXZBeGoiAUEIIAFBCEsbZ0Efc0ECdEGAH2oiASgCACAAQQhqRgRAIAEgACgCDDYCAAsgACgCCCIBBEAgASAAKAIMNgIECyAAKAIMIgFFDQAgASAAKAIINgIAC0EBIQEgACAAKAIAIAJBAXRqIgI2AgAgAkEBcQ0AIAJBAXZBeGoiAkEIIAJBCEsbZ0Efc0ECdEGAH2oiAygCACECIAMgAEEIaiIDNgIAIAAgAjYCDCAAQQA2AgggAkUNACACIAM2AgALIAELtwIBA38CQAJAIABBASAAGyICEDgiAA0AAkACQEGEICgCACIARQ0AIAAoAgAiA0EBcQ0AIAAgA0EBcjYCACADQQF2QXhqIgFBCCABQQhLG2dBH3NBAnRBgB9qIgEoAgAgAEEIakYEQCABIAAoAgw2AgALIAAoAggiAQRAIAEgACgCDDYCBAsgACgCDCIBBEAgASAAKAIINgIACyACECchAkEAIQFBhCAoAgAhACACDQEgACAAKAIAQX5xNgIAQQAPCyACQQ9qQXhxIgMQHSICQX9GDQIgAkEHakF4cSIAIAJHBEAgACACaxAdQX9GDQMLAkBBhCAoAgAiAUUEQEGAICAANgIADAELIAAgATYCBAtBhCAgADYCACAAIANBAXRBAXI2AgAMAQsgAEUNAQsgAEEIaiEBCyABC7kDAQJ/IAAgA2ohBQJAIANBB0wEQANAIAAgBU8NAiAAIAItAAA6AAAgAEEBaiEAIAJBAWohAgwAAAsACyAEQQFGBEACQCAAIAJrIgZBB00EQCAAIAItAAA6AAAgACACLQABOgABIAAgAi0AAjoAAiAAIAItAAM6AAMgAEEEaiACIAZBAnQiBkHAHmooAgBqIgIQFyACIAZB4B5qKAIAayECDAELIAAgAhAMCyACQQhqIQIgAEEIaiEACwJAAkACQAJAIAUgAU0EQCAAIANqIQEgBEEBRyAAIAJrQQ9Kcg0BA0AgACACEAwgAkEIaiECIABBCGoiACABSQ0ACwwFCyAAIAFLBEAgACEBDAQLIARBAUcgACACa0EPSnINASAAIQMgAiEEA0AgAyAEEAwgBEEIaiEEIANBCGoiAyABSQ0ACwwCCwNAIAAgAhAHIAJBEGohAiAAQRBqIgAgAUkNAAsMAwsgACEDIAIhBANAIAMgBBAHIARBEGohBCADQRBqIgMgAUkNAAsLIAIgASAAa2ohAgsDQCABIAVPDQEgASACLQAAOgAAIAFBAWohASACQQFqIQIMAAALAAsLQQECfyAAIAAoArjgASIDNgLE4AEgACgCvOABIQQgACABNgK84AEgACABIAJqNgK44AEgACABIAQgA2tqNgLA4AELpgEBAX8gACAAKALs4QEQFjYCyOABIABCADcD+OABIABCADcDuOABIABBwOABakIANwMAIABBqNAAaiIBQYyAgOAANgIAIABBADYCmOIBIABCADcDiOEBIABCAzcDgOEBIABBrNABakHgEikCADcCACAAQbTQAWpB6BIoAgA2AgAgACABNgIMIAAgAEGYIGo2AgggACAAQaAwajYCBCAAIABBEGo2AgALYQEBf0G4fyEDAkAgAUEDSQ0AIAIgABAhIgFBA3YiADYCCCACIAFBAXE2AgQgAiABQQF2QQNxIgM2AgACQCADQX9qIgFBAksNAAJAIAFBAWsOAgEAAgtBbA8LIAAhAwsgAwsMACAAIAEgAkEAEC4LiAQCA38CfiADEBYhBCAAQQBBKBAQIQAgBCACSwRAIAQPCyABRQRAQX8PCwJAAkAgA0EBRg0AIAEoAAAiBkGo6r5pRg0AQXYhAyAGQXBxQdDUtMIBRw0BQQghAyACQQhJDQEgAEEAQSgQECEAIAEoAAQhASAAQQE2AhQgACABrTcDAEEADwsgASACIAMQLyIDIAJLDQAgACADNgIYQXIhAyABIARqIgVBf2otAAAiAkEIcQ0AIAJBIHEiBkUEQEFwIQMgBS0AACIFQacBSw0BIAVBB3GtQgEgBUEDdkEKaq2GIgdCA4h+IAd8IQggBEEBaiEECyACQQZ2IQMgAkECdiEFAkAgAkEDcUF/aiICQQJLBEBBACECDAELAkACQAJAIAJBAWsOAgECAAsgASAEai0AACECIARBAWohBAwCCyABIARqLwAAIQIgBEECaiEEDAELIAEgBGooAAAhAiAEQQRqIQQLIAVBAXEhBQJ+AkACQAJAIANBf2oiA0ECTQRAIANBAWsOAgIDAQtCfyAGRQ0DGiABIARqMQAADAMLIAEgBGovAACtQoACfAwCCyABIARqKAAArQwBCyABIARqKQAACyEHIAAgBTYCICAAIAI2AhwgACAHNwMAQQAhAyAAQQA2AhQgACAHIAggBhsiBzcDCCAAIAdCgIAIIAdCgIAIVBs+AhALIAMLWwEBf0G4fyEDIAIQFiICIAFNBH8gACACakF/ai0AACIAQQNxQQJ0QaAeaigCACACaiAAQQZ2IgFBAnRBsB5qKAIAaiAAQSBxIgBFaiABRSAAQQV2cWoFQbh/CwsdACAAKAKQ4gEQWiAAQQA2AqDiASAAQgA3A5DiAQu1AwEFfyMAQZACayIKJABBuH8hBgJAIAVFDQAgBCwAACIIQf8BcSEHAkAgCEF/TARAIAdBgn9qQQF2IgggBU8NAkFsIQYgB0GBf2oiBUGAAk8NAiAEQQFqIQdBACEGA0AgBiAFTwRAIAUhBiAIIQcMAwUgACAGaiAHIAZBAXZqIgQtAABBBHY6AAAgACAGQQFyaiAELQAAQQ9xOgAAIAZBAmohBgwBCwAACwALIAcgBU8NASAAIARBAWogByAKEFMiBhADDQELIAYhBEEAIQYgAUEAQTQQECEJQQAhBQNAIAQgBkcEQCAAIAZqIggtAAAiAUELSwRAQWwhBgwDBSAJIAFBAnRqIgEgASgCAEEBajYCACAGQQFqIQZBASAILQAAdEEBdSAFaiEFDAILAAsLQWwhBiAFRQ0AIAUQFEEBaiIBQQxLDQAgAyABNgIAQQFBASABdCAFayIDEBQiAXQgA0cNACAAIARqIAFBAWoiADoAACAJIABBAnRqIgAgACgCAEEBajYCACAJKAIEIgBBAkkgAEEBcXINACACIARBAWo2AgAgB0EBaiEGCyAKQZACaiQAIAYLxhEBDH8jAEHwAGsiBSQAQWwhCwJAIANBCkkNACACLwAAIQogAi8AAiEJIAIvAAQhByAFQQhqIAQQDgJAIAMgByAJIApqakEGaiIMSQ0AIAUtAAohCCAFQdgAaiACQQZqIgIgChAGIgsQAw0BIAVBQGsgAiAKaiICIAkQBiILEAMNASAFQShqIAIgCWoiAiAHEAYiCxADDQEgBUEQaiACIAdqIAMgDGsQBiILEAMNASAAIAFqIg9BfWohECAEQQRqIQZBASELIAAgAUEDakECdiIDaiIMIANqIgIgA2oiDiEDIAIhBCAMIQcDQCALIAMgEElxBEAgACAGIAVB2ABqIAgQAkECdGoiCS8BADsAACAFQdgAaiAJLQACEAEgCS0AAyELIAcgBiAFQUBrIAgQAkECdGoiCS8BADsAACAFQUBrIAktAAIQASAJLQADIQogBCAGIAVBKGogCBACQQJ0aiIJLwEAOwAAIAVBKGogCS0AAhABIAktAAMhCSADIAYgBUEQaiAIEAJBAnRqIg0vAQA7AAAgBUEQaiANLQACEAEgDS0AAyENIAAgC2oiCyAGIAVB2ABqIAgQAkECdGoiAC8BADsAACAFQdgAaiAALQACEAEgAC0AAyEAIAcgCmoiCiAGIAVBQGsgCBACQQJ0aiIHLwEAOwAAIAVBQGsgBy0AAhABIActAAMhByAEIAlqIgkgBiAFQShqIAgQAkECdGoiBC8BADsAACAFQShqIAQtAAIQASAELQADIQQgAyANaiIDIAYgBUEQaiAIEAJBAnRqIg0vAQA7AAAgBUEQaiANLQACEAEgACALaiEAIAcgCmohByAEIAlqIQQgAyANLQADaiEDIAVB2ABqEA0gBUFAaxANciAFQShqEA1yIAVBEGoQDXJFIQsMAQsLIAQgDksgByACS3INAEFsIQsgACAMSw0BIAxBfWohCQNAQQAgACAJSSAFQdgAahAEGwRAIAAgBiAFQdgAaiAIEAJBAnRqIgovAQA7AAAgBUHYAGogCi0AAhABIAAgCi0AA2oiACAGIAVB2ABqIAgQAkECdGoiCi8BADsAACAFQdgAaiAKLQACEAEgACAKLQADaiEADAEFIAxBfmohCgNAIAVB2ABqEAQgACAKS3JFBEAgACAGIAVB2ABqIAgQAkECdGoiCS8BADsAACAFQdgAaiAJLQACEAEgACAJLQADaiEADAELCwNAIAAgCk0EQCAAIAYgBUHYAGogCBACQQJ0aiIJLwEAOwAAIAVB2ABqIAktAAIQASAAIAktAANqIQAMAQsLAkAgACAMTw0AIAAgBiAFQdgAaiAIEAIiAEECdGoiDC0AADoAACAMLQADQQFGBEAgBUHYAGogDC0AAhABDAELIAUoAlxBH0sNACAFQdgAaiAGIABBAnRqLQACEAEgBSgCXEEhSQ0AIAVBIDYCXAsgAkF9aiEMA0BBACAHIAxJIAVBQGsQBBsEQCAHIAYgBUFAayAIEAJBAnRqIgAvAQA7AAAgBUFAayAALQACEAEgByAALQADaiIAIAYgBUFAayAIEAJBAnRqIgcvAQA7AAAgBUFAayAHLQACEAEgACAHLQADaiEHDAEFIAJBfmohDANAIAVBQGsQBCAHIAxLckUEQCAHIAYgBUFAayAIEAJBAnRqIgAvAQA7AAAgBUFAayAALQACEAEgByAALQADaiEHDAELCwNAIAcgDE0EQCAHIAYgBUFAayAIEAJBAnRqIgAvAQA7AAAgBUFAayAALQACEAEgByAALQADaiEHDAELCwJAIAcgAk8NACAHIAYgBUFAayAIEAIiAEECdGoiAi0AADoAACACLQADQQFGBEAgBUFAayACLQACEAEMAQsgBSgCREEfSw0AIAVBQGsgBiAAQQJ0ai0AAhABIAUoAkRBIUkNACAFQSA2AkQLIA5BfWohAgNAQQAgBCACSSAFQShqEAQbBEAgBCAGIAVBKGogCBACQQJ0aiIALwEAOwAAIAVBKGogAC0AAhABIAQgAC0AA2oiACAGIAVBKGogCBACQQJ0aiIELwEAOwAAIAVBKGogBC0AAhABIAAgBC0AA2ohBAwBBSAOQX5qIQIDQCAFQShqEAQgBCACS3JFBEAgBCAGIAVBKGogCBACQQJ0aiIALwEAOwAAIAVBKGogAC0AAhABIAQgAC0AA2ohBAwBCwsDQCAEIAJNBEAgBCAGIAVBKGogCBACQQJ0aiIALwEAOwAAIAVBKGogAC0AAhABIAQgAC0AA2ohBAwBCwsCQCAEIA5PDQAgBCAGIAVBKGogCBACIgBBAnRqIgItAAA6AAAgAi0AA0EBRgRAIAVBKGogAi0AAhABDAELIAUoAixBH0sNACAFQShqIAYgAEECdGotAAIQASAFKAIsQSFJDQAgBUEgNgIsCwNAQQAgAyAQSSAFQRBqEAQbBEAgAyAGIAVBEGogCBACQQJ0aiIALwEAOwAAIAVBEGogAC0AAhABIAMgAC0AA2oiACAGIAVBEGogCBACQQJ0aiICLwEAOwAAIAVBEGogAi0AAhABIAAgAi0AA2ohAwwBBSAPQX5qIQIDQCAFQRBqEAQgAyACS3JFBEAgAyAGIAVBEGogCBACQQJ0aiIALwEAOwAAIAVBEGogAC0AAhABIAMgAC0AA2ohAwwBCwsDQCADIAJNBEAgAyAGIAVBEGogCBACQQJ0aiIALwEAOwAAIAVBEGogAC0AAhABIAMgAC0AA2ohAwwBCwsCQCADIA9PDQAgAyAGIAVBEGogCBACIgBBAnRqIgItAAA6AAAgAi0AA0EBRgRAIAVBEGogAi0AAhABDAELIAUoAhRBH0sNACAFQRBqIAYgAEECdGotAAIQASAFKAIUQSFJDQAgBUEgNgIUCyABQWwgBUHYAGoQCiAFQUBrEApxIAVBKGoQCnEgBUEQahAKcRshCwwJCwAACwALAAALAAsAAAsACwAACwALQWwhCwsgBUHwAGokACALC7UEAQ5/IwBBEGsiBiQAIAZBBGogABAOQVQhBQJAIARB3AtJDQAgBi0ABCEHIANB8ARqQQBB7AAQECEIIAdBDEsNACADQdwJaiIJIAggBkEIaiAGQQxqIAEgAhAxIhAQA0UEQCAGKAIMIgQgB0sNASADQdwFaiEPIANBpAVqIREgAEEEaiESIANBqAVqIQEgBCEFA0AgBSICQX9qIQUgCCACQQJ0aigCAEUNAAsgAkEBaiEOQQEhBQNAIAUgDk9FBEAgCCAFQQJ0IgtqKAIAIQwgASALaiAKNgIAIAVBAWohBSAKIAxqIQoMAQsLIAEgCjYCAEEAIQUgBigCCCELA0AgBSALRkUEQCABIAUgCWotAAAiDEECdGoiDSANKAIAIg1BAWo2AgAgDyANQQF0aiINIAw6AAEgDSAFOgAAIAVBAWohBQwBCwtBACEBIANBADYCqAUgBEF/cyAHaiEJQQEhBQNAIAUgDk9FBEAgCCAFQQJ0IgtqKAIAIQwgAyALaiABNgIAIAwgBSAJanQgAWohASAFQQFqIQUMAQsLIAcgBEEBaiIBIAJrIgRrQQFqIQgDQEEBIQUgBCAIT0UEQANAIAUgDk9FBEAgBUECdCIJIAMgBEE0bGpqIAMgCWooAgAgBHY2AgAgBUEBaiEFDAELCyAEQQFqIQQMAQsLIBIgByAPIAogESADIAIgARBkIAZBAToABSAGIAc6AAYgACAGKAIENgIACyAQIQULIAZBEGokACAFC8ENAQt/IwBB8ABrIgUkAEFsIQkCQCADQQpJDQAgAi8AACEKIAIvAAIhDCACLwAEIQYgBUEIaiAEEA4CQCADIAYgCiAMampBBmoiDUkNACAFLQAKIQcgBUHYAGogAkEGaiICIAoQBiIJEAMNASAFQUBrIAIgCmoiAiAMEAYiCRADDQEgBUEoaiACIAxqIgIgBhAGIgkQAw0BIAVBEGogAiAGaiADIA1rEAYiCRADDQEgACABaiIOQX1qIQ8gBEEEaiEGQQEhCSAAIAFBA2pBAnYiAmoiCiACaiIMIAJqIg0hAyAMIQQgCiECA0AgCSADIA9JcQRAIAYgBUHYAGogBxACQQF0aiIILQAAIQsgBUHYAGogCC0AARABIAAgCzoAACAGIAVBQGsgBxACQQF0aiIILQAAIQsgBUFAayAILQABEAEgAiALOgAAIAYgBUEoaiAHEAJBAXRqIggtAAAhCyAFQShqIAgtAAEQASAEIAs6AAAgBiAFQRBqIAcQAkEBdGoiCC0AACELIAVBEGogCC0AARABIAMgCzoAACAGIAVB2ABqIAcQAkEBdGoiCC0AACELIAVB2ABqIAgtAAEQASAAIAs6AAEgBiAFQUBrIAcQAkEBdGoiCC0AACELIAVBQGsgCC0AARABIAIgCzoAASAGIAVBKGogBxACQQF0aiIILQAAIQsgBUEoaiAILQABEAEgBCALOgABIAYgBUEQaiAHEAJBAXRqIggtAAAhCyAFQRBqIAgtAAEQASADIAs6AAEgA0ECaiEDIARBAmohBCACQQJqIQIgAEECaiEAIAkgBUHYAGoQDUVxIAVBQGsQDUVxIAVBKGoQDUVxIAVBEGoQDUVxIQkMAQsLIAQgDUsgAiAMS3INAEFsIQkgACAKSw0BIApBfWohCQNAIAVB2ABqEAQgACAJT3JFBEAgBiAFQdgAaiAHEAJBAXRqIggtAAAhCyAFQdgAaiAILQABEAEgACALOgAAIAYgBUHYAGogBxACQQF0aiIILQAAIQsgBUHYAGogCC0AARABIAAgCzoAASAAQQJqIQAMAQsLA0AgBUHYAGoQBCAAIApPckUEQCAGIAVB2ABqIAcQAkEBdGoiCS0AACEIIAVB2ABqIAktAAEQASAAIAg6AAAgAEEBaiEADAELCwNAIAAgCkkEQCAGIAVB2ABqIAcQAkEBdGoiCS0AACEIIAVB2ABqIAktAAEQASAAIAg6AAAgAEEBaiEADAELCyAMQX1qIQADQCAFQUBrEAQgAiAAT3JFBEAgBiAFQUBrIAcQAkEBdGoiCi0AACEJIAVBQGsgCi0AARABIAIgCToAACAGIAVBQGsgBxACQQF0aiIKLQAAIQkgBUFAayAKLQABEAEgAiAJOgABIAJBAmohAgwBCwsDQCAFQUBrEAQgAiAMT3JFBEAgBiAFQUBrIAcQAkEBdGoiAC0AACEKIAVBQGsgAC0AARABIAIgCjoAACACQQFqIQIMAQsLA0AgAiAMSQRAIAYgBUFAayAHEAJBAXRqIgAtAAAhCiAFQUBrIAAtAAEQASACIAo6AAAgAkEBaiECDAELCyANQX1qIQADQCAFQShqEAQgBCAAT3JFBEAgBiAFQShqIAcQAkEBdGoiAi0AACEKIAVBKGogAi0AARABIAQgCjoAACAGIAVBKGogBxACQQF0aiICLQAAIQogBUEoaiACLQABEAEgBCAKOgABIARBAmohBAwBCwsDQCAFQShqEAQgBCANT3JFBEAgBiAFQShqIAcQAkEBdGoiAC0AACECIAVBKGogAC0AARABIAQgAjoAACAEQQFqIQQMAQsLA0AgBCANSQRAIAYgBUEoaiAHEAJBAXRqIgAtAAAhAiAFQShqIAAtAAEQASAEIAI6AAAgBEEBaiEEDAELCwNAIAVBEGoQBCADIA9PckUEQCAGIAVBEGogBxACQQF0aiIALQAAIQIgBUEQaiAALQABEAEgAyACOgAAIAYgBUEQaiAHEAJBAXRqIgAtAAAhAiAFQRBqIAAtAAEQASADIAI6AAEgA0ECaiEDDAELCwNAIAVBEGoQBCADIA5PckUEQCAGIAVBEGogBxACQQF0aiIALQAAIQIgBUEQaiAALQABEAEgAyACOgAAIANBAWohAwwBCwsDQCADIA5JBEAgBiAFQRBqIAcQAkEBdGoiAC0AACECIAVBEGogAC0AARABIAMgAjoAACADQQFqIQMMAQsLIAFBbCAFQdgAahAKIAVBQGsQCnEgBUEoahAKcSAFQRBqEApxGyEJDAELQWwhCQsgBUHwAGokACAJC8oCAQR/IwBBIGsiBSQAIAUgBBAOIAUtAAIhByAFQQhqIAIgAxAGIgIQA0UEQCAEQQRqIQIgACABaiIDQX1qIQQDQCAFQQhqEAQgACAET3JFBEAgAiAFQQhqIAcQAkEBdGoiBi0AACEIIAVBCGogBi0AARABIAAgCDoAACACIAVBCGogBxACQQF0aiIGLQAAIQggBUEIaiAGLQABEAEgACAIOgABIABBAmohAAwBCwsDQCAFQQhqEAQgACADT3JFBEAgAiAFQQhqIAcQAkEBdGoiBC0AACEGIAVBCGogBC0AARABIAAgBjoAACAAQQFqIQAMAQsLA0AgACADT0UEQCACIAVBCGogBxACQQF0aiIELQAAIQYgBUEIaiAELQABEAEgACAGOgAAIABBAWohAAwBCwsgAUFsIAVBCGoQChshAgsgBUEgaiQAIAILtgMBCX8jAEEQayIGJAAgBkEANgIMIAZBADYCCEFUIQQCQAJAIANBQGsiDCADIAZBCGogBkEMaiABIAIQMSICEAMNACAGQQRqIAAQDiAGKAIMIgcgBi0ABEEBaksNASAAQQRqIQogBkEAOgAFIAYgBzoABiAAIAYoAgQ2AgAgB0EBaiEJQQEhBANAIAQgCUkEQCADIARBAnRqIgEoAgAhACABIAU2AgAgACAEQX9qdCAFaiEFIARBAWohBAwBCwsgB0EBaiEHQQAhBSAGKAIIIQkDQCAFIAlGDQEgAyAFIAxqLQAAIgRBAnRqIgBBASAEdEEBdSILIAAoAgAiAWoiADYCACAHIARrIQhBACEEAkAgC0EDTQRAA0AgBCALRg0CIAogASAEakEBdGoiACAIOgABIAAgBToAACAEQQFqIQQMAAALAAsDQCABIABPDQEgCiABQQF0aiIEIAg6AAEgBCAFOgAAIAQgCDoAAyAEIAU6AAIgBCAIOgAFIAQgBToABCAEIAg6AAcgBCAFOgAGIAFBBGohAQwAAAsACyAFQQFqIQUMAAALAAsgAiEECyAGQRBqJAAgBAutAQECfwJAQYQgKAIAIABHIAAoAgBBAXYiAyABa0F4aiICQXhxQQhHcgR/IAIFIAMQJ0UNASACQQhqC0EQSQ0AIAAgACgCACICQQFxIAAgAWpBD2pBeHEiASAAa0EBdHI2AgAgASAANgIEIAEgASgCAEEBcSAAIAJBAXZqIAFrIgJBAXRyNgIAQYQgIAEgAkH/////B3FqQQRqQYQgKAIAIABGGyABNgIAIAEQJQsLygIBBX8CQAJAAkAgAEEIIABBCEsbZ0EfcyAAaUEBR2oiAUEESSAAIAF2cg0AIAFBAnRB/B5qKAIAIgJFDQADQCACQXhqIgMoAgBBAXZBeGoiBSAATwRAIAIgBUEIIAVBCEsbZ0Efc0ECdEGAH2oiASgCAEYEQCABIAIoAgQ2AgALDAMLIARBHksNASAEQQFqIQQgAigCBCICDQALC0EAIQMgAUEgTw0BA0AgAUECdEGAH2ooAgAiAkUEQCABQR5LIQIgAUEBaiEBIAJFDQEMAwsLIAIgAkF4aiIDKAIAQQF2QXhqIgFBCCABQQhLG2dBH3NBAnRBgB9qIgEoAgBGBEAgASACKAIENgIACwsgAigCACIBBEAgASACKAIENgIECyACKAIEIgEEQCABIAIoAgA2AgALIAMgAygCAEEBcjYCACADIAAQNwsgAwvhCwINfwV+IwBB8ABrIgckACAHIAAoAvDhASIINgJcIAEgAmohDSAIIAAoAoDiAWohDwJAAkAgBUUEQCABIQQMAQsgACgCxOABIRAgACgCwOABIREgACgCvOABIQ4gAEEBNgKM4QFBACEIA0AgCEEDRwRAIAcgCEECdCICaiAAIAJqQazQAWooAgA2AkQgCEEBaiEIDAELC0FsIQwgB0EYaiADIAQQBhADDQEgB0EsaiAHQRhqIAAoAgAQEyAHQTRqIAdBGGogACgCCBATIAdBPGogB0EYaiAAKAIEEBMgDUFgaiESIAEhBEEAIQwDQCAHKAIwIAcoAixBA3RqKQIAIhRCEIinQf8BcSEIIAcoAkAgBygCPEEDdGopAgAiFUIQiKdB/wFxIQsgBygCOCAHKAI0QQN0aikCACIWQiCIpyEJIBVCIIghFyAUQiCIpyECAkAgFkIQiKdB/wFxIgNBAk8EQAJAIAZFIANBGUlyRQRAIAkgB0EYaiADQSAgBygCHGsiCiAKIANLGyIKEAUgAyAKayIDdGohCSAHQRhqEAQaIANFDQEgB0EYaiADEAUgCWohCQwBCyAHQRhqIAMQBSAJaiEJIAdBGGoQBBoLIAcpAkQhGCAHIAk2AkQgByAYNwNIDAELAkAgA0UEQCACBEAgBygCRCEJDAMLIAcoAkghCQwBCwJAAkAgB0EYakEBEAUgCSACRWpqIgNBA0YEQCAHKAJEQX9qIgMgA0VqIQkMAQsgA0ECdCAHaigCRCIJIAlFaiEJIANBAUYNAQsgByAHKAJINgJMCwsgByAHKAJENgJIIAcgCTYCRAsgF6chAyALBEAgB0EYaiALEAUgA2ohAwsgCCALakEUTwRAIAdBGGoQBBoLIAgEQCAHQRhqIAgQBSACaiECCyAHQRhqEAQaIAcgB0EYaiAUQhiIp0H/AXEQCCAUp0H//wNxajYCLCAHIAdBGGogFUIYiKdB/wFxEAggFadB//8DcWo2AjwgB0EYahAEGiAHIAdBGGogFkIYiKdB/wFxEAggFqdB//8DcWo2AjQgByACNgJgIAcoAlwhCiAHIAk2AmggByADNgJkAkACQAJAIAQgAiADaiILaiASSw0AIAIgCmoiEyAPSw0AIA0gBGsgC0Egak8NAQsgByAHKQNoNwMQIAcgBykDYDcDCCAEIA0gB0EIaiAHQdwAaiAPIA4gESAQEB4hCwwBCyACIARqIQggBCAKEAcgAkERTwRAIARBEGohAgNAIAIgCkEQaiIKEAcgAkEQaiICIAhJDQALCyAIIAlrIQIgByATNgJcIAkgCCAOa0sEQCAJIAggEWtLBEBBbCELDAILIBAgAiAOayICaiIKIANqIBBNBEAgCCAKIAMQDxoMAgsgCCAKQQAgAmsQDyEIIAcgAiADaiIDNgJkIAggAmshCCAOIQILIAlBEE8EQCADIAhqIQMDQCAIIAIQByACQRBqIQIgCEEQaiIIIANJDQALDAELAkAgCUEHTQRAIAggAi0AADoAACAIIAItAAE6AAEgCCACLQACOgACIAggAi0AAzoAAyAIQQRqIAIgCUECdCIDQcAeaigCAGoiAhAXIAIgA0HgHmooAgBrIQIgBygCZCEDDAELIAggAhAMCyADQQlJDQAgAyAIaiEDIAhBCGoiCCACQQhqIgJrQQ9MBEADQCAIIAIQDCACQQhqIQIgCEEIaiIIIANJDQAMAgALAAsDQCAIIAIQByACQRBqIQIgCEEQaiIIIANJDQALCyAHQRhqEAQaIAsgDCALEAMiAhshDCAEIAQgC2ogAhshBCAFQX9qIgUNAAsgDBADDQFBbCEMIAdBGGoQBEECSQ0BQQAhCANAIAhBA0cEQCAAIAhBAnQiAmpBrNABaiACIAdqKAJENgIAIAhBAWohCAwBCwsgBygCXCEIC0G6fyEMIA8gCGsiACANIARrSw0AIAQEfyAEIAggABALIABqBUEACyABayEMCyAHQfAAaiQAIAwLkRcCFn8FfiMAQdABayIHJAAgByAAKALw4QEiCDYCvAEgASACaiESIAggACgCgOIBaiETAkACQCAFRQRAIAEhAwwBCyAAKALE4AEhESAAKALA4AEhFSAAKAK84AEhDyAAQQE2AozhAUEAIQgDQCAIQQNHBEAgByAIQQJ0IgJqIAAgAmpBrNABaigCADYCVCAIQQFqIQgMAQsLIAcgETYCZCAHIA82AmAgByABIA9rNgJoQWwhECAHQShqIAMgBBAGEAMNASAFQQQgBUEESBshFyAHQTxqIAdBKGogACgCABATIAdBxABqIAdBKGogACgCCBATIAdBzABqIAdBKGogACgCBBATQQAhBCAHQeAAaiEMIAdB5ABqIQoDQCAHQShqEARBAksgBCAXTnJFBEAgBygCQCAHKAI8QQN0aikCACIdQhCIp0H/AXEhCyAHKAJQIAcoAkxBA3RqKQIAIh5CEIinQf8BcSEJIAcoAkggBygCREEDdGopAgAiH0IgiKchCCAeQiCIISAgHUIgiKchAgJAIB9CEIinQf8BcSIDQQJPBEACQCAGRSADQRlJckUEQCAIIAdBKGogA0EgIAcoAixrIg0gDSADSxsiDRAFIAMgDWsiA3RqIQggB0EoahAEGiADRQ0BIAdBKGogAxAFIAhqIQgMAQsgB0EoaiADEAUgCGohCCAHQShqEAQaCyAHKQJUISEgByAINgJUIAcgITcDWAwBCwJAIANFBEAgAgRAIAcoAlQhCAwDCyAHKAJYIQgMAQsCQAJAIAdBKGpBARAFIAggAkVqaiIDQQNGBEAgBygCVEF/aiIDIANFaiEIDAELIANBAnQgB2ooAlQiCCAIRWohCCADQQFGDQELIAcgBygCWDYCXAsLIAcgBygCVDYCWCAHIAg2AlQLICCnIQMgCQRAIAdBKGogCRAFIANqIQMLIAkgC2pBFE8EQCAHQShqEAQaCyALBEAgB0EoaiALEAUgAmohAgsgB0EoahAEGiAHIAcoAmggAmoiCSADajYCaCAKIAwgCCAJSxsoAgAhDSAHIAdBKGogHUIYiKdB/wFxEAggHadB//8DcWo2AjwgByAHQShqIB5CGIinQf8BcRAIIB6nQf//A3FqNgJMIAdBKGoQBBogB0EoaiAfQhiIp0H/AXEQCCEOIAdB8ABqIARBBHRqIgsgCSANaiAIazYCDCALIAg2AgggCyADNgIEIAsgAjYCACAHIA4gH6dB//8DcWo2AkQgBEEBaiEEDAELCyAEIBdIDQEgEkFgaiEYIAdB4ABqIRogB0HkAGohGyABIQMDQCAHQShqEARBAksgBCAFTnJFBEAgBygCQCAHKAI8QQN0aikCACIdQhCIp0H/AXEhCyAHKAJQIAcoAkxBA3RqKQIAIh5CEIinQf8BcSEIIAcoAkggBygCREEDdGopAgAiH0IgiKchCSAeQiCIISAgHUIgiKchDAJAIB9CEIinQf8BcSICQQJPBEACQCAGRSACQRlJckUEQCAJIAdBKGogAkEgIAcoAixrIgogCiACSxsiChAFIAIgCmsiAnRqIQkgB0EoahAEGiACRQ0BIAdBKGogAhAFIAlqIQkMAQsgB0EoaiACEAUgCWohCSAHQShqEAQaCyAHKQJUISEgByAJNgJUIAcgITcDWAwBCwJAIAJFBEAgDARAIAcoAlQhCQwDCyAHKAJYIQkMAQsCQAJAIAdBKGpBARAFIAkgDEVqaiICQQNGBEAgBygCVEF/aiICIAJFaiEJDAELIAJBAnQgB2ooAlQiCSAJRWohCSACQQFGDQELIAcgBygCWDYCXAsLIAcgBygCVDYCWCAHIAk2AlQLICCnIRQgCARAIAdBKGogCBAFIBRqIRQLIAggC2pBFE8EQCAHQShqEAQaCyALBEAgB0EoaiALEAUgDGohDAsgB0EoahAEGiAHIAcoAmggDGoiGSAUajYCaCAbIBogCSAZSxsoAgAhHCAHIAdBKGogHUIYiKdB/wFxEAggHadB//8DcWo2AjwgByAHQShqIB5CGIinQf8BcRAIIB6nQf//A3FqNgJMIAdBKGoQBBogByAHQShqIB9CGIinQf8BcRAIIB+nQf//A3FqNgJEIAcgB0HwAGogBEEDcUEEdGoiDSkDCCIdNwPIASAHIA0pAwAiHjcDwAECQAJAAkAgBygCvAEiDiAepyICaiIWIBNLDQAgAyAHKALEASIKIAJqIgtqIBhLDQAgEiADayALQSBqTw0BCyAHIAcpA8gBNwMQIAcgBykDwAE3AwggAyASIAdBCGogB0G8AWogEyAPIBUgERAeIQsMAQsgAiADaiEIIAMgDhAHIAJBEU8EQCADQRBqIQIDQCACIA5BEGoiDhAHIAJBEGoiAiAISQ0ACwsgCCAdpyIOayECIAcgFjYCvAEgDiAIIA9rSwRAIA4gCCAVa0sEQEFsIQsMAgsgESACIA9rIgJqIhYgCmogEU0EQCAIIBYgChAPGgwCCyAIIBZBACACaxAPIQggByACIApqIgo2AsQBIAggAmshCCAPIQILIA5BEE8EQCAIIApqIQoDQCAIIAIQByACQRBqIQIgCEEQaiIIIApJDQALDAELAkAgDkEHTQRAIAggAi0AADoAACAIIAItAAE6AAEgCCACLQACOgACIAggAi0AAzoAAyAIQQRqIAIgDkECdCIKQcAeaigCAGoiAhAXIAIgCkHgHmooAgBrIQIgBygCxAEhCgwBCyAIIAIQDAsgCkEJSQ0AIAggCmohCiAIQQhqIgggAkEIaiICa0EPTARAA0AgCCACEAwgAkEIaiECIAhBCGoiCCAKSQ0ADAIACwALA0AgCCACEAcgAkEQaiECIAhBEGoiCCAKSQ0ACwsgCxADBEAgCyEQDAQFIA0gDDYCACANIBkgHGogCWs2AgwgDSAJNgIIIA0gFDYCBCAEQQFqIQQgAyALaiEDDAILAAsLIAQgBUgNASAEIBdrIQtBACEEA0AgCyAFSARAIAcgB0HwAGogC0EDcUEEdGoiAikDCCIdNwPIASAHIAIpAwAiHjcDwAECQAJAAkAgBygCvAEiDCAepyICaiIKIBNLDQAgAyAHKALEASIJIAJqIhBqIBhLDQAgEiADayAQQSBqTw0BCyAHIAcpA8gBNwMgIAcgBykDwAE3AxggAyASIAdBGGogB0G8AWogEyAPIBUgERAeIRAMAQsgAiADaiEIIAMgDBAHIAJBEU8EQCADQRBqIQIDQCACIAxBEGoiDBAHIAJBEGoiAiAISQ0ACwsgCCAdpyIGayECIAcgCjYCvAEgBiAIIA9rSwRAIAYgCCAVa0sEQEFsIRAMAgsgESACIA9rIgJqIgwgCWogEU0EQCAIIAwgCRAPGgwCCyAIIAxBACACaxAPIQggByACIAlqIgk2AsQBIAggAmshCCAPIQILIAZBEE8EQCAIIAlqIQYDQCAIIAIQByACQRBqIQIgCEEQaiIIIAZJDQALDAELAkAgBkEHTQRAIAggAi0AADoAACAIIAItAAE6AAEgCCACLQACOgACIAggAi0AAzoAAyAIQQRqIAIgBkECdCIGQcAeaigCAGoiAhAXIAIgBkHgHmooAgBrIQIgBygCxAEhCQwBCyAIIAIQDAsgCUEJSQ0AIAggCWohBiAIQQhqIgggAkEIaiICa0EPTARAA0AgCCACEAwgAkEIaiECIAhBCGoiCCAGSQ0ADAIACwALA0AgCCACEAcgAkEQaiECIAhBEGoiCCAGSQ0ACwsgEBADDQMgC0EBaiELIAMgEGohAwwBCwsDQCAEQQNHBEAgACAEQQJ0IgJqQazQAWogAiAHaigCVDYCACAEQQFqIQQMAQsLIAcoArwBIQgLQbp/IRAgEyAIayIAIBIgA2tLDQAgAwR/IAMgCCAAEAsgAGoFQQALIAFrIRALIAdB0AFqJAAgEAslACAAQgA3AgAgAEEAOwEIIABBADoACyAAIAE2AgwgACACOgAKC7QFAQN/IwBBMGsiBCQAIABB/wFqIgVBfWohBgJAIAMvAQIEQCAEQRhqIAEgAhAGIgIQAw0BIARBEGogBEEYaiADEBwgBEEIaiAEQRhqIAMQHCAAIQMDQAJAIARBGGoQBCADIAZPckUEQCADIARBEGogBEEYahASOgAAIAMgBEEIaiAEQRhqEBI6AAEgBEEYahAERQ0BIANBAmohAwsgBUF+aiEFAn8DQEG6fyECIAMiASAFSw0FIAEgBEEQaiAEQRhqEBI6AAAgAUEBaiEDIARBGGoQBEEDRgRAQQIhAiAEQQhqDAILIAMgBUsNBSABIARBCGogBEEYahASOgABIAFBAmohA0EDIQIgBEEYahAEQQNHDQALIARBEGoLIQUgAyAFIARBGGoQEjoAACABIAJqIABrIQIMAwsgAyAEQRBqIARBGGoQEjoAAiADIARBCGogBEEYahASOgADIANBBGohAwwAAAsACyAEQRhqIAEgAhAGIgIQAw0AIARBEGogBEEYaiADEBwgBEEIaiAEQRhqIAMQHCAAIQMDQAJAIARBGGoQBCADIAZPckUEQCADIARBEGogBEEYahAROgAAIAMgBEEIaiAEQRhqEBE6AAEgBEEYahAERQ0BIANBAmohAwsgBUF+aiEFAn8DQEG6fyECIAMiASAFSw0EIAEgBEEQaiAEQRhqEBE6AAAgAUEBaiEDIARBGGoQBEEDRgRAQQIhAiAEQQhqDAILIAMgBUsNBCABIARBCGogBEEYahAROgABIAFBAmohA0EDIQIgBEEYahAEQQNHDQALIARBEGoLIQUgAyAFIARBGGoQEToAACABIAJqIABrIQIMAgsgAyAEQRBqIARBGGoQEToAAiADIARBCGogBEEYahAROgADIANBBGohAwwAAAsACyAEQTBqJAAgAgtpAQF/An8CQAJAIAJBB00NACABKAAAQbfIwuF+Rw0AIAAgASgABDYCmOIBQWIgAEEQaiABIAIQPiIDEAMNAhogAEKBgICAEDcDiOEBIAAgASADaiACIANrECoMAQsgACABIAIQKgtBAAsLrQMBBn8jAEGAAWsiAyQAQWIhCAJAIAJBCUkNACAAQZjQAGogAUEIaiIEIAJBeGogAEGY0AAQMyIFEAMiBg0AIANBHzYCfCADIANB/ABqIANB+ABqIAQgBCAFaiAGGyIEIAEgAmoiAiAEaxAVIgUQAw0AIAMoAnwiBkEfSw0AIAMoAngiB0EJTw0AIABBiCBqIAMgBkGAC0GADCAHEBggA0E0NgJ8IAMgA0H8AGogA0H4AGogBCAFaiIEIAIgBGsQFSIFEAMNACADKAJ8IgZBNEsNACADKAJ4IgdBCk8NACAAQZAwaiADIAZBgA1B4A4gBxAYIANBIzYCfCADIANB/ABqIANB+ABqIAQgBWoiBCACIARrEBUiBRADDQAgAygCfCIGQSNLDQAgAygCeCIHQQpPDQAgACADIAZBwBBB0BEgBxAYIAQgBWoiBEEMaiIFIAJLDQAgAiAFayEFQQAhAgNAIAJBA0cEQCAEKAAAIgZBf2ogBU8NAiAAIAJBAnRqQZzQAWogBjYCACACQQFqIQIgBEEEaiEEDAELCyAEIAFrIQgLIANBgAFqJAAgCAtGAQN/IABBCGohAyAAKAIEIQJBACEAA0AgACACdkUEQCABIAMgAEEDdGotAAJBFktqIQEgAEEBaiEADAELCyABQQggAmt0C4YDAQV/Qbh/IQcCQCADRQ0AIAItAAAiBEUEQCABQQA2AgBBAUG4fyADQQFGGw8LAn8gAkEBaiIFIARBGHRBGHUiBkF/Sg0AGiAGQX9GBEAgA0EDSA0CIAUvAABBgP4BaiEEIAJBA2oMAQsgA0ECSA0BIAItAAEgBEEIdHJBgIB+aiEEIAJBAmoLIQUgASAENgIAIAVBAWoiASACIANqIgNLDQBBbCEHIABBEGogACAFLQAAIgVBBnZBI0EJIAEgAyABa0HAEEHQEUHwEiAAKAKM4QEgACgCnOIBIAQQHyIGEAMiCA0AIABBmCBqIABBCGogBUEEdkEDcUEfQQggASABIAZqIAgbIgEgAyABa0GAC0GADEGAFyAAKAKM4QEgACgCnOIBIAQQHyIGEAMiCA0AIABBoDBqIABBBGogBUECdkEDcUE0QQkgASABIAZqIAgbIgEgAyABa0GADUHgDkGQGSAAKAKM4QEgACgCnOIBIAQQHyIAEAMNACAAIAFqIAJrIQcLIAcLrQMBCn8jAEGABGsiCCQAAn9BUiACQf8BSw0AGkFUIANBDEsNABogAkEBaiELIABBBGohCUGAgAQgA0F/anRBEHUhCkEAIQJBASEEQQEgA3QiB0F/aiIMIQUDQCACIAtGRQRAAkAgASACQQF0Ig1qLwEAIgZB//8DRgRAIAkgBUECdGogAjoAAiAFQX9qIQVBASEGDAELIARBACAKIAZBEHRBEHVKGyEECyAIIA1qIAY7AQAgAkEBaiECDAELCyAAIAQ7AQIgACADOwEAIAdBA3YgB0EBdmpBA2ohBkEAIQRBACECA0AgBCALRkUEQCABIARBAXRqLgEAIQpBACEAA0AgACAKTkUEQCAJIAJBAnRqIAQ6AAIDQCACIAZqIAxxIgIgBUsNAAsgAEEBaiEADAELCyAEQQFqIQQMAQsLQX8gAg0AGkEAIQIDfyACIAdGBH9BAAUgCCAJIAJBAnRqIgAtAAJBAXRqIgEgAS8BACIBQQFqOwEAIAAgAyABEBRrIgU6AAMgACABIAVB/wFxdCAHazsBACACQQFqIQIMAQsLCyEFIAhBgARqJAAgBQvjBgEIf0FsIQcCQCACQQNJDQACQAJAAkACQCABLQAAIgNBA3EiCUEBaw4DAwEAAgsgACgCiOEBDQBBYg8LIAJBBUkNAkEDIQYgASgAACEFAn8CQAJAIANBAnZBA3EiCEF+aiIEQQFNBEAgBEEBaw0BDAILIAVBDnZB/wdxIQQgBUEEdkH/B3EhAyAIRQwCCyAFQRJ2IQRBBCEGIAVBBHZB//8AcSEDQQAMAQsgBUEEdkH//w9xIgNBgIAISw0DIAEtAARBCnQgBUEWdnIhBEEFIQZBAAshBSAEIAZqIgogAksNAgJAIANBgQZJDQAgACgCnOIBRQ0AQQAhAgNAIAJBg4ABSw0BIAJBQGshAgwAAAsACwJ/IAlBA0YEQCABIAZqIQEgAEHw4gFqIQIgACgCDCEGIAUEQCACIAMgASAEIAYQXwwCCyACIAMgASAEIAYQXQwBCyAAQbjQAWohAiABIAZqIQEgAEHw4gFqIQYgAEGo0ABqIQggBQRAIAggBiADIAEgBCACEF4MAQsgCCAGIAMgASAEIAIQXAsQAw0CIAAgAzYCgOIBIABBATYCiOEBIAAgAEHw4gFqNgLw4QEgCUECRgRAIAAgAEGo0ABqNgIMCyAAIANqIgBBiOMBakIANwAAIABBgOMBakIANwAAIABB+OIBakIANwAAIABB8OIBakIANwAAIAoPCwJ/AkACQAJAIANBAnZBA3FBf2oiBEECSw0AIARBAWsOAgACAQtBASEEIANBA3YMAgtBAiEEIAEvAABBBHYMAQtBAyEEIAEQIUEEdgsiAyAEaiIFQSBqIAJLBEAgBSACSw0CIABB8OIBaiABIARqIAMQCyEBIAAgAzYCgOIBIAAgATYC8OEBIAEgA2oiAEIANwAYIABCADcAECAAQgA3AAggAEIANwAAIAUPCyAAIAM2AoDiASAAIAEgBGo2AvDhASAFDwsCfwJAAkACQCADQQJ2QQNxQX9qIgRBAksNACAEQQFrDgIAAgELQQEhByADQQN2DAILQQIhByABLwAAQQR2DAELIAJBBEkgARAhIgJBj4CAAUtyDQFBAyEHIAJBBHYLIQIgAEHw4gFqIAEgB2otAAAgAkEgahAQIQEgACACNgKA4gEgACABNgLw4QEgB0EBaiEHCyAHC0sAIABC+erQ0OfJoeThADcDICAAQgA3AxggAELP1tO+0ser2UI3AxAgAELW64Lu6v2J9eAANwMIIABCADcDACAAQShqQQBBKBAQGgviAgICfwV+IABBKGoiASAAKAJIaiECAn4gACkDACIDQiBaBEAgACkDECIEQgeJIAApAwgiBUIBiXwgACkDGCIGQgyJfCAAKQMgIgdCEol8IAUQGSAEEBkgBhAZIAcQGQwBCyAAKQMYQsXP2bLx5brqJ3wLIAN8IQMDQCABQQhqIgAgAk0EQEIAIAEpAAAQCSADhUIbiUKHla+vmLbem55/fkLj3MqV/M7y9YV/fCEDIAAhAQwBCwsCQCABQQRqIgAgAksEQCABIQAMAQsgASgAAK1Ch5Wvr5i23puef34gA4VCF4lCz9bTvtLHq9lCfkL5893xmfaZqxZ8IQMLA0AgACACSQRAIAAxAABCxc/ZsvHluuonfiADhUILiUKHla+vmLbem55/fiEDIABBAWohAAwBCwsgA0IhiCADhULP1tO+0ser2UJ+IgNCHYggA4VC+fPd8Zn2masWfiIDQiCIIAOFC+8CAgJ/BH4gACAAKQMAIAKtfDcDAAJAAkAgACgCSCIDIAJqIgRBH00EQCABRQ0BIAAgA2pBKGogASACECAgACgCSCACaiEEDAELIAEgAmohAgJ/IAMEQCAAQShqIgQgA2ogAUEgIANrECAgACAAKQMIIAQpAAAQCTcDCCAAIAApAxAgACkAMBAJNwMQIAAgACkDGCAAKQA4EAk3AxggACAAKQMgIABBQGspAAAQCTcDICAAKAJIIQMgAEEANgJIIAEgA2tBIGohAQsgAUEgaiACTQsEQCACQWBqIQMgACkDICEFIAApAxghBiAAKQMQIQcgACkDCCEIA0AgCCABKQAAEAkhCCAHIAEpAAgQCSEHIAYgASkAEBAJIQYgBSABKQAYEAkhBSABQSBqIgEgA00NAAsgACAFNwMgIAAgBjcDGCAAIAc3AxAgACAINwMICyABIAJPDQEgAEEoaiABIAIgAWsiBBAgCyAAIAQ2AkgLCy8BAX8gAEUEQEG2f0EAIAMbDwtBun8hBCADIAFNBH8gACACIAMQEBogAwVBun8LCy8BAX8gAEUEQEG2f0EAIAMbDwtBun8hBCADIAFNBH8gACACIAMQCxogAwVBun8LC6gCAQZ/IwBBEGsiByQAIABB2OABaikDAEKAgIAQViEIQbh/IQUCQCAEQf//B0sNACAAIAMgBBBCIgUQAyIGDQAgACgCnOIBIQkgACAHQQxqIAMgAyAFaiAGGyIKIARBACAFIAYbayIGEEAiAxADBEAgAyEFDAELIAcoAgwhBCABRQRAQbp/IQUgBEEASg0BCyAGIANrIQUgAyAKaiEDAkAgCQRAIABBADYCnOIBDAELAkACQAJAIARBBUgNACAAQdjgAWopAwBCgICACFgNAAwBCyAAQQA2ApziAQwBCyAAKAIIED8hBiAAQQA2ApziASAGQRRPDQELIAAgASACIAMgBSAEIAgQOSEFDAELIAAgASACIAMgBSAEIAgQOiEFCyAHQRBqJAAgBQtnACAAQdDgAWogASACIAAoAuzhARAuIgEQAwRAIAEPC0G4fyECAkAgAQ0AIABB7OABaigCACIBBEBBYCECIAAoApjiASABRw0BC0EAIQIgAEHw4AFqKAIARQ0AIABBkOEBahBDCyACCycBAX8QVyIERQRAQUAPCyAEIAAgASACIAMgBBBLEE8hACAEEFYgAAs/AQF/AkACQAJAIAAoAqDiAUEBaiIBQQJLDQAgAUEBaw4CAAECCyAAEDBBAA8LIABBADYCoOIBCyAAKAKU4gELvAMCB38BfiMAQRBrIgkkAEG4fyEGAkAgBCgCACIIQQVBCSAAKALs4QEiBRtJDQAgAygCACIHQQFBBSAFGyAFEC8iBRADBEAgBSEGDAELIAggBUEDakkNACAAIAcgBRBJIgYQAw0AIAEgAmohCiAAQZDhAWohCyAIIAVrIQIgBSAHaiEHIAEhBQNAIAcgAiAJECwiBhADDQEgAkF9aiICIAZJBEBBuH8hBgwCCyAJKAIAIghBAksEQEFsIQYMAgsgB0EDaiEHAn8CQAJAAkAgCEEBaw4CAgABCyAAIAUgCiAFayAHIAYQSAwCCyAFIAogBWsgByAGEEcMAQsgBSAKIAVrIActAAAgCSgCCBBGCyIIEAMEQCAIIQYMAgsgACgC8OABBEAgCyAFIAgQRQsgAiAGayECIAYgB2ohByAFIAhqIQUgCSgCBEUNAAsgACkD0OABIgxCf1IEQEFsIQYgDCAFIAFrrFINAQsgACgC8OABBEBBaiEGIAJBBEkNASALEEQhDCAHKAAAIAynRw0BIAdBBGohByACQXxqIQILIAMgBzYCACAEIAI2AgAgBSABayEGCyAJQRBqJAAgBgsuACAAECsCf0EAQQAQAw0AGiABRSACRXJFBEBBYiAAIAEgAhA9EAMNARoLQQALCzcAIAEEQCAAIAAoAsTgASABKAIEIAEoAghqRzYCnOIBCyAAECtBABADIAFFckUEQCAAIAEQWwsL0QIBB38jAEEQayIGJAAgBiAENgIIIAYgAzYCDCAFBEAgBSgCBCEKIAUoAgghCQsgASEIAkACQANAIAAoAuzhARAWIQsCQANAIAQgC0kNASADKAAAQXBxQdDUtMIBRgRAIAMgBBAiIgcQAw0EIAQgB2shBCADIAdqIQMMAQsLIAYgAzYCDCAGIAQ2AggCQCAFBEAgACAFEE5BACEHQQAQA0UNAQwFCyAAIAogCRBNIgcQAw0ECyAAIAgQUCAMQQFHQQAgACAIIAIgBkEMaiAGQQhqEEwiByIDa0EAIAMQAxtBCkdyRQRAQbh/IQcMBAsgBxADDQMgAiAHayECIAcgCGohCEEBIQwgBigCDCEDIAYoAgghBAwBCwsgBiADNgIMIAYgBDYCCEG4fyEHIAQNASAIIAFrIQcMAQsgBiADNgIMIAYgBDYCCAsgBkEQaiQAIAcLRgECfyABIAAoArjgASICRwRAIAAgAjYCxOABIAAgATYCuOABIAAoArzgASEDIAAgATYCvOABIAAgASADIAJrajYCwOABCwutAgIEfwF+IwBBQGoiBCQAAkACQCACQQhJDQAgASgAAEFwcUHQ1LTCAUcNACABIAIQIiEBIABCADcDCCAAQQA2AgQgACABNgIADAELIARBGGogASACEC0iAxADBEAgACADEBoMAQsgAwRAIABBuH8QGgwBCyACIAQoAjAiA2shAiABIANqIQMDQAJAIAAgAyACIARBCGoQLCIFEAMEfyAFBSACIAVBA2oiBU8NAUG4fwsQGgwCCyAGQQFqIQYgAiAFayECIAMgBWohAyAEKAIMRQ0ACyAEKAI4BEAgAkEDTQRAIABBuH8QGgwCCyADQQRqIQMLIAQoAighAiAEKQMYIQcgAEEANgIEIAAgAyABazYCACAAIAIgBmytIAcgB0J/URs3AwgLIARBQGskAAslAQF/IwBBEGsiAiQAIAIgACABEFEgAigCACEAIAJBEGokACAAC30BBH8jAEGQBGsiBCQAIARB/wE2AggCQCAEQRBqIARBCGogBEEMaiABIAIQFSIGEAMEQCAGIQUMAQtBVCEFIAQoAgwiB0EGSw0AIAMgBEEQaiAEKAIIIAcQQSIFEAMNACAAIAEgBmogAiAGayADEDwhBQsgBEGQBGokACAFC4cBAgJ/An5BABAWIQMCQANAIAEgA08EQAJAIAAoAABBcHFB0NS0wgFGBEAgACABECIiAhADRQ0BQn4PCyAAIAEQVSIEQn1WDQMgBCAFfCIFIARUIQJCfiEEIAINAyAAIAEQUiICEAMNAwsgASACayEBIAAgAmohAAwBCwtCfiAFIAEbIQQLIAQLPwIBfwF+IwBBMGsiAiQAAn5CfiACQQhqIAAgARAtDQAaQgAgAigCHEEBRg0AGiACKQMICyEDIAJBMGokACADC40BAQJ/IwBBMGsiASQAAkAgAEUNACAAKAKI4gENACABIABB/OEBaigCADYCKCABIAApAvThATcDICAAEDAgACgCqOIBIQIgASABKAIoNgIYIAEgASkDIDcDECACIAFBEGoQGyAAQQA2AqjiASABIAEoAig2AgggASABKQMgNwMAIAAgARAbCyABQTBqJAALKgECfyMAQRBrIgAkACAAQQA2AgggAEIANwMAIAAQWCEBIABBEGokACABC4cBAQN/IwBBEGsiAiQAAkAgACgCAEUgACgCBEVzDQAgAiAAKAIINgIIIAIgACkCADcDAAJ/IAIoAgAiAQRAIAIoAghBqOMJIAERBQAMAQtBqOMJECgLIgFFDQAgASAAKQIANwL04QEgAUH84QFqIAAoAgg2AgAgARBZIAEhAwsgAkEQaiQAIAMLywEBAn8jAEEgayIBJAAgAEGBgIDAADYCtOIBIABBADYCiOIBIABBADYC7OEBIABCADcDkOIBIABBADYCpOMJIABBADYC3OIBIABCADcCzOIBIABBADYCvOIBIABBADYCxOABIABCADcCnOIBIABBpOIBakIANwIAIABBrOIBakEANgIAIAFCADcCECABQgA3AhggASABKQMYNwMIIAEgASkDEDcDACABKAIIQQh2QQFxIQIgAEEANgLg4gEgACACNgKM4gEgAUEgaiQAC3YBA38jAEEwayIBJAAgAARAIAEgAEHE0AFqIgIoAgA2AiggASAAKQK80AE3AyAgACgCACEDIAEgAigCADYCGCABIAApArzQATcDECADIAFBEGoQGyABIAEoAig2AgggASABKQMgNwMAIAAgARAbCyABQTBqJAALzAEBAX8gACABKAK00AE2ApjiASAAIAEoAgQiAjYCwOABIAAgAjYCvOABIAAgAiABKAIIaiICNgK44AEgACACNgLE4AEgASgCuNABBEAgAEKBgICAEDcDiOEBIAAgAUGk0ABqNgIMIAAgAUGUIGo2AgggACABQZwwajYCBCAAIAFBDGo2AgAgAEGs0AFqIAFBqNABaigCADYCACAAQbDQAWogAUGs0AFqKAIANgIAIABBtNABaiABQbDQAWooAgA2AgAPCyAAQgA3A4jhAQs7ACACRQRAQbp/DwsgBEUEQEFsDwsgAiAEEGAEQCAAIAEgAiADIAQgBRBhDwsgACABIAIgAyAEIAUQZQtGAQF/IwBBEGsiBSQAIAVBCGogBBAOAn8gBS0ACQRAIAAgASACIAMgBBAyDAELIAAgASACIAMgBBA0CyEAIAVBEGokACAACzQAIAAgAyAEIAUQNiIFEAMEQCAFDwsgBSAESQR/IAEgAiADIAVqIAQgBWsgABA1BUG4fwsLRgEBfyMAQRBrIgUkACAFQQhqIAQQDgJ/IAUtAAkEQCAAIAEgAiADIAQQYgwBCyAAIAEgAiADIAQQNQshACAFQRBqJAAgAAtZAQF/QQ8hAiABIABJBEAgAUEEdCAAbiECCyAAQQh2IgEgAkEYbCIAQYwIaigCAGwgAEGICGooAgBqIgJBA3YgAmogAEGACGooAgAgAEGECGooAgAgAWxqSQs3ACAAIAMgBCAFQYAQEDMiBRADBEAgBQ8LIAUgBEkEfyABIAIgAyAFaiAEIAVrIAAQMgVBuH8LC78DAQN/IwBBIGsiBSQAIAVBCGogAiADEAYiAhADRQRAIAAgAWoiB0F9aiEGIAUgBBAOIARBBGohAiAFLQACIQMDQEEAIAAgBkkgBUEIahAEGwRAIAAgAiAFQQhqIAMQAkECdGoiBC8BADsAACAFQQhqIAQtAAIQASAAIAQtAANqIgQgAiAFQQhqIAMQAkECdGoiAC8BADsAACAFQQhqIAAtAAIQASAEIAAtAANqIQAMAQUgB0F+aiEEA0AgBUEIahAEIAAgBEtyRQRAIAAgAiAFQQhqIAMQAkECdGoiBi8BADsAACAFQQhqIAYtAAIQASAAIAYtAANqIQAMAQsLA0AgACAES0UEQCAAIAIgBUEIaiADEAJBAnRqIgYvAQA7AAAgBUEIaiAGLQACEAEgACAGLQADaiEADAELCwJAIAAgB08NACAAIAIgBUEIaiADEAIiA0ECdGoiAC0AADoAACAALQADQQFGBEAgBUEIaiAALQACEAEMAQsgBSgCDEEfSw0AIAVBCGogAiADQQJ0ai0AAhABIAUoAgxBIUkNACAFQSA2AgwLIAFBbCAFQQhqEAobIQILCwsgBUEgaiQAIAILkgIBBH8jAEFAaiIJJAAgCSADQTQQCyEDAkAgBEECSA0AIAMgBEECdGooAgAhCSADQTxqIAgQIyADQQE6AD8gAyACOgA+QQAhBCADKAI8IQoDQCAEIAlGDQEgACAEQQJ0aiAKNgEAIARBAWohBAwAAAsAC0EAIQkDQCAGIAlGRQRAIAMgBSAJQQF0aiIKLQABIgtBAnRqIgwoAgAhBCADQTxqIAotAABBCHQgCGpB//8DcRAjIANBAjoAPyADIAcgC2siCiACajoAPiAEQQEgASAKa3RqIQogAygCPCELA0AgACAEQQJ0aiALNgEAIARBAWoiBCAKSQ0ACyAMIAo2AgAgCUEBaiEJDAELCyADQUBrJAALowIBCX8jAEHQAGsiCSQAIAlBEGogBUE0EAsaIAcgBmshDyAHIAFrIRADQAJAIAMgCkcEQEEBIAEgByACIApBAXRqIgYtAAEiDGsiCGsiC3QhDSAGLQAAIQ4gCUEQaiAMQQJ0aiIMKAIAIQYgCyAPTwRAIAAgBkECdGogCyAIIAUgCEE0bGogCCAQaiIIQQEgCEEBShsiCCACIAQgCEECdGooAgAiCEEBdGogAyAIayAHIA4QYyAGIA1qIQgMAgsgCUEMaiAOECMgCUEBOgAPIAkgCDoADiAGIA1qIQggCSgCDCELA0AgBiAITw0CIAAgBkECdGogCzYBACAGQQFqIQYMAAALAAsgCUHQAGokAA8LIAwgCDYCACAKQQFqIQoMAAALAAs0ACAAIAMgBCAFEDYiBRADBEAgBQ8LIAUgBEkEfyABIAIgAyAFaiAEIAVrIAAQNAVBuH8LCyMAIAA/AEEQdGtB//8DakEQdkAAQX9GBEBBAA8LQQAQAEEBCzsBAX8gAgRAA0AgACABIAJBgCAgAkGAIEkbIgMQCyEAIAFBgCBqIQEgAEGAIGohACACIANrIgINAAsLCwYAIAAQAwsLqBUJAEGICAsNAQAAAAEAAAACAAAAAgBBoAgLswYBAAAAAQAAAAIAAAACAAAAJgAAAIIAAAAhBQAASgAAAGcIAAAmAAAAwAEAAIAAAABJBQAASgAAAL4IAAApAAAALAIAAIAAAABJBQAASgAAAL4IAAAvAAAAygIAAIAAAACKBQAASgAAAIQJAAA1AAAAcwMAAIAAAACdBQAASgAAAKAJAAA9AAAAgQMAAIAAAADrBQAASwAAAD4KAABEAAAAngMAAIAAAABNBgAASwAAAKoKAABLAAAAswMAAIAAAADBBgAATQAAAB8NAABNAAAAUwQAAIAAAAAjCAAAUQAAAKYPAABUAAAAmQQAAIAAAABLCQAAVwAAALESAABYAAAA2gQAAIAAAABvCQAAXQAAACMUAABUAAAARQUAAIAAAABUCgAAagAAAIwUAABqAAAArwUAAIAAAAB2CQAAfAAAAE4QAAB8AAAA0gIAAIAAAABjBwAAkQAAAJAHAACSAAAAAAAAAAEAAAABAAAABQAAAA0AAAAdAAAAPQAAAH0AAAD9AAAA/QEAAP0DAAD9BwAA/Q8AAP0fAAD9PwAA/X8AAP3/AAD9/wEA/f8DAP3/BwD9/w8A/f8fAP3/PwD9/38A/f//AP3//wH9//8D/f//B/3//w/9//8f/f//P/3//38AAAAAAQAAAAIAAAADAAAABAAAAAUAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAAPAAAAEAAAABEAAAASAAAAEwAAABQAAAAVAAAAFgAAABcAAAAYAAAAGQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAAAMAAAAEAAAABQAAAAYAAAAHAAAACAAAAAkAAAAKAAAACwAAAAwAAAANAAAADgAAAA8AAAAQAAAAEQAAABIAAAATAAAAFAAAABUAAAAWAAAAFwAAABgAAAAZAAAAGgAAABsAAAAcAAAAHQAAAB4AAAAfAAAAIAAAACEAAAAiAAAAIwAAACUAAAAnAAAAKQAAACsAAAAvAAAAMwAAADsAAABDAAAAUwAAAGMAAACDAAAAAwEAAAMCAAADBAAAAwgAAAMQAAADIAAAA0AAAAOAAAADAAEAQeAPC1EBAAAAAQAAAAEAAAABAAAAAgAAAAIAAAADAAAAAwAAAAQAAAAEAAAABQAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAABAAQcQQC4sBAQAAAAIAAAADAAAABAAAAAUAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAAPAAAAEAAAABIAAAAUAAAAFgAAABgAAAAcAAAAIAAAACgAAAAwAAAAQAAAAIAAAAAAAQAAAAIAAAAEAAAACAAAABAAAAAgAAAAQAAAAIAAAAAAAQBBkBIL5gQBAAAAAQAAAAEAAAABAAAAAgAAAAIAAAADAAAAAwAAAAQAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAAPAAAAEAAAAAEAAAAEAAAACAAAAAAAAAABAAEBBgAAAAAAAAQAAAAAEAAABAAAAAAgAAAFAQAAAAAAAAUDAAAAAAAABQQAAAAAAAAFBgAAAAAAAAUHAAAAAAAABQkAAAAAAAAFCgAAAAAAAAUMAAAAAAAABg4AAAAAAAEFEAAAAAAAAQUUAAAAAAABBRYAAAAAAAIFHAAAAAAAAwUgAAAAAAAEBTAAAAAgAAYFQAAAAAAABwWAAAAAAAAIBgABAAAAAAoGAAQAAAAADAYAEAAAIAAABAAAAAAAAAAEAQAAAAAAAAUCAAAAIAAABQQAAAAAAAAFBQAAACAAAAUHAAAAAAAABQgAAAAgAAAFCgAAAAAAAAULAAAAAAAABg0AAAAgAAEFEAAAAAAAAQUSAAAAIAABBRYAAAAAAAIFGAAAACAAAwUgAAAAAAADBSgAAAAAAAYEQAAAABAABgRAAAAAIAAHBYAAAAAAAAkGAAIAAAAACwYACAAAMAAABAAAAAAQAAAEAQAAACAAAAUCAAAAIAAABQMAAAAgAAAFBQAAACAAAAUGAAAAIAAABQgAAAAgAAAFCQAAACAAAAULAAAAIAAABQwAAAAAAAAGDwAAACAAAQUSAAAAIAABBRQAAAAgAAIFGAAAACAAAgUcAAAAIAADBSgAAAAgAAQFMAAAAAAAEAYAAAEAAAAPBgCAAAAAAA4GAEAAAAAADQYAIABBgBcLhwIBAAEBBQAAAAAAAAUAAAAAAAAGBD0AAAAAAAkF/QEAAAAADwX9fwAAAAAVBf3/HwAAAAMFBQAAAAAABwR9AAAAAAAMBf0PAAAAABIF/f8DAAAAFwX9/38AAAAFBR0AAAAAAAgE/QAAAAAADgX9PwAAAAAUBf3/DwAAAAIFAQAAABAABwR9AAAAAAALBf0HAAAAABEF/f8BAAAAFgX9/z8AAAAEBQ0AAAAQAAgE/QAAAAAADQX9HwAAAAATBf3/BwAAAAEFAQAAABAABgQ9AAAAAAAKBf0DAAAAABAF/f8AAAAAHAX9//8PAAAbBf3//wcAABoF/f//AwAAGQX9//8BAAAYBf3//wBBkBkLhgQBAAEBBgAAAAAAAAYDAAAAAAAABAQAAAAgAAAFBQAAAAAAAAUGAAAAAAAABQgAAAAAAAAFCQAAAAAAAAULAAAAAAAABg0AAAAAAAAGEAAAAAAAAAYTAAAAAAAABhYAAAAAAAAGGQAAAAAAAAYcAAAAAAAABh8AAAAAAAAGIgAAAAAAAQYlAAAAAAABBikAAAAAAAIGLwAAAAAAAwY7AAAAAAAEBlMAAAAAAAcGgwAAAAAACQYDAgAAEAAABAQAAAAAAAAEBQAAACAAAAUGAAAAAAAABQcAAAAgAAAFCQAAAAAAAAUKAAAAAAAABgwAAAAAAAAGDwAAAAAAAAYSAAAAAAAABhUAAAAAAAAGGAAAAAAAAAYbAAAAAAAABh4AAAAAAAAGIQAAAAAAAQYjAAAAAAABBicAAAAAAAIGKwAAAAAAAwYzAAAAAAAEBkMAAAAAAAUGYwAAAAAACAYDAQAAIAAABAQAAAAwAAAEBAAAABAAAAQFAAAAIAAABQcAAAAgAAAFCAAAACAAAAUKAAAAIAAABQsAAAAAAAAGDgAAAAAAAAYRAAAAAAAABhQAAAAAAAAGFwAAAAAAAAYaAAAAAAAABh0AAAAAAAAGIAAAAAAAEAYDAAEAAAAPBgOAAAAAAA4GA0AAAAAADQYDIAAAAAAMBgMQAAAAAAsGAwgAAAAACgYDBABBpB0L2QEBAAAAAwAAAAcAAAAPAAAAHwAAAD8AAAB/AAAA/wAAAP8BAAD/AwAA/wcAAP8PAAD/HwAA/z8AAP9/AAD//wAA//8BAP//AwD//wcA//8PAP//HwD//z8A//9/AP///wD///8B////A////wf///8P////H////z////9/AAAAAAEAAAACAAAABAAAAAAAAAACAAAABAAAAAgAAAAAAAAAAQAAAAIAAAABAAAABAAAAAQAAAAEAAAABAAAAAgAAAAIAAAACAAAAAcAAAAIAAAACQAAAAoAAAALAEGgIAsDwBBQ';
4387
-
4388
- const zstd = new ZSTDDecoder();
4389
-
4390
- class LercDecoder extends BaseDecoder {
4391
- constructor(fileDirectory) {
4392
- super();
4393
-
4394
- this.planarConfiguration = typeof fileDirectory.PlanarConfiguration !== 'undefined' ? fileDirectory.PlanarConfiguration : 1;
4395
- this.samplesPerPixel = typeof fileDirectory.SamplesPerPixel !== 'undefined' ? fileDirectory.SamplesPerPixel : 1;
4396
-
4397
- this.addCompression = fileDirectory.LercParameters[LercParameters.AddCompression];
4398
- }
4399
-
4400
- decodeBlock(buffer) {
4401
- switch (this.addCompression) {
4402
- case LercAddCompression.None:
4403
- break;
4404
- case LercAddCompression.Deflate:
4405
- buffer = inflate_1(new Uint8Array(buffer)).buffer; // eslint-disable-line no-param-reassign, prefer-destructuring
4406
- break;
4407
- case LercAddCompression.Zstandard:
4408
- buffer = zstd.decode(new Uint8Array(buffer)).buffer; // eslint-disable-line no-param-reassign, prefer-destructuring
4409
- break;
4410
- default:
4411
- throw new Error(`Unsupported LERC additional compression method identifier: ${this.addCompression}`);
4412
- }
4413
-
4414
- const lercResult = LercDecodeExports.decode(buffer, { returnPixelInterleavedDims: this.planarConfiguration === 1 });
4415
- const lercData = lercResult.pixels[0];
4416
- return lercData.buffer;
4417
- }
4418
- }
4419
-
4420
- export { LercDecoder as default, zstd };
4421
- //# sourceMappingURL=p-XKzdTp2a.js.map
4422
-
4423
- //# sourceMappingURL=p-XKzdTp2a.js.map