HomeSort by relevance Sort by last modified time
    Searched defs:mat1 (Results 1 - 12 of 12) sorted by null

  /external/vixl/examples/aarch64/
neon-matrix-multiply.cc 60 // mat1 -> x1
114 float mat1[kLength], mat2[kLength], output[kLength]; local
121 // float mat1[kLength] = { 1.0f, 52.03f, 4.43f, ... };
124 mat1[0] = 1.0f;
125 mat1[4] = 2.0f;
126 mat1[8] = 3.0f;
127 mat1[12] = 4.0f;
128 mat1[1] = 52.03f;
129 mat1[5] = 12.24f;
130 mat1[9] = 53.56f
    [all...]
  /external/eigen/unsupported/test/
cxx11_tensor_fixed_size.cpp 133 TensorMap<TensorFixedSize<float, Sizes<2, 3> > > mat1(data1,2,3);
137 VERIFY_IS_EQUAL((mat1.size()), 2*3);
138 VERIFY_IS_EQUAL(mat1.rank(), 2);
139 // VERIFY_IS_EQUAL((mat1.dimension(0)), 2);
140 // VERIFY_IS_EQUAL((mat1.dimension(1)), 3);
142 mat1(0,0) = 0.0;
143 mat1(0,1) = 1.0;
144 mat1(0,2) = 2.0;
145 mat1(1,0) = 3.0;
146 mat1(1,1) = 4.0
182 TensorFixedSize<float, Sizes<2, 3, 7> > mat1; local
228 TensorFixedSize<float, Sizes<2, 3, 7> > mat1; local
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 230 SparseMatrix<Scalar,ColMajor, StorageIndex> mat1 = amat; local
232 // FIXME for a matrix with nearly symmetric pattern, mat2+mat1 is the appropriate choice.
233 // on the other hand for a really non-symmetric pattern, mat2*mat1 should be prefered...
234 SparseMatrix<Scalar,ColMajor, StorageIndex> AtA = mat2 + mat1;
240 SparseMatrix<Scalar,ColMajor, StorageIndex> mat1 = amat;
242 ordering(mat1,m_Pinv);
  /external/opencv/cv/src/
cvaccum.cpp 594 CvMat stub1, *mat1 = (CvMat*)arrA; local
605 CV_CALL( mat1 = cvGetMat( mat1, &stub1, &coi1 ));
612 if( !CV_ARE_CNS_EQ( mat1, mat2 ) || !CV_ARE_CNS_EQ( mat1, sum ))
618 if( !CV_ARE_SIZES_EQ( mat1, sum ) || !CV_ARE_SIZES_EQ( mat2, sum ))
621 size = cvGetMatSize( mat1 );
622 type = CV_MAT_TYPE( mat1->type );
624 mat1_step = mat1->step;
637 if( CV_IS_MAT_CONT( mat1->type & mat2->type & sum->type )
    [all...]
cvhistogram.cpp 513 CvSparseMat* mat1 = (CvSparseMat*)(hist1->bins); local
518 if( mat1->heap->active_count > mat2->heap->active_count )
521 CV_SWAP( mat1, mat2, t );
527 for( node1 = cvInitSparseMatIterator( mat1, &iterator );
530 double v1 = *(float*)CV_NODE_VAL(mat1,node1);
531 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1), 0, 0, &node1->hashval );
548 if( !cvPtrND( mat1, CV_NODE_IDX(mat2,node2), 0, 0, &node2->hashval ))
559 for( node1 = cvInitSparseMatIterator( mat1, &iterator );
562 double v1 = *(float*)CV_NODE_VAL(mat1,node1);
563 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1)
    [all...]
  /external/opencv/cxcore/src/
cxnorm.cpp 979 CvMat stub1, *mat1 = (CvMat*)imgB; local
    [all...]
cxcopy.cpp 712 CvSparseMat* mat1 = (CvSparseMat*)mat; local
713 cvClearSet( mat1->heap );
714 if( mat1->hashtable )
715 memset( mat1->hashtable, 0, mat1->hashsize*sizeof(mat1->hashtable[0]));
    [all...]
  /external/eigen/test/
evaluators.cpp 244 MatrixXd mat1(6,6), mat2(6,6);
245 VERIFY_IS_APPROX_EVALUATOR(mat1, MatrixXd::Identity(6,6));
246 VERIFY_IS_APPROX_EVALUATOR(mat2, mat1);
247 copy_using_evaluator(mat2.transpose(), mat1);
248 VERIFY_IS_APPROX(mat2.transpose(), mat1);
256 VERIFY_IS_APPROX_EVALUATOR(mat2, mat1);
326 mat1.setRandom();
329 copy_using_evaluator(matXcd.real(), mat1);
331 matXcd_ref.real() = mat1;
349 VERIFY_IS_APPROX_EVALUATOR(vec1, mat1.rowwise().sum())
392 MatrixXd mat1, mat2, mat1ref, mat2ref; local
    [all...]
ref.cpp 100 MatrixType mat1 = MatrixType::Random(size,size), local
101 mat2 = mat1,
132 RefMatWithStride rm5 = mat1.row(i).transpose();
133 VERIFY_IS_EQUAL(rm5, mat1.row(i).transpose());
136 VERIFY_IS_EQUAL(mat1, mat2);
139 VERIFY_IS_APPROX(mat1, mat2);
  /external/vixl/test/aarch64/examples/
test-examples.cc 252 float mat1[kLength], mat2[kLength], expected[kLength], output[kLength]; local
256 mat1[0] = 1.0f;
257 mat1[4] = 2.0f;
258 mat1[8] = 3.0f;
259 mat1[12] = 4.0f;
260 mat1[1] = 52.03f;
261 mat1[5] = 12.24f;
262 mat1[9] = 53.56f;
263 mat1[13] = 22.22f;
264 mat1[2] = 4.43f
    [all...]
  /libcore/luni/src/test/java/libcore/java/util/regex/
OldMatcherTest.java 208 Matcher mat1 = pat.matcher(testString1); local
211 assertFalse("Should not find given pattern in 1 string", mat1.lookingAt());
212 mat1.region(1, 10);
213 assertTrue("Should find given pattern in region of string", mat1.lookingAt());
  /external/clang/test/Sema/
array-init.c 256 const Matrix mat1 = { local

Completed in 930 milliseconds