Class SIRtree<TItem>

Namespace

NetTopologySuite.Index.Strtree

Assembly

NetTopologySuite.dll

One-dimensional version of an STR-packed R-tree. SIR stands for "Sort-Interval-Recursive". STR-packed R-trees are described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.

public class SIRtree<TItem> : AbstractSTRtree<Interval, TItem>

Type Parameters

TItem

Inheritance

object

AbstractSTRtree<Interval, TItem>

SIRtree<TItem>

Inherited Members

AbstractSTRtree<Interval, TItem>.Build()

AbstractSTRtree<Interval, TItem>.CreateNode(int)

AbstractSTRtree<Interval, TItem>.CreateParentBoundables(IList<IBoundable<Interval, TItem>>, int)

AbstractSTRtree<Interval, TItem>.LastNode(IList<IBoundable<Interval, TItem>>)

AbstractSTRtree<Interval, TItem>.CompareDoubles(double, double)

AbstractSTRtree<Interval, TItem>.GetSize(AbstractNode<Interval, TItem>)

AbstractSTRtree<Interval, TItem>.GetDepth(AbstractNode<Interval, TItem>)

AbstractSTRtree<Interval, TItem>.Insert(Interval, TItem)

AbstractSTRtree<Interval, TItem>.Query(Interval)

AbstractSTRtree<Interval, TItem>.Query(Interval, IItemVisitor<TItem>)

AbstractSTRtree<Interval, TItem>.ItemsTree()

AbstractSTRtree<Interval, TItem>.Remove(Interval, TItem)

AbstractSTRtree<Interval, TItem>.BoundablesAtLevel(int)

AbstractSTRtree<Interval, TItem>.GetComparer()

AbstractSTRtree<Interval, TItem>.Root

AbstractSTRtree<Interval, TItem>.NodeCapacity

AbstractSTRtree<Interval, TItem>.IsEmpty

AbstractSTRtree<Interval, TItem>.Count

AbstractSTRtree<Interval, TItem>.Depth

AbstractSTRtree<Interval, TItem>.IntersectsOp

AbstractSTRtree<Interval, TItem>.ItemBoundables

object.GetType()

object.MemberwiseClone()

object.ToString()

object.Equals(object)

object.Equals(object, object)

object.ReferenceEquals(object, object)

object.GetHashCode()

Constructors

SIRtree()

Constructs an SIRtree with the default (10) node capacity.

public SIRtree()

SIRtree(int)

Constructs an SIRtree with the given maximum number of child nodes that a node may have.

public SIRtree(int nodeCapacity)

Parameters

nodeCapacity int

Properties

IntersectsOp

protected override AbstractSTRtree<Interval, TItem>.IIntersectsOp IntersectsOp { get; }

Property Value

AbstractSTRtree<Interval, TItem>.IIntersectsOp

Methods

CreateNode(int)

protected override AbstractNode<Interval, TItem> CreateNode(int level)

Parameters

level int

Returns

AbstractNode<Interval, TItem>

GetComparer()

protected override IComparer<IBoundable<Interval, TItem>> GetComparer()

Returns

IComparer<IBoundable<Interval, TItem>>

Insert(double, double, TItem)

Inserts an item having the given bounds into the tree.

public void Insert(double x1, double x2, TItem item)

Parameters

x1 double

x2 double

item TItem

Query(double)

Returns items whose bounds intersect the given value.

public IList<TItem> Query(double x)

Parameters

x double

Returns

IList<TItem>

Query(double, double)

Returns items whose bounds intersect the given bounds.

public IList<TItem> Query(double x1, double x2)

Parameters

x1 double

Possibly equal to x2.

x2 double

Possibly equal to x1.

Returns

IList<TItem>