Classes | |
class | AbstractFifo |
Encapsulates the logic required to implement a lock-free FIFO. More... | |
class | AbstractFifo::ScopedReadWrite< mode > |
Class for a scoped reader/writer. More... | |
class | Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize > |
Holds a resizable array of primitive or copy-by-value objects. More... | |
class | ArrayAllocationBase< ElementType, TypeOfCriticalSectionToUse > |
Implements some basic array storage allocation functions. More... | |
class | ArrayBase< ElementType, TypeOfCriticalSectionToUse > |
A basic object container. More... | |
class | DynamicObject |
Represents a dynamically implemented object. More... | |
class | DefaultElementComparator< ElementType > |
A simple ElementComparator class that can be used to sort an array of objects that support the '<' operator. More... | |
struct | DefaultHashFunctions |
A simple class to generate hash functions for some primitive types, intended for use with the HashMap class. More... | |
class | HashMap< KeyType, ValueType, HashFunctionType, TypeOfCriticalSectionToUse > |
Holds a set of mappings between some key/value pairs. More... | |
struct | HashMap< KeyType, ValueType, HashFunctionType, TypeOfCriticalSectionToUse >::Iterator |
Iterates over the items in a HashMap. More... | |
class | LinkedListPointer< ObjectType > |
Helps to manipulate singly-linked lists of objects. More... | |
class | LinkedListPointer< ObjectType >::Appender |
Allows efficient repeated insertions into a list. More... | |
class | ListenerList< ListenerClass, ArrayType > |
Holds a set of objects and can invoke a member function callback on each object in the set with a single call. More... | |
struct | ListenerList< ListenerClass, ArrayType >::DummyBailOutChecker |
A dummy bail-out checker that always returns false. More... | |
struct | ListenerList< ListenerClass, ArrayType >::Iterator |
Iterates the listeners in a ListenerList. More... | |
class | NamedValueSet |
Holds a set of named var objects. More... | |
struct | NamedValueSet::NamedValue |
Structure for a named var object. More... | |
class | Optional< Value > |
A simple optional type. More... | |
class | OwnedArray< ObjectClass, TypeOfCriticalSectionToUse > |
An array designed for holding objects. More... | |
class | PropertySet |
A set of named property values, which can be strings, integers, floating point, etc. More... | |
class | ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse > |
Holds a list of objects derived from ReferenceCountedObject, or which implement basic reference-count handling methods. More... | |
class | ScopedValueSetter< ValueType > |
Helper class providing an RAII-based mechanism for temporarily setting and then re-setting a value. More... | |
class | SingleThreadedAbstractFifo |
Encapsulates the logic for a single-threaded FIFO. More... | |
class | SortedSet< ElementType, TypeOfCriticalSectionToUse > |
Holds a set of unique primitive objects, such as ints or doubles. More... | |
class | SparseSet< Type > |
Holds a set of primitive values, storing them as a set of ranges. More... | |
class | var |
A variant class, that can be used to hold a range of primitive values. More... | |
struct | var::NativeFunctionArgs |
This structure is passed to a NativeFunction callback, and contains invocation details about the function's arguments and context. More... | |
struct | VariantConverter< Type > |
This template-overloaded class can be used to convert between var and custom types. More... | |
Macros | |
#define | JUCE_OPTIONAL_OPERATORS X(==) X(!=) X(<) X(<=) X(>) X(>=) |
#define | X(op) |
#define | X(op) |
Typedefs | |
using | Nullopt = std::nullopt_t |
Functions | |
template<typename Value > | |
JUCE_END_IGNORE_WARNINGS_MSVC Optional< std::decay_t< Value > > | makeOptional (Value &&v) |
JUCE_API bool | operator== (const var &, const var &) |
Compares the values of two var objects, using the var::equals() comparison. | |
JUCE_API bool | operator!= (const var &, const var &) |
Compares the values of two var objects, using the var::equals() comparison. | |
JUCE_API bool | operator< (const var &, const var &) |
Compares the values of two var objects, using the var::equals() comparison. | |
JUCE_API bool | operator<= (const var &, const var &) |
Compares the values of two var objects, using the var::equals() comparison. | |
JUCE_API bool | operator> (const var &, const var &) |
Compares the values of two var objects, using the var::equals() comparison. | |
JUCE_API bool | operator>= (const var &, const var &) |
Compares the values of two var objects, using the var::equals() comparison. | |
JUCE_API bool | operator== (const var &, const String &) |
JUCE_API bool | operator!= (const var &, const String &) |
JUCE_API bool | operator== (const var &, const char *) |
JUCE_API bool | operator!= (const var &, const char *) |
template<typename ElementComparator , typename TargetValueType > | |
int | Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::indexOfSorted (ElementComparator &comparator, TargetValueType elementToLookFor) const |
Finds the index of an element in the array, assuming that the array is sorted. | |
template<class ElementComparator > | |
void | Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::sort (ElementComparator &comparator, bool retainOrderOfEquivalentItems=false) |
Sorts the elements in the array. | |
template<class ElementComparator > | |
int | OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::addSorted (ElementComparator &comparator, ObjectClass *newObject) noexcept |
Inserts a new object into the array assuming that the array is sorted. | |
template<typename ElementComparator > | |
int | OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::indexOfSorted (ElementComparator &comparator, const ObjectClass *objectToLookFor) const noexcept |
Finds the index of an object in the array, assuming that the array is sorted. | |
template<class ElementComparator > | |
void | OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::sort (ElementComparator &comparator, bool retainOrderOfEquivalentItems=false) noexcept |
Sorts the elements in the array. | |
template<class ElementComparator > | |
int | ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::indexOfSorted (ElementComparator &comparator, const ObjectClass *objectToLookFor) const noexcept |
Finds the index of an object in the array, assuming that the array is sorted. | |
template<class ElementComparator > | |
void | ReferenceCountedArray< ObjectClass, TypeOfCriticalSectionToUse >::sort (ElementComparator &comparator, bool retainOrderOfEquivalentItems=false) noexcept |
Sorts the elements in the array. | |
Variables | |
constexpr auto | nullopt = std::nullopt |
#define X | ( | op | ) |
#define X | ( | op | ) |
using Nullopt = std::nullopt_t |
JUCE_END_IGNORE_WARNINGS_MSVC Optional< std::decay_t< Value > > makeOptional | ( | Value && | v | ) |
Compares the values of two var objects, using the var::equals() comparison.
Referenced by ColourGradient::operator!=(), AudioPlayHead::CurrentPositionInfo::operator!=(), AudioPlayHead::LoopPoints::operator!=(), MidiBufferIterator::operator!=(), MPEZoneLayout::operator!=(), AudioPlayHead::PositionInfo::operator!=(), SortedSet< ElementType, TypeOfCriticalSectionToUse >::operator!=(), AudioPlayHead::TimeSignature::operator!=(), and LookAndFeel::playAlertSound().
Compares the values of two var objects, using the var::equals() comparison.
Referenced by ColourGradient::operator!=().
Compares the values of two var objects, using the var::equals() comparison.
Referenced by LookAndFeel::playAlertSound().
Compares the values of two var objects, using the var::equals() comparison.
Compares the values of two var objects, using the var::equals() comparison.
Compares the values of two var objects, using the var::equals() comparison.
int Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::indexOfSorted | ( | ElementComparator & | comparator, |
TargetValueType | elementToLookFor | ||
) | const |
Finds the index of an element 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 |
elementToLookFor | the element to search for |
void Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::sort | ( | ElementComparator & | comparator, |
bool | retainOrderOfEquivalentItems = false |
||
) |
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 |
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 to use to compare the elements - see the sort method for details about this object's structure |
newObject | the new object to insert to the array |
References OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::getLock(), and OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::insert().
|
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 |
References OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::getLock().
|
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. |
References OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::getLock(), and OwnedArray< ObjectClass, TypeOfCriticalSectionToUse >::size().
Referenced by ValueTree::sort().
|
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 |
|
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. |
|
constexpr |