Searched defs:prev (Results 1 - 25 of 49) sorted by relevance

12

/inkscape/src/libcroco/
H A Dcr-selector.h66 CRSelector *prev ; member in struct:_CRSelector
H A Dcr-attr-sel.h54 CRAttrSel *prev ; member in struct:_CRAttrSel
H A Dcr-declaration.h62 CRDeclaration *prev ; member in struct:_CRDeclaration
H A Dcr-additional-sel.h62 CRAdditionalSel * prev ; member in struct:_CRAdditionalSel
H A Dcr-simple-sel.h103 CRSimpleSel *prev ; member in struct:_CRSimpleSel
H A Dcr-prop-list.c31 CRPropList *prev; member in struct:_CRPropListPriv
92 PRIVATE (a_to_append)->prev = cur;
149 PRIVATE (a_this)->prev = cur;
329 return PRIVATE (a_this)->prev;
344 CRPropList *prev = NULL, local
353 g_return_val_if_fail (PRIVATE (next)->prev == a_pair, NULL);
355 if (PRIVATE (a_pair)->prev) {
356 prev = PRIVATE (a_pair)->prev;
357 g_return_val_if_fail (PRIVATE (prev), NUL
[all...]
H A Dcr-term.h144 CRTerm *prev ; member in struct:_CRTerm
H A Dcr-statement.h213 CRStatement *prev ; member in struct:_CRStatement
/inkscape/src/extension/
H A Dtimer.cpp72 ExpirationTimer * prev; local
73 for (prev = timer_list;
74 prev->next != this;
75 prev = prev->next){};
76 prev->next = next;
/inkscape/src/libvpsc/pairingheap/
H A DPairingHeap.h48 PairNode *prev; member in class:PairNode
52 leftChild(NULL), nextSibling(NULL), prev(NULL)
/inkscape/src/xml/
H A Dlog-builder.cpp34 void LogBuilder::addChild(Node &node, Node &child, Node *prev) { argument
35 _log = new Inkscape::XML::EventAdd(&node, &child, prev, _log);
39 void LogBuilder::removeChild(Node &node, Node &child, Node *prev) { argument
40 _log = new Inkscape::XML::EventDel(&node, &child, prev, _log);
H A Dnode-observer.h65 * This method is called whenever a child is added to the observed node. The @c prev
70 * @param prev The node after which the new child was inserted into the sibling order, or NULL
72 virtual void notifyChildAdded(Node &node, Node &child, Node *prev) { argument
75 INK_UNUSED(prev);
81 * This method is called whenever a child is removed from the observed node. The @c prev
86 * @param prev The node that was before the removed node in sibling order, or NULL
88 virtual void notifyChildRemoved(Node &node, Node &child, Node *prev) { argument
91 INK_UNUSED(prev);
H A Dsimple-document.cpp76 Node *prev)
79 _log_builder.addChild(parent, child, prev);
85 Node *prev)
88 _log_builder.removeChild(parent, child, prev);
74 notifyChildAdded(Node &parent, Node &child, Node *prev) argument
83 notifyChildRemoved(Node &parent, Node &child, Node *prev) argument
H A Dcomposite-node-observer.cpp28 void CompositeNodeObserver::notifyChildAdded(Node &node, Node &child, Node *prev) argument
35 iter->observer.notifyChildAdded(node, child, prev);
42 Node *prev)
49 iter->observer.notifyChildRemoved(node, child, prev);
118 void notifyChildAdded(Node &node, Node &child, Node *prev) { argument
120 vector.child_added(&node, &child, prev, data);
124 void notifyChildRemoved(Node &node, Node &child, Node *prev) { argument
126 vector.child_removed(&node, &child, prev, data);
41 notifyChildRemoved(Node &node, Node &child, Node *prev) argument
/inkscape/src/libdepixelize/priv/
H A Dsplines-kopf2011.h53 Point<T> prev = source.back(); local
54 Geom::Path ret(to_geom_point(midpoint(prev, *it)));
60 prev = *it;
65 if ( !prev.visible ) {
66 Geom::Point middle = to_geom_point(midpoint(prev, *it));
83 prev = *it;
H A Doptimization-kopf2011.h110 typename std::vector< Point<T> >::iterator prev = it; local
116 prev = it;
124 return prev - begin;
140 return prev - begin;
141 prev = it;
144 return prev - begin;
209 Point<T> prev = ( j == 0 ) ? ret.back() : ret[j-1]; local
229 T s = smoothness_energy(prev, guess, next);
234 T prev_e = smoothness_energy(prev, ret[j], next)
/inkscape/src/
H A Drubberband.cpp90 Geom::Point prev = _points.back(); local
91 int subdiv = 2 * (int) round(Geom::L2(next-prev) + 0.5);
93 _points.push_back(prev + ((double)i/subdiv) * (next - prev));
H A Dobject-test.h108 SPObject *prev = next; local
110 prev = next;
114 TS_ASSERT(next->getPrev() == prev);
115 prev = next;
H A Dsp-clippath.cpp286 SPClipPathView *prev; local
287 prev = list;
288 while (prev->next != view) prev = prev->next;
289 prev->next = view->next;
H A Dsp-mask.cpp307 SPMaskView *prev; local
308 prev = list;
309 while (prev->next != view) prev = prev->next;
310 prev->next = view->next;
/inkscape/cxxtest/cxxtest/
H A DLinkedList.cpp36 l = l->prev();
44 l = l->prev();
121 Link * Link::prev() function in class:CxxTest::Link
137 const Link * Link::prev() const function in class:CxxTest::Link
/inkscape/src/livarot/
H A Dint-line.h27 int prev; member in struct:int_ligne_bord
/inkscape/src/libdepixelize/
H A Dkopftracer2011.cpp518 PixelGraph::const_iterator prev = i ? b : a; local
530 // and one of them has the same value of prev
547 - guintptr(to_ptr(prev));
548 prev = it;
/inkscape/src/2geom/
H A Dd2-sbasis.cpp174 unsigned prev = (closed)? f.size()-1:0; local
176 Point pt0 = f.segs[prev].at1();
181 SBasis &prev_sb=result.segs[prev][dim];
196 prev = cur++;
/inkscape/src/live_effects/
H A Dlpe-roughen.cpp208 Geom::Point prev(0, 0);
246 tmp = jitter(nCurve->last_segment(), prev, last_move);
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
355 ray.setPoints(prev,A->initialPoint());
357 if(prev == Geom::Point(0,0)){
373 prev = point_b2;
375 prev = point_a2;
390 ray.setPoints(prev,A->initialPoint());
392 if(prev
460 jitter(Geom::Curve const * A, Geom::Point &prev, Geom::Point &last_move) argument
[all...]

Completed in 54 milliseconds

12