Searched refs:back (Results 1 - 25 of 94) sorted by relevance

1234

/inkscape/src/display/
H A Dcurve.cpp219 else _pathv.back().appendNew<Geom::LineSegment>( p );
238 else _pathv.back().appendNew<Geom::QuadraticBezier>( p1, p2);
258 else _pathv.back().appendNew<Geom::CubicBezier>( p0, p1, p2 );
276 _pathv.back().close(true);
282 Used for freehand drawing when the user draws back to the start point.
287 if (_pathv.back().size() > 0 && dynamic_cast<Geom::LineSegment const *>(&_pathv.back().back_open())) {
288 _pathv.back().erase_last();
290 _pathv.back().setFinal(_pathv.back()
437 Geom::Curve const &back = lastpath.back_default(); member in class:Geom
[all...]
H A Dnr-filter-morphology.cpp93 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
97 while(!vals[p].empty() && !comp(vals[p].back().second, 0)) vals[p].pop_back();
113 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
125 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
140 while(!vals[p].empty() && !comp(vals[p].back().second, 0)) vals[p].pop_back();
/inkscape/src/2geom/
H A Dbasic-intersection.cpp218 av.back()[X].at0() = bv.back()[X].at0() = lerp(0.5, av.back()[X].at0(), bv.back()[X].at0());
219 av.back()[X].at1() = bv.back()[X].at1() = lerp(0.5, av.back()[X].at1(), bv.back()[X].at1());
220 av.back()[Y].at0() = bv.back()[
[all...]
H A Drecursive-bezier-intersection.cpp33 maxax = p.back()[X];
44 maxay = p.back()[Y];
283 double xlk = a.p.back()[X] - a.p[0][X];
284 double ylk = a.p.back()[Y] - a.p[0][Y];
285 double xnm = b.p.back()[X] - b.p[0][X];
286 double ynm = b.p.back()[Y] - b.p[0][Y];
H A Dpathvector.h169 Path &back() { return _data.back(); } function in class:Geom::PathVector
170 Path const &back() const { return _data.back(); } function in class:Geom::PathVector
223 return _data.back().finalPoint();
H A Dpolynomial.cpp63 while(back() == 0)
70 double scale = 1./back(); // unitize
194 double ci = r.back()/b.back();
/inkscape/src/svg/
H A Dsvg-path-geom-test.h47 rectanglepvopen.back().append(Geom::LineSegment(Geom::Point(1,2),Geom::Point(4,2)));
48 rectanglepvopen.back().append(Geom::LineSegment(Geom::Point(4,2),Geom::Point(4,8)));
49 rectanglepvopen.back().append(Geom::LineSegment(Geom::Point(4,8),Geom::Point(1,8)));
50 rectanglepvopen.back().append(Geom::LineSegment(Geom::Point(1,8),Geom::Point(1,2)));
52 rectanglepvclosed.back().append(Geom::LineSegment(Geom::Point(1,2),Geom::Point(4,2)));
53 rectanglepvclosed.back().append(Geom::LineSegment(Geom::Point(4,2),Geom::Point(4,8)));
54 rectanglepvclosed.back().append(Geom::LineSegment(Geom::Point(4,8),Geom::Point(1,8)));
55 rectanglepvclosed.back().close();
57 rectanglepvclosed2.back().append(Geom::LineSegment(Geom::Point(1,2),Geom::Point(4,2)));
58 rectanglepvclosed2.back()
[all...]
/inkscape/src/ui/tool/
H A Dcurve-drag-point.cpp53 if (first->front()->isDegenerate() && second->back()->isDegenerate()) {
61 second->back()->move(second->back()->position() - delta);
77 second->back()->retract();
94 // among the handles; 0 = front handle only, 1 = back handle only.
108 second->back()->move(second->back()->position() + offset1);
111 second->back()->move(new_pos);
117 first->back()->move(new_pos);
189 bool linear = first->front()->isDegenerate() && first.next()->back()
[all...]
H A Dpath-manipulator.cpp332 if (first->front()->isDegenerate() && second->back()->isDegenerate()) {
338 second->back()->position()[dim], second->position()[dim]);
442 back_pos = *sel_beg->back();
460 if (!sel_beg->back()->isDegenerate()) {
461 sel_beg->back()->setPosition(back_pos);
574 n->back()->setRelativePos(cur->back()->relativePos());
575 cur->back()->retract();
670 Geom::CubicBezier bc(*cur, *cur->front(), *cur.next(), *cur.next()->back());
684 end->back()
[all...]
H A Dnode.cpp637 Node * prevNode = n->nodeToward(n->back());
638 nodeWeight = fmax(_pm()._bsplineHandlePosition(n->front(), false),_pm()._bsplineHandlePosition(n->back(), false));
643 nextNodeWeight = _pm()._bsplineHandlePosition(nextNode->back());
658 _back.setPosition(_pm()._bsplineHandleReposition(this->back(),nodeWeight));
663 nextNode->back()->setPosition(_pm()._bsplineHandleReposition(nextNode->back(), nextNodeWeight));
679 Node * prevNode = n->nodeToward(n->back());
685 nextNodeWeight = _pm()._bsplineHandlePosition(nextNode->back());
699 _back.setPosition(_pm()._bsplineHandleReposition(this->back(), nodeWeight));
704 nextNode->back()
[all...]
/inkscape/src/util/
H A Dlist-container-test.h18 if ( n_values == 1 && &c.back() != &*iter ) {
208 TS_ASSERT_EQUALS(t.back() , 3);
211 TS_ASSERT_EQUALS(t.back() , 3);
214 TS_ASSERT_EQUALS(t.back() , 23);
217 TS_ASSERT_EQUALS(t.back() , 23);
220 TS_ASSERT_EQUALS(t.back() , 23);
225 TS_ASSERT_EQUALS(t.back() , 42);
/inkscape/src/live_effects/
H A Dlpe-text_label.cpp38 double t = (pwd2_in.cuts.front() + pwd2_in.cuts.back()) / 2;
H A Dlpe-constructgrid.cpp70 path_out.push_back(path_out.back() * second_translation );
74 path_out.push_back(path_out.back() * first_translation );
H A Dlpe-ruler.cpp175 speed.segs.back()[X].size() <= 1 &&
176 speed.segs.back()[Y].size() <= 1 &&
177 speed.segs.back()[X].tailError(0) <= 1e-10 &&
178 speed.segs.back()[Y].tailError(0) <= 1e-10
H A Dlpe-envelope.cpp130 double scaling1 = uskeleton1.cuts.back()/boundingbox_X.extent();
135 double scaling2 = uskeleton2.cuts.back()/boundingbox_Y.extent();
140 double scaling3 = uskeleton3.cuts.back()/boundingbox_X.extent();
145 double scaling4 = uskeleton4.cuts.back()/boundingbox_Y.extent();
H A Dlpe-attach-path.cpp99 &transformedpath.back() : &transformedpath.at((int)start_path_position);
136 Geom::Curve * last_seg_reverse = this_pathv.front().back().reverse();
154 &transformedpath.back() : &transformedpath.at((int)end_path_position);
/inkscape/src/libnrtype/
H A DLayout-TNG-Compute.cpp41 keep adding characters until we run out of space in the chunk, then back up to the last word boundary
450 && it_chunk->broken_spans.back().end.iter_span != para.unbroken_spans.end()) { // don't justify the last chunk in the para
531 _flow._characters.back().chunk(&_flow).in_line != _flow._lines.size() - 1) {
544 _flow._lines.back().baseline_y = new_line.baseline_y;
704 // not vertical, so we unscale it back vertically during output
994 // // need to back up so that control codes belong outside the block-progression change
1009 // Layout::InputStreamTextSource *sub_flow_text_source = static_cast<Layout::InputStreamTextSource *>(input_item.sub_flow->_input_stream.back());
1500 if (!chunk_info->empty() && !chunk_info->back().broken_spans.empty())
1501 span_pos = chunk_info->back().broken_spans.back()
[all...]
H A DLayout-TNG-OutIter.cpp215 return Geom::Point(_chunks.back().left_x + _spans.back().x_end, _lines.back().baseline_y + _spans.back().baseline_shift);
331 top_left[Geom::X] = bottom_right[Geom::X] = _chunks.back().left_x + _spans.back().x_end;
358 *rotation = _glyphs.back().rotation;
405 double vertical_scale = _glyphs.back().vertical_scale;
446 span = &_spans.back();
447 x = span->x_end + _chunks.back()
[all...]
/inkscape/src/
H A Ddocument-undo.cpp42 * associated with releasing the mousebutton), changes are written back
166 (doc->priv->undo.back())->event =
167 sp_repr_coalesce_log ((doc->priv->undo.back())->event, log);
231 Inkscape::Event* undo_stack_top = doc.priv->undo.back();
260 Inkscape::Event *log = doc->priv->undo.back();
307 Inkscape::Event *log = doc->priv->redo.back();
336 Inkscape::Event *e = doc->priv->undo.back();
349 Inkscape::Event *e = doc->priv->redo.back();
H A Dobject-hierarchy.cpp76 while ( !_hierarchy.empty() && _hierarchy.back().object != limit ) {
77 SPObject *object=_hierarchy.back().object;
80 _detach(_hierarchy.back());
H A Drubberband.cpp89 if (!_points.empty() && Geom::L2(next-_points.back()) > 0.5) {
90 Geom::Point prev = _points.back();
H A Dobject-hierarchy.h25 * to keep a reference to an SPObject, but fall back on one of its ancestors
66 return !_hierarchy.empty() ? _hierarchy.back().object : NULL;
/inkscape/src/livarot/
H A DPath.cpp26 back = false;
388 if (back == false) {
389 if (nVal == true && back == false) {
390 back = true;
392 } else if (nVal == false && back == true) {
393 back = false;
397 if (nVal == true && back == false) {
398 back = true;
400 } else if (nVal == false && back == true) {
401 back
[all...]
/inkscape/src/helper/
H A Dgeom.cpp470 output.back().setStitching(true);
471 output.back().start( pit->initialPoint() );
476 output.back().append(l);
481 output.back().append(b);
486 output.back().append(cubicbezier_path);
491 output.back().close( pit->closed() );
515 output.back().start( pit->initialPoint() );
516 output.back().close( pit->closed() );
521 output.back().append(ls);
545 output.back()
[all...]
/inkscape/src/libdepixelize/priv/
H A Dsplines-kopf2011.h53 Point<T> prev = source.back();
127 path.pathVector.back()

Completed in 71 milliseconds

1234