internal NeighborEnumerable(Rtree tree, int x, int y)
#endif
{
this.x = x;
this.y = y;
this.tree = tree;
}
internal NeighborEnumerator(Rtree tree, int x, int y)
#endif
{
this.x = x;
this.y = y;
this.tree = tree;
Reset();
}
internal RtreeEnumerator(Rtree tree, Rectangle r)
#endif
{
counter = tree.updateCounter;
height = tree.height;
this.tree = tree;
if (height == 0)
{
return;
}
this.r = r;
pageStack = new RtreePage[height];
posStack = new int[height];
Reset();
}
internal NeighborEnumerator(Rtree <T> tree, int x, int y)
internal NeighborEnumerable(Rtree <T> tree, int x, int y)
internal RtreeEntryEnumerator(Rtree tree, Rectangle r)
#endif
: base(tree, r)
{
}
internal RtreeEntryEnumerator(Rtree <T> tree, Rectangle r)
internal RtreeEnumerable(Rtree tree, Rectangle r)
#endif
{
this.tree = tree;
this.r = r;
}
internal RtreeEnumerable(Rtree <T> tree, Rectangle r)