Searched defs:cost (Results 1 - 6 of 6) sorted by relevance
/inkscape/src/libvpsc/ |
H A D | blocks.cpp | 172 double Blocks::cost() { function in class:vpsc::Blocks 175 c += (*i)->cost();
|
H A D | block.cpp | 377 double Block::cost() { function in class:vpsc::Block
|
H A D | solve_VPSC.cpp | 134 double lastcost,cost = bs->cost(); local 136 lastcost=cost; 139 cost = bs->cost(); 141 f<<" cost="<<cost<<endl; 143 } while(fabs(lastcost-cost)>0.0001);
|
/inkscape/src/libavoid/ |
H A D | makepath.cpp | 93 // Tiebreaker, if two paths have equal cost, then choose the one with 160 // cost associated with this route. 162 static double cost(ConnRef *lineRef, const double dist, VertInf *inf2, function in namespace:Avoid 387 // Returns the best path from src to tar using the cost function. 448 Node.g = BestNode.g + cost(lineRef, edgeDist, BestNode.inf, 484 // Set a null parent, so cost function knows this is the first segment. 654 Node.g = BestNode.g + cost(lineRef, edgeDist, BestNode.inf,
|
H A D | vpsc.cpp | 225 double lastcost = DBL_MAX, cost = bs->cost(); local 226 while(fabs(lastcost-cost)>0.0001) { 228 lastcost=cost; 229 cost = bs->cost(); 231 f<<" bs->size="<<bs->size()<<", cost="<<cost<<endl; 313 f<<"...remaining blocks="<<bs->size()<<", cost="<<bs->cost()<<end 604 double Blocks::cost() { function in class:Avoid::Blocks 1194 double Block::cost() { function in class:Avoid::Block [all...] |
/inkscape/src/2geom/ |
H A D | ellipse.cpp | 356 Coord sinrot, cosrot, cost, sint; local 358 sincos(t, sint, cost); 361 return ray(X) * cosrot * cost 365 return ray(X) * sinrot * cost
|
Completed in 26 milliseconds