+/*
+ * CINELERRA
+ * Copyright (C) 2008 Adam Williams <broadcast at earthling dot net>
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ */
+
+
#ifndef LINKLIST_H
#define LINKLIST_H
TYPE *previous, *next;
List<TYPE> *list;
- int get_item_number() { return !list ? -1 : list->number_of(this); }
+ int get_item_number() { return !list ? -1 : list->number_of((TYPE*)this); }
ListItem() { list = 0; previous = next = 0; }
- ListItem(List<TYPE> &me) { list = me; previous = next = 0; }
+ ListItem(List<TYPE> *me) { list = me; previous = next = 0; }
virtual ~ListItem() { if( list ) list->remove_pointer(this); }
};
void remove_pointer(ListItem<TYPE> *item);
TYPE *append(TYPE *new_item);
TYPE *append() { return append(new TYPE()); }
+ void destroy() { while(last) delete last; }
TYPE *insert_before(TYPE *here, TYPE *item);
TYPE *insert_before(TYPE *here) { return insert_before(here, new TYPE()); }
TYPE *insert_after(TYPE *here, TYPE *item);
void swap(TYPE *item1, TYPE *item2);
void sort(TYPE *ap=0, TYPE *bp=0) { return sort(cmpr,ap,bp); }
void sort(int (*cmp)(TYPE *a, TYPE *b), TYPE *ap=0, TYPE *bp=0);
+ void concat(List<TYPE> &b);
List() { first = last = 0; }
- virtual ~List() { while(last) delete last; }
+ virtual ~List() { destroy(); }
};
// convenience macros
}
}
+template<class TYPE>
+void List<TYPE>::concat(List<TYPE> &b)
+{
+ if( !b.first ) return;
+ *(last ? &last->next : &first) = b.first;
+ b.first->previous = last; last = b.last;
+ TYPE *bp = b.first; b.first = b.last = 0;
+ while( bp ) { bp->list = this; bp = bp->next; }
+}
+
#endif