HomeSort by relevance Sort by last modified time
    Searched refs:nnz (Results 1 - 17 of 17) sorted by null

  /external/eigen/Eigen/src/SparseCore/
MappedSparseMatrix.h 42 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr, Scalar* valuePtr, StorageIndex* innerNonZeroPtr = 0)
43 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZeroPtr)
SparseMap.h 124 inline SparseMapBase(Index rows, Index cols, Index nnz, IndexPointer outerIndexPtr, IndexPointer innerIndexPtr,
126 : m_outerSize(IsRowMajor?rows:cols), m_innerSize(IsRowMajor?cols:rows), m_zero_nnz(0,internal::convert_index<StorageIndex>(nnz)), m_outerIndex(outerIndexPtr),
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_outerIndex(m_zero_nnz.data()),
195 inline SparseMapBase(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr,
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)
237 /** Constructs a read-write Map to a sparse matrix of size \a rows x \a cols, containing \a nnz non-zero coefficients,
245 inline Map(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr
    [all...]
SparseBlock.h 46 Index nnz = 0; local
50 ++nnz;
51 return nnz;
132 Index nnz = tmp.nonZeros(); local
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, newdata.valuePtr() + start);
154 internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, newdata.indexPtr() + start);
156 internal::smart_copy(matrix.valuePtr()+end, matrix.valuePtr()+end + tail_size, newdata.valuePtr()+start+nnz);
157 internal::smart_copy(matrix.innerIndexPtr()+end, matrix.innerIndexPtr()+end + tail_size, newdata.indexPtr()+start+nnz);
489 Index nnz = m_block.nonZeros(); local
    [all...]
ConservativeSparseSparseProduct.h 41 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs)
51 Index nnz = 0; local
64 indices[nnz] = i;
65 ++nnz;
74 for(Index k=0; k<nnz; ++k)
87 // FIXME reserve nnz non zeros
88 // FIXME implement faster sorting algorithms for very small nnz
93 if((nnz<200 && nnz<t200) || nnz * numext::log2(int(nnz)) < t
    [all...]
SparseSelfAdjointView.h 467 Index nnz = count.sum(); local
470 dest.resizeNonZeros(nnz);
  /external/eigen/Eigen/src/OrderingMethods/
Ordering.h 134 StorageIndex nnz = StorageIndex(mat.nonZeros()); local
136 StorageIndex Alen = internal::colamd_recommended(nnz, m, n);
144 for(StorageIndex i=0; i < nnz; i++) A(i) = mat.innerIndexPtr()[i];
Eigen_Colamd.h 189 the COLAMD_RECOMMENDED (nnz, n_row, n_col) macro. It returns -1 if any
190 argument is negative. 2*nnz space is required for the row and column
194 and nnz/5 more space is recommended for run time efficiency.
251 * \param nnz nonzeros in A
257 inline IndexType colamd_recommended ( IndexType nnz, IndexType n_row, IndexType n_col)
259 if ((nnz) < 0 || (n_row) < 0 || (n_col) < 0)
262 return (2 * (nnz) + colamd_c (n_col) + colamd_r (n_row) + (n_col) + ((nnz) / 5));
327 IndexType nnz ; /* nonzeros in A */ local
385 nnz = p [n_col]
    [all...]
  /external/libavc/common/arm/
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/
sparse_setter.cpp 107 std::cout << "nnz = " << coords.size() << "\n";
302 const int nnz,
312 for (int n = 0; n < nnz; n++){
316 //cumsum the nnz per row to get Bp[]
322 Bp[n_row] = nnz;
325 for(int n = 0; n < nnz; n++){
384 I nnz = 0; local
397 Aj[nnz] = j;
398 Ax[nnz] = x;
399 nnz++
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteCholesky.h 217 Index nnz = m_L.nonZeros(); local
218 Map<VectorSx> vals(m_L.valuePtr(), nnz); //values
219 Map<VectorIx> rowIdx(m_L.innerIndexPtr(), nnz); //Row indices
329 vals = Map<const VectorSx>(L_save.valuePtr(), nnz);
330 rowIdx = Map<const VectorIx>(L_save.innerIndexPtr(), nnz);
  /external/libavc/encoder/
ih264e_cavlc.c 100 * total nnz.
145 /* Compute Runs of zeros for all nnz coefficients except the last 3 */
298 DEBUG("\n[%d numcoeff, %d numtrailing ones, %d nnz]",u4_total_coeff, 0, u4_nc);
359 DEBUG("\n[%d numcoeff, %d numtrailing ones, %d nnz]",u4_total_coeff, u4_trailing_ones, u4_nc);
593 * pointer to the buffer containing nnz of all the subblks to the top
596 * pointer to the buffer containing nnz of all the subblks to the left
754 /* estimate nnz for the current mb */
1233 UWORD32 *nnz; local
1544 UWORD32 *nnz; local
    [all...]
  /external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h 139 union {int nnz;int lda;}; member in union:Eigen::SluMatrix::__anon18579::__anon18580
212 res.storage.nnz = internal::convert_index<int>(mat.nonZeros());
271 res.storage.nnz = mat.nonZeros();
721 m_l.resizeNonZeros(Lstore->nnz);
723 m_u.resizeNonZeros(Ustore->nnz);
    [all...]
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 434 // Apply the permutation and compute the nnz per column.
537 Index nnz = m_mat.nonZeros(); local
541 Index info = Base::memInit(m, n, nnz, lwork, m_perfv.fillfactor, m_perfv.panel_size, m_glu);
  /external/eigen/test/
sparse_basic.cpp 73 Index nnz = internal::random<int>(1,int(rows)/2); local
77 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz)));
79 m2.reserve(m2.outerSize() * nnz);
84 for (Index k=0; k<nnz; ++k)
  /external/webrtc/talk/media/testdata/
voice.rtpdump 16 ??pj?|????rfi??kolkjagi_a_jksj_`g???rmiw????????????{????????tkkn?upg`hy{|xhefuvi`y???~?????u{?????????????{kj??okolluk`^_irnllo???to}????????????????w|??xeelljgg????9??4???pjsul_\_nzmq????ln?????????????????????????~}n]Z]cc_aqyf[[ao?h\^m?yeo????x~????uo~???~kk?rhhj{wf[]m?pdcl?v??????????????????????????wy??~]^l???nc_ihjo}}ken?????t?? ?9??4?J??pjqy?????nnz???v{u??rn???uf\filjz?ls??}eiq{y?????qu~????{???????y????ot???qllu~xqhnm|{{qoz?~?yv????giy?}}?????ojos~|??????~xpoomt?????|jp??tjn??????wppny???{??xn???9??4???pj???zn????????????oi{??????zns??}?{ypw~??vpnw?yofo??vgkr??xpgj|??qy??????}???????????}???ngs}??vojj~~reflz~?ry????kv????vm|???????????zmr??{fhh}{~rk~??qkf???????3?9??4???pj}x??}rv???uqx??mr{?????zw????????|?~?|z{~wji???onn{??yls}?????|??????qnt?}kjy}yxnw{ytkqw??zyo{???????vl????????ty???????tin????z?????wvsy??y??z?????uhk???rr??G?9??4?*??pj}?vknlw????zpqzynir???~pqoohkx?{x~??{ot|??????w~x?~}???y???~{???wm?????oot??xon|???????r}??????y|~??mgn|??~??zmv???plu{??|{???{?????????z?}??wlo??ynljkmu|?|?y??[?9??4???pjxv}|rmxy|?{touwty???xyuu????????????????|?????????x????}~????}pozyy}??usvr}?xv~???????|?????????x{??}kiw???}??}sx????sw??~lvz?????x{ux?~~sx}~w}|?~}xury??~txnux??o?9??4?j??pj~|{z????ztt???}|?~~~????z||??|???zwr|~???}~}?ysns?????????v???|us????xzxx|?}~????skoq{zz|z{xny????z????|ps|?{vw{????~~????vw||????xttry?????????????????|ysw?????9??4?
    [all...]
  /external/webrtc/data/voice_engine/stereo_rtp_files/
stereo_pcmu_jitter.rtp     [all...]
stereo_pcmu_vad_jitter.rtp     [all...]

Completed in 831 milliseconds