Searched refs:dim (Results 1 - 25 of 263) sorted by relevance

1234567891011

/external/clang/test/CodeGenCXX/
H A Dpr12104.h4 template <int dim>
5 const unsigned int Patch<dim>::no_neighbor;
/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/ilbc/
H A Dlsf_check.h30 int dim, /* dimension of LSF */
H A Dsplit_vq.c34 int16_t *dim, /* (i) the dimension of X and qX */
50 CBPtr+=(dim[0]*cbsize[0]);
56 CBPtr+=(dim[1]*cbsize[1]);
28 WebRtcIlbcfix_SplitVq( int16_t *qX, int16_t *index, int16_t *X, int16_t *CB, int16_t *dim, int16_t *cbsize ) argument
H A Dsplit_vq.h34 int16_t *dim, /* (i) the dimension of X and qX */
H A Dlsf_check.c28 int dim, /* dimension of LSF */
40 for (k=0;k<(dim-1);k++) {
41 pos=m*dim+k;
26 WebRtcIlbcfix_LsfCheck( int16_t *lsf, int dim, int NoAn) argument
/external/javassist/src/main/javassist/compiler/ast/
H A DInstanceOfExpr.java24 public InstanceOfExpr(ASTList className, int dim, ASTree expr) { argument
25 super(className, dim, expr);
28 public InstanceOfExpr(int type, int dim, ASTree expr) { argument
29 super(type, dim, expr);
H A DCastExpr.java28 public CastExpr(ASTList className, int dim, ASTree expr) { argument
31 arrayDim = dim;
34 public CastExpr(int type, int dim, ASTree expr) { argument
37 arrayDim = dim;
H A DDeclarator.java30 public Declarator(int type, int dim) { argument
33 arrayDim = dim;
38 public Declarator(ASTList className, int dim) { argument
41 arrayDim = dim;
48 public Declarator(int type, String jvmClassName, int dim, argument
52 arrayDim = dim;
59 public Declarator make(Symbol sym, int dim, ASTree init) { argument
60 Declarator d = new Declarator(this.varType, this.arrayDim + dim);
/external/srec/srec/clib/
H A Djacobi.c38 static void Rotate(double **a, int dim, int i, int j, int k, int l, double s,
41 static double SumOffDiag(double **mat, int dim);
46 void Jacobi(double **matrix, int dim, double *egval, double **egvec) argument
49 // <mat> of size <dim>x<dim>. Fills in <egval> with the eigenvalues
64 b = (double *) CALLOC(dim, sizeof(double), "clib.jacobi.b");
65 d = (double *) CALLOC(dim, sizeof(double), "clib.jacobi.d");
66 z = (double *) CALLOC(dim, sizeof(double), "clib.jacobi.z");
67 a = (double **) CALLOC(dim, sizeof(double *), "clib.jacobi.input_jacobi");
68 v = (double **) CALLOC(dim, sizeo
193 Rotate(double **a, int dim, int i, int j, int k, int l, double s, double tau) argument
204 SumOffDiag(double **mat, int dim) argument
[all...]
H A Dimeld_tr.c47 int dim = prep->dim; local
50 ASSERT(prep->dim < MAX_DIMEN);
52 for (ii = 0; ii < dim; ii++)
55 for (jj = 0; jj < prep->dim; jj++)
65 for (ii = 0; ii < dim; ii++)
68 for (ii = 0; ii < dim; ii++)
73 for (ii = 0; ii < dim; ii++)
88 ASSERT (prep->dim < MAX_DIMEN);
92 for (ii= 0; ii < prep->dim; i
[all...]
H A Dmatrix_i.c41 void lubksb(double **mat, int dim, int *index, double *b);
42 int ludcmp(double **mat, int dim, int *index);
44 int invert_matrix(covdata **mat, covdata **inv, int dim) argument
55 index = (int *) CALLOC(dim, sizeof(int), "clib.index_imatrix");
56 col = (double *) CALLOC(dim, sizeof(double), "clib.col");
57 input = (double **) CALLOC(dim, sizeof(double *), "clib.input_imatrix");
58 for (ii = 0; ii < dim; ii++)
60 input[ii] = (double *) CALLOC(dim, sizeof(double), "clib.input_imatrix[]");
61 for (jj = 0; jj < dim; jj++)
65 if ((err_code = ludcmp(input, dim, inde
99 ludcmp(double **mat, int dim, int *index) argument
176 lubksb(double **mat, int dim, int *index, double *b) argument
[all...]
H A Dimeld_rd.c49 int invert_matrix(covdata **mat, covdata **inv, int dim);
57 prep->dim = matdim;
72 delete_fixed_matrix(prep->matrix, prep->dim);
78 delete_matrix(prep->imelda, prep->dim);
82 delete_fixed_matrix(prep->invmat, prep->dim);
83 delete_matrix(prep->inverse, prep->dim);
119 if (!prep->dim) prep->dim = matdim;
120 else if (prep->dim != matdim)
123 prep->dim, matdi
[all...]
/external/libvorbis/vq/
H A Dmetrics.c53 return c->valuelist+i*c->c->dim;
76 histogram_error[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
77 histogram_errorsq[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
78 histogram_hi[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
79 histogram_lo[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
104 float this=_dist(c->c->dim,_now(c,j),_now(c,k));
152 int dim=b->c->dim; local
166 for(k=0;k<dim;k++){
168 i*dim
209 process_one(codebook *b,int book,float *a,int dim,int step,int addmul, float base) argument
268 int dim=b->dim; local
[all...]
/external/eigen/test/
H A Dumeyama.cpp91 void run_test(int dim, int num_elements) argument
102 MatrixX R = randMatrixSpecialUnitary<Scalar>(dim);
103 VectorX t = Scalar(50)*VectorX::Random(dim,1);
105 MatrixX cR_t = MatrixX::Identity(dim+1,dim+1);
106 cR_t.block(0,0,dim,dim) = c*R;
107 cR_t.block(0,dim,dim,1) = t;
109 MatrixX src = MatrixX::Random(dim
[all...]
H A Dreal_qz.cpp23 Index dim = m.cols(); local
25 MatrixType A = MatrixType::Random(dim,dim),
26 B = MatrixType::Random(dim,dim);
45 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixQ().adjoint(), MatrixType::Identity(dim,dim));
46 VERIFY_IS_APPROX(qz.matrixZ()*qz.matrixZ().adjoint(), MatrixType::Identity(dim,dim));
H A Dgeo_alignedbox.cpp32 const Index dim = _box.dim(); local
34 VectorType p0 = VectorType::Random(dim);
35 VectorType p1 = VectorType::Random(dim);
37 p1 = VectorType::Random(dim); }
40 BoxType b0(dim);
41 BoxType b1(VectorType::Random(dim),VectorType::Random(dim));
59 BoxType *bp0 = new BoxType(dim);
60 BoxType *bp1 = new BoxType(dim);
84 const Index dim = _box.dim(); local
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/math/
H A Dm_eval.h61 GLuint dim, GLuint order);
80 GLuint dim, GLuint uorder, GLuint vorder);
99 GLfloat u, GLfloat v, GLuint dim,
/external/mesa3d/src/mesa/math/
H A Dm_eval.h61 GLuint dim, GLuint order);
80 GLuint dim, GLuint uorder, GLuint vorder);
99 GLfloat u, GLfloat v, GLuint dim,
/external/srec/srec/ca/
H A Dcatrans.c74 hTransform->dim = dimen;
76 hTransform->imelda_acc.between = create_accumulate_matrix(hTransform->dim);
77 hTransform->imelda_acc.bmean = (accdata *) VAR_ALLOCATE(hTransform->dim,
80 hTransform->imelda_acc.wmean = (accdata *) VAR_ALLOCATE(hTransform->dim,
82 hTransform->mllr_acc.between = create_accumulate_matrix(hTransform->dim + 1);
83 hTransform->mllr_acc.within = create_accumulate_matrix(hTransform->dim + 1);
117 delete_accumulate_matrix(hTransform->imelda_acc.between, hTransform->dim);
118 delete_accumulate_matrix(hTransform->imelda_acc.within, hTransform->dim);
119 delete_accumulate_matrix(hTransform->mllr_acc.between, hTransform->dim + 1);
120 delete_accumulate_matrix(hTransform->mllr_acc.within, hTransform->dim
[all...]
/external/eigen/test/eigen2/
H A Deigen2_alignedbox.cpp21 const int dim = _box.dim(); local
26 VectorType p0 = VectorType::Random(dim);
27 VectorType p1 = VectorType::Random(dim);
30 BoxType b0(dim);
31 BoxType b1(VectorType::Random(dim),VectorType::Random(dim));
H A Deigen2_parametrizedline.cpp22 const int dim = _line.dim(); local
29 VectorType p0 = VectorType::Random(dim);
30 VectorType p1 = VectorType::Random(dim);
32 VectorType d0 = VectorType::Random(dim).normalized();
/external/ceres-solver/internal/ceres/
H A Dgradient_checker_test.cc56 GoodTestTerm(int arity, int const *dim) : arity_(arity) { argument
60 a_[j].resize(dim[j]);
61 for (int u = 0; u < dim[j]; ++u) {
67 mutable_parameter_block_sizes()->push_back(dim[i]);
109 BadTestTerm(int arity, int const *dim) : arity_(arity) { argument
113 a_[j].resize(dim[j]);
114 for (int u = 0; u < dim[j]; ++u) {
120 mutable_parameter_block_sizes()->push_back(dim[i]);
165 int const dim[arity] = { 2, 3, 4 }; local
170 parameters[j] = new double[dim[
[all...]
H A Dtrust_region_minimizer_test.cc325 for (int dim = 0; dim < 2; dim++) {
326 const double diff = parameters[prev][dim] - parameters[i][dim];
343 for (int dim = 0; dim < 2; dim++) {
344 u[dim] = parameters[i][dim]
[all...]
/external/clang/test/SemaTemplate/
H A Dinstantiate-field.cpp95 template <int dim>
99 unsigned char value : (dim > 0 ? dim : 1);
102 template <int dim>
103 inline B<dim>::B(const unsigned char i) : value(i) {}
/external/opencv/cv/src/
H A D_cvkdtree.hpp69 int dim; // split dimension; >=0 for nodes, -1 for leaves member in struct:CvKDTree::node
72 scalar_type boundary; // left if deref(value,dim)<=boundary, otherwise right
76 __deref deref; // requires operator() (__valuetype lhs,int dim)
118 int dim, __valuector ctor) {
121 median_partition(first, last, k, dim, ctor);
128 int dim; member in struct:CvKDTree::median_pr
132 : pivot(_pivot), dim(_dim), deref(_deref), ctor(_ctor) {
135 return deref(ctor(lhs), dim) <= deref(ctor(pivot), dim);
141 __instype * k, int dim, __valuecto
117 median_partition(__instype * first, __instype * last, int dim, __valuector ctor) argument
140 median_partition(__instype * first, __instype * last, __instype * k, int dim, __valuector ctor) argument
163 int dim = dimension_of_highest_variance(first, last, ctor); local
[all...]

Completed in 3602 milliseconds

1234567891011