Package | Description |
---|---|
squidpony.squidmath |
A very broad package containing random number generators, geometry tools, data structures, and noise functions.
|
Modifier and Type | Interface and Description |
---|---|
interface |
FlawedPointHash
An interface for point hashes that are statistically biased, as well as a holder for inner classes that implement
this.
|
Modifier and Type | Class and Description |
---|---|
static class |
FlawedPointHash.CubeHash
Very similar to
FlawedPointHash.QuiltHash , but this doesn't change the pattern in different large squares, and instead
repeats a square or cube of symmetric and patterned results over and over (so it can be tiled). |
static class |
FlawedPointHash.FNVHash
FNV32a is OK as a hash for bytes when used in some hash tables, but it has major issues on its low-order bits
when used as a point hash (the high bits aren't much better).
|
static class |
FlawedPointHash.QuiltHash
Extremely flawed if you're using this as a point hash, but meant to be aesthetically interesting, this produces
different symmetrical patterns in squares, as if on a quilt.
|
static class |
FlawedPointHash.RugHash
Produces hashes that show strong bias on one axis (usually the later axes matter more) and have nice-looking
patterns of dots.
|
class |
GoldPointHash
A relatively simple
IPointHash that multiplies each of the x, y, etc. |
class |
HappyPointHash
A group of similar methods for getting hashes of points based on long coordinates in 2, 3, 4, 5, or 6 dimensions and
a long for state; like
IntPointHash in most respects, but uses longs. |
class |
HastyPointHash
A group of similar methods for getting hashes of points based on long coordinates in 2, 3, 4, 5, or 6 dimensions and
a long for state; like
PointHash but faster. |
class |
HushPointHash
A group of similar methods for getting hashes of points based on long coordinates in 2, 3, 4, 5, or 6 dimensions and
a long for state; this is mostly meant as an optimization of
HastyPointHash . |
class |
IntPointHash
A group of similar methods for getting hashes of points based on int coordinates in 2, 3, 4, or 6 dimensions and
an int for state; the code is similar to
HastyPointHash but will be much faster on GWT. |
static class |
IPointHash.IntImpl
A convenience abstract class to implement IPointHash when you have an int for state.
|
static class |
IPointHash.LongImpl
A convenience abstract class to implement IPointHash when you have a long for state.
|
class |
KnownSizePointHash
A very simple point hash meant only for fixed-size grids, and only for when the hash must be unique but does
not need to be randomized.
|
class |
PermPointHash
A mid-to-low quality point hash that uses a similar (not identical) technique to what OpenSimplex2 uses, with
a permutation array created at construction.
|
class |
PointHash
A group of similar methods for getting hashes of points based on long coordinates in 2, 3, 4, or 6 dimensions and
a long for state.
|
class |
TabularPointHash
Just another experiment with precomputed point hashes.
|
class |
TorusCachePointHash
A group of similar methods for getting hashes of points based on int coordinates in 2, 3, 4, 5, or 6 dimensions and
an int for state; here, points are considered toroidally wrapping, where the wrap happens at a power of two that is
no greater than 1024.
|
Modifier and Type | Field and Description |
---|---|
IPointHash |
HashedValueNoise.hash |
protected IPointHash |
FastNoise.pointHash |
Modifier and Type | Method and Description |
---|---|
IPointHash |
FastNoise.getPointHash()
Gets the point hash, an object implementing
IPointHash that is used to take 2 or more
coordinates and a seed and produce a usually-random-seeming hash value. |
Modifier and Type | Method and Description |
---|---|
void |
FastNoise.setPointHash(IPointHash hash)
Sets the point hash, an object implementing
IPointHash that is used to take 2 or more
coordinates and a seed and produce a usually-random-seeming hash value. |
Constructor and Description |
---|
HashedValueNoise(IPointHash hash) |
Copyright © Eben Howard 2012–2022. All rights reserved.