|
Collection of Concrete Vector Reduction/Transformation Operator Implementations
Version of the Day
|
Returns the maximum element less than some bound along with its index: 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_ROpMaxIndexLessThanBound.hpp>

Public Member Functions | |
| ROpMaxIndexLessThanBound (const Scalar &bound_in=Teuchos::ScalarTraits< Scalar >::zero()) | |
| | |
| void | bound (const Scalar &bound_in) |
| | |
| ScalarIndex< Scalar > | operator() (const ReductTarget &reduct_obj) const |
| | |
Returns the maximum element less than some bound along with its index: 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 less than bound then results.index < 0.
Definition at line 95 of file RTOpPack_ROpMaxIndexLessThanBound.hpp.
| RTOpPack::ROpMaxIndexLessThanBound< Scalar >::ROpMaxIndexLessThanBound | ( | const Scalar & | bound_in = Teuchos::ScalarTraits<Scalar>::zero() | ) | [inline] |
Definition at line 104 of file RTOpPack_ROpMaxIndexLessThanBound.hpp.
| void RTOpPack::ROpMaxIndexLessThanBound< Scalar >::bound | ( | const Scalar & | bound_in | ) | [inline] |
Definition at line 114 of file RTOpPack_ROpMaxIndexLessThanBound.hpp.
| ScalarIndex<Scalar> RTOpPack::ROpMaxIndexLessThanBound< Scalar >::operator() | ( | const ReductTarget & | reduct_obj | ) | const [inline] |
Reimplemented from RTOpPack::ROpScalarReductionWithOpBase< Scalar, ReductScalar, ReductObjReduction >.
Definition at line 121 of file RTOpPack_ROpMaxIndexLessThanBound.hpp.
1.7.6.1