| 284 | |
| 285 | |
| 286 | void Tree::getPoints( |
| 287 | PointIdList& results, |
| 288 | const std::size_t depthBegin, |
| 289 | const std::size_t depthEnd, |
| 290 | std::size_t curDepth) const |
| 291 | { |
| 292 | if (data && curDepth >= depthBegin) |
| 293 | { |
| 294 | results.push_back(data->pbIndex); |
| 295 | } |
| 296 | |
| 297 | if (++curDepth < depthEnd || depthEnd == 0) |
| 298 | { |
| 299 | if (nw) nw->getPoints(results, depthBegin, depthEnd, curDepth); |
| 300 | if (ne) ne->getPoints(results, depthBegin, depthEnd, curDepth); |
| 301 | if (se) se->getPoints(results, depthBegin, depthEnd, curDepth); |
| 302 | if (sw) sw->getPoints(results, depthBegin, depthEnd, curDepth); |
| 303 | } |
| 304 | } |
| 305 | |
| 306 | void Tree::getPoints( |
| 307 | PointIdList& results, |