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