/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...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
ContractionsAndExpansions.java | 33 private long[] ces = new long[Collation.MAX_EXPANSION_LENGTH]; field in class:ContractionsAndExpansions 37 void handleExpansion(long ces[], int start, int length); 141 ces[0] = Collation.latinCE0FromCE32(ce32); 142 ces[1] = Collation.latinCE1FromCE32(ce32); 143 sink.handleExpansion(ces, 0, 2); 156 ces[i] = Collation.ceFromCE32(data.ce32s[idx + i]); 158 sink.handleExpansion(ces, 0, length); 170 sink.handleExpansion(data.ces, idx, length); 216 // Currently no need to send offset CEs to the sink. 219 // Currently no need to send implicit CEs to the sink [all...] |
CollationDataBuilder.java | 38 * that changes a tailoring builder's temporary CEs to final CEs. 111 * @return true if c has CEs in this builder 117 void add(CharSequence prefix, CharSequence s, long ces[], int cesLength) { 118 int ce32 = encodeCEs(ces, cesLength); 123 * Encodes the ces as either the returned ce32 by itself, 126 * <p>add(p, s, ces, cesLength) = addCE32(p, s, encodeCEs(ces, cesLength)) 128 int encodeCEs(long ces[], int cesLength) { 130 throw new IllegalArgumentException("mapping to too many CEs"); [all...] |
CollationBuilder.java | 108 ces[0] = getSpecialResetPosition(str); 110 assert((ces[0] & Collation.CASE_AND_QUATERNARY_MASK) == 0); 114 cesLength = dataBuilder.getCEs(nfdString, ces, 0); 225 strength = ceStrength(ces[cesLength - 1]); 227 ces[cesLength - 1] = tempCEFromIndexAndStrength(index, strength); 285 // Quaternary CEs are not supported. 286 // Non-zero quaternary weights are possible only on tertiary or stronger CEs. 350 // script-first-primary CEs in the root collator. 383 // because there are no root CEs with a boundary primary 477 long ce = ces[cesLength - 1] 1498 private long[] ces = new long[Collation.MAX_EXPANSION_LENGTH]; field in class:CollationBuilder [all...] |
CollationData.java | 108 long dataCE = ces[Collation.indexFromCE32(ce32)]; 155 return d.ces[Collation.indexFromCE32(ce32)]; 491 long[] ces; field in class:CollationData
|
TailoredSet.java | 163 // Offset tags always result in long-primary CEs, 169 long dataCE = baseData.ces[Collation.indexFromCE32(baseCE32)]; 213 if (data.ces[idx0 + i] != baseData.ces[idx1 + i]) {
|
CollationDataReader.java | 71 /** Byte offset to long ces[]. */ 238 throw new ICUException("Tailored ces without tailored trie"); 240 data.ces = new long[length / 8]; 242 data.ces[i] = inBytes.getLong();
|
/external/icu/icu4c/source/i18n/ |
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...] |
collationdata.h | 55 ce32s(NULL), ces(NULL), contexts(NULL), base(NULL), 114 int64_t dataCE = ces[Collation::indexFromCE32(ce32)]; 181 const int64_t *ces; member in struct:CollationData
|
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 | 84 * When fetching CEs from the builder, the contexts are built into their runtime form 107 * Uses the runtime CollationIterator for fetching CEs for a string 130 int32_t fetchCEs(const UnicodeString &str, int32_t start, int64_t ces[], int32_t cesLength); 170 int64_t ces[], int32_t cesLength) { 173 builderData.ces = builder.ce64s.getBuffer(); 181 // No need to keep all CEs in the iterator buffer. 199 ces[cesLength] = ce; 397 int64_t dataCE = fromBase ? base->ces[i] : ce64s.elementAti(i); 462 return fromBase ? base->ces[i] : ce64s.elementAti(i); 528 const int64_t ces[], int32_t cesLength [all...] |
collationbuilder.cpp | 297 ces[0] = getSpecialResetPosition(str, parserErrorReason, errorCode); 300 U_ASSERT((ces[0] & Collation::CASE_AND_QUATERNARY_MASK) == 0); 308 cesLength = dataBuilder->getCEs(nfdString, ces, 0); 427 strength = ceStrength(ces[cesLength - 1]); 433 ces[cesLength - 1] = tempCEFromIndexAndStrength(index, strength); 490 // Quaternary CEs are not supported. 491 // Non-zero quaternary weights are possible only on tertiary or stronger CEs. 557 // script-first-primary CEs in the root collator. 594 // because there are no root CEs with a boundary primary 699 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...] |
usearch.cpp | 78 * This is to squeeze the 21bit ces into a 256 table 310 if (pattern->ces != cetable && pattern->ces) { 311 uprv_free(pattern->ces); 339 pattern->ces = cetable; 391 // ** Should processed CEs be signed or unsigned? 471 * @param cesize size of the pattern ces 484 // number of characters to give the relevant ces, ie approximately 485 // the number of ces minus their expansion, since expansions can come 493 // number of ces from right of array to the coun [all...] |
usrchimp.h | 44 * This indicates an error has occured during processing or there are no more CEs 154 int32_t *ces; member in struct:UPattern
|
alphaindex.cpp | 396 const UnicodeString &s, UVector64 &ces, UErrorCode &errorCode) { 397 ces.removeAllElements(); 398 coll.internalGetCEs(s, ces, errorCode); 401 for (int32_t i = 0; i < ces.size(); ++i) { 402 int64_t ce = ces.elementAti(i); 425 UVector64 ces(errorCode); 509 ces, errorCode) && 522 ces, errorCode)) { [all...] |
/external/valgrind/coregrind/m_debuginfo/ |
image.c | 89 // Pointers to the entries. ces[0 .. ces_used-1] are non-NULL. 90 // ces[ces_used .. CACHE_N_ENTRIES-1] are NULL. 93 CEnt* ces[CACHE_N_ENTRIES]; member in struct:_DiImage 425 vg_assert(img->ces[entNo] == NULL); 426 img->ces[entNo] = ML_(dinfo_zalloc)("di.alloc_CEnt.1", sizeof(CEnt)); 436 CEnt* tmp = img->ces[entNo]; 438 img->ces[entNo] = img->ces[entNo-1]; 441 img->ces[0] = tmp; 456 vg_assert(img->ces[entNo] != NULL) [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
CollationElementIterator.java | 122 * so that getOffset() returns intermediate offsets for the CEs 292 // CollationIterator.previousCE() decrements the CEs length 293 // while it pops CEs from its internal buffer. 342 // No need to keep all CEs in the buffer when we iterate. 348 // Turn the 64-bit CE into two old-style 32-bit CEs, without quaternary bits. 400 // If we already have expansion CEs, then we also have offsets. 408 // Turn the 64-bit CE into two old-style 32-bit CEs, without quaternary bits. 415 // When we convert a single 64-bit CE into two 32-bit CEs, 620 public void handleExpansion(long ces[], int start, int length) { 622 // We do not need to add single CEs into the map [all...] |
/external/jmonkeyengine/engine/src/lwjgl/com/jme3/input/lwjgl/ |
JInputJoyInput.java | 31 Component[] ces = c.getComponents(); local 36 for (Component comp : ces){
|
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
CollationTest.java | 275 long[] ces; local 277 ces = rbc.internalGetCEs(s); 278 if (ces.length != 2) { 279 errln("expected 2 CEs for <FFFE, FFFF>, got " + ces.length); 283 long ce = ces[0]; 289 ce = ces[1]; 720 // Well-formed CEs. 725 // Quaternary CEs are not supported. 852 // and we also verify that there is a tailoring gap between each two CEs 969 long[] ces; local [all...] |