0// stb_perlin.h - v0.5 - perlin noise
1// public domain single-file C implementation by Sean Barrett
2//
3// LICENSE
4//
5// See end of file.
6//
7//
8// to create the implementation,
9// #define STB_PERLIN_IMPLEMENTATION
10// in *one* C/CPP file that includes this file.
11//
12//
13// Documentation:
14//
15// float stb_perlin_noise3( float x,
16// float y,
17// float z,
18// int x_wrap=0,
19// int y_wrap=0,
20// int z_wrap=0)
21//
22// This function computes a random value at the coordinate (x,y,z).
23// Adjacent random values are continuous but the noise fluctuates
24// its randomness with period 1, i.e. takes on wholly unrelated values
25// at integer points. Specifically, this implements Ken Perlin's
26// revised noise function from 2002.
27//
28// The "wrap" parameters can be used to create wraparound noise that
29// wraps at powers of two. The numbers MUST be powers of two. Specify
30// 0 to mean "don't care". (The noise always wraps every 256 due
31// details of the implementation, even if you ask for larger or no
32// wrapping.)
33//
34// float stb_perlin_noise3_seed( float x,
35// float y,
36// float z,
37// int x_wrap=0,
38// int y_wrap=0,
39// int z_wrap=0,
40// int seed)
41//
42// As above, but 'seed' selects from multiple different variations of the
43// noise function. The current implementation only uses the bottom 8 bits
44// of 'seed', but possibly in the future more bits will be used.
45//
46//
47// Fractal Noise:
48//
49// Three common fractal noise functions are included, which produce
50// a wide variety of nice effects depending on the parameters
51// provided. Note that each function will call stb_perlin_noise3
52// 'octaves' times, so this parameter will affect runtime.
53//
54// float stb_perlin_ridge_noise3(float x, float y, float z,
55// float lacunarity, float gain, float offset, int octaves)
56//
57// float stb_perlin_fbm_noise3(float x, float y, float z,
58// float lacunarity, float gain, int octaves)
59//
60// float stb_perlin_turbulence_noise3(float x, float y, float z,
61// float lacunarity, float gain, int octaves)
62//
63// Typical values to start playing with:
64// octaves = 6 -- number of "octaves" of noise3() to sum
65// lacunarity = ~ 2.0 -- spacing between successive octaves (use exactly 2.0 for wrapping output)
66// gain = 0.5 -- relative weighting applied to each successive octave
67// offset = 1.0? -- used to invert the ridges, may need to be larger, not sure
68//
69//
70// Contributors:
71// Jack Mott - additional noise functions
72// Jordan Peck - seeded noise
73//
76#ifdef __cplusplus
77extern "C" {
78#endif
79extern float stb_perlin_noise3(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap);
80extern float stb_perlin_noise3_seed(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap, int seed);
81extern float stb_perlin_ridge_noise3(float x, float y, float z, float lacunarity, float gain, float offset, int octaves);
82extern float stb_perlin_fbm_noise3(float x, float y, float z, float lacunarity, float gain, int octaves);
83extern float stb_perlin_turbulence_noise3(float x, float y, float z, float lacunarity, float gain, int octaves);
84extern float stb_perlin_noise3_wrap_nonpow2(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap, unsigned char seed);
85#ifdef __cplusplus
86}
87#endif
89#ifdef STB_PERLIN_IMPLEMENTATION
91#include <math.h> // fabs()
93// not same permutation table as Perlin's reference to avoid copyright issues;
94// Perlin's table can be found at http://mrl.nyu.edu/~perlin/noise/
95static unsigned char stb__perlin_randtab[512] =
96{
97 23, 125, 161, 52, 103, 117, 70, 37, 247, 101, 203, 169, 124, 126, 44, 123,
98 152, 238, 145, 45, 171, 114, 253, 10, 192, 136, 4, 157, 249, 30, 35, 72,
99 175, 63, 77, 90, 181, 16, 96, 111, 133, 104, 75, 162, 93, 56, 66, 240,
100 8, 50, 84, 229, 49, 210, 173, 239, 141, 1, 87, 18, 2, 198, 143, 57,
101 225, 160, 58, 217, 168, 206, 245, 204, 199, 6, 73, 60, 20, 230, 211, 233,
102 94, 200, 88, 9, 74, 155, 33, 15, 219, 130, 226, 202, 83, 236, 42, 172,
103 165, 218, 55, 222, 46, 107, 98, 154, 109, 67, 196, 178, 127, 158, 13, 243,
104 65, 79, 166, 248, 25, 224, 115, 80, 68, 51, 184, 128, 232, 208, 151, 122,
105 26, 212, 105, 43, 179, 213, 235, 148, 146, 89, 14, 195, 28, 78, 112, 76,
106 250, 47, 24, 251, 140, 108, 186, 190, 228, 170, 183, 139, 39, 188, 244, 246,
107 132, 48, 119, 144, 180, 138, 134, 193, 82, 182, 120, 121, 86, 220, 209, 3,
108 91, 241, 149, 85, 205, 150, 113, 216, 31, 100, 41, 164, 177, 214, 153, 231,
109 38, 71, 185, 174, 97, 201, 29, 95, 7, 92, 54, 254, 191, 118, 34, 221,
110 131, 11, 163, 99, 234, 81, 227, 147, 156, 176, 17, 142, 69, 12, 110, 62,
111 27, 255, 0, 194, 59, 116, 242, 252, 19, 21, 187, 53, 207, 129, 64, 135,
112 61, 40, 167, 237, 102, 223, 106, 159, 197, 189, 215, 137, 36, 32, 22, 5,
114 // and a second copy so we don't need an extra mask or static initializer
115 23, 125, 161, 52, 103, 117, 70, 37, 247, 101, 203, 169, 124, 126, 44, 123,
116 152, 238, 145, 45, 171, 114, 253, 10, 192, 136, 4, 157, 249, 30, 35, 72,
117 175, 63, 77, 90, 181, 16, 96, 111, 133, 104, 75, 162, 93, 56, 66, 240,
118 8, 50, 84, 229, 49, 210, 173, 239, 141, 1, 87, 18, 2, 198, 143, 57,
119 225, 160, 58, 217, 168, 206, 245, 204, 199, 6, 73, 60, 20, 230, 211, 233,
120 94, 200, 88, 9, 74, 155, 33, 15, 219, 130, 226, 202, 83, 236, 42, 172,
121 165, 218, 55, 222, 46, 107, 98, 154, 109, 67, 196, 178, 127, 158, 13, 243,
122 65, 79, 166, 248, 25, 224, 115, 80, 68, 51, 184, 128, 232, 208, 151, 122,
123 26, 212, 105, 43, 179, 213, 235, 148, 146, 89, 14, 195, 28, 78, 112, 76,
124 250, 47, 24, 251, 140, 108, 186, 190, 228, 170, 183, 139, 39, 188, 244, 246,
125 132, 48, 119, 144, 180, 138, 134, 193, 82, 182, 120, 121, 86, 220, 209, 3,
126 91, 241, 149, 85, 205, 150, 113, 216, 31, 100, 41, 164, 177, 214, 153, 231,
127 38, 71, 185, 174, 97, 201, 29, 95, 7, 92, 54, 254, 191, 118, 34, 221,
128 131, 11, 163, 99, 234, 81, 227, 147, 156, 176, 17, 142, 69, 12, 110, 62,
129 27, 255, 0, 194, 59, 116, 242, 252, 19, 21, 187, 53, 207, 129, 64, 135,
130 61, 40, 167, 237, 102, 223, 106, 159, 197, 189, 215, 137, 36, 32, 22, 5,
131};
134// perlin's gradient has 12 cases so some get used 1/16th of the time
135// and some 2/16ths. We reduce bias by changing those fractions
136// to 5/64ths and 6/64ths
138// this array is designed to match the previous implementation
139// of gradient hash: indices[stb__perlin_randtab[i]&63]
140static unsigned char stb__perlin_randtab_grad_idx[512] =
141{
142 7, 9, 5, 0, 11, 1, 6, 9, 3, 9, 11, 1, 8, 10, 4, 7,
143 8, 6, 1, 5, 3, 10, 9, 10, 0, 8, 4, 1, 5, 2, 7, 8,
144 7, 11, 9, 10, 1, 0, 4, 7, 5, 0, 11, 6, 1, 4, 2, 8,
145 8, 10, 4, 9, 9, 2, 5, 7, 9, 1, 7, 2, 2, 6, 11, 5,
146 5, 4, 6, 9, 0, 1, 1, 0, 7, 6, 9, 8, 4, 10, 3, 1,
147 2, 8, 8, 9, 10, 11, 5, 11, 11, 2, 6, 10, 3, 4, 2, 4,
148 9, 10, 3, 2, 6, 3, 6, 10, 5, 3, 4, 10, 11, 2, 9, 11,
149 1, 11, 10, 4, 9, 4, 11, 0, 4, 11, 4, 0, 0, 0, 7, 6,
150 10, 4, 1, 3, 11, 5, 3, 4, 2, 9, 1, 3, 0, 1, 8, 0,
151 6, 7, 8, 7, 0, 4, 6, 10, 8, 2, 3, 11, 11, 8, 0, 2,
152 4, 8, 3, 0, 0, 10, 6, 1, 2, 2, 4, 5, 6, 0, 1, 3,
153 11, 9, 5, 5, 9, 6, 9, 8, 3, 8, 1, 8, 9, 6, 9, 11,
154 10, 7, 5, 6, 5, 9, 1, 3, 7, 0, 2, 10, 11, 2, 6, 1,
155 3, 11, 7, 7, 2, 1, 7, 3, 0, 8, 1, 1, 5, 0, 6, 10,
156 11, 11, 0, 2, 7, 0, 10, 8, 3, 5, 7, 1, 11, 1, 0, 7,
157 9, 0, 11, 5, 10, 3, 2, 3, 5, 9, 7, 9, 8, 4, 6, 5,
159 // and a second copy so we don't need an extra mask or static initializer
160 7, 9, 5, 0, 11, 1, 6, 9, 3, 9, 11, 1, 8, 10, 4, 7,
161 8, 6, 1, 5, 3, 10, 9, 10, 0, 8, 4, 1, 5, 2, 7, 8,
162 7, 11, 9, 10, 1, 0, 4, 7, 5, 0, 11, 6, 1, 4, 2, 8,
163 8, 10, 4, 9, 9, 2, 5, 7, 9, 1, 7, 2, 2, 6, 11, 5,
164 5, 4, 6, 9, 0, 1, 1, 0, 7, 6, 9, 8, 4, 10, 3, 1,
165 2, 8, 8, 9, 10, 11, 5, 11, 11, 2, 6, 10, 3, 4, 2, 4,
166 9, 10, 3, 2, 6, 3, 6, 10, 5, 3, 4, 10, 11, 2, 9, 11,
167 1, 11, 10, 4, 9, 4, 11, 0, 4, 11, 4, 0, 0, 0, 7, 6,
168 10, 4, 1, 3, 11, 5, 3, 4, 2, 9, 1, 3, 0, 1, 8, 0,
169 6, 7, 8, 7, 0, 4, 6, 10, 8, 2, 3, 11, 11, 8, 0, 2,
170 4, 8, 3, 0, 0, 10, 6, 1, 2, 2, 4, 5, 6, 0, 1, 3,
171 11, 9, 5, 5, 9, 6, 9, 8, 3, 8, 1, 8, 9, 6, 9, 11,
172 10, 7, 5, 6, 5, 9, 1, 3, 7, 0, 2, 10, 11, 2, 6, 1,
173 3, 11, 7, 7, 2, 1, 7, 3, 0, 8, 1, 1, 5, 0, 6, 10,
174 11, 11, 0, 2, 7, 0, 10, 8, 3, 5, 7, 1, 11, 1, 0, 7,
175 9, 0, 11, 5, 10, 3, 2, 3, 5, 9, 7, 9, 8, 4, 6, 5,
176};
178static float stb__perlin_lerp(float a, float b, float t)
179{
180 return a + (b-a) * t;
181}
183static int stb__perlin_fastfloor(float a)
184{
185 int ai = (int) a;
186 return (a < ai) ? ai-1 : ai;
187}
189// different grad function from Perlin's, but easy to modify to match reference
190static float stb__perlin_grad(int grad_idx, float x, float y, float z)
191{
192 static float basis[12][4] =
193 {
194 { 1, 1, 0 },
195 { -1, 1, 0 },
196 { 1,-1, 0 },
197 { -1,-1, 0 },
198 { 1, 0, 1 },
199 { -1, 0, 1 },
200 { 1, 0,-1 },
201 { -1, 0,-1 },
202 { 0, 1, 1 },
203 { 0,-1, 1 },
204 { 0, 1,-1 },
205 { 0,-1,-1 },
206 };
208 float *grad = basis[grad_idx];
209 return grad[0]*x + grad[1]*y + grad[2]*z;
210}
212float stb_perlin_noise3_internal(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap, unsigned char seed)
213{
214 float u,v,w;
215 float n000,n001,n010,n011,n100,n101,n110,n111;
216 float n00,n01,n10,n11;
217 float n0,n1;
219 unsigned int x_mask = (x_wrap-1) & 255;
220 unsigned int y_mask = (y_wrap-1) & 255;
221 unsigned int z_mask = (z_wrap-1) & 255;
222 int px = stb__perlin_fastfloor(x);
223 int py = stb__perlin_fastfloor(y);
224 int pz = stb__perlin_fastfloor(z);
225 int x0 = px & x_mask, x1 = (px+1) & x_mask;
226 int y0 = py & y_mask, y1 = (py+1) & y_mask;
227 int z0 = pz & z_mask, z1 = (pz+1) & z_mask;
228 int r0,r1, r00,r01,r10,r11;
230 #define stb__perlin_ease(a) (((a*6-15)*a + 10) * a * a * a)
232 x -= px; u = stb__perlin_ease(x);
233 y -= py; v = stb__perlin_ease(y);
234 z -= pz; w = stb__perlin_ease(z);
236 r0 = stb__perlin_randtab[x0+seed];
237 r1 = stb__perlin_randtab[x1+seed];
239 r00 = stb__perlin_randtab[r0+y0];
240 r01 = stb__perlin_randtab[r0+y1];
241 r10 = stb__perlin_randtab[r1+y0];
242 r11 = stb__perlin_randtab[r1+y1];
244 n000 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r00+z0], x , y , z );
245 n001 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r00+z1], x , y , z-1 );
246 n010 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r01+z0], x , y-1, z );
247 n011 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r01+z1], x , y-1, z-1 );
248 n100 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r10+z0], x-1, y , z );
249 n101 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r10+z1], x-1, y , z-1 );
250 n110 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r11+z0], x-1, y-1, z );
251 n111 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r11+z1], x-1, y-1, z-1 );
253 n00 = stb__perlin_lerp(n000,n001,w);
254 n01 = stb__perlin_lerp(n010,n011,w);
255 n10 = stb__perlin_lerp(n100,n101,w);
256 n11 = stb__perlin_lerp(n110,n111,w);
258 n0 = stb__perlin_lerp(n00,n01,v);
259 n1 = stb__perlin_lerp(n10,n11,v);
261 return stb__perlin_lerp(n0,n1,u);
262}
264float stb_perlin_noise3(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap)
265{
266 return stb_perlin_noise3_internal(x,y,z,x_wrap,y_wrap,z_wrap,0);
267}
269float stb_perlin_noise3_seed(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap, int seed)
270{
271 return stb_perlin_noise3_internal(x,y,z,x_wrap,y_wrap,z_wrap, (unsigned char) seed);
272}
274float stb_perlin_ridge_noise3(float x, float y, float z, float lacunarity, float gain, float offset, int octaves)
275{
276 int i;
277 float frequency = 1.0f;
278 float prev = 1.0f;
279 float amplitude = 0.5f;
280 float sum = 0.0f;
282 for (i = 0; i < octaves; i++) {
283 float r = stb_perlin_noise3_internal(x*frequency,y*frequency,z*frequency,0,0,0,(unsigned char)i);
284 r = offset - (float) fabs(r);
285 r = r*r;
286 sum += r*amplitude*prev;
287 prev = r;
288 frequency *= lacunarity;
289 amplitude *= gain;
290 }
291 return sum;
292}
294float stb_perlin_fbm_noise3(float x, float y, float z, float lacunarity, float gain, int octaves)
295{
296 int i;
297 float frequency = 1.0f;
298 float amplitude = 1.0f;
299 float sum = 0.0f;
301 for (i = 0; i < octaves; i++) {
302 sum += stb_perlin_noise3_internal(x*frequency,y*frequency,z*frequency,0,0,0,(unsigned char)i)*amplitude;
303 frequency *= lacunarity;
304 amplitude *= gain;
305 }
306 return sum;
307}
309float stb_perlin_turbulence_noise3(float x, float y, float z, float lacunarity, float gain, int octaves)
310{
311 int i;
312 float frequency = 1.0f;
313 float amplitude = 1.0f;
314 float sum = 0.0f;
316 for (i = 0; i < octaves; i++) {
317 float r = stb_perlin_noise3_internal(x*frequency,y*frequency,z*frequency,0,0,0,(unsigned char)i)*amplitude;
318 sum += (float) fabs(r);
319 frequency *= lacunarity;
320 amplitude *= gain;
321 }
322 return sum;
323}
325float stb_perlin_noise3_wrap_nonpow2(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap, unsigned char seed)
326{
327 float u,v,w;
328 float n000,n001,n010,n011,n100,n101,n110,n111;
329 float n00,n01,n10,n11;
330 float n0,n1;
332 int px = stb__perlin_fastfloor(x);
333 int py = stb__perlin_fastfloor(y);
334 int pz = stb__perlin_fastfloor(z);
335 int x_wrap2 = (x_wrap ? x_wrap : 256);
336 int y_wrap2 = (y_wrap ? y_wrap : 256);
337 int z_wrap2 = (z_wrap ? z_wrap : 256);
338 int x0 = px % x_wrap2, x1;
339 int y0 = py % y_wrap2, y1;
340 int z0 = pz % z_wrap2, z1;
341 int r0,r1, r00,r01,r10,r11;
343 if (x0 < 0) x0 += x_wrap2;
344 if (y0 < 0) y0 += y_wrap2;
345 if (z0 < 0) z0 += z_wrap2;
346 x1 = (x0+1) % x_wrap2;
347 y1 = (y0+1) % y_wrap2;
348 z1 = (z0+1) % z_wrap2;
350 #define stb__perlin_ease(a) (((a*6-15)*a + 10) * a * a * a)
352 x -= px; u = stb__perlin_ease(x);
353 y -= py; v = stb__perlin_ease(y);
354 z -= pz; w = stb__perlin_ease(z);
356 r0 = stb__perlin_randtab[x0];
357 r0 = stb__perlin_randtab[r0+seed];
358 r1 = stb__perlin_randtab[x1];
359 r1 = stb__perlin_randtab[r1+seed];
361 r00 = stb__perlin_randtab[r0+y0];
362 r01 = stb__perlin_randtab[r0+y1];
363 r10 = stb__perlin_randtab[r1+y0];
364 r11 = stb__perlin_randtab[r1+y1];
366 n000 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r00+z0], x , y , z );
367 n001 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r00+z1], x , y , z-1 );
368 n010 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r01+z0], x , y-1, z );
369 n011 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r01+z1], x , y-1, z-1 );
370 n100 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r10+z0], x-1, y , z );
371 n101 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r10+z1], x-1, y , z-1 );
372 n110 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r11+z0], x-1, y-1, z );
373 n111 = stb__perlin_grad(stb__perlin_randtab_grad_idx[r11+z1], x-1, y-1, z-1 );
375 n00 = stb__perlin_lerp(n000,n001,w);
376 n01 = stb__perlin_lerp(n010,n011,w);
377 n10 = stb__perlin_lerp(n100,n101,w);
378 n11 = stb__perlin_lerp(n110,n111,w);
380 n0 = stb__perlin_lerp(n00,n01,v);
381 n1 = stb__perlin_lerp(n10,n11,v);
383 return stb__perlin_lerp(n0,n1,u);
384}
385#endif // STB_PERLIN_IMPLEMENTATION
387/*
388------------------------------------------------------------------------------
389This software is available under 2 licenses -- choose whichever you prefer.
390------------------------------------------------------------------------------
391ALTERNATIVE A - MIT License
392Copyright (c) 2017 Sean Barrett
393Permission is hereby granted, free of charge, to any person obtaining a copy of
394this software and associated documentation files (the "Software"), to deal in
395the Software without restriction, including without limitation the rights to
396use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
397of the Software, and to permit persons to whom the Software is furnished to do
398so, subject to the following conditions:
399The above copyright notice and this permission notice shall be included in all
400copies or substantial portions of the Software.
401THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
402IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
403FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
404AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
405LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
406OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
407SOFTWARE.
408------------------------------------------------------------------------------
409ALTERNATIVE B - Public Domain (www.unlicense.org)
410This is free and unencumbered software released into the public domain.
411Anyone is free to copy, modify, publish, use, compile, sell, or distribute this
412software, either in source code form or as a compiled binary, for any purpose,
413commercial or non-commercial, and by any means.
414In jurisdictions that recognize copyright laws, the author or authors of this
415software dedicate any and all copyright interest in the software to the public
416domain. We make this dedication for the benefit of the public at large and to
417the detriment of our heirs and successors. We intend this dedication to be an
418overt act of relinquishment in perpetuity of all present and future rights to
419this software under copyright law.
420THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
421IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
422FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
423AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
424ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
425WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
426------------------------------------------------------------------------------
427*/
index : raylib-jai
Bindings from https://solarium.technology