/external/eigen/doc/snippets/ |
ComplexEigenSolver_eigenvalues.cpp | 2 ComplexEigenSolver<MatrixXcf> ces(ones, /* computeEigenvectors = */ false); 4 << endl << ces.eigenvalues() << endl;
|
ComplexEigenSolver_eigenvectors.cpp | 2 ComplexEigenSolver<MatrixXcf> ces(ones); 4 << endl << ces.eigenvectors().col(1) << endl;
|
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/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...] |
colldata.cpp | 41 : ces(NULL), listMax(CELIST_BUFFER_SIZE), listSize(0) 71 ces = ceBuffer; 102 if (ces != ceBuffer) { 103 DELETE_ARRAY(ces); 122 uprv_memcpy(newCEs, ces, listSize * sizeof(uint32_t)); 124 if (ces != ceBuffer) { 125 DELETE_ARRAY(ces); 128 ces = newCEs; 132 ces[listSize++] = ce; 138 return ces[index] [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/ |
collationbasedatabuilder.h | 64 virtual uint32_t encodeCEs(const int64_t ces[], int32_t cesLength, UErrorCode &errorCode); 66 void addRootElements(const int64_t ces[], int32_t cesLength, UErrorCode &errorCode);
|
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
|
collationdatabuilder.h | 49 * that changes a tailoring builder's temporary CEs to final CEs. 79 * @return TRUE if c has CEs in this builder 96 const int64_t ces[], int32_t cesLength, 100 * Encodes the ces as either the returned ce32 by itself, 103 * add(p, s, ces, cesLength) = addCE32(p, s, encodeCEs(ces, cesLength)) 105 virtual uint32_t encodeCEs(const int64_t ces[], int32_t cesLength, UErrorCode &errorCode); 110 * Sets three-byte-primary CEs for a range of code points in code point order, 126 * Sets three-byte-primary CEs for a range of code points in code point order [all...] |
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
|
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...] |
collationdatabuilder.cpp | 82 * When fetching CEs from the builder, the contexts are built into their runtime form 105 * Uses the runtime CollationIterator for fetching CEs for a string 128 int32_t fetchCEs(const UnicodeString &str, int32_t start, int64_t ces[], int32_t cesLength); 168 int64_t ces[], int32_t cesLength) { 171 builderData.ces = builder.ce64s.getBuffer(); 179 // No need to keep all CEs in the iterator buffer. 197 ces[cesLength] = ce; 395 int64_t dataCE = fromBase ? base->ces[i] : ce64s.elementAti(i); 459 return fromBase ? base->ces[i] : ce64s.elementAti(i); 525 const int64_t ces[], int32_t cesLength [all...] |
collationbasedatabuilder.cpp | 256 CollationBaseDataBuilder::encodeCEs(const int64_t ces[], int32_t cesLength, UErrorCode &errorCode) { 257 addRootElements(ces, cesLength, errorCode); 258 return CollationDataBuilder::encodeCEs(ces, cesLength, errorCode); 262 CollationBaseDataBuilder::addRootElements(const int64_t ces[], int32_t cesLength, 266 addRootElement(ces[i], errorCode); 342 uint32_t prevPrimary = 0; // Start with primary ignorable CEs. 353 // We omitted them initially, and omitted all CEs with Han primaries 393 // Multiple CEs with only common secondary/tertiary weights were 453 // See if there are more than two CEs with primaries increasing by "step"
|
collationbuilder.cpp | 290 ces[0] = getSpecialResetPosition(str, parserErrorReason, errorCode); 293 U_ASSERT((ces[0] & Collation::CASE_AND_QUATERNARY_MASK) == 0); 301 cesLength = dataBuilder->getCEs(nfdString, ces, 0); 462 strength = ceStrength(ces[cesLength - 1]); 468 ces[cesLength - 1] = tempCEFromIndexAndStrength(index, strength); 482 // Quaternary CEs are not supported. 483 // Non-zero quaternary weights are possible only on tertiary or stronger CEs. 549 // script-first-primary CEs in the root collator. 589 // because there are no root CEs with a boundary primary 694 int64_t ce = ces[cesLength - 1] [all...] |
coleitr.cpp | 83 // CollationIterator::previousCE() decrements the CEs length 84 // while it pops CEs from its internal buffer. 122 // No need to keep all CEs in the buffer when we iterate. 126 // Turn the 64-bit CE into two old-style 32-bit CEs, without quaternary bits. 192 // If we already have expansion CEs, then we also have offsets. 198 // Turn the 64-bit CE into two old-style 32-bit CEs, without quaternary bits. 205 // When we convert a single 64-bit CE into two 32-bit CEs, 399 virtual void handleExpansion(const int64_t ces[], int32_t length) { 401 // We do not need to add single CEs into the map. 406 count += ceNeedsTwoParts(ces[i]) ? 2 : 1 [all...] |
alphaindex.cpp | 398 const UnicodeString &s, UVector64 &ces, UErrorCode &errorCode) { 399 ces.removeAllElements(); 400 coll.internalGetCEs(s, ces, errorCode); 403 for (int32_t i = 0; i < ces.size(); ++i) { 404 int64_t ce = ces.elementAti(i); 427 UVector64 ces(errorCode); 512 ces, errorCode) && 525 ces, errorCode)) { [all...] |
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...] |
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.
|
collationdatawriter.cpp | 173 // not automatically multiples of 8 bytes and which are placed before the CEs. 176 // We need to add padding somewhere so that the 64-bit CEs are 8-aligned. 305 copyData(indexes, CollationDataReader::IX_CES_OFFSET, data.ces, dest);
|
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/i18n/unicode/ |
colldata.h | 61 * This object holds a list of CEs generated from a particular 72 * @param coll - the Collator used to collect the CEs. 73 * @param string - the string for which to collect the CEs. 91 * Return the number of CEs in the list. 93 * @return the number of CEs in the list. 111 * Check if the CEs in another <code>CEList</code> match the 117 * @return <code>TRUE</code> if the CEs match, <code>FALSE</code> otherwise. 149 uint32_t *ces; member in class:CEList 266 * generate a partcular list of CEs. 318 * of CEs starting with a given CE [all...] |
/external/valgrind/main/coregrind/m_debuginfo/ |
image.c | 87 // Pointers to the entries. ces[0 .. ces_used-1] are non-NULL. 88 // ces[ces_used .. CACHE_N_ENTRIES-1] are NULL. 91 CEnt* ces[CACHE_N_ENTRIES]; member in struct:_DiImage 406 vg_assert(img->ces[entNo] == NULL); 407 img->ces[entNo] = ML_(dinfo_zalloc)("di.alloc_CEnt.1", sizeof(CEnt)); 417 CEnt* tmp = img->ces[entNo]; 419 img->ces[entNo] = img->ces[entNo-1]; 422 img->ces[0] = tmp; 437 vg_assert(img->ces[entNo] != NULL) [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
colldata.cpp | 50 : ces(NULL), listMax(CELIST_BUFFER_SIZE), listSize(0) 85 ces = ceBuffer; 120 if (ces != ceBuffer) { 121 DELETE_ARRAY(ces); 145 uprv_memcpy(newCEs, ces, listSize * sizeof(uint32_t)); 147 if (ces != ceBuffer) { 148 DELETE_ARRAY(ces); 151 ces = newCEs; 155 ces[listSize++] = ce; 161 return ces[index] [all...] |
/external/chromium_org/third_party/icu/source/test/cintltst/ |
citertst.c | 1270 uint32_t ces[20]; local [all...] |
/external/icu/icu4c/source/i18n/unicode/ |
tblcoll.h | [all...] |