| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 70 * perform decompositions via LU::compute(const MatrixType&).
84 * \param matrix the matrix of which to compute the LU decomposition.
91 * \param matrix the matrix of which to compute the LU decomposition.
96 FullPivLU& compute(const MatrixType& matrix);
415 compute(matrix);
419 FullPivLU<MatrixType>& FullPivLU<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::FullPivLU
574 /* Thus, all we need to do is to compute Ker U, and then apply Q.
676 * Step 1: compute c = P * rhs.
|
| /frameworks/rs/ |
| rsElement.cpp | 172 void Element::compute() { function in class:Element
258 e->compute();
339 e->compute();
|
| rsType.cpp | 72 void Type::compute() { function in class:Type
265 nt->compute();
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/speech_rules/ |
| speech_rule_engine.js | 123 * Applies rules recursively to compute the final speech object.
183 * @param {string} sepFunc Name of a function used to compute a separator
187 * @param {string} ctxtFunc Name of a function applied to compute the context
|
| /ndk/build/core/ |
| setup-toolchain.mk | 148 # compute NDK_APP_DST_DIR as the destination directory for the generated files
222 $(call modules-compute-dependencies)
236 # Now compute the closure of all module dependencies.
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 19 * Compute a quick-sort split of a vector
119 compute(mat);
144 * Compute an incomplete LU factorization with dual threshold on the matrix mat
149 IncompleteLUT<Scalar>& compute(const MatrixType& amat) function in class:Eigen::IncompleteLUT
213 * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row.
225 // Compute the Fill-reducing permutation
233 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 15 /* TODO extract L, extract U, compute det, etc... */
144 compute(matrix);
195 void compute(const MatrixType& matrix) function in class:Eigen::UmfPackLU
203 * \sa compute()
216 * \sa compute()
231 * \sa factorize(), compute()
256 * \sa analyzePattern(), compute()
|
| /external/guava/guava/src/com/google/common/collect/ |
| MapMaker.java | 655 * @param computingFunction the function used to compute new values
939 private V compute(K key) { method in class:MapMaker.NullComputingConcurrentMap
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/ |
| variance_altivec.asm | 51 ;# Compute sum first. Unpack to so signed subract
64 ;# Now compute sse.
214 ;# Now compute sse.
|
| /external/chromium_org/tools/cygprofile/ |
| mergetraces.py | 37 fields, 2) the virtual start address of the library, used to compute the
|
| /external/clang/test/CXX/temp/temp.decls/temp.friend/ |
| p1.cpp | 104 static T compute(Bool b) { function in class:test3::User
|
| /external/clang/utils/TableGen/ |
| ClangDiagnosticsEmitter.cpp | 314 /// Compute the set of diagnostics and groups that are immediately
316 void compute(VecOrSet DiagsInPedantic,
368 // Lazily compute the threshold value for the group count.
395 void InferPedantic::compute(VecOrSet DiagsInPedantic, function in class:InferPedantic
413 // Compute the set of diagnostics that are directly in -Wpedantic. We
439 // Compute the set of groups that are directly in -Wpedantic. We
509 // Compute the set of diagnostics that are in -Wpedantic.
512 inferPedantic.compute(&DiagsInPedantic, (RecordVec*)nullptr);
826 // Compute a mapping from a DiagGroup to all of its parents.
843 inferPedantic.compute(&DiagsInPedantic, &GroupsInPedantic)
[all...] |
| /external/eigen/bench/ |
| eig33.cpp | 75 // Compute the eigenvalues by solving for the roots of the polynomial.
106 // Compute the eigenvalues
110 // compute the eigen vectors
182 BENCH(t, tries, rep, eig.compute(A));
|
| /external/eigen/test/ |
| qr.cpp | 83 qr.compute(m1);
|
| qr_colpivoting.cpp | 101 qr.compute(m1);
|
| qr_fullpivoting.cpp | 85 qr.compute(m1);
|
| /external/eigen/unsupported/test/ |
| polynomialsolver.cpp | 41 psolve.compute( pols );
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| TypedBlock.java | 54 new Liveness().compute(ca.iterator(), blocks, ca.getMaxLocals(),
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| variance_altivec.asm | 51 ;# Compute sum first. Unpack to so signed subract
64 ;# Now compute sse.
214 ;# Now compute sse.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 133 SizeOffsetEvalType SizeOffset = ObjSizeEval->compute(Ptr);
|
| /frameworks/base/core/java/android/view/ |
| KeyCharacterMap.java | 491 // In this case we don't even need to compute the combining character.
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ppc/ |
| variance_altivec.asm | 51 ;# Compute sum first. Unpack to so signed subract
64 ;# Now compute sse.
214 ;# Now compute sse.
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ForkJoinPoolTest.java | 106 public Integer compute() { method in class:ForkJoinPoolTest.FibTask
112 return (new FibTask(n - 2)).compute() + f1.join();
134 public Integer compute() { method in class:ForkJoinPoolTest.LockingFibTask
149 return f2.compute() + f1.join();
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/arm/neon/ |
| vp9_reconintra_neon.asm | 307 ; Compute above - ytop_left
310 ; Load left row by row and compute left + (above - ytop_left)
359 ; Compute above - ytop_left
362 ; Load left row by row and compute left + (above - ytop_left)
430 ; Compute above - ytop_left
436 ; Load left row by row and compute left + (above - ytop_left)
525 ; Compute above - ytop_left
533 ; Load left row by row and compute left + (above - ytop_left)
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| expression-trees.js | 42 // ways. For each split recursively compute all possible subtrees.
|
