HomeSort by relevance Sort by last modified time
    Searched refs:Symmetric (Results 1 - 15 of 15) sorted by null

  /external/eigen/unsupported/Eigen/src/SparseExtra/
MarketIO.h 72 if(sym == Symmetric) header += " symmetric";
79 if(sym == Symmetric) header += " symmetric";
126 if(substr[4].compare("symmetric") == 0) sym = Symmetric;
  /external/eigen/Eigen/src/Core/util/
Constants.h 179 /** Used to support symmetric, non-selfadjoint, complex matrices. */
180 Symmetric=0x20
  /external/chromium_org/v8/test/mjsunit/
mul-exhaustive-part1.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part10.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part2.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part3.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part4.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part5.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part6.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part7.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part8.js 51 if (x === y) return; // Symmetric cases not necessary.
mul-exhaustive-part9.js 51 if (x === y) return; // Symmetric cases not necessary.
  /external/v8/test/mjsunit/
mul-exhaustive.js 51 if (x === y) return; // Symmetric cases not necessary.
    [all...]
  /external/eigen/Eigen/src/PardisoSupport/
PardisoSupport.h 244 bool symmetric = abs(m_type) < 10;
255 m_iparm[10] = symmetric ? 0 : 1; // Use nonsymmetric permutation and scaling MPS
257 m_iparm[12] = symmetric ? 0 : 1; // Maximum weighted matching algorithm is switched-off (default for symmetric).
529 * For complex matrices, A can also be symmetric only, see the \a Options template parameter.
533 * \tparam Options can be any bitwise combination of Upper, Lower, and Symmetric. The default is Upper, meaning only the upper triangular part has to be used.
534 * Symmetric can be used for symmetric, non-selfadjoint complex matrices, the default being to assume a selfadjoint matrix.
560 pardisoInit(Base::ScalarIsComplex ? ( bool(Options&Symmetric) ? 6 : -4 ) : -2);
566 pardisoInit(Base::ScalarIsComplex ? ( bool(Options&Symmetric) ? 6 : -4 ) : -2)
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex 120 designing cryptosystems. It supports symmetric ciphers, one-way hashes, pseudo-random number generators,
193 of the authors knowledge the only patent related issues within the library are the RC5 and RC6 symmetric block ciphers.
197 The RC2 and RC4 symmetric ciphers are not under patents but are under trademark regulations. This means you can use
254 related issue is if you use the same symmetric cipher, hash or public key state data in multiple threads. Normally
392 Most functions require inputs that are arrays of the data type \textit{unsigned char}. Whether it is a symmetric key, IV
394 lower eight bits contain data. For example, if you want to pass a 256 bit key to a symmetric ciphers setup routine, you
401 \chapter{Symmetric Block Ciphers}
409 All ciphers store their scheduled keys in a single data type called \textit{symmetric\_key}. This allows all ciphers to
544 \index{Symmetric Keys}
545 As a general rule of thumb, do not use symmetric keys under 80 bits if you can help it. Only a few of the ciphers support smalle
    [all...]

Completed in 7215 milliseconds