(radius)
| 76 | // integer, S[i - r - 1] and S[i + r + 1] are added to the sum, each weighted |
| 77 | // according to r - ⌊radius⌋. |
| 78 | function blurf(radius) { |
| 79 | const radius0 = Math.floor(radius); |
| 80 | if (radius0 === radius) return bluri(radius); |
| 81 | const t = radius - radius0; |
| 82 | const w = 2 * radius + 1; |
| 83 | return (T, S, start, stop, step) => { // stop must be aligned! |
| 84 | if (!((stop -= step) >= start)) return; // inclusive stop |
| 85 | let sum = radius0 * S[start]; |
| 86 | const s0 = step * radius0; |
| 87 | const s1 = s0 + step; |
| 88 | for (let i = start, j = start + s0; i < j; i += step) { |
| 89 | sum += S[Math.min(stop, i)]; |
| 90 | } |
| 91 | for (let i = start, j = stop; i <= j; i += step) { |
| 92 | sum += S[Math.min(stop, i + s0)]; |
| 93 | T[i] = (sum + t * (S[Math.max(start, i - s1)] + S[Math.min(stop, i + s1)])) / w; |
| 94 | sum -= S[Math.max(start, i - s0)]; |
| 95 | } |
| 96 | }; |
| 97 | } |
| 98 | |
| 99 | // Like blurf, but optimized for integer radius. |
| 100 | function bluri(radius) { |
no test coverage detected