Class SIRtree<TItem>

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.

Inheritance
Object
AbstractSTRtree<Interval, TItem>
SIRtree<TItem>
Inherited Members
Namespace: NetTopologySuite.Index.Strtree
Assembly: NetTopologySuite.dll
Syntax
public class SIRtree<TItem> : AbstractSTRtree<Interval, TItem>
Type Parameters
Name Description
TItem

Constructors

| Improve this Doc View Source

SIRtree()

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

Declaration
public SIRtree()
| Improve this Doc View Source

SIRtree(Int32)

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

Declaration
public SIRtree(int nodeCapacity)
Parameters
Type Name Description
Int32 nodeCapacity

Properties

| Improve this Doc View Source

IntersectsOp

Declaration
protected override AbstractSTRtree<Interval, TItem>.IIntersectsOp IntersectsOp { get; }
Property Value
Type Description
AbstractSTRtree.IIntersectsOp<>
Overrides
NetTopologySuite.Index.Strtree.AbstractSTRtree<NetTopologySuite.Index.Strtree.Interval, TItem>.IntersectsOp

Methods

| Improve this Doc View Source

CreateNode(Int32)

Declaration
protected override AbstractNode<Interval, TItem> CreateNode(int level)
Parameters
Type Name Description
Int32 level
Returns
Type Description
AbstractNode<Interval, TItem>
Overrides
NetTopologySuite.Index.Strtree.AbstractSTRtree<NetTopologySuite.Index.Strtree.Interval, TItem>.CreateNode(System.Int32)
| Improve this Doc View Source

GetComparer()

Declaration
protected override IComparer<IBoundable<Interval, TItem>> GetComparer()
Returns
Type Description
IComparer<IBoundable<Interval, TItem>>
Overrides
NetTopologySuite.Index.Strtree.AbstractSTRtree<NetTopologySuite.Index.Strtree.Interval, TItem>.GetComparer()
| Improve this Doc View Source

Insert(Double, Double, TItem)

Inserts an item having the given bounds into the tree.

Declaration
public void Insert(double x1, double x2, TItem item)
Parameters
Type Name Description
Double x1
Double x2
TItem item
| Improve this Doc View Source

Query(Double)

Returns items whose bounds intersect the given value.

Declaration
public IList<TItem> Query(double x)
Parameters
Type Name Description
Double x
Returns
Type Description
IList<TItem>
| Improve this Doc View Source

Query(Double, Double)

Returns items whose bounds intersect the given bounds.

Declaration
public IList<TItem> Query(double x1, double x2)
Parameters
Type Name Description
Double x1

Possibly equal to x2.
Double x2

Possibly equal to x1.
Returns
Type Description
IList<TItem>