public bool inBounds(SQTPoint <Numerical> pt)
{
return((dynamic)pt.X >= corners[0] &&
(dynamic)pt.X <= corners[1] &&
(dynamic)pt.Y >= corners[2] &&
(dynamic)pt.Y <= corners[3]);
}
/// <summary>
/// Removes a node from the SQTree
/// </summary>
/// <param name="pt">The point to remove</param>
/// <returns>The node beloning to the point, or null if not found</returns>
public SQTPoint <N> Remove(SQTPoint <N> pt)
{
throw new NotImplementedException();
}
/// <summary>
/// Determines if a point exists in the SQTree
/// </summary>
/// <param name="pt">The point to find</param>
/// <param name="data">The expected data of the point</param>
/// <returns>True if found, otherwise false</returns>
public bool find(SQTPoint <N> pt, D data)
{
throw new NotImplementedException();
}
/// <summary>
/// Adds, or changes a point in the SQTree
/// </summary>
/// <param name="pt">A point to add</param>
/// <param name="data">The data to set</param>
public SQTPoint <N> Update(SQTPoint <N> pt, D data)
{
throw new NotImplementedException();
}
