Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <range_minimum_query.h>
Public Member Functions | |
RangeMinimumQuery (std::vector< T > array) | |
RangeMinimumQuery implementation. | |
RangeMinimumQuery (std::vector< T > array, Compare cmp) | |
RangeMinimumQuery (const RangeMinimumQuery &)=delete | |
This type is neither copyable nor movable. | |
RangeMinimumQuery & | operator= (const RangeMinimumQuery &)=delete |
T | GetMinimumFromRange (int from, int to) const |
const std::vector< T > & | array () const |
Definition at line 46 of file range_minimum_query.h.
|
inlineexplicit |
RangeMinimumQuery implementation.
Definition at line 99 of file range_minimum_query.h.
operations_research::RangeMinimumQuery< T, Compare >::RangeMinimumQuery | ( | std::vector< T > | array, |
Compare | cmp ) |
Reminder: The task is to fill cache_ so that cache_[k][i] = min(arr, i, i+2^k) for every k <= Log2(n) and i <= n-2^k.
Definition at line 107 of file range_minimum_query.h.
|
delete |
This type is neither copyable nor movable.
|
inline |
Definition at line 138 of file range_minimum_query.h.
|
inline |
Returns the minimum (w.r.t. Compare) arr[x], where x is contained in [from, to).
Definition at line 126 of file range_minimum_query.h.
|
delete |