template <typename Index, int AStorageOrder, bool ConjugateA, int UpLo> \
struct general_matrix_matrix_rankupdate<Index,EIGTYPE,AStorageOrder,ConjugateA,ColMajor,UpLo> { \
enum { \
IsLower = (UpLo&Lower) == Lower, \
LowUp = IsLower ? Lower : Upper, \
conjA = (((AStorageOrder==ColMajor) && ConjugateA) || ((AStorageOrder==RowMajor) && !ConjugateA)) ? 1 : 0 \
}; \
const EIGTYPE* , Index , EIGTYPE*
res, Index resStride, EIGTYPE
alpha, level3_blocking<EIGTYPE, EIGTYPE>& ) \
{ \
typedef Matrix<EIGTYPE, Dynamic, Dynamic, AStorageOrder>
MatrixType; \
\
BlasIndex
lda=convert_index<BlasIndex>(lhsStride), ldc=convert_index<BlasIndex>(resStride),
n=convert_index<BlasIndex>(
size), k=convert_index<BlasIndex>(depth); \
char uplo=((IsLower) ? 'L' : 'U'), trans=((AStorageOrder==RowMajor) ? 'C':'N'); \
RTYPE alpha_, beta_; \
const EIGTYPE* a_ptr; \
\
beta_ = 1.0; \
\
if (conjA) { \
Map<const MatrixType, 0, OuterStride<> > mapA(lhs,
n,k,OuterStride<>(lhsStride)); \
} else a_ptr=lhs; \
BLASFUNC(&uplo, &trans, &
n, &k, &alpha_, (BLASTYPE*)a_ptr, &
lda, &beta_, (BLASTYPE*)
res, &ldc); \
} \
};
ArrayXXi a
Definition Array_initializer_list_23_cxx11.cpp:1
int n
Definition BiCGSTAB_simple.cpp:1
#define EIGEN_STRONG_INLINE
Definition Macros.h:917
cout<< "Here is the matrix m:"<< endl<< m<< endl;Matrix< ptrdiff_t, 3, 1 > res
Definition PartialRedux_count.cpp:3
Scalar Scalar int size
Definition benchVecAdd.cpp:17
MatrixXf MatrixType
Definition benchmark-blocking-sizes.cpp:52
* lda
Definition eigenvalues.cpp:59
RealScalar alpha
Definition level1_cplx_impl.h:147