Database Improvements
Brought in all the myriad improvements to the database tools from the Stream Pixels project Added configurable nested entry grouping
This commit is contained in:
parent
526a737a4d
commit
968783bf9c
37 changed files with 865 additions and 580 deletions
|
|
@ -22,15 +22,6 @@ public static class Extensions
|
|||
{
|
||||
return baseType.GetInterfaces().Any(interfaceType.Equals);
|
||||
}
|
||||
|
||||
// https://stackoverflow.com/a/800469
|
||||
public static string GetHashSHA1(this byte[] data)
|
||||
{
|
||||
using (var sha1 = new System.Security.Cryptography.SHA1CryptoServiceProvider())
|
||||
{
|
||||
return string.Concat(sha1.ComputeHash(data).Select(x => x.ToString("X2")));
|
||||
}
|
||||
}
|
||||
|
||||
public static void Send<T>(this NetPeer peer, T message, DeliveryMethod method = DeliveryMethod.ReliableOrdered) where T : Message
|
||||
{
|
||||
|
|
@ -125,26 +116,6 @@ public static class Extensions
|
|||
throw new ArgumentOutOfRangeException(nameof(rotation), rotation, null);
|
||||
}
|
||||
}
|
||||
|
||||
public static string SplitCamelCase( this string str )
|
||||
{
|
||||
return Regex.Replace(
|
||||
Regex.Replace(
|
||||
str,
|
||||
@"(\P{Ll})(\P{Ll}\p{Ll})",
|
||||
"$1 $2"
|
||||
),
|
||||
@"(\p{Ll})(\P{Ll})",
|
||||
"$1 $2"
|
||||
);
|
||||
}
|
||||
|
||||
public static string FormatTypeName(this string typeName)
|
||||
{
|
||||
return (typeName.EndsWith("Data")
|
||||
? typeName.Substring(0, typeName.Length - 4)
|
||||
: typeName).SplitCamelCase();
|
||||
}
|
||||
|
||||
public static string SignificantDigits(this float d, int digits=10)
|
||||
{
|
||||
|
|
@ -177,152 +148,11 @@ public static class Extensions
|
|||
return pair.Equals(new KeyValuePair<T, TU>());
|
||||
}
|
||||
|
||||
private static Dictionary<float4[], int2> _cachedIndices = new Dictionary<float4[], int2>();
|
||||
public static float Evaluate(this float4[] curve, float time)
|
||||
{
|
||||
// Clamp time
|
||||
time = math.clamp(time, curve[0].x, curve[curve.Length - 1].x);
|
||||
|
||||
FindSurroundingKeyframes(time, curve);
|
||||
return HermiteInterpolate(time, curve[_cachedIndices[curve].x], curve[_cachedIndices[curve].y]);
|
||||
}
|
||||
|
||||
static void FindSurroundingKeyframes(float time, float4[] curve)
|
||||
{
|
||||
// Check that time is within cached keyframe time
|
||||
if (_cachedIndices.ContainsKey(curve) &&
|
||||
_cachedIndices[curve].x != _cachedIndices[curve].y &&
|
||||
time >= curve[_cachedIndices[curve].x].x &&
|
||||
time <= curve[_cachedIndices[curve].y].x)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
// Fall back to using dichotomic search.
|
||||
var length = curve.Length;
|
||||
int half;
|
||||
int middle;
|
||||
int first = 0;
|
||||
|
||||
while (length > 0)
|
||||
{
|
||||
half = length >> 1;
|
||||
middle = first + half;
|
||||
|
||||
if (time < curve[middle].x)
|
||||
{
|
||||
length = half;
|
||||
}
|
||||
else
|
||||
{
|
||||
first = middle + 1;
|
||||
length = length - half - 1;
|
||||
}
|
||||
}
|
||||
|
||||
// If not within range, we pick the last element twice.
|
||||
var indices = int2(first - 1, math.min(curve.Length - 1, first));
|
||||
_cachedIndices[curve] = indices;
|
||||
}
|
||||
|
||||
static float HermiteInterpolate(float time, in float4 leftKeyframe, in float4 rightKeyframe)
|
||||
{
|
||||
// Handle stepped curve.
|
||||
if (math.isinf(leftKeyframe.w) || math.isinf(rightKeyframe.z))
|
||||
{
|
||||
return leftKeyframe.y;
|
||||
}
|
||||
|
||||
float dx = rightKeyframe.x - leftKeyframe.x;
|
||||
float m0;
|
||||
float m1;
|
||||
float t;
|
||||
if (dx != 0.0f)
|
||||
{
|
||||
t = (time - leftKeyframe.x) / dx;
|
||||
m0 = leftKeyframe.w * dx;
|
||||
m1 = rightKeyframe.z * dx;
|
||||
}
|
||||
else
|
||||
{
|
||||
t = 0.0f;
|
||||
m0 = 0;
|
||||
m1 = 0;
|
||||
}
|
||||
|
||||
return HermiteInterpolate(t, leftKeyframe.y, m0, m1, rightKeyframe.y);
|
||||
}
|
||||
|
||||
static float HermiteInterpolate(float t, float p0, float m0, float m1, float p1)
|
||||
{
|
||||
// Unrolled the equations to avoid precision issue.
|
||||
// (2 * t^3 -3 * t^2 +1) * p0 + (t^3 - 2 * t^2 + t) * m0 + (-2 * t^3 + 3 * t^2) * p1 + (t^3 - t^2) * m1
|
||||
|
||||
var a = 2.0f * p0 + m0 - 2.0f * p1 + m1;
|
||||
var b = -3.0f * p0 - 2.0f * m0 + 3.0f * p1 - m1;
|
||||
var c = m0;
|
||||
var d = p0;
|
||||
|
||||
return t * (t * (a * t + b) + c) + d;
|
||||
}
|
||||
|
||||
public static float Angle(this float2 from, float2 to)
|
||||
{
|
||||
var num = sqrt(lengthsq(from) * lengthsq(to));
|
||||
return num < 1.00000000362749E-15 ? 0.0f : acos(clamp(dot(from, to) / num, -1f, 1f)) * 57.29578f;
|
||||
}
|
||||
|
||||
// https://stackoverflow.com/a/3188835
|
||||
public static T MaxBy<T, U>(this IEnumerable<T> items, Func<T, U> selector)
|
||||
{
|
||||
if (!items.Any())
|
||||
{
|
||||
throw new InvalidOperationException("Empty input sequence");
|
||||
}
|
||||
|
||||
var comparer = Comparer<U>.Default;
|
||||
T maxItem = items.First();
|
||||
U maxValue = selector(maxItem);
|
||||
|
||||
foreach (T item in items.Skip(1))
|
||||
{
|
||||
// Get the value of the item and compare it to the current max.
|
||||
U value = selector(item);
|
||||
if (comparer.Compare(value, maxValue) > 0)
|
||||
{
|
||||
maxValue = value;
|
||||
maxItem = item;
|
||||
}
|
||||
}
|
||||
|
||||
return maxItem;
|
||||
}
|
||||
|
||||
public static T MinBy<T, U>(this IEnumerable<T> items, Func<T, U> selector)
|
||||
{
|
||||
if (!items.Any())
|
||||
{
|
||||
throw new InvalidOperationException("Empty input sequence");
|
||||
}
|
||||
|
||||
var comparer = Comparer<U>.Default;
|
||||
T maxItem = items.First();
|
||||
U maxValue = selector(maxItem);
|
||||
|
||||
foreach (T item in items.Skip(1))
|
||||
{
|
||||
// Get the value of the item and compare it to the current max.
|
||||
U value = selector(item);
|
||||
if (comparer.Compare(value, maxValue) < 0)
|
||||
{
|
||||
maxValue = value;
|
||||
maxItem = item;
|
||||
}
|
||||
}
|
||||
|
||||
return maxItem;
|
||||
}
|
||||
}
|
||||
|
||||
// https://github.com/Burtsev-Alexey/net-object-deep-copy
|
||||
|
|
|
|||
Loading…
Reference in a new issue