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 >:

[legend]

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 95 of file RTOpPack_ROpMinIndexGreaterThanBound.hpp.