niko
42 lines
1.0 KiB
C#
42 lines
1.0 KiB
C#
using System;
|
|
using System.Collections;
|
|
using System.Collections.Generic;
|
|
|
|
namespace KdTree
|
|
{
|
|
// Token: 0x02000006 RID: 6
|
|
public interface IKdTree<TKey, TValue> : IEnumerable<KdTreeNode<TKey, TValue>>, IEnumerable
|
|
{
|
|
// Token: 0x06000019 RID: 25
|
|
bool Add(TKey[] point, TValue value);
|
|
|
|
// Token: 0x0600001A RID: 26
|
|
bool TryFindValueAt(TKey[] point, out TValue value);
|
|
|
|
// Token: 0x0600001B RID: 27
|
|
TValue FindValueAt(TKey[] point);
|
|
|
|
// Token: 0x0600001C RID: 28
|
|
bool TryFindValue(TValue value, out TKey[] point);
|
|
|
|
// Token: 0x0600001D RID: 29
|
|
TKey[] FindValue(TValue value);
|
|
|
|
// Token: 0x0600001E RID: 30
|
|
KdTreeNode<TKey, TValue>[] RadialSearch(TKey[] center, TKey radius, int count);
|
|
|
|
// Token: 0x0600001F RID: 31
|
|
void RemoveAt(TKey[] point);
|
|
|
|
// Token: 0x06000020 RID: 32
|
|
void Clear();
|
|
|
|
// Token: 0x06000021 RID: 33
|
|
KdTreeNode<TKey, TValue>[] GetNearestNeighbours(TKey[] point, int count = 2147483647);
|
|
|
|
// Token: 0x17000009 RID: 9
|
|
// (get) Token: 0x06000022 RID: 34
|
|
int Count { get; }
|
|
}
|
|
}
|