| /inkscape/src/libvpsc/ |
| H A D | blocks.h | 36 Blocks(const int n, Variable* const vs[]);
77 Variable* const *vs; member in class:vpsc::Blocks
|
| H A D | remove_rectangle_overlap.cpp | 38 Variable **vs=new Variable*[n]; local
40 vs[i]=new Variable(i,0,1);
44 unsigned m=generateXConstraints(n,rs,vs,cs,true);
46 oldX[i]=vs[i]->desiredPosition;
48 Solver vpsc_x(n,vs,m,cs);
56 rs[i]->moveCentreX(vs[i]->position());
65 m=generateYConstraints(n,rs,vs,cs);
66 Solver vpsc_y(n,vs,m,cs);
74 rs[i]->moveCentreY(vs[i]->position());
83 m=generateXConstraints(n,rs,vs,c
[all...] |
| H A D | solve_VPSC.h | 58 Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
61 const Variable* const * getVariables(unsigned &n) { n=this->n; return vs; }
67 const Variable* const *vs; member in class:vpsc::Solver
71 bool constraintGraphIsCyclic(const unsigned n, Variable* const vs[]);
100 IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
|
| H A D | blocks.cpp | 31 Blocks::Blocks(const int n, Variable* const vs[]) : vs(vs),nvs(n) { argument
34 insert(new Block(vs[i]));
49 vs[i]->visited=false;
52 if(vs[i]->in.size()==0) {
53 dfsVisit(vs[i],order);
|
| H A D | solve_VPSC.cpp | 31 IncSolver::IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]) argument
32 : Solver(n,vs,m,cs) {
38 Solver::Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]) : m(m), cs(cs), n(n), vs(vs) { argument
39 bs=new Blocks(n, vs);
42 //assert(!constraintGraphIsCyclic(n,vs));
64 list<Variable*> *vs=bs->totalOrder(); local
65 for(list<Variable*>::iterator i=vs->begin();i!=vs
285 constraintGraphIsCyclic(const unsigned n, Variable* const vs[]) argument
[all...] |
| /inkscape/src/libcola/ |
| H A D | gradient_projection.cpp | 179 Variable** vs = new Variable*[vars.size()]; local
181 vs[i]=vars[i];
188 m=generateXConstraints(n,rs,vs,tmp_cs,true);
191 m=generateYConstraints(n,rs,vs,tmp_cs);
205 return new IncSolver(vars.size(),vs,m,cs);
221 const Variable* const* vs = vpsc->getVariables(n); local
224 delete [] vs;
|
| H A D | gradient_projection.h | 49 void createVarsAndConstraints(Variables &vs, Constraints &cs) { argument
52 vs.push_back(vl=new vpsc::Variable(vs.size(), leftMargin, weight));
53 vs.push_back(vr=new vpsc::Variable(vs.size(), rightMargin, weight));
58 cs.push_back(new vpsc::Constraint(vl, vs[o->first], o->second));
59 cs.push_back(new vpsc::Constraint(vs[o->first], vr, o->second));
|
| /inkscape/src/livarot/ |
| H A D | float-line.h | 119 inline float ValAt(float at, float ps, float pe, float vs, float ve) { argument
120 return ((at - ps) * ve + (pe - at) * vs) / (pe - ps);
|
| H A D | int-line.h | 90 inline float ValAt(int at, int ps, int pe, float vs, float ve) { argument
91 return ((at - ps) * ve + (pe - at) * vs) / (pe - ps);
|
| /inkscape/src/2geom/ |
| H A D | curve.h | 195 virtual void operator*=(VShear const &vs) { *this *= Affine(vs); } argument
|
| H A D | line.cpp | 142 Point vs = vector(); local
143 if (vs[d] != 0) {
144 return (v - _initial[d]) / vs[d];
|
| H A D | sbasis.cpp | 629 int vs = valuation(sg,zero); local
630 if (vs == 0) { // to prevent infinite loop
634 for (unsigned k=0; k<order; k+=vs){
|
| /inkscape/src/libavoid/ |
| H A D | vpsc.h | 195 Blocks(Variables const &vs);
206 Variables const &vs; member in class:Avoid::Blocks
229 IncSolver(Variables const &vs, Constraints const &cs);
232 Variables const & getVariables() { return vs; }
238 Variables const &vs; member in class:Avoid::IncSolver
242 bool constraintGraphIsCyclic(const unsigned n, Variable* const vs[]);
|
| H A D | vpsc.cpp | 55 IncSolver::IncSolver(vector<Variable*> const &vs, vector<Constraint *> const &cs) argument
58 n(vs.size()),
59 vs(vs)
62 vs[i]->in.clear();
63 vs[i]->out.clear();
70 bs=new Blocks(vs);
73 //COLA_ASSERT(!constraintGraphIsCyclic(n,vs));
104 for(Variables::const_iterator i=vs.begin();i!=vs
116 constraintGraphIsCyclic(const unsigned n, Variable* const vs[]) argument
445 Blocks(vector<Variable*> const &vs) argument
[all...] |
| H A D | orthogonal.cpp | 2179 Variables vs; local
2224 vs.push_back(currSegment->variable);
2225 size_t index = vs.size() - 1;
2246 cs.push_back(new Constraint(prevVar, vs[index],
2262 vs.push_back(new Variable(fixedID,
2264 cs.push_back(new Constraint(vs[vs.size() - 1], vs[index],
2272 vs.push_back(new Variable(fixedID,
2274 cs.push_back(new Constraint(vs[inde
[all...] |
| /inkscape/src/widgets/ |
| H A D | gradient-selector.cpp | 283 SPGradientVectorSelector* vs = SP_GRADIENT_VECTOR_SELECTOR(vectors); local
284 vs->setSwatched();
|
| /inkscape/src/ui/tool/ |
| H A D | transform-handle-set.cpp | 340 Geom::Point vs; local
348 vs[d1] = (new_pos - scc)[d1] / (_origin - scc)[d1];
350 if (fabs(vs[d1]) >= 1.0) {
351 vs[d1] = round(vs[d1]);
353 vs[d1] = 1.0 / round(1.0 / MIN(vs[d1],10));
355 vs[d2] = 1.0;
361 Inkscape::PureStretchConstrained psc = Inkscape::PureStretchConstrained(vs[d1], scc, d1, uniform);
367 vs[d
[all...] |