Searched refs:next (Results 1 - 25 of 204) sorted by relevance

123456789

/inkscape/src/extension/
H A Dtimer.cpp42 next = this;
45 next = timer_list->next;
46 timer_list->next = this;
69 if (this != next) {
74 prev->next != this;
75 prev = prev->next){};
76 prev->next = next;
79 idle_start = next;
[all...]
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/xml/
H A Drepr-action-test.h71 TS_ASSERT_EQUALS(a->next() , b);
72 TS_ASSERT_EQUALS(b->next() , c);
73 TS_ASSERT_EQUALS(c->next() , null_ptr);
76 TS_ASSERT_EQUALS(a->next() , c);
77 TS_ASSERT_EQUALS(b->next() , null_ptr);
78 TS_ASSERT_EQUALS(c->next() , b);
81 TS_ASSERT_EQUALS(a->next() , b);
82 TS_ASSERT_EQUALS(b->next() , c);
83 TS_ASSERT_EQUALS(c->next() , null_ptr);
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
H A Devent.h63 * @brief Pointer to the next event in the event chain
68 Event *next; member in class:Inkscape::XML::Event
83 static Event const *next(Event const *action) { function in struct:Inkscape::XML::Event::IteratorStrategy
84 return action->next;
92 * @brief If possible, combine this event with the next to reduce memory use
116 : next(n), serial(_next_serial++), repr(r) {}
131 EventAdd(Node *repr, Node *c, Node *rr, Event *next) argument
132 : Event(repr, next), child(c), ref(rr) {}
150 EventDel(Node *repr, Node *c, Node *rr, Event *next) argument
151 : Event(repr, next), chil
169 EventChgAttr(Node *repr, GQuark k, Inkscape::Util::ptr_shared<char> ov, Inkscape::Util::ptr_shared<char> nv, Event *next) argument
194 EventChgContent(Node *repr, Inkscape::Util::ptr_shared<char> ov, Inkscape::Util::ptr_shared<char> nv, Event *next) argument
216 EventChgOrder(Node *repr, Node *c, Node *orr, Node *nrr, Event *next) argument
[all...]
H A Dnode-fns.h30 * @brief Get the next node in sibling order
32 * @return The next node in sibling order
36 return ( node ? node->next() : NULL );
39 return ( node ? node->next() : NULL );
47 * This method, unlike Node::next(), is a linear search over the children of @c node's parent.
H A Devent.cpp130 for ( Event const *action = log ; action ; action = action->next ) {
254 for ( action = b ; action->next ; action = action->next ) {
255 prev_ptr = &action->next;
259 action->next = a;
273 log = action->next;
295 Opposite *opposite=dynamic_cast<Opposite *>(action->next);
306 Inkscape::XML::Event *remaining=opposite->next;
327 Inkscape::XML::EventChgAttr *chg_attr=dynamic_cast<Inkscape::XML::EventChgAttr *>(this->next);
338 this->next
[all...]
/inkscape/src/libcroco/
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-selector.c88 for (cur = a_this; cur && cur->next; cur = cur->next) ;
90 cur->next = a_new;
111 a_new->next = a_this;
153 for (cur = a_this; cur; cur = cur->next) {
270 for (cur = a_this; cur && cur->next; cur = cur->next) {
290 /*walk backward the list and free each "next element" */
292 if (cur->next) {
293 g_free (cur->next);
[all...]
H A Dcr-attr-sel.c69 cur_sel->next;
70 cur_sel = cur_sel->next) ;
72 cur_sel->next = a_attr_sel;
94 a_attr_sel->next = a_this;
118 for (cur = a_this; cur; cur = cur->next) {
225 if (a_this->next) {
226 cr_attr_sel_destroy (a_this->next);
227 a_this->next = NULL;
H A Dcr-declaration.c306 for (cur = a_this; cur && cur->next; cur = cur->next) ;
308 cur->next = a_new;
334 g_return_val_if_fail (a_decl->prev->next == a_decl, NULL);
337 if (a_decl->next) {
338 g_return_val_if_fail (a_decl->next->prev == a_decl, NULL);
345 a_decl->prev->next = a_decl->next;
347 if (a_decl->next) {
348 a_decl->next
[all...]
H A Dcr-simple-sel.c70 for (cur = a_this; cur->next; cur = cur->next) ;
72 cur->next = a_sel;
96 a_sel->next = a_this;
113 for (cur = a_this; cur; cur = cur->next) {
256 for (cur_sel = a_this; cur_sel; cur_sel = cur_sel->next) {
273 cur_add_sel; cur_add_sel = cur_add_sel->next) {
301 *#CRSimpleSel. Recursively calls the destructor of #CRSimpleSel->next
318 if (a_this->next) {
319 cr_simple_sel_destroy (a_this->next);
[all...]
H A Dcr-attr-sel.h53 CRAttrSel *next ; member in struct:_CRAttrSel
/inkscape/cxxtest/cxxtest/
H A DDummyDescriptions.h25 TestDescription *next();
26 const TestDescription *next() const;
40 SuiteDescription *next();
42 const SuiteDescription *next() const;
H A DDescriptions.h27 virtual const TestDescription *next() const = 0;
28 virtual TestDescription *next() = 0;
46 virtual SuiteDescription *next() = 0;
47 virtual const SuiteDescription *next() const = 0;
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.h43 Link *next();
45 const Link *next() const;
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...]
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
/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/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/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/src/svg/
H A Dsvg-length.cpp23 static unsigned sp_svg_length_read_lff(gchar const *str, SVGLength::Unit *unit, float *val, float *computed, char **next);
264 char *next = (char *) str;
267 while (sp_svg_length_read_lff(next, &unit, &value, &computed, &next)) {
273 while (next && *next &&
274 (*next == ',' || *next == ' ' || *next == '\n' || *next
[all...]
/inkscape/src/
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...]

Completed in 2637 milliseconds

123456789