|
JUCE
|
Holds a list of objects derived from ReferenceCountedObject, or which implement basic reference-count handling methods. More...
Public Types | |
| typedef ReferenceCountedObjectPtr< ObjectClass > | ObjectClassPtr |
| typedef TypeOfCriticalSectionToUse::ScopedLockType | ScopedLockType |
| Returns the type of scoped lock to use for locking this array. More... | |
Public Member Functions | |
| ReferenceCountedArray () noexcept | |
| Creates an empty array. More... | |
| ReferenceCountedArray (const ReferenceCountedArray &other) noexcept | |
| Creates a copy of another array. More... | |
| template<class OtherObjectClass , class OtherCriticalSection > | |
| ReferenceCountedArray (const ReferenceCountedArray< OtherObjectClass, OtherCriticalSection > &other) noexcept | |
| Creates a copy of another array. More... | |
| ReferenceCountedArray & | operator= (const ReferenceCountedArray &other) noexcept |
| Copies another array into this one. More... | |
| template<class OtherObjectClass > | |
| ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse > & | operator= (const ReferenceCountedArray< OtherObjectClass, TypeOfCriticalSectionToUse > &other) noexcept |
| Copies another array into this one. More... | |
| ~ReferenceCountedArray () | |
| Destructor. More... | |
| void | clear () |
| Removes all objects from the array. More... | |
| void | clearQuick () |
| Removes all objects from the array without freeing the array's allocated storage. More... | |
| int | size () const noexcept |
| Returns the current number of objects in the array. More... | |
| bool | isEmpty () const noexcept |
| Returns true if the array is empty, false otherwise. More... | |
| ObjectClassPtr | operator[] (const int index) const noexcept |
| Returns a pointer to the object at this index in the array. More... | |
| ObjectClassPtr | getUnchecked (const int index) const noexcept |
| Returns a pointer to the object at this index in the array, without checking whether the index is in-range. More... | |
| ObjectClass * | getObjectPointer (const int index) const noexcept |
| Returns a raw pointer to the object at this index in the array. More... | |
| ObjectClass * | getObjectPointerUnchecked (const int index) const noexcept |
| Returns a raw pointer to the object at this index in the array, without checking whether the index is in-range. More... | |
| ObjectClassPtr | getFirst () const noexcept |
| Returns a pointer to the first object in the array. More... | |
| ObjectClassPtr | getLast () const noexcept |
| Returns a pointer to the last object in the array. More... | |
| ObjectClass ** | getRawDataPointer () const noexcept |
| Returns a pointer to the actual array data. More... | |
| ObjectClass ** | begin () const noexcept |
| Returns a pointer to the first element in the array. More... | |
| ObjectClass ** | end () const noexcept |
| Returns a pointer to the element which follows the last element in the array. More... | |
| int | indexOf (const ObjectClass *const objectToLookFor) const noexcept |
| Finds the index of the first occurrence of an object in the array. More... | |
| bool | contains (const ObjectClass *const objectToLookFor) const noexcept |
| Returns true if the array contains a specified object. More... | |
| ObjectClass * | add (ObjectClass *const newObject) noexcept |
| Appends a new object to the end of the array. More... | |
| ObjectClass * | insert (int indexToInsertAt, ObjectClass *const newObject) noexcept |
| Inserts a new object into the array at the given index. More... | |
| void | addIfNotAlreadyThere (ObjectClass *const newObject) noexcept |
| Appends a new object at the end of the array as long as the array doesn't already contain it. More... | |
| void | set (const int indexToChange, ObjectClass *const newObject) |
| Replaces an object in the array with a different one. More... | |
| void | addArray (const ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse > &arrayToAddFrom, int startIndex=0, int numElementsToAdd=-1) noexcept |
| Adds elements from another array to the end of this array. More... | |
| template<class ElementComparator > | |
| int | addSorted (ElementComparator &comparator, ObjectClass *newObject) noexcept |
| Inserts a new object into the array assuming that the array is sorted. More... | |
| template<class ElementComparator > | |
| void | addOrReplaceSorted (ElementComparator &comparator, ObjectClass *newObject) noexcept |
| Inserts or replaces an object in the array, assuming it is sorted. More... | |
| template<class ElementComparator > | |
| int | indexOfSorted (ElementComparator &comparator, const ObjectClass *const objectToLookFor) const noexcept |
| Finds the index of an object in the array, assuming that the array is sorted. More... | |
| void | remove (const int indexToRemove) |
| Removes an object from the array. More... | |
| ObjectClassPtr | removeAndReturn (const int indexToRemove) |
| Removes and returns an object from the array. More... | |
| void | removeObject (ObjectClass *const objectToRemove) |
| Removes the first occurrence of a specified object from the array. More... | |
| void | removeRange (const int startIndex, const int numberToRemove) |
| Removes a range of objects from the array. More... | |
| void | removeLast (int howManyToRemove=1) |
| Removes the last n objects from the array. More... | |
| void | swap (const int index1, const int index2) noexcept |
| Swaps a pair of objects in the array. More... | |
| void | move (const int currentIndex, int newIndex) noexcept |
| Moves one of the objects to a different position. More... | |
| template<class OtherArrayType > | |
| void | swapWith (OtherArrayType &otherArray) noexcept |
| This swaps the contents of this array with those of another array. More... | |
| bool | operator== (const ReferenceCountedArray &other) const noexcept |
| Compares this array to another one. More... | |
| bool | operator!= (const ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse > &other) const noexcept |
| Compares this array to another one. More... | |
| template<class ElementComparator > | |
| void | sort (ElementComparator &comparator, const bool retainOrderOfEquivalentItems=false) const noexcept |
| Sorts the elements in the array. More... | |
| void | minimiseStorageOverheads () noexcept |
| Reduces the amount of storage being used by the array. More... | |
| void | ensureStorageAllocated (const int minNumElements) |
| Increases the array's internal storage to hold a minimum number of elements. More... | |
| const TypeOfCriticalSectionToUse & | getLock () const noexcept |
| Returns the CriticalSection that locks this array. More... | |
Holds a list of objects derived from ReferenceCountedObject, or which implement basic reference-count handling methods.
The template parameter specifies the class of the object you want to point to - the easiest way to make a class reference-countable is to simply make it inherit from ReferenceCountedObject or SingleThreadedReferenceCountedObject, but if you need to, you can roll your own reference-countable class by implementing a set of methods called incReferenceCount(), decReferenceCount(), and decReferenceCountWithoutDeleting(). See ReferenceCountedObject for examples of how these methods should behave.
A ReferenceCountedArray holds objects derived from ReferenceCountedObject, and takes care of incrementing and decrementing their ref counts when they are added and removed from the array.
To make all the array's methods thread-safe, pass in "CriticalSection" as the templated TypeOfCriticalSectionToUse parameter, instead of the default DummyCriticalSection.
| typedef ReferenceCountedObjectPtr<ObjectClass> ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::ObjectClassPtr |
| typedef TypeOfCriticalSectionToUse::ScopedLockType ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::ScopedLockType |
Returns the type of scoped lock to use for locking this array.
|
noexcept |
Creates an empty array.
|
noexcept |
Creates a copy of another array.
|
noexcept |
Creates a copy of another array.
| ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::~ReferenceCountedArray | ( | ) |
Destructor.
Any objects in the array will be released, and may be deleted if not referenced from elsewhere.
|
noexcept |
Copies another array into this one.
Any existing objects in this array will first be released.
|
noexcept |
Copies another array into this one.
Any existing objects in this array will first be released.
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::clear | ( | ) |
Removes all objects from the array.
Any objects in the array that whose reference counts drop to zero will be deleted.
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::clearQuick | ( | ) |
Removes all objects from the array without freeing the array's allocated storage.
Any objects in the array that whose reference counts drop to zero will be deleted.
|
noexcept |
Returns the current number of objects in the array.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::addArray(), ReferenceCountedArray< AudioProcessorGraph::Node >::isEmpty(), and ReferenceCountedArray< AudioProcessorGraph::Node >::sort().
|
noexcept |
Returns true if the array is empty, false otherwise.
|
noexcept |
Returns a pointer to the object at this index in the array.
If the index is out-of-range, this will return a null pointer, (and it could be null anyway, because it's ok for the array to hold null pointers as well as objects).
|
noexcept |
Returns a pointer to the object at this index in the array, without checking whether the index is in-range.
This is a faster and less safe version of operator[] which doesn't check the index passed in, so it can be used when you're sure the index is always going to be legal.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::addArray().
|
noexcept |
Returns a raw pointer to the object at this index in the array.
If the index is out-of-range, this will return a null pointer, (and it could be null anyway, because it's ok for the array to hold null pointers as well as objects).
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::operator[]().
|
noexcept |
Returns a raw pointer to the object at this index in the array, without checking whether the index is in-range.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::getUnchecked().
|
noexcept |
Returns a pointer to the first object in the array.
This will return a null pointer if the array's empty.
|
noexcept |
Returns a pointer to the last object in the array.
This will return a null pointer if the array's empty.
|
noexcept |
Returns a pointer to the actual array data.
This pointer will only be valid until the next time a non-const method is called on the array.
|
noexcept |
Returns a pointer to the first element in the array.
This method is provided for compatibility with standard C++ iteration mechanisms.
|
noexcept |
Returns a pointer to the element which follows the last element in the array.
This method is provided for compatibility with standard C++ iteration mechanisms.
|
noexcept |
Finds the index of the first occurrence of an object in the array.
| objectToLookFor | the object to look for |
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::removeObject().
|
noexcept |
Returns true if the array contains a specified object.
| objectToLookFor | the object to look for |
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::addIfNotAlreadyThere().
|
noexcept |
Appends a new object to the end of the array.
This will increase the new object's reference count.
| newObject | the new object to add to the array |
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::addArray(), ReferenceCountedArray< AudioProcessorGraph::Node >::addIfNotAlreadyThere(), and ReferenceCountedArray< AudioProcessorGraph::Node >::insert().
|
noexcept |
Inserts a new object into the array at the given index.
If the index is less than 0 or greater than the size of the array, the element will be added to the end of the array. Otherwise, it will be inserted into the array, moving all the later elements along to make room.
This will increase the new object's reference count.
| indexToInsertAt | the index at which the new element should be inserted |
| newObject | the new object to add to the array |
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::addOrReplaceSorted(), and ReferenceCountedArray< AudioProcessorGraph::Node >::addSorted().
|
noexcept |
Appends a new object at the end of the array as long as the array doesn't already contain it.
If the array already contains a matching object, nothing will be done.
| newObject | the new object to add to the array |
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::set | ( | const int | indexToChange, |
| ObjectClass *const | newObject | ||
| ) |
Replaces an object in the array with a different one.
If the index is less than zero, this method does nothing. If the index is beyond the end of the array, the new object is added to the end of the array.
The object being added has its reference count increased, and if it's replacing another object, then that one has its reference count decreased, and may be deleted.
| indexToChange | the index whose value you want to change |
| newObject | the new value to set for this index. |
|
noexcept |
Adds elements from another array to the end of this array.
| arrayToAddFrom | the array from which to copy the elements |
| startIndex | the first element of the other array to start copying from |
| numElementsToAdd | how many elements to add from the other array. If this value is negative or greater than the number of available elements, all available elements will be copied. |
|
noexcept |
Inserts a new object into the array assuming that the array is sorted.
This will use a comparator to find the position at which the new object should go. If the array isn't sorted, the behaviour of this method will be unpredictable.
| comparator | the comparator object to use to compare the elements - see the sort() method for details about this object's form |
| newObject | the new object to insert to the array |
|
noexcept |
Inserts or replaces an object in the array, assuming it is sorted.
This is similar to addSorted, but if a matching element already exists, then it will be replaced by the new one, rather than the new one being added as well.
|
noexcept |
Finds the index of an object in the array, assuming that the array is sorted.
This will use a comparator to do a binary-chop to find the index of the given element, if it exists. If the array isn't sorted, the behaviour of this method will be unpredictable.
| comparator | the comparator to use to compare the elements - see the sort() method for details about the form this object should take |
| objectToLookFor | the object to search for |
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::remove | ( | const int | indexToRemove | ) |
Removes an object from the array.
This will remove the object at a given index and move back all the subsequent objects to close the gap.
If the index passed in is out-of-range, nothing will happen.
The object that is removed will have its reference count decreased, and may be deleted if not referenced from elsewhere.
| indexToRemove | the index of the element to remove |
| ObjectClassPtr ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::removeAndReturn | ( | const int | indexToRemove | ) |
Removes and returns an object from the array.
This will remove the object at a given index and return it, moving back all the subsequent objects to close the gap. If the index passed in is out-of-range, nothing will happen and a null pointer will be returned.
| indexToRemove | the index of the element to remove |
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::removeObject | ( | ObjectClass *const | objectToRemove | ) |
Removes the first occurrence of a specified object from the array.
If the item isn't found, no action is taken. If it is found, it is removed and has its reference count decreased.
| objectToRemove | the object to try to remove |
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::removeRange | ( | const int | startIndex, |
| const int | numberToRemove | ||
| ) |
Removes a range of objects from the array.
This will remove a set of objects, starting from the given index, and move any subsequent elements down to close the gap.
If the range extends beyond the bounds of the array, it will be safely clipped to the size of the array.
The objects that are removed will have their reference counts decreased, and may be deleted if not referenced from elsewhere.
| startIndex | the index of the first object to remove |
| numberToRemove | how many objects should be removed |
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::removeLast | ( | int | howManyToRemove = 1 | ) |
Removes the last n objects from the array.
The objects that are removed will have their reference counts decreased, and may be deleted if not referenced from elsewhere.
| howManyToRemove | how many objects to remove from the end of the array |
|
noexcept |
Swaps a pair of objects in the array.
If either of the indexes passed in is out-of-range, nothing will happen, otherwise the two objects at these positions will be exchanged.
|
noexcept |
Moves one of the objects to a different position.
This will move the object to a specified index, shuffling along any intervening elements as required.
So for example, if you have the array { 0, 1, 2, 3, 4, 5 } then calling move (2, 4) would result in { 0, 1, 3, 4, 2, 5 }.
| currentIndex | the index of the object to be moved. If this isn't a valid index, then nothing will be done |
| newIndex | the index at which you'd like this object to end up. If this is less than zero, it will be moved to the end of the array |
|
noexcept |
This swaps the contents of this array with those of another array.
If you need to exchange two arrays, this is vastly quicker than using copy-by-value because it just swaps their internal pointers.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::operator=().
|
noexcept |
Compares this array to another one.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::operator!=().
|
noexcept |
Compares this array to another one.
|
noexcept |
Sorts the elements in the array.
This will use a comparator object to sort the elements into order. The object passed must have a method of the form:
..and this method must return:
To improve performance, the compareElements() method can be declared as static or const.
| comparator | the comparator to use for comparing elements. |
| retainOrderOfEquivalentItems | if this is true, then items which the comparator says are equivalent will be kept in the order in which they currently appear in the array. This is slower to perform, but may be important in some cases. If it's false, a faster algorithm is used, but equivalent elements may be rearranged. |
|
noexcept |
Reduces the amount of storage being used by the array.
Arrays typically allocate slightly more storage than they need, and after removing elements, they may have quite a lot of unused space allocated. This method will reduce the amount of allocated storage to a minimum.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::remove(), ReferenceCountedArray< AudioProcessorGraph::Node >::removeAndReturn(), and ReferenceCountedArray< AudioProcessorGraph::Node >::removeRange().
| void ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::ensureStorageAllocated | ( | const int | minNumElements | ) |
Increases the array's internal storage to hold a minimum number of elements.
Calling this before adding a large known number of elements means that the array won't have to keep dynamically resizing itself as the elements are added, and it'll therefore be more efficient.
|
noexcept |
Returns the CriticalSection that locks this array.
To lock, you can call getLock().enter() and getLock().exit(), or preferably use an object of ScopedLockType as an RAII lock for it.
Referenced by ReferenceCountedArray< AudioProcessorGraph::Node >::add(), ReferenceCountedArray< AudioProcessorGraph::Node >::addArray(), ReferenceCountedArray< AudioProcessorGraph::Node >::addIfNotAlreadyThere(), ReferenceCountedArray< AudioProcessorGraph::Node >::addOrReplaceSorted(), ReferenceCountedArray< AudioProcessorGraph::Node >::addSorted(), ReferenceCountedArray< AudioProcessorGraph::Node >::clear(), ReferenceCountedArray< AudioProcessorGraph::Node >::clearQuick(), ReferenceCountedArray< AudioProcessorGraph::Node >::contains(), ReferenceCountedArray< AudioProcessorGraph::Node >::ensureStorageAllocated(), ReferenceCountedArray< AudioProcessorGraph::Node >::getFirst(), ReferenceCountedArray< AudioProcessorGraph::Node >::getLast(), ReferenceCountedArray< AudioProcessorGraph::Node >::getObjectPointer(), ReferenceCountedArray< AudioProcessorGraph::Node >::getObjectPointerUnchecked(), ReferenceCountedArray< AudioProcessorGraph::Node >::indexOf(), ReferenceCountedArray< AudioProcessorGraph::Node >::indexOfSorted(), ReferenceCountedArray< AudioProcessorGraph::Node >::insert(), ReferenceCountedArray< AudioProcessorGraph::Node >::minimiseStorageOverheads(), ReferenceCountedArray< AudioProcessorGraph::Node >::move(), ReferenceCountedArray< AudioProcessorGraph::Node >::operator==(), ReferenceCountedArray< AudioProcessorGraph::Node >::remove(), ReferenceCountedArray< AudioProcessorGraph::Node >::removeAndReturn(), ReferenceCountedArray< AudioProcessorGraph::Node >::removeLast(), ReferenceCountedArray< AudioProcessorGraph::Node >::removeObject(), ReferenceCountedArray< AudioProcessorGraph::Node >::removeRange(), ReferenceCountedArray< AudioProcessorGraph::Node >::set(), ReferenceCountedArray< AudioProcessorGraph::Node >::sort(), ReferenceCountedArray< AudioProcessorGraph::Node >::swap(), and ReferenceCountedArray< AudioProcessorGraph::Node >::swapWith().
