| /third_party/skia/third_party/externals/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.
|
| D | normalize_dot.hpp | 29 /// It's faster that dot(normalize(x), normalize(y)).
36 /// Faster that dot(fastNormalize(x), fastNormalize(y)).
|
| /third_party/backends/backend/ |
| D | mustek.conf.in | 5 # be faster without this option
15 # option lineart-fix # lineart may be faster with this option off.
16 # option disable-backtracking # faster, but may produce stripes
22 # option lineart-fix # lineart may be faster with this option off.
23 # option disable-backtracking # faster, but may produce stripes
29 # option lineart-fix # lineart may be faster with this option off.
30 # option disable-backtracking # faster, but may produce stripes
|
| /third_party/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')
|
| /third_party/skia/third_party/externals/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
|
| /third_party/pulseaudio/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.
|
| D | main.c | 62 " faster or slower.\n" in usage()
65 " -r rate -- Set playback rate. 2.0 means 2X faster, and 2X pitch.\n" in usage()
66 " -s speed -- Set speed up factor. 2.0 means 2X faster.\n" in usage()
|
| /third_party/lz4/ |
| D | NEWS | 11 lib : Slightly faster (+5%) HC compression speed (levels 3-9), by @JunHe77
26 perf : faster decoding speed (~+20%) on aarch64 platforms
27 perf : faster decoding speed (~+70%) for -BD4 setting in CLI
49 perf: faster speed with Visual Studio, thanks to @wolfpld and @remittor
112 perf: *much* faster dictionary compression on small files, by @felixhandte
114 perf: slightly faster HC compression and decompression speed
124 perf : faster and stronger ultra modes (levels 10+)
125 perf : slightly faster compression and decompression speed
177 Makefile: Generates object files (*.o) for faster (re)compilation on low power systems
|
| /third_party/skia/third_party/externals/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.)
|
| /third_party/skia/third_party/externals/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.
|
| /third_party/astc-encoder/Docs/ |
| D | ChangeLog-3x.md | 15 significant improvements to the command line front-end (faster PNG loader) and
16 the arm64 build of the codec (faster NEON implementation).
20 the Wuffs library, which is robust and significantly faster than the
23 faster, but not bit-exact, builds by setting `-DNO_INVARIANCE=ON` for the
170 release, although it should be noted that they are still faster to compress
203 faster than the 3.0 release, as well as further incremental improvements to
205 faster to integrate into other projects as a library, including support for
|
| /third_party/backends/doc/gt68xx/ |
| D | gt68xx.CHANGES | 181 * Re-enabled forked reader process when fork is not disabled. That's faster
270 * Made 600 dpi mode for Mustek BearPaw 2400 TA Plus a bit faster.
339 is much faster now.
451 Is faster now for most cases.
463 CIS calibration is faster now, it doesn't seem to be necessary and produces
510 - Faster automatic gain setting for the CIS scanners. The default values from
565 calibration/gain. TA mode is faster therefore.
591 - Added 50 dpi mode for BearPaw 2400 TA Plus. Faster preview.
637 scanners should be faster therefore.
639 (->faster, but lines are lost).
[all …]
|
| /third_party/skia/third_party/externals/libwebp/ |
| D | ChangeLog | 71 01b38ee1 faster CollectColorXXXTransforms_SSE41
75 fae41617 faster CombinedShannonEntropy_SSE2
733 5cfd4ebc LZ77 interval speedups. Faster, smaller, simpler.
800 0d55f60c 40% faster ApplyAlphaMultiply_SSE2
802 48b1e85f SSE2: 15% faster alpha-processing functions
804 28fe054e SSE2: 30% faster ApplyAlphaMultiply()
812 00b08c88 Merge "NEON: 5% faster conversion to RGB565 and RGBA4444"
813 0e7f4447 Merge "NEON: faster fancy upsampling"
814 b016cb91 NEON: faster fancy upsampling
819 341d711c NEON: 5% faster conversion to RGB565 and RGBA4444
[all …]
|
| /third_party/toybox/www/ |
| D | design.html | 80 I wouldn't have to say this, but I do. Trying to find a faster sorting
91 <p>Understand the difference between throughput and latency. Faster
104 but it's just as true that a loop which stays in L1 cache is many times faster
106 about whether "&" is faster than "%" until your executable loop stays in L1
151 is faster than read() because it avoids a copy, but twiddling with the memory
155 blocks waiting for), the read can be many times faster. On the other hand, the
157 comes from the page cache (allocated anyway), and it can be faster if you're
161 on underneath is a big help to making it happen faster.)</p>
166 faster because processors were so slow. Then processors got faster and grew
167 math coprocessors, and calculating the value each time became faster than
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | SelectionDAGTargetInfo.h | 89 /// faster than a libcall. The first returned SDValue is the result of the
101 /// faster than a libcall. The first returned SDValue is the result of the
112 /// where that is faster than a libcall.
126 /// faster than a libcall.
|
| /third_party/openssl/crypto/bn/ |
| D | bn_ppc.c | 31 * but above subroutine is faster on contemporary processors. in bn_mul_mont()
33 * FPU code path would be faster, POWER6 perhaps, but there was in bn_mul_mont()
|
| /third_party/python/Objects/stringlib/ |
| D | replace.h | 15 If it occurs often, it is faster to scan for it using an inline in STRINGLIB()
16 loop. If it occurs seldom, it is faster to scan for it using a in STRINGLIB()
|
| /third_party/python/Python/ |
| D | adaptive.md | 60 forms are much faster than the base instruction.
64 `LOAD_GLOBAL_BUILTIN` to be much faster than the adaptive base instruction,
119 As a general rule, specialized instructions should be much faster than the
|
| /third_party/ffmpeg/libavutil/ |
| D | cpu.h | 35 #define AV_CPU_FLAG_SSE2SLOW 0x40000000 ///< SSE2 supported, but usually not faster
39 #define AV_CPU_FLAG_SSE3SLOW 0x20000000 ///< SSE3 supported, but usually not faster
42 #define AV_CPU_FLAG_SSSE3SLOW 0x4000000 ///< SSSE3 supported, but usually not faster
|
| D | ffmath.h | 37 * This is ~2x faster than GNU libm's approach, which is still off by 2ulp on
53 * Compute x^y for floating point x, y. Note: this function is faster than the
|
| /third_party/mbedtls/scripts/ |
| D | ecc-heap.sh | 66 #define MBEDTLS_HAVE_ASM // just make things a bit faster
67 #define MBEDTLS_ECP_NIST_OPTIM // faster and less allocations
|
| /third_party/rust/crates/memchr/src/memchr/ |
| D | mod.rs | 73 /// optimized routine that can be up to an order of magnitude faster in some
137 /// faster in some cases.
190 /// up to an order of magnitude faster in some cases.
246 /// optimized routine that can be up to an order of magnitude faster in some
311 /// faster in some cases.
364 /// up to an order of magnitude faster in some cases.
|
| /third_party/openssl/doc/man3/ |
| D | BF_encrypt.pod | 47 of the faster block ciphers. It is quite a bit faster than DES, and much
48 faster than IDEA or RC2.
|