Searched defs:next (Results 1 - 25 of 55) sorted by relevance

123

/inkscape/src/libcroco/
H A Dcr-selector.h64 /**The next selector list element*/
65 CRSelector *next ; member in struct:_CRSelector
H A Dcr-attr-sel.h53 CRAttrSel *next ; member in struct:_CRAttrSel
H A Dcr-declaration.h58 /*the next declaration*/
59 CRDeclaration *next ; member in struct:_CRDeclaration
H A Dcr-additional-sel.h61 CRAdditionalSel * next ; member in struct:_CRAdditionalSel
H A Dcr-simple-sel.h102 CRSimpleSel *next ; member in struct:_CRSimpleSel
H A Dcr-prop-list.c30 CRPropList *next; member in struct:_CRPropListPriv
88 cur && PRIVATE (cur) && PRIVATE (cur)->next;
89 cur = PRIVATE (cur)->next) ;
91 PRIVATE (cur)->next = a_to_append;
145 for (cur = a_to_prepend; cur && PRIVATE (cur)->next;
146 cur = PRIVATE (cur)->next) ;
148 PRIVATE (cur)->next = a_this;
279 for (cur = a_this; cur; cur = PRIVATE (cur)->next) {
302 *Gets the next prop/decl pair in the list
304 *Returns the next pro
345 *next = NULL; local
[all...]
H A Dcr-term.h134 *A pointer to the next term,
138 CRTerm *next ; member in struct:_CRTerm
H A Dcr-statement.h212 CRStatement *next ; member in struct:_CRStatement
/inkscape/src/extension/
H A Dtimer.h38 ExpirationTimer * next; member in class:Inkscape::Extension::ExpirationTimer
/inkscape/src/trace/
H A Dpool.h38 * cblock : the index of the next unallocated block (here 7).
39 * next : a pointer to an unused slot inside an allocated bloc
43 unused slots starting at <next>)
45 - insertions and deletions in this list are done at the root <next>.
46 if <next> points to NULL (no slots are availlable) when a draw()
65 next = NULL;
80 if (!next) addblock();
81 void *p = next;
82 next = *(void **)p;
88 *(void **)p = next;
97 void *next; member in class:pool
[all...]
/inkscape/src/ui/tool/
H A Devent-utils.cpp39 // while the next event is also a key notify with the same keyval and mask,
47 // get next
67 // while the next event is also a motion notify
72 GdkEventMotion &next = event_next->motion; local
73 event.send_event = next.send_event;
74 event.time = next.time;
75 event.x = next.x;
76 event.y = next.y;
77 event.state = next.state;
78 event.is_hint = next
[all...]
/inkscape/src/xml/
H A Dnode-iterators.h22 static Node const *next(Node const *node) { function in struct:Inkscape::XML::NodeSiblingIteratorStrategy
23 return ( node ? node->next() : NULL );
28 static Node const *next(Node const *node) { function in struct:Inkscape::XML::NodeParentIteratorStrategy
/inkscape/src/
H A Dmessage-stack.h159 Message *next; member in struct:Inkscape::MessageStack::Message
173 Message *_discard(Message *m); ///< frees a message struct and returns the next such struct in the list
179 MessageId _next_id; ///< the next message id to assign
H A Dmessage-stack.cpp56 for ( ref = &_messages ; *ref ; ref = &(*ref)->next ) {
124 m->next = _messages;
134 Message *next=m->next; local
143 return next;
H A Drubberband.cpp85 Geom::Point next = _desktop->d2w(p); local
89 if (!_points.empty() && Geom::L2(next-_points.back()) > 0.5) {
91 int subdiv = 2 * (int) round(Geom::L2(next-prev) + 0.5);
93 _points.push_back(prev + ((double)i/subdiv) * (next - prev));
96 _points.push_back(next);
H A Dobject-test.h107 SPObject *next = child->getNext(); local
108 SPObject *prev = next;
109 TS_ASSERT(next->getPrev() == child);
110 prev = next;
111 next = next->getNext();
112 while (next != NULL) {
114 TS_ASSERT(next->getPrev() == prev);
115 prev = next;
116 next
[all...]
/inkscape/src/libdepixelize/priv/
H A Dsplines-kopf2011.h73 Point<T> next = (it + 1 == end) ? source.front() : *(it + 1); local
74 Point<T> middle = midpoint(*it, next);
H A Doptimization-kopf2011.h210 Point<T> next = ( j + 1 == ret.size() ) ? ret.front() : ret[j+1] ; local
229 T s = smoothness_energy(prev, guess, next);
234 T prev_e = smoothness_energy(prev, ret[j], next)
/inkscape/src/libnrtype/
H A Dnr-type-primitives.cpp23 NRTDEntry *next; member in struct:NRTDEntry
107 for (tde = td->entries[hval]; tde; tde = tde->next) {
115 tde->next = td->entries[hval];
132 for (tde = td->entries[hval]; tde; tde = tde->next) {
156 nr_tde_free_list[i].next = nr_tde_free_list + i + 1;
158 nr_tde_free_list[i].next = NULL;
162 nr_tde_free_list = tde->next;
/inkscape/cxxtest/cxxtest/
H A DDummyDescriptions.cpp15 TestDescription *DummyTestDescription::next() { return 0; } function in class:CxxTest::DummyTestDescription
16 const TestDescription *DummyTestDescription::next() const { return 0; } function in class:CxxTest::DummyTestDescription
26 SuiteDescription *DummySuiteDescription::next() { return 0; } function in class:CxxTest::DummySuiteDescription
28 const SuiteDescription *DummySuiteDescription::next() const { return 0; } function in class:CxxTest::DummySuiteDescription
H A DLinkedList.cpp20 l = l->next();
28 l = l->next();
56 for ( const Link *l = head(); l != 0; l = l->next() )
65 l = l->next();
77 for ( Link *l = head(); l != 0; l = l->next() )
113 Link * Link::next() function in class:CxxTest::Link
129 const Link * Link::next() const function in class:CxxTest::Link
H A DRealDescriptions.cpp89 TestDescription *RealTestDescription::next() { return (RealTestDescription *)Link::next(); } function in class:CxxTest::RealTestDescription
90 const TestDescription *RealTestDescription::next() const { return (const RealTestDescription *)Link::next(); } function in class:CxxTest::RealTestDescription
129 SuiteDescription *RealSuiteDescription::next() { return (RealSuiteDescription *)Link::next(); } function in class:CxxTest::RealSuiteDescription
130 const SuiteDescription *RealSuiteDescription::next() const { return (const RealSuiteDescription *)Link::next(); } function in class:CxxTest::RealSuiteDescription
146 for ( TestDescription *td = firstTest(); td != 0; td = td->next() ) {
221 for ( const SuiteDescription *sd = firstSuite(); sd != 0; sd = sd->next() )
[all...]
/inkscape/src/livarot/
H A Dint-line.h28 int next; member in struct:int_ligne_bord
/inkscape/src/util/
H A Dlist.h27 : value(v), next(n) {}
30 ListCell *next; member in struct:Inkscape::Util::ListCell
64 explicit List(const_reference value, List const &next=List()) argument
65 : _cell(new ListCell<T>(value, next._cell)) {}
80 this->_cell = this->_cell->next;
85 this->_cell = this->_cell->next;
128 explicit List(const_reference value, List const &next=List()) argument
129 : List<T const>(value, next) {}
135 this->_cell = this->_cell->next;
140 this->_cell = this->_cell->next;
161 List(const_reference value, List const &next=List()) argument
209 MutableList(typename List<T>::const_reference value, MutableList const &next=MutableList()) argument
[all...]
/inkscape/src/extension/internal/pdfinput/
H A Dpdf-parser.h101 OpHistoryEntry *next; // next entry on stack member in struct:OpHistoryEntry

Completed in 146 milliseconds

123