Searched refs:dim (Results 1 - 25 of 28) sorted by relevance

12

/inkscape/src/2geom/
H A Dsweep-bounds.h44 sweep_bounds(std::vector<Rect>, Dim2 dim = X);
47 sweep_bounds(std::vector<Rect>, std::vector<Rect>, Dim2 dim = X);
H A Dsbasis-2d.cpp53 for(unsigned dim = 0; dim < 2; dim++)
54 s[dim] = p[dim]*(Linear(1) - p[dim]);
73 SBasis2d partial_derivative(SBasis2d const &f, int dim) { argument
84 Linear2d dlin(lin[1+dim]-lin[0], lin[1+2*dim]-lin[dim], li
[all...]
H A Dint-point.h126 LexLessRt(Dim2 d) : dim(d) {}
129 Dim2 dim; member in struct:Geom::IntPoint::LexLessRt
133 LexGreaterRt(Dim2 d) : dim(d) {}
136 Dim2 dim; member in struct:Geom::IntPoint::LexGreaterRt
161 return dim ? IntPoint::LexLess<Y>()(a, b) : IntPoint::LexLess<X>()(a, b);
164 return dim ? IntPoint::LexGreater<Y>()(a, b) : IntPoint::LexGreater<X>()(a, b);
H A Dtoposweep.cpp149 if(are_near(ap[dim], bp[dim], tol)) {
152 if(a.tp[dim] < ap[dim] && b.tp[dim] > bp[dim]) return true;
153 if(a.tp[dim] > ap[dim] && b.tp[dim] < bp[dim]) retur
[all...]
H A Dd2-sbasis.cpp180 for (unsigned dim=0; dim<2; dim++){
181 SBasis &prev_sb=result.segs[prev][dim];
182 SBasis &cur_sb =result.segs[cur][dim];
183 Coord const c=pt0[dim];
240 for (unsigned dim=0; dim<2; dim++){
241 f.segs.front()[dim][
[all...]
H A Dtoposweep.h128 Dim2 dim; member in class:Geom::TopoGraph
150 Dim2 dim; member in class:Geom::SectionSorter
158 SectionSorter(const PathVector &rs, Dim2 d, double t = 0.00001) : ps(rs), dim(d), tol(t) {}
167 Dim2 dim; member in struct:Geom::SweepSorter
168 SweepSorter(Dim2 d) : dim(d) {}
170 return Point::LexLessRt(dim)(a.fp, b.fp);
H A Drecursive-bezier-intersection.cpp132 for(int dim = 0; dim < 2; dim++) {
136 double tmp = p[0][dim]*u;
140 tmp = (tmp + tn*bc*p[i][dim])*u;
142 r[dim] = (tmp + tn*t*p[n][dim]);
H A Dtransforms.h126 Coord operator[](Dim2 dim) const { return vec[dim]; }
127 Coord operator[](unsigned dim) const { return vec[dim]; }
205 Coord operator[](Dim2 dim) const { return vec[dim]; }
206 Coord operator[](unsigned dim) const { return vec[dim]; }
H A Dsbasis.cpp239 for(unsigned dim = 0; dim < 2; dim++)
240 c[i][dim] += b[j][dim]*a[i-j][dim];
267 for(unsigned dim = 0; dim < 2; dim++)
268 c[i][dim]
[all...]
H A Dsbasis-geometric.cpp416 for (unsigned dim=0;dim<2;dim++){
420 sub_u[dim]=compose_inverse(sub_M[dim],sub_s, order, tol);
697 for(unsigned dim=0;dim<2;dim++){
699 c[0] = Linear(M0[dim],M1[dim]);
[all...]
H A Dconicsec.cpp190 for(int dim = 0; dim < 2; dim++) {
191 out[dim] = divide(out[dim], (omt*omt+2*omt*t*w+t*t), 2);
1372 for (size_t dim = 0; dim < 2; ++dim)
1374 if (empty[dim]) continue;
1375 rts = roots (gl[dim]);
[all...]
H A Dpoint.h241 LexLessRt(Dim2 d) : dim(d) {}
244 Dim2 dim; member in struct:Geom::Point::LexLessRt
247 LexGreaterRt(Dim2 d) : dim(d) {}
250 Dim2 dim; member in struct:Geom::Point::LexGreaterRt
297 return dim ? Point::LexLess<Y>()(a, b) : Point::LexLess<X>()(a, b);
300 return dim ? Point::LexGreater<Y>()(a, b) : Point::LexGreater<X>()(a, b);
/inkscape/src/live_effects/
H A Dlpe-sketch.cpp170 for (unsigned dim=0; dim<2; dim++){
171 A[dim] = offset[dim] + 2*tremble_size-tremble_size.get_value();
172 dA[dim] = 2*tremble_size-tremble_size.get_value();
181 for (unsigned dim=0; dim<2; dim++){
182 B[dim]
[all...]
H A Dlpe-lattice.cpp96 for(unsigned dim = 0; dim < 2; dim++) {
97 sb2[dim].us = 2;
98 sb2[dim].vs = 2;
99 const int depth = sb2[dim].us*sb2[dim].vs;
100 sb2[dim].resize(depth, Linear2d(0));
129 for(unsigned dim = 0; dim <
[all...]
H A Dlpe-lattice2.cpp123 for(unsigned dim = 0; dim < 2; dim++) {
124 sb2[dim].us = 3;
125 sb2[dim].vs = 3;
126 const int depth = sb2[dim].us*sb2[dim].vs;
127 sb2[dim].resize(depth, Linear2d(0));
177 for(unsigned dim = 0; dim <
[all...]
/inkscape/src/libavoid/
H A Dorthogonal.cpp60 bool isSBend, const size_t dim, double minLim, double maxLim)
66 dimension(dim),
75 const size_t dim)
81 dimension(dim),
85 minSpaceLimit = lowPoint()[dim];
86 maxSpaceLimit = lowPoint()[dim];
154 bool overlapsWith(const ShiftSegment& rhs, const size_t dim) const
156 size_t altDim = (dim + 1) % 2;
260 double firstObstacleAbove(size_t dim) argument
263 while (curr && (curr->ss || (curr->max[dim] > po
59 ShiftSegment(ConnRef *conn, const size_t low, const size_t high, bool isSBend, const size_t dim, double minLim, double maxLim) argument
74 ShiftSegment(ConnRef *conn, const size_t low, const size_t high, const size_t dim) argument
277 firstObstacleBelow(size_t dim) argument
293 markShiftSegmentsAbove(size_t dim) argument
308 markShiftSegmentsBelow(size_t dim) argument
321 findFirstPointAboveAndBelow(const size_t dim, double& firstAbovePos, double& firstBelowPos, double& lastAbovePos, double& lastBelowPos) argument
392 firstPointAbove(size_t dim) argument
406 firstPointBelow(size_t dim) argument
506 getPosVertInfDirection(VertInf *v, size_t dim) argument
879 generateVisibilityEdgesFromBreakpointSet(Router *router, size_t dim) argument
1086 size_t dim = XDIM; // x-dimension local
1115 size_t dim = XDIM; // x-dimension local
1607 size_t dim = XDIM; // x-dimension local
1630 processShiftEvent(Router * , NodeSet& scanline, ShiftSegmentList& , Event *e, size_t dim, unsigned int pass) argument
1705 buildOrthogonalChannelInfo(Router *router, const size_t dim, ShiftSegmentList& segmentList) argument
2002 CmpLineOrder(PtOrderMap& ord, const size_t dim) argument
[all...]
H A Dconnector.h374 bool addPoints(const int dim, PtConnPtrPair innerArg,
376 void sort(const int dim);
377 int positionFor(const ConnRef *conn, const size_t dim) const;
H A Dconnector.cpp935 for (int dim = 0; dim < 2; ++dim)
937 PointRepList::iterator curr = connList[dim].begin();
938 while (curr != connList[dim].end())
941 curr = connList[dim].erase(curr);
968 int PtOrder::positionFor(const ConnRef *conn, const size_t dim) const
971 for (PointRepList::const_iterator curr = connList[dim].begin();
972 curr != connList[dim].end(); ++curr)
985 bool PtOrder::addPoints(const int dim, PtConnPtrPai argument
1049 sort(const int dim) argument
[all...]
/inkscape/src/libcola/
H A Dstraightener.cpp130 vector<Node*>& L,vector<Node*>& nodes, Dim dim) {
141 if(dim==HORIZONTAL) {
161 Node* d=dim==HORIZONTAL?
182 Node* d=dim==HORIZONTAL?
192 static SimpleConstraint* createConstraint(Node* u, Node* v, Dim dim) { argument
193 double g=dim==HORIZONTAL?(u->width+v->width):(u->height+v->height);
199 void generateConstraints(vector<Node*>& nodes, vector<Edge*>& edges,vector<SimpleConstraint*>& cs,Dim dim) { argument
203 if(dim==HORIZONTAL) {
255 sortNeighbours(v,l,r,e->pos,openEdges,L,nodes,dim);
274 cs.push_back(createConstraint(lastNode,*i,dim));
128 sortNeighbours(Node* v, Node* l, Node* r, double conjpos, vector<Edge*>& openEdges, vector<Node*>& L,vector<Node*>& nodes, Dim dim) argument
[all...]
H A Dstraightener.h108 std::vector<Node*>& L, std::vector<Node*>& nodes, Dim dim);
129 void generateConstraints(std::vector<Node*>& nodes, std::vector<Edge*>& edges, std::vector<SimpleConstraint*>& cs, Dim dim);
H A Dcola.cpp221 void ConstrainedMajorizationLayout::straighten(std::vector<straightener::Edge*>& sedges, Dim dim) { argument
227 straightener::generateConstraints(snodes,sedges,cs,dim);
271 double b[n],*coords=dim==HORIZONTAL?X:Y,dist_ub,dist_bv;
311 GradientProjection gp(dim,n,Q,coords,tol,100,
/inkscape/src/display/
H A Dnr-filter-slot.cpp275 Geom::Point dim(_slot_w, _slot_h);
276 Geom::Rect r(p, p+dim);
H A Dcanvas-grid.cpp846 for(int dim = 0; dim < 2; dim++) {
852 scaled[dim] = FALSE;
853 sw[dim] = fabs (sw[dim]);
854 while (sw[dim] < 8.0) {
855 scaled[dim] = TRUE;
856 sw[dim] *= scaling_factor;
H A Dcanvas-axonomgrid.cpp492 for(int dim = 0; dim < 2; dim++) {
499 while ( (sw[dim] < 8.0) & (watchdog < 100) ) {
501 sw[dim] *= scaling_factor;
/inkscape/share/extensions/
H A Dwebslicer_export.py348 dim = conf['dimension'].split('x')
349 opts += ' -w '+dim[0]+' -h '+dim[1]

Completed in 692 milliseconds

12