Lines Matching defs:list
2 #include "livarot/sweep-tree-list.h"
251 SweepTree::Remove(SweepTreeList &list, SweepEventQueue &queue,
255 AVLTree *tempR = static_cast<AVLTree *>(list.racine);
257 list.racine = static_cast<SweepTree *>(tempR);
259 if (list.nbTree <= 1)
261 list.nbTree = 0;
262 list.racine = NULL;
266 if (list.racine == list.trees + (list.nbTree - 1))
267 list.racine = this;
268 list.trees[--list.nbTree].Relocate(this);
274 SweepTree::Insert(SweepTreeList &list, SweepEventQueue &queue,
277 if (list.racine == NULL)
279 list.racine = this;
285 list.racine->Find(iDst->getPoint(iAtPoint).x, this,
301 AVLTree *tempR = static_cast<AVLTree *>(list.racine);
305 list.racine = static_cast<SweepTree *>(tempR);
311 // and then insert all the other in a doubly-linked list fashion. this avoids the Find() call, but is O(d^2) worst-case
315 SweepTree::InsertAt(SweepTreeList &list, SweepEventQueue &queue,
319 if (list.racine == NULL)
321 list.racine = this;
461 AVLTree *tempR = static_cast<AVLTree *>(list.racine);
465 list.racine = static_cast<SweepTree *>(tempR);
493 SweepTree::SwapWithRight(SweepTreeList &/*list*/, SweepEventQueue &/*queue*/)