@woosh/meep-engine 2.117.8 → 2.117.9
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/build/bundle-worker-image-decoder.js +1 -1
- package/build/bundle-worker-terrain.js +1 -1
- package/build/meep.cjs +54 -16
- package/build/meep.min.js +1 -1
- package/build/meep.module.js +54 -16
- package/package.json +1 -1
- package/src/core/collection/array/typed/array_buffer_copy.d.ts.map +1 -1
- package/src/core/collection/array/typed/array_buffer_copy.js +7 -7
- package/src/core/collection/array/typed/isTypedArray.d.ts +1 -1
- package/src/core/collection/array/typed/isTypedArray.d.ts.map +1 -1
- package/src/core/collection/array/typed/isTypedArray.js +27 -10
- package/src/core/collection/array/typed/is_array_buffer_equals.d.ts +11 -0
- package/src/core/collection/array/typed/is_array_buffer_equals.d.ts.map +1 -0
- package/src/core/collection/array/typed/is_array_buffer_equals.js +45 -0
- package/src/core/collection/array/typed/is_typed_array_equals.d.ts.map +1 -1
- package/src/core/collection/array/typed/is_typed_array_equals.js +5 -6
- package/src/core/collection/array/typed/largest_common_alignment_uint32.d.ts +9 -0
- package/src/core/collection/array/typed/largest_common_alignment_uint32.d.ts.map +1 -0
- package/src/core/collection/array/typed/largest_common_alignment_uint32.js +29 -0
- package/src/engine/graphics/render/frame_graph/RenderPass.d.ts +5 -1
- package/src/engine/graphics/render/frame_graph/RenderPass.d.ts.map +1 -1
- package/src/engine/graphics/render/frame_graph/RenderPass.js +4 -0
- package/src/engine/graphics/render/frame_graph/sample/deferred/CopyPass.d.ts +1 -1
- package/src/engine/graphics/render/frame_graph/sample/deferred/CopyPass.d.ts.map +1 -1
- package/src/engine/graphics/render/frame_graph/sample/deferred/GBufferDrawPass.d.ts +1 -1
- package/src/engine/graphics/render/frame_graph/sample/deferred/GBufferDrawPass.d.ts.map +1 -1
- package/src/engine/graphics/render/frame_graph/sample/deferred/LightingPass.d.ts +1 -1
- package/src/engine/graphics/render/frame_graph/sample/deferred/LightingPass.d.ts.map +1 -1
- package/src/engine/graphics/render/frame_graph/sample/meep-v1/OutlinePass.d.ts +1 -1
- package/src/engine/graphics/render/frame_graph/sample/meep-v1/OutlinePass.d.ts.map +1 -1
- package/src/engine/graphics/render/frame_graph/sample/meep-v1/SSAOPass.d.ts +1 -1
- package/src/engine/graphics/render/frame_graph/sample/meep-v1/SSAOPass.d.ts.map +1 -1
package/build/meep.module.js
CHANGED
|
@@ -25,22 +25,39 @@ function isArrayEqualStrict(a, b) {
|
|
|
25
25
|
}
|
|
26
26
|
|
|
27
27
|
/**
|
|
28
|
-
* Checks whether supplied argument is a TypedArray instance, such as
|
|
28
|
+
* Checks whether supplied argument is a TypedArray instance, such as Float32Array
|
|
29
29
|
* @template T
|
|
30
30
|
* @param {T} o
|
|
31
31
|
* @returns {boolean}
|
|
32
32
|
*/
|
|
33
33
|
function isTypedArray(o) {
|
|
34
|
+
const t = typeof o;
|
|
35
|
+
|
|
36
|
+
if(t !== "object"){
|
|
37
|
+
return false;
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
if(o === null){
|
|
41
|
+
// special case, null is treated as an object
|
|
42
|
+
return false;
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
const constructor = o.constructor;
|
|
46
|
+
|
|
34
47
|
return (
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
48
|
+
constructor === Uint8Array
|
|
49
|
+
|| constructor === Uint16Array
|
|
50
|
+
|| constructor === Uint32Array
|
|
51
|
+
|
|
52
|
+
|| constructor === Int8Array
|
|
53
|
+
|| constructor === Int16Array
|
|
54
|
+
|| constructor === Int32Array
|
|
55
|
+
|
|
56
|
+
|| constructor === Float32Array
|
|
57
|
+
|| constructor === Float64Array
|
|
58
|
+
|
|
59
|
+
|| constructor === BigUint64Array
|
|
60
|
+
|| constructor === BigInt64Array
|
|
44
61
|
);
|
|
45
62
|
}
|
|
46
63
|
|
|
@@ -49063,6 +49080,29 @@ function compute_binary_data_type_from_typed_array(array) {
|
|
|
49063
49080
|
}
|
|
49064
49081
|
}
|
|
49065
49082
|
|
|
49083
|
+
/**
|
|
49084
|
+
*
|
|
49085
|
+
* @param {number} a_offset
|
|
49086
|
+
* @param {number} b_offset
|
|
49087
|
+
* @param {number} byte_length
|
|
49088
|
+
* @returns {number}
|
|
49089
|
+
*/
|
|
49090
|
+
function largest_common_alignment_uint32(a_offset, b_offset, byte_length) {
|
|
49091
|
+
|
|
49092
|
+
const mask = a_offset | b_offset | byte_length;
|
|
49093
|
+
|
|
49094
|
+
if ((mask & 3) === 0) {
|
|
49095
|
+
// aligned on 4-byte boundary
|
|
49096
|
+
return 4
|
|
49097
|
+
} else if ((mask & 1) === 0) {
|
|
49098
|
+
// aligned on 2-byte boundary
|
|
49099
|
+
return 2;
|
|
49100
|
+
} else {
|
|
49101
|
+
// worst-case, assume 1-byte boundary
|
|
49102
|
+
return 1;
|
|
49103
|
+
}
|
|
49104
|
+
}
|
|
49105
|
+
|
|
49066
49106
|
//
|
|
49067
49107
|
|
|
49068
49108
|
/**
|
|
@@ -49127,11 +49167,11 @@ function is_typed_array_equals(a, b) {
|
|
|
49127
49167
|
|
|
49128
49168
|
const bytes_per_element = a_constructor.BYTES_PER_ELEMENT;
|
|
49129
49169
|
|
|
49170
|
+
const alignment = largest_common_alignment_uint32(a_offset, b_offset,byte_length);
|
|
49171
|
+
|
|
49130
49172
|
if (
|
|
49131
49173
|
bytes_per_element < 4
|
|
49132
|
-
&&
|
|
49133
|
-
&& a_offset % 4 === 0
|
|
49134
|
-
&& b_offset % 4 === 0
|
|
49174
|
+
&& alignment === 4
|
|
49135
49175
|
) {
|
|
49136
49176
|
|
|
49137
49177
|
// 4 byte alignment, can use uint32
|
|
@@ -49140,9 +49180,7 @@ function is_typed_array_equals(a, b) {
|
|
|
49140
49180
|
|
|
49141
49181
|
} else if (
|
|
49142
49182
|
bytes_per_element < 2
|
|
49143
|
-
&&
|
|
49144
|
-
&& a_offset % 2 === 0
|
|
49145
|
-
&& b_offset % 2 === 0
|
|
49183
|
+
&& alignment === 2
|
|
49146
49184
|
) {
|
|
49147
49185
|
|
|
49148
49186
|
// 2 byte alignment, can use uint16
|
package/package.json
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"array_buffer_copy.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/array_buffer_copy.js"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"array_buffer_copy.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/array_buffer_copy.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,0CANW,WAAW,iBACX,MAAM,UACN,WAAW,iBACX,MAAM,eACN,MAAM,QA2ChB"}
|
|
@@ -1,4 +1,5 @@
|
|
|
1
1
|
import { assert } from "../../../assert.js";
|
|
2
|
+
import { largest_common_alignment_uint32 } from "./largest_common_alignment_uint32.js";
|
|
2
3
|
|
|
3
4
|
/**
|
|
4
5
|
* This is essentially a {@link memcopy} implementation for ArrayBuffers
|
|
@@ -27,19 +28,17 @@ export function array_buffer_copy(
|
|
|
27
28
|
*/
|
|
28
29
|
let target_array;
|
|
29
30
|
|
|
31
|
+
const alignment = largest_common_alignment_uint32(source_offset,target_offset,byte_length);
|
|
32
|
+
|
|
30
33
|
if (
|
|
31
|
-
|
|
32
|
-
&& (target_offset & 3) === 0
|
|
33
|
-
&& (byte_length & 3) === 0
|
|
34
|
+
alignment === 4
|
|
34
35
|
) {
|
|
35
36
|
// aligned on 4-byte boundary
|
|
36
37
|
source_array = new Uint32Array(source, source_offset, byte_length >>> 2);
|
|
37
38
|
target_array = new Uint32Array(target, target_offset, byte_length >>> 2);
|
|
38
39
|
|
|
39
40
|
} else if (
|
|
40
|
-
|
|
41
|
-
&& (target_offset & 1) === 0
|
|
42
|
-
&& (byte_length & 1) === 0
|
|
41
|
+
alignment === 2
|
|
43
42
|
) {
|
|
44
43
|
// aligned on 2-byte boundary
|
|
45
44
|
source_array = new Uint16Array(source, source_offset, byte_length >>> 1);
|
|
@@ -52,4 +51,5 @@ export function array_buffer_copy(
|
|
|
52
51
|
}
|
|
53
52
|
|
|
54
53
|
target_array.set(source_array);
|
|
55
|
-
}
|
|
54
|
+
}
|
|
55
|
+
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"isTypedArray.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/isTypedArray.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,uCAFa,OAAO,
|
|
1
|
+
{"version":3,"file":"isTypedArray.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/isTypedArray.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,uCAFa,OAAO,CA+BnB"}
|
|
@@ -1,19 +1,36 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* Checks whether supplied argument is a TypedArray instance, such as
|
|
2
|
+
* Checks whether supplied argument is a TypedArray instance, such as Float32Array
|
|
3
3
|
* @template T
|
|
4
4
|
* @param {T} o
|
|
5
5
|
* @returns {boolean}
|
|
6
6
|
*/
|
|
7
7
|
export function isTypedArray(o) {
|
|
8
|
+
const t = typeof o;
|
|
9
|
+
|
|
10
|
+
if(t !== "object"){
|
|
11
|
+
return false;
|
|
12
|
+
}
|
|
13
|
+
|
|
14
|
+
if(o === null){
|
|
15
|
+
// special case, null is treated as an object
|
|
16
|
+
return false;
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
const constructor = o.constructor;
|
|
20
|
+
|
|
8
21
|
return (
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
22
|
+
constructor === Uint8Array
|
|
23
|
+
|| constructor === Uint16Array
|
|
24
|
+
|| constructor === Uint32Array
|
|
25
|
+
|
|
26
|
+
|| constructor === Int8Array
|
|
27
|
+
|| constructor === Int16Array
|
|
28
|
+
|| constructor === Int32Array
|
|
29
|
+
|
|
30
|
+
|| constructor === Float32Array
|
|
31
|
+
|| constructor === Float64Array
|
|
32
|
+
|
|
33
|
+
|| constructor === BigUint64Array
|
|
34
|
+
|| constructor === BigInt64Array
|
|
18
35
|
);
|
|
19
36
|
}
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
/**
|
|
2
|
+
*
|
|
3
|
+
* @param {ArrayBuffer} a
|
|
4
|
+
* @param {number} a_offset
|
|
5
|
+
* @param {ArrayBuffer} b
|
|
6
|
+
* @param {number} b_offset
|
|
7
|
+
* @param {number} length in bytes
|
|
8
|
+
* @returns {boolean}
|
|
9
|
+
*/
|
|
10
|
+
export function is_array_buffer_equals(a: ArrayBuffer, a_offset: number, b: ArrayBuffer, b_offset: number, length: number): boolean;
|
|
11
|
+
//# sourceMappingURL=is_array_buffer_equals.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"is_array_buffer_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_array_buffer_equals.js"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AACH,0CAPW,WAAW,YACX,MAAM,KACN,WAAW,YACX,MAAM,UACN,MAAM,GACJ,OAAO,CAiCnB"}
|
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
import { assert } from "../../../assert.js";
|
|
2
|
+
import { isArrayEqualStrict } from "../isArrayEqualStrict.js";
|
|
3
|
+
import { largest_common_alignment_uint32 } from "./largest_common_alignment_uint32.js";
|
|
4
|
+
|
|
5
|
+
/**
|
|
6
|
+
*
|
|
7
|
+
* @param {ArrayBuffer} a
|
|
8
|
+
* @param {number} a_offset
|
|
9
|
+
* @param {ArrayBuffer} b
|
|
10
|
+
* @param {number} b_offset
|
|
11
|
+
* @param {number} length in bytes
|
|
12
|
+
* @returns {boolean}
|
|
13
|
+
*/
|
|
14
|
+
export function is_array_buffer_equals(
|
|
15
|
+
a, a_offset,
|
|
16
|
+
b, b_offset,
|
|
17
|
+
length
|
|
18
|
+
) {
|
|
19
|
+
|
|
20
|
+
assert.isNonNegativeInteger(a_offset, 'a_offset');
|
|
21
|
+
assert.isNonNegativeInteger(b_offset, 'b_offset');
|
|
22
|
+
assert.isNonNegativeInteger(length, 'length');
|
|
23
|
+
|
|
24
|
+
if (a === b && a_offset === b_offset) {
|
|
25
|
+
// same buffer, same range
|
|
26
|
+
return true;
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
const alignment = largest_common_alignment_uint32(a_offset, b_offset, length);
|
|
30
|
+
|
|
31
|
+
let a_arr, b_arr;
|
|
32
|
+
|
|
33
|
+
if (alignment === 4) {
|
|
34
|
+
a_arr = new Uint32Array(a, a_offset, length >>> 2);
|
|
35
|
+
b_arr = new Uint32Array(b, b_offset, length >>> 2);
|
|
36
|
+
} else if (alignment === 2) {
|
|
37
|
+
a_arr = new Uint16Array(a, a_offset, length >>> 1);
|
|
38
|
+
b_arr = new Uint16Array(b, b_offset, length >>> 1);
|
|
39
|
+
} else {
|
|
40
|
+
a_arr = new Uint8Array(a, a_offset, length);
|
|
41
|
+
b_arr = new Uint8Array(b, b_offset, length);
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
return isArrayEqualStrict(a_arr, b_arr);
|
|
45
|
+
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAiFnB"}
|
|
@@ -1,5 +1,6 @@
|
|
|
1
1
|
//
|
|
2
2
|
import { isArrayEqualStrict } from "../isArrayEqualStrict.js";
|
|
3
|
+
import { largest_common_alignment_uint32 } from "./largest_common_alignment_uint32.js";
|
|
3
4
|
|
|
4
5
|
/**
|
|
5
6
|
* Optimized equality method for typed arrays, typically significantly faster than `isArrayEqualStrict`, especially for larger arrays
|
|
@@ -63,11 +64,11 @@ export function is_typed_array_equals(a, b) {
|
|
|
63
64
|
|
|
64
65
|
const bytes_per_element = a_constructor.BYTES_PER_ELEMENT;
|
|
65
66
|
|
|
67
|
+
const alignment = largest_common_alignment_uint32(a_offset, b_offset,byte_length);
|
|
68
|
+
|
|
66
69
|
if (
|
|
67
70
|
bytes_per_element < 4
|
|
68
|
-
&&
|
|
69
|
-
&& a_offset % 4 === 0
|
|
70
|
-
&& b_offset % 4 === 0
|
|
71
|
+
&& alignment === 4
|
|
71
72
|
) {
|
|
72
73
|
|
|
73
74
|
// 4 byte alignment, can use uint32
|
|
@@ -76,9 +77,7 @@ export function is_typed_array_equals(a, b) {
|
|
|
76
77
|
|
|
77
78
|
} else if (
|
|
78
79
|
bytes_per_element < 2
|
|
79
|
-
&&
|
|
80
|
-
&& a_offset % 2 === 0
|
|
81
|
-
&& b_offset % 2 === 0
|
|
80
|
+
&& alignment === 2
|
|
82
81
|
) {
|
|
83
82
|
|
|
84
83
|
// 2 byte alignment, can use uint16
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
/**
|
|
2
|
+
*
|
|
3
|
+
* @param {number} a_offset
|
|
4
|
+
* @param {number} b_offset
|
|
5
|
+
* @param {number} byte_length
|
|
6
|
+
* @returns {number}
|
|
7
|
+
*/
|
|
8
|
+
export function largest_common_alignment_uint32(a_offset: number, b_offset: number, byte_length: number): number;
|
|
9
|
+
//# sourceMappingURL=largest_common_alignment_uint32.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"largest_common_alignment_uint32.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/largest_common_alignment_uint32.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,0DALW,MAAM,YACN,MAAM,eACN,MAAM,GACJ,MAAM,CAoBlB"}
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
import { assert } from "../../../assert.js";
|
|
2
|
+
|
|
3
|
+
/**
|
|
4
|
+
*
|
|
5
|
+
* @param {number} a_offset
|
|
6
|
+
* @param {number} b_offset
|
|
7
|
+
* @param {number} byte_length
|
|
8
|
+
* @returns {number}
|
|
9
|
+
*/
|
|
10
|
+
export function largest_common_alignment_uint32(a_offset, b_offset, byte_length) {
|
|
11
|
+
|
|
12
|
+
assert.isNonNegativeInteger(a_offset, 'a_offset');
|
|
13
|
+
assert.isNonNegativeInteger(b_offset, 'b_offset');
|
|
14
|
+
assert.isNonNegativeInteger(byte_length, 'length');
|
|
15
|
+
|
|
16
|
+
const mask = a_offset | b_offset | byte_length;
|
|
17
|
+
|
|
18
|
+
if ((mask & 3) === 0) {
|
|
19
|
+
// aligned on 4-byte boundary
|
|
20
|
+
return 4
|
|
21
|
+
} else if ((mask & 1) === 0) {
|
|
22
|
+
// aligned on 2-byte boundary
|
|
23
|
+
return 2;
|
|
24
|
+
} else {
|
|
25
|
+
// worst-case, assume 1-byte boundary
|
|
26
|
+
return 1;
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"RenderPass.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/render/frame_graph/RenderPass.js"],"names":[],"mappings":"AAEA;;GAEG;AACH;IAsBI,
|
|
1
|
+
{"version":3,"file":"RenderPass.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/render/frame_graph/RenderPass.js"],"names":[],"mappings":"AAEA;;GAEG;AACH;IAsBI;;;OAGG;IACH,0BAQC;IAhCD;;;OAGG;IACH,MAFU,MAAM,CAEK;IAErB;;;OAGG;IACH,OAFU,MAAM,kBAAgB,CAEV;IAGtB;;;;OAIG;IACH,YAAY;IAiBZ;;;;OAIG;IACH,oCAFa,IAAI,CAIhB;IAED;;;;;OAKG;IACH,cALW,IAAI,mEAGF,IAAI,CAIhB;IAED;;;;;;OAMG;IACH,iCAFY,OAAO,CAIlB;CACJ"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CopyPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/deferred/CopyPass.js"],"names":[],"mappings":"AAEA;IAkBuC,
|
|
1
|
+
{"version":3,"file":"CopyPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/deferred/CopyPass.js"],"names":[],"mappings":"AAEA;IAkBuC,0BAA2Q;IAf9S;;MAUC;IAED,8DAEC;CACJ;2BApB0B,qBAAqB"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"GBufferDrawPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/deferred/GBufferDrawPass.js"],"names":[],"mappings":"AAGA;IAQ+B,
|
|
1
|
+
{"version":3,"file":"GBufferDrawPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/deferred/GBufferDrawPass.js"],"names":[],"mappings":"AAGA;IAQ+B,0BAQE;IAb7B;;;;MAqBC;IAED,8DAEC;CACJ;2BAhC0B,qBAAqB"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"LightingPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/deferred/LightingPass.js"],"names":[],"mappings":"AAEA;IAeI,
|
|
1
|
+
{"version":3,"file":"LightingPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/deferred/LightingPass.js"],"names":[],"mappings":"AAEA;IAeI,0BAM0K;IAlB1K;;MAYC;IAED,8DAEC;CACJ;2BAtB0B,qBAAqB"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"OutlinePass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/meep-v1/OutlinePass.js"],"names":[],"mappings":"AAEA;IAQsN,
|
|
1
|
+
{"version":3,"file":"OutlinePass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/meep-v1/OutlinePass.js"],"names":[],"mappings":"AAEA;IAQsN,0BAA2Q;IAP7d,0BAKC;CACJ;2BAT0B,qBAAqB"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"SSAOPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/meep-v1/SSAOPass.js"],"names":[],"mappings":"AAEA;IAGuU,
|
|
1
|
+
{"version":3,"file":"SSAOPass.d.ts","sourceRoot":"","sources":["../../../../../../../../src/engine/graphics/render/frame_graph/sample/meep-v1/SSAOPass.js"],"names":[],"mappings":"AAEA;IAGuU,0BAA2Q;CADjlB;2BAJ0B,qBAAqB"}
|