/usr/include/ITK-4.12/itkBinaryOperationConcept.h is in libinsighttoolkit4-dev 4.12.2-dfsg1-1ubuntu1.
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 | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkBinaryOperationConcept_h
#define itkBinaryOperationConcept_h
#include "itkPromoteType.h"
/// \cond HIDE_META_PROGRAMMING
namespace itk {
namespace Details {
namespace op {
/** Root Binary Operation Concept.
* All binary operations are expected to inherit from this type.
* These types will help to implement binary operations between arrays (\c
* VariableLengthVector) through Expression Template technique.
*
* \c BinaryOperationConcept subclasses are expected to provide a template
* function \c apply() that implements the actual binary operation (addition,
* substraction, ...).
* \ingroup ITKCommon
* \sa \c itk::VariableLengthVector
* \sa \c itk::VariableLengthVectorExpression
*/
struct BinaryOperationConcept { };
/** Addition operation.
* The result type will be automatically promototed to the best type.
* \ingroup ITKCommon
*/
struct Plus : BinaryOperationConcept
{
template <typename T1, typename T2>
static typename mpl::PromoteType<T1, T2>::Type Apply(T1 const& lhs, T2 const& rhs) ITK_NOEXCEPT
{ return lhs + rhs; }
};
/** Subtraction operation.
* The result type will be automatically promototed to the best type.
* \ingroup ITKCommon
*/
struct Sub : BinaryOperationConcept
{
template <typename T1, typename T2>
static typename mpl::PromoteType<T1, T2>::Type Apply(T1 const& lhs, T2 const& rhs) ITK_NOEXCEPT
{ return lhs - rhs; }
};
/** Multiplication operation.
* The result type will be automatically promototed to the best type.
* \ingroup ITKCommon
*/
struct Mult : BinaryOperationConcept
{
template <typename T1, typename T2>
static typename mpl::PromoteType<T1, T2>::Type Apply(T1 const& lhs, T2 const& rhs) ITK_NOEXCEPT
{ return lhs * rhs; }
};
/** Division operation.
* The result type will be automatically promototed to the best type.
* \ingroup ITKCommon
*/
struct Div : BinaryOperationConcept
{
template <typename T1, typename T2>
static typename mpl::PromoteType<T1, T2>::Type Apply(T1 const& lhs, T2 const& rhs) ITK_NOEXCEPT
{ return lhs / rhs; }
};
} // itk::Details::op namespace
} // itk::Details namespace
} // itk namespace
/// \endcond
#endif // itkBinaryOperationConcept_h
|