HomeSort by relevance Sort by last modified time
    Searched full:dm1 (Results 1 - 10 of 10) sorted by null

  /external/skia/tests/
DiscardableMemoryPool.cpp 18 SkAutoTDelete<SkDiscardableMemory> dm1(pool->create(100));
19 REPORTER_ASSERT(reporter, dm1->data() != NULL);
21 dm1->unlock();
23 REPORTER_ASSERT(reporter, !dm1->lock());
  /external/eigen/test/
bandmatrix.cpp 26 DenseMatrixType dm1(rows,cols);
27 dm1.setZero();
30 dm1.diagonal().setConstant(123);
34 dm1.diagonal(i).setConstant(static_cast<RealScalar>(i));
39 dm1.diagonal(-i).setConstant(-static_cast<RealScalar>(i));
41 //std::cerr << m.m_data << "\n\n" << m.toDense() << "\n\n" << dm1 << "\n\n\n\n";
42 VERIFY_IS_APPROX(dm1,m.toDenseMatrix());
47 dm1.col(i).setConstant(static_cast<RealScalar>(i+1));
52 if(a>0) dm1.block(0,d+supers,rows,a).setZero();
53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero()
    [all...]
  /external/eigen/doc/
C09_TutorialSparse.dox 364 sm2 = sm1.cwiseProduct(dm1);
365 dm2 = sm1 + dm1;
383 dm2 = dm1 * sm1.adjoint();
384 dm2 = 2. * sm1 * dm1;
388 dm2 = sm1.selfadjointView<>() * dm1; // if all coefficients of A are stored
389 dm2 = A.selfadjointView<Upper>() * dm1; // if only the upper part of A is stored
390 dm2 = A.selfadjointView<Lower>() * dm1; // if only the lower part of A is stored
417 dm2 = sm1.triangularView<Lower>(dm1);
424 dm2 = sm1.selfadjointView<>() * dm1; // if all coefficients of A are stored
425 dm2 = A.selfadjointView<Upper>() * dm1; // if only the upper part of A is store
    [all...]
SparseQuickReference.dox 119 dm2 = sm1 * dm1;
  /external/bluetooth/bluedroid/bta/dm/
bta_dm_cfg.c 445 ** 1 to 17 bytes, DM1 is used and most robust.
  /external/tremolo/Tremolo/
dpen.s 282 dm1: label
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
greyrgb.uue     [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
greyrgb.uue     [all...]
  /prebuilts/sdk/tools/linux/
arm-linux-androideabi-ld 
i686-linux-android-ld 

Completed in 503 milliseconds