Searched refs:cs (Results 1 - 25 of 38) sorted by relevance

12

/inkscape/src/libvpsc/
H A Dremove_rectangle_overlap.cpp42 Constraint **cs; local
44 unsigned m=generateXConstraints(n,rs,vs,cs,true);
48 Solver vpsc_x(n,vs,m,cs);
59 delete cs[i];
61 delete [] cs;
65 m=generateYConstraints(n,rs,vs,cs);
66 Solver vpsc_y(n,vs,m,cs);
79 delete cs[i];
81 delete [] cs;
83 m=generateXConstraints(n,rs,vs,cs,fals
[all...]
H A Dsolve_VPSC.h58 Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
60 Constraint** getConstraints(unsigned &m) { m=this->m; return cs; }
65 Constraint **cs; member in class:vpsc::Solver
100 IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
H A Dsolve_VPSC.cpp31 IncSolver::IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]) argument
32 : Solver(n,vs,m,cs) {
33 inactive.assign(cs,cs+m);
38 Solver::Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]) : m(m), cs(cs), n(n), vs(vs) { argument
58 f<<" "<<*cs[i]<<endl;
73 if(cs[i]->slack() < ZERO_UPPERBOUND) {
76 f<<"Error: Unsatisfied constraint: "<<*cs[
[all...]
H A Dgenerate-constraints.h79 int generateXConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs, const bool useNeighbourLists);
80 int generateYConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs);
H A Dgenerate-constraints.cpp173 int generateXConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs, const bool useNeighbourLists) { argument
249 cs=new Constraint*[m=constraints.size()];
250 for(i=0;i<m;i++) cs[i]=constraints[i];
257 int generateYConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs) { argument
305 cs=new Constraint*[m=constraints.size()];
306 for(i=0;i<m;i++) cs[i]=constraints[i];
/inkscape/src/2geom/
H A Dconic_section_clipper_impl.cpp57 cs.roots (rts, R.right(), X);
86 cs.roots (rts, R.top(), Y);
115 cs.roots (rts, R.left(), X);
144 cs.roots (rts, R.bottom(), Y);
186 cp_angles.insert (std::make_pair (cs.angle_at (cpts[i]), i));
230 double grad0 = 2 * cs.coeff(0) * dir[0] + cs.coeff(1) * dir[1];
231 double grad1 = cs.coeff(1) * dir[0] + 2 * cs.coeff(2) * dir[1];
232 double grad2 = cs
[all...]
H A Dconic_section_clipper_impl.h96 : cr(_cr), cs(_cs), R(_R)
105 : cs(_cs), R(_R)
152 const xAx & cs; member in class:Geom::CLIPPER_CLASS
173 std::vector<double> rts = cs.roots (bl);
206 Line l1 = cs.tangent (P);
207 Line l2 = cs.tangent (Q);
225 std::vector<double> rts = cs.roots (l);
H A Dsvg-path-writer.cpp194 std::string cs = _formatCoord(_current_pars[i]); local
205 char firstchar = cs[0];
215 _s << cs; local
218 lastchar = cs[cs.length()-1];
219 contained_dot = cs.find('.') != std::string::npos;
221 _s << " " << cs; local
H A Dsvg-path-parser.cpp1106 cs = svg_path_start;
1256 if ( cs == 0 )
1259 _keys = _svg_path_trans_keys + _svg_path_key_offsets[cs];
1260 _trans = _svg_path_index_offsets[cs];
1262 _klen = _svg_path_single_lengths[cs];
1285 _klen = _svg_path_range_lengths[cs];
1309 cs = _svg_path_trans_targs[_trans];
1445 if ( cs == 0 )
1452 const char *__acts = _svg_path_actions + _svg_path_eof_actions[cs];
1558 if (cs < svg_path_first_fina
[all...]
H A Dsvg-path-parser.h123 int cs; member in class:Geom::SVGPathParser
H A Dconicsec.cpp1198 xAx cs; local
1199 cs.coeff(0) = coeff(0);
1200 cs.coeff(1) = coeff(1);
1201 cs.coeff(2) = coeff(2);
1207 cs.coeff(3) = (DE[0] + D) * 2;
1208 cs.coeff(4) = (DE[1] + E) * 2;
1210 cs.coeff(5) = dot (T, DE) + 2 * (T[0] * D + T[1] * E) + coeff(5);
1212 return cs;
1227 double cs = c * s; local
1233 double Bcs = coeff(1) * cs;
1475 clip(std::vector<RatQuad> & rq, const xAx & cs, const Rect & R) argument
[all...]
/inkscape/src/libcola/
H A Dgradient_projection.cpp4 * subject to a set of separation constraints cs
31 Constraint** cs = solver->getConstraints(m); local
33 cerr << *cs[i] << endl;
172 Constraint **cs; local
197 cs = new Constraint*[lcs.size() + gcs.size()];
200 cs[m++] = *ci;
203 cs[m++] = *ci;
205 return new IncSolver(vars.size(),vs,m,cs);
220 Constraint** cs = vpsc->getConstraints(m); local
223 delete [] cs;
[all...]
H A Dgradient_projection.h49 void createVarsAndConstraints(Variables &vs, Constraints &cs) { argument
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));
117 void setupVPSC(Variables &vars, Constraints &cs) { argument
126 cs.push_back(new vpsc::Constraint(left,v,(*cit).second));
131 cs.push_back(new vpsc::Constraint(v,right,(*cit).second));
H A Dstraightener.cpp199 void generateConstraints(vector<Node*>& nodes, vector<Edge*>& edges,vector<SimpleConstraint*>& cs,Dim dim) { argument
274 cs.push_back(createConstraint(lastNode,*i,dim));
297 cs.push_back(createConstraint(*j,*i,dim));
322 cs.push_back(createConstraint(*i,*j,dim));
335 if(l!=NULL) cs.push_back(createConstraint(l,v,dim));
336 if(r!=NULL) cs.push_back(createConstraint(v,r,dim));
H A Dcola.cpp226 SimpleConstraints cs; local
227 straightener::generateConstraints(snodes,sedges,cs,dim);
312 (AlignmentConstraints*)NULL,false,(vpsc::Rectangle**)NULL,(PageBoundaryConstraints*)NULL,&cs);
320 for(unsigned i=0;i<cs.size();i++) {
321 delete cs[i];
341 Clusters* cs,
345 if(cs) {
346 clusters=cs;
336 setupConstraints( AlignmentConstraints* acsx, AlignmentConstraints* acsy, bool avoidOverlaps, PageBoundaryConstraints* pbcx, PageBoundaryConstraints* pbcy, SimpleConstraints* scx, SimpleConstraints* scy, Clusters* cs, std::vector<straightener::Edge*>* straightenEdges) argument
/inkscape/src/
H A Dsnapped-curve.cpp68 Geom::Crossings cs = crossings(*(this->_curve), *(curve._curve)); local
70 if (cs.size() > 0) {
74 for (Geom::Crossings::const_iterator i = cs.begin(); i != cs.end(); ++i) {
129 Geom::Crossings cs = crossings(*(this->_curve), *line_as_curve); local
131 if (cs.size() > 0) {
135 for (Geom::Crossings::const_iterator i = cs.begin(); i != cs.end(); ++i) {
H A Dgraphlayout.cpp209 vector<Component*> cs; local
210 connectedComponents(rs,es,scx,scy,cs);
211 for(unsigned i=0;i<cs.size();i++) {
212 Component* c=cs[i];
220 separateComponents(cs);
/inkscape/src/ui/widget/
H A Dcolor-scales.h54 static void _adjustmentAnyChanged(GtkAdjustment *adjustment, ColorScales *cs);
58 static void _adjustmentChanged(ColorScales *cs, guint channel);
H A Dcolor-wheel-selector.h58 static void _wheelChanged(GimpColorWheel *wheel, ColorWheelSelector *cs);
H A Dcolor-icc-selector.cpp267 static void _adjustmentChanged(GtkAdjustment *adjustment, ColorICCSelectorImpl *cs);
942 void ColorICCSelectorImpl::_adjustmentChanged(GtkAdjustment *adjustment, ColorICCSelectorImpl *cs) argument
951 g_message("/^^^^^^^^^ %p::_adjustmentChanged()", cs);
954 ColorICCSelector *iccSelector = cs->_owner;
1029 g_message("\\_________ %p::_adjustmentChanged()", cs);
1035 // ColorICCSelector* iccSelector = dynamic_cast<ColorICCSelector*>(SP_COLOR_SELECTOR(cs)->base);
1046 // ColorICCSelector* iccSelector = dynamic_cast<ColorICCSelector*>(SP_COLOR_SELECTOR(cs)->base);
1056 void ColorICCSelectorImpl::_sliderChanged(SPColorSlider *slider, SPColorICCSelector *cs) argument
1062 g_message("Changed %p and %p", slider, cs);
1064 // ColorICCSelector* iccSelector = dynamic_cast<ColorICCSelector*>(SP_COLOR_SELECTOR(cs)
[all...]
/inkscape/src/live_effects/
H A Dlpe-knot.h45 CrossingPoints(Geom::CrossingSet const &cs, Geom::PathVector const &path);//for self crossings only!
H A Dlpe-mirror_symmetry.cpp233 Geom::Crossings cs = crossings(original, divider); local
235 for(unsigned int i = 0; i < cs.size(); i++) {
236 crossed.push_back(cs[i].ta);
268 if (cs.size()!=0 && position == 1) {
280 if (cs.size() > 1 && tmp_path.size() > 0 && tmp_path[0].size() > 0 ) {
293 if (cs.size() == 0 && position == 1) {
/inkscape/src/extension/internal/
H A Dodf.cpp641 double cs = s[j]/t; local
646 e[j-1] = cs*e[j-1];
650 t = cs*V(i, j) + sn*V(i, p-1);
651 V(i, p-1) = -sn*V(i, j) + cs*V(i, p-1);
666 double cs = s[j]/t; local
670 e[j] = cs*e[j];
673 t = cs*U(i, j) + sn*U(i, k-1);
674 U(i, k-1) = -sn*U(i, j) + cs*U(i, k-1);
719 double cs = f/t; local
724 f = cs*
[all...]
/inkscape/src/libavoid/
H A Dvpsc.cpp55 IncSolver::IncSolver(vector<Variable*> const &vs, vector<Constraint *> const &cs) argument
56 : m(cs.size()),
57 cs(cs),
66 Constraint *c=cs[i];
76 inactive=cs;
94 f<<" "<<*cs[i]<<endl;
322 v=cs[i];
692 vector<Constraint*> *cs=in?&(v->in):&(v->out); local
693 for (Cit j=cs
[all...]
H A Dvpsc.h229 IncSolver(Variables const &vs, Constraints const &cs);
236 Constraints const &cs; member in class:Avoid::IncSolver

Completed in 391 milliseconds

12