#include <juce_LinkedListPointer.h>
template<class ObjectType>
class LinkedListPointer< ObjectType >
Helps to manipulate singly-linked lists of objects.
For objects that are designed to contain a pointer to the subsequent item in the list, this class contains methods to deal with the list. To use it, the ObjectType class that it points to must contain a LinkedListPointer called nextListItem, e.g.
struct MyObject
{
int x, y, z;
};
myList.
append (
new MyObject());
myList.
append (
new MyObject());
int numItems = myList.
size();
MyObject* lastInList = myList.
getLast();
◆ LinkedListPointer() [1/2]
template<class ObjectType>
Creates a null pointer to an empty list.
◆ LinkedListPointer() [2/2]
template<class ObjectType>
Creates a pointer to a list whose head is the item provided.
◆ addCopyOfList()
template<class ObjectType>
Creates copies of all the items in another list and adds them to this one. This will use the ObjectType's copy constructor to try to create copies of each item in the other list, and appends them to this list.
◆ append()
template<class ObjectType>
Adds an item to the end of the list.
This operation involves iterating the whole list, so can be slow - if you need to append a number of items to your list, it's much more efficient to use the Appender class than to repeatedly call append().
◆ contains()
template<class ObjectType>
bool LinkedListPointer< ObjectType >::contains |
( |
const ObjectType *const |
itemToLookFor | ) |
const |
|
inlinenoexcept |
Returns true if the list contains the given item.
◆ copyToArray()
template<class ObjectType>
Copies the items in the list to an array. The destArray must contain enough elements to hold the entire list - no checks are made for this!
◆ deleteAll()
template<class ObjectType>
Iterates the list, calling the delete operator on all of its elements and leaving this pointer empty.
◆ findPointerTo()
template<class ObjectType>
Finds a pointer to a given item. If the item is found in the list, this returns the pointer that points to it. If the item isn't found, this returns null.
◆ get()
template<class ObjectType>
Returns the item which this pointer points to.
◆ getLast()
template<class ObjectType>
Returns the last item in the list which this pointer points to. This will iterate the list and return the last item found. Obviously the speed of this operation will be proportional to the size of the list. If the list is empty the return value will be this object. If you're planning on appending a number of items to your list, it's much more efficient to use the Appender class than to repeatedly call getLast() to find the end.
◆ insertAtIndex()
template<class ObjectType>
void LinkedListPointer< ObjectType >::insertAtIndex |
( |
int |
index, |
|
|
ObjectType * |
newItem |
|
) |
| |
|
inline |
Inserts an item at a numeric index in the list. Obviously this will involve iterating the list to find the item at the given index, so be careful about the impact this may have on execution time.
◆ insertNext()
template<class ObjectType>
Inserts an item into the list, placing it before the item that this pointer currently points to.
◆ operator ObjectType *()
template<class ObjectType>
Returns the item which this pointer points to.
◆ operator=()
template<class ObjectType>
Sets this pointer to point to a new list.
◆ operator[]() [1/2]
template<class ObjectType>
Returns the item at a given index in the list. Since the only way to find an item is to iterate the list, this operation can obviously be slow, depending on its size, so you should be careful when using this in algorithms.
◆ operator[]() [2/2]
template<class ObjectType>
Returns the item at a given index in the list. Since the only way to find an item is to iterate the list, this operation can obviously be slow, depending on its size, so you should be careful when using this in algorithms.
◆ remove()
template<class ObjectType>
Removes a specific item from the list. Note that this will not delete the item, it simply unlinks it from the list.
◆ removeNext()
template<class ObjectType>
Removes the head item from the list. This won't delete the object that is removed, but returns it, so the caller can delete it if necessary.
◆ replaceNext()
template<class ObjectType>
ObjectType* LinkedListPointer< ObjectType >::replaceNext |
( |
ObjectType *const |
newItem | ) |
|
|
inlinenoexcept |
Replaces the object that this pointer points to, appending the rest of the list to the new object, and returning the old one.
◆ size()
template<class ObjectType>
Returns the number of items in the list. Obviously with a simple linked list, getting the size involves iterating the list, so this can be a lengthy operation - be careful when using this method in your code.
◆ swapWith()
template<class ObjectType>
Swaps this pointer with another one
The documentation for this class was generated from the following file: