Searched refs:Insert (Results 1 - 6 of 6) sorted by relevance

/inkscape/src/livarot/
H A DAVL.h19 * override the Insert() function
47 int Insert(AVLTree * &racine, int insertType, AVLTree *insertL,
65 int Insert(AVLTree * &racine, int insertType, AVLTree *insertL, AVLTree *insertR);
H A Dsweep-tree.h57 int Insert(SweepTreeList &list, SweepEventQueue &queue, Shape *iDst,
H A Dsweep-tree.cpp274 SweepTree::Insert(SweepTreeList &list, SweepEventQueue &queue, function in class:SweepTree
303 AVLTree::Insert(tempR, insertion, static_cast<AVLTree *>(insertL),
463 AVLTree::Insert(tempR, insertion, static_cast<AVLTree *>(insertL),
H A DAVL.cpp804 AVLTree::Insert (AVLTree * &racine, int insertType, AVLTree * insertL, function in class:AVLTree
807 int res = Insert (racine, insertType, insertL, insertR);
814 AVLTree::Insert (AVLTree * &racine, int insertType, AVLTree * insertL, function in class:AVLTree
H A DShapeRaster.cpp190 // if there is one edge going down and one edge coming from above, we don't Insert() the new edge,
210 node->Insert(*sTree, *sEvts, this, nPt, true);
222 node->Insert(*sTree, *sEvts, this, nPt, true);
644 node->Insert(*sTree, *sEvts, this, nPt, true);
679 node->Insert(*sTree, *sEvts, this, nPt, false);
904 node->Insert(*sTree, *sEvts, this, nPt, true);
1080 node->Insert(*sTree, *sEvts, this, nPt, true);
1189 node->Insert(*sTree, *sEvts, this, nPt, true);
H A DShapeSweep.cpp498 node->Insert (*sTree, *sEvts, this, lastPointNo, true);
1308 node->Insert (*sTree, *sEvts, this, lastPointNo, true);
1351 // node->Insert(sTree,*sEvts,this,lastPointNo,true);

Completed in 107 milliseconds