Searched defs:last (Results 1 - 25 of 37) sorted by relevance

12

/inkscape/src/2geom/
H A Dpath-sink.cpp49 Path::const_iterator iter = path.begin(), last = path.end_open(); local
50 for (; iter != last; ++iter) {
H A Dconvex-hull.cpp204 bool below_x_monotonic_polyline(Point const &p, Iter first, Iter last, Lex lex) argument
207 Iter f = std::lower_bound(first, last, p, lex);
208 if (f == last) return false;
H A Dcirculator.h51 Iterator const &last,
53 : _first(first), _last(last), _pos(pos)
50 Circulator(Iterator const &first, Iterator const &last, Iterator const &pos) argument
H A Dconvex-hull.h145 ConvexHull(Iter first, Iter last) argument
148 _prune(first, last, _boundary);
283 static void _prune(Iter first, Iter last, std::vector<Point> &out) { argument
285 for (Iter i = first; i != last; ++i) {
303 for (Iter i = first; i != last; ++i) {
H A Delliptical-arc-from-sbasis.cpp141 unsigned int last; // N-1 member in class:Geom::make_elliptical_arc
202 N(_total_samples), last(N-1), partitions(N-1), p(N)
246 print_bound_error(last);
261 for ( unsigned int k = 1; k < last; ++k )
H A Dline.cpp289 std::vector<ShapeIntersection>::reverse_iterator i = xs.rbegin(), last = xs.rend(); local
290 while (i != last) {
302 std::vector<ShapeIntersection>::reverse_iterator i = xs.rbegin(), last = xs.rend(); local
303 while (i != last) {
H A Dbezier.h217 Bezier(Iter first, Iter last) { argument
218 c_.resize(std::distance(first, last));
219 for (std::size_t i = 0; first != last; ++first, ++i) {
H A Dd2.h75 D2(Iter first, Iter last) { argument
80 XIter xfirst(first, GetAxis<X,V>()), xlast(last, GetAxis<X,V>());
82 YIter yfirst(first, GetAxis<Y,V>()), ylast(last, GetAxis<Y,V>());
H A Dpathvector.h140 PathVector(InputIter first, InputIter last) argument
141 : _data(first, last)
175 /// Remove the last path.
183 void insert(iterator out, InputIter first, InputIter last) { argument
184 _data.insert(out, first, last);
191 iterator erase(iterator first, iterator last) { argument
192 return _data.erase(first, last);
220 /** @brief Get the last point in the last path of the vector.
H A Delliptical-arc.cpp570 std::vector<ShapeIntersection>::reverse_iterator i = xs.rbegin(), last = xs.rend(); local
571 while (i != last) {
/inkscape/src/libavoid/
H A Dshape.cpp51 VertInf *last = NULL; local
63 node->shPrev = last;
64 last->shNext = node;
65 //node->lstPrev = last;
66 //last->lstNext = node;
69 last = node;
H A Dvertices.cpp354 // Make first and last
410 // Set new last
413 // Make last point to shapes list
428 // Set new last
450 // Correct the last conn vertex
493 VertInf *last = end(); local
494 for (VertInf *curr = connsBegin(); curr != last; curr = curr->lstNext)
507 VertInf *last = end(); local
508 for (VertInf *curr = shapesBegin(); curr != last; curr = curr->lstNext)
H A Dgraph.cpp75 // Gives an order value between 0 and 3 for the point c, given the last
468 VertInf *last = _router->vertices.end(); local
471 for (VertInf *k = _router->vertices.shapesBegin(); k != last; )
488 while ((k != last) && (k->id.objID == shapeID))
H A Dmakepath.cpp176 // between it and the last one in the existing path.
323 static double estimatedCost(ConnRef *lineRef, const Point *last, argument
338 if (!last)
350 double rad = M_PI - angleBetween(*last, a, b);
422 VertInf *last = NULL; local
424 while (last != start)
437 if (!last)
458 // Point parent to last BestNode (pushed onto DONE)
474 last = curr;
618 // this ANode through (the last BestNod
[all...]
/inkscape/src/ui/tool/
H A Dcontrol-point-selection.h68 void insert(InputIterator first, InputIterator last) { argument
69 for (; first != last; ++first) {
72 signal_selection_changed.emit(std::vector<key_type>(first, last), true);
79 void erase(iterator first, iterator last);
144 //the purpose of this list is to keep track of first and last selected
H A Dnode.h423 void insert(iterator pos, InputIterator first, InputIterator last) { argument
424 for (; first != last; ++first) insert(pos, *first);
428 void splice(iterator pos, NodeList &list, iterator first, iterator last);
437 iterator erase(iterator first, iterator last) { argument
439 while (first != last) ret = erase(first++);
/inkscape/src/ui/tools/
H A Ddynamic-base.h82 Geom::Point last; member in class:Inkscape::UI::Tools::DynamicBase
/inkscape/src/libvpsc/
H A Dblock.cpp201 inline bool Block::canFollowLeft(Constraint *c, const Variable* const last) { argument
202 return c->left->block==this && c->active && last!=c->left;
204 inline bool Block::canFollowRight(Constraint *c, const Variable* const last) { argument
205 return c->right->block==this && c->active && last!=c->right;
/inkscape/src/
H A Ddocument-subset.cpp60 Siblings::const_iterator last=children.end() - 1; local
62 while ( first != last ) {
63 Siblings::const_iterator mid = first + ( last - first + 1 ) / 2;
68 if ( last == mid ) {
69 last = mid - 1; // already at the top limit
71 last = mid;
78 if ( first == last ) {
80 int pos = sp_object_compare_position(*last, obj);
82 ++last;
86 return last
[all...]
/inkscape/src/live_effects/
H A Dlpe-roughen.cpp248 bool last = false; local
250 last = true;
253 tmp = addNodesAndJitter(nCurve->last_segment(), prev, last_move, time, last);
310 SPCurve const * LPERoughen::addNodesAndJitter(Geom::Curve const * A, Geom::Point &prev, Geom::Point &last_move, double t, bool last) argument
323 if(last){
331 if(last){
337 if(last){
360 if(last){
372 if(last){
395 if(last){
[all...]
/inkscape/src/ui/dialog/
H A Dundo-history.cpp316 EventLog::iterator last = curr_event_parent->children().end(); local
319 for ( --last ; curr_event != last ; ++curr_event ) {
335 /* Selecting a collapsed parent event is equal to selecting the last child
416 // Collapsing a branch we're currently in is equal to stepping to the last event in that branch
420 EventLog::const_iterator last = curr_event_parent->children().end(); local
425 for ( --last ; curr_event != last ; ++curr_event ) {
/inkscape/src/libnrtype/
H A DFontInstance.cpp105 , last(0, 0)
109 Geom::Point last; member in struct:FT2GeomData
132 user->last = p;
142 user->last = p;
152 user->last = p;
163 //user->theP->CubicTo(p,3*(c1-user->last),3*(p-c2));
165 user->last = p;
435 while ( p+1 != endp ) { // Process all "midpoints" (all points except the last)
/inkscape/src/livarot/
H A DPathStroke.cpp78 int last[2] = { -1, -1 }; local
83 DoButt(dest, width, butt, pos, dir, last[RIGHT], last[LEFT]);
87 dest->AddEdge (end[LEFT], last[LEFT]);
88 dest->AddEdge (last[RIGHT], end[RIGHT]);
145 int last[2] = { -1, -1 }; local
149 DoButt(dest, width, butt, curP, dir, last[RIGHT], last[LEFT]);
153 dest->AddEdge (end[LEFT], last[LEFT]);
154 dest->AddEdge (last[RIGH
161 int last[2] = { -1, -1 }; local
[all...]
/inkscape/src/extension/internal/
H A Dmetafile-print.cpp167 int last = gr->vector.stops.size() - 1; local
168 if (last >= 1) {
174 ope = gr->vector.stops[last].opacity;
176 sp_color_get_rgb_floatv(&gr->vector.stops[last].color, rgbe);
/inkscape/src/libgdl/
H A Dgdl-dock-master.c207 GList *last; local
211 new controller. start from the last dock, since it's
213 last = g_list_last (master->toplevel_docks);
214 while (last) {
215 if (!GDL_DOCK_OBJECT_AUTOMATIC (last->data)) {
216 new_controller = GDL_DOCK_OBJECT (last->data);
219 last = last->prev;

Completed in 124 milliseconds

12