69 return std::upper_bound(values.begin(), values.end(), value,
TickObjLess<T>);
82 return std::lower_bound(values.begin(), values.end(), value,
TickObjLess<T>);
93typename std::vector<TickObj<T> >::const_iterator
95 return std::upper_bound(values.begin(), values.end(), nTick,
TickObjBefore<T>);
106typename std::vector<TickObj<T> >::const_iterator
108 return std::lower_bound(values.begin(), values.end(), nTick,
TickObjAfter<T>);
119typename std::vector<TickObj<T> >::const_iterator
121 if (values.begin() == values.end()) {
125 if (upper == values.begin()) {
139typename std::vector<TickObj<T> >::const_iterator
141 if (values.begin() == values.end()) {
157 if (values.size() != 0 && !(value.
mPosition < values.back().mPosition)) {
158 values.push_back(value);
182template <
typename T,
typename Compare>
183void InsertOrdered(
const T &value, std::vector<T> &values, Compare compare) {
184 values.insert(std::lower_bound(values.begin(), values.end(), value, compare), value);
227template <
typename T,
typename Compare>
228void AddOrdered(
const T &value, std::vector<T> &values, Compare compare) {
229 if (!values.empty() && compare(value, values.back())) {
233 values.push_back(value);
274template <
typename T,
typename Compare>
275typename std::vector<T>::const_iterator
276FindOrdered(
const T &key,
const std::vector<T> &values, Compare compare) {
277 const auto upper = std::upper_bound(values.begin(), values.end(), key, compare);
278 if (upper == values.begin()) {
301typename std::vector<T>::const_iterator
FindOrdered(
const T &key,
const std::vector<T> &values) {
317 typename std::vector<TickObj<T> >::iterator it =
LowerBoundByEntry(values, entry);
318 if (it != values.end() && it->mPosition == nTick) {
322 values.insert(it, entry);
One value at one song position.
Definition tickobj.h:18
T mValue
Definition tickobj.h:20
int mPosition
Definition tickobj.h:19
std::vector< TickObj< T > >::const_iterator UpperBoundByTick(const std::vector< TickObj< T > > &values, int nTick)
Find the first entry a song position strictly precedes.
Definition tickobjvector.h:94
bool TickObjAfter(TickObj< T > entry, int nTick)
Report whether an entry comes strictly before a song position.
Definition tickobjvector.h:55
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.
Definition tickobjvector.h:107
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.
Definition tickobjvector.h:156
std::vector< TickObj< T > >::iterator LowerBoundByEntry(std::vector< TickObj< T > > &values, const TickObj< T > &value)
Find the first entry a value does not follow.
Definition tickobjvector.h:80
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.
Definition tickobjvector.h:140
void InsertAtLowerBound(std::vector< TickObj< T > > &values, const TickObj< T > &value)
Insert an entry before every entry at the same position, always searching first.
Definition tickobjvector.h:334
std::vector< TickObj< T > >::iterator UpperBoundByEntry(std::vector< TickObj< T > > &values, const TickObj< T > &value)
Find the first entry a value strictly precedes.
Definition tickobjvector.h:67
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.
Definition tickobjvector.h:228
bool TickObjLess(TickObj< T > first, TickObj< T > second)
Order two entries by song position.
Definition tickobjvector.h:31
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.
Definition tickobjvector.h:346
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.
Definition tickobjvector.h:276
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.
Definition tickobjvector.h:313
bool TickObjBefore(int nTick, TickObj< T > entry)
Report whether a song position comes strictly before an entry.
Definition tickobjvector.h:43
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.
Definition tickobjvector.h:183
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.
Definition tickobjvector.h:120