RTOpPack::ROpMinIndexGreaterThanBound< Scalar > Class Template Reference

Returns the minimum element greater 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_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

Detailed Description

template<class Scalar>
class RTOpPack::ROpMinIndexGreaterThanBound< Scalar >

Returns the minimum element greater 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 greater than bound then results.index < 0.

Definition at line 63 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.

Constructor & Destructor Documentation

template<class Scalar >

RTOpPack::ROpMinIndexGreaterThanBound< Scalar >::ROpMinIndexGreaterThanBound ( const Scalar &  bound_in = Teuchos::ScalarTraits<Scalar>::zero() )

inline

Definition at line 73 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.

Member Function Documentation

template<class Scalar >

void RTOpPack::ROpMinIndexGreaterThanBound< Scalar >::bound ( const Scalar &  bound_in )

inline

Definition at line 83 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.

template<class Scalar >

ScalarIndex<Scalar> RTOpPack::ROpMinIndexGreaterThanBound< Scalar >::operator() ( const ReductTarget &  reduct_obj ) const

inline

Definition at line 90 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.

---

The documentation for this class was generated from the following file:

• RTOpPack_ROpMinIndexGreaterThanBound.hpp