#include <tracktion_ValueTreeUtilities.h>
|
| | SortedValueTreeObjectList (const juce::ValueTree &v) |
| |
| virtual void | sortObjects (juce::Array< ObjectType * > &objectsToBeSorted) const =0 |
| | Must sort the given array.
|
| |
| virtual bool | isSortableProperty (juce::ValueTree &, const juce::Identifier &)=0 |
| | Should return true if the given Identifier is used to sort the tree.
|
| |
| virtual bool | objectsAreSorted (const ObjectType &first, const ObjectType &second)=0 |
| | Should return true if the objects are in a sorted order.
|
| |
| const juce::Array< ObjectType * > & | getSortedObjects () const |
| | Returns the object for a given state.
|
| |
| void | newObjectAdded (ObjectType *o) override |
| |
| void | objectOrderChanged () override |
| |
| void | valueTreePropertyChanged (juce::ValueTree &v, const juce::Identifier &id) override |
| |
◆ SortedValueTreeObjectList()
template<typename ObjectType >
◆ sortObjects()
template<typename ObjectType >
Must sort the given array.
◆ isSortableProperty()
template<typename ObjectType >
Should return true if the given Identifier is used to sort the tree.
This will be called when one of the items properties changes so this should return true if that property means the objects should now be in a different order.
◆ objectsAreSorted()
template<typename ObjectType >
Should return true if the objects are in a sorted order.
This might look at a property of the objects (i.e. a start time) to determine their order.
◆ getSortedObjects()
template<typename ObjectType >
Returns the object for a given state.
◆ newObjectAdded()
template<typename ObjectType >
◆ objectOrderChanged()
template<typename ObjectType >
◆ valueTreePropertyChanged()
template<typename ObjectType >
The documentation for this struct was generated from the following file: