niko
56 lines
1.1 KiB
C#
56 lines
1.1 KiB
C#
using System;
|
|
|
|
namespace KdTree
|
|
{
|
|
// Token: 0x02000005 RID: 5
|
|
public interface ITypeMath<T>
|
|
{
|
|
// Token: 0x0600000B RID: 11
|
|
int Compare(T a, T b);
|
|
|
|
// Token: 0x17000004 RID: 4
|
|
// (get) Token: 0x0600000C RID: 12
|
|
T MinValue { get; }
|
|
|
|
// Token: 0x17000005 RID: 5
|
|
// (get) Token: 0x0600000D RID: 13
|
|
T MaxValue { get; }
|
|
|
|
// Token: 0x0600000E RID: 14
|
|
T Min(T a, T b);
|
|
|
|
// Token: 0x0600000F RID: 15
|
|
T Max(T a, T b);
|
|
|
|
// Token: 0x06000010 RID: 16
|
|
bool AreEqual(T a, T b);
|
|
|
|
// Token: 0x06000011 RID: 17
|
|
bool AreEqual(T[] a, T[] b);
|
|
|
|
// Token: 0x06000012 RID: 18
|
|
T Add(T a, T b);
|
|
|
|
// Token: 0x06000013 RID: 19
|
|
T Subtract(T a, T b);
|
|
|
|
// Token: 0x06000014 RID: 20
|
|
T Multiply(T a, T b);
|
|
|
|
// Token: 0x17000006 RID: 6
|
|
// (get) Token: 0x06000015 RID: 21
|
|
T Zero { get; }
|
|
|
|
// Token: 0x17000007 RID: 7
|
|
// (get) Token: 0x06000016 RID: 22
|
|
T NegativeInfinity { get; }
|
|
|
|
// Token: 0x17000008 RID: 8
|
|
// (get) Token: 0x06000017 RID: 23
|
|
T PositiveInfinity { get; }
|
|
|
|
// Token: 0x06000018 RID: 24
|
|
T DistanceSquaredBetweenPoints(T[] a, T[] b);
|
|
}
|
|
}
|