10 #ifndef EIGEN_PACKED_TRIANGULAR_SOLVER_VECTOR_H
11 #define EIGEN_PACKED_TRIANGULAR_SOLVER_VECTOR_H
15 template<
typename LhsScalar,
typename RhsScalar,
typename Index,
int S
ide,
int Mode,
bool Conjugate,
int StorageOrder>
19 template<
typename LhsScalar,
typename RhsScalar,
typename Index,
int Mode,
bool Conjugate>
27 internal::conj_if<Conjugate> cj;
28 typedef Map<const Matrix<LhsScalar,Dynamic,1> > LhsMap;
31 lhs += IsLower ? 0 : (
size*(
size+1)>>1)-1;
37 rhs[
i] -= (ConjLhsType(LhsMap(lhs+
s,pi))
38 .cwiseProduct(Map<
const Matrix<RhsScalar,Dynamic,1> >(rhs+(IsLower ? 0 :
i+1),pi))).sum();
40 rhs[
i] /= cj(lhs[IsLower ?
i : 0]);
41 IsLower ? lhs += pi+1 : lhs -= pi+2;
47 template<
typename LhsScalar,
typename RhsScalar,
typename Index,
int Mode,
bool Conjugate>
55 internal::conj_if<Conjugate> cj;
56 typedef Map<const Matrix<LhsScalar,Dynamic,1> > LhsMap;
59 lhs += IsLower ? 0 :
size*(
size-1)>>1;
65 rhs[
i] /= cj(lhs[IsLower ? 0 :
i]);
67 Map<Matrix<RhsScalar,Dynamic,1> >(rhs+(IsLower?
i+1 : 0),r) -=
68 rhs[
i] * ConjLhsType(LhsMap(lhs+(IsLower? 1 : 0),r));
69 IsLower ? lhs +=
size-pi : lhs -= r;
74 template<
typename LhsScalar,
typename RhsScalar,
typename Index,
int Mode,
bool Conjugate,
int StorageOrder>
88 #endif // EIGEN_PACKED_TRIANGULAR_SOLVER_VECTOR_H