math 0.0.3 → 0.1.0

package/dist/noise/permutation.js

@@ -0,0 +1,120 @@
+// Adapated from https://github.com/josephg/noisejs
+//
+// ```
+// A speed-improved perlin and simplex noise algorithms for 2D.
+//
+// Based on example code by Stefan Gustavson (stegu@itn.liu.se).
+// Optimisations by Peter Eastman (peastman@drizzle.stanford.edu).
+// Better rank ordering method by Stefan Gustavson in 2012.
+// Converted to Javascript by Joseph Gentle.
+//
+// Version 2012-03-09
+//
+// This code was placed in the public domain by its original author,
+// Stefan Gustavson. You may use it as you see fit, but
+// attribution is appreciated.
+// ```
+// the 12 3D gradient directions (edges of a cube), indexed by perm value % 12
+const GRAD3 = [
+    [1, 1, 0],
+    [-1, 1, 0],
+    [1, -1, 0],
+    [-1, -1, 0],
+    [1, 0, 1],
+    [-1, 0, 1],
+    [1, 0, -1],
+    [-1, 0, -1],
+    [0, 1, 1],
+    [0, -1, 1],
+    [0, 1, -1],
+    [0, -1, -1],
+];
+// the 32 4D gradient directions (edges of a hypercube), indexed by perm value % 32
+const GRAD4 = [
+    [0, 1, 1, 1],
+    [0, 1, 1, -1],
+    [0, 1, -1, 1],
+    [0, 1, -1, -1],
+    [0, -1, 1, 1],
+    [0, -1, 1, -1],
+    [0, -1, -1, 1],
+    [0, -1, -1, -1],
+    [1, 0, 1, 1],
+    [1, 0, 1, -1],
+    [1, 0, -1, 1],
+    [1, 0, -1, -1],
+    [-1, 0, 1, 1],
+    [-1, 0, 1, -1],
+    [-1, 0, -1, 1],
+    [-1, 0, -1, -1],
+    [1, 1, 0, 1],
+    [1, 1, 0, -1],
+    [1, -1, 0, 1],
+    [1, -1, 0, -1],
+    [-1, 1, 0, 1],
+    [-1, 1, 0, -1],
+    [-1, -1, 0, 1],
+    [-1, -1, 0, -1],
+    [1, 1, 1, 0],
+    [1, 1, -1, 0],
+    [1, -1, 1, 0],
+    [1, -1, -1, 0],
+    [-1, 1, 1, 0],
+    [-1, 1, -1, 0],
+    [-1, -1, 1, 0],
+    [-1, -1, -1, 0],
+];
+const p = [
+    151, 160, 137, 91, 90, 15, 131, 13, 201, 95, 96, 53, 194, 233, 7, 225, 140, 36, 103, 30, 69, 142, 8, 99, 37, 240, 21, 10, 23,
+    190, 6, 148, 247, 120, 234, 75, 0, 26, 197, 62, 94, 252, 219, 203, 117, 35, 11, 32, 57, 177, 33, 88, 237, 149, 56, 87, 174,
+    20, 125, 136, 171, 168, 68, 175, 74, 165, 71, 134, 139, 48, 27, 166, 77, 146, 158, 231, 83, 111, 229, 122, 60, 211, 133, 230,
+    220, 105, 92, 41, 55, 46, 245, 40, 244, 102, 143, 54, 65, 25, 63, 161, 1, 216, 80, 73, 209, 76, 132, 187, 208, 89, 18, 169,
+    200, 196, 135, 130, 116, 188, 159, 86, 164, 100, 109, 198, 173, 186, 3, 64, 52, 217, 226, 250, 124, 123, 5, 202, 38, 147, 118,
+    126, 255, 82, 85, 212, 207, 206, 59, 227, 47, 16, 58, 17, 182, 189, 28, 42, 223, 183, 170, 213, 119, 248, 152, 2, 44, 154,
+    163, 70, 221, 153, 101, 155, 167, 43, 172, 9, 129, 22, 39, 253, 19, 98, 108, 110, 79, 113, 224, 232, 178, 185, 112, 104, 218,
+    246, 97, 228, 251, 34, 242, 193, 238, 210, 144, 12, 191, 179, 162, 241, 81, 51, 145, 235, 249, 14, 239, 107, 49, 192, 214, 31,
+    181, 199, 106, 157, 184, 84, 204, 176, 115, 121, 50, 45, 127, 4, 150, 254, 138, 236, 205, 93, 222, 114, 67, 29, 24, 72, 243,
+    141, 128, 195, 78, 66, 215, 61, 156, 180,
+];
+/**
+ * Creates the seeded permutation and gradient tables for a noise generator.
+ *
+ * @param seed The seed value for the noise generator
+ * @returns The permutation tables derived from the seed
+ */
+function createPermutation(seed) {
+    if (seed > 0 && seed < 1) {
+        // Scale the seed out
+        seed *= 65536;
+    }
+    seed = Math.floor(seed);
+    if (seed < 256) {
+        seed |= seed << 8;
+    }
+    // To remove the need for index wrapping, double the permutation table length
+    const perm = new Uint8Array(512);
+    const grad3 = new Float64Array(512 * 3);
+    const grad4 = new Float64Array(512 * 4);
+    for (let i = 0; i < 256; i++) {
+        let v;
+        if (i & 1) {
+            v = p[i] ^ (seed & 255);
+        }
+        else {
+            v = p[i] ^ ((seed >> 8) & 255);
+        }
+        perm[i] = perm[i + 256] = v;
+        const g3 = GRAD3[v % 12];
+        const g4 = GRAD4[v % 32];
+        for (let k = 0; k < 3; k++) {
+            grad3[i * 3 + k] = grad3[(i + 256) * 3 + k] = g3[k];
+        }
+        for (let k = 0; k < 4; k++) {
+            grad4[i * 4 + k] = grad4[(i + 256) * 4 + k] = g4[k];
+        }
+    }
+    return { perm, grad3, grad4 };
+}
+
+export { createPermutation };
+//# sourceMappingURL=permutation.js.map

package/dist/noise/permutation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutation.js","sources":["../../src/noise/permutation.ts"],"sourcesContent":["// Adapated from https://github.com/josephg/noisejs\n//\n// ```\n// A speed-improved perlin and simplex noise algorithms for 2D.\n//\n// Based on example code by Stefan Gustavson (stegu@itn.liu.se).\n// Optimisations by Peter Eastman (peastman@drizzle.stanford.edu).\n// Better rank ordering method by Stefan Gustavson in 2012.\n// Converted to Javascript by Joseph Gentle.\n//\n// Version 2012-03-09\n//\n// This code was placed in the public domain by its original author,\n// Stefan Gustavson. You may use it as you see fit, but\n// attribution is appreciated.\n// ```\n\n/**\n * Seeded permutation and gradient tables that back a noise generator.\n *\n * All noise variants (simplex/perlin, 2D/3D/4D) share this same table shape, so\n * each generator type is a structural alias of this. `perm` is the doubled\n * (512 entry) permutation table. `grad3` holds the 3D gradient for each\n * permutation index as flat xyz triples (used by 2D and 3D noise), and `grad4`\n * holds the 4D gradient for each index as flat xyzw quads. Flat typed arrays\n * keep sampling free of nested array loads and allocation.\n */\nexport type Permutation = { perm: Uint8Array; grad3: Float64Array; grad4: Float64Array };\n\n// the 12 3D gradient directions (edges of a cube), indexed by perm value % 12\nconst GRAD3: number[][] = [\n    [1, 1, 0],\n    [-1, 1, 0],\n    [1, -1, 0],\n    [-1, -1, 0],\n    [1, 0, 1],\n    [-1, 0, 1],\n    [1, 0, -1],\n    [-1, 0, -1],\n    [0, 1, 1],\n    [0, -1, 1],\n    [0, 1, -1],\n    [0, -1, -1],\n];\n\n// the 32 4D gradient directions (edges of a hypercube), indexed by perm value % 32\nconst GRAD4: number[][] = [\n    [0, 1, 1, 1],\n    [0, 1, 1, -1],\n    [0, 1, -1, 1],\n    [0, 1, -1, -1],\n    [0, -1, 1, 1],\n    [0, -1, 1, -1],\n    [0, -1, -1, 1],\n    [0, -1, -1, -1],\n    [1, 0, 1, 1],\n    [1, 0, 1, -1],\n    [1, 0, -1, 1],\n    [1, 0, -1, -1],\n    [-1, 0, 1, 1],\n    [-1, 0, 1, -1],\n    [-1, 0, -1, 1],\n    [-1, 0, -1, -1],\n    [1, 1, 0, 1],\n    [1, 1, 0, -1],\n    [1, -1, 0, 1],\n    [1, -1, 0, -1],\n    [-1, 1, 0, 1],\n    [-1, 1, 0, -1],\n    [-1, -1, 0, 1],\n    [-1, -1, 0, -1],\n    [1, 1, 1, 0],\n    [1, 1, -1, 0],\n    [1, -1, 1, 0],\n    [1, -1, -1, 0],\n    [-1, 1, 1, 0],\n    [-1, 1, -1, 0],\n    [-1, -1, 1, 0],\n    [-1, -1, -1, 0],\n];\n\nconst p = [\n    151, 160, 137, 91, 90, 15, 131, 13, 201, 95, 96, 53, 194, 233, 7, 225, 140, 36, 103, 30, 69, 142, 8, 99, 37, 240, 21, 10, 23,\n    190, 6, 148, 247, 120, 234, 75, 0, 26, 197, 62, 94, 252, 219, 203, 117, 35, 11, 32, 57, 177, 33, 88, 237, 149, 56, 87, 174,\n    20, 125, 136, 171, 168, 68, 175, 74, 165, 71, 134, 139, 48, 27, 166, 77, 146, 158, 231, 83, 111, 229, 122, 60, 211, 133, 230,\n    220, 105, 92, 41, 55, 46, 245, 40, 244, 102, 143, 54, 65, 25, 63, 161, 1, 216, 80, 73, 209, 76, 132, 187, 208, 89, 18, 169,\n    200, 196, 135, 130, 116, 188, 159, 86, 164, 100, 109, 198, 173, 186, 3, 64, 52, 217, 226, 250, 124, 123, 5, 202, 38, 147, 118,\n    126, 255, 82, 85, 212, 207, 206, 59, 227, 47, 16, 58, 17, 182, 189, 28, 42, 223, 183, 170, 213, 119, 248, 152, 2, 44, 154,\n    163, 70, 221, 153, 101, 155, 167, 43, 172, 9, 129, 22, 39, 253, 19, 98, 108, 110, 79, 113, 224, 232, 178, 185, 112, 104, 218,\n    246, 97, 228, 251, 34, 242, 193, 238, 210, 144, 12, 191, 179, 162, 241, 81, 51, 145, 235, 249, 14, 239, 107, 49, 192, 214, 31,\n    181, 199, 106, 157, 184, 84, 204, 176, 115, 121, 50, 45, 127, 4, 150, 254, 138, 236, 205, 93, 222, 114, 67, 29, 24, 72, 243,\n    141, 128, 195, 78, 66, 215, 61, 156, 180,\n];\n\n/**\n * Creates the seeded permutation and gradient tables for a noise generator.\n *\n * @param seed The seed value for the noise generator\n * @returns The permutation tables derived from the seed\n */\nexport function createPermutation(seed: number): Permutation {\n    if (seed > 0 && seed < 1) {\n        // Scale the seed out\n        seed *= 65536;\n    }\n\n    seed = Math.floor(seed);\n    if (seed < 256) {\n        seed |= seed << 8;\n    }\n\n    // To remove the need for index wrapping, double the permutation table length\n    const perm = new Uint8Array(512);\n    const grad3 = new Float64Array(512 * 3);\n    const grad4 = new Float64Array(512 * 4);\n\n    for (let i = 0; i < 256; i++) {\n        let v: number;\n        if (i & 1) {\n            v = p[i] ^ (seed & 255);\n        } else {\n            v = p[i] ^ ((seed >> 8) & 255);\n        }\n\n        perm[i] = perm[i + 256] = v;\n\n        const g3 = GRAD3[v % 12];\n        const g4 = GRAD4[v % 32];\n        for (let k = 0; k < 3; k++) {\n            grad3[i * 3 + k] = grad3[(i + 256) * 3 + k] = g3[k];\n        }\n        for (let k = 0; k < 4; k++) {\n            grad4[i * 4 + k] = grad4[(i + 256) * 4 + k] = g4[k];\n        }\n    }\n\n    return { perm, grad3, grad4 };\n}\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAcA;AACA,MAAM,KAAK,GAAe;AACtB,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACT,IAAA,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AACV,IAAA,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACV,IAAA,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AACX,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACT,IAAA,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AACV,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;AACV,IAAA,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;AACX,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACT,IAAA,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACV,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;AACV,IAAA,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;CACd;AAED;AACA,MAAM,KAAK,GAAe;AACtB,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;IACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;IACd,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACb,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;IACd,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACd,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;AACf,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;IACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;IACd,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACb,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;IACd,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACd,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;AACf,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;IACb,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACb,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;IACd,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACb,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;IACd,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACd,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;AACf,IAAA,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACb,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACb,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACd,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACb,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACd,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACd,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;CAClB;AAED,MAAM,CAAC,GAAG;IACN,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC5H,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG;IAC1H,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;IAC5H,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG;IAC1H,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG;IAC7H,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG;IACzH,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;IAC5H,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;IAC7H,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG;AAC3H,IAAA,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG;CAC3C;AAED;;;;;AAKG;AACG,SAAU,iBAAiB,CAAC,IAAY,EAAA;IAC1C,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE;;QAEtB,IAAI,IAAI,KAAK;IACjB;AAEA,IAAA,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;AACvB,IAAA,IAAI,IAAI,GAAG,GAAG,EAAE;AACZ,QAAA,IAAI,IAAI,IAAI,IAAI,CAAC;IACrB;;AAGA,IAAA,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC;IAChC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC;AAEvC,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAC1B,QAAA,IAAI,CAAS;AACb,QAAA,IAAI,CAAC,GAAG,CAAC,EAAE;YACP,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;QAC3B;aAAO;AACH,YAAA,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;QAClC;AAEA,QAAA,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC;QAE3B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;AACxB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvD;AACA,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvD;IACJ;AAEA,IAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE;AACjC;;;;"}

package/dist/noise/simplex2d.js

@@ -0,0 +1,84 @@
+import { createPermutation } from './permutation.js';
+
+// skewing and unskewing factors for 2 dimensions
+const F2 = 0.5 * (Math.sqrt(3) - 1);
+const G2 = (3 - Math.sqrt(3)) / 6;
+/**
+ * Creates a 2D simplex noise generator with the given seed.
+ *
+ * @param seed The seed value for the noise generator
+ * @returns A generator to pass to {@link sample}
+ */
+function create(seed) {
+    return createPermutation(seed);
+}
+/**
+ * Samples 2D simplex noise, returning a value in the interval [-1, 1].
+ *
+ * @param generator A generator created with {@link create}
+ * @param x X coordinate
+ * @param y Y coordinate
+ * @returns The noise value at (x, y)
+ */
+function sample({ perm, grad3 }, x, y) {
+    // Skew the input space to determine which simplex cell we're in
+    const s = (x + y) * F2; // Hairy factor for 2D
+    let i = Math.floor(x + s);
+    let j = Math.floor(y + s);
+    const t = (i + j) * G2;
+    const x0 = x - i + t; // The x,y distances from the cell origin, unskewed.
+    const y0 = y - j + t;
+    // For the 2D case, the simplex shape is an equilateral triangle.
+    // Determine which simplex we are in.
+    let i1;
+    let j1; // Offsets for second (middle) corner of simplex in (i,j) coords
+    if (x0 > y0) {
+        // lower triangle, XY order: (0,0)->(1,0)->(1,1)
+        i1 = 1;
+        j1 = 0;
+    }
+    else {
+        // upper triangle, YX order: (0,0)->(0,1)->(1,1)
+        i1 = 0;
+        j1 = 1;
+    }
+    // A step of (1,0) in (i,j) means a step of (1-c,-c) in (x,y), and
+    // a step of (0,1) in (i,j) means a step of (-c,1-c) in (x,y), where
+    // c = (3-sqrt(3))/6
+    const x1 = x0 - i1 + G2; // Offsets for middle corner in (x,y) unskewed coords
+    const y1 = y0 - j1 + G2;
+    const x2 = x0 - 1 + 2 * G2; // Offsets for last corner in (x,y) unskewed coords
+    const y2 = y0 - 1 + 2 * G2;
+    // Work out the hashed gradient indices of the three simplex corners
+    // (flat xyz triples in grad3; only x and y are used for 2D)
+    i &= 255;
+    j &= 255;
+    const gi0 = (i + perm[j]) * 3;
+    const gi1 = (i + i1 + perm[j + j1]) * 3;
+    const gi2 = (i + 1 + perm[j + 1]) * 3;
+    // Calculate the contribution from the three corners
+    let n0 = 0;
+    let n1 = 0;
+    let n2 = 0;
+    let t0 = 0.5 - x0 * x0 - y0 * y0;
+    if (t0 >= 0) {
+        t0 *= t0;
+        n0 = t0 * t0 * (grad3[gi0] * x0 + grad3[gi0 + 1] * y0);
+    }
+    let t1 = 0.5 - x1 * x1 - y1 * y1;
+    if (t1 >= 0) {
+        t1 *= t1;
+        n1 = t1 * t1 * (grad3[gi1] * x1 + grad3[gi1 + 1] * y1);
+    }
+    let t2 = 0.5 - x2 * x2 - y2 * y2;
+    if (t2 >= 0) {
+        t2 *= t2;
+        n2 = t2 * t2 * (grad3[gi2] * x2 + grad3[gi2 + 1] * y2);
+    }
+    // Add contributions from each corner to get the final noise value.
+    // The result is scaled to return values in the interval [-1,1].
+    return 70 * (n0 + n1 + n2);
+}
+
+export { create, sample };
+//# sourceMappingURL=simplex2d.js.map

package/dist/noise/simplex2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplex2d.js","sources":["../../src/noise/simplex2d.ts"],"sourcesContent":["import { createPermutation, type Permutation } from './permutation';\n\n/** A seeded 2D simplex noise generator. Create one with {@link create}. */\nexport type Simplex2DGenerator = Permutation;\n\n// skewing and unskewing factors for 2 dimensions\nconst F2 = 0.5 * (Math.sqrt(3) - 1);\nconst G2 = (3 - Math.sqrt(3)) / 6;\n\n/**\n * Creates a 2D simplex noise generator with the given seed.\n *\n * @param seed The seed value for the noise generator\n * @returns A generator to pass to {@link sample}\n */\nexport function create(seed: number): Simplex2DGenerator {\n    return createPermutation(seed);\n}\n\n/**\n * Samples 2D simplex noise, returning a value in the interval [-1, 1].\n *\n * @param generator A generator created with {@link create}\n * @param x X coordinate\n * @param y Y coordinate\n * @returns The noise value at (x, y)\n */\nexport function sample({ perm, grad3 }: Simplex2DGenerator, x: number, y: number): number {\n    // Skew the input space to determine which simplex cell we're in\n    const s = (x + y) * F2; // Hairy factor for 2D\n    let i = Math.floor(x + s);\n    let j = Math.floor(y + s);\n    const t = (i + j) * G2;\n    const x0 = x - i + t; // The x,y distances from the cell origin, unskewed.\n    const y0 = y - j + t;\n    // For the 2D case, the simplex shape is an equilateral triangle.\n    // Determine which simplex we are in.\n    let i1: number;\n    let j1: number; // Offsets for second (middle) corner of simplex in (i,j) coords\n    if (x0 > y0) {\n        // lower triangle, XY order: (0,0)->(1,0)->(1,1)\n        i1 = 1;\n        j1 = 0;\n    } else {\n        // upper triangle, YX order: (0,0)->(0,1)->(1,1)\n        i1 = 0;\n        j1 = 1;\n    }\n    // A step of (1,0) in (i,j) means a step of (1-c,-c) in (x,y), and\n    // a step of (0,1) in (i,j) means a step of (-c,1-c) in (x,y), where\n    // c = (3-sqrt(3))/6\n    const x1 = x0 - i1 + G2; // Offsets for middle corner in (x,y) unskewed coords\n    const y1 = y0 - j1 + G2;\n    const x2 = x0 - 1 + 2 * G2; // Offsets for last corner in (x,y) unskewed coords\n    const y2 = y0 - 1 + 2 * G2;\n    // Work out the hashed gradient indices of the three simplex corners\n    // (flat xyz triples in grad3; only x and y are used for 2D)\n    i &= 255;\n    j &= 255;\n    const gi0 = (i + perm[j]) * 3;\n    const gi1 = (i + i1 + perm[j + j1]) * 3;\n    const gi2 = (i + 1 + perm[j + 1]) * 3;\n    // Calculate the contribution from the three corners\n    let n0 = 0;\n    let n1 = 0;\n    let n2 = 0;\n    let t0 = 0.5 - x0 * x0 - y0 * y0;\n    if (t0 >= 0) {\n        t0 *= t0;\n        n0 = t0 * t0 * (grad3[gi0] * x0 + grad3[gi0 + 1] * y0);\n    }\n    let t1 = 0.5 - x1 * x1 - y1 * y1;\n    if (t1 >= 0) {\n        t1 *= t1;\n        n1 = t1 * t1 * (grad3[gi1] * x1 + grad3[gi1 + 1] * y1);\n    }\n    let t2 = 0.5 - x2 * x2 - y2 * y2;\n    if (t2 >= 0) {\n        t2 *= t2;\n        n2 = t2 * t2 * (grad3[gi2] * x2 + grad3[gi2 + 1] * y2);\n    }\n    // Add contributions from each corner to get the final noise value.\n    // The result is scaled to return values in the interval [-1,1].\n    return 70 * (n0 + n1 + n2);\n}\n"],"names":[],"mappings":";;AAKA;AACA,MAAM,EAAE,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACnC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAEjC;;;;;AAKG;AACG,SAAU,MAAM,CAAC,IAAY,EAAA;AAC/B,IAAA,OAAO,iBAAiB,CAAC,IAAI,CAAC;AAClC;AAEA;;;;;;;AAOG;AACG,SAAU,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAsB,EAAE,CAAS,EAAE,CAAS,EAAA;;IAE5E,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACvB,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE;IACtB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;;;AAGpB,IAAA,IAAI,EAAU;IACd,IAAI,EAAU,CAAC;AACf,IAAA,IAAI,EAAE,GAAG,EAAE,EAAE;;QAET,EAAE,GAAG,CAAC;QACN,EAAE,GAAG,CAAC;IACV;SAAO;;QAEH,EAAE,GAAG,CAAC;QACN,EAAE,GAAG,CAAC;IACV;;;;IAIA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACxB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IACvB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;;;IAG1B,CAAC,IAAI,GAAG;IACR,CAAC,IAAI,GAAG;AACR,IAAA,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7B,IAAA,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;AACvC,IAAA,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;;IAErC,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAChC,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;QACR,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAC1D;IACA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAChC,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;QACR,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAC1D;IACA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAChC,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;QACR,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAC1D;;;IAGA,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC9B;;;;"}

package/dist/noise/simplex3d.js

@@ -0,0 +1,147 @@
+import { createPermutation } from './permutation.js';
+
+// skewing and unskewing factors for 3 dimensions
+const F3 = 1 / 3;
+const G3 = 1 / 6;
+/**
+ * Creates a 3D simplex noise generator with the given seed.
+ *
+ * @param seed The seed value for the noise generator
+ * @returns A generator to pass to {@link sample}
+ */
+function create(seed) {
+    return createPermutation(seed);
+}
+/**
+ * Samples 3D simplex noise, returning a value in the interval [-1, 1].
+ *
+ * @param generator A generator created with {@link create}
+ * @param x X coordinate
+ * @param y Y coordinate
+ * @param z Z coordinate
+ * @returns The noise value at (x, y, z)
+ */
+function sample({ perm, grad3 }, x, y, z) {
+    // Skew the input space to determine which simplex cell we're in
+    const s = (x + y + z) * F3; // Hairy factor for 3D
+    let i = Math.floor(x + s);
+    let j = Math.floor(y + s);
+    let k = Math.floor(z + s);
+    const t = (i + j + k) * G3;
+    const x0 = x - i + t; // The x,y,z distances from the cell origin, unskewed.
+    const y0 = y - j + t;
+    const z0 = z - k + t;
+    // For the 3D case, the simplex shape is a slightly irregular tetrahedron.
+    // Determine which simplex we are in.
+    let i1;
+    let j1;
+    let k1; // Offsets for second corner of simplex in (i,j,k) coords
+    let i2;
+    let j2;
+    let k2; // Offsets for third corner of simplex in (i,j,k) coords
+    if (x0 >= y0) {
+        if (y0 >= z0) {
+            i1 = 1;
+            j1 = 0;
+            k1 = 0;
+            i2 = 1;
+            j2 = 1;
+            k2 = 0;
+        }
+        else if (x0 >= z0) {
+            i1 = 1;
+            j1 = 0;
+            k1 = 0;
+            i2 = 1;
+            j2 = 0;
+            k2 = 1;
+        }
+        else {
+            i1 = 0;
+            j1 = 0;
+            k1 = 1;
+            i2 = 1;
+            j2 = 0;
+            k2 = 1;
+        }
+    }
+    else {
+        if (y0 < z0) {
+            i1 = 0;
+            j1 = 0;
+            k1 = 1;
+            i2 = 0;
+            j2 = 1;
+            k2 = 1;
+        }
+        else if (x0 < z0) {
+            i1 = 0;
+            j1 = 1;
+            k1 = 0;
+            i2 = 0;
+            j2 = 1;
+            k2 = 1;
+        }
+        else {
+            i1 = 0;
+            j1 = 1;
+            k1 = 0;
+            i2 = 1;
+            j2 = 1;
+            k2 = 0;
+        }
+    }
+    // A step of (1,0,0) in (i,j,k) means a step of (1-c,-c,-c) in (x,y,z),
+    // a step of (0,1,0) in (i,j,k) means a step of (-c,1-c,-c) in (x,y,z), and
+    // a step of (0,0,1) in (i,j,k) means a step of (-c,-c,1-c) in (x,y,z), where
+    // c = 1/6.
+    const x1 = x0 - i1 + G3; // Offsets for second corner
+    const y1 = y0 - j1 + G3;
+    const z1 = z0 - k1 + G3;
+    const x2 = x0 - i2 + 2 * G3; // Offsets for third corner
+    const y2 = y0 - j2 + 2 * G3;
+    const z2 = z0 - k2 + 2 * G3;
+    const x3 = x0 - 1 + 3 * G3; // Offsets for fourth corner
+    const y3 = y0 - 1 + 3 * G3;
+    const z3 = z0 - 1 + 3 * G3;
+    // Work out the hashed gradient indices of the four simplex corners
+    // (flat xyz triples in grad3)
+    i &= 255;
+    j &= 255;
+    k &= 255;
+    const gi0 = (i + perm[j + perm[k]]) * 3;
+    const gi1 = (i + i1 + perm[j + j1 + perm[k + k1]]) * 3;
+    const gi2 = (i + i2 + perm[j + j2 + perm[k + k2]]) * 3;
+    const gi3 = (i + 1 + perm[j + 1 + perm[k + 1]]) * 3;
+    // Calculate the contribution from the four corners
+    let n0 = 0;
+    let n1 = 0;
+    let n2 = 0;
+    let n3 = 0;
+    let t0 = 0.6 - x0 * x0 - y0 * y0 - z0 * z0;
+    if (t0 >= 0) {
+        t0 *= t0;
+        n0 = t0 * t0 * (grad3[gi0] * x0 + grad3[gi0 + 1] * y0 + grad3[gi0 + 2] * z0);
+    }
+    let t1 = 0.6 - x1 * x1 - y1 * y1 - z1 * z1;
+    if (t1 >= 0) {
+        t1 *= t1;
+        n1 = t1 * t1 * (grad3[gi1] * x1 + grad3[gi1 + 1] * y1 + grad3[gi1 + 2] * z1);
+    }
+    let t2 = 0.6 - x2 * x2 - y2 * y2 - z2 * z2;
+    if (t2 >= 0) {
+        t2 *= t2;
+        n2 = t2 * t2 * (grad3[gi2] * x2 + grad3[gi2 + 1] * y2 + grad3[gi2 + 2] * z2);
+    }
+    let t3 = 0.6 - x3 * x3 - y3 * y3 - z3 * z3;
+    if (t3 >= 0) {
+        t3 *= t3;
+        n3 = t3 * t3 * (grad3[gi3] * x3 + grad3[gi3 + 1] * y3 + grad3[gi3 + 2] * z3);
+    }
+    // Add contributions from each corner to get the final noise value.
+    // The result is scaled to return values in the interval [-1,1].
+    return 32 * (n0 + n1 + n2 + n3);
+}
+
+export { create, sample };
+//# sourceMappingURL=simplex3d.js.map

package/dist/noise/simplex3d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplex3d.js","sources":["../../src/noise/simplex3d.ts"],"sourcesContent":["import { createPermutation, type Permutation } from './permutation';\n\n/** A seeded 3D simplex noise generator. Create one with {@link create}. */\nexport type Simplex3DGenerator = Permutation;\n\n// skewing and unskewing factors for 3 dimensions\nconst F3 = 1 / 3;\nconst G3 = 1 / 6;\n\n/**\n * Creates a 3D simplex noise generator with the given seed.\n *\n * @param seed The seed value for the noise generator\n * @returns A generator to pass to {@link sample}\n */\nexport function create(seed: number): Simplex3DGenerator {\n    return createPermutation(seed);\n}\n\n/**\n * Samples 3D simplex noise, returning a value in the interval [-1, 1].\n *\n * @param generator A generator created with {@link create}\n * @param x X coordinate\n * @param y Y coordinate\n * @param z Z coordinate\n * @returns The noise value at (x, y, z)\n */\nexport function sample({ perm, grad3 }: Simplex3DGenerator, x: number, y: number, z: number): number {\n    // Skew the input space to determine which simplex cell we're in\n    const s = (x + y + z) * F3; // Hairy factor for 3D\n    let i = Math.floor(x + s);\n    let j = Math.floor(y + s);\n    let k = Math.floor(z + s);\n\n    const t = (i + j + k) * G3;\n    const x0 = x - i + t; // The x,y,z distances from the cell origin, unskewed.\n    const y0 = y - j + t;\n    const z0 = z - k + t;\n\n    // For the 3D case, the simplex shape is a slightly irregular tetrahedron.\n    // Determine which simplex we are in.\n    let i1: number;\n    let j1: number;\n    let k1: number; // Offsets for second corner of simplex in (i,j,k) coords\n    let i2: number;\n    let j2: number;\n    let k2: number; // Offsets for third corner of simplex in (i,j,k) coords\n    if (x0 >= y0) {\n        if (y0 >= z0) {\n            i1 = 1;\n            j1 = 0;\n            k1 = 0;\n            i2 = 1;\n            j2 = 1;\n            k2 = 0;\n        } else if (x0 >= z0) {\n            i1 = 1;\n            j1 = 0;\n            k1 = 0;\n            i2 = 1;\n            j2 = 0;\n            k2 = 1;\n        } else {\n            i1 = 0;\n            j1 = 0;\n            k1 = 1;\n            i2 = 1;\n            j2 = 0;\n            k2 = 1;\n        }\n    } else {\n        if (y0 < z0) {\n            i1 = 0;\n            j1 = 0;\n            k1 = 1;\n            i2 = 0;\n            j2 = 1;\n            k2 = 1;\n        } else if (x0 < z0) {\n            i1 = 0;\n            j1 = 1;\n            k1 = 0;\n            i2 = 0;\n            j2 = 1;\n            k2 = 1;\n        } else {\n            i1 = 0;\n            j1 = 1;\n            k1 = 0;\n            i2 = 1;\n            j2 = 1;\n            k2 = 0;\n        }\n    }\n    // A step of (1,0,0) in (i,j,k) means a step of (1-c,-c,-c) in (x,y,z),\n    // a step of (0,1,0) in (i,j,k) means a step of (-c,1-c,-c) in (x,y,z), and\n    // a step of (0,0,1) in (i,j,k) means a step of (-c,-c,1-c) in (x,y,z), where\n    // c = 1/6.\n    const x1 = x0 - i1 + G3; // Offsets for second corner\n    const y1 = y0 - j1 + G3;\n    const z1 = z0 - k1 + G3;\n\n    const x2 = x0 - i2 + 2 * G3; // Offsets for third corner\n    const y2 = y0 - j2 + 2 * G3;\n    const z2 = z0 - k2 + 2 * G3;\n\n    const x3 = x0 - 1 + 3 * G3; // Offsets for fourth corner\n    const y3 = y0 - 1 + 3 * G3;\n    const z3 = z0 - 1 + 3 * G3;\n\n    // Work out the hashed gradient indices of the four simplex corners\n    // (flat xyz triples in grad3)\n    i &= 255;\n    j &= 255;\n    k &= 255;\n    const gi0 = (i + perm[j + perm[k]]) * 3;\n    const gi1 = (i + i1 + perm[j + j1 + perm[k + k1]]) * 3;\n    const gi2 = (i + i2 + perm[j + j2 + perm[k + k2]]) * 3;\n    const gi3 = (i + 1 + perm[j + 1 + perm[k + 1]]) * 3;\n\n    // Calculate the contribution from the four corners\n    let n0 = 0;\n    let n1 = 0;\n    let n2 = 0;\n    let n3 = 0;\n    let t0 = 0.6 - x0 * x0 - y0 * y0 - z0 * z0;\n    if (t0 >= 0) {\n        t0 *= t0;\n        n0 = t0 * t0 * (grad3[gi0] * x0 + grad3[gi0 + 1] * y0 + grad3[gi0 + 2] * z0);\n    }\n    let t1 = 0.6 - x1 * x1 - y1 * y1 - z1 * z1;\n    if (t1 >= 0) {\n        t1 *= t1;\n        n1 = t1 * t1 * (grad3[gi1] * x1 + grad3[gi1 + 1] * y1 + grad3[gi1 + 2] * z1);\n    }\n    let t2 = 0.6 - x2 * x2 - y2 * y2 - z2 * z2;\n    if (t2 >= 0) {\n        t2 *= t2;\n        n2 = t2 * t2 * (grad3[gi2] * x2 + grad3[gi2 + 1] * y2 + grad3[gi2 + 2] * z2);\n    }\n    let t3 = 0.6 - x3 * x3 - y3 * y3 - z3 * z3;\n    if (t3 >= 0) {\n        t3 *= t3;\n        n3 = t3 * t3 * (grad3[gi3] * x3 + grad3[gi3 + 1] * y3 + grad3[gi3 + 2] * z3);\n    }\n    // Add contributions from each corner to get the final noise value.\n    // The result is scaled to return values in the interval [-1,1].\n    return 32 * (n0 + n1 + n2 + n3);\n}\n"],"names":[],"mappings":";;AAKA;AACA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;AAChB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;AAEhB;;;;;AAKG;AACG,SAAU,MAAM,CAAC,IAAY,EAAA;AAC/B,IAAA,OAAO,iBAAiB,CAAC,IAAI,CAAC;AAClC;AAEA;;;;;;;;AAQG;AACG,SAAU,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAsB,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAA;;AAEvF,IAAA,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IAEzB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AACpB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;;;AAIpB,IAAA,IAAI,EAAU;AACd,IAAA,IAAI,EAAU;IACd,IAAI,EAAU,CAAC;AACf,IAAA,IAAI,EAAU;AACd,IAAA,IAAI,EAAU;IACd,IAAI,EAAU,CAAC;AACf,IAAA,IAAI,EAAE,IAAI,EAAE,EAAE;AACV,QAAA,IAAI,EAAE,IAAI,EAAE,EAAE;YACV,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;QACV;AAAO,aAAA,IAAI,EAAE,IAAI,EAAE,EAAE;YACjB,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;QACV;aAAO;YACH,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;QACV;IACJ;SAAO;AACH,QAAA,IAAI,EAAE,GAAG,EAAE,EAAE;YACT,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;QACV;AAAO,aAAA,IAAI,EAAE,GAAG,EAAE,EAAE;YAChB,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;QACV;aAAO;YACH,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;YACN,EAAE,GAAG,CAAC;QACV;IACJ;;;;;IAKA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACxB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACvB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAEvB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAE3B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;IAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;;;IAI1B,CAAC,IAAI,GAAG;IACR,CAAC,IAAI,GAAG;IACR,CAAC,IAAI,GAAG;AACR,IAAA,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvC,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC;IACtD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC;IACtD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;;IAGnD,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;AACV,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAC1C,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAC1C,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAC1C,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAC1C,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF;;;IAGA,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACnC;;;;"}

package/dist/noise/simplex4d.js

@@ -0,0 +1,149 @@
+import { createPermutation } from './permutation.js';
+
+// Skewing and unskewing factors for 4 dimensions
+const F4 = (Math.sqrt(5) - 1) / 4;
+const G4 = (5 - Math.sqrt(5)) / 20;
+/**
+ * Creates a 4D simplex noise generator with the given seed.
+ *
+ * @param seed The seed value for the noise generator
+ * @returns A generator to pass to {@link sample}
+ */
+function create(seed) {
+    return createPermutation(seed);
+}
+/**
+ * Samples 4D simplex noise, returning a value in the interval [-1, 1].
+ *
+ * The fourth axis is commonly used as time (for animated 3D noise) or as a wrap
+ * dimension (map a coordinate around a circle in w for seamless looping).
+ *
+ * @param generator A generator created with {@link create}
+ * @param x X coordinate
+ * @param y Y coordinate
+ * @param z Z coordinate
+ * @param w W coordinate
+ * @returns The noise value at (x, y, z, w)
+ */
+function sample({ perm, grad4 }, x, y, z, w) {
+    // Skew the input space to determine which simplex cell we're in
+    const s = (x + y + z + w) * F4; // Factor for 4D skewing
+    const i = Math.floor(x + s);
+    const j = Math.floor(y + s);
+    const k = Math.floor(z + s);
+    const l = Math.floor(w + s);
+    const t = (i + j + k + l) * G4; // Factor for 4D unskewing
+    const x0 = x - (i - t); // The x,y,z,w distances from the cell origin, unskewed
+    const y0 = y - (j - t);
+    const z0 = z - (k - t);
+    const w0 = w - (l - t);
+    // For the 4D case, the simplex is a 5-cell (4-simplex). Rank the coordinates
+    // to work out the traversal order of the four middle corners: the largest
+    // coordinate steps first, then the next, and so on (Gustavson's rank method).
+    let rankx = 0;
+    let ranky = 0;
+    let rankz = 0;
+    let rankw = 0;
+    if (x0 > y0)
+        rankx++;
+    else
+        ranky++;
+    if (x0 > z0)
+        rankx++;
+    else
+        rankz++;
+    if (x0 > w0)
+        rankx++;
+    else
+        rankw++;
+    if (y0 > z0)
+        ranky++;
+    else
+        rankz++;
+    if (y0 > w0)
+        ranky++;
+    else
+        rankw++;
+    if (z0 > w0)
+        rankz++;
+    else
+        rankw++;
+    // rank 3 is the largest coordinate, so it gets the +1 first, and so on.
+    const i1 = rankx >= 3 ? 1 : 0;
+    const j1 = ranky >= 3 ? 1 : 0;
+    const k1 = rankz >= 3 ? 1 : 0;
+    const l1 = rankw >= 3 ? 1 : 0;
+    const i2 = rankx >= 2 ? 1 : 0;
+    const j2 = ranky >= 2 ? 1 : 0;
+    const k2 = rankz >= 2 ? 1 : 0;
+    const l2 = rankw >= 2 ? 1 : 0;
+    const i3 = rankx >= 1 ? 1 : 0;
+    const j3 = ranky >= 1 ? 1 : 0;
+    const k3 = rankz >= 1 ? 1 : 0;
+    const l3 = rankw >= 1 ? 1 : 0;
+    // Offsets for the remaining corners, unskewed (subtract the step, add G4 per step)
+    const x1 = x0 - i1 + G4;
+    const y1 = y0 - j1 + G4;
+    const z1 = z0 - k1 + G4;
+    const w1 = w0 - l1 + G4;
+    const x2 = x0 - i2 + 2 * G4;
+    const y2 = y0 - j2 + 2 * G4;
+    const z2 = z0 - k2 + 2 * G4;
+    const w2 = w0 - l2 + 2 * G4;
+    const x3 = x0 - i3 + 3 * G4;
+    const y3 = y0 - j3 + 3 * G4;
+    const z3 = z0 - k3 + 3 * G4;
+    const w3 = w0 - l3 + 3 * G4;
+    const x4 = x0 - 1 + 4 * G4;
+    const y4 = y0 - 1 + 4 * G4;
+    const z4 = z0 - 1 + 4 * G4;
+    const w4 = w0 - 1 + 4 * G4;
+    // Work out the hashed gradient indices of the five simplex corners
+    // (flat xyzw quads in grad4)
+    const ii = i & 255;
+    const jj = j & 255;
+    const kk = k & 255;
+    const ll = l & 255;
+    const g0 = (ii + perm[jj + perm[kk + perm[ll]]]) * 4;
+    const g1 = (ii + i1 + perm[jj + j1 + perm[kk + k1 + perm[ll + l1]]]) * 4;
+    const g2 = (ii + i2 + perm[jj + j2 + perm[kk + k2 + perm[ll + l2]]]) * 4;
+    const g3 = (ii + i3 + perm[jj + j3 + perm[kk + k3 + perm[ll + l3]]]) * 4;
+    const g4 = (ii + 1 + perm[jj + 1 + perm[kk + 1 + perm[ll + 1]]]) * 4;
+    // Calculate the contribution from the five corners
+    let n0 = 0;
+    let n1 = 0;
+    let n2 = 0;
+    let n3 = 0;
+    let n4 = 0;
+    let t0 = 0.6 - x0 * x0 - y0 * y0 - z0 * z0 - w0 * w0;
+    if (t0 >= 0) {
+        t0 *= t0;
+        n0 = t0 * t0 * (grad4[g0] * x0 + grad4[g0 + 1] * y0 + grad4[g0 + 2] * z0 + grad4[g0 + 3] * w0);
+    }
+    let t1 = 0.6 - x1 * x1 - y1 * y1 - z1 * z1 - w1 * w1;
+    if (t1 >= 0) {
+        t1 *= t1;
+        n1 = t1 * t1 * (grad4[g1] * x1 + grad4[g1 + 1] * y1 + grad4[g1 + 2] * z1 + grad4[g1 + 3] * w1);
+    }
+    let t2 = 0.6 - x2 * x2 - y2 * y2 - z2 * z2 - w2 * w2;
+    if (t2 >= 0) {
+        t2 *= t2;
+        n2 = t2 * t2 * (grad4[g2] * x2 + grad4[g2 + 1] * y2 + grad4[g2 + 2] * z2 + grad4[g2 + 3] * w2);
+    }
+    let t3 = 0.6 - x3 * x3 - y3 * y3 - z3 * z3 - w3 * w3;
+    if (t3 >= 0) {
+        t3 *= t3;
+        n3 = t3 * t3 * (grad4[g3] * x3 + grad4[g3 + 1] * y3 + grad4[g3 + 2] * z3 + grad4[g3 + 3] * w3);
+    }
+    let t4 = 0.6 - x4 * x4 - y4 * y4 - z4 * z4 - w4 * w4;
+    if (t4 >= 0) {
+        t4 *= t4;
+        n4 = t4 * t4 * (grad4[g4] * x4 + grad4[g4 + 1] * y4 + grad4[g4 + 2] * z4 + grad4[g4 + 3] * w4);
+    }
+    // Add contributions from each corner to get the final noise value.
+    // The result is scaled to return values in the interval [-1, 1].
+    return 27 * (n0 + n1 + n2 + n3 + n4);
+}
+
+export { create, sample };
+//# sourceMappingURL=simplex4d.js.map

package/dist/noise/simplex4d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplex4d.js","sources":["../../src/noise/simplex4d.ts"],"sourcesContent":["import { createPermutation, type Permutation } from './permutation';\n\n/** A seeded 4D simplex noise generator. Create one with {@link create}. */\nexport type Simplex4DGenerator = Permutation;\n\n// Skewing and unskewing factors for 4 dimensions\nconst F4 = (Math.sqrt(5) - 1) / 4;\nconst G4 = (5 - Math.sqrt(5)) / 20;\n\n/**\n * Creates a 4D simplex noise generator with the given seed.\n *\n * @param seed The seed value for the noise generator\n * @returns A generator to pass to {@link sample}\n */\nexport function create(seed: number): Simplex4DGenerator {\n    return createPermutation(seed);\n}\n\n/**\n * Samples 4D simplex noise, returning a value in the interval [-1, 1].\n *\n * The fourth axis is commonly used as time (for animated 3D noise) or as a wrap\n * dimension (map a coordinate around a circle in w for seamless looping).\n *\n * @param generator A generator created with {@link create}\n * @param x X coordinate\n * @param y Y coordinate\n * @param z Z coordinate\n * @param w W coordinate\n * @returns The noise value at (x, y, z, w)\n */\nexport function sample({ perm, grad4 }: Simplex4DGenerator, x: number, y: number, z: number, w: number): number {\n    // Skew the input space to determine which simplex cell we're in\n    const s = (x + y + z + w) * F4; // Factor for 4D skewing\n    const i = Math.floor(x + s);\n    const j = Math.floor(y + s);\n    const k = Math.floor(z + s);\n    const l = Math.floor(w + s);\n\n    const t = (i + j + k + l) * G4; // Factor for 4D unskewing\n    const x0 = x - (i - t); // The x,y,z,w distances from the cell origin, unskewed\n    const y0 = y - (j - t);\n    const z0 = z - (k - t);\n    const w0 = w - (l - t);\n\n    // For the 4D case, the simplex is a 5-cell (4-simplex). Rank the coordinates\n    // to work out the traversal order of the four middle corners: the largest\n    // coordinate steps first, then the next, and so on (Gustavson's rank method).\n    let rankx = 0;\n    let ranky = 0;\n    let rankz = 0;\n    let rankw = 0;\n    if (x0 > y0) rankx++;\n    else ranky++;\n    if (x0 > z0) rankx++;\n    else rankz++;\n    if (x0 > w0) rankx++;\n    else rankw++;\n    if (y0 > z0) ranky++;\n    else rankz++;\n    if (y0 > w0) ranky++;\n    else rankw++;\n    if (z0 > w0) rankz++;\n    else rankw++;\n\n    // rank 3 is the largest coordinate, so it gets the +1 first, and so on.\n    const i1 = rankx >= 3 ? 1 : 0;\n    const j1 = ranky >= 3 ? 1 : 0;\n    const k1 = rankz >= 3 ? 1 : 0;\n    const l1 = rankw >= 3 ? 1 : 0;\n\n    const i2 = rankx >= 2 ? 1 : 0;\n    const j2 = ranky >= 2 ? 1 : 0;\n    const k2 = rankz >= 2 ? 1 : 0;\n    const l2 = rankw >= 2 ? 1 : 0;\n\n    const i3 = rankx >= 1 ? 1 : 0;\n    const j3 = ranky >= 1 ? 1 : 0;\n    const k3 = rankz >= 1 ? 1 : 0;\n    const l3 = rankw >= 1 ? 1 : 0;\n\n    // Offsets for the remaining corners, unskewed (subtract the step, add G4 per step)\n    const x1 = x0 - i1 + G4;\n    const y1 = y0 - j1 + G4;\n    const z1 = z0 - k1 + G4;\n    const w1 = w0 - l1 + G4;\n\n    const x2 = x0 - i2 + 2 * G4;\n    const y2 = y0 - j2 + 2 * G4;\n    const z2 = z0 - k2 + 2 * G4;\n    const w2 = w0 - l2 + 2 * G4;\n\n    const x3 = x0 - i3 + 3 * G4;\n    const y3 = y0 - j3 + 3 * G4;\n    const z3 = z0 - k3 + 3 * G4;\n    const w3 = w0 - l3 + 3 * G4;\n\n    const x4 = x0 - 1 + 4 * G4;\n    const y4 = y0 - 1 + 4 * G4;\n    const z4 = z0 - 1 + 4 * G4;\n    const w4 = w0 - 1 + 4 * G4;\n\n    // Work out the hashed gradient indices of the five simplex corners\n    // (flat xyzw quads in grad4)\n    const ii = i & 255;\n    const jj = j & 255;\n    const kk = k & 255;\n    const ll = l & 255;\n    const g0 = (ii + perm[jj + perm[kk + perm[ll]]]) * 4;\n    const g1 = (ii + i1 + perm[jj + j1 + perm[kk + k1 + perm[ll + l1]]]) * 4;\n    const g2 = (ii + i2 + perm[jj + j2 + perm[kk + k2 + perm[ll + l2]]]) * 4;\n    const g3 = (ii + i3 + perm[jj + j3 + perm[kk + k3 + perm[ll + l3]]]) * 4;\n    const g4 = (ii + 1 + perm[jj + 1 + perm[kk + 1 + perm[ll + 1]]]) * 4;\n\n    // Calculate the contribution from the five corners\n    let n0 = 0;\n    let n1 = 0;\n    let n2 = 0;\n    let n3 = 0;\n    let n4 = 0;\n    let t0 = 0.6 - x0 * x0 - y0 * y0 - z0 * z0 - w0 * w0;\n    if (t0 >= 0) {\n        t0 *= t0;\n        n0 = t0 * t0 * (grad4[g0] * x0 + grad4[g0 + 1] * y0 + grad4[g0 + 2] * z0 + grad4[g0 + 3] * w0);\n    }\n    let t1 = 0.6 - x1 * x1 - y1 * y1 - z1 * z1 - w1 * w1;\n    if (t1 >= 0) {\n        t1 *= t1;\n        n1 = t1 * t1 * (grad4[g1] * x1 + grad4[g1 + 1] * y1 + grad4[g1 + 2] * z1 + grad4[g1 + 3] * w1);\n    }\n    let t2 = 0.6 - x2 * x2 - y2 * y2 - z2 * z2 - w2 * w2;\n    if (t2 >= 0) {\n        t2 *= t2;\n        n2 = t2 * t2 * (grad4[g2] * x2 + grad4[g2 + 1] * y2 + grad4[g2 + 2] * z2 + grad4[g2 + 3] * w2);\n    }\n    let t3 = 0.6 - x3 * x3 - y3 * y3 - z3 * z3 - w3 * w3;\n    if (t3 >= 0) {\n        t3 *= t3;\n        n3 = t3 * t3 * (grad4[g3] * x3 + grad4[g3 + 1] * y3 + grad4[g3 + 2] * z3 + grad4[g3 + 3] * w3);\n    }\n    let t4 = 0.6 - x4 * x4 - y4 * y4 - z4 * z4 - w4 * w4;\n    if (t4 >= 0) {\n        t4 *= t4;\n        n4 = t4 * t4 * (grad4[g4] * x4 + grad4[g4 + 1] * y4 + grad4[g4 + 2] * z4 + grad4[g4 + 3] * w4);\n    }\n\n    // Add contributions from each corner to get the final noise value.\n    // The result is scaled to return values in the interval [-1, 1].\n    return 27 * (n0 + n1 + n2 + n3 + n4);\n}\n"],"names":[],"mappings":";;AAKA;AACA,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;AACjC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;AAElC;;;;;AAKG;AACG,SAAU,MAAM,CAAC,IAAY,EAAA;AAC/B,IAAA,OAAO,iBAAiB,CAAC,IAAI,CAAC;AAClC;AAEA;;;;;;;;;;;;AAYG;AACG,SAAU,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAsB,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAA;;AAElG,IAAA,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;AAE3B,IAAA,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAC/B,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;;;IAKtB,IAAI,KAAK,GAAG,CAAC;IACb,IAAI,KAAK,GAAG,CAAC;IACb,IAAI,KAAK,GAAG,CAAC;IACb,IAAI,KAAK,GAAG,CAAC;IACb,IAAI,EAAE,GAAG,EAAE;AAAE,QAAA,KAAK,EAAE;;AACf,QAAA,KAAK,EAAE;IACZ,IAAI,EAAE,GAAG,EAAE;AAAE,QAAA,KAAK,EAAE;;AACf,QAAA,KAAK,EAAE;IACZ,IAAI,EAAE,GAAG,EAAE;AAAE,QAAA,KAAK,EAAE;;AACf,QAAA,KAAK,EAAE;IACZ,IAAI,EAAE,GAAG,EAAE;AAAE,QAAA,KAAK,EAAE;;AACf,QAAA,KAAK,EAAE;IACZ,IAAI,EAAE,GAAG,EAAE;AAAE,QAAA,KAAK,EAAE;;AACf,QAAA,KAAK,EAAE;IACZ,IAAI,EAAE,GAAG,EAAE;AAAE,QAAA,KAAK,EAAE;;AACf,QAAA,KAAK,EAAE;;AAGZ,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAE7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAE7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7B,IAAA,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;;AAG7B,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACvB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACvB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACvB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAEvB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAE3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;IAE3B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;IAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;IAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;IAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;;;AAI1B,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG;AAClB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG;AAClB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG;AAClB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG;IAClB,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACpD,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACxE,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACxE,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACxE,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;;IAGpE,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;AACV,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACpD,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAClG;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACpD,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAClG;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACpD,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAClG;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACpD,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAClG;AACA,IAAA,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACpD,IAAA,IAAI,EAAE,IAAI,CAAC,EAAE;QACT,EAAE,IAAI,EAAE;AACR,QAAA,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAClG;;;AAIA,IAAA,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACxC;;;;"}

package/dist/noise/worley2d.js

@@ -0,0 +1,50 @@
+import { createPermutation } from './permutation.js';
+
+/**
+ * Creates a 2D Worley noise generator with the given seed.
+ *
+ * @param seed The seed value for the noise generator
+ * @returns A generator to pass to {@link sample}
+ */
+function create(seed) {
+    return createPermutation(seed);
+}
+/**
+ * Samples 2D Worley (cellular) noise: the Euclidean distance to the nearest of a
+ * set of feature points, one scattered per unit cell. Gives organic cell / scale
+ * / caustic patterns; values are roughly in [0, 1] (0 right at a feature point,
+ * rising between them). Threshold it for cracks, cells, or region masks.
+ *
+ * @param generator A generator created with {@link create}
+ * @param x X coordinate
+ * @param y Y coordinate
+ * @returns The distance to the nearest feature point (F1)
+ */
+function sample({ perm }, x, y) {
+    const ix = Math.floor(x);
+    const iy = Math.floor(y);
+    let f1 = Infinity; // squared nearest distance
+    // check the point's cell and its 8 neighbours; the nearest feature point can
+    // only be in one of these. The row (y) hashes are shared by the three cells
+    // in a row, so hash them once per row.
+    for (let gy = -1; gy <= 1; gy++) {
+        const cy = iy + gy;
+        const py = perm[cy & 255];
+        const qy = perm[(cy + 37) & 255];
+        for (let gx = -1; gx <= 1; gx++) {
+            const cx = ix + gx;
+            // a hashed feature-point offset in [0, 1) per axis, decorrelated
+            const rx = perm[(cx & 255) + py] / 256;
+            const ry = perm[((cx + 71) & 255) + qy] / 256;
+            const dx = cx + rx - x;
+            const dy = cy + ry - y;
+            const d2 = dx * dx + dy * dy;
+            if (d2 < f1)
+                f1 = d2;
+        }
+    }
+    return Math.sqrt(f1);
+}
+
+export { create, sample };
+//# sourceMappingURL=worley2d.js.map

package/dist/noise/worley2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worley2d.js","sources":["../../src/noise/worley2d.ts"],"sourcesContent":["import { createPermutation, type Permutation } from './permutation';\n\n/** A seeded 2D Worley (cellular) noise generator. Create one with {@link create}. */\nexport type Worley2DGenerator = Permutation;\n\n/**\n * Creates a 2D Worley noise generator with the given seed.\n *\n * @param seed The seed value for the noise generator\n * @returns A generator to pass to {@link sample}\n */\nexport function create(seed: number): Worley2DGenerator {\n    return createPermutation(seed);\n}\n\n/**\n * Samples 2D Worley (cellular) noise: the Euclidean distance to the nearest of a\n * set of feature points, one scattered per unit cell. Gives organic cell / scale\n * / caustic patterns; values are roughly in [0, 1] (0 right at a feature point,\n * rising between them). Threshold it for cracks, cells, or region masks.\n *\n * @param generator A generator created with {@link create}\n * @param x X coordinate\n * @param y Y coordinate\n * @returns The distance to the nearest feature point (F1)\n */\nexport function sample({ perm }: Worley2DGenerator, x: number, y: number): number {\n    const ix = Math.floor(x);\n    const iy = Math.floor(y);\n    let f1 = Infinity; // squared nearest distance\n\n    // check the point's cell and its 8 neighbours; the nearest feature point can\n    // only be in one of these. The row (y) hashes are shared by the three cells\n    // in a row, so hash them once per row.\n    for (let gy = -1; gy <= 1; gy++) {\n        const cy = iy + gy;\n        const py = perm[cy & 255];\n        const qy = perm[(cy + 37) & 255];\n        for (let gx = -1; gx <= 1; gx++) {\n            const cx = ix + gx;\n            // a hashed feature-point offset in [0, 1) per axis, decorrelated\n            const rx = perm[(cx & 255) + py] / 256;\n            const ry = perm[((cx + 71) & 255) + qy] / 256;\n            const dx = cx + rx - x;\n            const dy = cy + ry - y;\n            const d2 = dx * dx + dy * dy;\n            if (d2 < f1) f1 = d2;\n        }\n    }\n\n    return Math.sqrt(f1);\n}\n"],"names":[],"mappings":";;AAKA;;;;;AAKG;AACG,SAAU,MAAM,CAAC,IAAY,EAAA;AAC/B,IAAA,OAAO,iBAAiB,CAAC,IAAI,CAAC;AAClC;AAEA;;;;;;;;;;AAUG;AACG,SAAU,MAAM,CAAC,EAAE,IAAI,EAAqB,EAAE,CAAS,EAAE,CAAS,EAAA;IACpE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACxB,IAAA,IAAI,EAAE,GAAG,QAAQ,CAAC;;;;AAKlB,IAAA,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE;AAC7B,QAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;AACzB,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC;AAChC,QAAA,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE;AAC7B,YAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE;;AAElB,YAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG;AACtC,YAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG;AAC7C,YAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;AACtB,YAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;YAC5B,IAAI,EAAE,GAAG,EAAE;gBAAE,EAAE,GAAG,EAAE;QACxB;IACJ;AAEA,IAAA,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACxB;;;;"}