Class RangeTree<T>
A multi-dimentional range tree implementation.
Assembly: Advanced.Algorithms.dll
Syntax
public class RangeTree<T> : IEnumerable<T[]>, IEnumerable where T : IComparable
Type Parameters
Constructors
|
Improve this Doc
View Source
RangeTree(Int32)
Declaration
public RangeTree(int dimensions)
Parameters
Type |
Name |
Description |
Int32 |
dimensions |
|
Properties
|
Improve this Doc
View Source
Count
Declaration
public int Count { get; }
Property Value
Methods
|
Improve this Doc
View Source
Delete(T[])
Declaration
public void Delete(T[] value)
Parameters
Type |
Name |
Description |
T[] |
value |
|
|
Improve this Doc
View Source
GetEnumerator()
Declaration
public IEnumerator<T[]> GetEnumerator()
Returns
|
Improve this Doc
View Source
Insert(T[])
Declaration
public void Insert(T[] value)
Parameters
Type |
Name |
Description |
T[] |
value |
|
|
Improve this Doc
View Source
RangeSearch(T[], T[])
Get all points within given range.
Time complexity: O(n).
Declaration
public List<T[]> RangeSearch(T[] start, T[] end)
Parameters
Type |
Name |
Description |
T[] |
start |
|
T[] |
end |
|
Returns
Type |
Description |
List<T[]> |
|
Explicit Interface Implementations
|
Improve this Doc
View Source
IEnumerable.GetEnumerator()
Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Implements