| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/bits/ |
| mathinline.h | 367 /* Optimized inline implementation, sometimes with reduced precision
490 /* The argument range of this inline version is reduced. */
492 /* The argument range of this inline version is reduced. */
520 /* The argument range of the inline version of sinhl is slightly reduced. */
611 /* The argument range of the inline version of asinhl is slightly reduced. */
624 /* The argument range of the inline version of hypotl is slightly reduced. */
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
| Fraction.java | 251 * reduced to lowest terms.
421 * <p>Adds the value of this fraction to another, returning the result in reduced form.
445 * returning the result in reduced form.</p>
525 * result in reduced form.</p>
597 * @return a new fraction instance, with the numerator and denominator reduced
|
| /external/ceres-solver/include/ceres/ |
| types.h | 81 // Solves the reduced linear system using a dense Cholesky solver;
85 // Solves the reduced linear system using a sparse Cholesky solver;
89 // Solves the reduced linear system using Conjugate Gradients, based
|
| /external/llvm/lib/Target/AMDGPU/ |
| SILoadStoreOptimizer.cpp | 34 // pointer and use the new reduced offsets.
149 // Check if the new offsets fit in the reduced 8-bit range.
188 // Check both offsets fit in the reduced range.
|
| /toolchain/binutils/binutils-2.25/gas/ |
| ehopt.c | 403 reduced to a constant. We can do the optimization entirely
426 reduced, so we can not finish the optimization until the end
447 not reduced, so we can not finish the optimization until the
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| BitmapFactoryTest.java | 430 Bitmap reduced = BitmapFactory.decodeResource(mRes, R.drawable.robot, options); local
432 options.inBitmap = reduced;
451 Bitmap reduced = BitmapFactory.decodeResource(mRes, R.drawable.robot, options); local
453 assertSame(original, reduced);
454 assertEquals(originalSize, reduced.getAllocationByteCount());
455 assertEquals(originalSize, reduced.getByteCount() * 16);
[all...] |
| /external/llvm/tools/bugpoint/ |
| CrashDebugger.cpp | 702 BD.EmitProgressBitcode(BD.getProgram(), "reduced-global-variables");
722 BD.EmitProgressBitcode(BD.getProgram(), "reduced-function");
738 BD.EmitProgressBitcode(BD.getProgram(), "reduced-blocks");
815 BD.EmitProgressBitcode(BD.getProgram(), "reduced-instructions");
848 BD.setNewProgram(M); // Yup, it does, keep the reduced version...
854 BD.EmitProgressBitcode(BD.getProgram(), "reduced-simplified");
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFA.java | 115 /** Is this DFA reduced? I.e., can all states lead to an accept state? */
116 protected boolean reduced = true; field in class:DFA
713 /** Is the DFA reduced? I.e., does every state have a path to an accept
719 return reduced;
899 * 1. it's reduced
914 * modify the instance variable 'reduced' to indicate if we find
916 * that the overall DFA is not reduced. This algorithm should b
[all...] |
| /external/clang/docs/ |
| PTHInternals.rst | 105 **Reduced memory pressure**
141 of the strengths of PTH such as reduced memory pressure (ideal for
|
| /external/expat/ |
| Changes | 135 - Reduced line-length for all source code and headers to be
137 - Reduced memory copying during parsing (SF patch #600964).
|
| /external/llvm/include/llvm/Target/ |
| TargetItinerary.td | 97 // read from the same bypass, then the operand use latency is reduced by one.
109 // is reduced by 1.
|
| /external/mksh/src/ |
| lksh.1 | 26 .\" * ~ is size-reduced and placed atop in groff, so use \*(TI
27 .\" * ^ is size-reduced and placed atop in groff, so use \*(ha
|
| /toolchain/binutils/binutils-2.25/gas/doc/ |
| c-nds32.texi | 103 @item -m[no-]reduced-regs
104 Enable/Disable Reduced Register configuration (GPR16) option
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_atan.c | 20 * is further reduced to one of the following intervals and the
|
| s_cbrtl.c | 108 * dt is cbrtl(x) to ~47 bits (after x has been reduced to 1 <= x < 8).
|
| /developers/build/prebuilts/gradle/BasicRenderScript/Application/src/main/java/com/example/android/basicrenderscript/ |
| MainActivity.java | 31 Ideally, this can be reduced to 2, however in some devices, 2 buffers still showing tierings on UI.
|
| /developers/samples/android/renderScript/BasicRenderScript/Application/src/main/java/com/example/android/basicrenderscript/ |
| MainActivity.java | 31 Ideally, this can be reduced to 2, however in some devices, 2 buffers still showing tierings on UI.
|
| /development/samples/browseable/BasicRenderScript/src/com.example.android.basicrenderscript/ |
| MainActivity.java | 31 Ideally, this can be reduced to 2, however in some devices, 2 buffers still showing tierings on UI.
|
| /docs/source.android.com/src/devices/audio/ |
| warmup.jd | 101 Warmup time can usually be reduced by a combination of:
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| WTauNafMultiplier.java | 16 * by <code>k</code> using the reduced <code>τ</code>-adic NAF (RTNAF)
|
| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement.h | 31 // An iterative solver for solving the Schur complement/reduced camera
|
| implicit_schur_complement_test.cc | 152 // Compare the rhs of the reduced linear system
|
| schur_jacobi_preconditioner.cc | 90 // eliminator combines the computation of the reduced camera matrix
|
| /external/chromium-trace/catapult/netlog_viewer/netlog_viewer/ |
| tab_switcher_view.js | 40 // The ideal width of the tab list. If width is reduced below this, the
|
| /external/chromium-trace/catapult/third_party/polymer/components/iron-a11y-keys-behavior/ |
| CONTRIBUTING.md | 49 2. **A reduced test case that demonstrates the problem.** If possible, please include the test case as a JSBin. Start with this template to easily import and use relevant Polymer Elements: [https://jsbin.com/cagaye/edit?html,output](https://jsbin.com/cagaye/edit?html,output).
|
