Home
last modified time | relevance | path

Searched refs:lcm (Results 1 – 25 of 30) sorted by relevance

12

/external/libcxx/test/std/numerics/numeric.ops/numeric.ops.lcm/
Dlcm.pass.cpp44 static_assert(std::is_same_v<Output, decltype(std::lcm(value1, value2))>, ""); in test0()
45 static_assert(std::is_same_v<Output, decltype(std::lcm(value2, value1))>, ""); in test0()
46 assert(static_cast<Output>(out) == std::lcm(value1, value2)); in test0()
140 auto res1 = std::lcm(static_cast<std::int64_t>(1234), INT32_MIN); in main()
141 TEST_IGNORE_NODISCARD std::lcm(INT_MIN, 2UL); // this used to trigger UBSAN in main() member in main::std
Dlcm.not_integral2.fail.cpp24 std::lcm(4, 6.0); in main()
Dlcm.bool2.fail.cpp24 std::lcm(2, true); in main()
Dlcm.bool4.fail.cpp24 std::lcm<int, const bool>(2, true); in main()
Dlcm.not_integral1.fail.cpp24 std::lcm(2.0, 4); in main()
Dlcm.bool1.fail.cpp24 std::lcm(false, 4); in main()
Dlcm.bool3.fail.cpp24 std::lcm<volatile bool, int>(false, 4); in main()
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/
DMath.java22 public static long lcm(long a, long b) { in lcm() method in Math
26 public static int lcm(int a, int b) { in lcm() method in Math
/external/boringssl/src/crypto/fipsmodule/bn/
Dcheck_bn_tests.go282 lcm := new(big.Int).Mul(a, b)
283 lcm = lcm.Div(lcm, g)
284 checkResult(test, "LCM(A, B)", "LCM", lcm)
Dbn_test.cc878 bssl::UniquePtr<BIGNUM> lcm = t->GetBIGNUM("LCM"); in TestGCD() local
882 ASSERT_TRUE(lcm); in TestGCD()
925 EXPECT_BIGNUMS_EQUAL("LCM(A, B)", lcm.get(), ret.get()); in TestGCD()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
DRSAKeyPairGenerator.java59 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; in generateKeyPair() local
119 lcm = pSub1.divide(gcd).multiply(qSub1); in generateKeyPair()
124 d = e.modInverse(lcm); in generateKeyPair()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/generators/
DRSAKeyPairGenerator.java61 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; in generateKeyPair() local
121 lcm = pSub1.divide(gcd).multiply(qSub1); in generateKeyPair()
126 d = e.modInverse(lcm); in generateKeyPair()
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
DMathUtils.java1161 public static int lcm(int a, int b) {
1165 int lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
1166 if (lcm == Integer.MIN_VALUE) {
1171 return lcm;
1196 public static long lcm(long a, long b) {
1200 long lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
1201 if (lcm == Long.MIN_VALUE){
1206 return lcm;
/external/libcxx/include/
Dnumeric135 constexpr common_type_t<M,N> lcm(M m, N n); // C++17
506 lcm(_Tp __m, _Up __n)
508 …static_assert((is_integral<_Tp>::value && is_integral<_Up>::value), "Arguments to lcm must be inte…
509 …static_assert((!is_same<typename remove_cv<_Tp>::type, bool>::value), "First argument to lcm canno…
510 …static_assert((!is_same<typename remove_cv<_Up>::type, bool>::value), "Second argument to lcm cann…
517 _LIBCPP_ASSERT((numeric_limits<_Rp>::max() / __val1 > __val2), "Overflow in lcm");
/external/boringssl/src/crypto/fipsmodule/rsa/
Drsa.c659 BIGNUM n, pm1, qm1, lcm, dmp1, dmq1, iqmp_times_q; in RSA_check_key() local
693 BN_init(&lcm); in RSA_check_key()
703 !bn_lcm_consttime(&lcm, &pm1, &qm1, ctx) || in RSA_check_key()
706 !check_mod_inverse(&d_ok, key->e, key->d, &lcm, in RSA_check_key()
758 BN_free(&lcm); in RSA_check_key()
/external/llvm/lib/CodeGen/
DTargetSchedule.cpp47 static unsigned lcm(unsigned A, unsigned B) { in lcm() function
67 ResourceLCM = lcm(ResourceLCM, NumUnits); in init()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DTargetSchedule.cpp58 static unsigned lcm(unsigned A, unsigned B) { in lcm() function
76 ResourceLCM = lcm(ResourceLCM, NumUnits); in init()
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/
DSyncSampleIntersectFinderImpl.java27 import static com.googlecode.mp4parser.util.Math.lcm;
298 timeScale = lcm(timeScale, track1.getTrackMetaData().getTimescale()); in calculateTracktimesScalingFactor()
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
DMultiplyTimeScaleTrack.java30 import static com.googlecode.mp4parser.util.Math.lcm;
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DNFRuleSet.java634 leastCommonMultiple = lcm(leastCommonMultiple, rules[i].getBaseValue()); in findFractionRuleSetRule()
692 private static long lcm(long x, long y) { in lcm() method in NFRuleSet
/external/icu/android_icu4j/src/main/java/android/icu/text/
DNFRuleSet.java635 leastCommonMultiple = lcm(leastCommonMultiple, rules[i].getBaseValue()); in findFractionRuleSetRule()
693 private static long lcm(long x, long y) { in lcm() method in NFRuleSet
/external/v8/benchmarks/
Dearley-boyer.js418 var lcm = 1;
420 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
421 lcm *= Math.abs(f);
423 return lcm;
/external/icu/icu4c/source/data/misc/
DlikelySubtags.txt688 lcm{"lcm_Latn_ZZ"}
/external/deqp/external/openglcts/modules/gl/
Dgl4cEnhancedLayoutsTests.hpp1696 glw::GLuint lcm(glw::GLuint a, glw::GLuint b);
Dgl4cEnhancedLayoutsTests.cpp9916 const GLuint boy_offset = lcm(boy_size, man_size); in test()
9983 GLuint UniformBlockMemberOverlappingOffsetsTest::lcm(GLuint a, GLuint b) in test() function in gl4cts::EnhancedLayouts::UniformBlockMemberOverlappingOffsetsTest

12