Hello all, in some Python scripts I want to query an rtree index like this:
for member in ix.nearest(point, <infinite>): if check(member): break Setting num_results to high numbers gets expensive with a large index. Do you have general advice how to deal with this? Could nearest() (and maybe intersection() too) be modified, so that the work is delayed into the generator to allow "open end" queries? Thank You, Redoute _______________________________________________ Community mailing list [email protected] http://lists.gispython.org/mailman/listinfo/community
