| /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.
|
| /third_party/boost/boost/sort/spreadsort/ |
| D | string_sort.hpp | 35 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
38 so @c string_sort is asymptotically faster
64 enabling faster generic-programming.
88 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
91 so @c string_sort is asymptotically faster
111 enabling faster generic-programming.
130 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
132 so @c string_sort is asymptotically faster
156 enabling faster generic-programming.
175 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
[all …]
|
| D | integer_sort.hpp | 40 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
42 so @c integer_sort is asymptotically faster
67 enabling faster generic-programming.
89 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
91 so @c integer_sort is asymptotically faster
111 enabling faster generic-programming.
129 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
131 so @c integer_sort is asymptotically faster
158 enabling faster generic-programming.
178 which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n
[all …]
|
| /third_party/boost/boost/sort/spreadsort/detail/ |
| D | constants.hpp | 26 //Used to force a comparison-based sorting for small bins, if it's faster.
30 //iteration. Make this larger the faster boost::sort::pdqsort is relative to integer_sort.
34 //Used to force a comparison-based sorting for small bins, if it's faster.
38 //iteration. Make this larger the faster boost::sort::pdqsort is relative to float_sort.
|
| /third_party/boost/boost/vmd/ |
| D | is_unary.hpp | 33 If the size of a sequence is known it is faster comparing that size to be equal
35 sequence is not known it is faster calling this macro than getting the size and
54 If the size of a sequence is known it is faster comparing that size to be equal
56 sequence is not known it is faster calling this macro than getting the size and
|
| D | is_multi.hpp | 33 If the size of a sequence is known it is faster comparing that size to be greater
35 sequence is not known it is faster calling this macro than getting the size and
54 If the size of a sequence is known it is faster comparing that size to be greater
56 sequence is not known it is faster calling this macro than getting the size and
|
| /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/flutter/skia/bench/ |
| D | check_bench_regressions.py | 27 # Indices of the tuple of dictionaries containing slower and faster alerts.
29 FASTER = 1 variable
146 # Tuple of dictionaries recording exceptions that are slower and faster,
171 exceptions[FASTER].setdefault(off_ratio, []).append(exception)
173 for i in [SLOWER, FASTER]:
181 if i == FASTER:
182 header = header.replace('slower', 'faster')
|
| /third_party/boost/libs/container/example/ |
| D | doc_extended_allocators.cpp | 30 //A vector that can reallocate memory to implement faster insertions in main()
33 //A flat set that can reallocate memory to implement faster insertions in main()
36 //A list that can manages nodes to implement faster in main()
40 //A set that can recycle nodes to implement faster in main()
|
| /third_party/gstreamer/gstplugins_bad/ext/zxing/ |
| D | gstzxing.cpp | 175 gboolean faster; member
228 g_param_spec_boolean ("try-faster", "Try faster", in gst_zxing_class_init()
229 "Try faster to analyze the frame", DEFAULT_TRY_FASTER, in gst_zxing_class_init()
258 zxing->faster = DEFAULT_TRY_FASTER; in gst_zxing_init()
283 zxing->faster = g_value_get_boolean (value); in gst_zxing_set_property()
314 g_value_set_boolean (value, zxing->faster); in gst_zxing_get_property()
359 hints.setTryHarder(!zxing->faster); in gst_zxing_transform_frame_ip()
|
| /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/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/boost/libs/histogram/doc/ |
| D | benchmarks.qbk | 10 …ne of the fastest libraries on the market. If you find a library that is faster than Boost.Histogr…
34 …faster than other libraries. Simultaneously, it is much more flexible, since the axis and storage …
40 … histogram cells. Using the range generator is very convenient and it is faster than by writing ne…
|
| /third_party/boost/boost/local_function/aux_/macro/ |
| D | name.hpp | 65 /* local functor can be passed as tparam only on C++11 (faster) */ \
105 // This is faster on some compilers but not all (e.g., it is faster on GCC
138 // They have more chances to be inlined for faster run-times by some compilers
148 /* it to be faster and it can also be passed as tparam */ \
184 // They can never be inlined for faster run-time (not even by C++11 compilers).
|
| /third_party/boost/libs/sort/doc/ |
| D | autodoc.xml | 116 …dix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <computeroutp…
117 …sis>, so <computeroutput>integer_sort</computeroutput> is asymptotically faster than pure comparis…
132 … calls the fastest sorting algorithm available for a data type, enabling faster generic-programmin…
150 …dix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <computeroutp…
151 …sis>, so <computeroutput>integer_sort</computeroutput> is asymptotically faster than pure comparis…
163 … calls the fastest sorting algorithm available for a data type, enabling faster generic-programmin…
180 …dix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <computeroutp…
181 …sis>, so <computeroutput>integer_sort</computeroutput> is asymptotically faster than pure comparis…
195 … calls the fastest sorting algorithm available for a data type, enabling faster generic-programmin…
214 …dix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <computeroutp…
[all …]
|
| /third_party/libjpeg-turbo/ |
| D | djpeg.1 | 61 runs noticeably faster in this mode.
72 runs much faster when scaling down the output.
121 In libjpeg-turbo, the fast method is generally about 5-15% faster than the int
174 Use a faster, lower-quality upsampling routine.
178 faster and needs less memory, but it produces a lower-quality image.
258 \fB\-dct float\fR may be even faster than \fB\-dct fast\fR. But on most
|
| /third_party/flutter/skia/third_party/externals/libjpeg-turbo/ |
| D | djpeg.1 | 61 runs noticeably faster in this mode.
72 runs much faster when scaling down the output.
121 In libjpeg-turbo, the fast method is generally about 5-15% faster than the int
174 Use a faster, lower-quality upsampling routine.
178 faster and needs less memory, but it produces a lower-quality image.
258 \fB\-dct float\fR may be even faster than \fB\-dct fast\fR. But on most
|
| /third_party/boost/libs/convert/doc/ |
| D | performance.qbk | 62 cnv_spirit_str_to_int_test: 0.2834834560 [s] (1% faster than raw above)
65 cnv_lxcast_str_to_int_test: 1.0607665160 [s] (1% faster than raw above)
66 raw_spirit_str_to_int_test: 0.2792295470 [s] (2% faster than prev. run)
75 raw_lxcast_str_to_int_test: 8.4136546980 [s] (1% faster than prev. run)
77 raw_spirit_str_to_int_test: 2.3842388060 [s] (1% faster than prev. run)
78 cnv_spirit_str_to_int_test: 2.3812094400 [s] (0% faster than raw above)
|
| /third_party/node/deps/npm/node_modules/tweetnacl/ |
| D | CHANGELOG.md | 129 `nacl.sign` and related functions up to 3x faster in `nacl-fast` version.
135 * Significantly improved performance of Salsa20 (~1.5x faster) and
136 Poly1305 (~3.5x faster) in `nacl-fast` version.
156 * Even faster hash for both short and long inputs (in `nacl-fast`).
167 * Fast version now has an improved hash implementation that is 2x-5x faster.
|
| /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/boost/libs/msm/doc/HTML/ |
| D | ch04.html | 12 …t" type="disc"><li class="listitem"><p>The simple test completes 90 times faster with MSM than with
13 …faster with MSM</p></li></ul></div><p>gcc 4.2.3 (Ubuntu 8.04 in VMWare, same PC):</p><div class="i…
|
| /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.)
|