]> git.saurik.com Git - wxWidgets.git/blame_incremental - include/wx/list.h
projects / wxWidgets.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
Compilation fix after r62754.
[wxWidgets.git] / include / wx / list.h
... / ...
CommitLineData
1/////////////////////////////////////////////////////////////////////////////
2// Name: wx/list.h
3// Purpose: wxList, wxStringList classes
4// Author: Julian Smart
5// Modified by: VZ at 16/11/98: WX_DECLARE_LIST() and typesafe lists added
6// Created: 29/01/98
7// RCS-ID: $Id$
8// Copyright: (c) 1998 Julian Smart
9// Licence: wxWindows licence
10/////////////////////////////////////////////////////////////////////////////
11
12/*
13 All this is quite ugly but serves two purposes:
14 1. Be almost 100% compatible with old, untyped, wxList class
15 2. Ensure compile-time type checking for the linked lists
16
17 The idea is to have one base class (wxListBase) working with "void *" data,
18 but to hide these untyped functions - i.e. make them protected, so they
19 can only be used from derived classes which have inline member functions
20 working with right types. This achieves the 2nd goal. As for the first one,
21 we provide a special derivation of wxListBase called wxList which looks just
22 like the old class.
23*/
24
25#ifndef _WX_LIST_H_
26#define _WX_LIST_H_
27
28// -----------------------------------------------------------------------------
29// headers
30// -----------------------------------------------------------------------------
31
32#include "wx/defs.h"
33#include "wx/object.h"
34#include "wx/string.h"
35
36#if wxUSE_STL
37 #include "wx/beforestd.h"
38 #include <algorithm>
39 #include <iterator>
40 #include <list>
41 #include "wx/afterstd.h"
42#endif
43
44// ----------------------------------------------------------------------------
45// types
46// ----------------------------------------------------------------------------
47
48class WXDLLIMPEXP_FWD_BASE wxObjectListNode;
49typedef wxObjectListNode wxNode;
50
51#if wxUSE_STL
52
53#define wxLIST_COMPATIBILITY
54
55#define WX_DECLARE_LIST_3(elT, dummy1, liT, dummy2, decl) \
56 WX_DECLARE_LIST_WITH_DECL(elT, liT, decl)
57#define WX_DECLARE_LIST_PTR_3(elT, dummy1, liT, dummy2, decl) \
58 WX_DECLARE_LIST_3(elT, dummy1, liT, dummy2, decl)
59
60#define WX_DECLARE_LIST_2(elT, liT, dummy, decl) \
61 WX_DECLARE_LIST_WITH_DECL(elT, liT, decl)
62#define WX_DECLARE_LIST_PTR_2(elT, liT, dummy, decl) \
63 WX_DECLARE_LIST_2(elT, liT, dummy, decl) \
64
65#define WX_DECLARE_LIST_WITH_DECL(elT, liT, decl) \
66 WX_DECLARE_LIST_XO(elT*, liT, decl)
67
68#if !defined(__VISUALC__) || __VISUALC__ >= 1300 // == !VC6
69
70template<class T>
71class wxList_SortFunction
72{
73public:
74 wxList_SortFunction(wxSortCompareFunction f) : m_f(f) { }
75 bool operator()(const T& i1, const T& i2)
76 { return m_f((T*)&i1, (T*)&i2) < 0; }
77private:
78 wxSortCompareFunction m_f;
79};
80
81#define WX_LIST_SORTFUNCTION( elT, f ) wxList_SortFunction<elT>(f)
82#define WX_LIST_VC6_WORKAROUND(elT, liT, decl)
83
84#else // if defined( __VISUALC__ ) && __VISUALC__ < 1300 // == VC6
85
86#define WX_LIST_SORTFUNCTION( elT, f ) std::greater<elT>( f )
87#define WX_LIST_VC6_WORKAROUND(elT, liT, decl) \
88 decl liT; \
89 \
90 /* Workaround for broken VC6 STL incorrectly requires a std::greater<> */ \
91 /* to be passed into std::list::sort() */ \
92 template <> \
93 struct std::greater<elT> \
94 { \
95 private: \
96 wxSortCompareFunction m_CompFunc; \
97 public: \
98 greater( wxSortCompareFunction compfunc = NULL ) \
99 : m_CompFunc( compfunc ) {} \
100 bool operator()(const elT X, const elT Y) const \
101 { \
102 return m_CompFunc ? \
103 ( m_CompFunc( wxListCastElementToVoidPtr(X), \
104 wxListCastElementToVoidPtr(Y) ) < 0 ) : \
105 ( X > Y ); \
106 } \
107 };
108
109// helper for std::greater<elT> above:
110template<typename T>
111inline const void *wxListCastElementToVoidPtr(const T* ptr) { return ptr; }
112inline const void *wxListCastElementToVoidPtr(const wxString& str)
113 { return (const char*)str; }
114
115#endif // VC6/!VC6
116
117/*
118 Note 1: the outer helper class _WX_LIST_HELPER_##liT below is a workaround
119 for mingw 3.2.3 compiler bug that prevents a static function of liT class
120 from being exported into dll. A minimal code snippet reproducing the bug:
121
122 struct WXDLLIMPEXP_CORE Foo
123 {
124 static void Bar();
125 struct SomeInnerClass
126 {
127 friend class Foo; // comment this out to make it link
128 };
129 ~Foo()
130 {
131 Bar();
132 }
133 };
134
135 The program does not link under mingw_gcc 3.2.3 producing undefined
136 reference to Foo::Bar() function
137
138
139 Note 2: the EmptyList is needed to allow having a NULL pointer-like
140 invalid iterator. We used to use just an uninitialized iterator object
141 instead but this fails with some debug/checked versions of STL, notably the
142 glibc version activated with _GLIBCXX_DEBUG, so we need to have a separate
143 invalid iterator.
144 */
145
146// the real wxList-class declaration
147#define WX_DECLARE_LIST_XO(elT, liT, decl) \
148 decl _WX_LIST_HELPER_##liT \
149 { \
150 typedef elT _WX_LIST_ITEM_TYPE_##liT; \
151 public: \
152 static void DeleteFunction( _WX_LIST_ITEM_TYPE_##liT X ); \
153 }; \
154 \
155 WX_LIST_VC6_WORKAROUND(elT, liT, decl) \
156 decl liT : public std::list<elT> \
157 { \
158 private: \
159 typedef std::list<elT> BaseListType; \
160 static BaseListType EmptyList; \
161 \
162 bool m_destroy; \
163 \
164 public: \
165 decl compatibility_iterator \
166 { \
167 private: \
168 /* Workaround for broken VC6 nested class name resolution */ \
169 typedef std::list<elT>::iterator iterator; \
170 friend class liT; \
171 \
172 iterator m_iter; \
173 liT * m_list; \
174 \
175 public: \
176 compatibility_iterator() \
177 : m_iter(EmptyList.end()), m_list( NULL ) {} \
178 compatibility_iterator( liT* li, iterator i ) \
179 : m_iter( i ), m_list( li ) {} \
180 compatibility_iterator( const liT* li, iterator i ) \
181 : m_iter( i ), m_list( const_cast< liT* >( li ) ) {} \
182 \
183 compatibility_iterator* operator->() { return this; } \
184 const compatibility_iterator* operator->() const { return this; } \
185 \
186 bool operator==(const compatibility_iterator& i) const \
187 { \
188 wxASSERT_MSG( m_list && i.m_list, \
189 wxT("comparing invalid iterators is illegal") ); \
190 return (m_list == i.m_list) && (m_iter == i.m_iter); \
191 } \
192 bool operator!=(const compatibility_iterator& i) const \
193 { return !( operator==( i ) ); } \
194 operator bool() const \
195 { return m_list ? m_iter != m_list->end() : false; } \
196 bool operator !() const \
197 { return !( operator bool() ); } \
198 \
199 elT GetData() const \
200 { return *m_iter; } \
201 void SetData( elT e ) \
202 { *m_iter = e; } \
203 \
204 compatibility_iterator GetNext() const \
205 { \
206 iterator i = m_iter; \
207 return compatibility_iterator( m_list, ++i ); \
208 } \
209 compatibility_iterator GetPrevious() const \
210 { \
211 if ( m_iter == m_list->begin() ) \
212 return compatibility_iterator(); \
213 \
214 iterator i = m_iter; \
215 return compatibility_iterator( m_list, --i ); \
216 } \
217 int IndexOf() const \
218 { \
219 return *this ? std::distance( m_list->begin(), m_iter ) \
220 : wxNOT_FOUND; \
221 } \
222 }; \
223 public: \
224 liT() : m_destroy( false ) {} \
225 \
226 compatibility_iterator Find( const elT e ) const \
227 { \
228 liT* _this = const_cast< liT* >( this ); \
229 return compatibility_iterator( _this, \
230 std::find( _this->begin(), _this->end(), e ) ); \
231 } \
232 \
233 bool IsEmpty() const \
234 { return empty(); } \
235 size_t GetCount() const \
236 { return size(); } \
237 int Number() const \
238 { return static_cast< int >( GetCount() ); } \
239 \
240 compatibility_iterator Item( size_t idx ) const \
241 { \
242 iterator i = const_cast< liT* >(this)->begin(); \
243 std::advance( i, idx ); \
244 return compatibility_iterator( this, i ); \
245 } \
246 elT operator[](size_t idx) const \
247 { \
248 return Item(idx).GetData(); \
249 } \
250 \
251 compatibility_iterator GetFirst() const \
252 { \
253 return compatibility_iterator( this, \
254 const_cast< liT* >(this)->begin() ); \
255 } \
256 compatibility_iterator GetLast() const \
257 { \
258 iterator i = const_cast< liT* >(this)->end(); \
259 return compatibility_iterator( this, !empty() ? --i : i ); \
260 } \
261 bool Member( elT e ) const \
262 { return Find( e ); } \
263 compatibility_iterator Nth( int n ) const \
264 { return Item( n ); } \
265 int IndexOf( elT e ) const \
266 { return Find( e ).IndexOf(); } \
267 \
268 compatibility_iterator Append( elT e ) \
269 { \
270 push_back( e ); \
271 return GetLast(); \
272 } \
273 compatibility_iterator Insert( elT e ) \
274 { \
275 push_front( e ); \
276 return compatibility_iterator( this, begin() ); \
277 } \
278 compatibility_iterator Insert(const compatibility_iterator & i, elT e)\
279 { \
280 return compatibility_iterator( this, insert( i.m_iter, e ) ); \
281 } \
282 compatibility_iterator Insert( size_t idx, elT e ) \
283 { \
284 return compatibility_iterator( this, \
285 insert( Item( idx ).m_iter, e ) ); \
286 } \
287 \
288 void DeleteContents( bool destroy ) \
289 { m_destroy = destroy; } \
290 bool GetDeleteContents() const \
291 { return m_destroy; } \
292 void Erase( const compatibility_iterator& i ) \
293 { \
294 if ( m_destroy ) \
295 _WX_LIST_HELPER_##liT::DeleteFunction( i->GetData() ); \
296 erase( i.m_iter ); \
297 } \
298 bool DeleteNode( const compatibility_iterator& i ) \
299 { \
300 if( i ) \
301 { \
302 Erase( i ); \
303 return true; \
304 } \
305 return false; \
306 } \
307 bool DeleteObject( elT e ) \
308 { \
309 return DeleteNode( Find( e ) ); \
310 } \
311 void Clear() \
312 { \
313 if ( m_destroy ) \
314 std::for_each( begin(), end(), \
315 _WX_LIST_HELPER_##liT::DeleteFunction ); \
316 clear(); \
317 } \
318 /* Workaround for broken VC6 std::list::sort() see above */ \
319 void Sort( wxSortCompareFunction compfunc ) \
320 { sort( WX_LIST_SORTFUNCTION( elT, compfunc ) ); } \
321 ~liT() { Clear(); } \
322 \
323 /* It needs access to our EmptyList */ \
324 friend class compatibility_iterator; \
325 }
326
327#define WX_DECLARE_LIST(elementtype, listname) \
328 WX_DECLARE_LIST_WITH_DECL(elementtype, listname, class)
329#define WX_DECLARE_LIST_PTR(elementtype, listname) \
330 WX_DECLARE_LIST(elementtype, listname)
331
332#define WX_DECLARE_EXPORTED_LIST(elementtype, listname) \
333 WX_DECLARE_LIST_WITH_DECL(elementtype, listname, class WXDLLIMPEXP_CORE)
334#define WX_DECLARE_EXPORTED_LIST_PTR(elementtype, listname) \
335 WX_DECLARE_EXPORTED_LIST(elementtype, listname)
336
337#define WX_DECLARE_USER_EXPORTED_LIST(elementtype, listname, usergoo) \
338 WX_DECLARE_LIST_WITH_DECL(elementtype, listname, class usergoo)
339#define WX_DECLARE_USER_EXPORTED_LIST_PTR(elementtype, listname, usergoo) \
340 WX_DECLARE_USER_EXPORTED_LIST(elementtype, listname, usergoo)
341
342// this macro must be inserted in your program after
343// #include "wx/listimpl.cpp"
344#define WX_DEFINE_LIST(name) "don't forget to include listimpl.cpp!"
345
346#define WX_DEFINE_EXPORTED_LIST(name) WX_DEFINE_LIST(name)
347#define WX_DEFINE_USER_EXPORTED_LIST(name) WX_DEFINE_LIST(name)
348
349#else // if !wxUSE_STL
350
351
352// undef it to get rid of old, deprecated functions
353#define wxLIST_COMPATIBILITY
354
355// -----------------------------------------------------------------------------
356// key stuff: a list may be optionally keyed on integer or string key
357// -----------------------------------------------------------------------------
358
359union wxListKeyValue
360{
361 long integer;
362 wxString *string;
363};
364
365// a struct which may contain both types of keys
366//
367// implementation note: on one hand, this class allows to have only one function
368// for any keyed operation instead of 2 almost equivalent. OTOH, it's needed to
369// resolve ambiguity which we would otherwise have with wxStringList::Find() and
370// wxList::Find(const char *).
371class WXDLLIMPEXP_BASE wxListKey
372{
373public:
374 // implicit ctors
375 wxListKey() : m_keyType(wxKEY_NONE)
376 { }
377 wxListKey(long i) : m_keyType(wxKEY_INTEGER)
378 { m_key.integer = i; }
379 wxListKey(const wxString& s) : m_keyType(wxKEY_STRING)
380 { m_key.string = new wxString(s); }
381 wxListKey(const char *s) : m_keyType(wxKEY_STRING)
382 { m_key.string = new wxString(s); }
383 wxListKey(const wchar_t *s) : m_keyType(wxKEY_STRING)
384 { m_key.string = new wxString(s); }
385
386 // accessors
387 wxKeyType GetKeyType() const { return m_keyType; }
388 const wxString GetString() const
389 { wxASSERT( m_keyType == wxKEY_STRING ); return *m_key.string; }
390 long GetNumber() const
391 { wxASSERT( m_keyType == wxKEY_INTEGER ); return m_key.integer; }
392
393 // comparison
394 // Note: implementation moved to list.cpp to prevent BC++ inline
395 // expansion warning.
396 bool operator==(wxListKeyValue value) const ;
397
398 // dtor
399 ~wxListKey()
400 {
401 if ( m_keyType == wxKEY_STRING )
402 delete m_key.string;
403 }
404
405private:
406 wxKeyType m_keyType;
407 wxListKeyValue m_key;
408};
409
410// -----------------------------------------------------------------------------
411// wxNodeBase class is a (base for) node in a double linked list
412// -----------------------------------------------------------------------------
413
414extern WXDLLIMPEXP_DATA_BASE(wxListKey) wxDefaultListKey;
415
416class WXDLLIMPEXP_FWD_BASE wxListBase;
417
418class WXDLLIMPEXP_BASE wxNodeBase
419{
420friend class wxListBase;
421public:
422 // ctor
423 wxNodeBase(wxListBase *list = NULL,
424 wxNodeBase *previous = NULL,
425 wxNodeBase *next = NULL,
426 void *data = NULL,
427 const wxListKey& key = wxDefaultListKey);
428
429 virtual ~wxNodeBase();
430
431 // FIXME no check is done that the list is really keyed on strings
432 wxString GetKeyString() const { return *m_key.string; }
433 long GetKeyInteger() const { return m_key.integer; }
434
435 // Necessary for some existing code
436 void SetKeyString(const wxString& s) { m_key.string = new wxString(s); }
437 void SetKeyInteger(long i) { m_key.integer = i; }
438
439#ifdef wxLIST_COMPATIBILITY
440 // compatibility methods, use Get* instead.
441 wxDEPRECATED( wxNode *Next() const );
442 wxDEPRECATED( wxNode *Previous() const );
443 wxDEPRECATED( wxObject *Data() const );
444#endif // wxLIST_COMPATIBILITY
445
446protected:
447 // all these are going to be "overloaded" in the derived classes
448 wxNodeBase *GetNext() const { return m_next; }
449 wxNodeBase *GetPrevious() const { return m_previous; }
450
451 void *GetData() const { return m_data; }
452 void SetData(void *data) { m_data = data; }
453
454 // get 0-based index of this node within the list or wxNOT_FOUND
455 int IndexOf() const;
456
457 virtual void DeleteData() { }
458public:
459 // for wxList::iterator
460 void** GetDataPtr() const { return &(const_cast<wxNodeBase*>(this)->m_data); }
461private:
462 // optional key stuff
463 wxListKeyValue m_key;
464
465 void *m_data; // user data
466 wxNodeBase *m_next, // next and previous nodes in the list
467 *m_previous;
468
469 wxListBase *m_list; // list we belong to
470
471 wxDECLARE_NO_COPY_CLASS(wxNodeBase);
472};
473
474// -----------------------------------------------------------------------------
475// a double-linked list class
476// -----------------------------------------------------------------------------
477
478class WXDLLIMPEXP_FWD_BASE wxList;
479
480class WXDLLIMPEXP_BASE wxListBase
481{
482friend class wxNodeBase; // should be able to call DetachNode()
483friend class wxHashTableBase; // should be able to call untyped Find()
484
485public:
486 // default ctor & dtor
487 wxListBase(wxKeyType keyType = wxKEY_NONE)
488 { Init(keyType); }
489 virtual ~wxListBase();
490
491 // accessors
492 // count of items in the list
493 size_t GetCount() const { return m_count; }
494
495 // return true if this list is empty
496 bool IsEmpty() const { return m_count == 0; }
497
498 // operations
499
500 // delete all nodes
501 void Clear();
502
503 // instruct it to destroy user data when deleting nodes
504 void DeleteContents(bool destroy) { m_destroy = destroy; }
505
506 // query if to delete
507 bool GetDeleteContents() const
508 { return m_destroy; }
509
510 // get the keytype
511 wxKeyType GetKeyType() const
512 { return m_keyType; }
513
514 // set the keytype (required by the serial code)
515 void SetKeyType(wxKeyType keyType)
516 { wxASSERT( m_count==0 ); m_keyType = keyType; }
517
518#ifdef wxLIST_COMPATIBILITY
519 // compatibility methods from old wxList
520 wxDEPRECATED( int Number() const ); // use GetCount instead.
521 wxDEPRECATED( wxNode *First() const ); // use GetFirst
522 wxDEPRECATED( wxNode *Last() const ); // use GetLast
523 wxDEPRECATED( wxNode *Nth(size_t n) const ); // use Item
524
525 // kludge for typesafe list migration in core classes.
526 wxDEPRECATED( operator wxList&() const );
527#endif // wxLIST_COMPATIBILITY
528
529protected:
530
531 // all methods here are "overloaded" in derived classes to provide compile
532 // time type checking
533
534 // create a node for the list of this type
535 virtual wxNodeBase *CreateNode(wxNodeBase *prev, wxNodeBase *next,
536 void *data,
537 const wxListKey& key = wxDefaultListKey) = 0;
538
539
540 // ctors
541 // from an array
542 wxListBase(size_t count, void *elements[]);
543 // from a sequence of objects
544 wxListBase(void *object, ... /* terminate with NULL */);
545
546protected:
547 void Assign(const wxListBase& list)
548 { Clear(); DoCopy(list); }
549
550 // get list head/tail
551 wxNodeBase *GetFirst() const { return m_nodeFirst; }
552 wxNodeBase *GetLast() const { return m_nodeLast; }
553
554 // by (0-based) index
555 wxNodeBase *Item(size_t index) const;
556
557 // get the list item's data
558 void *operator[](size_t n) const
559 {
560 wxNodeBase *node = Item(n);
561
562 return node ? node->GetData() : NULL;
563 }
564
565 // operations
566 // append to end of list
567 wxNodeBase *Prepend(void *object)
568 { return (wxNodeBase *)wxListBase::Insert(object); }
569 // append to beginning of list
570 wxNodeBase *Append(void *object);
571 // insert a new item at the beginning of the list
572 wxNodeBase *Insert(void *object)
573 { return Insert(static_cast<wxNodeBase *>(NULL), object); }
574 // insert a new item at the given position
575 wxNodeBase *Insert(size_t pos, void *object)
576 { return pos == GetCount() ? Append(object)
577 : Insert(Item(pos), object); }
578 // insert before given node or at front of list if prev == NULL
579 wxNodeBase *Insert(wxNodeBase *prev, void *object);
580
581 // keyed append
582 wxNodeBase *Append(long key, void *object);
583 wxNodeBase *Append(const wxString& key, void *object);
584
585 // removes node from the list but doesn't delete it (returns pointer
586 // to the node or NULL if it wasn't found in the list)
587 wxNodeBase *DetachNode(wxNodeBase *node);
588 // delete element from list, returns false if node not found
589 bool DeleteNode(wxNodeBase *node);
590 // finds object pointer and deletes node (and object if DeleteContents
591 // is on), returns false if object not found
592 bool DeleteObject(void *object);
593
594 // search (all return NULL if item not found)
595 // by data
596 wxNodeBase *Find(const void *object) const;
597
598 // by key
599 wxNodeBase *Find(const wxListKey& key) const;
600
601 // get 0-based index of object or wxNOT_FOUND
602 int IndexOf( void *object ) const;
603
604 // this function allows the sorting of arbitrary lists by giving
605 // a function to compare two list elements. The list is sorted in place.
606 void Sort(const wxSortCompareFunction compfunc);
607
608 // functions for iterating over the list
609 void *FirstThat(wxListIterateFunction func);
610 void ForEach(wxListIterateFunction func);
611 void *LastThat(wxListIterateFunction func);
612
613 // for STL interface, "last" points to one after the last node
614 // of the controlled sequence (NULL for the end of the list)
615 void Reverse();
616 void DeleteNodes(wxNodeBase* first, wxNodeBase* last);
617private:
618
619 // common part of all ctors
620 void Init(wxKeyType keyType = wxKEY_NONE);
621
622 // helpers
623 // common part of copy ctor and assignment operator
624 void DoCopy(const wxListBase& list);
625 // common part of all Append()s
626 wxNodeBase *AppendCommon(wxNodeBase *node);
627 // free node's data and node itself
628 void DoDeleteNode(wxNodeBase *node);
629
630 size_t m_count; // number of elements in the list
631 bool m_destroy; // destroy user data when deleting list items?
632 wxNodeBase *m_nodeFirst, // pointers to the head and tail of the list
633 *m_nodeLast;
634
635 wxKeyType m_keyType; // type of our keys (may be wxKEY_NONE)
636};
637
638// -----------------------------------------------------------------------------
639// macros for definition of "template" list type
640// -----------------------------------------------------------------------------
641
642// and now some heavy magic...
643
644// declare a list type named 'name' and containing elements of type 'T *'
645// (as a by product of macro expansion you also get wx##name##Node
646// wxNode-derived type)
647//
648// implementation details:
649// 1. We define _WX_LIST_ITEM_TYPE_##name typedef to save in it the item type
650// for the list of given type - this allows us to pass only the list name
651// to WX_DEFINE_LIST() even if it needs both the name and the type
652//
653// 2. We redefine all non-type-safe wxList functions with type-safe versions
654// which don't take any space (everything is inline), but bring compile
655// time error checking.
656//
657// 3. The macro which is usually used (WX_DECLARE_LIST) is defined in terms of
658// a more generic WX_DECLARE_LIST_2 macro which, in turn, uses the most
659// generic WX_DECLARE_LIST_3 one. The last macro adds a sometimes
660// interesting capability to store polymorphic objects in the list and is
661// particularly useful with, for example, "wxWindow *" list where the
662// wxWindowBase pointers are put into the list, but wxWindow pointers are
663// retrieved from it.
664//
665// 4. final hack is that WX_DECLARE_LIST_3 is defined in terms of
666// WX_DECLARE_LIST_4 to allow defining classes without operator->() as
667// it results in compiler warnings when this operator doesn't make sense
668// (i.e. stored elements are not pointers)
669
670// common part of WX_DECLARE_LIST_3 and WX_DECLARE_LIST_PTR_3
671#define WX_DECLARE_LIST_4(T, Tbase, name, nodetype, classexp, ptrop) \
672 typedef int (*wxSortFuncFor_##name)(const T **, const T **); \
673 \
674 classexp nodetype : public wxNodeBase \
675 { \
676 public: \
677 nodetype(wxListBase *list = NULL, \
678 nodetype *previous = NULL, \
679 nodetype *next = NULL, \
680 T *data = NULL, \
681 const wxListKey& key = wxDefaultListKey) \
682 : wxNodeBase(list, previous, next, data, key) { } \
683 \
684 nodetype *GetNext() const \
685 { return (nodetype *)wxNodeBase::GetNext(); } \
686 nodetype *GetPrevious() const \
687 { return (nodetype *)wxNodeBase::GetPrevious(); } \
688 \
689 T *GetData() const \
690 { return (T *)wxNodeBase::GetData(); } \
691 void SetData(T *data) \
692 { wxNodeBase::SetData(data); } \
693 \
694 protected: \
695 virtual void DeleteData(); \
696 \
697 DECLARE_NO_COPY_CLASS(nodetype) \
698 }; \
699 \
700 classexp name : public wxListBase \
701 { \
702 public: \
703 typedef nodetype Node; \
704 classexp compatibility_iterator \
705 { \
706 public: \
707 compatibility_iterator(Node *ptr = NULL) : m_ptr(ptr) { } \
708 \
709 Node *operator->() const { return m_ptr; } \
710 operator Node *() const { return m_ptr; } \
711 \
712 private: \
713 Node *m_ptr; \
714 }; \
715 \
716 name(wxKeyType keyType = wxKEY_NONE) : wxListBase(keyType) \
717 { } \
718 name(const name& list) : wxListBase(list.GetKeyType()) \
719 { Assign(list); } \
720 name(size_t count, T *elements[]) \
721 : wxListBase(count, (void **)elements) { } \
722 \
723 name& operator=(const name& list) \
724 { if (&list != this) Assign(list); return *this; } \
725 \
726 nodetype *GetFirst() const \
727 { return (nodetype *)wxListBase::GetFirst(); } \
728 nodetype *GetLast() const \
729 { return (nodetype *)wxListBase::GetLast(); } \
730 \
731 nodetype *Item(size_t index) const \
732 { return (nodetype *)wxListBase::Item(index); } \
733 \
734 T *operator[](size_t index) const \
735 { \
736 nodetype *node = Item(index); \
737 return node ? (T*)(node->GetData()) : NULL; \
738 } \
739 \
740 nodetype *Append(Tbase *object) \
741 { return (nodetype *)wxListBase::Append(object); } \
742 nodetype *Insert(Tbase *object) \
743 { return (nodetype *)Insert(static_cast<nodetype *>(NULL), \
744 object); } \
745 nodetype *Insert(size_t pos, Tbase *object) \
746 { return (nodetype *)wxListBase::Insert(pos, object); } \
747 nodetype *Insert(nodetype *prev, Tbase *object) \
748 { return (nodetype *)wxListBase::Insert(prev, object); } \
749 \
750 nodetype *Append(long key, void *object) \
751 { return (nodetype *)wxListBase::Append(key, object); } \
752 nodetype *Append(const wxChar *key, void *object) \
753 { return (nodetype *)wxListBase::Append(key, object); } \
754 \
755 nodetype *DetachNode(nodetype *node) \
756 { return (nodetype *)wxListBase::DetachNode(node); } \
757 bool DeleteNode(nodetype *node) \
758 { return wxListBase::DeleteNode(node); } \
759 bool DeleteObject(Tbase *object) \
760 { return wxListBase::DeleteObject(object); } \
761 void Erase(nodetype *it) \
762 { DeleteNode(it); } \
763 \
764 nodetype *Find(const Tbase *object) const \
765 { return (nodetype *)wxListBase::Find(object); } \
766 \
767 virtual nodetype *Find(const wxListKey& key) const \
768 { return (nodetype *)wxListBase::Find(key); } \
769 \
770 int IndexOf(Tbase *object) const \
771 { return wxListBase::IndexOf(object); } \
772 \
773 void Sort(wxSortCompareFunction func) \
774 { wxListBase::Sort(func); } \
775 void Sort(wxSortFuncFor_##name func) \
776 { Sort((wxSortCompareFunction)func); } \
777 \
778 protected: \
779 virtual wxNodeBase *CreateNode(wxNodeBase *prev, wxNodeBase *next, \
780 void *data, \
781 const wxListKey& key = wxDefaultListKey) \
782 { \
783 return new nodetype(this, \
784 (nodetype *)prev, (nodetype *)next, \
785 (T *)data, key); \
786 } \
787 /* STL interface */ \
788 public: \
789 typedef size_t size_type; \
790 typedef int difference_type; \
791 typedef T* value_type; \
792 typedef Tbase* base_value_type; \
793 typedef value_type& reference; \
794 typedef const value_type& const_reference; \
795 typedef base_value_type& base_reference; \
796 typedef const base_value_type& const_base_reference; \
797 \
798 classexp iterator \
799 { \
800 typedef name list; \
801 public: \
802 typedef nodetype Node; \
803 typedef iterator itor; \
804 typedef T* value_type; \
805 typedef value_type* ptr_type; \
806 typedef value_type& reference; \
807 \
808 Node* m_node; \
809 Node* m_init; \
810 public: \
811 typedef reference reference_type; \
812 typedef ptr_type pointer_type; \
813 \
814 iterator(Node* node, Node* init) : m_node(node), m_init(init) {}\
815 iterator() : m_node(NULL), m_init(NULL) { } \
816 reference_type operator*() const \
817 { return *(pointer_type)m_node->GetDataPtr(); } \
818 ptrop \
819 itor& operator++() { m_node = m_node->GetNext(); return *this; }\
820 const itor operator++(int) \
821 { itor tmp = *this; m_node = m_node->GetNext(); return tmp; }\
822 itor& operator--() \
823 { \
824 m_node = m_node ? m_node->GetPrevious() : m_init; \
825 return *this; \
826 } \
827 const itor operator--(int) \
828 { \
829 itor tmp = *this; \
830 m_node = m_node ? m_node->GetPrevious() : m_init; \
831 return tmp; \
832 } \
833 bool operator!=(const itor& it) const \
834 { return it.m_node != m_node; } \
835 bool operator==(const itor& it) const \
836 { return it.m_node == m_node; } \
837 }; \
838 classexp const_iterator \
839 { \
840 typedef name list; \
841 public: \
842 typedef nodetype Node; \
843 typedef T* value_type; \
844 typedef const value_type& const_reference; \
845 typedef const_iterator itor; \
846 typedef value_type* ptr_type; \
847 \
848 Node* m_node; \
849 Node* m_init; \
850 public: \
851 typedef const_reference reference_type; \
852 typedef const ptr_type pointer_type; \
853 \
854 const_iterator(Node* node, Node* init) \
855 : m_node(node), m_init(init) { } \
856 const_iterator() : m_node(NULL), m_init(NULL) { } \
857 const_iterator(const iterator& it) \
858 : m_node(it.m_node), m_init(it.m_init) { } \
859 reference_type operator*() const \
860 { return *(pointer_type)m_node->GetDataPtr(); } \
861 ptrop \
862 itor& operator++() { m_node = m_node->GetNext(); return *this; }\
863 const itor operator++(int) \
864 { itor tmp = *this; m_node = m_node->GetNext(); return tmp; }\
865 itor& operator--() \
866 { \
867 m_node = m_node ? m_node->GetPrevious() : m_init; \
868 return *this; \
869 } \
870 const itor operator--(int) \
871 { \
872 itor tmp = *this; \
873 m_node = m_node ? m_node->GetPrevious() : m_init; \
874 return tmp; \
875 } \
876 bool operator!=(const itor& it) const \
877 { return it.m_node != m_node; } \
878 bool operator==(const itor& it) const \
879 { return it.m_node == m_node; } \
880 }; \
881 classexp reverse_iterator \
882 { \
883 typedef name list; \
884 public: \
885 typedef nodetype Node; \
886 typedef T* value_type; \
887 typedef reverse_iterator itor; \
888 typedef value_type* ptr_type; \
889 typedef value_type& reference; \
890 \
891 Node* m_node; \
892 Node* m_init; \
893 public: \
894 typedef reference reference_type; \
895 typedef ptr_type pointer_type; \
896 \
897 reverse_iterator(Node* node, Node* init) \
898 : m_node(node), m_init(init) { } \
899 reverse_iterator() : m_node(NULL), m_init(NULL) { } \
900 reference_type operator*() const \
901 { return *(pointer_type)m_node->GetDataPtr(); } \
902 ptrop \
903 itor& operator++() \
904 { m_node = m_node->GetPrevious(); return *this; } \
905 const itor operator++(int) \
906 { itor tmp = *this; m_node = m_node->GetPrevious(); return tmp; }\
907 itor& operator--() \
908 { m_node = m_node ? m_node->GetNext() : m_init; return *this; } \
909 const itor operator--(int) \
910 { \
911 itor tmp = *this; \
912 m_node = m_node ? m_node->GetNext() : m_init; \
913 return tmp; \
914 } \
915 bool operator!=(const itor& it) const \
916 { return it.m_node != m_node; } \
917 bool operator==(const itor& it) const \
918 { return it.m_node == m_node; } \
919 }; \
920 classexp const_reverse_iterator \
921 { \
922 typedef name list; \
923 public: \
924 typedef nodetype Node; \
925 typedef T* value_type; \
926 typedef const_reverse_iterator itor; \
927 typedef value_type* ptr_type; \
928 typedef const value_type& const_reference; \
929 \
930 Node* m_node; \
931 Node* m_init; \
932 public: \
933 typedef const_reference reference_type; \
934 typedef const ptr_type pointer_type; \
935 \
936 const_reverse_iterator(Node* node, Node* init) \
937 : m_node(node), m_init(init) { } \
938 const_reverse_iterator() : m_node(NULL), m_init(NULL) { } \
939 const_reverse_iterator(const reverse_iterator& it) \
940 : m_node(it.m_node), m_init(it.m_init) { } \
941 reference_type operator*() const \
942 { return *(pointer_type)m_node->GetDataPtr(); } \
943 ptrop \
944 itor& operator++() \
945 { m_node = m_node->GetPrevious(); return *this; } \
946 const itor operator++(int) \
947 { itor tmp = *this; m_node = m_node->GetPrevious(); return tmp; }\
948 itor& operator--() \
949 { m_node = m_node ? m_node->GetNext() : m_init; return *this;}\
950 const itor operator--(int) \
951 { \
952 itor tmp = *this; \
953 m_node = m_node ? m_node->GetNext() : m_init; \
954 return tmp; \
955 } \
956 bool operator!=(const itor& it) const \
957 { return it.m_node != m_node; } \
958 bool operator==(const itor& it) const \
959 { return it.m_node == m_node; } \
960 }; \
961 \
962 wxEXPLICIT name(size_type n, const_reference v = value_type()) \
963 { assign(n, v); } \
964 name(const const_iterator& first, const const_iterator& last) \
965 { assign(first, last); } \
966 iterator begin() { return iterator(GetFirst(), GetLast()); } \
967 const_iterator begin() const \
968 { return const_iterator(GetFirst(), GetLast()); } \
969 iterator end() { return iterator(NULL, GetLast()); } \
970 const_iterator end() const { return const_iterator(NULL, GetLast()); }\
971 reverse_iterator rbegin() \
972 { return reverse_iterator(GetLast(), GetFirst()); } \
973 const_reverse_iterator rbegin() const \
974 { return const_reverse_iterator(GetLast(), GetFirst()); } \
975 reverse_iterator rend() { return reverse_iterator(NULL, GetFirst()); }\
976 const_reverse_iterator rend() const \
977 { return const_reverse_iterator(NULL, GetFirst()); } \
978 void resize(size_type n, value_type v = value_type()) \
979 { \
980 while (n < size()) \
981 pop_back(); \
982 while (n > size()) \
983 push_back(v); \
984 } \
985 size_type size() const { return GetCount(); } \
986 size_type max_size() const { return INT_MAX; } \
987 bool empty() const { return IsEmpty(); } \
988 reference front() { return *begin(); } \
989 const_reference front() const { return *begin(); } \
990 reference back() { iterator tmp = end(); return *--tmp; } \
991 const_reference back() const { const_iterator tmp = end(); return *--tmp; }\
992 void push_front(const_reference v = value_type()) \
993 { Insert(GetFirst(), (const_base_reference)v); } \
994 void pop_front() { DeleteNode(GetFirst()); } \
995 void push_back(const_reference v = value_type()) \
996 { Append((const_base_reference)v); } \
997 void pop_back() { DeleteNode(GetLast()); } \
998 void assign(const_iterator first, const const_iterator& last) \
999 { \
1000 clear(); \
1001 for(; first != last; ++first) \
1002 Append((const_base_reference)*first); \
1003 } \
1004 void assign(size_type n, const_reference v = value_type()) \
1005 { \
1006 clear(); \
1007 for(size_type i = 0; i < n; ++i) \
1008 Append((const_base_reference)v); \
1009 } \
1010 iterator insert(const iterator& it, const_reference v) \
1011 { \
1012 if ( it == end() ) \
1013 Append((const_base_reference)v); \
1014 else \
1015 Insert(it.m_node, (const_base_reference)v); \
1016 iterator itprev(it); \
1017 return itprev--; \
1018 } \
1019 void insert(const iterator& it, size_type n, const_reference v) \
1020 { \
1021 for(size_type i = 0; i < n; ++i) \
1022 insert(it, v); \
1023 } \
1024 void insert(const iterator& it, \
1025 const_iterator first, const const_iterator& last) \
1026 { \
1027 for(; first != last; ++first) \
1028 insert(it, *first); \
1029 } \
1030 iterator erase(const iterator& it) \
1031 { \
1032 iterator next = iterator(it.m_node->GetNext(), GetLast()); \
1033 DeleteNode(it.m_node); return next; \
1034 } \
1035 iterator erase(const iterator& first, const iterator& last) \
1036 { \
1037 iterator next = last; \
1038 if ( next != end() ) \
1039 ++next; \
1040 DeleteNodes(first.m_node, last.m_node); \
1041 return next; \
1042 } \
1043 void clear() { Clear(); } \
1044 void splice(const iterator& it, name& l, const iterator& first, const iterator& last)\
1045 { insert(it, first, last); l.erase(first, last); } \
1046 void splice(const iterator& it, name& l) \
1047 { splice(it, l, l.begin(), l.end() ); } \
1048 void splice(const iterator& it, name& l, const iterator& first) \
1049 { \
1050 if ( it != first ) \
1051 { \
1052 insert(it, *first); \
1053 l.erase(first); \
1054 } \
1055 } \
1056 void remove(const_reference v) \
1057 { DeleteObject((const_base_reference)v); } \
1058 void reverse() \
1059 { Reverse(); } \
1060 /* void swap(name& l) \
1061 { \
1062 { size_t t = m_count; m_count = l.m_count; l.m_count = t; } \
1063 { bool t = m_destroy; m_destroy = l.m_destroy; l.m_destroy = t; }\
1064 { wxNodeBase* t = m_nodeFirst; m_nodeFirst = l.m_nodeFirst; l.m_nodeFirst = t; }\
1065 { wxNodeBase* t = m_nodeLast; m_nodeLast = l.m_nodeLast; l.m_nodeLast = t; }\
1066 { wxKeyType t = m_keyType; m_keyType = l.m_keyType; l.m_keyType = t; }\
1067 } */ \
1068 }
1069
1070#define WX_LIST_PTROP \
1071 pointer_type operator->() const \
1072 { return (pointer_type)m_node->GetDataPtr(); }
1073#define WX_LIST_PTROP_NONE
1074
1075#define WX_DECLARE_LIST_3(T, Tbase, name, nodetype, classexp) \
1076 WX_DECLARE_LIST_4(T, Tbase, name, nodetype, classexp, WX_LIST_PTROP_NONE)
1077#define WX_DECLARE_LIST_PTR_3(T, Tbase, name, nodetype, classexp) \
1078 WX_DECLARE_LIST_4(T, Tbase, name, nodetype, classexp, WX_LIST_PTROP)
1079
1080#define WX_DECLARE_LIST_2(elementtype, listname, nodename, classexp) \
1081 WX_DECLARE_LIST_3(elementtype, elementtype, listname, nodename, classexp)
1082#define WX_DECLARE_LIST_PTR_2(elementtype, listname, nodename, classexp) \
1083 WX_DECLARE_LIST_PTR_3(elementtype, elementtype, listname, nodename, classexp)
1084
1085#define WX_DECLARE_LIST(elementtype, listname) \
1086 typedef elementtype _WX_LIST_ITEM_TYPE_##listname; \
1087 WX_DECLARE_LIST_2(elementtype, listname, wx##listname##Node, class)
1088#define WX_DECLARE_LIST_PTR(elementtype, listname) \
1089 typedef elementtype _WX_LIST_ITEM_TYPE_##listname; \
1090 WX_DECLARE_LIST_PTR_2(elementtype, listname, wx##listname##Node, class)
1091
1092#define WX_DECLARE_LIST_WITH_DECL(elementtype, listname, decl) \
1093 typedef elementtype _WX_LIST_ITEM_TYPE_##listname; \
1094 WX_DECLARE_LIST_2(elementtype, listname, wx##listname##Node, decl)
1095
1096#define WX_DECLARE_EXPORTED_LIST(elementtype, listname) \
1097 WX_DECLARE_LIST_WITH_DECL(elementtype, listname, class WXDLLIMPEXP_CORE)
1098
1099#define WX_DECLARE_EXPORTED_LIST_PTR(elementtype, listname) \
1100 typedef elementtype _WX_LIST_ITEM_TYPE_##listname; \
1101 WX_DECLARE_LIST_PTR_2(elementtype, listname, wx##listname##Node, class WXDLLIMPEXP_CORE)
1102
1103#define WX_DECLARE_USER_EXPORTED_LIST(elementtype, listname, usergoo) \
1104 typedef elementtype _WX_LIST_ITEM_TYPE_##listname; \
1105 WX_DECLARE_LIST_2(elementtype, listname, wx##listname##Node, class usergoo)
1106#define WX_DECLARE_USER_EXPORTED_LIST_PTR(elementtype, listname, usergoo) \
1107 typedef elementtype _WX_LIST_ITEM_TYPE_##listname; \
1108 WX_DECLARE_LIST_PTR_2(elementtype, listname, wx##listname##Node, class usergoo)
1109
1110// this macro must be inserted in your program after
1111// #include "wx/listimpl.cpp"
1112#define WX_DEFINE_LIST(name) "don't forget to include listimpl.cpp!"
1113
1114#define WX_DEFINE_EXPORTED_LIST(name) WX_DEFINE_LIST(name)
1115#define WX_DEFINE_USER_EXPORTED_LIST(name) WX_DEFINE_LIST(name)
1116
1117#endif // !wxUSE_STL
1118
1119// ============================================================================
1120// now we can define classes 100% compatible with the old ones
1121// ============================================================================
1122
1123// ----------------------------------------------------------------------------
1124// commonly used list classes
1125// ----------------------------------------------------------------------------
1126
1127#if defined(wxLIST_COMPATIBILITY)
1128
1129// inline compatibility functions
1130
1131#if !wxUSE_STL
1132
1133// ----------------------------------------------------------------------------
1134// wxNodeBase deprecated methods
1135// ----------------------------------------------------------------------------
1136
1137inline wxNode *wxNodeBase::Next() const { return (wxNode *)GetNext(); }
1138inline wxNode *wxNodeBase::Previous() const { return (wxNode *)GetPrevious(); }
1139inline wxObject *wxNodeBase::Data() const { return (wxObject *)GetData(); }
1140
1141// ----------------------------------------------------------------------------
1142// wxListBase deprecated methods
1143// ----------------------------------------------------------------------------
1144
1145inline int wxListBase::Number() const { return (int)GetCount(); }
1146inline wxNode *wxListBase::First() const { return (wxNode *)GetFirst(); }
1147inline wxNode *wxListBase::Last() const { return (wxNode *)GetLast(); }
1148inline wxNode *wxListBase::Nth(size_t n) const { return (wxNode *)Item(n); }
1149inline wxListBase::operator wxList&() const { return *(wxList*)this; }
1150
1151#endif
1152
1153// define this to make a lot of noise about use of the old wxList classes.
1154//#define wxWARN_COMPAT_LIST_USE
1155
1156// ----------------------------------------------------------------------------
1157// wxList compatibility class: in fact, it's a list of wxObjects
1158// ----------------------------------------------------------------------------
1159
1160WX_DECLARE_LIST_2(wxObject, wxObjectList, wxObjectListNode,
1161 class WXDLLIMPEXP_BASE);
1162
1163class WXDLLIMPEXP_BASE wxList : public wxObjectList
1164{
1165public:
1166#if defined(wxWARN_COMPAT_LIST_USE) && !wxUSE_STL
1167 wxList() { };
1168 wxDEPRECATED( wxList(int key_type) );
1169#elif !wxUSE_STL
1170 wxList(int key_type = wxKEY_NONE);
1171#endif
1172
1173 // this destructor is required for Darwin
1174 ~wxList() { }
1175
1176#if !wxUSE_STL
1177 wxList& operator=(const wxList& list)
1178 { if (&list != this) Assign(list); return *this; }
1179
1180 // compatibility methods
1181 void Sort(wxSortCompareFunction compfunc) { wxListBase::Sort(compfunc); }
1182 bool Member(wxObject *object) const { return Find(object) != NULL; }
1183#endif // !wxUSE_STL
1184};
1185
1186#if !wxUSE_STL
1187
1188// -----------------------------------------------------------------------------
1189// wxStringList class for compatibility with the old code
1190// -----------------------------------------------------------------------------
1191WX_DECLARE_LIST_2(wxChar, wxStringListBase, wxStringListNode, class WXDLLIMPEXP_BASE);
1192
1193class WXDLLIMPEXP_BASE wxStringList : public wxStringListBase
1194{
1195public:
1196 // ctors and such
1197 // default
1198#ifdef wxWARN_COMPAT_LIST_USE
1199 wxStringList();
1200 wxDEPRECATED( wxStringList(const wxChar *first ...) ); // FIXME-UTF8
1201#else
1202 wxStringList();
1203 wxStringList(const wxChar *first ...); // FIXME-UTF8
1204#endif
1205
1206 // copying the string list: the strings are copied, too (extremely
1207 // inefficient!)
1208 wxStringList(const wxStringList& other) : wxStringListBase() { DeleteContents(true); DoCopy(other); }
1209 wxStringList& operator=(const wxStringList& other)
1210 {
1211 if (&other != this)
1212 {
1213 Clear();
1214 DoCopy(other);
1215 }
1216 return *this;
1217 }
1218
1219 // operations
1220 // makes a copy of the string
1221 wxNode *Add(const wxChar *s);
1222
1223 // Append to beginning of list
1224 wxNode *Prepend(const wxChar *s);
1225
1226 bool Delete(const wxChar *s);
1227
1228 wxChar **ListToArray(bool new_copies = false) const;
1229 bool Member(const wxChar *s) const;
1230
1231 // alphabetic sort
1232 void Sort();
1233
1234private:
1235 void DoCopy(const wxStringList&); // common part of copy ctor and operator=
1236};
1237
1238#else // if wxUSE_STL
1239
1240WX_DECLARE_LIST_XO(wxString, wxStringListBase, class WXDLLIMPEXP_BASE);
1241
1242class WXDLLIMPEXP_BASE wxStringList : public wxStringListBase
1243{
1244public:
1245 compatibility_iterator Append(wxChar* s)
1246 { wxString tmp = s; delete[] s; return wxStringListBase::Append(tmp); }
1247 compatibility_iterator Insert(wxChar* s)
1248 { wxString tmp = s; delete[] s; return wxStringListBase::Insert(tmp); }
1249 compatibility_iterator Insert(size_t pos, wxChar* s)
1250 {
1251 wxString tmp = s;
1252 delete[] s;
1253 return wxStringListBase::Insert(pos, tmp);
1254 }
1255 compatibility_iterator Add(const wxChar* s)
1256 { push_back(s); return GetLast(); }
1257 compatibility_iterator Prepend(const wxChar* s)
1258 { push_front(s); return GetFirst(); }
1259};
1260
1261#endif // wxUSE_STL
1262
1263#endif // wxLIST_COMPATIBILITY
1264
1265// delete all list elements
1266//
1267// NB: the class declaration of the list elements must be visible from the
1268// place where you use this macro, otherwise the proper destructor may not
1269// be called (a decent compiler should give a warning about it, but don't
1270// count on it)!
1271#define WX_CLEAR_LIST(type, list) \
1272 { \
1273 type::iterator it, en; \
1274 for( it = (list).begin(), en = (list).end(); it != en; ++it ) \
1275 delete *it; \
1276 (list).clear(); \
1277 }
1278
1279// append all element of one list to another one
1280#define WX_APPEND_LIST(list, other) \
1281 { \
1282 wxList::compatibility_iterator node = other->GetFirst(); \
1283 while ( node ) \
1284 { \
1285 (list)->push_back(node->GetData()); \
1286 node = node->GetNext(); \
1287 } \
1288 }
1289
1290#endif // _WX_LISTH__
wxWidgets (Impactor)