| /inkscape/src/libvpsc/pairingheap/ |
| H A D | PairingHeap.cpp | 67 PairingHeap<T>::insert( const T & x ) function in class:PairingHeap
177 * p points to a node returned by insert.
|
| /inkscape/src/ui/tool/ |
| H A D | control-point-selection.h | 65 // insert
66 std::pair<iterator, bool> insert(const value_type& x, bool notify = true);
68 void insert(InputIterator first, InputIterator last) { function in class:Inkscape::UI::ControlPointSelection
70 insert(*first, false);
|
| H A D | node.h | 419 /** insert a node before pos. */
420 iterator insert(iterator pos, Node *x);
423 void insert(iterator pos, InputIterator first, InputIterator last) { function in class:Inkscape::UI::NodeList
424 for (; first != last; ++first) insert(pos, *first);
431 void push_front(Node *x) { insert(begin(), x); }
433 void push_back(Node *x) { insert(end(), x); }
|
| H A D | control-point-selection.cpp | 79 std::pair<ControlPointSelection::iterator, bool> ControlPointSelection::insert(const value_type &x, bool notify) function in class:Inkscape::UI::ControlPointSelection
86 found = _points.insert(x).first;
140 insert(*i, false);
152 insert(*i, false);
170 insert(*i, false);
203 if (grow) insert(match);
277 // first we insert all points into a multimap keyed by the aligned coord to sort them
281 sm.insert(std::make_pair(pos[d], (*i)));
349 _original_positions.insert(std::make_pair(*i, (*i)->position()));
350 _last_trans.insert(st
[all...] |
| H A D | node.cpp | 1030 _selection.insert(this);
1042 _selection.insert(this);
1072 if (t) _selection.insert(t.ptr());
1555 NodeList::iterator NodeList::insert(iterator pos, Node *x) function in class:Inkscape::UI::NodeList
|
| /inkscape/src/util/ |
| H A D | list-container.h | 129 iterator insert(const_iterator position, const_reference value) { function in class:Inkscape::Util::ListContainer
146 void insert(const_iterator position, size_type count, const_reference value) function in class:Inkscape::Util::ListContainer
151 void insert(const_iterator position, ForwardIterator i, ForwardIterator j) { function in class:Inkscape::Util::ListContainer
303 } else { /* insert somewhere in the middle */
326 } else { /* insert somewhere in the middle */
|
| /inkscape/src/2geom/ |
| H A D | pathvector.h | 179 iterator insert(iterator pos, Path const &p) { function in class:Geom::PathVector
180 return _data.insert(pos, p);
183 void insert(iterator out, InputIter first, InputIter last) { function in class:Geom::PathVector
184 _data.insert(out, first, last);
|
| H A D | path.h | 303 * Normally, an exception will be thrown when you try to insert a curve
305 * curve data, you can call setStitching(true), which will insert line segments
643 void insert(iterator pos, Curve const &curve);
646 void insert(iterator pos, Iter first, Iter last) { function in class:Geom::Path
|
| H A D | toposweep.cpp | 28 void TopoGraph::Vertex::insert(unsigned ix, Edge v) { function in class:Geom::TopoGraph::Vertex
31 enters.insert(enters.begin() + ix, v);
33 exits.insert(exits.begin() + (ix - enters.size()), v);
111 void concatenate(T &a, T const &b) { a.insert(a.end(), b.begin(), b.end()); }
415 //create a new context, associate a beginning vertex, and insert it in the proper location
423 context.insert(context.begin() + context_ix, Context(s, ix));
479 vertices[ix].enters.insert(it, e);
519 v.enters.insert(v.enters.begin() + (before ? i : i + 1), jx);
525 v.exits.insert(v.exits.begin() + (before ? i : i + 1), jx);
|
| /inkscape/share/extensions/ |
| H A D | voronoi.py | 204 # create a new Halfedge, setting its pm field to 0 and insert
208 edgeList.insert(lbnd,bisector)
215 priorityQ.insert(lbnd,p,newsite.distance(p))
218 # insert the new Halfedge to the right of the original bisector
221 edgeList.insert(lbnd,bisector)
227 priorityQ.insert(bisector,p,newsite.distance(p))
287 # insert the new bisector to the right of the left HE
291 edgeList.insert(llbnd, bisector)
300 priorityQ.insert(llbnd, p, bot.distance(p))
305 priorityQ.insert(bisecto
555 def insert(self,left,he): member in class:EdgeList
633 def insert(self,he,site,offset): member in class:PriorityQueue
[all...] |
| /inkscape/src/ |
| H A D | sp-text.cpp | 906 void TextTagAttributes::insert(unsigned start_index, unsigned n) function in class:TextTagAttributes
923 attr_vector->insert(attr_vector->begin() + start_index, n, zero_length);
926 double diff = ((*attr_vector)[start_index + n].computed - begin) / n; // n tested for nonzero in insert()
|
| /inkscape/src/libavoid/ |
| H A D | orthogonal.cpp | 623 vertInfs.insert(bvi);
627 vertInfs.insert(fvi);
639 vertInfs.insert(bfvi);
687 vertInfs.insert(segment.vertInfs.begin(), segment.vertInfs.end());
722 vertInfs.insert(found);
731 vertInfs.insert(vert);
737 vertInfs.insert(new
747 vertInfs.insert(vert);
753 vertInfs.insert(new
772 breakPoints.insert(PosVertIn
1021 LineSegment *insert(LineSegment segment) function in class:SegmentListWrapper
[all...] |