result.scalar = x(k) and result.index = k such that x(k) <= x(i) for i=0...n-1 and k is the minimum index to break ties.
More...
#include <RTOpPack_ROpMinIndex.hpp>
Inheritance diagram for RTOpPack::ROpMinIndex< Scalar >:

Public Member Functions | |
| ROpMinIndex () | |
| | |
| ScalarIndex< Scalar > | operator() (const ReductTarget &reduct_obj) const |
| | |
result.scalar = x(k) and result.index = k such that x(k) <= x(i) for i=0...n-1 and k is the minimum index to break ties.
Definition at line 91 of file RTOpPack_ROpMinIndex.hpp.
| RTOpPack::ROpMinIndex< Scalar >::ROpMinIndex | ( | ) | [inline] |
| ScalarIndex<Scalar> RTOpPack::ROpMinIndex< Scalar >::operator() | ( | const ReductTarget & | reduct_obj | ) | const [inline] |
Reimplemented from RTOpPack::ROpScalarReductionWithOpBase< Scalar, ReductScalar, ReductObjReduction >.
Definition at line 107 of file RTOpPack_ROpMinIndex.hpp.
1.4.7