Lines Matching refs:Lhs
17 template<typename Lhs, typename Rhs, int Mode,
23 int StorageOrder = int(traits<Lhs>::Flags) & RowMajorBit>
27 template<typename Lhs, typename Rhs, int Mode>
28 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,RowMajor>
31 static void run(const Lhs& lhs, Rhs& other)
35 for(int i=0; i<lhs.rows(); ++i)
40 for(typename Lhs::InnerIterator it(lhs, i); it; ++it)
61 template<typename Lhs, typename Rhs, int Mode>
62 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,RowMajor>
65 static void run(const Lhs& lhs, Rhs& other)
69 for(int i=lhs.rows()-1 ; i>=0 ; --i)
73 typename Lhs::InnerIterator it(lhs, i);
99 template<typename Lhs, typename Rhs, int Mode>
100 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,ColMajor>
103 static void run(const Lhs& lhs, Rhs& other)
107 for(int i=0; i<lhs.cols(); ++i)
112 typename Lhs::InnerIterator it(lhs, i);
131 template<typename Lhs, typename Rhs, int Mode>
132 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,ColMajor>
135 static void run(const Lhs& lhs, Rhs& other)
139 for(int i=lhs.cols()-1; i>=0; --i)
147 typename Lhs::ReverseInnerIterator it(lhs, i);
153 typename Lhs::InnerIterator it(lhs, i);
197 template<typename Lhs, typename Rhs, int Mode,
203 int StorageOrder = int(Lhs::Flags) & (RowMajorBit)>
207 template<typename Lhs, typename Rhs, int Mode, int UpLo>
208 struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
211 typedef typename promote_index_type<typename traits<Lhs>::Index,
213 static void run(const Lhs& lhs, Rhs& other)
233 for(int i=IsLower?0:lhs.cols()-1;
234 IsLower?i<lhs.cols():i>=0;
242 typename Lhs::InnerIterator it(lhs, i);
251 ci /= lhs.coeff(i,i);
