/usr/include/trilinos/RTOpPack_ROpMinIndexGreaterThanBound.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 | // @HEADER
// ***********************************************************************
//
// RTOp: Interfaces and Support Software for Vector Reduction Transformation
// Operations
// Copyright (2006) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
//
// ***********************************************************************
// @HEADER
#ifndef RTOPPACK_ROP_MIN_INDEX_GREATER_THAN_BOUND_HPP
#define RTOPPACK_ROP_MIN_INDEX_GREATER_THAN_BOUND_HPP
#include "RTOpPack_ROpMinIndex.hpp"
#include "Teuchos_StandardMemberCompositionMacros.hpp"
namespace RTOpPack {
/** \brief . */
template<class Scalar>
class ROpMinIndexGreaterThanBoundEleWiseReductionOp {
public:
/** \brief . */
ROpMinIndexGreaterThanBoundEleWiseReductionOp(
const Scalar &bound = ScalarTraits<Scalar>::zero()
)
:bound_(bound)
{}
/** \brief . */
void operator()(const index_type i, const Scalar &v0,
ScalarIndex<Scalar> &reduct) const
{
if(
v0 > bound_
&&
(
v0 < reduct.scalar
||
( v0 == reduct.scalar && i < reduct.index )
)
)
{
reduct = ScalarIndex<Scalar>(v0, i);
}
}
private:
Scalar bound_;
};
/** \brief Returns the minimum element greater than some bound along
* with its index: <tt>result.scalar = x(k)</tt> and <tt>result.index
* = k</tt> such that <tt>x(k) <= x(i)</tt> for all <tt>i</tt> where
* <tt>x(i) > bound</tt> and <tt>k</tt> is the minimum index to break
* ties.
*
* If no element is greater than <tt>bound</tt> then <tt>results.index
* < 0</tt>.
*/
template<class Scalar>
class ROpMinIndexGreaterThanBound
: public ROp_1_CoordVariantScalarReduction<
Scalar,
ScalarIndex<Scalar>,
ROpMinIndexGreaterThanBoundEleWiseReductionOp<Scalar>,
ROpMinIndexReductObjReductionOp<Scalar> >
{
public:
/** \brief . */
ROpMinIndexGreaterThanBound(
const Scalar &bound_in = Teuchos::ScalarTraits<Scalar>::zero()
)
{
this->setOpNameBase("ROpMinIndexGreaterThanBound");
bound(bound_in);
initReductObjValue(
ScalarIndex<Scalar>(+ScalarTraits<Scalar>::rmax(), -1));
}
/** \brief . */
void bound(const Scalar& bound_in)
{
this->setEleWiseReduction(
ROpMinIndexGreaterThanBoundEleWiseReductionOp<Scalar>(bound_in)
);
}
/** \brief . */
ScalarIndex<Scalar> operator()(const ReductTarget& reduct_obj ) const
{ return this->getRawVal(reduct_obj); }
};
} // namespace RTOpPack
#endif // RTOPPACK_ROP_MIN_INDEX_GREATER_THAN_BOUND_HPP
|