HomeSort by relevance Sort by last modified time
    Searched refs:outerSize (Results 1 - 25 of 39) sorted by null

1 2

  /external/eigen/unsupported/Eigen/src/SparseExtra/
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...]
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()) );
RandomSetter.h 184 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize();
185 const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize();
186 m_outerPackets = outerSize >> OuterPacketBits;
187 if (outerSize&OuterPacketMask)
203 for (Index j=0; j<mp_target->outerSize(); ++j)
239 VectorXi positions(mp_target->outerSize());
253 for (Index j=0; j<mp_target->outerSize(); ++j)
261 mp_target->outerIndexPtr()[mp_target->outerSize()] = count;
  /external/eigen/Eigen/src/Core/
Assign_MKL.h 93 const Index outerSize = dst.outerSize(); \
94 for(Index outer = 0; outer < outerSize; ++outer) { \
155 const Index outerSize = dst.outerSize(); \
156 for(Index outer = 0; outer < outerSize; ++outer) { \
AssignEvaluator.h 324 for(Index outer = 0; outer < kernel.outerSize(); ++outer) {
349 const Index outerSize = kernel.outerSize();
350 for(Index outer = 0; outer < outerSize; ++outer)
454 const Index outerSize = kernel.outerSize();
456 for(Index outer = 0; outer < outerSize; ++outer)
479 const Index outerSize = kernel.outerSize();
480 for(Index outer = 0; outer < outerSize; ++outer
    [all...]
Redux.h 197 for(Index i = 1; i < mat.outerSize(); ++i)
278 const Index outerSize = mat.outerSize();
287 for(Index j=0; j<outerSize; ++j)
292 for(Index j=0; j<outerSize; ++j)
361 EIGEN_DEVICE_FUNC Index outerSize() const { return m_xpr.outerSize(); }
  /external/eigen/Eigen/src/SparseCore/
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)
SparseRedux.h 22 for (Index j=0; j<outerSize(); ++j)
SparseCwiseUnaryOp.h 128 for (Index j=0; j<outerSize(); ++j)
140 for (Index j=0; j<outerSize(); ++j)
SparseCompressedBase.h 50 Eigen::Map<IndexVector> innerNonZeros() { return Eigen::Map<IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
51 const Eigen::Map<const IndexVector> innerNonZeros() const { return Eigen::Map<const IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
61 return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0];
62 else if(derived().outerSize()==0)
SparseMatrix.h 143 inline Index outerSize() const { return m_outerSize; }
278 * for \c i in the [0,this->outerSize()[ range.
623 const Index outerSize = IsRowMajor ? rows : cols;
626 if (m_outerSize != outerSize || m_outerSize==0)
629 m_outerIndex = static_cast<StorageIndex*>(std::malloc((outerSize + 1) * sizeof(StorageIndex)));
632 m_outerSize = outerSize;
799 for (Index i=0; i<m.outerSize(); ++i)
815 for (Index i=0; i<m.outerSize(); ++i) {
822 for (Index i=0; i<m.outerSize(); ++i) {
    [all...]
SparseBlock.h 25 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
32 : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize)
75 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
108 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
112 : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize)
129 eigen_internal_assert(tmp.outerSize()==m_outerSize.value());
136 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
159 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
205 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
280 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize
    [all...]
SparseMatrixBase.h 184 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); }
222 for (Index row=0; row<nm.outerSize(); ++row)
362 InnerVectorsReturnType innerVectors(Index outerStart, Index outerSize);
363 const ConstInnerVectorsReturnType innerVectors(Index outerStart, Index outerSize) const;
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);
SparseView.h 62 inline Index outerSize() const { return m_matrix.outerSize(); }
ConservativeSparseSparseProduct.h 22 // make sure to call innerSize/outerSize since we fake the storage order.
24 Index cols = rhs.outerSize();
25 eigen_assert(lhs.outerSize() == rhs.innerSize());
267 Index cols = rhs.outerSize();
268 eigen_assert(lhs.outerSize() == rhs.innerSize());
SparseDenseProduct.h 38 Index n = lhs.outerSize();
97 for(Index j=0; j<lhs.outerSize(); ++j)
118 for(Index j=0; j<lhs.outerSize(); ++j)
137 for(Index j=0; j<lhs.outerSize(); ++j)
  /external/eigen/Eigen/src/IterativeLinearSolvers/
BasicPreconditioners.h 68 for(int j=0; j<mat.outerSize(); ++j)
158 for(Index j=0; j<mat.outerSize(); ++j)
169 for(Index j=0; j<mat.outerSize(); ++j)
  /external/eigen/test/
mapstride.cpp 79 if(k==1 && (m.innerSize()+1)*m.outerSize() > maxsize2)
86 for(int i = 0; i < m.outerSize(); ++i)
101 if(k==1 && (m.innerSize()+4)*m.outerSize() > maxsize2)
113 for(int i = 0; i < m.outerSize(); ++i)
127 if(k==1 && (2*m.innerSize()+1)*(m.outerSize()*2) > maxsize2)
135 for(int i = 0; i < m.outerSize(); ++i)
sparse.h 69 for(Index j=0; j<sparseMat.outerSize(); j++)
122 for(int j=0; j<sparseMat.outerSize(); j++)
sparse_basic.cpp 25 //const Index outer = ref.outerSize();
77 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz)));
79 m2.reserve(m2.outerSize() * nnz);
107 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
130 VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? int(m2.innerSize()) : std::max<int>(1,int(m2.innerSize())/8)));
252 for(Index j = 0; j<m1.outerSize(); ++j)
283 for(Index j = 0; j<m2.outerSize(); ++j)
326 m2.reserve(VectorXi::Constant(m2.outerSize(), int(m2.innerSize())));
598 static_array[1] = IteratorType(m2,m2.outerSize()-1);
613 iters[1] = IteratorType(m2,m2.outerSize()-1)
    [all...]
  /external/eigen/unsupported/Eigen/src/Skyline/
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...]
SkylineMatrixBase.h 128 Index outerSize() const {
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
Scaling.h 93 for (int k=0; k<m_matrix.outerSize(); ++k)
117 for (int k=0; k<m_matrix.outerSize(); ++k)
  /external/eigen/unsupported/Eigen/src/KroneckerProduct/
KroneckerTensorProduct.h 169 for (Index kA=0; kA < m_A.outerSize(); ++kA)
174 for (Index kB=0; kB < m_B.outerSize(); ++kB)
182 for (Index kA=0; kA < m_A.outerSize(); ++kA)
184 for (Index kB=0; kB < m_B.outerSize(); ++kB)

Completed in 253 milliseconds

1 2