Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <range_minimum_query.h>
Public Member Functions | |
RangeMinimumIndexQuery (std::vector< T > array) | |
RangeMinimumIndexQuery implementation. | |
RangeMinimumIndexQuery (std::vector< T > array, Compare cmp) | |
RangeMinimumIndexQuery (const RangeMinimumIndexQuery &)=delete | |
This type is neither copyable nor movable. | |
RangeMinimumIndexQuery & | operator= (const RangeMinimumIndexQuery &)=delete |
int | GetMinimumIndexFromRange (int from, int to) const |
const std::vector< T > & | array () const |
Returns the original array. | |
RangeMinimumIndexQuery is similar to RangeMinimumQuery, but GetMinimumIndexFromRange returns the index for which the minimum is attained.
Definition at line 70 of file range_minimum_query.h.
|
inlineexplicit |
RangeMinimumIndexQuery implementation.
Definition at line 144 of file range_minimum_query.h.
operations_research::RangeMinimumIndexQuery< T, Compare >::RangeMinimumIndexQuery | ( | std::vector< T > | array, |
Compare | cmp ) |
Definition at line 149 of file range_minimum_query.h.
|
delete |
This type is neither copyable nor movable.
|
inline |
Returns the original array.
Definition at line 174 of file range_minimum_query.h.
|
inline |
Returns an index idx from [from, to) such that arr[idx] is the minimum value of arr over the interval [from, to).
Definition at line 155 of file range_minimum_query.h.
|
delete |