Cross Reference: /inkscape/src/libavoid/makepath.cpp

Lines Matching refs:inf
49         VertInf* inf;
59             : inf(vinf),
68             : inf(NULL),
151         connRoute.ps[routeSize] = done[curr].inf->point;
165     VertInf *inf1 = (inf1Index >= 0) ?  done[inf1Index].inf : NULL;
440                 Node.h = estimatedCost(lineRef, NULL, Node.inf->point, 
446                 double edgeDist = dist(BestNode.inf->point, curr->point);
448                 Node.g = BestNode.g + cost(lineRef, edgeDist, BestNode.inf, 
449                         Node.inf, DONE, BestNode.prevIndex);
452                 Node.h = estimatedCost(lineRef, &(BestNode.inf->point),
453                         Node.inf->point, tar->point);
482         Node.h = estimatedCost(lineRef, NULL, Node.inf->point, tar->point);
515                 DONE[BestNode.prevIndex].inf : NULL;
518         db_printf(" %g %g  ", BestNode.inf->point.x, BestNode.inf->point.y);
519         BestNode.inf->id.db_print();
540                         (int) curr.inf->point.x + canx,
541                         (int) curr.inf->point.y + cany, 
545                     (int) BestNode.inf->point.x + canx,
546                     (int) BestNode.inf->point.y + cany, 
553                     (int) BestNode.inf->point.x + canx,
554                     (int) BestNode.inf->point.y + cany, 
557                     (int) BestNode.inf->point.x + canx,
558                     (int) BestNode.inf->point.y + cany, 
564                         (int) curr.inf->point.x + canx,
565                         (int) curr.inf->point.y + cany, 
568                         (int) curr.inf->point.x + canx,
569                         (int) curr.inf->point.y + cany, 
576         if (BestNode.inf == tar)
590                 curr.inf->pathNext = DONE[curr.prevIndex].inf;
596             curr.inf->pathNext = DONE[curr.prevIndex].inf;
603                 BestNode.inf->visList : BestNode.inf->orthogVisList;
615             Node = ANode((*edge)->otherVert(BestNode.inf), timestamp++);
622             if (!(Node.inf->id.isShape) && (Node.inf != tar))
628                     DONE[BestNode.prevIndex].inf : NULL;
631             if (prevInf && (prevInf == Node.inf))
645                   (validateBendPoint(prevInf, BestNode.inf, Node.inf) == false))
654             Node.g = BestNode.g + cost(lineRef, edgeDist, BestNode.inf, 
655                     Node.inf, DONE, BestNode.prevIndex);
658             Node.h = estimatedCost(lineRef, &(BestNode.inf->point),
659                     Node.inf->point, tar->point);
665             db_printf("-- Adding: %g %g  ", Node.inf->point.x, 
666                     Node.inf->point.y);
667             Node.inf->id.db_print();
677                 if ((Node.inf == ati.inf) &&
678                         (DONE[Node.prevIndex].inf == DONE[ati.prevIndex].inf))
697                     if ((Node.inf == ati.inf) && 
698                             (DONE[Node.prevIndex].inf == DONE[ati.prevIndex].inf))
725                     cout << PENDING.at(i).inf << "," << PENDING.at(i).pp << "  ";
732                     cout << DONE.at(i).inf << "," << DONE.at(i).pp << "  ";