You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
using System.Collections.Generic;
|
|
|
|
|
|
|
|
|
|
|
|
namespace UnityEngine.ProBuilder.KdTree
|
|
|
|
|
|
{
|
|
|
|
|
|
interface IKdTree<TKey, TValue> : IEnumerable<KdTreeNode<TKey, TValue>>
|
|
|
|
|
|
{
|
|
|
|
|
|
bool Add(TKey[] point, TValue value);
|
|
|
|
|
|
|
|
|
|
|
|
bool TryFindValueAt(TKey[] point, out TValue value);
|
|
|
|
|
|
|
|
|
|
|
|
TValue FindValueAt(TKey[] point);
|
|
|
|
|
|
|
|
|
|
|
|
bool TryFindValue(TValue value, out TKey[] point);
|
|
|
|
|
|
|
|
|
|
|
|
TKey[] FindValue(TValue value);
|
|
|
|
|
|
|
|
|
|
|
|
KdTreeNode<TKey, TValue>[] RadialSearch(TKey[] center, TKey radius, int count);
|
|
|
|
|
|
|
|
|
|
|
|
void RemoveAt(TKey[] point);
|
|
|
|
|
|
|
|
|
|
|
|
void Clear();
|
|
|
|
|
|
|
|
|
|
|
|
KdTreeNode<TKey, TValue>[] GetNearestNeighbours(TKey[] point, int count = int.MaxValue);
|
|
|
|
|
|
|
|
|
|
|
|
int Count { get; }
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|