| /external/oboe/samples/RhythmGame/third_party/glm/gtx/ |
| D | fast_exponential.hpp | 28 /// Faster than the common pow function but less accurate.
33 /// Faster than the common pow function but less accurate.
38 /// Faster than the common pow function but less accurate.
43 /// Faster than the common pow function but less accurate.
48 /// Faster than the common exp function but less accurate.
53 /// Faster than the common exp function but less accurate.
58 /// Faster than the common log function but less accurate.
63 /// Faster than the common exp2 function but less accurate.
68 /// Faster than the common exp2 function but less accurate.
73 /// Faster than the common exp2 function but less accurate.
[all …]
|
| D | fast_square_root.hpp | 31 /// Faster than the common sqrt function but less accurate.
37 /// Faster than the common sqrt function but less accurate.
43 /// Faster than the common inversesqrt function but less accurate.
49 /// Faster than the common inversesqrt function but less accurate.
55 /// Faster than the common length function but less accurate.
61 /// Faster than the common length function but less accurate.
67 /// Faster than the common distance function but less accurate.
73 /// Faster than the common distance function but less accurate.
79 /// Faster than the common normalize function but less accurate.
|
| D | fast_trigonometry.hpp | 32 /// Faster than the common sin function but less accurate.
37 /// Faster than the common cos function but less accurate.
42 /// Faster than the common tan function but less accurate.
48 /// Faster than the common asin function but less accurate.
54 /// Faster than the common acos function but less accurate.
60 /// Faster than the common atan function but less accurate.
66 /// Faster than the common atan function but less accurate.
|
| /external/python/pyasn1/pyasn1/type/ |
| D | char.py | 171 # Optimization for faster codec lookup
186 # Optimization for faster codec lookup
201 # Optimization for faster codec lookup
208 # Optimization for faster codec lookup
223 # Optimization for faster codec lookup
238 # Optimization for faster codec lookup
253 # Optimization for faster codec lookup
268 # Optimization for faster codec lookup
275 # Optimization for faster codec lookup
289 # Optimization for faster codec lookup
[all …]
|
| /external/mesa3d/docs/ |
| D | versions.rst | 19 - faster point and line drawing (2x faster)
53 - much faster pixel logic ops!
54 - faster transformation arithmetic
69 - faster X device driver functions
136 - Faster rendering of smooth-shaded, RGBA, depth-buffered polygons.
137 - Faster rendering of lines when width=2.0
186 - Faster vertex transformation
187 - Faster raster operations into X windows under certain conditions
254 - faster line and polygon rendering under certain conditions. See
257 - lighting is a bit faster
[all …]
|
| /external/skia/bench/ |
| D | check_bench_regressions.py | 31 # Indices of the tuple of dictionaries containing slower and faster alerts.
33 FASTER = 1 variable
150 # Tuple of dictionaries recording exceptions that are slower and faster,
175 exceptions[FASTER].setdefault(off_ratio, []).append(exception)
177 for i in [SLOWER, FASTER]:
185 if i == FASTER:
186 header = header.replace('slower', 'faster')
|
| /external/libcxxabi/test/ |
| D | dynamic_cast_stress.pass.cpp | 76 B<Width/2, Depth> -O3 48.334 93.190 libc++abi 93% faster
77 B<Width/2, Depth> -Os 58.535 94.103 libc++abi 61% faster
78 A<Width, Depth> -O3 11.515 33.134 libc++abi 188% faster
79 A<Width, Depth> -Os 12.631 31.553 libc++abi 150% faster
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/strings/internal/ |
| D | ostringstream.h | 30 // and is faster. It is ~70% faster to create, ~50% faster to write to, and
43 // OStringStream is faster to create than std::ostringstream but it's still
|
| /external/openscreen/third_party/abseil/src/absl/strings/internal/ |
| D | ostringstream.h | 30 // and is faster. It is ~70% faster to create, ~50% faster to write to, and
43 // OStringStream is faster to create than std::ostringstream but it's still
|
| /external/webrtc/third_party/abseil-cpp/absl/strings/internal/ |
| D | ostringstream.h | 30 // and is faster. It is ~70% faster to create, ~50% faster to write to, and
43 // OStringStream is faster to create than std::ostringstream but it's still
|
| /external/angle/third_party/abseil-cpp/absl/strings/internal/ |
| D | ostringstream.h | 30 // and is faster. It is ~70% faster to create, ~50% faster to write to, and
43 // OStringStream is faster to create than std::ostringstream but it's still
|
| /external/abseil-cpp/absl/strings/internal/ |
| D | ostringstream.h | 30 // and is faster. It is ~70% faster to create, ~50% faster to write to, and
43 // OStringStream is faster to create than std::ostringstream but it's still
|
| /external/libtextclassifier/abseil-cpp/absl/strings/internal/ |
| D | ostringstream.h | 30 // and is faster. It is ~70% faster to create, ~50% faster to write to, and
43 // OStringStream is faster to create than std::ostringstream but it's still
|
| /external/zstd/ |
| D | CHANGELOG | 3 perf: faster huffman decoder, using x64 assembly, by @terrelln
4 perf: slightly faster high speed modes (strategies fast & dfast), by @felixhandte
5 perf: improved binary size and faster compilation times, by @terrelln
7 perf: faster mid-level compression speed in presence of highly repetitive patterns, by @senhuang42
10 perf: faster compression speed on incompressible data, by @bindhvo
107 perf: faster dictionary compression at medium compression levels, by @felixhandte
202 cli: faster `-t` test mode
232 perf: Slightly faster compression speed when re-using a context by @cyan4973 (#1658)
234 perf: Faster compression speed in high compression mode for repetitive data by @terrelln (#1635)
323 perf: much faster dictionary builder, by @jenniferliu
[all …]
|
| /external/jimfs/jimfs/src/main/java/com/google/common/jimfs/ |
| D | Util.java | 81 // this is significantly faster than looping or Arrays.fill (which loops), particularly when in zero()
82 // the length of the slice to be zeroed is <= to ARRAY_LEN (in that case, it's faster by a in zero()
99 // this is significantly faster than looping or Arrays.fill (which loops), particularly when in clear()
100 // the length of the slice to be cleared is <= to ARRAY_LEN (in that case, it's faster by a in clear()
|
| /external/rust/crates/parking_lot/ |
| D | README.md | 14 `Once` that are smaller, faster and more flexible than those in the Rust
20 faster than `std::sync::Mutex` when uncontended, and up to 5x faster when
22 the number of reader and writer threads, but are almost always faster than
23 the standard library `RwLock`, and even up to 50x faster in some cases.
|
| /external/sonic/ |
| D | sonic.1 | 10 Sonic is used to make wav files of speech faster or slower. The primary advance
18 Modify pitch by emulating vocal chords vibrating faster or slower. This causes
34 Set speed up factor. 1.0 means no change, 2.0 means 2X faster.
|
| /external/libvpx/libvpx/ |
| D | CHANGELOG | 136 is about 10-20% faster than speed 8.
179 Faster VP9 encoding and decoding.
228 Faster VP9 encoding and decoding
243 Faster VP9 encoding and decoding
395 faster (ARM) depending on the number of threads and bitrate
454 same content at different resolutions faster than encoding them
507 Our third named release, focused on a faster, higher quality, encoder.
532 telephony content is 35% faster than Bali on single core and 48%
533 faster on multi-core. On the NVidia Tegra2 platform, real time
534 encoding is 40% faster than Bali.
[all …]
|
| /external/tensorflow/tensorflow/lite/g3doc/performance/ |
| D | best_practices.md | 14 also generally faster and more energy efficient. For example, graphs below show
53 write a faster version of a custom op if you know the constraints in which the
59 Model optimization aims to create smaller models that are generally faster and
87 the Java API is a lot faster if `ByteBuffers` are used as
102 TensorFlow Lite has added new ways to accelerate models with faster hardware
|
| /external/eigen/unsupported/bench/ |
| D | bench_svd.cpp | 64 …cout << "KO : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" … in bench_svd()
66 …cout << "OK : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" … in bench_svd()
95 …cout << "KO : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" … in bench_svd()
97 …cout << "OK : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" … in bench_svd()
|
| /external/lua/doc/ |
| D | luac.1 | 20 faster loading,
24 Precompiling does not imply faster execution
29 The main goal in precompiling is faster loading.
|
| /external/zopfli/src/zopfli/ |
| D | util.h | 69 faster. Uses this many times three bytes per single byte of the input data.
81 faster on some specific files.
101 Switch to a faster hash based on the info from ZOPFLI_HASH_SAME once the
102 best length so far is long enough. This is way faster for files with lots of
|
| /external/libjpeg-turbo/ |
| D | djpeg.1 | 60 runs noticeably faster in this mode.
71 runs much faster when scaling down the output.
136 CPUs, the \fBfast\fR method is generally about 5-15% faster than the \fBint\fR
189 Use a faster, lower-quality upsampling routine.
193 faster and needs less memory, but it produces a lower-quality image.
|
| /external/angle/third_party/abseil-cpp/absl/hash/internal/ |
| D | city.h | 21 // For 64-bit x86 code, on short strings, we don't know of anything faster than
26 // For 32-bit x86 code, we don't know of anything faster than CityHash32 that
28 // (On 64-bit CPUs, it is typically faster to use the other CityHash variants.)
|
| /external/openscreen/third_party/abseil/src/absl/hash/internal/ |
| D | city.h | 21 // For 64-bit x86 code, on short strings, we don't know of anything faster than
26 // For 32-bit x86 code, we don't know of anything faster than CityHash32 that
28 // (On 64-bit CPUs, it is typically faster to use the other CityHash variants.)
|