| /third_party/openssl/test/recipes/10-test_bn_data/ |
| D | bngcd.txt | 8 # GCD tests.
10 # These test vectors satisfy gcd(A, B) = GCD.
15 GCD = 0
20 GCD = 1
25 GCD = 1
30 GCD = 70030ffeeea3deaea19387f4f1d0f460a6954a2a9cb98290602ac09036143ef8eb9692f3eac22961811083e073ee0…
35 GCD = 231f16458c487346cf50a17beec83632f25d19abeea1097c746533cd3e35207b7efd75dc3e9c663a64b6861e88579…
42 GCD = 3
46 GCD = 5
50 GCD = 7
[all …]
|
| /third_party/boost/libs/integer/doc/gcd/ |
| D | math-gcd.qbk | 8 (GCD) or least common multiple (LCM) of two integers.
54 [section GCD Function Object]
81 the GCD function template. If a numeric type wants to customize evaluations
127 [section:run_time Run-time GCD & LCM Determination]
170 [section:compile_time Compile time GCD and LCM determination]
214 cout << "The GCD and LCM of 6 and 15 are "
219 cout << "The GCD and LCM of 8 and 9 are "
247 instantiating various examples of the run-time GCD and LCM function
248 templates and the compile-time GCD and LCM class templates.
249 (The run-time GCD and LCM class templates are tested indirectly through
[all …]
|
| /third_party/mbedtls/tests/suites/ |
| D | test_suite_mpi.data | 1314 Base test GCD #1
1317 Base test GCD #2
1320 Base test GCD #3
1323 Test GCD: 0 (null), 0 (null)
1326 Test GCD: 0 (null), 0 (1 limb)
1329 Test GCD: 0 (null), 3
1332 Test GCD: 0 (null), 6
1335 Test GCD: 0 (1 limb), 0 (null)
1338 Test GCD: 0 (1 limb), 3
1341 Test GCD: 0 (1 limb), 6
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/ |
| D | Support.cpp | 29 unsigned GCD = GreatestCommonDivisor64(Denominator, RHS.Denominator); in operator +=() local
30 unsigned LCM = (Denominator * RHS.Denominator) / GCD; in operator +=()
|
| /third_party/boost/boost/ratio/ |
| D | ratio.hpp | 86 static const boost::intmax_t GCD = mpl::gcd_c<boost::intmax_t, ABS_N, ABS_D>::value; member in boost::ratio
88 BOOST_STATIC_CONSTEXPR boost::intmax_t num = SIGN_N * ABS_N / GCD;
89 BOOST_STATIC_CONSTEXPR boost::intmax_t den = ABS_D / GCD;
|
| /third_party/boost/libs/math/doc/internals/ |
| D | polynomial.qbk | 159 [@https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean GCD].
161 Division of polynomials over a UFD is compatible with the subresultant algorithm for GCD (implement…
|
| /third_party/boost/libs/algorithm/test/ |
| D | Jamfile.v2 | 64 # Maybe GCD and LCM as well
|
| /third_party/ntfs-3g/ |
| D | TODO.ntfsprogs | 44 - check if kernel block size = GCD(page size, device size) makes
|
| /third_party/python/Doc/library/ |
| D | fractions.rst | 90 Previously, the GCD type depended on *numerator* and *denominator*.
|
| /third_party/gstreamer/gstplugins_base/gst-libs/gst/gl/eagl/ |
| D | gstglwindow_eagl.m | 272 /* this case happens for nested calls happening from inside the GCD queue */
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/ |
| D | LegalizerHelper.cpp | 178 int GCD = greatestCommonDivisor(OrigTy.getNumElements(), in getGCDType() local
180 return LLT::scalarOrVector(GCD, OrigTy.getElementType()); in getGCDType()
190 int GCD = greatestCommonDivisor(OrigTy.getSizeInBits(), in getGCDType() local
192 return LLT::scalar(GCD); in getGCDType()
1248 const int GCD = greatestCommonDivisor(SrcSize, WideSize); in widenScalarMergeValues() local
1249 LLT GCDTy = LLT::scalar(GCD); in widenScalarMergeValues()
1259 if (GCD == SrcSize) { in widenScalarMergeValues()
1275 const int PartsPerGCD = WideSize / GCD; in widenScalarMergeValues()
|
| /third_party/gstreamer/gstplugins_base/gst-libs/gst/gl/cocoa/ |
| D | gstglwindow_cocoa.m | 503 /* this case happens for nested calls happening from inside the GCD queue */
|
| /third_party/python/Misc/NEWS.d/ |
| D | 3.9.0a4.rst | 407 always return a :class:`int` type. Previously, the GCD type depended on
|
| /third_party/boost/libs/math/doc/overview/ |
| D | roadmap.qbk | 112 * Improve polynomial GCD algorithms, with thanks to Jeremy Murphy.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | ScalarEvolution.cpp | 6318 unsigned GCD = std::min(MulZeros, TZ); in createSCEV() local
6319 APInt DivAmt = APInt::getOneBitSet(BitWidth, TZ - GCD); in createSCEV()
6321 MulOps.push_back(getConstant(OpC->getAPInt().lshr(GCD))); in createSCEV()
|
| /third_party/eudev/hwdb/ |
| D | 20-OUI.hwdb | 8319 ID_OUI_FROM_DATABASE=GCD Hard- & Software GmbH
|
| /third_party/gstreamer/gstplugins_base/ |
| D | ChangeLog | 8623 to run the provided callback immediately or queue in GCD
9606 to run the provided callback immediately or queue in GCD
51068 Also calculate the GCD with the current phase so that we can accurately
|
| /third_party/gstreamer/gstreamer/ |
| D | ChangeLog | 55375 gstutils: add a 64 bit version of GCD calculation
77724 utils: GCD is 0 if both parameters are 0, don't divide by zero
|
| /third_party/gstreamer/gstplugins_good/ |
| D | ChangeLog | 69660 deinterlace: reuse core function for GCD
|