result.scalar = x(k) and result.index = k such that x(k) <= x(i) for all i where x(i) > bound and k is the minimum index to break ties.
More...
#include <RTOpPack_ROpMinIndexGreaterThanBound.hpp>
Inheritance diagram for RTOpPack::ROpMinIndexGreaterThanBound< Scalar >:

Public Member Functions | |
| ROpMinIndexGreaterThanBound (const Scalar &bound_in=Teuchos::ScalarTraits< Scalar >::zero()) | |
| | |
| void | bound (const Scalar &bound_in) |
| | |
| ScalarIndex< Scalar > | operator() (const ReductTarget &reduct_obj) const |
| | |
result.scalar = x(k) and result.index = k such that x(k) <= x(i) for all i where x(i) > bound and k is the minimum index to break ties.
If no element is greater than bound then results.index < 0.
Definition at line 82 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.
| RTOpPack::ROpMinIndexGreaterThanBound< Scalar >::ROpMinIndexGreaterThanBound | ( | const Scalar & | bound_in = Teuchos::ScalarTraits<Scalar>::zero() |
) | [inline] |
| void RTOpPack::ROpMinIndexGreaterThanBound< Scalar >::bound | ( | const Scalar & | bound_in | ) | [inline] |
| ScalarIndex<Scalar> RTOpPack::ROpMinIndexGreaterThanBound< Scalar >::operator() | ( | const ReductTarget & | reduct_obj | ) | const [inline] |
Reimplemented from RTOpPack::ROpScalarReductionWithOpBase< Scalar, ReductScalar, ReductObjReduction >.
Definition at line 109 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.
1.4.7