您最多选择25个主题
主题必须以中文或者字母或数字开头，可以包含连字符 (-)，并且长度不得超过35个字符
71 行
1.8 KiB
71 行
1.8 KiB
#ifndef UNITY_NOISE_INCLUDED
|
|
#define UNITY_NOISE_INCLUDED
|
|
|
|
// A single iteration of Bob Jenkins' One-At-A-Time hashing algorithm.
|
|
uint JenkinsHash(uint x)
|
|
{
|
|
x += (x << 10u);
|
|
x ^= (x >> 6u);
|
|
x += (x << 3u);
|
|
x ^= (x >> 11u);
|
|
x += (x << 15u);
|
|
return x;
|
|
}
|
|
|
|
// Compound versions of the hashing algorithm.
|
|
uint JenkinsHash(uint2 v)
|
|
{
|
|
return JenkinsHash(v.x ^ JenkinsHash(v.y));
|
|
}
|
|
|
|
uint JenkinsHash(uint3 v)
|
|
{
|
|
return JenkinsHash(v.x ^ JenkinsHash(v.y) ^ JenkinsHash(v.z));
|
|
}
|
|
|
|
uint JenkinsHash(uint4 v)
|
|
{
|
|
return JenkinsHash(v.x ^ JenkinsHash(v.y) ^ JenkinsHash(v.z) ^ JenkinsHash(v.w));
|
|
}
|
|
|
|
// Construct a float with half-open range [0, 1) using low 23 bits.
|
|
// All zeros yields 0, all ones yields the next smallest representable value below 1.
|
|
float ConstructFloat(int m) {
|
|
const int ieeeMantissa = 0x007FFFFF; // Binary FP32 mantissa bitmask
|
|
const int ieeeOne = 0x3F800000; // 1.0 in FP32 IEEE
|
|
|
|
m &= ieeeMantissa; // Keep only mantissa bits (fractional part)
|
|
m |= ieeeOne; // Add fractional part to 1.0
|
|
|
|
float f = asfloat(m); // Range [1, 2)
|
|
return f - 1; // Range [0, 1)
|
|
}
|
|
|
|
float ConstructFloat(uint m)
|
|
{
|
|
return ConstructFloat(asint(m));
|
|
}
|
|
|
|
// Pseudo-random value in half-open range [0, 1). The distribution is reasonably uniform.
|
|
// Ref: https://stackoverflow.com/a/17479300
|
|
float GenerateHashedRandomFloat(uint x)
|
|
{
|
|
return ConstructFloat(JenkinsHash(x));
|
|
}
|
|
|
|
float GenerateHashedRandomFloat(uint2 v)
|
|
{
|
|
return ConstructFloat(JenkinsHash(v));
|
|
}
|
|
|
|
float GenerateHashedRandomFloat(uint3 v)
|
|
{
|
|
return ConstructFloat(JenkinsHash(v));
|
|
}
|
|
|
|
float GenerateHashedRandomFloat(uint4 v)
|
|
{
|
|
return ConstructFloat(JenkinsHash(v));
|
|
}
|
|
|
|
#endif // UNITY_NOISE_INCLUDED
|