internal NeighborEnumerator(RtreeRn tree, PointRn center)
#endif
{
this.center = center;
this.tree = tree;
Reset();
}
internal RtreeEnumerator(RtreeRn tree, RectangleRn r)
#endif
{
counter = tree.updateCounter;
height = tree.height;
this.tree = tree;
if (height == 0)
{
return;
}
this.r = r;
pageStack = new RtreeRnPage[height];
posStack = new int[height];
Reset();
}
internal NeighborEnumerator(RtreeRn <T> tree, PointRn center)
internal NeighborEnumerable(RtreeRn tree, PointRn center)
#endif
{
this.center = center;
this.tree = tree;
}
internal RtreeEntryEnumerator(RtreeRn tree, RectangleRn r)
#endif
: base(tree, r)
{
}
internal RtreeEntryEnumerator(RtreeRn <T> tree, RectangleRn r)
internal RtreeEnumerable(RtreeRn tree, RectangleRn r)
#endif
{
this.tree = tree;
this.r = r;
}
internal RtreeEnumerable(RtreeRn <T> tree, RectangleRn r)
