@graphty/graphty-element 1.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +9 -0
- package/dist/basisTextureLoader-BqIvxvNl.js +312 -0
- package/dist/basisTextureLoader-BqIvxvNl.js.map +1 -0
- package/dist/custom-elements.json +1 -0
- package/dist/dds-BlAaKjyJ.js +357 -0
- package/dist/dds-BlAaKjyJ.js.map +1 -0
- package/dist/ddsTextureLoader-D7Jh83wc.js +44 -0
- package/dist/ddsTextureLoader-D7Jh83wc.js.map +1 -0
- package/dist/default.fragment-BNc4beoN.js +452 -0
- package/dist/default.fragment-BNc4beoN.js.map +1 -0
- package/dist/default.fragment-CSeCDRwv.js +512 -0
- package/dist/default.fragment-CSeCDRwv.js.map +1 -0
- package/dist/default.vertex-9pBFrn06.js +202 -0
- package/dist/default.vertex-9pBFrn06.js.map +1 -0
- package/dist/default.vertex-DDjK1DRv.js +185 -0
- package/dist/default.vertex-DDjK1DRv.js.map +1 -0
- package/dist/defaultUboDeclaration-CG47IDRY.js +9 -0
- package/dist/defaultUboDeclaration-CG47IDRY.js.map +1 -0
- package/dist/defaultUboDeclaration-Ct5CiQ-w.js +11 -0
- package/dist/defaultUboDeclaration-Ct5CiQ-w.js.map +1 -0
- package/dist/dumpTools-DA1xMSIZ.js +103 -0
- package/dist/dumpTools-DA1xMSIZ.js.map +1 -0
- package/dist/envTextureLoader-DdCLpySN.js +238 -0
- package/dist/envTextureLoader-DdCLpySN.js.map +1 -0
- package/dist/exrTextureLoader-CnJSRQ9w.js +741 -0
- package/dist/exrTextureLoader-CnJSRQ9w.js.map +1 -0
- package/dist/graphty.js +12 -0
- package/dist/graphty.js.map +1 -0
- package/dist/graphty.umd.cjs +12657 -0
- package/dist/graphty.umd.cjs.map +1 -0
- package/dist/greasedLine.fragment-BZnGGe-r.js +30 -0
- package/dist/greasedLine.fragment-BZnGGe-r.js.map +1 -0
- package/dist/greasedLine.fragment-DixuqXus.js +12 -0
- package/dist/greasedLine.fragment-DixuqXus.js.map +1 -0
- package/dist/greasedLine.vertex-BhhwFKPy.js +33 -0
- package/dist/greasedLine.vertex-BhhwFKPy.js.map +1 -0
- package/dist/greasedLine.vertex-DIhgGSOi.js +49 -0
- package/dist/greasedLine.vertex-DIhgGSOi.js.map +1 -0
- package/dist/harmonicsFunctions-B9jTNKTF.js +197 -0
- package/dist/harmonicsFunctions-B9jTNKTF.js.map +1 -0
- package/dist/harmonicsFunctions-D9ZL5yLA.js +194 -0
- package/dist/harmonicsFunctions-D9ZL5yLA.js.map +1 -0
- package/dist/hdrTextureLoader-DreWCvHD.js +112 -0
- package/dist/hdrTextureLoader-DreWCvHD.js.map +1 -0
- package/dist/helperFunctions-Dh1WD8YN.js +106 -0
- package/dist/helperFunctions-Dh1WD8YN.js.map +1 -0
- package/dist/helperFunctions-ZBnqb-in.js +79 -0
- package/dist/helperFunctions-ZBnqb-in.js.map +1 -0
- package/dist/iesTextureLoader-JdfAyRK-.js +94 -0
- package/dist/iesTextureLoader-JdfAyRK-.js.map +1 -0
- package/dist/index-ChGTkj2q.js +62191 -0
- package/dist/index-ChGTkj2q.js.map +1 -0
- package/dist/instancesVertex-BrWNnWxF.js +46 -0
- package/dist/instancesVertex-BrWNnWxF.js.map +1 -0
- package/dist/instancesVertex-evcSIvCA.js +55 -0
- package/dist/instancesVertex-evcSIvCA.js.map +1 -0
- package/dist/ktxTextureLoader-Dg1h0a-4.js +520 -0
- package/dist/ktxTextureLoader-Dg1h0a-4.js.map +1 -0
- package/dist/logDepthDeclaration-BHUUDd5l.js +12 -0
- package/dist/logDepthDeclaration-BHUUDd5l.js.map +1 -0
- package/dist/logDepthDeclaration-Bou5AJOP.js +28 -0
- package/dist/logDepthDeclaration-Bou5AJOP.js.map +1 -0
- package/dist/logDepthVertex-CCFGLExi.js +496 -0
- package/dist/logDepthVertex-CCFGLExi.js.map +1 -0
- package/dist/logDepthVertex-r_niddz9.js +496 -0
- package/dist/logDepthVertex-r_niddz9.js.map +1 -0
- package/dist/mesh.vertexData.functions-Bc9lJlrU.js +75 -0
- package/dist/mesh.vertexData.functions-Bc9lJlrU.js.map +1 -0
- package/dist/meshUboDeclaration-Dg__Mhmj.js +18 -0
- package/dist/meshUboDeclaration-Dg__Mhmj.js.map +1 -0
- package/dist/oitFragment-Bn29Ggvj.js +1191 -0
- package/dist/oitFragment-Bn29Ggvj.js.map +1 -0
- package/dist/oitFragment-D6JBEGk0.js +1328 -0
- package/dist/oitFragment-D6JBEGk0.js.map +1 -0
- package/dist/pass.fragment-C9O4ZLJL.js +11 -0
- package/dist/pass.fragment-C9O4ZLJL.js.map +1 -0
- package/dist/pass.fragment-Cf0ob1Y3.js +11 -0
- package/dist/pass.fragment-Cf0ob1Y3.js.map +1 -0
- package/dist/passCube.fragment-Mg8Qj5T9.js +30 -0
- package/dist/passCube.fragment-Mg8Qj5T9.js.map +1 -0
- package/dist/passCube.fragment-uM4B7TOI.js +30 -0
- package/dist/passCube.fragment-uM4B7TOI.js.map +1 -0
- package/dist/pbr.fragment-C8Lm3cwF.js +3176 -0
- package/dist/pbr.fragment-C8Lm3cwF.js.map +1 -0
- package/dist/pbr.fragment-siOdCYqI.js +3219 -0
- package/dist/pbr.fragment-siOdCYqI.js.map +1 -0
- package/dist/pbr.vertex-Bw_TrGQv.js +229 -0
- package/dist/pbr.vertex-Bw_TrGQv.js.map +1 -0
- package/dist/pbr.vertex-CmEPCcBW.js +365 -0
- package/dist/pbr.vertex-CmEPCcBW.js.map +1 -0
- package/dist/postprocess.vertex-B086G8mM.js +16 -0
- package/dist/postprocess.vertex-B086G8mM.js.map +1 -0
- package/dist/rgbdDecode.fragment-bNaGtQ-x.js +9 -0
- package/dist/rgbdDecode.fragment-bNaGtQ-x.js.map +1 -0
- package/dist/rgbdDecode.fragment-koAcppx0.js +9 -0
- package/dist/rgbdDecode.fragment-koAcppx0.js.map +1 -0
- package/dist/rgbdEncode.fragment-BDHL2P_i.js +9 -0
- package/dist/rgbdEncode.fragment-BDHL2P_i.js.map +1 -0
- package/dist/rgbdEncode.fragment-Dw0FS9aH.js +9 -0
- package/dist/rgbdEncode.fragment-Dw0FS9aH.js.map +1 -0
- package/dist/tgaTextureLoader-DIfkfgQh.js +199 -0
- package/dist/tgaTextureLoader-DIfkfgQh.js.map +1 -0
- package/package.json +124 -0
|
@@ -0,0 +1,741 @@
|
|
|
1
|
+
import { C as Sn, c as rn, e as W } from "./index-ChGTkj2q.js";
|
|
2
|
+
const an = 4, X = 4, sn = 1, N = 2, En = 8, H = 65536, j = H >> 3, xn = 16, C = 14, k = (1 << xn) + 1, V = 1 << C, d = V - 1, K = 59, cn = 63, vn = 2 + cn - K;
|
|
3
|
+
var U;
|
|
4
|
+
(function(n) {
|
|
5
|
+
n[n.NO_COMPRESSION = 0] = "NO_COMPRESSION", n[n.RLE_COMPRESSION = 1] = "RLE_COMPRESSION", n[n.ZIPS_COMPRESSION = 2] = "ZIPS_COMPRESSION", n[n.ZIP_COMPRESSION = 3] = "ZIP_COMPRESSION", n[n.PIZ_COMPRESSION = 4] = "PIZ_COMPRESSION", n[n.PXR24_COMPRESSION = 5] = "PXR24_COMPRESSION";
|
|
6
|
+
})(U || (U = {}));
|
|
7
|
+
var q;
|
|
8
|
+
(function(n) {
|
|
9
|
+
n[n.INCREASING_Y = 0] = "INCREASING_Y", n[n.DECREASING_Y = 1] = "DECREASING_Y";
|
|
10
|
+
})(q || (q = {}));
|
|
11
|
+
const z = bn();
|
|
12
|
+
function bn() {
|
|
13
|
+
const n = new ArrayBuffer(4), t = new Float32Array(n), e = new Uint32Array(n), r = new Uint32Array(512), l = new Uint32Array(512);
|
|
14
|
+
for (let i = 0; i < 256; ++i) {
|
|
15
|
+
const a = i - 127;
|
|
16
|
+
a < -27 ? (r[i] = 0, r[i | 256] = 32768, l[i] = 24, l[i | 256] = 24) : a < -14 ? (r[i] = 1024 >> -a - 14, r[i | 256] = 1024 >> -a - 14 | 32768, l[i] = -a - 1, l[i | 256] = -a - 1) : a <= 15 ? (r[i] = a + 15 << 10, r[i | 256] = a + 15 << 10 | 32768, l[i] = 13, l[i | 256] = 13) : a < 128 ? (r[i] = 31744, r[i | 256] = 64512, l[i] = 24, l[i | 256] = 24) : (r[i] = 31744, r[i | 256] = 64512, l[i] = 13, l[i | 256] = 13);
|
|
17
|
+
}
|
|
18
|
+
const c = new Uint32Array(2048), s = new Uint32Array(64), o = new Uint32Array(64);
|
|
19
|
+
for (let i = 1; i < 1024; ++i) {
|
|
20
|
+
let a = i << 13, u = 0;
|
|
21
|
+
for (; (a & 8388608) === 0; )
|
|
22
|
+
a <<= 1, u -= 8388608;
|
|
23
|
+
a &= -8388609, u += 947912704, c[i] = a | u;
|
|
24
|
+
}
|
|
25
|
+
for (let i = 1024; i < 2048; ++i)
|
|
26
|
+
c[i] = 939524096 + (i - 1024 << 13);
|
|
27
|
+
for (let i = 1; i < 31; ++i)
|
|
28
|
+
s[i] = i << 23;
|
|
29
|
+
s[31] = 1199570944, s[32] = 2147483648;
|
|
30
|
+
for (let i = 33; i < 63; ++i)
|
|
31
|
+
s[i] = 2147483648 + (i - 32 << 23);
|
|
32
|
+
s[63] = 3347054592;
|
|
33
|
+
for (let i = 1; i < 64; ++i)
|
|
34
|
+
i !== 32 && (o[i] = 1024);
|
|
35
|
+
return {
|
|
36
|
+
floatView: t,
|
|
37
|
+
uint32View: e,
|
|
38
|
+
baseTable: r,
|
|
39
|
+
shiftTable: l,
|
|
40
|
+
mantissaTable: c,
|
|
41
|
+
exponentTable: s,
|
|
42
|
+
offsetTable: o
|
|
43
|
+
};
|
|
44
|
+
}
|
|
45
|
+
function $(n, t) {
|
|
46
|
+
const e = new Uint8Array(n);
|
|
47
|
+
let r = 0;
|
|
48
|
+
for (; e[t.value + r] != 0; )
|
|
49
|
+
r += 1;
|
|
50
|
+
const l = new TextDecoder().decode(e.slice(t.value, t.value + r));
|
|
51
|
+
return t.value = t.value + r + 1, l;
|
|
52
|
+
}
|
|
53
|
+
function P(n, t) {
|
|
54
|
+
const e = n.getInt32(t.value, !0);
|
|
55
|
+
return t.value += an, e;
|
|
56
|
+
}
|
|
57
|
+
function R(n, t) {
|
|
58
|
+
const e = n.getUint32(t.value, !0);
|
|
59
|
+
return t.value += an, e;
|
|
60
|
+
}
|
|
61
|
+
function Z(n, t) {
|
|
62
|
+
const e = n.getUint8(t.value);
|
|
63
|
+
return t.value += sn, e;
|
|
64
|
+
}
|
|
65
|
+
function B(n, t) {
|
|
66
|
+
const e = n.getUint16(t.value, !0);
|
|
67
|
+
return t.value += N, e;
|
|
68
|
+
}
|
|
69
|
+
function on(n, t) {
|
|
70
|
+
const e = n[t.value];
|
|
71
|
+
return t.value += sn, e;
|
|
72
|
+
}
|
|
73
|
+
function gn(n, t) {
|
|
74
|
+
let e;
|
|
75
|
+
return "getBigInt64" in DataView.prototype ? e = Number(n.getBigInt64(t.value, !0)) : e = n.getUint32(t.value + 4, !0) + Number(n.getUint32(t.value, !0) << 32), t.value += En, e;
|
|
76
|
+
}
|
|
77
|
+
function b(n, t) {
|
|
78
|
+
const e = n.getFloat32(t.value, !0);
|
|
79
|
+
return t.value += X, e;
|
|
80
|
+
}
|
|
81
|
+
function In(n, t) {
|
|
82
|
+
return On(B(n, t));
|
|
83
|
+
}
|
|
84
|
+
function On(n) {
|
|
85
|
+
const t = (n & 31744) >> 10, e = n & 1023;
|
|
86
|
+
return (n >> 15 ? -1 : 1) * (t ? t === 31 ? e ? NaN : 1 / 0 : Math.pow(2, t - 15) * (1 + e / 1024) : 6103515625e-14 * (e / 1024));
|
|
87
|
+
}
|
|
88
|
+
function An(n) {
|
|
89
|
+
if (Math.abs(n) > 65504)
|
|
90
|
+
throw new Error("Value out of range.Consider using float instead of half-float.");
|
|
91
|
+
n = Sn(n, -65504, 65504), z.floatView[0] = n;
|
|
92
|
+
const t = z.uint32View[0], e = t >> 23 & 511;
|
|
93
|
+
return z.baseTable[e] + ((t & 8388607) >> z.shiftTable[e]);
|
|
94
|
+
}
|
|
95
|
+
function Pn(n, t) {
|
|
96
|
+
return An(b(n, t));
|
|
97
|
+
}
|
|
98
|
+
function Un(n, t, e) {
|
|
99
|
+
const r = new TextDecoder().decode(new Uint8Array(n).slice(t.value, t.value + e));
|
|
100
|
+
return t.value = t.value + e, r;
|
|
101
|
+
}
|
|
102
|
+
function mn(n, t) {
|
|
103
|
+
const e = P(n, t), r = R(n, t);
|
|
104
|
+
return [e, r];
|
|
105
|
+
}
|
|
106
|
+
function Rn(n, t) {
|
|
107
|
+
const e = R(n, t), r = R(n, t);
|
|
108
|
+
return [e, r];
|
|
109
|
+
}
|
|
110
|
+
function Cn(n, t) {
|
|
111
|
+
const e = b(n, t), r = b(n, t);
|
|
112
|
+
return [e, r];
|
|
113
|
+
}
|
|
114
|
+
function Tn(n, t) {
|
|
115
|
+
const e = b(n, t), r = b(n, t), l = b(n, t);
|
|
116
|
+
return [e, r, l];
|
|
117
|
+
}
|
|
118
|
+
function _n(n, t, e) {
|
|
119
|
+
const r = t.value, l = [];
|
|
120
|
+
for (; t.value < r + e - 1; ) {
|
|
121
|
+
const c = $(n.buffer, t), s = P(n, t), o = Z(n, t);
|
|
122
|
+
t.value += 3;
|
|
123
|
+
const i = P(n, t), a = P(n, t);
|
|
124
|
+
l.push({
|
|
125
|
+
name: c,
|
|
126
|
+
pixelType: s,
|
|
127
|
+
pLinear: o,
|
|
128
|
+
xSampling: i,
|
|
129
|
+
ySampling: a
|
|
130
|
+
});
|
|
131
|
+
}
|
|
132
|
+
return t.value += 1, l;
|
|
133
|
+
}
|
|
134
|
+
function Nn(n, t) {
|
|
135
|
+
const e = b(n, t), r = b(n, t), l = b(n, t), c = b(n, t), s = b(n, t), o = b(n, t), i = b(n, t), a = b(n, t);
|
|
136
|
+
return { redX: e, redY: r, greenX: l, greenY: c, blueX: s, blueY: o, whiteX: i, whiteY: a };
|
|
137
|
+
}
|
|
138
|
+
function Mn(n, t) {
|
|
139
|
+
return Z(n, t);
|
|
140
|
+
}
|
|
141
|
+
function Dn(n, t) {
|
|
142
|
+
const e = P(n, t), r = P(n, t), l = P(n, t), c = P(n, t);
|
|
143
|
+
return { xMin: e, yMin: r, xMax: l, yMax: c };
|
|
144
|
+
}
|
|
145
|
+
function kn(n, t) {
|
|
146
|
+
const e = Z(n, t);
|
|
147
|
+
return q[e];
|
|
148
|
+
}
|
|
149
|
+
function Fn(n, t, e, r) {
|
|
150
|
+
switch (e) {
|
|
151
|
+
case "string":
|
|
152
|
+
case "stringvector":
|
|
153
|
+
case "iccProfile":
|
|
154
|
+
return Un(n.buffer, t, r);
|
|
155
|
+
case "chlist":
|
|
156
|
+
return _n(n, t, r);
|
|
157
|
+
case "chromaticities":
|
|
158
|
+
return Nn(n, t);
|
|
159
|
+
case "compression":
|
|
160
|
+
return Mn(n, t);
|
|
161
|
+
case "box2i":
|
|
162
|
+
return Dn(n, t);
|
|
163
|
+
case "lineOrder":
|
|
164
|
+
return kn(n, t);
|
|
165
|
+
case "float":
|
|
166
|
+
return b(n, t);
|
|
167
|
+
case "v2f":
|
|
168
|
+
return Cn(n, t);
|
|
169
|
+
case "v3f":
|
|
170
|
+
return Tn(n, t);
|
|
171
|
+
case "int":
|
|
172
|
+
return P(n, t);
|
|
173
|
+
case "rational":
|
|
174
|
+
return mn(n, t);
|
|
175
|
+
case "timecode":
|
|
176
|
+
return Rn(n, t);
|
|
177
|
+
case "preview":
|
|
178
|
+
return t.value += r, "skipped";
|
|
179
|
+
default:
|
|
180
|
+
t.value += r;
|
|
181
|
+
return;
|
|
182
|
+
}
|
|
183
|
+
}
|
|
184
|
+
function un(n) {
|
|
185
|
+
for (let t = 1; t < n.length; t++) {
|
|
186
|
+
const e = n[t - 1] + n[t] - 128;
|
|
187
|
+
n[t] = e;
|
|
188
|
+
}
|
|
189
|
+
}
|
|
190
|
+
function pn(n, t) {
|
|
191
|
+
let e = 0, r = Math.floor((n.length + 1) / 2), l = 0;
|
|
192
|
+
const c = n.length - 1;
|
|
193
|
+
for (; !(l > c || (t[l++] = n[e++], l > c)); )
|
|
194
|
+
t[l++] = n[r++];
|
|
195
|
+
}
|
|
196
|
+
const Ln = 20000630;
|
|
197
|
+
function zn(n, t) {
|
|
198
|
+
if (n.getUint32(0, !0) != Ln)
|
|
199
|
+
throw new Error("Incorrect OpenEXR format");
|
|
200
|
+
const e = n.getUint8(4), r = n.getUint8(5), l = {
|
|
201
|
+
singleTile: !!(r & 2),
|
|
202
|
+
longName: !!(r & 4),
|
|
203
|
+
deepFormat: !!(r & 8),
|
|
204
|
+
multiPart: !!(r & 16)
|
|
205
|
+
};
|
|
206
|
+
t.value = 8;
|
|
207
|
+
const c = {};
|
|
208
|
+
let s = !0;
|
|
209
|
+
for (; s; ) {
|
|
210
|
+
const o = $(n.buffer, t);
|
|
211
|
+
if (!o)
|
|
212
|
+
s = !1;
|
|
213
|
+
else {
|
|
214
|
+
const i = $(n.buffer, t), a = R(n, t), u = Fn(n, t, i, a);
|
|
215
|
+
u === void 0 ? rn.Warn(`Unknown header attribute type ${i}'.`) : c[o] = u;
|
|
216
|
+
}
|
|
217
|
+
}
|
|
218
|
+
if ((r & -5) != 0)
|
|
219
|
+
throw new Error("Unsupported file format");
|
|
220
|
+
return { version: e, spec: l, ...c };
|
|
221
|
+
}
|
|
222
|
+
const fn = 16, Hn = 1 << fn - 1, nn = (1 << fn) - 1;
|
|
223
|
+
function Bn(n, t) {
|
|
224
|
+
let e = 0;
|
|
225
|
+
for (let l = 0; l < H; ++l)
|
|
226
|
+
(l == 0 || n[l >> 3] & 1 << (l & 7)) && (t[e++] = l);
|
|
227
|
+
const r = e - 1;
|
|
228
|
+
for (; e < H; )
|
|
229
|
+
t[e++] = 0;
|
|
230
|
+
return r;
|
|
231
|
+
}
|
|
232
|
+
function Zn(n) {
|
|
233
|
+
for (let t = 0; t < V; t++)
|
|
234
|
+
n[t] = {}, n[t].len = 0, n[t].lit = 0, n[t].p = null;
|
|
235
|
+
}
|
|
236
|
+
function tn(n, t, e, r, l) {
|
|
237
|
+
for (; e < n; )
|
|
238
|
+
t = t << 8 | on(r, l), e += 8;
|
|
239
|
+
return e -= n, {
|
|
240
|
+
l: t >> e & (1 << n) - 1,
|
|
241
|
+
c: t,
|
|
242
|
+
lc: e
|
|
243
|
+
};
|
|
244
|
+
}
|
|
245
|
+
function J(n, t, e, r) {
|
|
246
|
+
return n = n << 8 | on(e, r), t += 8, {
|
|
247
|
+
c: n,
|
|
248
|
+
lc: t
|
|
249
|
+
};
|
|
250
|
+
}
|
|
251
|
+
function Y(n, t, e, r, l, c, s, o, i) {
|
|
252
|
+
if (n == t) {
|
|
253
|
+
if (r < 8) {
|
|
254
|
+
const f = J(e, r, l, c);
|
|
255
|
+
e = f.c, r = f.lc;
|
|
256
|
+
}
|
|
257
|
+
r -= 8;
|
|
258
|
+
let a = e >> r;
|
|
259
|
+
if (a = new Uint8Array([a])[0], o.value + a > i)
|
|
260
|
+
return null;
|
|
261
|
+
const u = s[o.value - 1];
|
|
262
|
+
for (; a-- > 0; )
|
|
263
|
+
s[o.value++] = u;
|
|
264
|
+
} else if (o.value < i)
|
|
265
|
+
s[o.value++] = n;
|
|
266
|
+
else
|
|
267
|
+
return null;
|
|
268
|
+
return { c: e, lc: r };
|
|
269
|
+
}
|
|
270
|
+
const D = new Array(59);
|
|
271
|
+
function Gn(n) {
|
|
272
|
+
for (let e = 0; e <= 58; ++e)
|
|
273
|
+
D[e] = 0;
|
|
274
|
+
for (let e = 0; e < k; ++e)
|
|
275
|
+
D[n[e]] += 1;
|
|
276
|
+
let t = 0;
|
|
277
|
+
for (let e = 58; e > 0; --e) {
|
|
278
|
+
const r = t + D[e] >> 1;
|
|
279
|
+
D[e] = t, t = r;
|
|
280
|
+
}
|
|
281
|
+
for (let e = 0; e < k; ++e) {
|
|
282
|
+
const r = n[e];
|
|
283
|
+
r > 0 && (n[e] = r | D[r]++ << 6);
|
|
284
|
+
}
|
|
285
|
+
}
|
|
286
|
+
function Wn(n, t, e, r, l, c) {
|
|
287
|
+
const s = t;
|
|
288
|
+
let o = 0, i = 0;
|
|
289
|
+
for (; r <= l; r++) {
|
|
290
|
+
if (s.value - t.value > e)
|
|
291
|
+
return;
|
|
292
|
+
let a = tn(6, o, i, n, s);
|
|
293
|
+
const u = a.l;
|
|
294
|
+
if (o = a.c, i = a.lc, c[r] = u, u == cn) {
|
|
295
|
+
if (s.value - t.value > e)
|
|
296
|
+
throw new Error("Error in HufUnpackEncTable");
|
|
297
|
+
a = tn(8, o, i, n, s);
|
|
298
|
+
let f = a.l + vn;
|
|
299
|
+
if (o = a.c, i = a.lc, r + f > l + 1)
|
|
300
|
+
throw new Error("Error in HufUnpackEncTable");
|
|
301
|
+
for (; f--; )
|
|
302
|
+
c[r++] = 0;
|
|
303
|
+
r--;
|
|
304
|
+
} else if (u >= K) {
|
|
305
|
+
let f = u - K + 2;
|
|
306
|
+
if (r + f > l + 1)
|
|
307
|
+
throw new Error("Error in HufUnpackEncTable");
|
|
308
|
+
for (; f--; )
|
|
309
|
+
c[r++] = 0;
|
|
310
|
+
r--;
|
|
311
|
+
}
|
|
312
|
+
}
|
|
313
|
+
Gn(c);
|
|
314
|
+
}
|
|
315
|
+
function hn(n) {
|
|
316
|
+
return n & 63;
|
|
317
|
+
}
|
|
318
|
+
function wn(n) {
|
|
319
|
+
return n >> 6;
|
|
320
|
+
}
|
|
321
|
+
function Yn(n, t, e, r) {
|
|
322
|
+
for (; t <= e; t++) {
|
|
323
|
+
const l = wn(n[t]), c = hn(n[t]);
|
|
324
|
+
if (l >> c)
|
|
325
|
+
throw new Error("Invalid table entry");
|
|
326
|
+
if (c > C) {
|
|
327
|
+
const s = r[l >> c - C];
|
|
328
|
+
if (s.len)
|
|
329
|
+
throw new Error("Invalid table entry");
|
|
330
|
+
if (s.lit++, s.p) {
|
|
331
|
+
const o = s.p;
|
|
332
|
+
s.p = new Array(s.lit);
|
|
333
|
+
for (let i = 0; i < s.lit - 1; ++i)
|
|
334
|
+
s.p[i] = o[i];
|
|
335
|
+
} else
|
|
336
|
+
s.p = new Array(1);
|
|
337
|
+
s.p[s.lit - 1] = t;
|
|
338
|
+
} else if (c) {
|
|
339
|
+
let s = 0;
|
|
340
|
+
for (let o = 1 << C - c; o > 0; o--) {
|
|
341
|
+
const i = r[(l << C - c) + s];
|
|
342
|
+
if (i.len || i.p)
|
|
343
|
+
throw new Error("Invalid table entry");
|
|
344
|
+
i.len = c, i.lit = t, s++;
|
|
345
|
+
}
|
|
346
|
+
}
|
|
347
|
+
}
|
|
348
|
+
return !0;
|
|
349
|
+
}
|
|
350
|
+
function Xn(n, t, e, r, l, c, s, o, i) {
|
|
351
|
+
let a = 0, u = 0;
|
|
352
|
+
const f = s, x = Math.trunc(r.value + (l + 7) / 8);
|
|
353
|
+
for (; r.value < x; ) {
|
|
354
|
+
let p = J(a, u, e, r);
|
|
355
|
+
for (a = p.c, u = p.lc; u >= C; ) {
|
|
356
|
+
const w = a >> u - C & d, y = t[w];
|
|
357
|
+
if (y.len) {
|
|
358
|
+
u -= y.len;
|
|
359
|
+
const h = Y(y.lit, c, a, u, e, r, o, i, f);
|
|
360
|
+
h && (a = h.c, u = h.lc);
|
|
361
|
+
} else {
|
|
362
|
+
if (!y.p)
|
|
363
|
+
throw new Error("hufDecode issues");
|
|
364
|
+
let h;
|
|
365
|
+
for (h = 0; h < y.lit; h++) {
|
|
366
|
+
const v = hn(n[y.p[h]]);
|
|
367
|
+
for (; u < v && r.value < x; )
|
|
368
|
+
p = J(a, u, e, r), a = p.c, u = p.lc;
|
|
369
|
+
if (u >= v && wn(n[y.p[h]]) == (a >> u - v & (1 << v) - 1)) {
|
|
370
|
+
u -= v;
|
|
371
|
+
const A = Y(y.p[h], c, a, u, e, r, o, i, f);
|
|
372
|
+
A && (a = A.c, u = A.lc);
|
|
373
|
+
break;
|
|
374
|
+
}
|
|
375
|
+
}
|
|
376
|
+
if (h == y.lit)
|
|
377
|
+
throw new Error("HufDecode issues");
|
|
378
|
+
}
|
|
379
|
+
}
|
|
380
|
+
}
|
|
381
|
+
const I = 8 - l & 7;
|
|
382
|
+
for (a >>= I, u -= I; u > 0; ) {
|
|
383
|
+
const p = t[a << C - u & d];
|
|
384
|
+
if (p.len) {
|
|
385
|
+
u -= p.len;
|
|
386
|
+
const w = Y(p.lit, c, a, u, e, r, o, i, f);
|
|
387
|
+
w && (a = w.c, u = w.lc);
|
|
388
|
+
} else
|
|
389
|
+
throw new Error("HufDecode issues");
|
|
390
|
+
}
|
|
391
|
+
return !0;
|
|
392
|
+
}
|
|
393
|
+
function Kn(n, t, e, r, l, c) {
|
|
394
|
+
const s = { value: 0 }, o = e.value, i = R(t, e), a = R(t, e);
|
|
395
|
+
e.value += 4;
|
|
396
|
+
const u = R(t, e);
|
|
397
|
+
if (e.value += 4, i < 0 || i >= k || a < 0 || a >= k)
|
|
398
|
+
throw new Error("Wrong HUF_ENCSIZE");
|
|
399
|
+
const f = new Array(k), x = new Array(V);
|
|
400
|
+
Zn(x);
|
|
401
|
+
const I = r - (e.value - o);
|
|
402
|
+
if (Wn(n, e, I, i, a, f), u > 8 * (r - (e.value - o)))
|
|
403
|
+
throw new Error("Wrong hufUncompress");
|
|
404
|
+
Yn(f, i, a, x), Xn(f, x, n, e, u, a, c, l, s);
|
|
405
|
+
}
|
|
406
|
+
function Q(n) {
|
|
407
|
+
return n & 65535;
|
|
408
|
+
}
|
|
409
|
+
function en(n) {
|
|
410
|
+
const t = Q(n);
|
|
411
|
+
return t > 32767 ? t - 65536 : t;
|
|
412
|
+
}
|
|
413
|
+
function T(n, t) {
|
|
414
|
+
const e = en(n), l = en(t), c = e + (l & 1) + (l >> 1), s = c, o = c - l;
|
|
415
|
+
return { a: s, b: o };
|
|
416
|
+
}
|
|
417
|
+
function _(n, t) {
|
|
418
|
+
const e = Q(n), r = Q(t), l = e - (r >> 1) & nn;
|
|
419
|
+
return { a: r + l - Hn & nn, b: l };
|
|
420
|
+
}
|
|
421
|
+
function qn(n, t, e, r, l, c, s) {
|
|
422
|
+
const o = s < 16384, i = e > l ? l : e;
|
|
423
|
+
let a = 1, u, f;
|
|
424
|
+
for (; a <= i; )
|
|
425
|
+
a <<= 1;
|
|
426
|
+
for (a >>= 1, u = a, a >>= 1; a >= 1; ) {
|
|
427
|
+
f = 0;
|
|
428
|
+
const x = f + c * (l - u), I = c * a, p = c * u, w = r * a, y = r * u;
|
|
429
|
+
let h, v, A, F;
|
|
430
|
+
for (; f <= x; f += p) {
|
|
431
|
+
let E = f;
|
|
432
|
+
const G = f + r * (e - u);
|
|
433
|
+
for (; E <= G; E += y) {
|
|
434
|
+
const O = E + w, g = E + I, L = g + w;
|
|
435
|
+
if (o) {
|
|
436
|
+
let S = T(n[E + t], n[g + t]);
|
|
437
|
+
h = S.a, A = S.b, S = T(n[O + t], n[L + t]), v = S.a, F = S.b, S = T(h, v), n[E + t] = S.a, n[O + t] = S.b, S = T(A, F), n[g + t] = S.a, n[L + t] = S.b;
|
|
438
|
+
} else {
|
|
439
|
+
let S = _(n[E + t], n[g + t]);
|
|
440
|
+
h = S.a, A = S.b, S = _(n[O + t], n[L + t]), v = S.a, F = S.b, S = _(h, v), n[E + t] = S.a, n[O + t] = S.b, S = _(A, F), n[g + t] = S.a, n[L + t] = S.b;
|
|
441
|
+
}
|
|
442
|
+
}
|
|
443
|
+
if (e & a) {
|
|
444
|
+
const O = E + I;
|
|
445
|
+
let g;
|
|
446
|
+
o ? g = T(n[E + t], n[O + t]) : g = _(n[E + t], n[O + t]), h = g.a, n[O + t] = g.b, n[E + t] = h;
|
|
447
|
+
}
|
|
448
|
+
}
|
|
449
|
+
if (l & a) {
|
|
450
|
+
let E = f;
|
|
451
|
+
const G = f + r * (e - u);
|
|
452
|
+
for (; E <= G; E += y) {
|
|
453
|
+
const O = E + w;
|
|
454
|
+
let g;
|
|
455
|
+
o ? g = T(n[E + t], n[O + t]) : g = _(n[E + t], n[O + t]), h = g.a, n[O + t] = g.b, n[E + t] = h;
|
|
456
|
+
}
|
|
457
|
+
}
|
|
458
|
+
u = a, a >>= 1;
|
|
459
|
+
}
|
|
460
|
+
return f;
|
|
461
|
+
}
|
|
462
|
+
function $n(n, t, e) {
|
|
463
|
+
for (let r = 0; r < e; ++r)
|
|
464
|
+
t[r] = n[t[r]];
|
|
465
|
+
}
|
|
466
|
+
function Jn(n) {
|
|
467
|
+
let t = n.byteLength;
|
|
468
|
+
const e = [];
|
|
469
|
+
let r = 0;
|
|
470
|
+
const l = new DataView(n);
|
|
471
|
+
for (; t > 0; ) {
|
|
472
|
+
const c = l.getInt8(r++);
|
|
473
|
+
if (c < 0) {
|
|
474
|
+
const s = -c;
|
|
475
|
+
t -= s + 1;
|
|
476
|
+
for (let o = 0; o < s; o++)
|
|
477
|
+
e.push(l.getUint8(r++));
|
|
478
|
+
} else {
|
|
479
|
+
const s = c;
|
|
480
|
+
t -= 2;
|
|
481
|
+
const o = l.getUint8(r++);
|
|
482
|
+
for (let i = 0; i < s + 1; i++)
|
|
483
|
+
e.push(o);
|
|
484
|
+
}
|
|
485
|
+
}
|
|
486
|
+
return e;
|
|
487
|
+
}
|
|
488
|
+
function yn(n) {
|
|
489
|
+
return new DataView(n.array.buffer, n.offset.value, n.size);
|
|
490
|
+
}
|
|
491
|
+
function Qn(n) {
|
|
492
|
+
const t = n.viewer.buffer.slice(n.offset.value, n.offset.value + n.size), e = new Uint8Array(Jn(t)), r = new Uint8Array(e.length);
|
|
493
|
+
return un(e), pn(e, r), new DataView(r.buffer);
|
|
494
|
+
}
|
|
495
|
+
function ln(n) {
|
|
496
|
+
const t = n.array.slice(n.offset.value, n.offset.value + n.size), e = fflate.unzlibSync(t), r = new Uint8Array(e.length);
|
|
497
|
+
return un(e), pn(e, r), new DataView(r.buffer);
|
|
498
|
+
}
|
|
499
|
+
function Vn(n) {
|
|
500
|
+
const t = n.array.slice(n.offset.value, n.offset.value + n.size), e = fflate.unzlibSync(t), r = n.lines * n.channels * n.width, l = n.type == 1 ? new Uint16Array(r) : new Uint32Array(r);
|
|
501
|
+
let c = 0, s = 0;
|
|
502
|
+
const o = new Array(4);
|
|
503
|
+
for (let i = 0; i < n.lines; i++)
|
|
504
|
+
for (let a = 0; a < n.channels; a++) {
|
|
505
|
+
let u = 0;
|
|
506
|
+
switch (n.type) {
|
|
507
|
+
case 1:
|
|
508
|
+
o[0] = c, o[1] = o[0] + n.width, c = o[1] + n.width;
|
|
509
|
+
for (let f = 0; f < n.width; ++f) {
|
|
510
|
+
const x = e[o[0]++] << 8 | e[o[1]++];
|
|
511
|
+
u += x, l[s] = u, s++;
|
|
512
|
+
}
|
|
513
|
+
break;
|
|
514
|
+
case 2:
|
|
515
|
+
o[0] = c, o[1] = o[0] + n.width, o[2] = o[1] + n.width, c = o[2] + n.width;
|
|
516
|
+
for (let f = 0; f < n.width; ++f) {
|
|
517
|
+
const x = e[o[0]++] << 24 | e[o[1]++] << 16 | e[o[2]++] << 8;
|
|
518
|
+
u += x, l[s] = u, s++;
|
|
519
|
+
}
|
|
520
|
+
break;
|
|
521
|
+
}
|
|
522
|
+
}
|
|
523
|
+
return new DataView(l.buffer);
|
|
524
|
+
}
|
|
525
|
+
function jn(n) {
|
|
526
|
+
const t = n.viewer, e = { value: n.offset.value }, r = new Uint16Array(n.width * n.scanlineBlockSize * (n.channels * n.type)), l = new Uint8Array(j);
|
|
527
|
+
let c = 0;
|
|
528
|
+
const s = new Array(n.channels);
|
|
529
|
+
for (let p = 0; p < n.channels; p++)
|
|
530
|
+
s[p] = {}, s[p].start = c, s[p].end = s[p].start, s[p].nx = n.width, s[p].ny = n.lines, s[p].size = n.type, c += s[p].nx * s[p].ny * s[p].size;
|
|
531
|
+
const o = B(t, e), i = B(t, e);
|
|
532
|
+
if (i >= j)
|
|
533
|
+
throw new Error("Wrong PIZ_COMPRESSION BITMAP_SIZE");
|
|
534
|
+
if (o <= i)
|
|
535
|
+
for (let p = 0; p < i - o + 1; p++)
|
|
536
|
+
l[p + o] = Z(t, e);
|
|
537
|
+
const a = new Uint16Array(H), u = Bn(l, a), f = R(t, e);
|
|
538
|
+
Kn(n.array, t, e, f, r, c);
|
|
539
|
+
for (let p = 0; p < n.channels; ++p) {
|
|
540
|
+
const w = s[p];
|
|
541
|
+
for (let y = 0; y < s[p].size; ++y)
|
|
542
|
+
qn(r, w.start + y, w.nx, w.size, w.ny, w.nx * w.size, u);
|
|
543
|
+
}
|
|
544
|
+
$n(a, r, c);
|
|
545
|
+
let x = 0;
|
|
546
|
+
const I = new Uint8Array(r.buffer.byteLength);
|
|
547
|
+
for (let p = 0; p < n.lines; p++)
|
|
548
|
+
for (let w = 0; w < n.channels; w++) {
|
|
549
|
+
const y = s[w], h = y.nx * y.size, v = new Uint8Array(r.buffer, y.end * N, h * N);
|
|
550
|
+
I.set(v, x), x += h * N, y.end += h;
|
|
551
|
+
}
|
|
552
|
+
return new DataView(I.buffer);
|
|
553
|
+
}
|
|
554
|
+
var m;
|
|
555
|
+
(function(n) {
|
|
556
|
+
n[n.Float = 0] = "Float", n[n.HalfFloat = 1] = "HalfFloat";
|
|
557
|
+
})(m || (m = {}));
|
|
558
|
+
class M {
|
|
559
|
+
}
|
|
560
|
+
M.DefaultOutputType = m.HalfFloat;
|
|
561
|
+
M.FFLATEUrl = "https://unpkg.com/fflate@0.8.2";
|
|
562
|
+
async function dn(n, t, e, r) {
|
|
563
|
+
const l = {
|
|
564
|
+
size: 0,
|
|
565
|
+
viewer: t,
|
|
566
|
+
array: new Uint8Array(t.buffer),
|
|
567
|
+
offset: e,
|
|
568
|
+
width: n.dataWindow.xMax - n.dataWindow.xMin + 1,
|
|
569
|
+
height: n.dataWindow.yMax - n.dataWindow.yMin + 1,
|
|
570
|
+
channels: n.channels.length,
|
|
571
|
+
channelLineOffsets: {},
|
|
572
|
+
scanOrder: () => 0,
|
|
573
|
+
bytesPerLine: 0,
|
|
574
|
+
outLineWidth: 0,
|
|
575
|
+
lines: 0,
|
|
576
|
+
scanlineBlockSize: 0,
|
|
577
|
+
inputSize: null,
|
|
578
|
+
type: 0,
|
|
579
|
+
uncompress: null,
|
|
580
|
+
getter: () => 0,
|
|
581
|
+
format: 5,
|
|
582
|
+
outputChannels: 0,
|
|
583
|
+
decodeChannels: {},
|
|
584
|
+
blockCount: null,
|
|
585
|
+
byteArray: null,
|
|
586
|
+
linearSpace: !1,
|
|
587
|
+
textureType: 0
|
|
588
|
+
};
|
|
589
|
+
switch (n.compression) {
|
|
590
|
+
case U.NO_COMPRESSION:
|
|
591
|
+
l.lines = 1, l.uncompress = yn;
|
|
592
|
+
break;
|
|
593
|
+
case U.RLE_COMPRESSION:
|
|
594
|
+
l.lines = 1, l.uncompress = Qn;
|
|
595
|
+
break;
|
|
596
|
+
case U.ZIPS_COMPRESSION:
|
|
597
|
+
l.lines = 1, l.uncompress = ln, await W.LoadScriptAsync(M.FFLATEUrl);
|
|
598
|
+
break;
|
|
599
|
+
case U.ZIP_COMPRESSION:
|
|
600
|
+
l.lines = 16, l.uncompress = ln, await W.LoadScriptAsync(M.FFLATEUrl);
|
|
601
|
+
break;
|
|
602
|
+
case U.PIZ_COMPRESSION:
|
|
603
|
+
l.lines = 32, l.uncompress = jn;
|
|
604
|
+
break;
|
|
605
|
+
case U.PXR24_COMPRESSION:
|
|
606
|
+
l.lines = 16, l.uncompress = Vn, await W.LoadScriptAsync(M.FFLATEUrl);
|
|
607
|
+
break;
|
|
608
|
+
default:
|
|
609
|
+
throw new Error(U[n.compression] + " is unsupported");
|
|
610
|
+
}
|
|
611
|
+
l.scanlineBlockSize = l.lines;
|
|
612
|
+
const c = {};
|
|
613
|
+
for (const a of n.channels)
|
|
614
|
+
switch (a.name) {
|
|
615
|
+
case "R":
|
|
616
|
+
case "G":
|
|
617
|
+
case "B":
|
|
618
|
+
case "A":
|
|
619
|
+
c[a.name] = !0, l.type = a.pixelType;
|
|
620
|
+
break;
|
|
621
|
+
case "Y":
|
|
622
|
+
c[a.name] = !0, l.type = a.pixelType;
|
|
623
|
+
break;
|
|
624
|
+
}
|
|
625
|
+
let s = !1;
|
|
626
|
+
if (c.R && c.G && c.B && c.A)
|
|
627
|
+
l.outputChannels = 4, l.decodeChannels = { R: 0, G: 1, B: 2, A: 3 };
|
|
628
|
+
else if (c.R && c.G && c.B)
|
|
629
|
+
s = !0, l.outputChannels = 4, l.decodeChannels = { R: 0, G: 1, B: 2, A: 3 };
|
|
630
|
+
else if (c.R && c.G)
|
|
631
|
+
l.outputChannels = 2, l.decodeChannels = { R: 0, G: 1 };
|
|
632
|
+
else if (c.R)
|
|
633
|
+
l.outputChannels = 1, l.decodeChannels = { R: 0 };
|
|
634
|
+
else if (c.Y)
|
|
635
|
+
l.outputChannels = 1, l.decodeChannels = { Y: 0 };
|
|
636
|
+
else
|
|
637
|
+
throw new Error("EXRLoader.parse: file contains unsupported data channels.");
|
|
638
|
+
if (l.type === 1)
|
|
639
|
+
switch (r) {
|
|
640
|
+
case m.Float:
|
|
641
|
+
l.getter = In, l.inputSize = N;
|
|
642
|
+
break;
|
|
643
|
+
case m.HalfFloat:
|
|
644
|
+
l.getter = B, l.inputSize = N;
|
|
645
|
+
break;
|
|
646
|
+
}
|
|
647
|
+
else if (l.type === 2)
|
|
648
|
+
switch (r) {
|
|
649
|
+
case m.Float:
|
|
650
|
+
l.getter = b, l.inputSize = X;
|
|
651
|
+
break;
|
|
652
|
+
case m.HalfFloat:
|
|
653
|
+
l.getter = Pn, l.inputSize = X;
|
|
654
|
+
}
|
|
655
|
+
else
|
|
656
|
+
throw new Error("Unsupported pixelType " + l.type + " for " + n.compression);
|
|
657
|
+
l.blockCount = l.height / l.scanlineBlockSize;
|
|
658
|
+
for (let a = 0; a < l.blockCount; a++)
|
|
659
|
+
gn(t, e);
|
|
660
|
+
const o = l.width * l.height * l.outputChannels;
|
|
661
|
+
switch (r) {
|
|
662
|
+
case m.Float:
|
|
663
|
+
l.byteArray = new Float32Array(o), l.textureType = 1, s && l.byteArray.fill(1, 0, o);
|
|
664
|
+
break;
|
|
665
|
+
case m.HalfFloat:
|
|
666
|
+
l.byteArray = new Uint16Array(o), l.textureType = 2, s && l.byteArray.fill(15360, 0, o);
|
|
667
|
+
break;
|
|
668
|
+
default:
|
|
669
|
+
throw new Error("Unsupported type: " + r);
|
|
670
|
+
}
|
|
671
|
+
let i = 0;
|
|
672
|
+
for (const a of n.channels)
|
|
673
|
+
l.decodeChannels[a.name] !== void 0 && (l.channelLineOffsets[a.name] = i * l.width), i += a.pixelType * 2;
|
|
674
|
+
return l.bytesPerLine = l.width * i, l.outLineWidth = l.width * l.outputChannels, n.lineOrder === "INCREASING_Y" ? l.scanOrder = (a) => a : l.scanOrder = (a) => l.height - 1 - a, l.outputChannels == 4 ? (l.format = 5, l.linearSpace = !0) : (l.format = 6, l.linearSpace = !1), l;
|
|
675
|
+
}
|
|
676
|
+
function nt(n, t, e, r) {
|
|
677
|
+
const l = { value: 0 };
|
|
678
|
+
for (let c = 0; c < n.height / n.scanlineBlockSize; c++) {
|
|
679
|
+
const s = P(e, r) - t.dataWindow.yMin;
|
|
680
|
+
n.size = R(e, r), n.lines = s + n.scanlineBlockSize > n.height ? n.height - s : n.scanlineBlockSize;
|
|
681
|
+
const i = n.size < n.lines * n.bytesPerLine && n.uncompress ? n.uncompress(n) : yn(n);
|
|
682
|
+
r.value += n.size;
|
|
683
|
+
for (let a = 0; a < n.scanlineBlockSize; a++) {
|
|
684
|
+
const u = c * n.scanlineBlockSize, f = a + n.scanOrder(u);
|
|
685
|
+
if (f >= n.height)
|
|
686
|
+
continue;
|
|
687
|
+
const x = a * n.bytesPerLine, I = (n.height - 1 - f) * n.outLineWidth;
|
|
688
|
+
for (let p = 0; p < n.channels; p++) {
|
|
689
|
+
const w = t.channels[p].name, y = n.channelLineOffsets[w], h = n.decodeChannels[w];
|
|
690
|
+
if (h !== void 0) {
|
|
691
|
+
l.value = x + y;
|
|
692
|
+
for (let v = 0; v < n.width; v++) {
|
|
693
|
+
const A = I + v * n.outputChannels + h;
|
|
694
|
+
n.byteArray && (n.byteArray[A] = n.getter(i, l));
|
|
695
|
+
}
|
|
696
|
+
}
|
|
697
|
+
}
|
|
698
|
+
}
|
|
699
|
+
}
|
|
700
|
+
}
|
|
701
|
+
class et {
|
|
702
|
+
constructor() {
|
|
703
|
+
this.supportCascades = !1;
|
|
704
|
+
}
|
|
705
|
+
/**
|
|
706
|
+
* Uploads the cube texture data to the WebGL texture. It has already been bound.
|
|
707
|
+
* @param _data contains the texture data
|
|
708
|
+
* @param _texture defines the BabylonJS internal texture
|
|
709
|
+
* @param _createPolynomials will be true if polynomials have been requested
|
|
710
|
+
* @param _onLoad defines the callback to trigger once the texture is ready
|
|
711
|
+
* @param _onError defines the callback to trigger in case of error
|
|
712
|
+
* Cube texture are not supported by .exr files
|
|
713
|
+
*/
|
|
714
|
+
loadCubeData(t, e, r, l, c) {
|
|
715
|
+
throw ".exr not supported in Cube.";
|
|
716
|
+
}
|
|
717
|
+
/**
|
|
718
|
+
* Uploads the 2D texture data to the WebGL texture. It has already been bound once in the callback.
|
|
719
|
+
* @param data contains the texture data
|
|
720
|
+
* @param texture defines the BabylonJS internal texture
|
|
721
|
+
* @param callback defines the method to call once ready to upload
|
|
722
|
+
*/
|
|
723
|
+
// eslint-disable-next-line @typescript-eslint/naming-convention
|
|
724
|
+
loadData(t, e, r) {
|
|
725
|
+
const l = new DataView(t.buffer), c = { value: 0 }, s = zn(l, c);
|
|
726
|
+
dn(s, l, c, M.DefaultOutputType).then((o) => {
|
|
727
|
+
nt(o, s, l, c);
|
|
728
|
+
const i = s.dataWindow.xMax - s.dataWindow.xMin + 1, a = s.dataWindow.yMax - s.dataWindow.yMin + 1;
|
|
729
|
+
r(i, a, e.generateMipMaps, !1, () => {
|
|
730
|
+
const u = e.getEngine();
|
|
731
|
+
e.format = s.format, e.type = o.textureType, e.invertY = !1, e._gammaSpace = !s.linearSpace, o.byteArray && u._uploadDataToTextureDirectly(e, o.byteArray, 0, 0, void 0, !0);
|
|
732
|
+
});
|
|
733
|
+
}).catch((o) => {
|
|
734
|
+
rn.Error("Failed to load EXR texture: ", o);
|
|
735
|
+
});
|
|
736
|
+
}
|
|
737
|
+
}
|
|
738
|
+
export {
|
|
739
|
+
et as _ExrTextureLoader
|
|
740
|
+
};
|
|
741
|
+
//# sourceMappingURL=exrTextureLoader-CnJSRQ9w.js.map
|