| /external/ceres-solver/include/ceres/ |
| numeric_diff_functor.h | 91 // Now, we are ready to construct an automatically differentiated cost
|
| /external/ceres-solver/internal/ceres/ |
| compressed_row_jacobian_writer.cc | 139 << "Duplicate parameter blocks detected in a cost function. "
|
| conjugate_gradients_solver.cc | 191 // be the cost of the quadratic function defined by A and b. Then,
|
| solver_test.cc | 148 // A cost function that simply returns its argument.
|
| /external/chromium-trace/catapult/third_party/webapp2/webapp2_extras/ |
| local.py | 31 # and the cost of calculating a hash.
|
| /external/chromium-trace/catapult/tracing/tracing/extras/android/ |
| android_auditor.html | 106 .addAppVideo('Hidden Cost of Transparency', 'wIy8g8yNhNk')
111 'Canvas#saveLayer() incurs extremely high rendering cost. They disrupt the rendering pipeline when drawn, forcing a flush of drawing content. Instead use View hardware layers, or static Bitmaps. This enables the offscreen buffers to be reused in between frames, and avoids the disruptive render target switch.', // @suppress longLineCheck
113 .addAppVideo('Hidden Cost of Transparency', 'wIy8g8yNhNk')
165 'Paths are drawn with a mask texture, so when a path is modified / newly drawn, that texture must be generated and uploaded to the GPU. Ensure that you cache paths between frames and do not unnecessarily call Path#reset(). You can cut down on this cost by sharing Path object instances between drawables/views.'); // @suppress longLineCheck
[all...] |
| /external/deqp/external/vulkancts/framework/vulkan/ |
| vkBinaryRegistry.hpp | 78 // binary, it must be fast to load (to reduce statup cost), and fast to access.
|
| /external/droiddriver/src/io/appium/droiddriver/scroll/ |
| AccessibilityEventScrollStepStrategy.java | 204 * Detecting end by null event is safer (at the cost of a extra scroll) than
|
| /external/eigen/doc/ |
| TutorialBlockOperations.dox | 7 as rvalues and as lvalues. As usual with Eigen expressions, this abstraction has zero runtime cost
|
| /external/eigen/test/ |
| cwiseop.cpp | 30 enum { Cost = NumTraits<Scalar>::AddCost };
|
| /external/emma/core/java12/com/vladium/jcd/cls/ |
| IConstantCollection.java | 105 * when comparator.equals(c) is called c.type() is 'type'. The cost is
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| AtomicDouble.java | 43 * <p>It is possible to write a more scalable updater, at the cost of
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ObjectArrays.java | 208 // creation cost.
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CjkBreakEngine.java | 179 // a default cost specified in the katakanaCost table according
|
| /external/icu/icu4c/source/data/zone/ |
| tzdbNames.txt | 215 sd{"COST"}
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| CjkBreakEngine.java | 178 // a default cost specified in the katakanaCost table according
|
| /external/libavc/encoder/ |
| ih264e_me.h | 346 * Motion estimation happens at nmb level. For cost calculations, mv is appro
|
| /external/libdrm/tests/ |
| hash.c | 53 * distributing the expansion cost over several insertions, and 2) portions
|
| /external/libdrm/ |
| xf86drmHash.c | 53 * distributing the expansion cost over several insertions, and 2) portions
|
| /external/libjpeg-turbo/ |
| jdhuff.h | 63 * prefetching reduces the overhead cost of calling jpeg_fill_bit_buffer).
|
| jfdctfst.c | 64 * machines, and may also reduce the cost of multiplication (since there
|
| /external/llvm/docs/ |
| Lexicon.rst | 142 Language Specific Data Area. C++ "zero cost" unwinding is built on top a
|
| /external/llvm/include/llvm/Analysis/ |
| AssumptionCache.h | 38 /// them and amortizing the cost of scanning for them across all queries. The
|
| /external/llvm/include/llvm/CodeGen/ |
| TargetSchedule.h | 171 /// occasionally useful to help estimate instruction cost.
|
| /external/llvm/include/llvm/Target/ |
| TargetOpcodes.h | 128 /// "zero cost" null checks in managed languages by allowing LLVM to fold
|
