Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:OnTheLeft (Results 1 - 19 of 19) sorted by null

/external/eigen/Eigen/src/SparseCore/
SparsePermutation.h	27 MoveOuter = SrcStorageOrder==RowMajor ? Side==OnTheLeft : Side==OnTheRight 45 MoveOuter = SrcStorageOrder==RowMajor ? Side==OnTheLeft : Side==OnTheRight 64 sizes[((Side==OnTheLeft) ^ Transposed) ? jp : j] = m_matrix.innerVector(((Side==OnTheRight) ^ Transposed) ? jp : j).size(); 71 Index jdst = ((Side==OnTheLeft) ^ Transposed) ? jp : j; 83 if((Side==OnTheLeft) ^ Transposed) 120 inline const internal::permut_sparsematrix_product_retval<PermutationBase<PermDerived>, SparseDerived, OnTheLeft, false> 123 return internal::permut_sparsematrix_product_retval<PermutationBase<PermDerived>, SparseDerived, OnTheLeft, false>(perm, matrix.derived()); 140 inline const internal::permut_sparsematrix_product_retval<PermutationBase<PermDerived>, SparseDerived, OnTheLeft, true> 143 return internal::permut_sparsematrix_product_retval<PermutationBase<PermDerived>, SparseDerived, OnTheLeft, true>(tperm.nestedPermutation(), matrix.derived());
/external/eigen/blas/
level2_impl.h	87 func[NOTR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,ColMajor>::run); 88 func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,RowMajor>::run); 89 func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, Conj, RowMajor>::run); 91 func[NOTR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,ColMajor>::run); 92 func[TR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,RowMajor>::run); 93 func[ADJ | (LO << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, Conj, RowMajor>::run); 95 func[NOTR | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,ColMajor>::run); 96 func[TR | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,RowMajor>::run); 97 func[ADJ | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,Conj, RowMajor>::run); 99 func[NOTR | (LO << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,ColMajor>::run)     [all...]
PackedTriangularSolverVector.h	20 struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, RowMajor> 48 struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, ColMajor> 79 packed_triangular_solve_vector<LhsScalar,RhsScalar,Index,OnTheLeft,
level3_impl.h	78 func[NOTR | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,ColMajor,ColMajor>::run); 79 func[TR | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,RowMajor,ColMajor>::run); 80 func[ADJ | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, Conj, RowMajor,ColMajor>::run); 86 func[NOTR | (LEFT << 2) | (LO << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,ColMajor,ColMajor>::run); 87 func[TR | (LEFT << 2) | (LO << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,RowMajor,ColMajor>::run); 88 func[ADJ | (LEFT << 2) | (LO << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, Conj, RowMajor,ColMajor>::run); 95 func[NOTR | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,ColMajor,ColMajor>::run); 96 func[TR | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,false,RowMajor,ColMajor>::run); 97 func[ADJ | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,Conj, RowMajor,ColMajor>::run); 103 func[NOTR | (LEFT << 2) | (LO << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,false,ColMajor,ColMajor>::run)     [all...]
/external/eigen/Eigen/src/Core/
DiagonalProduct.h	29 _ScalarAccessOnDiag = !((int(_StorageOrder) == ColMajor && int(ProductOrder) == OnTheLeft) 55 eigen_assert(diagonal.diagonal().size() == (ProductOrder == OnTheLeft ? matrix.rows() : matrix.cols())); 63 return m_diagonal.diagonal().coeff(ProductOrder == OnTheLeft ? row : col) * m_matrix.coeff(row, col); 80 const Index indexInDiagonalVector = ProductOrder == OnTheLeft ? row : col; 82 ((int(StorageOrder) == RowMajor && int(ProductOrder) == OnTheLeft)
PermutationMatrix.h	522 <PermutationDerived, Derived, OnTheLeft> 527 <PermutationDerived, Derived, OnTheLeft> 555 const Index n = Side==OnTheLeft ? rows() : cols(); 576 Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime>(dst, k) 577 .swap(Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime> 578 (dst,((Side==OnTheLeft) ^ Transposed) ? k0 : kPrev)); 589 Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime> 590 (dst, ((Side==OnTheLeft) ^ Transposed) ? m_permutation.indices().coeff(i) : i) 594 Block<const MatrixTypeNestedCleaned,Side==OnTheLeft ? 1 : MatrixType::RowsAtCompileTime,Side==OnTheRight ? 1 : MatrixType::ColsAtCompileTime> 669 inline const internal::permut_matrix_product_retval<PermutationType, OtherDerived, OnTheLeft, true     [all...]
Transpositions.h	343 <TranspositionDerived, Derived, OnTheLeft> 348 <TranspositionDerived, Derived, OnTheLeft> 385 if(Side==OnTheLeft) 424 inline const internal::transposition_matrix_product_retval<TranspositionType, Derived, OnTheLeft, true> 427 return internal::transposition_matrix_product_retval<TranspositionType, Derived, OnTheLeft, true>(m_transpositions, matrix.derived());
SolveTriangular.h	31 RhsIsVectorAtCompileTime = (Side==OnTheLeft ? Rhs::ColsAtCompileTime : Rhs::RowsAtCompileTime)==1 42 int Side, // can be OnTheLeft/OnTheRight 94 const Index othersize = Side==OnTheLeft? rhs.cols() : rhs.rows(); 141 struct triangular_solver_selector<Lhs,Rhs,OnTheLeft,Mode,CompleteUnrolling,1> { 177 eigen_assert( cols() == rows() && ((Side==OnTheLeft && cols() == other.rows()) || (Side==OnTheRight && cols() == other.cols())) ); 195 * \a Side==OnTheLeft (the default), or the right-inverse-multiply \a other * inverse(\c *this) if
DiagonalMatrix.h	62 const DiagonalProduct<MatrixDerived, Derived, OnTheLeft> 65 return DiagonalProduct<MatrixDerived, Derived, OnTheLeft>(matrix.derived(), derived());
TriangularMatrix.h	336 inline const internal::triangular_solve_retval<OnTheLeft,TriangularView, Other> 338 { return solve<OnTheLeft>(other); } 342 { return solveInPlace<OnTheLeft>(other); }
GeneralProduct.h	342 enum { Side = Lhs::IsVectorAtCompileTime ? OnTheLeft : OnTheRight }; 357 struct gemv_selector<OnTheLeft,StorageOrder,BlasCompatible>
/external/eigen/Eigen/src/Core/products/
TriangularSolverVector.h	22 triangular_solve_vector<LhsScalar,RhsScalar,Index,OnTheLeft, 31 struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, RowMajor> 85 struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, ColMajor>
TriangularSolverMatrix.h	28 Scalar, Index, Side==OnTheLeft?OnTheRight:OnTheLeft, 39 struct triangular_solve_matrix<Scalar,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor> 48 EIGEN_DONT_INLINE void triangular_solve_matrix<Scalar,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor>::run(
TriangularSolverMatrix_MKL.h	43 struct triangular_solve_matrix<EIGTYPE,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor> \
/external/eigen/Eigen/src/Householder/
HouseholderSequence.h	22 * \tparam Side either OnTheLeft (the default) or OnTheRight 66 RowsAtCompileTime = Side==OnTheLeft ? traits<VectorsType>::RowsAtCompileTime 69 MaxRowsAtCompileTime = Side==OnTheLeft ? traits<VectorsType>::MaxRowsAtCompileTime 80 typedef HouseholderSequence<VectorsType, CoeffsType, OnTheLeft> HouseholderSequenceType; 174 Index rows() const { return Side==OnTheLeft ? m_vectors.rows() : m_vectors.cols(); } 424 return HouseholderSequence<VectorsType,CoeffsType,OnTheLeft>(v, h); 431 * the constructed HouseholderSequence is set to OnTheRight, instead of the default OnTheLeft.
/external/eigen/Eigen/src/Core/util/
Constants.h	277 OnTheLeft = 1,
ForwardDeclarations.h	227 template<typename VectorsType, typename CoeffsType, int Side=OnTheLeft> class HouseholderSequence;
/external/eigen/Eigen/src/Eigenvalues/
GeneralizedSelfAdjointEigenSolver.h	186 cholB.matrixL().template solveInPlace<OnTheLeft>(matC);
/external/eigen/test/
product_trmm.cpp	19 typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:OtherOrder> OnTheLeft; 27 OnTheLeft ge_left(otherCols,rows);

Completed in 282 milliseconds