| 289 | } |
| 290 | |
| 291 | void |
| 292 | SearcherThread::search(VisualNode* n, bool all, TreeCanvas* ti) { |
| 293 | node = n; |
| 294 | |
| 295 | depth = -1; |
| 296 | for (VisualNode* p = n; p != nullptr; p = p->getParent(*ti->na)) |
| 297 | depth++; |
| 298 | |
| 299 | a = all; |
| 300 | t = ti; |
| 301 | start(); |
| 302 | } |
| 303 | |
| 304 | void |
| 305 | SearcherThread::updateCanvas(void) { |