| /external/eigen/doc/snippets/ |
| EigenSolver_compute.cpp | 1 EigenSolver<MatrixXf> es; variable
3 es.compute(A, /* computeEigenvectors = */ false);
4 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
5 es.compute(A + MatrixXf::Identity(4,4), false); // re-use es to compute eigenvalues of A+I
6 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
|
| SelfAdjointEigenSolver_SelfAdjointEigenSolver.cpp | 1 SelfAdjointEigenSolver<Matrix4f> es; variable
4 es.compute(A);
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
6 es.compute(A + Matrix4f::Identity(4,4)); // re-use es to compute eigenvalues of A+I
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
|
| SelfAdjointEigenSolver_compute_MatrixType.cpp | 1 SelfAdjointEigenSolver<MatrixXf> es(4);
4 es.compute(A);
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
6 es.compute(A + MatrixXf::Identity(4,4)); // re-use es to compute eigenvalues of A+I
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
|
| EigenSolver_eigenvalues.cpp | 2 EigenSolver<MatrixXd> es(ones, false);
4 << endl << es.eigenvalues() << endl;
|
| EigenSolver_eigenvectors.cpp | 2 EigenSolver<MatrixXd> es(ones);
4 << endl << es.eigenvectors().col(1) << endl;
|
| SelfAdjointEigenSolver_eigenvalues.cpp | 2 SelfAdjointEigenSolver<MatrixXd> es(ones);
4 << endl << es.eigenvalues() << endl;
|
| SelfAdjointEigenSolver_eigenvectors.cpp | 2 SelfAdjointEigenSolver<MatrixXd> es(ones);
4 << endl << es.eigenvectors().col(1) << endl;
|
| SelfAdjointEigenSolver_compute_MatrixType2.cpp | 6 GeneralizedSelfAdjointEigenSolver<MatrixXd> es(A,B,EigenvaluesOnly);
7 cout << "The eigenvalues of the pencil (A,B) are:" << endl << es.eigenvalues() << endl;
8 es.compute(B,A,false);
9 cout << "The eigenvalues of the pencil (B,A) are:" << endl << es.eigenvalues() << endl;
|
| SelfAdjointEigenSolver_operatorInverseSqrt.cpp | 5 SelfAdjointEigenSolver<MatrixXd> es(A);
7 cout << es.operatorInverseSqrt() << endl;
9 cout << es.operatorSqrt().inverse() << endl;
|
| EigenSolver_EigenSolver_MatrixType.cpp | 4 EigenSolver<MatrixXd> es(A);
5 cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl;
6 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl;
8 complex<double> lambda = es.eigenvalues()[0];
10 VectorXcd v = es.eigenvectors().col(0);
14 MatrixXcd D = es.eigenvalues().asDiagonal();
15 MatrixXcd V = es.eigenvectors();
|
| SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | 5 SelfAdjointEigenSolver<MatrixXd> es(A);
6 cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl;
7 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl;
9 double lambda = es.eigenvalues()[0];
11 VectorXd v = es.eigenvectors().col(0);
15 MatrixXd D = es.eigenvalues().asDiagonal();
16 MatrixXd V = es.eigenvectors();
|
| EigenSolver_pseudoEigenvectors.cpp | 4 EigenSolver<MatrixXd> es(A);
5 MatrixXd D = es.pseudoEigenvalueMatrix();
6 MatrixXd V = es.pseudoEigenvectors();
|
| SelfAdjointEigenSolver_operatorSqrt.cpp | 5 SelfAdjointEigenSolver<MatrixXd> es(A);
6 MatrixXd sqrtA = es.operatorSqrt();
|
| SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType2.cpp | 8 GeneralizedSelfAdjointEigenSolver<MatrixXd> es(A,B);
9 cout << "The eigenvalues of the pencil (A,B) are:" << endl << es.eigenvalues() << endl;
10 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl;
12 double lambda = es.eigenvalues()[0];
14 VectorXd v = es.eigenvectors().col(0);
|
| /external/svox/pico/lang/ |
| PicoLangEsEsInSystem.mk | 2 # Installation of es-ES for the Pico TTS engine in the system image
4 # Include this file in a product makefile to include the language files for es-ES
10 external/svox/pico/lang/es-ES_zl0_sg.bin:system/tts/lang_pico/es-ES_zl0_sg.bin \
11 external/svox/pico/lang/es-ES_ta.bin:system/tts/lang_pico/es-ES_ta.bin
|
| /packages/inputmethods/PinyinIME/jni/share/ |
| mystdlib.cpp | 24 void myqsort(void *p, size_t n, size_t es,
26 qsort(p,n, es, cmp);
30 size_t n, size_t es,
32 return bsearch(k, b, n, es, cmp);
|
| /external/yaffs2/yaffs2/ |
| yaffs_qsort.c | 47 #define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
48 es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
65 swapfunc(a, b, es, swaptype)
79 qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *))
85 loop: SWAPINIT(a, es);
88 for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es)
89 for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0
[all...] |
| /external/valgrind/main/callgrind/ |
| threads.c | 198 exec_state *es; local
210 es = push_exec_state(sigNum);
211 CLG_(zero_cost)( CLG_(sets).full, es->cost );
212 CLG_(current_state).cost = es->cost;
213 es->call_stack_bottom = CLG_(current_call_stack).sp;
228 exec_state* es = top_exec_state(); local
229 CLG_ASSERT(es != 0);
232 if (CLG_(current_call_stack).sp == es->call_stack_bottom)
238 exec_state* es; local
251 es = top_exec_state()
324 exec_state* es; local
374 exec_state* es; local
389 exec_state* es; local
411 exec_state* es = top_exec_state(); local
436 exec_state* es = top_exec_state(); local
[all...] |
| events.c | 121 EventSet* es; local
129 es = (EventSet*) CLG_MALLOC("cl.events.eventset.1", sizeof(EventSet));
130 es->mask = mask;
135 es->offset[i] = offset;
142 es->size = offset;
143 es->count = count;
145 eventSetTable[mask] = es;
146 return es;
170 EventSet* CLG_(add_event_group)(EventSet* es, Int id)
173 if (!es) es = eventset_from_mask(0)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| expanddir.c | 34 struct expand_dir_struct *es = (struct expand_dir_struct *) priv_data; local
46 es->err = retval;
52 es->err = retval;
55 es->done = 1;
60 es->err = retval;
67 es->err = retval;
73 es->newblocks++;
75 if (es->done)
84 struct expand_dir_struct es; local
99 es.done = 0
[all...] |
| /bionic/libc/stdlib/ |
| qsort.c | 53 #define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
54 es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
71 swapfunc(a, b, es, swaptype)
84 qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *))
90 loop: SWAPINIT(a, es);
93 for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es)
94 for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0
[all...] |
| /external/clang/test/Sema/ |
| array-bounds-ptr-arith.c | 7 void* ext2_statfs (struct ext2_super_block *es,int a)
9 return (void *)es->s_uuid + sizeof(int); // no-warning
11 void* broken (struct ext2_super_block *es,int a)
13 return (void *)es->s_uuid + 80; // expected-warning {{refers past the end of the array}}
|
| /external/mksh/src/ |
| expr.c | 161 #define bivui(x, op, y) (es->natural ? \
204 Expr_state * const es = &curstate; local
228 exprtoken(es);
229 if (es->tok == END) {
230 es->tok = LIT;
231 es->val = tempvar();
233 v = intvar(es, evalexpr(es, MAX_PREC));
235 if (es->tok != END)
236 evalerr(es, ET_UNEXPECTED, NULL)
[all...] |
| edit.c | 3456 static struct edstate *es; \/* current editor state *\/ variable in typeref:struct:edstate
[all...] |
| /packages/inputmethods/PinyinIME/jni/include/ |
| mystdlib.h | 24 void myqsort(void *p, size_t n, size_t es,
|
