A list is a sequence of data objects where the data items are usually access from the beginning of list. The head of a list is the first data item and the tail is a list containing the remaining objects.
|
this is used to debug the cell deallocation for Lists. It expands to _freeCell when BLAH is compiled with -DLIST_DEBUG or to the normal memFree function.
Referenced by listDelete(), listDeleteElement(), listDeleteLastElement(), and listForEachDelete(). |
|
this is used to debug the cell allocation for Lists. It expands to _newCell when BLAH is compiled with -DLIST_DEBUG or to the normal memMalloc function.
Referenced by listAppendElement(), listClone(), listDeepClone(), listInsertSorted(), listInsertSortedWithData(), and listPrependElement(). |
|
adds an item to the list if and only if it is not already present.
References listAppendElement(), and listContains(). |
|
appends an item to the end of a list.
References newListCell. Referenced by laInsert(), listAddUniqueElement(), listAppendElements(), listFilter(), and strAppend(). |
|
appends a couple of items to the end of a list.
References listAppendElement(). |
|
appends a list to another list.
|
|
clones a list. This doesn't clone the items.
References newListCell. Referenced by listCopy(). |
|
checks if the list contains a particular item.
Referenced by listAddUniqueElement(). |
|
set list-items of dst to those of src by reusing old buckets. It works as follows:
References listClone(), and listDelete(). |
|
Clones a list, performing a deep copy of all items via P. Definition at line 176 of file list.c. References newListCell. |
|
frees list, does NOT free elements.
References freeListCell. Referenced by laInsert(), listCopy(), and strAppend(). |
|
deletes all occurences of item from list.
References freeListCell. |
|
deletes the last item from the list.
References freeListCell. |
|
returns first item in list.
Referenced by laBest(), laDelete(), laInsert(), laIteratorNew(), laIteratorNextElement(), laRemoveBest(), listReverse(), strFinalize(), and strFromList(). |
|
filters list, returns new (sub-)list.
References listAppendElement(). |
|
calls function `f' for each list element.
|
|
like listForEach, but frees list, list becomes inaccessible.
References freeListCell. |
|
find a particular item in a list .
|
|
inserts an item keeping an order defined by f.
References newListCell. |
|
inserts an item keeping an order defined by f and some extra data.
References newListCell. |
|
compare two lists item per item.
References listSize(). |
|
returns last item in list.
|
|
get a new list. A new List is represented by NULL.
|
|
returns the tail of the list.
Referenced by laDelete(), laInsert(), laIteratorNextElement(), laRemoveBest(), listReverse(), strFinalize(), and strFromList(). |
|
returns nth item in list.
|
|
prepends an item to a list.
References newListCell. Referenced by hashListOfKeys(), laInsert(), laIteratorNew(), listPrependElements(), listReverse(), and vectorToList(). |
|
prepends a couple of items to the end of a list.
References listPrependElement(). |
|
return a new reverse list.
References listElement(), listNext(), and listPrependElement(). |
|
set the item of the current list cell.
Referenced by laIteratorNextElement(). |
|
set the next of the current list cell.
Referenced by laInsert(), and laIteratorNextElement(). |
|
retrieves number of items in the list.
Referenced by listIsEqual(), listToVector(), strFinalize(), and strFromList(). |
|
sorts a list, using a user-specified compare function.
References listToVector(), vectorDelete(), vectorSort(), and vectorToList(). |
|
sorts a list, using a user-specified compare function and some data.
References listToVector(), vectorDelete(), vectorSortWithData(), and vectorToList(). |
|
converts a list into a vector.
References listSize(), vectorNew(), and vectorSetElement(). Referenced by listSort(), and listSortWithData(). |