diff options
author | Clifford Wolf <clifford@clifford.at> | 2013-02-27 09:32:19 +0100 |
---|---|---|
committer | Clifford Wolf <clifford@clifford.at> | 2013-02-27 09:32:19 +0100 |
commit | a321a5c412090d04dfaea4b4876c4901c42cfe44 (patch) | |
tree | b08d286e0aea76be9aab7a543df0b51e76b6ede4 /bigint/BigIntegerAlgorithms.hh | |
parent | 4f0c2862a0d7e1ca247e0a4d54301c7f8cc92fd8 (diff) | |
download | yosys-a321a5c412090d04dfaea4b4876c4901c42cfe44.tar.gz yosys-a321a5c412090d04dfaea4b4876c4901c42cfe44.tar.bz2 yosys-a321a5c412090d04dfaea4b4876c4901c42cfe44.zip |
Moved stand-alone libs to libs/ directory and added libs/subcircuit
Diffstat (limited to 'bigint/BigIntegerAlgorithms.hh')
-rw-r--r-- | bigint/BigIntegerAlgorithms.hh | 25 |
1 files changed, 0 insertions, 25 deletions
diff --git a/bigint/BigIntegerAlgorithms.hh b/bigint/BigIntegerAlgorithms.hh deleted file mode 100644 index b1dd94322..000000000 --- a/bigint/BigIntegerAlgorithms.hh +++ /dev/null @@ -1,25 +0,0 @@ -#ifndef BIGINTEGERALGORITHMS_H -#define BIGINTEGERALGORITHMS_H - -#include "BigInteger.hh" - -/* Some mathematical algorithms for big integers. - * This code is new and, as such, experimental. */ - -// Returns the greatest common divisor of a and b. -BigUnsigned gcd(BigUnsigned a, BigUnsigned b); - -/* Extended Euclidean algorithm. - * Given m and n, finds gcd g and numbers r, s such that r*m + s*n == g. */ -void extendedEuclidean(BigInteger m, BigInteger n, - BigInteger &g, BigInteger &r, BigInteger &s); - -/* Returns the multiplicative inverse of x modulo n, or throws an exception if - * they have a common factor. */ -BigUnsigned modinv(const BigInteger &x, const BigUnsigned &n); - -// Returns (base ^ exponent) % modulus. -BigUnsigned modexp(const BigInteger &base, const BigUnsigned &exponent, - const BigUnsigned &modulus); - -#endif |