Generates noise using the FastNoiseLite library. This class generates noise using the FastNoiseLite library, which is a collection of several noise algorithms including Cellular, Perlin, Value, and more. Most generated noise values are in the range of [code][-1,1][/code], however not always. Some of the cellular noise algorithms return results above [code]1[/code]. Determines how the distance to the nearest/second-nearest point is computed. See [enum CellularDistanceFunction] for options. Maximum distance a point can move off of its grid position. Set to [code]0[/code] for an even grid. Return type from cellular noise calculations. See [enum CellularReturnType]. A [Gradient] which is used to map the luminance of each pixel to a color value. Sets the maximum warp distance from the origin. If enabled, another FastNoiseLite instance is used to warp the space, resulting in a distortion of the noise. Determines the strength of each subsequent layer of the noise which is used to warp the space. A low value places more emphasis on the lower frequency base layers, while a high value puts more emphasis on the higher frequency layers. Octave lacunarity of the fractal noise which warps the space. Increasing this value results in higher octaves producing noise with finer details and a rougher appearance. The number of noise layers that are sampled to get the final value for the fractal noise which warps the space. The method for combining octaves into a fractal which is used to warp the space. See [enum DomainWarpFractalType]. Frequency of the noise which warps the space. Low frequency results in smooth noise while high frequency results in rougher, more granular noise. Sets the warp algorithm. See [enum DomainWarpType]. Determines the strength of each subsequent layer of noise in fractal noise. A low value places more emphasis on the lower frequency base layers, while a high value puts more emphasis on the higher frequency layers. Frequency multiplier between subsequent octaves. Increasing this value results in higher octaves producing noise with finer details and a rougher appearance. The number of noise layers that are sampled to get the final value for fractal noise types. Sets the strength of the fractal ping pong type. The method for combining octaves into a fractal. See [enum FractalType]. Higher weighting means higher octaves have less impact if lower octaves have a large impact. The frequency for all noise types. Low frequency results in smooth noise while high frequency results in rougher, more granular noise. Determines whether the noise image returned by [method Noise.get_image] is calculated in 3d space. May result in reduced contrast. The noise algorithm used. See [enum NoiseType]. Translate the noise input coordinates by the given [Vector3]. The random number seed for all noise types. A lattice of points are assigned random values then interpolated based on neighboring values. Similar to Value noise, but slower. Has more variance in peaks and valleys. Cubic noise can be used to avoid certain artifacts when using value noise to create a bumpmap. In general, you should always use this mode if the value noise is being used for a heightmap or bumpmap. A lattice of random gradients. Their dot products are interpolated to obtain values in between the lattices. Cellular includes both Worley noise and Voronoi diagrams which creates various regions of the same value. As opposed to [constant TYPE_PERLIN], gradients exist in a simplex lattice rather than a grid lattice, avoiding directional artifacts. Modified, higher quality version of [constant TYPE_SIMPLEX], but slower. No fractal noise. Method using Fractional Brownian Motion to combine octaves into a fractal. Method of combining octaves into a fractal resulting in a "ridged" look. Method of combining octaves into a fractal with a ping pong effect. Euclidean distance to the nearest point. Squared Euclidean distance to the nearest point. Manhattan distance (taxicab metric) to the nearest point. Blend of [constant DISTANCE_EUCLIDEAN] and [constant DISTANCE_MANHATTAN] to give curved cell boundaries The cellular distance function will return the same value for all points within a cell. The cellular distance function will return a value determined by the distance to the nearest point. The cellular distance function returns the distance to the second-nearest point. The distance to the nearest point is added to the distance to the second-nearest point. The distance to the nearest point is subtracted from the distance to the second-nearest point. The distance to the nearest point is multiplied with the distance to the second-nearest point. The distance to the nearest point is divided by the distance to the second-nearest point. The domain is warped using the simplex noise algorithm. The domain is warped using a simplified version of the simplex noise algorithm. The domain is warped using a simple noise grid (not as smooth as the other methods, but more performant). No fractal noise for warping the space. Warping the space progressively, octave for octave, resulting in a more "liquified" distortion. Warping the space independently for each octave, resulting in a more chaotic distortion.