|
wavelength 1.0.0
|

Go to the source code of this file.
Functions | |
| template<typename T> | |
| bool | TickObjLess (TickObj< T > first, TickObj< T > second) |
| Order two entries by song position. | |
| template<typename T> | |
| bool | TickObjBefore (int nTick, TickObj< T > entry) |
| Report whether a song position comes strictly before an entry. | |
| template<typename T> | |
| bool | TickObjAfter (TickObj< T > entry, int nTick) |
| Report whether an entry comes strictly before a song position. | |
| template<typename T> | |
| std::vector< TickObj< T > >::iterator | UpperBoundByEntry (std::vector< TickObj< T > > &values, const TickObj< T > &value) |
| Find the first entry a value strictly precedes. | |
| template<typename T> | |
| std::vector< TickObj< T > >::iterator | LowerBoundByEntry (std::vector< TickObj< T > > &values, const TickObj< T > &value) |
| Find the first entry a value does not follow. | |
| template<typename T> | |
| std::vector< TickObj< T > >::const_iterator | UpperBoundByTick (const std::vector< TickObj< T > > &values, int nTick) |
| Find the first entry a song position strictly precedes. | |
| template<typename T> | |
| std::vector< TickObj< T > >::const_iterator | LowerBoundByTick (const std::vector< TickObj< T > > &values, int nTick) |
| Find the first entry at or after a song position. | |
| template<typename T> | |
| std::vector< TickObj< T > >::const_iterator | FindAtOrBefore (const std::vector< TickObj< T > > &values, int nTick) |
| Find the last entry at or before a song position. | |
| template<typename T> | |
| std::vector< TickObj< T > >::const_iterator | FindAtOrAfter (const std::vector< TickObj< T > > &values, int nTick) |
| Find the first entry at or after a song position. | |
| template<typename T> | |
| void | InsertSorted (std::vector< TickObj< T > > &values, const TickObj< T > &value) |
| Insert an entry at its sorted place, after every entry at the same position. | |
| template<typename T, typename Compare> | |
| void | InsertOrdered (const T &value, std::vector< T > &values, Compare compare) |
| Insert a value at its lower bound under a comparator, before every equal value. | |
| template<typename T> | |
| void | InsertOrdered (const T &value, std::vector< T > &values) |
| Insert a value at its lower bound, before every equal value. | |
| template<typename T, typename Compare> | |
| void | AddOrdered (const T &value, std::vector< T > &values, Compare compare) |
| Append a value that does not sort before the last one, and otherwise insert it at its lower bound. | |
| template<typename T> | |
| void | AddOrdered (const T &value, std::vector< T > &values) |
| Append a value that does not sort before the last one, and otherwise insert it at its lower bound. | |
| template<typename T, typename Compare> | |
| std::vector< T >::const_iterator | FindOrdered (const T &key, const std::vector< T > &values, Compare compare) |
| Find the last value that does not sort after a key. | |
| template<typename T> | |
| std::vector< T >::const_iterator | FindOrdered (const T &key, const std::vector< T > &values) |
| Find the last value that does not sort after a key. | |
| template<typename T> | |
| void | SetAtTick (std::vector< TickObj< T > > &values, const T &value, int nTick) |
| Store a value at a song position, overwriting the first entry already at that position. | |
| template<typename T> | |
| void | InsertAtLowerBound (std::vector< TickObj< T > > &values, const TickObj< T > &value) |
| Insert an entry before every entry at the same position, always searching first. | |
| template<typename T> | |
| void | InsertAtTick (std::vector< TickObj< T > > &values, const T &value, int nTick) |
| Insert a value at a song position, after every entry at the same position. | |
Order two entries by song position.
Instantiated for TickObj<float> at 0x001b7068 in the Phrase unit, and three times in the TrackData unit.
| first | The first entry. |
| second | The second entry. |
| bool TickObjBefore | ( | int | nTick, |
| TickObj< T > | entry ) |
Report whether a song position comes strictly before an entry.
| nTick | The song position, in MIDI ticks. |
| entry | The entry. |
| bool TickObjAfter | ( | TickObj< T > | entry, |
| int | nTick ) |
Report whether an entry comes strictly before a song position.
| entry | The entry. |
| nTick | The song position, in MIDI ticks. |
| std::vector< TickObj< T > >::iterator UpperBoundByEntry | ( | std::vector< TickObj< T > > & | values, |
| const TickObj< T > & | value ) |
Find the first entry a value strictly precedes.
| values | The entries, sorted by position. |
| value | The value to place. |
| std::vector< TickObj< T > >::iterator LowerBoundByEntry | ( | std::vector< TickObj< T > > & | values, |
| const TickObj< T > & | value ) |
Find the first entry a value does not follow.
| values | The entries, sorted by position. |
| value | The value to place. |
| std::vector< TickObj< T > >::const_iterator UpperBoundByTick | ( | const std::vector< TickObj< T > > & | values, |
| int | nTick ) |
Find the first entry a song position strictly precedes.
| values | The entries, sorted by position. |
| nTick | The song position, in MIDI ticks. |
| std::vector< TickObj< T > >::const_iterator LowerBoundByTick | ( | const std::vector< TickObj< T > > & | values, |
| int | nTick ) |
Find the first entry at or after a song position.
| values | The entries, sorted by position. |
| nTick | The song position, in MIDI ticks. |
| std::vector< TickObj< T > >::const_iterator FindAtOrBefore | ( | const std::vector< TickObj< T > > & | values, |
| int | nTick ) |
Find the last entry at or before a song position.
| values | The entries, sorted by position. |
| nTick | The song position, in MIDI ticks. |
| std::vector< TickObj< T > >::const_iterator FindAtOrAfter | ( | const std::vector< TickObj< T > > & | values, |
| int | nTick ) |
Find the first entry at or after a song position.
| values | The entries, sorted by position. |
| nTick | The song position, in MIDI ticks. |
| void InsertSorted | ( | std::vector< TickObj< T > > & | values, |
| const TickObj< T > & | value ) |
Insert an entry at its sorted place, after every entry at the same position.
An entry that does not precede the last one is appended without a search.
| values | The entries, sorted by position. |
| value | The entry to insert. |
| void InsertOrdered | ( | const T & | value, |
| std::vector< T > & | values, | ||
| Compare | compare ) |
Insert a value at its lower bound under a comparator, before every equal value.
The addresses are of the instantiations for the entries of PitchTrackRiffData::RiffSet, ScratchTrackData::ScratcherSet, AxeHarmony, and AxeTrackData::ContourSet, in that order.
| value | The value to insert. |
| values | The values, sorted under compare. |
| compare | The ordering. |
| void InsertOrdered | ( | const T & | value, |
| std::vector< T > & | values ) |
Insert a value at its lower bound, before every equal value.
The addresses are of the instantiations for the entries of PitchTrackRiffData::RiffSet, ScratchTrackData::ScratcherSet, AxeHarmony, and AxeTrackData::ContourSet, in that order.
| value | The value to insert. |
| values | The values, sorted. |
| void AddOrdered | ( | const T & | value, |
| std::vector< T > & | values, | ||
| Compare | compare ) |
Append a value that does not sort before the last one, and otherwise insert it at its lower bound.
The comparator decides only whether to append. The insertion orders the values by their own less-than. The addresses are of the instantiations for the entries of ScratchTrackData::ScratcherSet, AxeHarmony, and AxeTrackData::ContourSet, in that order.
| value | The value to add. |
| values | The values, sorted under compare. |
| compare | The ordering. |
| void AddOrdered | ( | const T & | value, |
| std::vector< T > & | values ) |
Append a value that does not sort before the last one, and otherwise insert it at its lower bound.
The addresses are of the instantiations for the entries of ScratchTrackData::ScratcherSet, AxeHarmony, and AxeTrackData::ContourSet, in that order.
| value | The value to add. |
| values | The values, sorted. |
| std::vector< T >::const_iterator FindOrdered | ( | const T & | key, |
| const std::vector< T > & | values, | ||
| Compare | compare ) |
Find the last value that does not sort after a key.
The addresses are of the instantiations for the entries of ScratchTrackData::ScratcherSet, AxeTrackData::ContourSet, and AxeHarmony, in that order.
| key | The key. |
| values | The values, sorted under compare. |
| compare | The ordering. |
| std::vector< T >::const_iterator FindOrdered | ( | const T & | key, |
| const std::vector< T > & | values ) |
Find the last value that does not sort after a key.
The addresses are of the instantiations for the entries of ScratchTrackData::ScratcherSet, AxeTrackData::ContourSet, and AxeHarmony, in that order.
| key | The key. |
| values | The values, sorted. |
| void SetAtTick | ( | std::vector< TickObj< T > > & | values, |
| const T & | value, | ||
| int | nTick ) |
Store a value at a song position, overwriting the first entry already at that position.
| values | The entries, sorted by position. |
| value | The value. |
| nTick | The song position, in MIDI ticks. |
| void InsertAtLowerBound | ( | std::vector< TickObj< T > > & | values, |
| const TickObj< T > & | value ) |
Insert an entry before every entry at the same position, always searching first.
MultiMuse::Add() takes this path when it is told not to try appending.
| values | The entries, sorted by position. |
| value | The entry to insert. |
| void InsertAtTick | ( | std::vector< TickObj< T > > & | values, |
| const T & | value, | ||
| int | nTick ) |
Insert a value at a song position, after every entry at the same position.
| values | The entries, sorted by position. |
| value | The value. |
| nTick | The song position, in MIDI ticks. |