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

  /external/eigen/doc/snippets/
ComplexEigenSolver_compute.cpp 4 ComplexEigenSolver<MatrixXcf> ces; variable
5 ces.compute(A);
6 cout << "The eigenvalues of A are:" << endl << ces.eigenvalues() << endl;
7 cout << "The matrix of eigenvectors, V, is:" << endl << ces.eigenvectors() << endl << endl;
9 complex<float> lambda = ces.eigenvalues()[0];
11 VectorXcf v = ces.eigenvectors().col(0);
16 << ces.eigenvectors() * ces.eigenvalues().asDiagonal() * ces.eigenvectors().inverse() << endl;
  /external/chromium_org/third_party/icu/source/test/intltest/
colldata.h 50 * This object holds a list of CEs generated from a particular
60 * @param coll - the Collator used to collect the CEs.
61 * @param string - the string for which to collect the CEs.
76 * Return the number of CEs in the list.
78 * @return the number of CEs in the list.
92 * Check if the CEs in another <code>CEList</code> match the
98 * @return <code>TRUE</code> if the CEs match, <code>FALSE</code> otherwise.
115 uint32_t *ces; member in class:CEList
196 * generate a partcular list of CEs.
232 * of CEs starting with a given CE
    [all...]
  /external/icu/icu4c/source/test/intltest/
colldata.h 50 * This object holds a list of CEs generated from a particular
60 * @param coll - the Collator used to collect the CEs.
61 * @param string - the string for which to collect the CEs.
76 * Return the number of CEs in the list.
78 * @return the number of CEs in the list.
92 * Check if the CEs in another <code>CEList</code> match the
98 * @return <code>TRUE</code> if the CEs match, <code>FALSE</code> otherwise.
115 uint32_t *ces; member in class:CEList
196 * generate a partcular list of CEs.
232 * of CEs starting with a given CE
    [all...]
collationtest.cpp 169 UVector64 ces(errorCode);
170 rbc->internalGetCEs(UnicodeString(FALSE, s, 2), ces, errorCode); local
172 if(ces.size() != 2) {
173 errln("expected 2 CEs for <FFFE, FFFF>, got %d", (int)ces.size());
176 int64_t ce = ces.elementAti(0);
184 ce = ces.elementAti(1);
640 // Well-formed CEs.
645 // Quaternary CEs are not supported.
748 // and we also verify that there is a tailoring gap between each two CEs
    [all...]
  /external/icu/icu4c/source/i18n/
collationsets.h 91 virtual void handleExpansion(const int64_t ces[], int32_t length) = 0;
135 int64_t ces[Collation::MAX_EXPANSION_LENGTH]; member in class:ContractionsAndExpansions
collationdata.h 38 ce32s(NULL), ces(NULL), contexts(NULL), base(NULL),
97 int64_t dataCE = ces[Collation::indexFromCE32(ce32)];
154 const int64_t *ces; member in struct:CollationData
collationbuilder.h 69 * Picks one of the current CEs and finds or inserts a node in the graph
120 * need not re-encode the CEs multiple times.
148 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
150 * The nodes array can then be used only as a source of tailored CEs.
159 /** Replaces temporary CEs with the final CEs they point to. */
170 * Temporary CEs are distinguished from real CEs by their use of
306 int64_t ces[Collation::MAX_EXPANSION_LENGTH]; member in class:CollationBuilder
320 * Data structure for assigning tailored weights and CEs
    [all...]
collationsets.cpp 149 // Offset tags always result in long-primary CEs,
155 int64_t dataCE = baseData->ces[Collation::indexFromCE32(baseCE32)];
186 const int64_t *ces = data->ces + Collation::indexFromCE32(ce32); local
189 const int64_t *baseCEs = baseData->ces + Collation::indexFromCE32(baseCE32);
197 if(ces[i] != baseCEs[i]) {
455 ces[0] = Collation::latinCE0FromCE32(ce32);
456 ces[1] = Collation::latinCE1FromCE32(ce32);
457 sink->handleExpansion(ces, 2);
470 ces[i] = Collation::ceFromCE32(*ce32s++)
    [all...]
collationfastlatinbuilder.cpp 289 const int64_t *ces = data.ces + Collation::indexFromCE32(ce32); local
292 ce0 = ces[0];
294 ce1 = ces[1];
341 // No tertiary CEs.
344 // only for secondary CEs or together with short primaries.
664 printf("\n char mini CEs");
702 // Only in mini CEs: Ignorable case bits = 0, lowercase = 1.
714 // Try to combine the two mini CEs into one.
collationiterator.cpp 281 const int64_t *ces = d->ces + Collation::indexFromCE32(ce32); local
285 ceBuffer.appendUnsafe(*ces++);
346 // CEs from a discontiguous contraction plus the skipped combining marks
658 // Append CEs from the contraction ce32
734 // Write a sequence of CEs for at most 254 digits at a time.
    [all...]
  /external/chromium_org/third_party/icu/source/test/cintltst/
citertst.c 1271 uint32_t ces[20]; local
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.core.expressions_3.4.200.v20100505.jar 
org.eclipse.equinox.registry_3.5.0.v20100503.jar 
  /external/owasp/sanitizer/tools/findbugs/lib/
bcel.jar 

Completed in 1931 milliseconds