/external/eigen/Eigen/src/SparseCore/ |
D | SparseMap.h | 124 …inline SparseMapBase(Index rows, Index cols, Index nnz, IndexPointer outerIndexPtr, IndexPointer i… 126 …(IsRowMajor?cols:rows), m_zero_nnz(0,internal::convert_index<StorageIndex>(nnz)), m_outerIndex(out… 131 inline SparseMapBase(Index size, Index nnz, IndexPointer innerIndexPtr, ScalarPointer valuePtr) 132 …: m_outerSize(1), m_innerSize(size), m_zero_nnz(0,internal::convert_index<StorageIndex>(nnz)), m_o… 195 …inline SparseMapBase(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex*… 197 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) 201 inline SparseMapBase(Index size, Index nnz, StorageIndex* innerIndexPtr, Scalar* valuePtr) 202 : Base(size, nnz, innerIndexPtr, valuePtr) 245 inline Map(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, 247 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) [all …]
|
D | SparseBlock.h | 46 Index nnz = 0; in nonZeros() local 50 ++nnz; in nonZeros() 51 return nnz; in nonZeros() 132 Index nnz = tmp.nonZeros(); 145 if(nnz>free_size) 148 … typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz); 153 …internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, newd… 154 …internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, newd… 156 …matrix.valuePtr()+end, matrix.valuePtr()+end + tail_size, newdata.valuePtr()+start+nnz); 157 …matrix.innerIndexPtr()+end, matrix.innerIndexPtr()+end + tail_size, newdata.indexPtr()+start+nnz); [all …]
|
D | ConservativeSparseSparseProduct.h | 51 Index nnz = 0; variable 64 indices[nnz] = i; 65 ++nnz; 74 for(Index k=0; k<nnz; ++k) 93 if((nnz<200 && nnz<t200) || nnz * numext::log2(int(nnz)) < t) 95 if(nnz>1) std::sort(indices,indices+nnz); 96 for(Index k=0; k<nnz; ++k)
|
D | MappedSparseMatrix.h | 42 …inline MappedSparseMatrix(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageI… 43 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZeroPtr)
|
D | SparseSelfAdjointView.h | 466 Index nnz = count.sum(); 469 dest.resizeNonZeros(nnz);
|
/external/libavc/common/arm/ |
D | ih264_resi_trans_quant_a9.s | 61 @ pointer to store nnz 92 @ :nnz 108 @R9 :nnz 227 vpadd.u8 d18, d16, d17 @I pair add nnz 1 228 vpadd.u8 d20, d18, d19 @I Pair add nnz 2 229 vpadd.u8 d22, d20, d21 @I Pair add nnz 3 233 vmov.u8 d25, #16 @I Get max nnz 234 vsub.u8 d26, d25, d24 @I invert current nnz 236 vst1.u8 d26[0], [r9] @I Write nnz 259 @ pointer to store nnz [all …]
|
/external/eigen/bench/ |
D | sparse_setter.cpp | 302 const int nnz, in coo_tocsr() argument 312 for (int n = 0; n < nnz; n++){ in coo_tocsr() 322 Bp[n_row] = nnz; in coo_tocsr() 325 for(int n = 0; n < nnz; n++){ in coo_tocsr() 384 I nnz = 0; in csr_sum_duplicates() local 397 Aj[nnz] = j; in csr_sum_duplicates() 398 Ax[nnz] = x; in csr_sum_duplicates() 399 nnz++; in csr_sum_duplicates() 401 Ap[i+1] = nnz; in csr_sum_duplicates()
|
/external/eigen/Eigen/src/OrderingMethods/ |
D | Ordering.h | 134 StorageIndex nnz = StorageIndex(mat.nonZeros()); in operator() local 136 StorageIndex Alen = internal::colamd_recommended(nnz, m, n); in operator() 144 for(StorageIndex i=0; i < nnz; i++) A(i) = mat.innerIndexPtr()[i]; in operator()
|
D | Eigen_Colamd.h | 257 inline IndexType colamd_recommended ( IndexType nnz, IndexType n_row, IndexType n_col) in colamd_recommended() argument 259 if ((nnz) < 0 || (n_row) < 0 || (n_col) < 0) in colamd_recommended() 262 return (2 * (nnz) + colamd_c (n_col) + colamd_r (n_row) + (n_col) + ((nnz) / 5)); in colamd_recommended() 327 IndexType nnz ; /* nonzeros in A */ in colamd() local 385 nnz = p [n_col] ; in colamd() 386 if (nnz < 0) /* nnz must be >= 0 */ in colamd() 389 stats [COLAMD_INFO1] = nnz ; in colamd() 390 COLAMD_DEBUG0 (("colamd: number of entries negative %d\n", nnz)) ; in colamd() 414 need = 2*nnz + n_col + Col_size + Row_size ; in colamd() 447 n_col2, max_deg, 2*nnz) ; in colamd()
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
D | IncompleteCholesky.h | 217 Index nnz = m_L.nonZeros(); in factorize() local 218 Map<VectorSx> vals(m_L.valuePtr(), nnz); //values in factorize() 219 Map<VectorIx> rowIdx(m_L.innerIndexPtr(), nnz); //Row indices in factorize() 329 vals = Map<const VectorSx>(L_save.valuePtr(), nnz); in factorize() 330 rowIdx = Map<const VectorIx>(L_save.innerIndexPtr(), nnz); in factorize()
|
/external/libavc/encoder/ |
D | ih264e_cavlc.c | 1233 UWORD32 *nnz; in ih264e_write_pslice_mb_cavlc() local 1246 nnz = (UWORD32 *)ps_ent_ctxt->pu1_top_nnz_luma[ps_ent_ctxt->i4_mb_x]; in ih264e_write_pslice_mb_cavlc() 1247 *nnz = 0; in ih264e_write_pslice_mb_cavlc() 1249 nnz = (UWORD32 *)ps_ent_ctxt->pu1_top_nnz_cbcr[ps_ent_ctxt->i4_mb_x]; in ih264e_write_pslice_mb_cavlc() 1250 *nnz = 0; in ih264e_write_pslice_mb_cavlc() 1544 UWORD32 *nnz; in ih264e_write_bslice_mb_cavlc() local 1557 nnz = (UWORD32 *)ps_ent_ctxt->pu1_top_nnz_luma[ps_ent_ctxt->i4_mb_x]; in ih264e_write_bslice_mb_cavlc() 1558 *nnz = 0; in ih264e_write_bslice_mb_cavlc() 1560 nnz = (UWORD32 *)ps_ent_ctxt->pu1_top_nnz_cbcr[ps_ent_ctxt->i4_mb_x]; in ih264e_write_bslice_mb_cavlc() 1561 *nnz = 0; in ih264e_write_bslice_mb_cavlc()
|
/external/eigen/doc/ |
D | SparseQuickReference.dox | 25 sm1.reserve(nnz); // Allocate room for nnz nonzeros elements. 28 <td> Note that when calling reserve(), it is not required that nnz is the exact number of nonzero e… 261 int innerIndices[nnz]; 262 double values[nnz]; 263 Map<SparseMatrix<double> > sm1(rows,cols,nnz,outerIndexPtr, // read-write
|
D | TutorialSparse.dox | 192 …st of a single purely random insertion into a SparseMatrix is \c O(nnz), where \c nnz is the curre…
|
/external/eigen/Eigen/src/SuperLUSupport/ |
D | SuperLUSupport.h | 139 union {int nnz;int lda;}; member 212 res.storage.nnz = internal::convert_index<int>(mat.nonZeros()); in Map() 271 res.storage.nnz = mat.nonZeros(); 721 m_l.resizeNonZeros(Lstore->nnz); 723 m_u.resizeNonZeros(Ustore->nnz);
|
/external/eigen/test/ |
D | sparse_basic.cpp | 73 Index nnz = internal::random<int>(1,int(rows)/2); in sparse_basic() local 77 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz))); in sparse_basic() 79 m2.reserve(m2.outerSize() * nnz); in sparse_basic() 84 for (Index k=0; k<nnz; ++k) in sparse_basic()
|
/external/eigen/Eigen/src/SparseLU/ |
D | SparseLU.h | 537 Index nnz = m_mat.nonZeros(); in factorize() local 541 Index info = Base::memInit(m, n, nnz, lwork, m_perfv.fillfactor, m_perfv.panel_size, m_glu); in factorize()
|
/external/webrtc/talk/media/testdata/ |
D | voice.rtpdump | 15 …�������������������wy��~]^l���nc_ihjo}}ken�����t���9��4�J��pjqy�����nnz���v{u��rn���uf\filj…
|