Lines Matching refs:list
2 %% Name: list.tex
7 %% RCS-ID: $Id: list.tex 48887 2007-09-21 17:53:07Z JS $
14 The wxList<T> class provides linked list functionality. It has been written
15 to be type safe and to provide the full API of the STL std::list container and
18 to the actual objets in the list (see example below). In other words
26 to provide a proper template class providing both the STL std::list
29 Please refer to the STL std::list documentation for further
36 then wxList<T> will actually derive from std::list and just add a legacy
61 MyList list;
63 list.Append(&element); // ok
64 list.Append(17); // error: incorrect type
66 // let's iterate over the list in STL syntax
68 for (iter = list.begin(); iter != list.end(); ++iter)
76 MyList::compatibility_iterator node = list.GetFirst();
96 <wx/list.h>
120 Destroys the list, but does not delete the objects stored in the list
127 Appends the pointer to \rtfsp{\it object} to the list.
133 Clears the list, but does not delete the objects stored in the list
140 If {\it destroy} is {\tt true}, instructs the list to call {\it delete}
141 on objects stored in the list whenever they are removed.
148 Deletes the given element refered to by {\tt iter} from the list,
155 Finds the given {\it object} and removes it from the list, returning
175 Returns the number of elements in the list.
181 Returns the first iterator in the list (NULL if the list is empty).
187 Returns the last iterator in the list (NULL if the list is empty).
193 Returns the index of {\it obj} within the list or {\tt wxNOT\_FOUND} if
194 {\it obj} is not found in the list.
200 Insert object at the front of list.
205 list will be equal to {\it position}. {\it position} should be less than or
217 Returns {\tt true} if the list is empty, {\tt false} otherwise.
225 {\tt index} in the list.
239 Returns the {\it nth} node in the list, indexing from zero (NULL if the list is empty
248 Returns the number of elements in the list.
255 // Type of compare function for list sort operation (as in 'qsort')
260 two list elements. We use the system {\bf qsort} function for the actual
279 Returns the last item of the list.
287 Returns a (const) iterator pointing to the beginning of the list.
293 Removes all items from the list.
299 Returns {\it true} if the list is empty.
307 Returns a (const) iterator pointing at the end of the list.
325 Returns the first item in the list.
341 Returns the largest possible size of the list.
347 Removes the list item.
359 Adds an item to end of the list.
365 Adds an item to the front of the list.
374 reversed list.
380 Removes an item from the list.
389 reversed list.
395 Resizes the list. If the the list is enlarges items with
396 the value {\it v} are appended to the list.
402 Reverses the list.
408 Returns the size of the list.
418 Moves part of the list into another list, starting from {\it first} and