Searched refs:solve (Results 1 - 16 of 16) sorted by relevance
| /inkscape/src/libvpsc/ |
| H A D | solve_VPSC.h | 56 virtual void solve();
94 void solve();
|
| H A D | remove_rectangle_overlap.cpp | 54 vpsc_x.solve();
72 vpsc_y.solve();
90 vpsc_x2.solve();
|
| H A D | solve_VPSC.cpp | 124 void Solver::solve() { function in class:vpsc::Solver
129 void IncSolver::solve() { function in class:vpsc::IncSolver
|
| /inkscape/src/2geom/ |
| H A D | polynomial.cpp | 79 std::vector<std::complex<double> > solve(Poly const & pp) { function in namespace:Geom
106 std::vector<std::complex<double> > roots = solve(p);
|
| H A D | polynomial.h | 205 /*** solve(Poly p)
209 std::vector<std::complex<double> > solve(const Poly & p);
214 * currently we just use solve and pick out the suitably real looking values, there may be a better algorithm.
221 /** @brief Analytically solve quadratic equation.
226 /** @brief Analytically solve cubic equation.
|
| H A D | bezier-clipping.cpp | 139 bool solve(Point & P, Point const& P1, Point const& P2, Point const& Q) function in namespace:Geom::detail::bezier_clipping
520 if (!solve(c, F[0], -F[n-1], B[n]-B[0]))
525 solve(c, F[0], -F[n-1], B[n]-B[0]);
|
| H A D | conicsec.cpp | 627 boost::optional<Point> solve(double A[2][2], double b[2]) { function in namespace:Geom
643 return solve(A, b);
|
| /inkscape/share/extensions/ |
| H A D | dxf_outlines.py | 47 from numpy.linalg import solve namespace
180 xctrl = solve(solmatrix, self.xfit)
181 yctrl = solve(solmatrix, self.yfit)
|
| H A D | perspective.py | 117 res = solve(solmatrix, free_term)
|
| H A D | gcodetools.py | 700 # Use the Lapitals rule to solve 0/0 problem for 2 times...
4070 m = numpy.linalg.solve(matrix,
|
| /inkscape/src/libavoid/ |
| H A D | vpsc.h | 226 bool solve();
|
| H A D | vpsc.cpp | 219 bool IncSolver::solve() { function in class:Avoid::IncSolver
|
| H A D | orthogonal.cpp | 2286 f.solve();
|
| /inkscape/src/libcola/ |
| H A D | gradient_projection.cpp | 37 * Use gradient-projection to solve an instance of
42 unsigned GradientProjection::solve(double * b) { function in class:GradientProjection
|
| H A D | gradient_projection.h | 256 unsigned solve(double* b);
|
| H A D | cola.cpp | 141 gp->solve(b);
|
Completed in 115 milliseconds