/usr/include/fflas-ffpack/fflas/fflas_enum.h is in fflas-ffpack-common 2.2.2-5.
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 | /* -*- mode: C++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
/* fflas_enum.h
* Copyright (C) The FFLAS-FFPACK group
*
* Written by Clement Pernet <Clement.Pernet@imag.fr>
*
* ========LICENCE========
* This file is part of the library FFLAS-FFPACK.
*
* FFLAS-FFPACK 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*.
*/
#ifndef __FFLASFFPACK_enum_INL
#define __FFLASFFPACK_enum_INL
namespace FFLAS {
/// Storage by row or col ?
enum FFLAS_ORDER {
FflasRowMajor=101, /**< row major */
FflasColMajor=102 /**< col major */
};
// public:
/// Is matrix transposed ?
enum FFLAS_TRANSPOSE {
FflasNoTrans = 111, /**< Matrix is not transposed */
FflasTrans = 112 /**< Matrix is transposed */
};
/// Is triangular matrix's shape upper ?
enum FFLAS_UPLO {
FflasUpper = 121, /**< Triangular matrix is Upper triangular (if \f$i>j\f$ then \f$T_{i,j} = 0\f$)*/
FflasLower = 122 /**< Triangular matrix is Lower triangular (if \f$i<j\f$ then \f$T_{i,j} = 0\f$)*/
};
/// Is the triangular matrix implicitly unit diagonal ?
enum FFLAS_DIAG {
FflasNonUnit = 131, /**< Triangular matrix has an explicit arbitrary diagonal */
FflasUnit = 132 /**< Triangular matrix has an implicit unit diagonal (\f$T_{i,i} = 1\f$)*/ /**< */
};
/// On what side ?
enum FFLAS_SIDE {
FflasLeft = 141,/**< Operator applied on the left */
FflasRight = 142 /**< Operator applied on the rigth*/
};
/** \p FFLAS_BASE determines the type of the element representation for Matrix Mult kernel. (deprecated, should not be used) */
enum FFLAS_BASE {
FflasDouble = 151, /**< to use the double precision BLAS */
FflasFloat = 152, /**< to use the single precison BLAS */
FflasGeneric = 153 /**< for any other domain, that can not be converted to floating point integers */
};
}
#include <algorithm>
namespace FFLAS{ namespace Protected {
template <class X, class Y> class AreEqual {
public:
static const bool value = false;
};
template <class X> class AreEqual<X, X> {
public:
static const bool value = true;
};
} // Protected
} // class FFLAS
namespace FFLAS {
template <class T> const T &min3(const T &m, const T &n, const T &k) { return std::min(m, std::min(n, k)); }
template <class T> const T &max3(const T &m, const T &n, const T &k) { return std::max(m, std::min(n, k)); }
template <class T> const T &min4(const T &m, const T &n, const T &k, const T &l) {
return std::min(std::min(m, n), std::min(k, l));
}
template <class T> const T &max4(const T &m, const T &n, const T &k, const T &l) {
return std::max(std::max(m, n), std::max(k, l));
}
} // FFLAS
#endif // __FFLASFFPACK_enum_INL
|