/external/eigen/unsupported/Eigen/src/SparseExtra/ |
D | DynamicSparseMatrix.h | 82 inline Index rows() const { return IsRowMajor ? outerSize() : m_innerSize; } 83 inline Index cols() const { return IsRowMajor ? m_innerSize : outerSize(); } 85 inline Index outerSize() const { return convert_index(m_data.size()); } 117 for (Index j=0; j<outerSize(); ++j) 125 for (Index j=0; j<outerSize(); ++j) 134 if (outerSize()>0) 136 Index reserveSizePerVector = (std::max)(reserveSize/outerSize(),Index(4)); 137 for (Index j=0; j<outerSize(); ++j) 193 for (Index j=0; j<outerSize(); ++j) 201 const Index outerSize = IsRowMajor ? rows : cols; [all …]
|
D | RandomSetter.h | 206 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize(); in RandomSetter() local 207 const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize(); in RandomSetter() 208 m_outerPackets = outerSize >> OuterPacketBits; in RandomSetter() 209 if (outerSize&OuterPacketMask) in RandomSetter() 225 for (Index j=0; j<mp_target->outerSize(); ++j) in RandomSetter() 261 VectorXi positions(mp_target->outerSize()); in ~RandomSetter() 275 for (Index j=0; j<mp_target->outerSize(); ++j) in ~RandomSetter() 283 mp_target->outerIndexPtr()[mp_target->outerSize()] = count; in ~RandomSetter()
|
D | BlockOfDynamicSparseMatrix.h | 47 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize) 48 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize) 50 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) ); 57 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
|
/external/sdv/vsomeip/third_party/boost/numeric/odeint/include/boost/numeric/odeint/external/eigen/ |
D | eigen_resize.hpp | 63 return ( ( m1.innerSize () == m2.innerSize () ) && ( m1.outerSize() == m2.outerSize() ) ); in same_size() 73 return ( ( v1.innerSize () == v2.innerSize () ) && ( v1.outerSize() == v2.outerSize() ) ); in same_size()
|
/external/eigen/test/ |
D | mapstride.cpp | 77 if(k==1 && (m.innerSize()+1)*m.outerSize() > maxsize2) in map_class_matrix() 84 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix() 99 if(k==1 && (m.innerSize()+4)*m.outerSize() > maxsize2) in map_class_matrix() 111 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix() 125 if(k==1 && (2*m.innerSize()+1)*(m.outerSize()*2) > maxsize2) in map_class_matrix() 133 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix() 147 if(k==1 && (m.innerSize()*2)*m.outerSize() > maxsize2) in map_class_matrix() 154 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix() 173 …Map<MatrixType, Unaligned, OuterStride<> > map2(array+(m.outerSize()-1)*outerstride, rows, cols, O… in map_class_matrix() 180 …Map<MatrixType, Unaligned, Stride<Dynamic,Dynamic> > map2(array+(m.outerSize()-1)*outerstride+m.in… in map_class_matrix() [all …]
|
D | sparse_basic.cpp | 84 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz))); in sparse_basic() 86 m2.reserve(m2.outerSize() * nnz); in sparse_basic() 114 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic() 137 …VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? int(m2.innerSize()) : std::max<int>(… in sparse_basic() 280 for(Index j = 0; j<m1.outerSize(); ++j) in sparse_basic() 311 for(Index j = 0; j<m2.outerSize(); ++j) in sparse_basic() 354 m2.reserve(VectorXi::Constant(m2.outerSize(), int(m2.innerSize()))); in sparse_basic() 656 static_array[1] = IteratorType(m2,m2.outerSize()-1); in sparse_basic() 671 iters[1] = IteratorType(m2,m2.outerSize()-1); in sparse_basic() 677 m1.reserve(ArrayXi::Constant(m1.outerSize(),1)); in sparse_basic() [all …]
|
D | sparse.h | 63 for(Index j=0; j<sparseMat.outerSize(); j++) 116 for(int j=0; j<sparseMat.outerSize(); j++)
|
/external/eigen/Eigen/src/SparseCore/ |
D | SparsePermutation.h | 44 Matrix<StorageIndex,Dynamic,1> sizes(mat.outerSize()); 45 for(Index j=0; j<mat.outerSize(); ++j) 51 for(Index j=0; j<mat.outerSize(); ++j) 64 Matrix<StorageIndex,Dynamic,1> sizes(tmp.outerSize()); 72 for(Index j=0; j<mat.outerSize(); ++j) 76 for(Index j=0; j<mat.outerSize(); ++j)
|
D | SparseMatrix.h | 145 inline Index outerSize() const { return m_outerSize; } 628 const Index outerSize = IsRowMajor ? rows : cols; 631 if (m_outerSize != outerSize || m_outerSize==0) 634 … m_outerIndex = static_cast<StorageIndex*>(std::malloc((outerSize + 1) * sizeof(StorageIndex))); 637 m_outerSize = outerSize; 807 for (Index i=0; i<m.outerSize(); ++i) 823 for (Index i=0; i<m.outerSize(); ++i) { 830 for (Index i=0; i<m.outerSize(); ++i) { 1045 typename SparseMatrixType::IndexVector wi(trMat.outerSize()); 1140 for(Index j=0; j<outerSize(); ++j) [all …]
|
D | SparseCompressedBase.h | 50 …os() { return Eigen::Map<IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); } 51 … return Eigen::Map<const IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); } 61 return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0]; 62 else if(derived().outerSize()==0)
|
D | SparseCwiseUnaryOp.h | 130 for (Index j=0; j<outerSize(); ++j) 142 for (Index j=0; j<outerSize(); ++j)
|
D | SparseVector.h | 84 EIGEN_STRONG_INLINE Index outerSize() const { return 1; } 296 eigen_assert(other.outerSize()==1); 454 eigen_internal_assert(src.outerSize()==src.size()); 469 if(src.outerSize()==1) sparse_vector_assign_selector<Dest,Src,SVA_Inner>::run(dst, src);
|
D | SparseView.h | 62 inline Index outerSize() const { return m_matrix.outerSize(); }
|
D | ConservativeSparseSparseProduct.h | 26 Index cols = rhs.outerSize(); 27 eigen_assert(lhs.outerSize() == rhs.innerSize()); 274 Index cols = rhs.outerSize(); 275 eigen_assert(lhs.outerSize() == rhs.innerSize());
|
D | SparseRedux.h | 22 for (Index j=0; j<outerSize(); ++j) in sum()
|
/external/eigen/Eigen/src/Core/ |
D | Assign_MKL.h | 94 …const Index outerSize = dst.outerSize(); … 95 …for(Index outer = 0; outer < outerSize; ++outer) { … 157 …const Index outerSize = dst.outerSize(); … 158 …for(Index outer = 0; outer < outerSize; ++outer) { …
|
D | AssignEvaluator.h | 345 for(Index outer = 0; outer < kernel.outerSize(); ++outer) { 370 const Index outerSize = kernel.outerSize(); 371 for(Index outer = 0; outer < outerSize; ++outer) 475 const Index outerSize = kernel.outerSize(); 477 for(Index outer = 0; outer < outerSize; ++outer) 500 const Index outerSize = kernel.outerSize(); 501 for(Index outer = 0; outer < outerSize; ++outer) 559 const Index outerSize = kernel.outerSize(); 563 for(Index outer = 0; outer < outerSize; ++outer) 597 for(Index outer = 0; outer < kernel.outerSize(); ++outer) [all …]
|
D | Redux.h | 205 for(Index i = 1; i < xpr.outerSize(); ++i) 297 const Index outerSize = xpr.outerSize(); 306 for(Index j=0; j<outerSize; ++j) 311 for(Index j=0; j<outerSize; ++j)
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
D | SkylineMatrix.h | 86 inline Index outerSize() const { 150 eigen_assert(outer < outerSize()); 199 eigen_assert(outer < outerSize()); 235 eigen_assert(idx < outerSize()); 244 eigen_assert(outer < outerSize()); 268 eigen_assert(outer < outerSize()); 288 eigen_assert(idx < outerSize()); 297 eigen_assert(outer < outerSize()); 316 eigen_assert(outer < outerSize()); 333 eigen_assert(outer < outerSize()); [all …]
|
/external/armnn/src/backends/reference/workloads/ |
D | Softmax.cpp | 29 const unsigned int outerSize = armnnUtils::GetNumElementsBetween(inputShape, 0, uAxis); in Softmax() local 35 for (unsigned int outer = 0; outer < outerSize; ++outer) in Softmax()
|
D | LogSoftmax.cpp | 46 const unsigned int outerSize = armnnUtils::GetNumElementsBetween(inputShape, 0, uAxis); in LogSoftmax() local 52 for (unsigned int outer = 0; outer < outerSize; ++outer) in LogSoftmax()
|
D | RefChannelShuffleWorkload.cpp | 57 uint32_t outerSize = getNumberOfElements(tensorShape, 0, channelsAxis); in Execute() local 60 for (uint32_t outer = 0; outer < outerSize; ++outer) in Execute()
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
D | BasicPreconditioners.h | 68 for(int j=0; j<mat.outerSize(); ++j) in factorize() 158 for(Index j=0; j<mat.outerSize(); ++j) in factorize() 169 for(Index j=0; j<mat.outerSize(); ++j) in factorize()
|
/external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
D | KroneckerTensorProduct.h | 169 for (Index kA=0; kA < m_A.outerSize(); ++kA) in evalTo() 174 for (Index kB=0; kB < m_B.outerSize(); ++kB) in evalTo() 182 for (Index kA=0; kA < m_A.outerSize(); ++kA) in evalTo() 184 for (Index kB=0; kB < m_B.outerSize(); ++kB) in evalTo()
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
D | Scaling.h | 93 for (int k=0; k<m_matrix.outerSize(); ++k) in compute() 123 for (int k=0; k<m_matrix.outerSize(); ++k) in compute()
|