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

12

/inkscape/src/libvpsc/
H A Dremove_rectangle_overlap.h31 void removeRectangleOverlap(unsigned n, vpsc::Rectangle *rs[], double xBorder, double yBorder);
H A Dremove_rectangle_overlap.cpp33 void removeRectangleOverlap(unsigned n, Rectangle *rs[], double xBorder, double yBorder) { argument
44 unsigned m=generateXConstraints(n,rs,vs,cs,true);
56 rs[i]->moveCentreX(vs[i]->position());
65 m=generateYConstraints(n,rs,vs,cs);
74 rs[i]->moveCentreY(vs[i]->position());
75 rs[i]->moveCentreX(oldX[i]);
83 m=generateXConstraints(n,rs,vs,cs,false);
96 rs[i]->moveCentreX(vs[i]->position());
103 std::cerr << *rs[i]<<std::endl;
H A Dgenerate-constraints.cpp173 int generateXConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs, const bool useNeighbourLists) { argument
177 vars[i]->desiredPosition=rs[i]->getCentreX();
178 Node *v = new Node(vars[i],rs[i],rs[i]->getCentreX());
179 events[ctr++]=new Event(Open,v,rs[i]->getMinY());
180 events[ctr++]=new Event(Close,v,rs[i]->getMaxY());
257 int generateYConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs) { argument
261 vars[i]->desiredPosition=rs[i]->getCentreY();
262 Node *v = new Node(vars[i],rs[i],rs[
[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);
/inkscape/src/
H A Dgraphlayout.cpp58 selected,vector<Rectangle*>& rs,map<string,unsigned>& nodelookup) :
59 TestConvergence(d,i), selected(selected), rs(rs), nodelookup(nodelookup) {}
64 cout << "x[0]="<<rs[0]->getMinX()<<endl;
71 Rectangle* r=rs[nodelookup[u->id]];
82 vector<Rectangle*>& rs; member in struct:CheckProgress
123 vector<Rectangle*> rs; local
134 nodelookup[u->getId()]=rs.size();
135 rs.push_back(new Rectangle(ll[0]-spacing,ur[0]+spacing,
210 connectedComponents(rs,e
57 CheckProgress(double d,unsigned i,list<SPItem *>& selected,vector<Rectangle*>& rs,map<string,unsigned>& nodelookup) argument
[all...]
H A Dremoveoverlap.cpp43 std::vector<Rectangle *> rs; local
69 rs.push_back(vspc_rect);
72 if (!rs.empty()) {
73 removeRectangleOverlap(rs.size(), &rs[0], 0.0, 0.0);
H A Dsp-missing-glyph.cpp104 #define COPY_ATTR(rd,rs,key) (rd)->setAttribute((key), rs->attribute(key));
H A Dsp-anchor.cpp78 #define COPY_ATTR(rd,rs,key) (rd)->setAttribute((key), rs->attribute(key));
H A Dsp-glyph-kerning.cpp160 #define COPY_ATTR(rd,rs,key) (rd)->setAttribute((key), rs->attribute(key));
H A Dprint.h44 unsigned char *px, unsigned int w, unsigned int h, unsigned int rs,
H A Dprint.cpp65 guchar *px, unsigned int w, unsigned int h, unsigned int rs,
68 return ctx->module->image(px, w, h, rs, transform, style);
64 sp_print_image_R8G8B8A8_N(SPPrintContext *ctx, guchar *px, unsigned int w, unsigned int h, unsigned int rs, Geom::Affine const &transform, SPStyle const *style) argument
H A Dsp-font.cpp169 #define COPY_ATTR(rd,rs,key) (rd)->setAttribute((key), rs->attribute(key));
H A Dsp-glyph.cpp241 #define COPY_ATTR(rd,rs,key) (rd)->setAttribute((key), rs->attribute(key));
/inkscape/src/2geom/
H A Dsweep-bounds.cpp28 * \param rs: vector of Rect.
31 * [(A = rs[i], B = rs[j]) for i,J in enumerate(pairs) for j in J]
35 std::vector<std::vector<unsigned> > sweep_bounds(std::vector<Rect> rs, Dim2 d) { argument
36 std::vector<Event> events; events.reserve(rs.size()*2);
37 std::vector<std::vector<unsigned> > pairs(rs.size());
39 for(unsigned i = 0; i < rs.size(); i++) {
40 events.push_back(Event(rs[i][d].min(), i, false));
41 events.push_back(Event(rs[i][d].max(), i, true));
55 if(rs[j
[all...]
H A Dcrossing.cpp118 std::vector<Rect> rs; local
122 rs.push_back(*bb);
125 return rs;
H A Dcrossing.h132 std::vector<Rect> rs; local
136 rs.push_back(*bb);
139 return rs;
/inkscape/src/extension/
H A Dprint.cpp93 Print::image (unsigned char *px, unsigned int w, unsigned int h, unsigned int rs, argument
96 return imp->image (this, px, w, h, rs, transform, style);
H A Dprint.h66 unsigned int rs,
/inkscape/src/trace/
H A Dquantize.cpp35 unsigned long rs, gs, bs; // sum of pixels colors this node accounts for member in struct:Ocnode_def
50 colors_sum(stored in rs,gs,bs)/weight
203 ((node->rs / node->weight) << 16) +
233 node->rs = rgb.r; node->gs = rgb.g; node->bs = rgb.b;
266 node1->rs += node2->rs; node1->gs += node2->gs; node1->bs += node2->bs;
279 node2->rs += node1->rs; node2->gs += node1->gs; node2->bs += node1->bs;
292 newnode->rs = node1->rs
[all...]
/inkscape/src/libcola/
H A Dcola.cpp21 std::vector<Rectangle*>& rs,
28 n(rs.size()),
41 assert(rs.size()==n);
42 boundingBoxes = new Rectangle*[rs.size()];
43 copy(rs.begin(),rs.end(),boundingBoxes);
56 X[i]=rs[i]->getCentreX();
57 Y[i]=rs[i]->getCentreY();
172 X[i]=rs[i]->getCentreX();
173 Y[i]=rs[
20 ConstrainedMajorizationLayout( std::vector<Rectangle*>& rs, std::vector<Edge>& es, double* eweights, double idealLength, TestConvergence& done) argument
[all...]
H A Dgradient_projection.h205 vpsc::Rectangle** rs=NULL,
208 : k(k), n(n), A(A), place(x), rs(rs),
270 vpsc::Rectangle** rs; member in class:GradientProjection
196 GradientProjection( const Dim k, unsigned n, double** A, double* x, double tol, unsigned max_iterations, AlignmentConstraints* acs=NULL, bool nonOverlapConstraints=false, vpsc::Rectangle** rs=NULL, PageBoundaryConstraints *pbc = NULL, SimpleConstraints *sc = NULL) argument
H A Dconnected_components.cpp64 const vector<Rectangle*> &rs,
69 unsigned n=rs.size();
75 vs[i].r=rs[i];
63 connectedComponents( const vector<Rectangle*> &rs, const vector<Edge> &es, const SimpleConstraints &scx, const SimpleConstraints &scy, vector<Component*> &components) argument
H A Dcola.h38 const std::vector<Rectangle*> &rs,
153 std::vector<Rectangle*>& rs,
/inkscape/src/extension/internal/
H A Dwmf-print.h61 unsigned int rs,
H A Demf-print.h61 unsigned int rs,

Completed in 2121 milliseconds

12