Lines Matching defs:std
15 using std::vector;
21 std::vector<Geom::Point> p;
35 std::swap(minax, maxax);
46 std::swap(minay, maxay);
59 find_intersections_bezier_recursive(std::vector<std::pair<double, double> > & xs,
64 find_intersections_bezier_recursive( std::vector<std::pair<double, double> > &xs,
83 std::vector< std::vector< Geom::Point > > Vtemp;
88 std::copy(p.begin(), p.end(), Vtemp[0].begin());
116 std::copy(p.begin(), p.end(), Vtemp[0]);
220 std::vector<std::pair<double, double> > ¶meters)
223 //std::cout << deptha << std::endl;
299 parameters.push_back(std::pair<double, double>(t0 + s * ( t1 - t0 ),
316 return std::max(fabs(p[X]), fabs(p[Y]));
328 double l0 = std::max(la1, la2);
334 //std::cout << ra << std::endl;
417 //std::cout << "------\n" << best_v << std::endl;
427 //std::cout << c << "; ";
435 //std::cout << "\n" << s << " -> " << s - best[0] << std::endl;
436 //std::cout << t << " -> " << t - best[1] << std::endl;
437 //std::cout << best_v << std::endl;
449 void find_intersections_bezier_recursive( std::vector<std::pair<double, double> > &xs,
461 std::sort(xs.begin(), xs.end());