@woosh/meep-engine 2.75.9 → 2.76.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/build/meep.cjs +4 -2
- package/build/meep.module.js +4 -2
- package/package.json +1 -1
- package/src/core/binary/BitSet.js +4 -2
- package/src/core/collection/heap/Uin32Heap.spec.js +14 -1
- package/src/core/collection/heap/Uint32Heap.js +31 -16
- package/src/{engine/graphics → core/math/random}/generate_halton_jitter.js +2 -2
- package/src/engine/graphics/render/buffer/simple-fx/taa/TemporalSupersamplingRenderPlugin.js +1 -1
- package/src/engine/graphics/texture/virtual/VirtualTextureUsageUpdater.js +1 -1
- package/src/engine/navigation/grid/find_path_on_grid_astar.js +193 -124
- package/src/engine/navigation/grid/find_path_on_grid_astar.spec.js +75 -15
- package/src/engine/graphics/CanvasBlur.js +0 -599
- package/src/engine/graphics/material/LoadMaterial.js +0 -199
- package/src/engine/graphics/material/getTextureImmediate.js +0 -21
- package/src/engine/graphics/render/buffer/RenderGraph.js +0 -177
- package/src/engine/graphics/render/buffer/RenderGraphUtils.js +0 -32
- package/src/engine/graphics/render/buffer/buffers/DepthFrameBuffer.js +0 -101
- package/src/engine/graphics/render/buffer/conection/ProgramValueSlotConnection.js +0 -43
- package/src/engine/graphics/render/buffer/conection/ProgramValueSlotConnectionEndpoint.js +0 -39
- package/src/engine/graphics/render/buffer/conection/ProgramValueSlotConnectionValidator.js +0 -30
- package/src/engine/graphics/render/buffer/executor/FrameBufferPool.js +0 -127
- package/src/engine/graphics/render/buffer/executor/RenderGraphExecutor.js +0 -261
- package/src/engine/graphics/render/buffer/executor/RenderProgramCommandType.js +0 -5
- package/src/engine/graphics/render/buffer/node/DeferredRenderProgramDefinition.js +0 -142
- package/src/engine/graphics/render/buffer/node/RenderProgramDefinition.js +0 -21
- package/src/engine/graphics/render/buffer/node/RenderProgramInstance.js +0 -30
- package/src/engine/graphics/render/buffer/node/ScreenSpaceRenderProgramDefinition.js +0 -118
- package/src/engine/graphics/render/staged/PostProcessingEffect.js +0 -32
- package/src/engine/graphics/render/staged/PostProcessingEffectInputCoupling.js +0 -41
- package/src/engine/graphics/render/staged/PostProcessingStack.js +0 -29
- package/src/engine/graphics/render/staged/StagedRenderer.js +0 -161
- package/src/engine/graphics/render/staged/StandardRenderOutputs.js +0 -20
- package/src/engine/graphics/texture/CanvasClone.js +0 -28
- package/src/engine/graphics/texture/sampler/differenceSampler.js +0 -36
- package/src/engine/graphics/texture/sampler/loadSampler2D.js +0 -41
- package/src/engine/graphics/texture/sampler/mergeSampler2D.js +0 -96
- package/src/engine/graphics/texture/sampler/rgbaData2valueSampler2D.js +0 -38
- /package/src/{engine/graphics/texture → core/math/noise}/noise_octaves.js +0 -0
|
@@ -1,32 +1,92 @@
|
|
|
1
|
+
import { randomIntegerBetween } from "../../../core/math/random/randomIntegerBetween.js";
|
|
2
|
+
import { seededRandom } from "../../../core/math/random/seededRandom.js";
|
|
3
|
+
import { number_pretty_print } from "../../../core/primitives/numbers/number_pretty_print.js";
|
|
1
4
|
import { find_path_on_grid_astar } from "./find_path_on_grid_astar.js";
|
|
2
5
|
|
|
3
6
|
test("sanity check on 1x1 grid", () => {
|
|
4
|
-
const path = find_path_on_grid_astar([0], 1, 1, 0, 0, 0,
|
|
7
|
+
const path = find_path_on_grid_astar([0], 1, 1, 0, 0, 0, 1);
|
|
5
8
|
|
|
6
9
|
expect(path).toEqual([0]);
|
|
7
10
|
});
|
|
8
11
|
|
|
9
12
|
test("sanity check on 2x1 grid", () => {
|
|
10
|
-
const path = find_path_on_grid_astar(
|
|
11
|
-
[0, 0], 2, 1,
|
|
12
|
-
0, 1,
|
|
13
|
-
0, 0, 1
|
|
14
|
-
);
|
|
13
|
+
const path = find_path_on_grid_astar([0, 0], 2, 1, 0, 1, 0, 1);
|
|
15
14
|
|
|
16
15
|
expect(path).toEqual([0, 1]);
|
|
17
16
|
});
|
|
18
17
|
|
|
19
18
|
test("sanity check on 2x2 grid", () => {
|
|
20
19
|
|
|
21
|
-
const path = find_path_on_grid_astar(
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
],
|
|
26
|
-
2, 2,
|
|
27
|
-
0, 3,
|
|
28
|
-
0, 0, 1
|
|
29
|
-
);
|
|
20
|
+
const path = find_path_on_grid_astar([
|
|
21
|
+
0, 0,
|
|
22
|
+
1, 0
|
|
23
|
+
], 2, 2, 0, 3, 0, 1);
|
|
30
24
|
|
|
31
25
|
expect(path).toEqual([0, 1, 3]);
|
|
32
26
|
});
|
|
27
|
+
|
|
28
|
+
test("path on open 3x3 grid", () => {
|
|
29
|
+
|
|
30
|
+
const path = find_path_on_grid_astar([
|
|
31
|
+
0, 0, 0,
|
|
32
|
+
0, 0, 0,
|
|
33
|
+
0, 0, 0
|
|
34
|
+
], 3, 3, 0, 8, 0, 1);
|
|
35
|
+
|
|
36
|
+
expect(path).toEqual([0, 6, 8]);
|
|
37
|
+
});
|
|
38
|
+
|
|
39
|
+
test("performance, 256x256 random", () => {
|
|
40
|
+
const FIELD_SIZE = 256;
|
|
41
|
+
|
|
42
|
+
const field = new Uint8Array(FIELD_SIZE * FIELD_SIZE);
|
|
43
|
+
|
|
44
|
+
const random = seededRandom(42);
|
|
45
|
+
|
|
46
|
+
const last_field_index = field.length - 1;
|
|
47
|
+
|
|
48
|
+
for (let i = 0; i < field.length * 0.05; i++) {
|
|
49
|
+
const index = randomIntegerBetween(random, 0, last_field_index);
|
|
50
|
+
|
|
51
|
+
field[index] = 255;
|
|
52
|
+
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
const SAMPLE_COUNT = 10000;
|
|
56
|
+
|
|
57
|
+
const coordinates = new Uint32Array(SAMPLE_COUNT * 2);
|
|
58
|
+
|
|
59
|
+
for (let i = 0; i < SAMPLE_COUNT * 2; i++) {
|
|
60
|
+
//build non-blocking point pairs for rout endpoints
|
|
61
|
+
const index = randomIntegerBetween(random, 0, last_field_index);
|
|
62
|
+
|
|
63
|
+
if (field[index] !== 0) {
|
|
64
|
+
i--;
|
|
65
|
+
continue;
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
coordinates[i] = index;
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
const t0 = performance.now();
|
|
72
|
+
|
|
73
|
+
for (let i = 0; i < SAMPLE_COUNT; i++) {
|
|
74
|
+
|
|
75
|
+
const i2 = i * 2;
|
|
76
|
+
const start = coordinates[i2];
|
|
77
|
+
const goal = coordinates[i2 + 1];
|
|
78
|
+
|
|
79
|
+
find_path_on_grid_astar(
|
|
80
|
+
field,
|
|
81
|
+
FIELD_SIZE, FIELD_SIZE,
|
|
82
|
+
start,
|
|
83
|
+
goal, 1, 255
|
|
84
|
+
);
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
const t1 = performance.now();
|
|
88
|
+
|
|
89
|
+
const duration = t1 - t0;
|
|
90
|
+
|
|
91
|
+
console.log(`${number_pretty_print(SAMPLE_COUNT)} paths, ${number_pretty_print(duration / SAMPLE_COUNT)}ms per path`);
|
|
92
|
+
});
|
|
@@ -1,599 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* User: Alex Goldring
|
|
3
|
-
* Date: 29/9/2014
|
|
4
|
-
* Time: 19:35
|
|
5
|
-
*/
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
/*
|
|
9
|
-
|
|
10
|
-
StackBlur - a fast almost Gaussian Blur For Canvas
|
|
11
|
-
|
|
12
|
-
Version: 0.5
|
|
13
|
-
Author: Mario Klingemann
|
|
14
|
-
Contact: mario@quasimondo.com
|
|
15
|
-
Website: http://www.quasimondo.com/StackBlurForCanvas
|
|
16
|
-
Twitter: @quasimondo
|
|
17
|
-
|
|
18
|
-
In case you find this class useful - especially in commercial projects -
|
|
19
|
-
I am not totally unhappy for a small donation to my PayPal account
|
|
20
|
-
mario@quasimondo.de
|
|
21
|
-
|
|
22
|
-
Or support me on flattr:
|
|
23
|
-
https://flattr.com/thing/72791/StackBlur-a-fast-almost-Gaussian-Blur-Effect-for-CanvasJavascript
|
|
24
|
-
|
|
25
|
-
Copyright (c) 2010 Mario Klingemann
|
|
26
|
-
|
|
27
|
-
Permission is hereby granted, free of charge, to any person
|
|
28
|
-
obtaining a copy of this software and associated documentation
|
|
29
|
-
files (the "Software"), to deal in the Software without
|
|
30
|
-
restriction, including without limitation the rights to use,
|
|
31
|
-
copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
32
|
-
copies of the Software, and to permit persons to whom the
|
|
33
|
-
Software is furnished to do so, subject to the following
|
|
34
|
-
conditions:
|
|
35
|
-
|
|
36
|
-
The above copyright notice and this permission notice shall be
|
|
37
|
-
included in all copies or substantial portions of the Software.
|
|
38
|
-
|
|
39
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
40
|
-
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
41
|
-
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
42
|
-
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
43
|
-
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
44
|
-
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
45
|
-
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
46
|
-
OTHER DEALINGS IN THE SOFTWARE.
|
|
47
|
-
*/
|
|
48
|
-
|
|
49
|
-
const mul_table = [
|
|
50
|
-
512, 512, 456, 512, 328, 456, 335, 512, 405, 328, 271, 456, 388, 335, 292, 512,
|
|
51
|
-
454, 405, 364, 328, 298, 271, 496, 456, 420, 388, 360, 335, 312, 292, 273, 512,
|
|
52
|
-
482, 454, 428, 405, 383, 364, 345, 328, 312, 298, 284, 271, 259, 496, 475, 456,
|
|
53
|
-
437, 420, 404, 388, 374, 360, 347, 335, 323, 312, 302, 292, 282, 273, 265, 512,
|
|
54
|
-
497, 482, 468, 454, 441, 428, 417, 405, 394, 383, 373, 364, 354, 345, 337, 328,
|
|
55
|
-
320, 312, 305, 298, 291, 284, 278, 271, 265, 259, 507, 496, 485, 475, 465, 456,
|
|
56
|
-
446, 437, 428, 420, 412, 404, 396, 388, 381, 374, 367, 360, 354, 347, 341, 335,
|
|
57
|
-
329, 323, 318, 312, 307, 302, 297, 292, 287, 282, 278, 273, 269, 265, 261, 512,
|
|
58
|
-
505, 497, 489, 482, 475, 468, 461, 454, 447, 441, 435, 428, 422, 417, 411, 405,
|
|
59
|
-
399, 394, 389, 383, 378, 373, 368, 364, 359, 354, 350, 345, 341, 337, 332, 328,
|
|
60
|
-
324, 320, 316, 312, 309, 305, 301, 298, 294, 291, 287, 284, 281, 278, 274, 271,
|
|
61
|
-
268, 265, 262, 259, 257, 507, 501, 496, 491, 485, 480, 475, 470, 465, 460, 456,
|
|
62
|
-
451, 446, 442, 437, 433, 428, 424, 420, 416, 412, 408, 404, 400, 396, 392, 388,
|
|
63
|
-
385, 381, 377, 374, 370, 367, 363, 360, 357, 354, 350, 347, 344, 341, 338, 335,
|
|
64
|
-
332, 329, 326, 323, 320, 318, 315, 312, 310, 307, 304, 302, 299, 297, 294, 292,
|
|
65
|
-
289, 287, 285, 282, 280, 278, 275, 273, 271, 269, 267, 265, 263, 261, 259];
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
const shg_table = [
|
|
69
|
-
9, 11, 12, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17,
|
|
70
|
-
17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19,
|
|
71
|
-
19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20,
|
|
72
|
-
20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21,
|
|
73
|
-
21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
|
|
74
|
-
21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22,
|
|
75
|
-
22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22,
|
|
76
|
-
22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23,
|
|
77
|
-
23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
|
|
78
|
-
23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
|
|
79
|
-
23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
|
|
80
|
-
23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
|
|
81
|
-
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
|
|
82
|
-
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
|
|
83
|
-
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
|
|
84
|
-
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24];
|
|
85
|
-
|
|
86
|
-
/**
|
|
87
|
-
*
|
|
88
|
-
* @param {string} imageID
|
|
89
|
-
* @param {string} canvasID
|
|
90
|
-
* @param {number} radius
|
|
91
|
-
* @param {boolean} blurAlphaChannel
|
|
92
|
-
*/
|
|
93
|
-
function stackBlurImage(imageID, canvasID, radius, blurAlphaChannel) {
|
|
94
|
-
|
|
95
|
-
const img = document.getElementById(imageID);
|
|
96
|
-
const w = img.naturalWidth;
|
|
97
|
-
const h = img.naturalHeight;
|
|
98
|
-
|
|
99
|
-
const canvas = document.getElementById(canvasID);
|
|
100
|
-
|
|
101
|
-
canvas.style.width = w + "px";
|
|
102
|
-
canvas.style.height = h + "px";
|
|
103
|
-
canvas.width = w;
|
|
104
|
-
canvas.height = h;
|
|
105
|
-
|
|
106
|
-
const context = canvas.getContext("2d");
|
|
107
|
-
context.clearRect(0, 0, w, h);
|
|
108
|
-
context.drawImage(img, 0, 0);
|
|
109
|
-
|
|
110
|
-
if (isNaN(radius) || radius < 1) return;
|
|
111
|
-
|
|
112
|
-
if (blurAlphaChannel)
|
|
113
|
-
stackBlurCanvasRGBA(canvasID, 0, 0, w, h, radius);
|
|
114
|
-
else
|
|
115
|
-
stackBlurCanvasRGB(canvasID, 0, 0, w, h, radius);
|
|
116
|
-
}
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
function stackBlurCanvasRGBA(id, top_x, top_y, width, height, radius) {
|
|
120
|
-
if (isNaN(radius) || radius < 1) return;
|
|
121
|
-
radius |= 0;
|
|
122
|
-
|
|
123
|
-
const canvas = document.getElementById(id);
|
|
124
|
-
const context = canvas.getContext("2d");
|
|
125
|
-
let imageData;
|
|
126
|
-
|
|
127
|
-
try {
|
|
128
|
-
try {
|
|
129
|
-
imageData = context.getImageData(top_x, top_y, width, height);
|
|
130
|
-
} catch (e) {
|
|
131
|
-
|
|
132
|
-
// NOTE: this part is supposedly only needed if you want to work with local files
|
|
133
|
-
// so it might be okay to remove the whole try/catch block and just use
|
|
134
|
-
// imageData = context.getImageData( top_x, top_y, width, height );
|
|
135
|
-
try {
|
|
136
|
-
netscape.security.PrivilegeManager.enablePrivilege("UniversalBrowserRead");
|
|
137
|
-
imageData = context.getImageData(top_x, top_y, width, height);
|
|
138
|
-
} catch (e) {
|
|
139
|
-
alert("Cannot access local image");
|
|
140
|
-
throw new Error("unable to access local image data: " + e);
|
|
141
|
-
return;
|
|
142
|
-
}
|
|
143
|
-
}
|
|
144
|
-
} catch (e) {
|
|
145
|
-
alert("Cannot access image");
|
|
146
|
-
throw new Error("unable to access image data: " + e);
|
|
147
|
-
}
|
|
148
|
-
|
|
149
|
-
const pixels = imageData.data;
|
|
150
|
-
|
|
151
|
-
let x, y, i, p, yp, yi, yw, r_sum, g_sum, b_sum, a_sum,
|
|
152
|
-
r_out_sum, g_out_sum, b_out_sum, a_out_sum,
|
|
153
|
-
r_in_sum, g_in_sum, b_in_sum, a_in_sum,
|
|
154
|
-
pr, pg, pb, pa, rbs;
|
|
155
|
-
|
|
156
|
-
const div = radius + radius + 1;
|
|
157
|
-
let w4 = width << 2;
|
|
158
|
-
const widthMinus1 = width - 1;
|
|
159
|
-
const heightMinus1 = height - 1;
|
|
160
|
-
const radiusPlus1 = radius + 1;
|
|
161
|
-
const sumFactor = radiusPlus1 * (radiusPlus1 + 1) / 2;
|
|
162
|
-
|
|
163
|
-
const stackStart = new BlurStack();
|
|
164
|
-
let stack = stackStart;
|
|
165
|
-
for (i = 1; i < div; i++) {
|
|
166
|
-
stack = stack.next = new BlurStack();
|
|
167
|
-
if (i == radiusPlus1) var stackEnd = stack;
|
|
168
|
-
}
|
|
169
|
-
stack.next = stackStart;
|
|
170
|
-
let stackIn = null;
|
|
171
|
-
let stackOut = null;
|
|
172
|
-
|
|
173
|
-
yw = yi = 0;
|
|
174
|
-
|
|
175
|
-
const mul_sum = mul_table[radius];
|
|
176
|
-
const shg_sum = shg_table[radius];
|
|
177
|
-
|
|
178
|
-
for (y = 0; y < height; y++) {
|
|
179
|
-
r_in_sum = g_in_sum = b_in_sum = a_in_sum = r_sum = g_sum = b_sum = a_sum = 0;
|
|
180
|
-
|
|
181
|
-
r_out_sum = radiusPlus1 * (pr = pixels[yi]);
|
|
182
|
-
g_out_sum = radiusPlus1 * (pg = pixels[yi + 1]);
|
|
183
|
-
b_out_sum = radiusPlus1 * (pb = pixels[yi + 2]);
|
|
184
|
-
a_out_sum = radiusPlus1 * (pa = pixels[yi + 3]);
|
|
185
|
-
|
|
186
|
-
r_sum += sumFactor * pr;
|
|
187
|
-
g_sum += sumFactor * pg;
|
|
188
|
-
b_sum += sumFactor * pb;
|
|
189
|
-
a_sum += sumFactor * pa;
|
|
190
|
-
|
|
191
|
-
stack = stackStart;
|
|
192
|
-
|
|
193
|
-
for (i = 0; i < radiusPlus1; i++) {
|
|
194
|
-
stack.r = pr;
|
|
195
|
-
stack.g = pg;
|
|
196
|
-
stack.b = pb;
|
|
197
|
-
stack.a = pa;
|
|
198
|
-
stack = stack.next;
|
|
199
|
-
}
|
|
200
|
-
|
|
201
|
-
for (i = 1; i < radiusPlus1; i++) {
|
|
202
|
-
p = yi + ((widthMinus1 < i ? widthMinus1 : i) << 2);
|
|
203
|
-
r_sum += (stack.r = (pr = pixels[p])) * (rbs = radiusPlus1 - i);
|
|
204
|
-
g_sum += (stack.g = (pg = pixels[p + 1])) * rbs;
|
|
205
|
-
b_sum += (stack.b = (pb = pixels[p + 2])) * rbs;
|
|
206
|
-
a_sum += (stack.a = (pa = pixels[p + 3])) * rbs;
|
|
207
|
-
|
|
208
|
-
r_in_sum += pr;
|
|
209
|
-
g_in_sum += pg;
|
|
210
|
-
b_in_sum += pb;
|
|
211
|
-
a_in_sum += pa;
|
|
212
|
-
|
|
213
|
-
stack = stack.next;
|
|
214
|
-
}
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
stackIn = stackStart;
|
|
218
|
-
stackOut = stackEnd;
|
|
219
|
-
for (x = 0; x < width; x++) {
|
|
220
|
-
pixels[yi + 3] = pa = (a_sum * mul_sum) >> shg_sum;
|
|
221
|
-
if (pa != 0) {
|
|
222
|
-
pa = 255 / pa;
|
|
223
|
-
pixels[yi] = ((r_sum * mul_sum) >> shg_sum) * pa;
|
|
224
|
-
pixels[yi + 1] = ((g_sum * mul_sum) >> shg_sum) * pa;
|
|
225
|
-
pixels[yi + 2] = ((b_sum * mul_sum) >> shg_sum) * pa;
|
|
226
|
-
} else {
|
|
227
|
-
pixels[yi] = pixels[yi + 1] = pixels[yi + 2] = 0;
|
|
228
|
-
}
|
|
229
|
-
|
|
230
|
-
r_sum -= r_out_sum;
|
|
231
|
-
g_sum -= g_out_sum;
|
|
232
|
-
b_sum -= b_out_sum;
|
|
233
|
-
a_sum -= a_out_sum;
|
|
234
|
-
|
|
235
|
-
r_out_sum -= stackIn.r;
|
|
236
|
-
g_out_sum -= stackIn.g;
|
|
237
|
-
b_out_sum -= stackIn.b;
|
|
238
|
-
a_out_sum -= stackIn.a;
|
|
239
|
-
|
|
240
|
-
p = (yw + ((p = x + radius + 1) < widthMinus1 ? p : widthMinus1)) << 2;
|
|
241
|
-
|
|
242
|
-
r_in_sum += (stackIn.r = pixels[p]);
|
|
243
|
-
g_in_sum += (stackIn.g = pixels[p + 1]);
|
|
244
|
-
b_in_sum += (stackIn.b = pixels[p + 2]);
|
|
245
|
-
a_in_sum += (stackIn.a = pixels[p + 3]);
|
|
246
|
-
|
|
247
|
-
r_sum += r_in_sum;
|
|
248
|
-
g_sum += g_in_sum;
|
|
249
|
-
b_sum += b_in_sum;
|
|
250
|
-
a_sum += a_in_sum;
|
|
251
|
-
|
|
252
|
-
stackIn = stackIn.next;
|
|
253
|
-
|
|
254
|
-
r_out_sum += (pr = stackOut.r);
|
|
255
|
-
g_out_sum += (pg = stackOut.g);
|
|
256
|
-
b_out_sum += (pb = stackOut.b);
|
|
257
|
-
a_out_sum += (pa = stackOut.a);
|
|
258
|
-
|
|
259
|
-
r_in_sum -= pr;
|
|
260
|
-
g_in_sum -= pg;
|
|
261
|
-
b_in_sum -= pb;
|
|
262
|
-
a_in_sum -= pa;
|
|
263
|
-
|
|
264
|
-
stackOut = stackOut.next;
|
|
265
|
-
|
|
266
|
-
yi += 4;
|
|
267
|
-
}
|
|
268
|
-
yw += width;
|
|
269
|
-
}
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
for (x = 0; x < width; x++) {
|
|
273
|
-
g_in_sum = b_in_sum = a_in_sum = r_in_sum = g_sum = b_sum = a_sum = r_sum = 0;
|
|
274
|
-
|
|
275
|
-
yi = x << 2;
|
|
276
|
-
r_out_sum = radiusPlus1 * (pr = pixels[yi]);
|
|
277
|
-
g_out_sum = radiusPlus1 * (pg = pixels[yi + 1]);
|
|
278
|
-
b_out_sum = radiusPlus1 * (pb = pixels[yi + 2]);
|
|
279
|
-
a_out_sum = radiusPlus1 * (pa = pixels[yi + 3]);
|
|
280
|
-
|
|
281
|
-
r_sum += sumFactor * pr;
|
|
282
|
-
g_sum += sumFactor * pg;
|
|
283
|
-
b_sum += sumFactor * pb;
|
|
284
|
-
a_sum += sumFactor * pa;
|
|
285
|
-
|
|
286
|
-
stack = stackStart;
|
|
287
|
-
|
|
288
|
-
for (i = 0; i < radiusPlus1; i++) {
|
|
289
|
-
stack.r = pr;
|
|
290
|
-
stack.g = pg;
|
|
291
|
-
stack.b = pb;
|
|
292
|
-
stack.a = pa;
|
|
293
|
-
stack = stack.next;
|
|
294
|
-
}
|
|
295
|
-
|
|
296
|
-
yp = width;
|
|
297
|
-
|
|
298
|
-
for (i = 1; i <= radius; i++) {
|
|
299
|
-
yi = (yp + x) << 2;
|
|
300
|
-
|
|
301
|
-
r_sum += (stack.r = (pr = pixels[yi])) * (rbs = radiusPlus1 - i);
|
|
302
|
-
g_sum += (stack.g = (pg = pixels[yi + 1])) * rbs;
|
|
303
|
-
b_sum += (stack.b = (pb = pixels[yi + 2])) * rbs;
|
|
304
|
-
a_sum += (stack.a = (pa = pixels[yi + 3])) * rbs;
|
|
305
|
-
|
|
306
|
-
r_in_sum += pr;
|
|
307
|
-
g_in_sum += pg;
|
|
308
|
-
b_in_sum += pb;
|
|
309
|
-
a_in_sum += pa;
|
|
310
|
-
|
|
311
|
-
stack = stack.next;
|
|
312
|
-
|
|
313
|
-
if (i < heightMinus1) {
|
|
314
|
-
yp += width;
|
|
315
|
-
}
|
|
316
|
-
}
|
|
317
|
-
|
|
318
|
-
yi = x;
|
|
319
|
-
stackIn = stackStart;
|
|
320
|
-
stackOut = stackEnd;
|
|
321
|
-
for (y = 0; y < height; y++) {
|
|
322
|
-
p = yi << 2;
|
|
323
|
-
pixels[p + 3] = pa = (a_sum * mul_sum) >> shg_sum;
|
|
324
|
-
if (pa > 0) {
|
|
325
|
-
pa = 255 / pa;
|
|
326
|
-
pixels[p] = ((r_sum * mul_sum) >> shg_sum) * pa;
|
|
327
|
-
pixels[p + 1] = ((g_sum * mul_sum) >> shg_sum) * pa;
|
|
328
|
-
pixels[p + 2] = ((b_sum * mul_sum) >> shg_sum) * pa;
|
|
329
|
-
} else {
|
|
330
|
-
pixels[p] = pixels[p + 1] = pixels[p + 2] = 0;
|
|
331
|
-
}
|
|
332
|
-
|
|
333
|
-
r_sum -= r_out_sum;
|
|
334
|
-
g_sum -= g_out_sum;
|
|
335
|
-
b_sum -= b_out_sum;
|
|
336
|
-
a_sum -= a_out_sum;
|
|
337
|
-
|
|
338
|
-
r_out_sum -= stackIn.r;
|
|
339
|
-
g_out_sum -= stackIn.g;
|
|
340
|
-
b_out_sum -= stackIn.b;
|
|
341
|
-
a_out_sum -= stackIn.a;
|
|
342
|
-
|
|
343
|
-
p = (x + (((p = y + radiusPlus1) < heightMinus1 ? p : heightMinus1) * width)) << 2;
|
|
344
|
-
|
|
345
|
-
r_sum += (r_in_sum += (stackIn.r = pixels[p]));
|
|
346
|
-
g_sum += (g_in_sum += (stackIn.g = pixels[p + 1]));
|
|
347
|
-
b_sum += (b_in_sum += (stackIn.b = pixels[p + 2]));
|
|
348
|
-
a_sum += (a_in_sum += (stackIn.a = pixels[p + 3]));
|
|
349
|
-
|
|
350
|
-
stackIn = stackIn.next;
|
|
351
|
-
|
|
352
|
-
r_out_sum += (pr = stackOut.r);
|
|
353
|
-
g_out_sum += (pg = stackOut.g);
|
|
354
|
-
b_out_sum += (pb = stackOut.b);
|
|
355
|
-
a_out_sum += (pa = stackOut.a);
|
|
356
|
-
|
|
357
|
-
r_in_sum -= pr;
|
|
358
|
-
g_in_sum -= pg;
|
|
359
|
-
b_in_sum -= pb;
|
|
360
|
-
a_in_sum -= pa;
|
|
361
|
-
|
|
362
|
-
stackOut = stackOut.next;
|
|
363
|
-
|
|
364
|
-
yi += width;
|
|
365
|
-
}
|
|
366
|
-
}
|
|
367
|
-
|
|
368
|
-
context.putImageData(imageData, top_x, top_y);
|
|
369
|
-
|
|
370
|
-
}
|
|
371
|
-
|
|
372
|
-
|
|
373
|
-
function stackBlurCanvasRGB(id, top_x, top_y, width, height, radius) {
|
|
374
|
-
if (isNaN(radius) || radius < 1) return;
|
|
375
|
-
radius |= 0;
|
|
376
|
-
|
|
377
|
-
const canvas = document.getElementById(id);
|
|
378
|
-
const context = canvas.getContext("2d");
|
|
379
|
-
let imageData;
|
|
380
|
-
|
|
381
|
-
try {
|
|
382
|
-
try {
|
|
383
|
-
imageData = context.getImageData(top_x, top_y, width, height);
|
|
384
|
-
} catch (e) {
|
|
385
|
-
|
|
386
|
-
// NOTE: this part is supposedly only needed if you want to work with local files
|
|
387
|
-
// so it might be okay to remove the whole try/catch block and just use
|
|
388
|
-
// imageData = context.getImageData( top_x, top_y, width, height );
|
|
389
|
-
try {
|
|
390
|
-
netscape.security.PrivilegeManager.enablePrivilege("UniversalBrowserRead");
|
|
391
|
-
imageData = context.getImageData(top_x, top_y, width, height);
|
|
392
|
-
} catch (e) {
|
|
393
|
-
alert("Cannot access local image");
|
|
394
|
-
throw new Error("unable to access local image data: " + e);
|
|
395
|
-
return;
|
|
396
|
-
}
|
|
397
|
-
}
|
|
398
|
-
} catch (e) {
|
|
399
|
-
alert("Cannot access image");
|
|
400
|
-
throw new Error("unable to access image data: " + e);
|
|
401
|
-
}
|
|
402
|
-
|
|
403
|
-
const pixels = imageData.data;
|
|
404
|
-
|
|
405
|
-
let x, y, i, p, yp, yi, yw, r_sum, g_sum, b_sum,
|
|
406
|
-
r_out_sum, g_out_sum, b_out_sum,
|
|
407
|
-
r_in_sum, g_in_sum, b_in_sum,
|
|
408
|
-
pr, pg, pb, rbs;
|
|
409
|
-
|
|
410
|
-
const div = radius + radius + 1;
|
|
411
|
-
let w4 = width << 2;
|
|
412
|
-
const widthMinus1 = width - 1;
|
|
413
|
-
const heightMinus1 = height - 1;
|
|
414
|
-
const radiusPlus1 = radius + 1;
|
|
415
|
-
const sumFactor = radiusPlus1 * (radiusPlus1 + 1) / 2;
|
|
416
|
-
|
|
417
|
-
const stackStart = new BlurStack();
|
|
418
|
-
let stack = stackStart;
|
|
419
|
-
for (i = 1; i < div; i++) {
|
|
420
|
-
stack = stack.next = new BlurStack();
|
|
421
|
-
if (i == radiusPlus1) var stackEnd = stack;
|
|
422
|
-
}
|
|
423
|
-
stack.next = stackStart;
|
|
424
|
-
let stackIn = null;
|
|
425
|
-
let stackOut = null;
|
|
426
|
-
|
|
427
|
-
yw = yi = 0;
|
|
428
|
-
|
|
429
|
-
const mul_sum = mul_table[radius];
|
|
430
|
-
const shg_sum = shg_table[radius];
|
|
431
|
-
|
|
432
|
-
for (y = 0; y < height; y++) {
|
|
433
|
-
r_in_sum = g_in_sum = b_in_sum = r_sum = g_sum = b_sum = 0;
|
|
434
|
-
|
|
435
|
-
r_out_sum = radiusPlus1 * (pr = pixels[yi]);
|
|
436
|
-
g_out_sum = radiusPlus1 * (pg = pixels[yi + 1]);
|
|
437
|
-
b_out_sum = radiusPlus1 * (pb = pixels[yi + 2]);
|
|
438
|
-
|
|
439
|
-
r_sum += sumFactor * pr;
|
|
440
|
-
g_sum += sumFactor * pg;
|
|
441
|
-
b_sum += sumFactor * pb;
|
|
442
|
-
|
|
443
|
-
stack = stackStart;
|
|
444
|
-
|
|
445
|
-
for (i = 0; i < radiusPlus1; i++) {
|
|
446
|
-
stack.r = pr;
|
|
447
|
-
stack.g = pg;
|
|
448
|
-
stack.b = pb;
|
|
449
|
-
stack = stack.next;
|
|
450
|
-
}
|
|
451
|
-
|
|
452
|
-
for (i = 1; i < radiusPlus1; i++) {
|
|
453
|
-
p = yi + ((widthMinus1 < i ? widthMinus1 : i) << 2);
|
|
454
|
-
r_sum += (stack.r = (pr = pixels[p])) * (rbs = radiusPlus1 - i);
|
|
455
|
-
g_sum += (stack.g = (pg = pixels[p + 1])) * rbs;
|
|
456
|
-
b_sum += (stack.b = (pb = pixels[p + 2])) * rbs;
|
|
457
|
-
|
|
458
|
-
r_in_sum += pr;
|
|
459
|
-
g_in_sum += pg;
|
|
460
|
-
b_in_sum += pb;
|
|
461
|
-
|
|
462
|
-
stack = stack.next;
|
|
463
|
-
}
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
stackIn = stackStart;
|
|
467
|
-
stackOut = stackEnd;
|
|
468
|
-
for (x = 0; x < width; x++) {
|
|
469
|
-
pixels[yi] = (r_sum * mul_sum) >> shg_sum;
|
|
470
|
-
pixels[yi + 1] = (g_sum * mul_sum) >> shg_sum;
|
|
471
|
-
pixels[yi + 2] = (b_sum * mul_sum) >> shg_sum;
|
|
472
|
-
|
|
473
|
-
r_sum -= r_out_sum;
|
|
474
|
-
g_sum -= g_out_sum;
|
|
475
|
-
b_sum -= b_out_sum;
|
|
476
|
-
|
|
477
|
-
r_out_sum -= stackIn.r;
|
|
478
|
-
g_out_sum -= stackIn.g;
|
|
479
|
-
b_out_sum -= stackIn.b;
|
|
480
|
-
|
|
481
|
-
p = (yw + ((p = x + radius + 1) < widthMinus1 ? p : widthMinus1)) << 2;
|
|
482
|
-
|
|
483
|
-
r_in_sum += (stackIn.r = pixels[p]);
|
|
484
|
-
g_in_sum += (stackIn.g = pixels[p + 1]);
|
|
485
|
-
b_in_sum += (stackIn.b = pixels[p + 2]);
|
|
486
|
-
|
|
487
|
-
r_sum += r_in_sum;
|
|
488
|
-
g_sum += g_in_sum;
|
|
489
|
-
b_sum += b_in_sum;
|
|
490
|
-
|
|
491
|
-
stackIn = stackIn.next;
|
|
492
|
-
|
|
493
|
-
r_out_sum += (pr = stackOut.r);
|
|
494
|
-
g_out_sum += (pg = stackOut.g);
|
|
495
|
-
b_out_sum += (pb = stackOut.b);
|
|
496
|
-
|
|
497
|
-
r_in_sum -= pr;
|
|
498
|
-
g_in_sum -= pg;
|
|
499
|
-
b_in_sum -= pb;
|
|
500
|
-
|
|
501
|
-
stackOut = stackOut.next;
|
|
502
|
-
|
|
503
|
-
yi += 4;
|
|
504
|
-
}
|
|
505
|
-
yw += width;
|
|
506
|
-
}
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
for (x = 0; x < width; x++) {
|
|
510
|
-
g_in_sum = b_in_sum = r_in_sum = g_sum = b_sum = r_sum = 0;
|
|
511
|
-
|
|
512
|
-
yi = x << 2;
|
|
513
|
-
r_out_sum = radiusPlus1 * (pr = pixels[yi]);
|
|
514
|
-
g_out_sum = radiusPlus1 * (pg = pixels[yi + 1]);
|
|
515
|
-
b_out_sum = radiusPlus1 * (pb = pixels[yi + 2]);
|
|
516
|
-
|
|
517
|
-
r_sum += sumFactor * pr;
|
|
518
|
-
g_sum += sumFactor * pg;
|
|
519
|
-
b_sum += sumFactor * pb;
|
|
520
|
-
|
|
521
|
-
stack = stackStart;
|
|
522
|
-
|
|
523
|
-
for (i = 0; i < radiusPlus1; i++) {
|
|
524
|
-
stack.r = pr;
|
|
525
|
-
stack.g = pg;
|
|
526
|
-
stack.b = pb;
|
|
527
|
-
stack = stack.next;
|
|
528
|
-
}
|
|
529
|
-
|
|
530
|
-
yp = width;
|
|
531
|
-
|
|
532
|
-
for (i = 1; i <= radius; i++) {
|
|
533
|
-
yi = (yp + x) << 2;
|
|
534
|
-
|
|
535
|
-
r_sum += (stack.r = (pr = pixels[yi])) * (rbs = radiusPlus1 - i);
|
|
536
|
-
g_sum += (stack.g = (pg = pixels[yi + 1])) * rbs;
|
|
537
|
-
b_sum += (stack.b = (pb = pixels[yi + 2])) * rbs;
|
|
538
|
-
|
|
539
|
-
r_in_sum += pr;
|
|
540
|
-
g_in_sum += pg;
|
|
541
|
-
b_in_sum += pb;
|
|
542
|
-
|
|
543
|
-
stack = stack.next;
|
|
544
|
-
|
|
545
|
-
if (i < heightMinus1) {
|
|
546
|
-
yp += width;
|
|
547
|
-
}
|
|
548
|
-
}
|
|
549
|
-
|
|
550
|
-
yi = x;
|
|
551
|
-
stackIn = stackStart;
|
|
552
|
-
stackOut = stackEnd;
|
|
553
|
-
for (y = 0; y < height; y++) {
|
|
554
|
-
p = yi << 2;
|
|
555
|
-
pixels[p] = (r_sum * mul_sum) >> shg_sum;
|
|
556
|
-
pixels[p + 1] = (g_sum * mul_sum) >> shg_sum;
|
|
557
|
-
pixels[p + 2] = (b_sum * mul_sum) >> shg_sum;
|
|
558
|
-
|
|
559
|
-
r_sum -= r_out_sum;
|
|
560
|
-
g_sum -= g_out_sum;
|
|
561
|
-
b_sum -= b_out_sum;
|
|
562
|
-
|
|
563
|
-
r_out_sum -= stackIn.r;
|
|
564
|
-
g_out_sum -= stackIn.g;
|
|
565
|
-
b_out_sum -= stackIn.b;
|
|
566
|
-
|
|
567
|
-
p = (x + (((p = y + radiusPlus1) < heightMinus1 ? p : heightMinus1) * width)) << 2;
|
|
568
|
-
|
|
569
|
-
r_sum += (r_in_sum += (stackIn.r = pixels[p]));
|
|
570
|
-
g_sum += (g_in_sum += (stackIn.g = pixels[p + 1]));
|
|
571
|
-
b_sum += (b_in_sum += (stackIn.b = pixels[p + 2]));
|
|
572
|
-
|
|
573
|
-
stackIn = stackIn.next;
|
|
574
|
-
|
|
575
|
-
r_out_sum += (pr = stackOut.r);
|
|
576
|
-
g_out_sum += (pg = stackOut.g);
|
|
577
|
-
b_out_sum += (pb = stackOut.b);
|
|
578
|
-
|
|
579
|
-
r_in_sum -= pr;
|
|
580
|
-
g_in_sum -= pg;
|
|
581
|
-
b_in_sum -= pb;
|
|
582
|
-
|
|
583
|
-
stackOut = stackOut.next;
|
|
584
|
-
|
|
585
|
-
yi += width;
|
|
586
|
-
}
|
|
587
|
-
}
|
|
588
|
-
|
|
589
|
-
context.putImageData(imageData, top_x, top_y);
|
|
590
|
-
|
|
591
|
-
}
|
|
592
|
-
|
|
593
|
-
function BlurStack() {
|
|
594
|
-
this.r = 0;
|
|
595
|
-
this.g = 0;
|
|
596
|
-
this.b = 0;
|
|
597
|
-
this.a = 0;
|
|
598
|
-
this.next = null;
|
|
599
|
-
}
|