Bugs in range method in RTree

[ChenZhongPu]

There are bugs in the range method for limited level searching.

You use queue, but never dequeue from it (just front). And when cur_level == level_limit, we should also enqueue the internal node.

A fixing:

• replace all front with dequeue
• when cur_level == level_limit,

else if (cur_level == level_limit) {
          estimate += cur_node.m_mbr.calcRatio(query) * cur_node.size
          cur_node.m_child.foreach {
            case RTreeInternalEntry(mbr, node) =>
              if (query.intersects(mbr)) q.enqueue((node, cur_level + 1))
          }

[dongx-psu]

Agreed. I haven't test by the time I merge it. You have fixed that? I can fix it if you didn't,

[ChenZhongPu]

I have fixed.

[dongx-psu]

Fixed in PR #23.