drug007 / rtree

A dynamic index structure for spatial searching

R-TREES: A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING

A dlang version of the RTree algorithm. This is port of C++ version by Yariv Barkan. For more information please read the comments in rtree.d

LICENSE

Public domain

rtree's Issues

search() / remove() using DataType pointer?

I'm storing rects which are related to the stored DataType pointer. The rects of DataType can change, hence I want to update the index.

To remove the rect associated with DataType, I need to know the old rect and than insert a new rect. This requires housekeeping code for old-rect, new-rect.

How about adding a way where I can use DataType pointer to remove/update the index? If a constraint, that DataType pointer is only allowed once makes things simpler I think that would help.

rtree.d(82,19): Error: cannot implicitly convert expression a_dataId of type const(T) to T

I get this error when using RTree!(myClass, float, 2, double) and trying to insert a node with:

// myObj is of type MyClass
foreach(myObj; ...){
  rtree.insert(min, max, myObj);
}

The problem seems to be that the const from the parameter is not reflected in the template instantiation. But when I try to use: RTree!(const myClass, float, 2, double) I get a bunch of other problems origin from here:

...
rtree.d(125,2):        instantiated from here: Array!(const(myClass))

Isn't the const for insert wrong?

Error triggered by rtree.d(876,13): instantiated from here: opOpAssign!("~", XYZ)

I want to use class pointers in rtree and have a opCall() defined for my class. When this opCall is present I get the following error. This looks like rtree is requiring the ~ operator to exists.

Can't this be made more generic, so that there are no requirements on my side when using rtree?

C:\D\dmd2\windows\bin\..\..\src\phobos\std\conv.d(4434,26): Error: need this for opCall of type @system gob(gob child, int position = 0)
C:\D\dmd2\windows\bin\..\..\src\phobos\std\conv.d(4550,17): Error: template instance std.conv.emplaceRef!(gob, gob, gob) error instantiating
C:\D\dmd2\windows\bin\..\..\src\phobos\std\container\array.d(433,20):        instantiated from here: emplace!(gob, gob)
C:\D\dmd2\windows\bin\..\..\src\phobos\std\container\array.d(877,32):        instantiated from here: insertBack!(gob)
C:\D\dmd2\windows\bin\..\..\src\phobos\std\container\array.d(806,23):        instantiated from here: insertBack!(gob)
C:\Users\robby\AppData\Local\dub\packages\rtree-0.0.1\rtree\source\rtree.d(876,13):        instantiated from here: opOpAssign!("~", gob)
..\..\gui.d(27,17):        instantiated from here: RTree!(gob, float, 2, double, 8, 4)
C:\D\dmd2\windows\bin\..\..\src\phobos\std\container\array.d(546,21): Error: template instance std.container.array.Array!(gob).Array.__ctor!(gob) error instantiating
C:\Users\robby\AppData\Local\dub\packages\rtree-0.0.1\rtree\source\rtree.d(126,2):        instantiated from here: Array!(gob)
..\..\gui.d(27,17):        instantiated from here: RTree!(gob, float, 2, double, 8, 4)

removeAll() / why iterate of all nodes?

Wouldn't it be more efficient to just get rid of all internal state without iterating over all nodes?

Just wondering...