| Index: third_party/bigint/BigInteger.hh
|
| diff --git a/third_party/bigint/BigInteger.hh b/third_party/bigint/BigInteger.hh
|
| index a239d3c954041e1b3cad000ded8ecbee417fd3e5..320a22f7b76ace832492f6548d9eb47dc482ddb7 100644
|
| --- a/third_party/bigint/BigInteger.hh
|
| +++ b/third_party/bigint/BigInteger.hh
|
| @@ -164,11 +164,7 @@ inline BigInteger BigInteger::operator *(const BigInteger &x) const {
|
| }
|
| inline BigInteger BigInteger::operator /(const BigInteger &x) const {
|
| if (x.isZero())
|
| -#ifdef FOXIT_CHROME_BUILD
|
| abort();
|
| -#else
|
| - throw "BigInteger::operator /: division by zero";
|
| -#endif
|
| BigInteger q, r;
|
| r = *this;
|
| r.divideWithRemainder(x, q);
|
| @@ -176,11 +172,7 @@ inline BigInteger BigInteger::operator /(const BigInteger &x) const {
|
| }
|
| inline BigInteger BigInteger::operator %(const BigInteger &x) const {
|
| if (x.isZero())
|
| -#ifdef FOXIT_CHROME_BUILD
|
| abort();
|
| -#else
|
| - throw "BigInteger::operator %: division by zero";
|
| -#endif
|
| BigInteger q, r;
|
| r = *this;
|
| r.divideWithRemainder(x, q);
|
| @@ -210,11 +202,7 @@ inline void BigInteger::operator *=(const BigInteger &x) {
|
| }
|
| inline void BigInteger::operator /=(const BigInteger &x) {
|
| if (x.isZero())
|
| -#ifdef FOXIT_CHROME_BUILD
|
| abort();
|
| -#else
|
| - throw "BigInteger::operator /=: division by zero";
|
| -#endif
|
| /* The following technique is slightly faster than copying *this first
|
| * when x is large. */
|
| BigInteger q;
|
| @@ -224,11 +212,7 @@ inline void BigInteger::operator /=(const BigInteger &x) {
|
| }
|
| inline void BigInteger::operator %=(const BigInteger &x) {
|
| if (x.isZero())
|
| -#ifdef FOXIT_CHROME_BUILD
|
| abort();
|
| -#else
|
| - throw "BigInteger::operator %=: division by zero";
|
| -#endif
|
| BigInteger q;
|
| // Mods *this by x. Don't care about quotient left in q.
|
| divideWithRemainder(x, q);
|
|
|