49template <
class ObjectClass,
class TypeOfCriticalSectionToUse = DummyCriticalSection>
65 values.addArray (other.begin(), other.size());
69 o->incReferenceCount();
74 : values (std::move (other.values))
79 template <
class OtherObjectClass,
class OtherCriticalSection>
83 values.addArray (other.begin(), other.size());
87 o->incReferenceCount();
96 auto otherCopy = other;
104 template <
class OtherObjectClass>
107 auto otherCopy = other;
116 values = std::move (other.values);
136 values.setAllocatedSize (0);
150 inline int size() const noexcept
152 return values.size();
196 return values.getValueWithDefault (index);
205 return values[index];
216 return values.getFirst();
224 inline ObjectClassPtr
getLast() const noexcept
227 return values.getLast();
236 return values.begin();
243 inline ObjectClass**
begin() noexcept
245 return values.begin();
251 inline ObjectClass*
const*
begin() const noexcept
253 return values.begin();
259 inline ObjectClass**
end() noexcept
267 inline ObjectClass*
const*
end() const noexcept
275 inline ObjectClass**
data() noexcept
283 inline ObjectClass*
const*
data() const noexcept
294 int indexOf (
const ObjectClass* objectToLookFor)
const noexcept
297 auto* e = values.begin();
298 auto* endPointer = values.end();
300 while (e != endPointer)
302 if (objectToLookFor == *e)
303 return static_cast<int> (e - values.begin());
316 int indexOf (
const ObjectClassPtr& objectToLookFor)
const noexcept {
return indexOf (objectToLookFor.get()); }
323 bool contains (
const ObjectClass* objectToLookFor)
const noexcept
326 auto* e = values.begin();
327 auto* endPointer = values.end();
329 while (e != endPointer)
331 if (objectToLookFor == *e)
345 bool contains (
const ObjectClassPtr& objectToLookFor)
const noexcept {
return contains (objectToLookFor.get()); }
354 ObjectClass*
add (ObjectClass* newObject)
357 values.add (newObject);
359 if (newObject !=
nullptr)
360 newObject->incReferenceCount();
372 ObjectClass*
add (
const ObjectClassPtr& newObject) {
return add (newObject.
get()); }
387 ObjectClass*
insert (
int indexToInsertAt, ObjectClass* newObject)
389 values.insert (indexToInsertAt, newObject, 1);
391 if (newObject !=
nullptr)
392 newObject->incReferenceCount();
410 ObjectClass*
insert (
int indexToInsertAt,
const ObjectClassPtr& newObject) {
return insert (indexToInsertAt, newObject.
get()); }
453 void set (
int indexToChange, ObjectClass* newObject)
455 if (indexToChange >= 0)
459 if (newObject !=
nullptr)
460 newObject->incReferenceCount();
462 if (indexToChange < values.size())
464 auto* e = values[indexToChange];
465 values[indexToChange] = newObject;
470 values.add (newObject);
487 void set (
int indexToChange,
const ObjectClassPtr& newObject) {
set (indexToChange, newObject.
get()); }
500 int numElementsToAdd = -1) noexcept
507 auto numElementsAdded = values.addArray (arrayToAddFrom.values, startIndex, numElementsToAdd);
508 auto** e = values.end();
510 for (
int i = 0; i < numElementsAdded; ++i)
511 (*(--e))->incReferenceCount();
527 template <
class ElementComparator>
528 int addSorted (ElementComparator& comparator, ObjectClass* newObject)
noexcept
531 auto index = findInsertIndexInSortedArray (comparator, values.begin(), newObject, 0, values.size());
532 insert (index, newObject);
541 template <
class ElementComparator>
545 auto index = findInsertIndexInSortedArray (comparator, values.begin(), newObject, 0, values.size());
547 if (index > 0 && comparator.compareElements (newObject, values[index - 1]) == 0)
548 set (index - 1, newObject);
550 insert (index, newObject);
565 template <
class ElementComparator>
566 int indexOfSorted (ElementComparator& comparator,
const ObjectClass* objectToLookFor)
const noexcept;
586 if (isPositiveAndBelow (indexToRemove, values.size()))
588 auto* e = *(values.begin() + indexToRemove);
589 values.removeElements (indexToRemove, 1);
592 if ((values.size() << 1) < values.capacity())
608 ObjectClassPtr removedItem;
611 if (isPositiveAndBelow (indexToRemove, values.size()))
613 auto* e = *(values.begin() + indexToRemove);
615 values.removeElements (indexToRemove, 1);
618 if ((values.size() << 1) < values.capacity())
668 startIndex = jlimit (0, values.size(), startIndex);
669 auto endIndex = jlimit (0, values.size(), startIndex + numberToRemove);
670 numberToRemove = endIndex - startIndex;
672 if (numberToRemove > 0)
675 objectsToRemove.
addArray (values.begin() + startIndex, numberToRemove);
677 values.removeElements (startIndex, numberToRemove);
679 for (
auto& o : objectsToRemove)
682 if ((values.size() << 1) < values.capacity())
699 if (howManyToRemove > values.size())
700 howManyToRemove = values.size();
702 while (--howManyToRemove >= 0)
703 remove (values.size() - 1);
711 void swap (
int index1,
int index2)
noexcept
715 if (isPositiveAndBelow (index1, values.size())
716 && isPositiveAndBelow (index2, values.size()))
718 std::swap (values[index1], values[index2]);
735 void move (
int currentIndex,
int newIndex)
noexcept
737 if (currentIndex != newIndex)
740 values.move (currentIndex, newIndex);
750 template <
class OtherArrayType>
751 void swapWith (OtherArrayType& otherArray)
noexcept
754 const typename OtherArrayType::ScopedLockType lock2 (otherArray.getLock());
755 values.swapWith (otherArray.values);
767 return values == other.values;
806 template <
class ElementComparator>
807 void sort (ElementComparator& comparator,
bool retainOrderOfEquivalentItems =
false) noexcept;
819 values.shrinkToNoMoreThan (values.size());
831 values.ensureAllocatedSize (minNumElements);
839 inline const TypeOfCriticalSectionToUse&
getLock() const noexcept {
return values; }
846 [[deprecated (
"This method has been replaced by a more flexible templated version and renamed "
847 "to swapWith to be more consistent with the names used in other classes.")]]
855 void releaseAllObjects()
857 auto i = values.size();
862 values.removeElements (i, 1);
867 static void releaseObject (ObjectClass* o)
869 if (o !=
nullptr && o->decReferenceCountWithoutDeleting())
870 ContainerDeletePolicy<ObjectClass>::destroy (o);
875template <
class ObjectClass,
class TypeOfCriticalSectionToUse>
876template <
class ElementComparator>
878 [[maybe_unused]] ElementComparator& comparator,
879 const ObjectClass* objectToLookFor)
const noexcept
882 int s = 0, e = values.size();
886 if (comparator.compareElements (objectToLookFor, values[s]) == 0)
889 auto halfway = (s + e) / 2;
894 if (comparator.compareElements (objectToLookFor, values[halfway]) >= 0)
903template <
class ObjectClass,
class TypeOfCriticalSectionToUse>
904template <
class ElementComparator>
906 [[maybe_unused]] ElementComparator& comparator,
907 bool retainOrderOfEquivalentItems)
noexcept
910 sortArray (comparator, values.begin(), 0, values.size() - 1, retainOrderOfEquivalentItems);
void addArray(const Type *elementsToAdd, int numElementsToAdd)
ReferenceCountedArray(ReferenceCountedArray &&other) noexcept
ObjectClass * add(const ObjectClassPtr &newObject)
bool isEmpty() const noexcept
int indexOf(const ObjectClass *objectToLookFor) const noexcept
ReferenceCountedArray(const ReferenceCountedArray &other) noexcept
int size() const noexcept
void removeLast(int howManyToRemove=1)
ObjectClass *const * end() const noexcept
void minimiseStorageOverheads() noexcept
void set(int indexToChange, ObjectClass *newObject)
ObjectClass *const * begin() const noexcept
ObjectClass * insert(int indexToInsertAt, const ObjectClassPtr &newObject)
ReferenceCountedArray()=default
bool operator!=(const ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse > &other) const noexcept
int indexOfSorted(ElementComparator &comparator, const ObjectClass *objectToLookFor) const noexcept
typename TypeOfCriticalSectionToUse::ScopedLockType ScopedLockType
bool addIfNotAlreadyThere(ObjectClass *newObject)
ObjectClassPtr operator[](int index) const noexcept
void remove(int indexToRemove)
void sort(ElementComparator &comparator, bool retainOrderOfEquivalentItems=false) noexcept
ReferenceCountedArray(const ReferenceCountedArray< OtherObjectClass, OtherCriticalSection > &other) noexcept
bool operator==(const ReferenceCountedArray &other) const noexcept
void removeObject(ObjectClass *objectToRemove)
ObjectClass * getObjectPointer(int index) const noexcept
void swap(int index1, int index2) noexcept
ObjectClassPtr getFirst() const noexcept
void ensureStorageAllocated(const int minNumElements)
void set(int indexToChange, const ObjectClassPtr &newObject)
ObjectClass *const * data() const noexcept
const TypeOfCriticalSectionToUse & getLock() const noexcept
ObjectClassPtr getUnchecked(int index) const noexcept
ObjectClass ** begin() noexcept
void addOrReplaceSorted(ElementComparator &comparator, ObjectClass *newObject) noexcept
bool contains(const ObjectClass *objectToLookFor) const noexcept
void removeRange(int startIndex, int numberToRemove)
ObjectClass * getObjectPointerUnchecked(int index) const noexcept
void move(int currentIndex, int newIndex) noexcept
ObjectClassPtr removeAndReturn(int indexToRemove)
ReferenceCountedArray & operator=(const ReferenceCountedArray &other) noexcept
ObjectClass ** end() noexcept
ObjectClass ** getRawDataPointer() const noexcept
bool contains(const ObjectClassPtr &objectToLookFor) const noexcept
ObjectClass ** data() noexcept
void swapWith(OtherArrayType &otherArray) noexcept
bool addIfNotAlreadyThere(const ObjectClassPtr &newObject)
int addSorted(ElementComparator &comparator, ObjectClass *newObject) noexcept
int indexOf(const ObjectClassPtr &objectToLookFor) const noexcept
ObjectClassPtr getLast() const noexcept
void addArray(const ReferenceCountedArray &arrayToAddFrom, int startIndex=0, int numElementsToAdd=-1) noexcept
ObjectClass * insert(int indexToInsertAt, ObjectClass *newObject)
ObjectClass * add(ObjectClass *newObject)
void removeObject(const ObjectClassPtr &objectToRemove)
ReferencedType * get() const noexcept