@p4ulcristian/iris-layout 0.2.0 → 0.2.2

package/dist/cljs-runtime/goog.math.integer.js

@@ -0,0 +1,445 @@
+import "./cljs_env.js";
+import "./goog.reflect.reflect.js";
+goog.provide("goog.math.Integer");
+goog.require("goog.reflect");
+goog.math.Integer = function(bits, sign) {
+  this.sign_ = sign;
+  var localBits = [];
+  var top = true;
+  var i = bits.length - 1;
+  for (; i >= 0; i--) {
+    var val = bits[i] | 0;
+    if (!top || val != sign) {
+      localBits[i] = val;
+      top = false;
+    }
+  }
+  this.bits_ = localBits;
+};
+goog.math.Integer.IntCache_ = {};
+goog.math.Integer.fromInt = function(value) {
+  if (-128 <= value && value < 128) {
+    return goog.reflect.cache(goog.math.Integer.IntCache_, value, function(val) {
+      return new goog.math.Integer([val | 0], val < 0 ? -1 : 0);
+    });
+  }
+  return new goog.math.Integer([value | 0], value < 0 ? -1 : 0);
+};
+goog.math.Integer.fromNumber = function(value) {
+  if (isNaN(value) || !isFinite(value)) {
+    return goog.math.Integer.ZERO;
+  } else if (value < 0) {
+    return goog.math.Integer.fromNumber(-value).negate();
+  } else {
+    var bits = [];
+    var pow = 1;
+    var i = 0;
+    for (; value >= pow; i++) {
+      bits[i] = value / pow | 0;
+      pow = pow * goog.math.Integer.TWO_PWR_32_DBL_;
+    }
+    return new goog.math.Integer(bits, 0);
+  }
+};
+goog.math.Integer.fromBits = function(bits) {
+  var high = bits[bits.length - 1];
+  return new goog.math.Integer(bits, high & 1 << 31 ? -1 : 0);
+};
+goog.math.Integer.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw new Error("number format error: empty string");
+  }
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw new Error("radix out of range: " + radix);
+  }
+  if (str.charAt(0) == "-") {
+    return goog.math.Integer.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf("-") >= 0) {
+    throw new Error('number format error: interior "-" character');
+  }
+  var radixToPower = goog.math.Integer.fromNumber(Math.pow(radix, 8));
+  var result = goog.math.Integer.ZERO;
+  var i = 0;
+  for (; i < str.length; i = i + 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = goog.math.Integer.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(goog.math.Integer.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(goog.math.Integer.fromNumber(value));
+    }
+  }
+  return result;
+};
+goog.math.Integer.TWO_PWR_32_DBL_ = (1 << 16) * (1 << 16);
+goog.math.Integer.ZERO = goog.math.Integer.fromInt(0);
+goog.math.Integer.ONE = goog.math.Integer.fromInt(1);
+goog.math.Integer.TWO_PWR_24_ = goog.math.Integer.fromInt(1 << 24);
+goog.math.Integer.prototype.toInt = function() {
+  return this.bits_.length > 0 ? this.bits_[0] : this.sign_;
+};
+goog.math.Integer.prototype.toNumber = function() {
+  if (this.isNegative()) {
+    return -this.negate().toNumber();
+  } else {
+    var val = 0;
+    var pow = 1;
+    var i = 0;
+    for (; i < this.bits_.length; i++) {
+      val = val + this.getBitsUnsigned(i) * pow;
+      pow = pow * goog.math.Integer.TWO_PWR_32_DBL_;
+    }
+    return val;
+  }
+};
+goog.math.Integer.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw new Error("radix out of range: " + radix);
+  }
+  if (this.isZero()) {
+    return "0";
+  } else if (this.isNegative()) {
+    return "-" + this.negate().toString(radix);
+  }
+  var radixToPower = goog.math.Integer.fromNumber(Math.pow(radix, 6));
+  var rem = this;
+  var result = "";
+  for (; true;) {
+    var remDiv = rem.divide(radixToPower);
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt() >>> 0;
+    var digits = intval.toString(radix);
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      for (; digits.length < 6;) {
+        digits = "0" + digits;
+      }
+      result = "" + digits + result;
+    }
+  }
+};
+goog.math.Integer.prototype.getBits = function(index) {
+  if (index < 0) {
+    return 0;
+  } else if (index < this.bits_.length) {
+    return this.bits_[index];
+  } else {
+    return this.sign_;
+  }
+};
+goog.math.Integer.prototype.getBitsUnsigned = function(index) {
+  var val = this.getBits(index);
+  return val >= 0 ? val : goog.math.Integer.TWO_PWR_32_DBL_ + val;
+};
+goog.math.Integer.prototype.getSign = function() {
+  return this.sign_;
+};
+goog.math.Integer.prototype.isZero = function() {
+  if (this.sign_ != 0) {
+    return false;
+  }
+  var i = 0;
+  for (; i < this.bits_.length; i++) {
+    if (this.bits_[i] != 0) {
+      return false;
+    }
+  }
+  return true;
+};
+goog.math.Integer.prototype.isNegative = function() {
+  return this.sign_ == -1;
+};
+goog.math.Integer.prototype.isOdd = function() {
+  return this.bits_.length == 0 && this.sign_ == -1 || this.bits_.length > 0 && (this.bits_[0] & 1) != 0;
+};
+goog.math.Integer.prototype.equals = function(other) {
+  if (this.sign_ != other.sign_) {
+    return false;
+  }
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var i = 0;
+  for (; i < len; i++) {
+    if (this.getBits(i) != other.getBits(i)) {
+      return false;
+    }
+  }
+  return true;
+};
+goog.math.Integer.prototype.notEquals = function(other) {
+  return !this.equals(other);
+};
+goog.math.Integer.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+goog.math.Integer.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+goog.math.Integer.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+goog.math.Integer.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+goog.math.Integer.prototype.compare = function(other) {
+  var diff = this.subtract(other);
+  if (diff.isNegative()) {
+    return -1;
+  } else if (diff.isZero()) {
+    return 0;
+  } else {
+    return +1;
+  }
+};
+goog.math.Integer.prototype.shorten = function(numBits) {
+  var arr_index = numBits - 1 >> 5;
+  var bit_index = (numBits - 1) % 32;
+  var bits = [];
+  var i = 0;
+  for (; i < arr_index; i++) {
+    bits[i] = this.getBits(i);
+  }
+  var sigBits = bit_index == 31 ? 4294967295 : (1 << bit_index + 1) - 1;
+  var val = this.getBits(arr_index) & sigBits;
+  if (val & 1 << bit_index) {
+    val = val | 4294967295 - sigBits;
+    bits[arr_index] = val;
+    return new goog.math.Integer(bits, -1);
+  } else {
+    bits[arr_index] = val;
+    return new goog.math.Integer(bits, 0);
+  }
+};
+goog.math.Integer.prototype.negate = function() {
+  return this.not().add(goog.math.Integer.ONE);
+};
+goog.math.Integer.prototype.abs = function() {
+  return this.isNegative() ? this.negate() : this;
+};
+goog.math.Integer.prototype.add = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  var carry = 0;
+  var i = 0;
+  for (; i <= len; i++) {
+    var a1 = this.getBits(i) >>> 16;
+    var a0 = this.getBits(i) & 65535;
+    var b1 = other.getBits(i) >>> 16;
+    var b0 = other.getBits(i) & 65535;
+    var c0 = carry + a0 + b0;
+    var c1 = (c0 >>> 16) + a1 + b1;
+    carry = c1 >>> 16;
+    c0 = c0 & 65535;
+    c1 = c1 & 65535;
+    arr[i] = c1 << 16 | c0;
+  }
+  return goog.math.Integer.fromBits(arr);
+};
+goog.math.Integer.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+goog.math.Integer.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return goog.math.Integer.ZERO;
+  } else if (other.isZero()) {
+    return goog.math.Integer.ZERO;
+  }
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+  if (this.lessThan(goog.math.Integer.TWO_PWR_24_) && other.lessThan(goog.math.Integer.TWO_PWR_24_)) {
+    return goog.math.Integer.fromNumber(this.toNumber() * other.toNumber());
+  }
+  var len = this.bits_.length + other.bits_.length;
+  var arr = [];
+  var i = 0;
+  for (; i < 2 * len; i++) {
+    arr[i] = 0;
+  }
+  i = 0;
+  for (; i < this.bits_.length; i++) {
+    var j = 0;
+    for (; j < other.bits_.length; j++) {
+      var a1 = this.getBits(i) >>> 16;
+      var a0 = this.getBits(i) & 65535;
+      var b1 = other.getBits(j) >>> 16;
+      var b0 = other.getBits(j) & 65535;
+      arr[2 * i + 2 * j] += a0 * b0;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j);
+      arr[2 * i + 2 * j + 1] += a1 * b0;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 1);
+      arr[2 * i + 2 * j + 1] += a0 * b1;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 1);
+      arr[2 * i + 2 * j + 2] += a1 * b1;
+      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 2);
+    }
+  }
+  i = 0;
+  for (; i < len; i++) {
+    arr[i] = arr[2 * i + 1] << 16 | arr[2 * i];
+  }
+  i = len;
+  for (; i < 2 * len; i++) {
+    arr[i] = 0;
+  }
+  return new goog.math.Integer(arr, 0);
+};
+goog.math.Integer.carry16_ = function(bits, index) {
+  for (; (bits[index] & 65535) != bits[index];) {
+    bits[index + 1] += bits[index] >>> 16;
+    bits[index] &= 65535;
+    index++;
+  }
+};
+goog.math.Integer.prototype.slowDivide_ = function(other) {
+  if (this.isNegative() || other.isNegative()) {
+    throw new Error("slowDivide_ only works with positive integers.");
+  }
+  var twoPower = goog.math.Integer.ONE;
+  var multiple = other;
+  for (; multiple.lessThanOrEqual(this);) {
+    twoPower = twoPower.shiftLeft(1);
+    multiple = multiple.shiftLeft(1);
+  }
+  var res = twoPower.shiftRight(1);
+  var total = multiple.shiftRight(1);
+  var total2;
+  multiple = multiple.shiftRight(2);
+  twoPower = twoPower.shiftRight(2);
+  for (; !multiple.isZero();) {
+    total2 = total.add(multiple);
+    if (total2.lessThanOrEqual(this)) {
+      res = res.add(twoPower);
+      total = total2;
+    }
+    multiple = multiple.shiftRight(1);
+    twoPower = twoPower.shiftRight(1);
+  }
+  var remainder = this.subtract(res.multiply(other));
+  return new goog.math.Integer.DivisionResult(res, remainder);
+};
+goog.math.Integer.prototype.divide = function(other) {
+  return this.divideAndRemainder(other).quotient;
+};
+goog.math.Integer.DivisionResult = function(quotient, remainder) {
+  this.quotient = quotient;
+  this.remainder = remainder;
+};
+goog.math.Integer.prototype.divideAndRemainder = function(other) {
+  if (other.isZero()) {
+    throw new Error("division by zero");
+  } else if (this.isZero()) {
+    return new goog.math.Integer.DivisionResult(goog.math.Integer.ZERO, goog.math.Integer.ZERO);
+  }
+  if (this.isNegative()) {
+    var result = this.negate().divideAndRemainder(other);
+    return new goog.math.Integer.DivisionResult(result.quotient.negate(), result.remainder.negate());
+  } else if (other.isNegative()) {
+    result = this.divideAndRemainder(other.negate());
+    return new goog.math.Integer.DivisionResult(result.quotient.negate(), result.remainder);
+  }
+  if (this.bits_.length > 30) {
+    return this.slowDivide_(other);
+  }
+  var res = goog.math.Integer.ZERO;
+  var rem = this;
+  for (; rem.greaterThanOrEqual(other);) {
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = log2 <= 48 ? 1 : Math.pow(2, log2 - 48);
+    var approxRes = goog.math.Integer.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    for (; approxRem.isNegative() || approxRem.greaterThan(rem);) {
+      approx = approx - delta;
+      approxRes = goog.math.Integer.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+    if (approxRes.isZero()) {
+      approxRes = goog.math.Integer.ONE;
+    }
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return new goog.math.Integer.DivisionResult(res, rem);
+};
+goog.math.Integer.prototype.modulo = function(other) {
+  return this.divideAndRemainder(other).remainder;
+};
+goog.math.Integer.prototype.not = function() {
+  var len = this.bits_.length;
+  var arr = [];
+  var i = 0;
+  for (; i < len; i++) {
+    arr[i] = ~this.bits_[i];
+  }
+  return new goog.math.Integer(arr, ~this.sign_);
+};
+goog.math.Integer.prototype.and = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  var i = 0;
+  for (; i < len; i++) {
+    arr[i] = this.getBits(i) & other.getBits(i);
+  }
+  return new goog.math.Integer(arr, this.sign_ & other.sign_);
+};
+goog.math.Integer.prototype.or = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  var i = 0;
+  for (; i < len; i++) {
+    arr[i] = this.getBits(i) | other.getBits(i);
+  }
+  return new goog.math.Integer(arr, this.sign_ | other.sign_);
+};
+goog.math.Integer.prototype.xor = function(other) {
+  var len = Math.max(this.bits_.length, other.bits_.length);
+  var arr = [];
+  var i = 0;
+  for (; i < len; i++) {
+    arr[i] = this.getBits(i) ^ other.getBits(i);
+  }
+  return new goog.math.Integer(arr, this.sign_ ^ other.sign_);
+};
+goog.math.Integer.prototype.shiftLeft = function(numBits) {
+  var arr_delta = numBits >> 5;
+  var bit_delta = numBits % 32;
+  var len = this.bits_.length + arr_delta + (bit_delta > 0 ? 1 : 0);
+  var arr = [];
+  var i = 0;
+  for (; i < len; i++) {
+    if (bit_delta > 0) {
+      arr[i] = this.getBits(i - arr_delta) << bit_delta | this.getBits(i - arr_delta - 1) >>> 32 - bit_delta;
+    } else {
+      arr[i] = this.getBits(i - arr_delta);
+    }
+  }
+  return new goog.math.Integer(arr, this.sign_);
+};
+goog.math.Integer.prototype.shiftRight = function(numBits) {
+  var arr_delta = numBits >> 5;
+  var bit_delta = numBits % 32;
+  var len = this.bits_.length - arr_delta;
+  var arr = [];
+  var i = 0;
+  for (; i < len; i++) {
+    if (bit_delta > 0) {
+      arr[i] = this.getBits(i + arr_delta) >>> bit_delta | this.getBits(i + arr_delta + 1) << 32 - bit_delta;
+    } else {
+      arr[i] = this.getBits(i + arr_delta);
+    }
+  }
+  return new goog.math.Integer(arr, this.sign_);
+};
+
+//# sourceMappingURL=goog.math.integer.js.map

package/dist/cljs-runtime/goog.math.integer.js.map

@@ -0,0 +1,9 @@
+{
+"version":3,
+"file":"goog.math.integer.js",
+"lineCount":442,
+"mappings":"AAcAA,IAAKC,CAAAA,OAAL,CAAa,mBAAb,CAAA;AAEAD,IAAKE,CAAAA,OAAL,CAAa,cAAb,CAAA;AAwBAF,IAAKG,CAAAA,IAAKC,CAAAA,OAAV,GAAoBC,QAAQ,CAACC,IAAD,EAAOC,IAAP,CAAa;AAMvC,MAAKC,CAAAA,KAAL,GAAaD,IAAb;AAKA,MAAIE,YAAY,EAAhB;AAIA,MAAIC,MAAM,IAAV;AAEK,MAAIC,IAAIL,IAAKM,CAAAA,MAATD,GAAkB,CAAtB;AAAL,OAAA,EAA8BA,CAA9B,IAAmC,CAAnC,EAAsCA,CAAA,EAAtC,CAA2C;AACzC,QAAIE,MAAMP,IAAA,CAAKK,CAAL,CAANE,GAAgB,CAApB;AACA,QAAI,CAACH,GAAL,IAAYG,GAAZ,IAAmBN,IAAnB,CAAyB;AACvBE,eAAA,CAAUE,CAAV,CAAA,GAAeE,GAAf;AACAH,SAAA,GAAM,KAAN;AAFuB;AAFgB;AAa3C,MAAKI,CAAAA,KAAL,GAAaL,SAAb;AA9BuC,CAAzC;AA2CAT,IAAKG,CAAAA,IAAKC,CAAAA,OAAQW,CAAAA,SAAlB,GAA8B,EAA9B;AAQAf,IAAKG,CAAAA,IAAKC,CAAAA,OAAQY,CAAAA,OAAlB,GAA4BC,QAAQ,CAACC,KAAD,CAAQ;AAE1C,MAAI,CAAC,GAAL,IAAYA,KAAZ,IAAqBA,KAArB,GAA6B,GAA7B;AACE,WAAOlB,IAAKmB,CAAAA,OAAQC,CAAAA,KAAb,CACHpB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQW,CAAAA,SADf,EAC0BG,KAD1B,EACiC,QAAQ,CAACL,GAAD,CAAM;AAEhD,aAAO,IAAIb,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsB,CAACS,GAAD,GAAO,CAAP,CAAtB,EAAiCA,GAAA,GAAM,CAAN,GAAU,CAAC,CAAX,GAAe,CAAhD,CAAP;AAFgD,KAD/C,CAAP;AADF;AAOA,SAAO,IAAIb,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsB,CAACc,KAAD,GAAS,CAAT,CAAtB,EAAmCA,KAAA,GAAQ,CAAR,GAAY,CAAC,CAAb,GAAiB,CAApD,CAAP;AAT0C,CAA5C;AAmBAlB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,GAA+BC,QAAQ,CAACJ,KAAD,CAAQ;AAE7C,MAAIK,KAAA,CAAML,KAAN,CAAJ,IAAoB,CAACM,QAAA,CAASN,KAAT,CAArB;AACE,WAAOlB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IAAzB;AADF,QAEO,KAAIP,KAAJ,GAAY,CAAZ;AACL,WAAOlB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6B,CAACH,KAA9B,CAAqCQ,CAAAA,MAArC,EAAP;AADK,QAEA;AACL,QAAIpB,OAAO,EAAX;AACA,QAAIqB,MAAM,CAAV;AACK,QAAIhB,IAAI,CAAR;AAAL,SAAA,EAAgBO,KAAhB,IAAyBS,GAAzB,EAA8BhB,CAAA,EAA9B,CAAmC;AACjCL,UAAA,CAAKK,CAAL,CAAA,GAAWO,KAAX,GAAmBS,GAAnB,GAA0B,CAA1B;AACAA,SAAA,GAAAA,GAAA,GAAO3B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQwB,CAAAA,eAAzB;AAFiC;AAInC,WAAO,IAAI5B,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBE,IAAtB,EAA4B,CAA5B,CAAP;AAPK;AANsC,CAA/C;AA2BAN,IAAKG,CAAAA,IAAKC,CAAAA,OAAQyB,CAAAA,QAAlB,GAA6BC,QAAQ,CAACxB,IAAD,CAAO;AAE1C,MAAIyB,OAAOzB,IAAA,CAAKA,IAAKM,CAAAA,MAAV,GAAmB,CAAnB,CAAX;AACA,SAAO,IAAIZ,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBE,IAAtB,EAA4ByB,IAAA,GAAQ,CAAR,IAAa,EAAb,GAAmB,CAAC,CAApB,GAAwB,CAApD,CAAP;AAH0C,CAA5C;AAcA/B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ4B,CAAAA,UAAlB,GAA+BC,QAAQ,CAACC,GAAD,EAAMC,SAAN,CAAiB;AAEtD,MAAID,GAAItB,CAAAA,MAAR,IAAkB,CAAlB;AACE,UAAM,IAAIwB,KAAJ,CAAU,mCAAV,CAAN;AADF;AAIA,MAAIC,QAAQF,SAARE,IAAqB,EAAzB;AACA,MAAIA,KAAJ,GAAY,CAAZ,IAAiB,EAAjB,GAAsBA,KAAtB;AACE,UAAM,IAAID,KAAJ,CAAU,sBAAV,GAAmCC,KAAnC,CAAN;AADF;AAIA,MAAIH,GAAII,CAAAA,MAAJ,CAAW,CAAX,CAAJ,IAAqB,GAArB;AACE,WAAOtC,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ4B,CAAAA,UAAlB,CAA6BE,GAAIK,CAAAA,SAAJ,CAAc,CAAd,CAA7B,EAA+CF,KAA/C,CAAsDX,CAAAA,MAAtD,EAAP;AADF,QAEO,KAAIQ,GAAIM,CAAAA,OAAJ,CAAY,GAAZ,CAAJ,IAAwB,CAAxB;AACL,UAAM,IAAIJ,KAAJ,CAAU,6CAAV,CAAN;AADK;AAMP,MAAIK,eAAezC,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BqB,IAAKf,CAAAA,GAAL,CAASU,KAAT,EAAgB,CAAhB,CAA7B,CAAnB;AAEA,MAAIM,SAAS3C,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IAA/B;AACK,MAAId,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBuB,GAAItB,CAAAA,MAAxB,EAAgCD,CAAhC,GAAgCA,CAAhC,GAAqC,CAArC,CAAwC;AACtC,QAAIiC,OAAOF,IAAKG,CAAAA,GAAL,CAAS,CAAT,EAAYX,GAAItB,CAAAA,MAAhB,GAAyBD,CAAzB,CAAX;AACA,QAAIO,QAAQ4B,QAAA,CAASZ,GAAIK,CAAAA,SAAJ,CAAc5B,CAAd,EAAiBA,CAAjB,GAAqBiC,IAArB,CAAT,EAAqCP,KAArC,CAAZ;AACA,QAAIO,IAAJ,GAAW,CAAX,CAAc;AACZ,UAAIG,QAAQ/C,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BqB,IAAKf,CAAAA,GAAL,CAASU,KAAT,EAAgBO,IAAhB,CAA7B,CAAZ;AACAD,YAAA,GAASA,MAAOK,CAAAA,QAAP,CAAgBD,KAAhB,CAAuBE,CAAAA,GAAvB,CAA2BjD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BH,KAA7B,CAA3B,CAAT;AAFY,KAAd,KAGO;AACLyB,YAAA,GAASA,MAAOK,CAAAA,QAAP,CAAgBP,YAAhB,CAAT;AACAE,YAAA,GAASA,MAAOM,CAAAA,GAAP,CAAWjD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BH,KAA7B,CAAX,CAAT;AAFK;AAN+B;AAWxC,SAAOyB,MAAP;AAjCsD,CAAxD;AA2CA3C,IAAKG,CAAAA,IAAKC,CAAAA,OAAQwB,CAAAA,eAAlB,IAAqC,CAArC,IAA0C,EAA1C,KAAiD,CAAjD,IAAsD,EAAtD;AAIA5B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IAAlB,GAAyBzB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQY,CAAAA,OAAlB,CAA0B,CAA1B,CAAzB;AAGAhB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8C,CAAAA,GAAlB,GAAwBlD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQY,CAAAA,OAAlB,CAA0B,CAA1B,CAAxB;AAQAhB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ+C,CAAAA,WAAlB,GAAgCnD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQY,CAAAA,OAAlB,CAA0B,CAA1B,IAA+B,EAA/B,CAAhC;AAMAhB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUC,CAAAA,KAA5B,GAAoCC,QAAQ,EAAG;AAE7C,SAAO,IAAKxC,CAAAA,KAAMF,CAAAA,MAAX,GAAoB,CAApB,GAAwB,IAAKE,CAAAA,KAAL,CAAW,CAAX,CAAxB,GAAwC,IAAKN,CAAAA,KAApD;AAF6C,CAA/C;AAOAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUG,CAAAA,QAA5B,GAAuCC,QAAQ,EAAG;AAEhD,MAAI,IAAKC,CAAAA,UAAL,EAAJ;AACE,WAAO,CAAC,IAAK/B,CAAAA,MAAL,EAAc6B,CAAAA,QAAd,EAAR;AADF,QAEO;AACL,QAAI1C,MAAM,CAAV;AACA,QAAIc,MAAM,CAAV;AACK,QAAIhB,IAAI,CAAR;AAAL,SAAA,EAAgBA,CAAhB,GAAoB,IAAKG,CAAAA,KAAMF,CAAAA,MAA/B,EAAuCD,CAAA,EAAvC,CAA4C;AAC1CE,SAAA,GAAAA,GAAA,GAAO,IAAK6C,CAAAA,eAAL,CAAqB/C,CAArB,CAAP,GAAiCgB,GAAjC;AACAA,SAAA,GAAAA,GAAA,GAAO3B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQwB,CAAAA,eAAzB;AAF0C;AAI5C,WAAOf,GAAP;AAPK;AAJyC,CAAlD;AAqBAb,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUO,CAAAA,QAA5B,GAAuCC,QAAQ,CAACzB,SAAD,CAAY;AAEzD,MAAIE,QAAQF,SAARE,IAAqB,EAAzB;AACA,MAAIA,KAAJ,GAAY,CAAZ,IAAiB,EAAjB,GAAsBA,KAAtB;AACE,UAAM,IAAID,KAAJ,CAAU,sBAAV,GAAmCC,KAAnC,CAAN;AADF;AAIA,MAAI,IAAKwB,CAAAA,MAAL,EAAJ;AACE,WAAO,GAAP;AADF,QAEO,KAAI,IAAKJ,CAAAA,UAAL,EAAJ;AACL,WAAO,GAAP,GAAa,IAAK/B,CAAAA,MAAL,EAAciC,CAAAA,QAAd,CAAuBtB,KAAvB,CAAb;AADK;AAMP,MAAII,eAAezC,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BqB,IAAKf,CAAAA,GAAL,CAASU,KAAT,EAAgB,CAAhB,CAA7B,CAAnB;AAEA,MAAIyB,MAAM,IAAV;AACA,MAAInB,SAAS,EAAb;AACA,OAAA,EAAO,IAAP,CAAA,CAAa;AACX,QAAIoB,SAASD,GAAIE,CAAAA,MAAJ,CAAWvB,YAAX,CAAb;AAIA,QAAIwB,SAASH,GAAII,CAAAA,QAAJ,CAAaH,MAAOf,CAAAA,QAAP,CAAgBP,YAAhB,CAAb,CAA4CY,CAAAA,KAA5C,EAATY,KAAiE,CAArE;AACA,QAAIE,SAASF,MAAON,CAAAA,QAAP,CAAgBtB,KAAhB,CAAb;AAEAyB,OAAA,GAAMC,MAAN;AACA,QAAID,GAAID,CAAAA,MAAJ,EAAJ;AACE,aAAOM,MAAP,GAAgBxB,MAAhB;AADF,UAEO;AACL,WAAA,EAAOwB,MAAOvD,CAAAA,MAAd,GAAuB,CAAvB,CAAA;AACEuD,cAAA,GAAS,GAAT,GAAeA,MAAf;AADF;AAGAxB,YAAA,GAAS,EAAT,GAAcwB,MAAd,GAAuBxB,MAAvB;AAJK;AAXI;AAnB4C,CAA3D;AA8CA3C,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUgB,CAAAA,OAA5B,GAAsCC,QAAQ,CAACC,KAAD,CAAQ;AAEpD,MAAIA,KAAJ,GAAY,CAAZ;AACE,WAAO,CAAP;AADF,QAEO,KAAIA,KAAJ,GAAY,IAAKxD,CAAAA,KAAMF,CAAAA,MAAvB;AACL,WAAO,IAAKE,CAAAA,KAAL,CAAWwD,KAAX,CAAP;AADK;AAGL,WAAO,IAAK9D,CAAAA,KAAZ;AAHK;AAJ6C,CAAtD;AAiBAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUM,CAAAA,eAA5B,GAA8Ca,QAAQ,CAACD,KAAD,CAAQ;AAE5D,MAAIzD,MAAM,IAAKuD,CAAAA,OAAL,CAAaE,KAAb,CAAV;AACA,SAAOzD,GAAA,IAAO,CAAP,GAAWA,GAAX,GAAiBb,IAAKG,CAAAA,IAAKC,CAAAA,OAAQwB,CAAAA,eAAnC,GAAqDf,GAA5D;AAH4D,CAA9D;AAQAb,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUoB,CAAAA,OAA5B,GAAsCC,QAAQ,EAAG;AAE/C,SAAO,IAAKjE,CAAAA,KAAZ;AAF+C,CAAjD;AAOAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUS,CAAAA,MAA5B,GAAqCa,QAAQ,EAAG;AAE9C,MAAI,IAAKlE,CAAAA,KAAT,IAAkB,CAAlB;AACE,WAAO,KAAP;AADF;AAGK,MAAIG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoB,IAAKG,CAAAA,KAAMF,CAAAA,MAA/B,EAAuCD,CAAA,EAAvC;AACE,QAAI,IAAKG,CAAAA,KAAL,CAAWH,CAAX,CAAJ,IAAqB,CAArB;AACE,aAAO,KAAP;AADF;AADF;AAKA,SAAO,IAAP;AAV8C,CAAhD;AAeAX,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUK,CAAAA,UAA5B,GAAyCkB,QAAQ,EAAG;AAElD,SAAO,IAAKnE,CAAAA,KAAZ,IAAqB,CAAC,CAAtB;AAFkD,CAApD;AAOAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUwB,CAAAA,KAA5B,GAAoCC,QAAQ,EAAG;AAE7C,SAAQ,IAAK/D,CAAAA,KAAMF,CAAAA,MAAnB,IAA6B,CAA7B,IAAoC,IAAKJ,CAAAA,KAAzC,IAAkD,CAAC,CAAnD,IACK,IAAKM,CAAAA,KAAMF,CAAAA,MADhB,GACyB,CADzB,KACiC,IAAKE,CAAAA,KAAL,CAAW,CAAX,CADjC,GACiD,CADjD,KACuD,CADvD;AAF6C,CAA/C;AAWAd,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAU0B,CAAAA,MAA5B,GAAqCC,QAAQ,CAACC,KAAD,CAAQ;AAEnD,MAAI,IAAKxE,CAAAA,KAAT,IAAkBwE,KAAMxE,CAAAA,KAAxB;AACE,WAAO,KAAP;AADF;AAGA,MAAIyE,MAAMvC,IAAKwC,CAAAA,GAAL,CAAS,IAAKpE,CAAAA,KAAMF,CAAAA,MAApB,EAA4BoE,KAAMlE,CAAAA,KAAMF,CAAAA,MAAxC,CAAV;AACK,MAAID,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACE,QAAI,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,CAAJ,IAAuBqE,KAAMZ,CAAAA,OAAN,CAAczD,CAAd,CAAvB;AACE,aAAO,KAAP;AADF;AADF;AAKA,SAAO,IAAP;AAXmD,CAArD;AAmBAX,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAU+B,CAAAA,SAA5B,GAAwCC,QAAQ,CAACJ,KAAD,CAAQ;AAEtD,SAAO,CAAC,IAAKF,CAAAA,MAAL,CAAYE,KAAZ,CAAR;AAFsD,CAAxD;AAUAhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUiC,CAAAA,WAA5B,GAA0CC,QAAQ,CAACN,KAAD,CAAQ;AAExD,SAAO,IAAKO,CAAAA,OAAL,CAAaP,KAAb,CAAP,GAA6B,CAA7B;AAFwD,CAA1D;AAUAhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUoC,CAAAA,kBAA5B,GAAiDC,QAAQ,CAACT,KAAD,CAAQ;AAE/D,SAAO,IAAKO,CAAAA,OAAL,CAAaP,KAAb,CAAP,IAA8B,CAA9B;AAF+D,CAAjE;AAUAhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUsC,CAAAA,QAA5B,GAAuCC,QAAQ,CAACX,KAAD,CAAQ;AAErD,SAAO,IAAKO,CAAAA,OAAL,CAAaP,KAAb,CAAP,GAA6B,CAA7B;AAFqD,CAAvD;AAUAhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUwC,CAAAA,eAA5B,GAA8CC,QAAQ,CAACb,KAAD,CAAQ;AAE5D,SAAO,IAAKO,CAAAA,OAAL,CAAaP,KAAb,CAAP,IAA8B,CAA9B;AAF4D,CAA9D;AAYAhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUmC,CAAAA,OAA5B,GAAsCO,QAAQ,CAACd,KAAD,CAAQ;AAEpD,MAAIe,OAAO,IAAK7B,CAAAA,QAAL,CAAcc,KAAd,CAAX;AACA,MAAIe,IAAKtC,CAAAA,UAAL,EAAJ;AACE,WAAO,CAAC,CAAR;AADF,QAEO,KAAIsC,IAAKlC,CAAAA,MAAL,EAAJ;AACL,WAAO,CAAP;AADK;AAGL,WAAO,CAAC,CAAR;AAHK;AAL6C,CAAtD;AAmBA7D,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAU4C,CAAAA,OAA5B,GAAsCC,QAAQ,CAACC,OAAD,CAAU;AAEtD,MAAIC,YAAaD,OAAbC,GAAuB,CAAvBA,IAA6B,CAAjC;AACA,MAAIC,aAAaF,OAAbE,GAAuB,CAAvBA,IAA4B,EAAhC;AACA,MAAI9F,OAAO,EAAX;AACK,MAAIK,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBwF,SAApB,EAA+BxF,CAAA,EAA/B;AACEL,QAAA,CAAKK,CAAL,CAAA,GAAU,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,CAAV;AADF;AAGA,MAAI0F,UAAUD,SAAA,IAAa,EAAb,GAAkB,UAAlB,IAAgC,CAAhC,IAAsCA,SAAtC,GAAkD,CAAlD,IAAwD,CAAtE;AACA,MAAIvF,MAAM,IAAKuD,CAAAA,OAAL,CAAa+B,SAAb,CAANtF,GAAgCwF,OAApC;AACA,MAAIxF,GAAJ,GAAW,CAAX,IAAgBuF,SAAhB,CAA4B;AAC1BvF,OAAA,GAAAA,GAAA,GAAO,UAAP,GAAoBwF,OAApB;AACA/F,QAAA,CAAK6F,SAAL,CAAA,GAAkBtF,GAAlB;AACA,WAAO,IAAIb,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBE,IAAtB,EAA4B,CAAC,CAA7B,CAAP;AAH0B,GAA5B,KAIO;AACLA,QAAA,CAAK6F,SAAL,CAAA,GAAkBtF,GAAlB;AACA,WAAO,IAAIb,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBE,IAAtB,EAA4B,CAA5B,CAAP;AAFK;AAd+C,CAAxD;AAsBAN,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAU1B,CAAAA,MAA5B,GAAqC4E,QAAQ,EAAG;AAE9C,SAAO,IAAKC,CAAAA,GAAL,EAAWtD,CAAAA,GAAX,CAAejD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8C,CAAAA,GAAjC,CAAP;AAF8C,CAAhD;AAOAlD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUoD,CAAAA,GAA5B,GAAkCC,QAAQ,EAAG;AAE3C,SAAO,IAAKhD,CAAAA,UAAL,EAAA,GAAoB,IAAK/B,CAAAA,MAAL,EAApB,GAAoC,IAA3C;AAF2C,CAA7C;AAWA1B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUH,CAAAA,GAA5B,GAAkCyD,QAAQ,CAAC1B,KAAD,CAAQ;AAEhD,MAAIC,MAAMvC,IAAKwC,CAAAA,GAAL,CAAS,IAAKpE,CAAAA,KAAMF,CAAAA,MAApB,EAA4BoE,KAAMlE,CAAAA,KAAMF,CAAAA,MAAxC,CAAV;AACA,MAAI+F,MAAM,EAAV;AACA,MAAIC,QAAQ,CAAZ;AAEK,MAAIjG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,IAAqBsE,GAArB,EAA0BtE,CAAA,EAA1B,CAA+B;AAC7B,QAAIkG,KAAK,IAAKzC,CAAAA,OAAL,CAAazD,CAAb,CAALkG,KAAyB,EAA7B;AACA,QAAIC,KAAK,IAAK1C,CAAAA,OAAL,CAAazD,CAAb,CAALmG,GAAuB,KAA3B;AAEA,QAAIC,KAAK/B,KAAMZ,CAAAA,OAAN,CAAczD,CAAd,CAALoG,KAA0B,EAA9B;AACA,QAAIC,KAAKhC,KAAMZ,CAAAA,OAAN,CAAczD,CAAd,CAALqG,GAAwB,KAA5B;AAEA,QAAIC,KAAKL,KAALK,GAAaH,EAAbG,GAAkBD,EAAtB;AACA,QAAIE,MAAMD,EAANC,KAAa,EAAbA,IAAmBL,EAAnBK,GAAwBH,EAA5B;AACAH,SAAA,GAAQM,EAAR,KAAe,EAAf;AACAD,MAAA,GAAAA,EAAA,GAAM,KAAN;AACAC,MAAA,GAAAA,EAAA,GAAM,KAAN;AACAP,OAAA,CAAIhG,CAAJ,CAAA,GAAUuG,EAAV,IAAgB,EAAhB,GAAsBD,EAAtB;AAZ6B;AAc/B,SAAOjH,IAAKG,CAAAA,IAAKC,CAAAA,OAAQyB,CAAAA,QAAlB,CAA2B8E,GAA3B,CAAP;AApBgD,CAAlD;AA6BA3G,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUc,CAAAA,QAA5B,GAAuCiD,QAAQ,CAACnC,KAAD,CAAQ;AAErD,SAAO,IAAK/B,CAAAA,GAAL,CAAS+B,KAAMtD,CAAAA,MAAN,EAAT,CAAP;AAFqD,CAAvD;AAWA1B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUJ,CAAAA,QAA5B,GAAuCoE,QAAQ,CAACpC,KAAD,CAAQ;AAErD,MAAI,IAAKnB,CAAAA,MAAL,EAAJ;AACE,WAAO7D,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IAAzB;AADF,QAEO,KAAIuD,KAAMnB,CAAAA,MAAN,EAAJ;AACL,WAAO7D,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IAAzB;AADK;AAIP,MAAI,IAAKgC,CAAAA,UAAL,EAAJ;AACE,QAAIuB,KAAMvB,CAAAA,UAAN,EAAJ;AACE,aAAO,IAAK/B,CAAAA,MAAL,EAAcsB,CAAAA,QAAd,CAAuBgC,KAAMtD,CAAAA,MAAN,EAAvB,CAAP;AADF;AAGE,aAAO,IAAKA,CAAAA,MAAL,EAAcsB,CAAAA,QAAd,CAAuBgC,KAAvB,CAA8BtD,CAAAA,MAA9B,EAAP;AAHF;AADF,QAMO,KAAIsD,KAAMvB,CAAAA,UAAN,EAAJ;AACL,WAAO,IAAKT,CAAAA,QAAL,CAAcgC,KAAMtD,CAAAA,MAAN,EAAd,CAA8BA,CAAAA,MAA9B,EAAP;AADK;AAKP,MAAI,IAAKgE,CAAAA,QAAL,CAAc1F,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ+C,CAAAA,WAAhC,CAAJ,IACI6B,KAAMU,CAAAA,QAAN,CAAe1F,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ+C,CAAAA,WAAjC,CADJ;AAEE,WAAOnD,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6B,IAAKkC,CAAAA,QAAL,EAA7B,GAA+CyB,KAAMzB,CAAAA,QAAN,EAA/C,CAAP;AAFF;AAMA,MAAI0B,MAAM,IAAKnE,CAAAA,KAAMF,CAAAA,MAAjBqE,GAA0BD,KAAMlE,CAAAA,KAAMF,CAAAA,MAA1C;AACA,MAAI+F,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoB,CAApB,GAAwBsE,GAAxB,EAA6BtE,CAAA,EAA7B;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAS,CAAT;AADF;AAGSA,GAAJ,GAAQ,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoB,IAAKG,CAAAA,KAAMF,CAAAA,MAA/B,EAAuCD,CAAA,EAAvC,CAA4C;AACrC,QAAI0G,IAAI,CAAR;AAAL,SAAA,EAAgBA,CAAhB,GAAoBrC,KAAMlE,CAAAA,KAAMF,CAAAA,MAAhC,EAAwCyG,CAAA,EAAxC,CAA6C;AAC3C,UAAIR,KAAK,IAAKzC,CAAAA,OAAL,CAAazD,CAAb,CAALkG,KAAyB,EAA7B;AACA,UAAIC,KAAK,IAAK1C,CAAAA,OAAL,CAAazD,CAAb,CAALmG,GAAuB,KAA3B;AAEA,UAAIC,KAAK/B,KAAMZ,CAAAA,OAAN,CAAciD,CAAd,CAALN,KAA0B,EAA9B;AACA,UAAIC,KAAKhC,KAAMZ,CAAAA,OAAN,CAAciD,CAAd,CAALL,GAAwB,KAA5B;AAEAL,SAAA,CAAI,CAAJ,GAAQhG,CAAR,GAAY,CAAZ,GAAgB0G,CAAhB,CAAA,IAAsBP,EAAtB,GAA2BE,EAA3B;AACAhH,UAAKG,CAAAA,IAAKC,CAAAA,OAAQkH,CAAAA,QAAlB,CAA2BX,GAA3B,EAAgC,CAAhC,GAAoChG,CAApC,GAAwC,CAAxC,GAA4C0G,CAA5C,CAAA;AACAV,SAAA,CAAI,CAAJ,GAAQhG,CAAR,GAAY,CAAZ,GAAgB0G,CAAhB,GAAoB,CAApB,CAAA,IAA0BR,EAA1B,GAA+BG,EAA/B;AACAhH,UAAKG,CAAAA,IAAKC,CAAAA,OAAQkH,CAAAA,QAAlB,CAA2BX,GAA3B,EAAgC,CAAhC,GAAoChG,CAApC,GAAwC,CAAxC,GAA4C0G,CAA5C,GAAgD,CAAhD,CAAA;AACAV,SAAA,CAAI,CAAJ,GAAQhG,CAAR,GAAY,CAAZ,GAAgB0G,CAAhB,GAAoB,CAApB,CAAA,IAA0BP,EAA1B,GAA+BC,EAA/B;AACA/G,UAAKG,CAAAA,IAAKC,CAAAA,OAAQkH,CAAAA,QAAlB,CAA2BX,GAA3B,EAAgC,CAAhC,GAAoChG,CAApC,GAAwC,CAAxC,GAA4C0G,CAA5C,GAAgD,CAAhD,CAAA;AACAV,SAAA,CAAI,CAAJ,GAAQhG,CAAR,GAAY,CAAZ,GAAgB0G,CAAhB,GAAoB,CAApB,CAAA,IAA0BR,EAA1B,GAA+BE,EAA/B;AACA/G,UAAKG,CAAAA,IAAKC,CAAAA,OAAQkH,CAAAA,QAAlB,CAA2BX,GAA3B,EAAgC,CAAhC,GAAoChG,CAApC,GAAwC,CAAxC,GAA4C0G,CAA5C,GAAgD,CAAhD,CAAA;AAd2C;AADH;AAoBnC1G,GAAJ,GAAQ,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAUgG,GAAA,CAAI,CAAJ,GAAQhG,CAAR,GAAY,CAAZ,CAAV,IAA4B,EAA5B,GAAkCgG,GAAA,CAAI,CAAJ,GAAQhG,CAAR,CAAlC;AADF;AAGSA,GAAJ,GAAQsE,GAAR;AAAL,OAAA,EAAkBtE,CAAlB,GAAsB,CAAtB,GAA0BsE,GAA1B,EAA+BtE,CAAA,EAA/B;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAS,CAAT;AADF;AAGA,SAAO,IAAIX,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,CAA3B,CAAP;AAxDqD,CAAvD;AAkEA3G,IAAKG,CAAAA,IAAKC,CAAAA,OAAQkH,CAAAA,QAAlB,GAA6BC,QAAQ,CAACjH,IAAD,EAAOgE,KAAP,CAAc;AAEjD,OAAA,GAAQhE,IAAA,CAAKgE,KAAL,CAAR,GAAsB,KAAtB,KAAiChE,IAAA,CAAKgE,KAAL,CAAjC,CAAA,CAA8C;AAC5ChE,QAAA,CAAKgE,KAAL,GAAa,CAAb,CAAA,IAAmBhE,IAAA,CAAKgE,KAAL,CAAnB,KAAmC,EAAnC;AACAhE,QAAA,CAAKgE,KAAL,CAAA,IAAe,KAAf;AACAA,SAAA,EAAA;AAH4C;AAFG,CAAnD;AA0BAtE,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUoE,CAAAA,WAA5B,GAA0CC,QAAQ,CAACzC,KAAD,CAAQ;AAExD,MAAI,IAAKvB,CAAAA,UAAL,EAAJ,IAAyBuB,KAAMvB,CAAAA,UAAN,EAAzB;AACE,UAAM,IAAIrB,KAAJ,CAAU,gDAAV,CAAN;AADF;AAIA,MAAIsF,WAAW1H,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8C,CAAAA,GAAjC;AACA,MAAIyE,WAAW3C,KAAf;AAKA,OAAA,EAAO2C,QAAS/B,CAAAA,eAAT,CAAyB,IAAzB,CAAP,CAAA,CAAuC;AACrC8B,YAAA,GAAWA,QAASE,CAAAA,SAAT,CAAmB,CAAnB,CAAX;AACAD,YAAA,GAAWA,QAASC,CAAAA,SAAT,CAAmB,CAAnB,CAAX;AAFqC;AAOvC,MAAIC,MAAMH,QAASI,CAAAA,UAAT,CAAoB,CAApB,CAAV;AACA,MAAIC,QAAQJ,QAASG,CAAAA,UAAT,CAAoB,CAApB,CAAZ;AAIA,MAAIE,MAAJ;AACAL,UAAA,GAAWA,QAASG,CAAAA,UAAT,CAAoB,CAApB,CAAX;AACAJ,UAAA,GAAWA,QAASI,CAAAA,UAAT,CAAoB,CAApB,CAAX;AACA,OAAA,EAAO,CAACH,QAAS9D,CAAAA,MAAT,EAAR,CAAA,CAA2B;AAIzBmE,UAAA,GAASD,KAAM9E,CAAAA,GAAN,CAAU0E,QAAV,CAAT;AACA,QAAIK,MAAOpC,CAAAA,eAAP,CAAuB,IAAvB,CAAJ,CAAkC;AAChCiC,SAAA,GAAMA,GAAI5E,CAAAA,GAAJ,CAAQyE,QAAR,CAAN;AACAK,WAAA,GAAQC,MAAR;AAFgC;AAIlCL,YAAA,GAAWA,QAASG,CAAAA,UAAT,CAAoB,CAApB,CAAX;AACAJ,YAAA,GAAWA,QAASI,CAAAA,UAAT,CAAoB,CAApB,CAAX;AAVyB;AAiB3B,MAAIG,YAAY,IAAK/D,CAAAA,QAAL,CAAc2D,GAAI7E,CAAAA,QAAJ,CAAagC,KAAb,CAAd,CAAhB;AACA,SAAO,IAAIhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8H,CAAAA,cAAtB,CAAqCL,GAArC,EAA0CI,SAA1C,CAAP;AA7CwD,CAA1D;AAsDAjI,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUY,CAAAA,MAA5B,GAAqCmE,QAAQ,CAACnD,KAAD,CAAQ;AAEnD,SAAO,IAAKoD,CAAAA,kBAAL,CAAwBpD,KAAxB,CAA+BqD,CAAAA,QAAtC;AAFmD,CAArD;AAgBArI,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8H,CAAAA,cAAlB,GAAmCI,QAAQ,CAACD,QAAD,EAAWJ,SAAX,CAAsB;AAG/D,MAAKI,CAAAA,QAAL,GAAgBA,QAAhB;AAGA,MAAKJ,CAAAA,SAAL,GAAiBA,SAAjB;AAN+D,CAAjE;AAiBAjI,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUgF,CAAAA,kBAA5B,GAAiDG,QAAQ,CAACvD,KAAD,CAAQ;AAE/D,MAAIA,KAAMnB,CAAAA,MAAN,EAAJ;AACE,UAAM,IAAIzB,KAAJ,CAAU,kBAAV,CAAN;AADF,QAEO,KAAI,IAAKyB,CAAAA,MAAL,EAAJ;AACL,WAAO,IAAI7D,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8H,CAAAA,cAAtB,CACHlI,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IADf,EACqBzB,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IADvC,CAAP;AADK;AAKP,MAAI,IAAKgC,CAAAA,UAAL,EAAJ,CAAuB;AAErB,QAAId,SAAS,IAAKjB,CAAAA,MAAL,EAAc0G,CAAAA,kBAAd,CAAiCpD,KAAjC,CAAb;AACA,WAAO,IAAIhF,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8H,CAAAA,cAAtB,CAEHvF,MAAO0F,CAAAA,QAAS3G,CAAAA,MAAhB,EAFG,EAIHiB,MAAOsF,CAAAA,SAAUvG,CAAAA,MAAjB,EAJG,CAAP;AAHqB,GAAvB,KAQO,KAAIsD,KAAMvB,CAAAA,UAAN,EAAJ,CAAwB;AAEzBd,UAAJ,GAAa,IAAKyF,CAAAA,kBAAL,CAAwBpD,KAAMtD,CAAAA,MAAN,EAAxB,CAAb;AACA,WAAO,IAAI1B,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8H,CAAAA,cAAtB,CAEHvF,MAAO0F,CAAAA,QAAS3G,CAAAA,MAAhB,EAFG,EAIHiB,MAAOsF,CAAAA,SAJJ,CAAP;AAH6B;AAa/B,MAAI,IAAKnH,CAAAA,KAAMF,CAAAA,MAAf,GAAwB,EAAxB;AACE,WAAO,IAAK4G,CAAAA,WAAL,CAAiBxC,KAAjB,CAAP;AADF;AASA,MAAI6C,MAAM7H,IAAKG,CAAAA,IAAKC,CAAAA,OAAQqB,CAAAA,IAA5B;AACA,MAAIqC,MAAM,IAAV;AACA,OAAA,EAAOA,GAAI0B,CAAAA,kBAAJ,CAAuBR,KAAvB,CAAP,CAAA,CAAsC;AAGpC,QAAIwD,SAAS9F,IAAKwC,CAAAA,GAAL,CAAS,CAAT,EAAYxC,IAAK+F,CAAAA,KAAL,CAAW3E,GAAIP,CAAAA,QAAJ,EAAX,GAA4ByB,KAAMzB,CAAAA,QAAN,EAA5B,CAAZ,CAAb;AAIA,QAAImF,OAAOhG,IAAKiG,CAAAA,IAAL,CAAUjG,IAAKkG,CAAAA,GAAL,CAASJ,MAAT,CAAV,GAA6B9F,IAAKmG,CAAAA,GAAlC,CAAX;AACA,QAAIC,QAASJ,IAAD,IAAS,EAAT,GAAe,CAAf,GAAmBhG,IAAKf,CAAAA,GAAL,CAAS,CAAT,EAAY+G,IAAZ,GAAmB,EAAnB,CAA/B;AAIA,QAAIK,YAAY/I,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BmH,MAA7B,CAAhB;AACA,QAAIQ,YAAYD,SAAU/F,CAAAA,QAAV,CAAmBgC,KAAnB,CAAhB;AACA,SAAA,EAAOgE,SAAUvF,CAAAA,UAAV,EAAP,IAAiCuF,SAAU3D,CAAAA,WAAV,CAAsBvB,GAAtB,CAAjC,CAAA,CAA6D;AAC3D0E,YAAA,GAAAA,MAAA,GAAUM,KAAV;AACAC,eAAA,GAAY/I,IAAKG,CAAAA,IAAKC,CAAAA,OAAQiB,CAAAA,UAAlB,CAA6BmH,MAA7B,CAAZ;AACAQ,eAAA,GAAYD,SAAU/F,CAAAA,QAAV,CAAmBgC,KAAnB,CAAZ;AAH2D;AAQ7D,QAAI+D,SAAUlF,CAAAA,MAAV,EAAJ;AACEkF,eAAA,GAAY/I,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8C,CAAAA,GAA9B;AADF;AAIA2E,OAAA,GAAMA,GAAI5E,CAAAA,GAAJ,CAAQ8F,SAAR,CAAN;AACAjF,OAAA,GAAMA,GAAII,CAAAA,QAAJ,CAAa8E,SAAb,CAAN;AA3BoC;AA6BtC,SAAO,IAAIhJ,IAAKG,CAAAA,IAAKC,CAAAA,OAAQ8H,CAAAA,cAAtB,CAAqCL,GAArC,EAA0C/D,GAA1C,CAAP;AAtE+D,CAAjE;AA+EA9D,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAU6F,CAAAA,MAA5B,GAAqCC,QAAQ,CAAClE,KAAD,CAAQ;AAEnD,SAAO,IAAKoD,CAAAA,kBAAL,CAAwBpD,KAAxB,CAA+BiD,CAAAA,SAAtC;AAFmD,CAArD;AAOAjI,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUmD,CAAAA,GAA5B,GAAkC4C,QAAQ,EAAG;AAE3C,MAAIlE,MAAM,IAAKnE,CAAAA,KAAMF,CAAAA,MAArB;AACA,MAAI+F,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAS,CAAC,IAAKG,CAAAA,KAAL,CAAWH,CAAX,CAAV;AADF;AAGA,SAAO,IAAIX,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,CAAC,IAAKnG,CAAAA,KAAjC,CAAP;AAP2C,CAA7C;AAgBAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUgG,CAAAA,GAA5B,GAAkCC,QAAQ,CAACrE,KAAD,CAAQ;AAEhD,MAAIC,MAAMvC,IAAKwC,CAAAA,GAAL,CAAS,IAAKpE,CAAAA,KAAMF,CAAAA,MAApB,EAA4BoE,KAAMlE,CAAAA,KAAMF,CAAAA,MAAxC,CAAV;AACA,MAAI+F,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAS,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,CAAT,GAA2BqE,KAAMZ,CAAAA,OAAN,CAAczD,CAAd,CAA3B;AADF;AAGA,SAAO,IAAIX,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,IAAKnG,CAAAA,KAAhC,GAAwCwE,KAAMxE,CAAAA,KAA9C,CAAP;AAPgD,CAAlD;AAgBAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUkG,CAAAA,EAA5B,GAAiCC,QAAQ,CAACvE,KAAD,CAAQ;AAE/C,MAAIC,MAAMvC,IAAKwC,CAAAA,GAAL,CAAS,IAAKpE,CAAAA,KAAMF,CAAAA,MAApB,EAA4BoE,KAAMlE,CAAAA,KAAMF,CAAAA,MAAxC,CAAV;AACA,MAAI+F,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAS,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,CAAT,GAA2BqE,KAAMZ,CAAAA,OAAN,CAAczD,CAAd,CAA3B;AADF;AAGA,SAAO,IAAIX,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,IAAKnG,CAAAA,KAAhC,GAAwCwE,KAAMxE,CAAAA,KAA9C,CAAP;AAP+C,CAAjD;AAgBAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUoG,CAAAA,GAA5B,GAAkCC,QAAQ,CAACzE,KAAD,CAAQ;AAEhD,MAAIC,MAAMvC,IAAKwC,CAAAA,GAAL,CAAS,IAAKpE,CAAAA,KAAMF,CAAAA,MAApB,EAA4BoE,KAAMlE,CAAAA,KAAMF,CAAAA,MAAxC,CAAV;AACA,MAAI+F,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACEgG,OAAA,CAAIhG,CAAJ,CAAA,GAAS,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,CAAT,GAA2BqE,KAAMZ,CAAAA,OAAN,CAAczD,CAAd,CAA3B;AADF;AAGA,SAAO,IAAIX,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,IAAKnG,CAAAA,KAAhC,GAAwCwE,KAAMxE,CAAAA,KAA9C,CAAP;AAPgD,CAAlD;AAgBAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAUwE,CAAAA,SAA5B,GAAwC8B,QAAQ,CAACxD,OAAD,CAAU;AAExD,MAAIyD,YAAYzD,OAAZyD,IAAuB,CAA3B;AACA,MAAIC,YAAY1D,OAAZ0D,GAAsB,EAA1B;AACA,MAAI3E,MAAM,IAAKnE,CAAAA,KAAMF,CAAAA,MAAjBqE,GAA0B0E,SAA1B1E,IAAuC2E,SAAA,GAAY,CAAZ,GAAgB,CAAhB,GAAoB,CAA3D3E,CAAJ;AACA,MAAI0B,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACE,QAAIiJ,SAAJ,GAAgB,CAAhB;AACEjD,SAAA,CAAIhG,CAAJ,CAAA,GAAU,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,GAAiBgJ,SAAjB,CAAV,IAAyCC,SAAzC,GACK,IAAKxF,CAAAA,OAAL,CAAazD,CAAb,GAAiBgJ,SAAjB,GAA6B,CAA7B,CADL,KAC0C,EAD1C,GAC+CC,SAD/C;AADF;AAIEjD,SAAA,CAAIhG,CAAJ,CAAA,GAAS,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,GAAiBgJ,SAAjB,CAAT;AAJF;AADF;AAQA,SAAO,IAAI3J,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,IAAKnG,CAAAA,KAAhC,CAAP;AAdwD,CAA1D;AAuBAR,IAAKG,CAAAA,IAAKC,CAAAA,OAAQgD,CAAAA,SAAU0E,CAAAA,UAA5B,GAAyC+B,QAAQ,CAAC3D,OAAD,CAAU;AAEzD,MAAIyD,YAAYzD,OAAZyD,IAAuB,CAA3B;AACA,MAAIC,YAAY1D,OAAZ0D,GAAsB,EAA1B;AACA,MAAI3E,MAAM,IAAKnE,CAAAA,KAAMF,CAAAA,MAAjBqE,GAA0B0E,SAA9B;AACA,MAAIhD,MAAM,EAAV;AACK,MAAIhG,IAAI,CAAR;AAAL,OAAA,EAAgBA,CAAhB,GAAoBsE,GAApB,EAAyBtE,CAAA,EAAzB;AACE,QAAIiJ,SAAJ,GAAgB,CAAhB;AACEjD,SAAA,CAAIhG,CAAJ,CAAA,GAAU,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,GAAiBgJ,SAAjB,CAAV,KAA0CC,SAA1C,GACK,IAAKxF,CAAAA,OAAL,CAAazD,CAAb,GAAiBgJ,SAAjB,GAA6B,CAA7B,CADL,IACyC,EADzC,GAC8CC,SAD9C;AADF;AAIEjD,SAAA,CAAIhG,CAAJ,CAAA,GAAS,IAAKyD,CAAAA,OAAL,CAAazD,CAAb,GAAiBgJ,SAAjB,CAAT;AAJF;AADF;AAQA,SAAO,IAAI3J,IAAKG,CAAAA,IAAKC,CAAAA,OAAd,CAAsBuG,GAAtB,EAA2B,IAAKnG,CAAAA,KAAhC,CAAP;AAdyD,CAA3D;;",
+"sources":["goog/math/integer.js"],
+"sourcesContent":["/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Defines an Integer class for representing (potentially)\n * infinite length two's-complement integer values.\n *\n * For the specific case of 64-bit integers, use goog.math.Long, which is more\n * efficient.\n */\n\ngoog.provide('goog.math.Integer');\n\ngoog.require('goog.reflect');\n\n/**\n * Constructs a two's-complement integer an array containing bits of the\n * integer in 32-bit (signed) pieces, given in little-endian order (i.e.,\n * lowest-order bits in the first piece), and the sign of -1 or 0.\n *\n * See the from* functions below for other convenient ways of constructing\n * Integers.\n *\n * The internal representation of an integer is an array of 32-bit signed\n * pieces, along with a sign (0 or -1) that indicates the contents of all the\n * other 32-bit pieces out to infinity.  We use 32-bit pieces because these are\n * the size of integers on which JavaScript performs bit-operations.  For\n * operations like addition and multiplication, we split each number into 16-bit\n * pieces, which can easily be multiplied within JavaScript's floating-point\n * representation without overflow or change in sign.\n *\n * @struct\n * @constructor\n * @param {Array<number>} bits Array containing the bits of the number.\n * @param {number} sign The sign of the number: -1 for negative and 0 positive.\n * @final\n */\ngoog.math.Integer = function(bits, sign) {\n  'use strict';\n  /**\n   * @type {number}\n   * @private\n   */\n  this.sign_ = sign;\n\n  // Note: using a local variable while initializing the array helps the\n  // compiler understand that assigning to the array is local side-effect and\n  // that enables the entire constructor to be seen as side-effect free.\n  var localBits = [];\n\n  // Copy the 32-bit signed integer values passed in.  We prune out those at the\n  // top that equal the sign since they are redundant.\n  var top = true;\n\n  for (var i = bits.length - 1; i >= 0; i--) {\n    var val = bits[i] | 0;\n    if (!top || val != sign) {\n      localBits[i] = val;\n      top = false;\n    }\n  }\n\n  /**\n   * @type {!Array<number>}\n   * @private\n   * @const\n   */\n  this.bits_ = localBits;\n};\n\n\n// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the\n// from* methods on which they depend.\n\n\n/**\n * A cache of the Integer representations of small integer values.\n * @type {!Object<number, !goog.math.Integer>}\n * @private\n */\ngoog.math.Integer.IntCache_ = {};\n\n\n/**\n * Returns an Integer representing the given (32-bit) integer value.\n * @param {number} value A 32-bit integer value.\n * @return {!goog.math.Integer} The corresponding Integer value.\n */\ngoog.math.Integer.fromInt = function(value) {\n  'use strict';\n  if (-128 <= value && value < 128) {\n    return goog.reflect.cache(\n        goog.math.Integer.IntCache_, value, function(val) {\n          'use strict';\n          return new goog.math.Integer([val | 0], val < 0 ? -1 : 0);\n        });\n  }\n  return new goog.math.Integer([value | 0], value < 0 ? -1 : 0);\n};\n\n\n/**\n * Returns an Integer representing the given value, provided that it is a finite\n * number.  Otherwise, zero is returned.\n * @param {number} value The value in question.\n * @return {!goog.math.Integer} The corresponding Integer value.\n */\ngoog.math.Integer.fromNumber = function(value) {\n  'use strict';\n  if (isNaN(value) || !isFinite(value)) {\n    return goog.math.Integer.ZERO;\n  } else if (value < 0) {\n    return goog.math.Integer.fromNumber(-value).negate();\n  } else {\n    var bits = [];\n    var pow = 1;\n    for (var i = 0; value >= pow; i++) {\n      bits[i] = (value / pow) | 0;\n      pow *= goog.math.Integer.TWO_PWR_32_DBL_;\n    }\n    return new goog.math.Integer(bits, 0);\n  }\n};\n\n\n/**\n * Returns a Integer representing the value that comes by concatenating the\n * given entries, each is assumed to be 32 signed bits, given in little-endian\n * order (lowest order bits in the lowest index), and sign-extending the highest\n * order 32-bit value.\n * @param {Array<number>} bits The bits of the number, in 32-bit signed pieces,\n *     in little-endian order.\n * @return {!goog.math.Integer} The corresponding Integer value.\n */\ngoog.math.Integer.fromBits = function(bits) {\n  'use strict';\n  var high = bits[bits.length - 1];\n  return new goog.math.Integer(bits, high & (1 << 31) ? -1 : 0);\n};\n\n\n/**\n * Returns an Integer representation of the given string, written using the\n * given radix.\n * @param {string} str The textual representation of the Integer.\n * @param {number=} opt_radix The radix in which the text is written.\n * @return {!goog.math.Integer} The corresponding Integer value.\n */\ngoog.math.Integer.fromString = function(str, opt_radix) {\n  'use strict';\n  if (str.length == 0) {\n    throw new Error('number format error: empty string');\n  }\n\n  var radix = opt_radix || 10;\n  if (radix < 2 || 36 < radix) {\n    throw new Error('radix out of range: ' + radix);\n  }\n\n  if (str.charAt(0) == '-') {\n    return goog.math.Integer.fromString(str.substring(1), radix).negate();\n  } else if (str.indexOf('-') >= 0) {\n    throw new Error('number format error: interior \"-\" character');\n  }\n\n  // Do several (8) digits each time through the loop, so as to\n  // minimize the calls to the very expensive emulated div.\n  var radixToPower = goog.math.Integer.fromNumber(Math.pow(radix, 8));\n\n  var result = goog.math.Integer.ZERO;\n  for (var i = 0; i < str.length; i += 8) {\n    var size = Math.min(8, str.length - i);\n    var value = parseInt(str.substring(i, i + size), radix);\n    if (size < 8) {\n      var power = goog.math.Integer.fromNumber(Math.pow(radix, size));\n      result = result.multiply(power).add(goog.math.Integer.fromNumber(value));\n    } else {\n      result = result.multiply(radixToPower);\n      result = result.add(goog.math.Integer.fromNumber(value));\n    }\n  }\n  return result;\n};\n\n\n/**\n * A number used repeatedly in calculations.  This must appear before the first\n * call to the from* functions below.\n * @type {number}\n * @private\n */\ngoog.math.Integer.TWO_PWR_32_DBL_ = (1 << 16) * (1 << 16);\n\n\n/**  @type {!goog.math.Integer} */\ngoog.math.Integer.ZERO = goog.math.Integer.fromInt(0);\n\n/**  @type {!goog.math.Integer} */\ngoog.math.Integer.ONE = goog.math.Integer.fromInt(1);\n\n\n/**\n * @const\n * @type {!goog.math.Integer}\n * @private\n */\ngoog.math.Integer.TWO_PWR_24_ = goog.math.Integer.fromInt(1 << 24);\n\n/**\n * Returns the value, assuming it is a 32-bit integer.\n * @return {number} The corresponding int value.\n */\ngoog.math.Integer.prototype.toInt = function() {\n  'use strict';\n  return this.bits_.length > 0 ? this.bits_[0] : this.sign_;\n};\n\n\n/** @return {number} The closest floating-point representation to this value. */\ngoog.math.Integer.prototype.toNumber = function() {\n  'use strict';\n  if (this.isNegative()) {\n    return -this.negate().toNumber();\n  } else {\n    var val = 0;\n    var pow = 1;\n    for (var i = 0; i < this.bits_.length; i++) {\n      val += this.getBitsUnsigned(i) * pow;\n      pow *= goog.math.Integer.TWO_PWR_32_DBL_;\n    }\n    return val;\n  }\n};\n\n\n/**\n * @param {number=} opt_radix The radix in which the text should be written.\n * @return {string} The textual representation of this value.\n * @override\n */\ngoog.math.Integer.prototype.toString = function(opt_radix) {\n  'use strict';\n  var radix = opt_radix || 10;\n  if (radix < 2 || 36 < radix) {\n    throw new Error('radix out of range: ' + radix);\n  }\n\n  if (this.isZero()) {\n    return '0';\n  } else if (this.isNegative()) {\n    return '-' + this.negate().toString(radix);\n  }\n\n  // Do several (6) digits each time through the loop, so as to\n  // minimize the calls to the very expensive emulated div.\n  var radixToPower = goog.math.Integer.fromNumber(Math.pow(radix, 6));\n\n  var rem = this;\n  var result = '';\n  while (true) {\n    var remDiv = rem.divide(radixToPower);\n    // The right shifting fixes negative values in the case when\n    // intval >= 2^31; for more details see\n    // https://github.com/google/closure-library/pull/498\n    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt() >>> 0;\n    var digits = intval.toString(radix);\n\n    rem = remDiv;\n    if (rem.isZero()) {\n      return digits + result;\n    } else {\n      while (digits.length < 6) {\n        digits = '0' + digits;\n      }\n      result = '' + digits + result;\n    }\n  }\n};\n\n\n/**\n * Returns the index-th 32-bit (signed) piece of the Integer according to\n * little-endian order (i.e., index 0 contains the smallest bits).\n * @param {number} index The index in question.\n * @return {number} The requested 32-bits as a signed number.\n */\ngoog.math.Integer.prototype.getBits = function(index) {\n  'use strict';\n  if (index < 0) {\n    return 0;  // Allowing this simplifies bit shifting operations below...\n  } else if (index < this.bits_.length) {\n    return this.bits_[index];\n  } else {\n    return this.sign_;\n  }\n};\n\n\n/**\n * Returns the index-th 32-bit piece as an unsigned number.\n * @param {number} index The index in question.\n * @return {number} The requested 32-bits as an unsigned number.\n */\ngoog.math.Integer.prototype.getBitsUnsigned = function(index) {\n  'use strict';\n  var val = this.getBits(index);\n  return val >= 0 ? val : goog.math.Integer.TWO_PWR_32_DBL_ + val;\n};\n\n\n/** @return {number} The sign bit of this number, -1 or 0. */\ngoog.math.Integer.prototype.getSign = function() {\n  'use strict';\n  return this.sign_;\n};\n\n\n/** @return {boolean} Whether this value is zero. */\ngoog.math.Integer.prototype.isZero = function() {\n  'use strict';\n  if (this.sign_ != 0) {\n    return false;\n  }\n  for (var i = 0; i < this.bits_.length; i++) {\n    if (this.bits_[i] != 0) {\n      return false;\n    }\n  }\n  return true;\n};\n\n\n/** @return {boolean} Whether this value is negative. */\ngoog.math.Integer.prototype.isNegative = function() {\n  'use strict';\n  return this.sign_ == -1;\n};\n\n\n/** @return {boolean} Whether this value is odd. */\ngoog.math.Integer.prototype.isOdd = function() {\n  'use strict';\n  return (this.bits_.length == 0) && (this.sign_ == -1) ||\n      (this.bits_.length > 0) && ((this.bits_[0] & 1) != 0);\n};\n\n\n/**\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {boolean} Whether this Integer equals the other.\n */\ngoog.math.Integer.prototype.equals = function(other) {\n  'use strict';\n  if (this.sign_ != other.sign_) {\n    return false;\n  }\n  var len = Math.max(this.bits_.length, other.bits_.length);\n  for (var i = 0; i < len; i++) {\n    if (this.getBits(i) != other.getBits(i)) {\n      return false;\n    }\n  }\n  return true;\n};\n\n\n/**\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {boolean} Whether this Integer does not equal the other.\n */\ngoog.math.Integer.prototype.notEquals = function(other) {\n  'use strict';\n  return !this.equals(other);\n};\n\n\n/**\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {boolean} Whether this Integer is greater than the other.\n */\ngoog.math.Integer.prototype.greaterThan = function(other) {\n  'use strict';\n  return this.compare(other) > 0;\n};\n\n\n/**\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {boolean} Whether this Integer is greater than or equal to the other.\n */\ngoog.math.Integer.prototype.greaterThanOrEqual = function(other) {\n  'use strict';\n  return this.compare(other) >= 0;\n};\n\n\n/**\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {boolean} Whether this Integer is less than the other.\n */\ngoog.math.Integer.prototype.lessThan = function(other) {\n  'use strict';\n  return this.compare(other) < 0;\n};\n\n\n/**\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {boolean} Whether this Integer is less than or equal to the other.\n */\ngoog.math.Integer.prototype.lessThanOrEqual = function(other) {\n  'use strict';\n  return this.compare(other) <= 0;\n};\n\n\n/**\n * Compares this Integer with the given one.\n * @param {goog.math.Integer} other Integer to compare against.\n * @return {number} 0 if they are the same, 1 if the this is greater, and -1\n *     if the given one is greater.\n */\ngoog.math.Integer.prototype.compare = function(other) {\n  'use strict';\n  var diff = this.subtract(other);\n  if (diff.isNegative()) {\n    return -1;\n  } else if (diff.isZero()) {\n    return 0;\n  } else {\n    return +1;\n  }\n};\n\n\n/**\n * Returns an integer with only the first numBits bits of this value, sign\n * extended from the final bit.\n * @param {number} numBits The number of bits by which to shift.\n * @return {!goog.math.Integer} The shorted integer value.\n */\ngoog.math.Integer.prototype.shorten = function(numBits) {\n  'use strict';\n  var arr_index = (numBits - 1) >> 5;\n  var bit_index = (numBits - 1) % 32;\n  var bits = [];\n  for (var i = 0; i < arr_index; i++) {\n    bits[i] = this.getBits(i);\n  }\n  var sigBits = bit_index == 31 ? 0xFFFFFFFF : (1 << (bit_index + 1)) - 1;\n  var val = this.getBits(arr_index) & sigBits;\n  if (val & (1 << bit_index)) {\n    val |= 0xFFFFFFFF - sigBits;\n    bits[arr_index] = val;\n    return new goog.math.Integer(bits, -1);\n  } else {\n    bits[arr_index] = val;\n    return new goog.math.Integer(bits, 0);\n  }\n};\n\n\n/** @return {!goog.math.Integer} The negation of this value. */\ngoog.math.Integer.prototype.negate = function() {\n  'use strict';\n  return this.not().add(goog.math.Integer.ONE);\n};\n\n\n/** @return {!goog.math.Integer} The absolute value of this value. */\ngoog.math.Integer.prototype.abs = function() {\n  'use strict';\n  return this.isNegative() ? this.negate() : this;\n};\n\n\n/**\n * Returns the sum of this and the given Integer.\n * @param {goog.math.Integer} other The Integer to add to this.\n * @return {!goog.math.Integer} The Integer result.\n */\ngoog.math.Integer.prototype.add = function(other) {\n  'use strict';\n  var len = Math.max(this.bits_.length, other.bits_.length);\n  var arr = [];\n  var carry = 0;\n\n  for (var i = 0; i <= len; i++) {\n    var a1 = this.getBits(i) >>> 16;\n    var a0 = this.getBits(i) & 0xFFFF;\n\n    var b1 = other.getBits(i) >>> 16;\n    var b0 = other.getBits(i) & 0xFFFF;\n\n    var c0 = carry + a0 + b0;\n    var c1 = (c0 >>> 16) + a1 + b1;\n    carry = c1 >>> 16;\n    c0 &= 0xFFFF;\n    c1 &= 0xFFFF;\n    arr[i] = (c1 << 16) | c0;\n  }\n  return goog.math.Integer.fromBits(arr);\n};\n\n\n/**\n * Returns the difference of this and the given Integer.\n * @param {goog.math.Integer} other The Integer to subtract from this.\n * @return {!goog.math.Integer} The Integer result.\n */\ngoog.math.Integer.prototype.subtract = function(other) {\n  'use strict';\n  return this.add(other.negate());\n};\n\n\n/**\n * Returns the product of this and the given Integer.\n * @param {goog.math.Integer} other The Integer to multiply against this.\n * @return {!goog.math.Integer} The product of this and the other.\n */\ngoog.math.Integer.prototype.multiply = function(other) {\n  'use strict';\n  if (this.isZero()) {\n    return goog.math.Integer.ZERO;\n  } else if (other.isZero()) {\n    return goog.math.Integer.ZERO;\n  }\n\n  if (this.isNegative()) {\n    if (other.isNegative()) {\n      return this.negate().multiply(other.negate());\n    } else {\n      return this.negate().multiply(other).negate();\n    }\n  } else if (other.isNegative()) {\n    return this.multiply(other.negate()).negate();\n  }\n\n  // If both numbers are small, use float multiplication\n  if (this.lessThan(goog.math.Integer.TWO_PWR_24_) &&\n      other.lessThan(goog.math.Integer.TWO_PWR_24_)) {\n    return goog.math.Integer.fromNumber(this.toNumber() * other.toNumber());\n  }\n\n  // Fill in an array of 16-bit products.\n  var len = this.bits_.length + other.bits_.length;\n  var arr = [];\n  for (var i = 0; i < 2 * len; i++) {\n    arr[i] = 0;\n  }\n  for (var i = 0; i < this.bits_.length; i++) {\n    for (var j = 0; j < other.bits_.length; j++) {\n      var a1 = this.getBits(i) >>> 16;\n      var a0 = this.getBits(i) & 0xFFFF;\n\n      var b1 = other.getBits(j) >>> 16;\n      var b0 = other.getBits(j) & 0xFFFF;\n\n      arr[2 * i + 2 * j] += a0 * b0;\n      goog.math.Integer.carry16_(arr, 2 * i + 2 * j);\n      arr[2 * i + 2 * j + 1] += a1 * b0;\n      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 1);\n      arr[2 * i + 2 * j + 1] += a0 * b1;\n      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 1);\n      arr[2 * i + 2 * j + 2] += a1 * b1;\n      goog.math.Integer.carry16_(arr, 2 * i + 2 * j + 2);\n    }\n  }\n\n  // Combine the 16-bit values into 32-bit values.\n  for (var i = 0; i < len; i++) {\n    arr[i] = (arr[2 * i + 1] << 16) | arr[2 * i];\n  }\n  for (var i = len; i < 2 * len; i++) {\n    arr[i] = 0;\n  }\n  return new goog.math.Integer(arr, 0);\n};\n\n\n/**\n * Carries any overflow from the given index into later entries.\n * @param {Array<number>} bits Array of 16-bit values in little-endian order.\n * @param {number} index The index in question.\n * @private\n */\ngoog.math.Integer.carry16_ = function(bits, index) {\n  'use strict';\n  while ((bits[index] & 0xFFFF) != bits[index]) {\n    bits[index + 1] += bits[index] >>> 16;\n    bits[index] &= 0xFFFF;\n    index++;\n  }\n};\n\n\n/**\n * Returns \"this\" Integer divided by the given one. Both \"this\" and the given\n * Integer MUST be positive.\n *\n * This method is only needed for very large numbers (>10^308),\n * for which the original division algorithm gets into an infinite\n * loop (see https://github.com/google/closure-library/issues/500).\n *\n * The algorithm has some possible performance enhancements (or\n * could be rewritten entirely), it's just an initial solution for\n * the issue linked above.\n *\n * @param {!goog.math.Integer} other The Integer to divide \"this\" by.\n * @return {!goog.math.Integer.DivisionResult}\n * @private\n */\ngoog.math.Integer.prototype.slowDivide_ = function(other) {\n  'use strict';\n  if (this.isNegative() || other.isNegative()) {\n    throw new Error('slowDivide_ only works with positive integers.');\n  }\n\n  var twoPower = goog.math.Integer.ONE;\n  var multiple = other;\n\n  // First we have to figure out what the highest bit of the result\n  // is, so we increase \"twoPower\" and \"multiple\" until \"multiple\"\n  // exceeds \"this\".\n  while (multiple.lessThanOrEqual(this)) {\n    twoPower = twoPower.shiftLeft(1);\n    multiple = multiple.shiftLeft(1);\n  }\n\n  // Rewind by one power of two, giving us the highest bit of the\n  // result.\n  var res = twoPower.shiftRight(1);\n  var total = multiple.shiftRight(1);\n\n  // Now we starting decreasing \"multiple\" and \"twoPower\" to find the\n  // rest of the bits of the result.\n  var total2;\n  multiple = multiple.shiftRight(2);\n  twoPower = twoPower.shiftRight(2);\n  while (!multiple.isZero()) {\n    // whenever we can add \"multiple\" to the total and not exceed\n    // \"this\", that means we've found a 1 bit. Else we've found a 0\n    // and don't need to add to the result.\n    total2 = total.add(multiple);\n    if (total2.lessThanOrEqual(this)) {\n      res = res.add(twoPower);\n      total = total2;\n    }\n    multiple = multiple.shiftRight(1);\n    twoPower = twoPower.shiftRight(1);\n  }\n\n\n  // TODO(user): Calculate this more efficiently during the division.\n  // This is kind of a waste since it isn't always needed, but it keeps the\n  // API smooth. Since this is already a slow path it probably isn't a big deal.\n  var remainder = this.subtract(res.multiply(other));\n  return new goog.math.Integer.DivisionResult(res, remainder);\n};\n\n\n/**\n * Returns this Integer divided by the given one.\n * @param {!goog.math.Integer} other The Integer to divide this by.\n * @return {!goog.math.Integer} This value divided by the given one.\n */\ngoog.math.Integer.prototype.divide = function(other) {\n  'use strict';\n  return this.divideAndRemainder(other).quotient;\n};\n\n\n/**\n * A struct for holding the quotient and remainder of a division.\n *\n * @constructor\n * @final\n * @struct\n *\n * @param {!goog.math.Integer} quotient\n * @param {!goog.math.Integer} remainder\n */\ngoog.math.Integer.DivisionResult = function(quotient, remainder) {\n  'use strict';\n  /** @const */\n  this.quotient = quotient;\n\n  /** @const */\n  this.remainder = remainder;\n};\n\n\n/**\n * Returns this Integer divided by the given one, as well as the remainder of\n * that division.\n *\n * @param {!goog.math.Integer} other The Integer to divide this by.\n * @return {!goog.math.Integer.DivisionResult}\n */\ngoog.math.Integer.prototype.divideAndRemainder = function(other) {\n  'use strict';\n  if (other.isZero()) {\n    throw new Error('division by zero');\n  } else if (this.isZero()) {\n    return new goog.math.Integer.DivisionResult(\n        goog.math.Integer.ZERO, goog.math.Integer.ZERO);\n  }\n\n  if (this.isNegative()) {\n    // Do the division on the negative of the numerator...\n    var result = this.negate().divideAndRemainder(other);\n    return new goog.math.Integer.DivisionResult(\n        // ...and flip the sign back after.\n        result.quotient.negate(),\n        // The remainder must always have the same sign as the numerator.\n        result.remainder.negate());\n  } else if (other.isNegative()) {\n    // Do the division on the negative of the denominator...\n    var result = this.divideAndRemainder(other.negate());\n    return new goog.math.Integer.DivisionResult(\n        // ...and flip the sign back after.\n        result.quotient.negate(),\n        // The remainder must always have the same sign as the numerator.\n        result.remainder);\n  }\n\n  // Have to degrade to slowDivide for Very Large Numbers, because\n  // they're out of range for the floating-point approximation\n  // technique used below.\n  if (this.bits_.length > 30) {\n    return this.slowDivide_(other);\n  }\n\n  // Repeat the following until the remainder is less than other:  find a\n  // floating-point that approximates remainder / other *from below*, add this\n  // into the result, and subtract it from the remainder.  It is critical that\n  // the approximate value is less than or equal to the real value so that the\n  // remainder never becomes negative.\n  var res = goog.math.Integer.ZERO;\n  var rem = this;\n  while (rem.greaterThanOrEqual(other)) {\n    // Approximate the result of division. This may be a little greater or\n    // smaller than the actual value.\n    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));\n\n    // We will tweak the approximate result by changing it in the 48-th digit or\n    // the smallest non-fractional digit, whichever is larger.\n    var log2 = Math.ceil(Math.log(approx) / Math.LN2);\n    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);\n\n    // Decrease the approximation until it is smaller than the remainder.  Note\n    // that if it is too large, the product overflows and is negative.\n    var approxRes = goog.math.Integer.fromNumber(approx);\n    var approxRem = approxRes.multiply(other);\n    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {\n      approx -= delta;\n      approxRes = goog.math.Integer.fromNumber(approx);\n      approxRem = approxRes.multiply(other);\n    }\n\n    // We know the answer can't be zero... and actually, zero would cause\n    // infinite recursion since we would make no progress.\n    if (approxRes.isZero()) {\n      approxRes = goog.math.Integer.ONE;\n    }\n\n    res = res.add(approxRes);\n    rem = rem.subtract(approxRem);\n  }\n  return new goog.math.Integer.DivisionResult(res, rem);\n};\n\n\n/**\n * Returns this Integer modulo the given one.\n * @param {!goog.math.Integer} other The Integer by which to mod.\n * @return {!goog.math.Integer} This value modulo the given one.\n */\ngoog.math.Integer.prototype.modulo = function(other) {\n  'use strict';\n  return this.divideAndRemainder(other).remainder;\n};\n\n\n/** @return {!goog.math.Integer} The bitwise-NOT of this value. */\ngoog.math.Integer.prototype.not = function() {\n  'use strict';\n  var len = this.bits_.length;\n  var arr = [];\n  for (var i = 0; i < len; i++) {\n    arr[i] = ~this.bits_[i];\n  }\n  return new goog.math.Integer(arr, ~this.sign_);\n};\n\n\n/**\n * Returns the bitwise-AND of this Integer and the given one.\n * @param {goog.math.Integer} other The Integer to AND with this.\n * @return {!goog.math.Integer} The bitwise-AND of this and the other.\n */\ngoog.math.Integer.prototype.and = function(other) {\n  'use strict';\n  var len = Math.max(this.bits_.length, other.bits_.length);\n  var arr = [];\n  for (var i = 0; i < len; i++) {\n    arr[i] = this.getBits(i) & other.getBits(i);\n  }\n  return new goog.math.Integer(arr, this.sign_ & other.sign_);\n};\n\n\n/**\n * Returns the bitwise-OR of this Integer and the given one.\n * @param {goog.math.Integer} other The Integer to OR with this.\n * @return {!goog.math.Integer} The bitwise-OR of this and the other.\n */\ngoog.math.Integer.prototype.or = function(other) {\n  'use strict';\n  var len = Math.max(this.bits_.length, other.bits_.length);\n  var arr = [];\n  for (var i = 0; i < len; i++) {\n    arr[i] = this.getBits(i) | other.getBits(i);\n  }\n  return new goog.math.Integer(arr, this.sign_ | other.sign_);\n};\n\n\n/**\n * Returns the bitwise-XOR of this Integer and the given one.\n * @param {goog.math.Integer} other The Integer to XOR with this.\n * @return {!goog.math.Integer} The bitwise-XOR of this and the other.\n */\ngoog.math.Integer.prototype.xor = function(other) {\n  'use strict';\n  var len = Math.max(this.bits_.length, other.bits_.length);\n  var arr = [];\n  for (var i = 0; i < len; i++) {\n    arr[i] = this.getBits(i) ^ other.getBits(i);\n  }\n  return new goog.math.Integer(arr, this.sign_ ^ other.sign_);\n};\n\n\n/**\n * Returns this value with bits shifted to the left by the given amount.\n * @param {number} numBits The number of bits by which to shift.\n * @return {!goog.math.Integer} This shifted to the left by the given amount.\n */\ngoog.math.Integer.prototype.shiftLeft = function(numBits) {\n  'use strict';\n  var arr_delta = numBits >> 5;\n  var bit_delta = numBits % 32;\n  var len = this.bits_.length + arr_delta + (bit_delta > 0 ? 1 : 0);\n  var arr = [];\n  for (var i = 0; i < len; i++) {\n    if (bit_delta > 0) {\n      arr[i] = (this.getBits(i - arr_delta) << bit_delta) |\n          (this.getBits(i - arr_delta - 1) >>> (32 - bit_delta));\n    } else {\n      arr[i] = this.getBits(i - arr_delta);\n    }\n  }\n  return new goog.math.Integer(arr, this.sign_);\n};\n\n\n/**\n * Returns this value with bits shifted to the right by the given amount.\n * @param {number} numBits The number of bits by which to shift.\n * @return {!goog.math.Integer} This shifted to the right by the given amount.\n */\ngoog.math.Integer.prototype.shiftRight = function(numBits) {\n  'use strict';\n  var arr_delta = numBits >> 5;\n  var bit_delta = numBits % 32;\n  var len = this.bits_.length - arr_delta;\n  var arr = [];\n  for (var i = 0; i < len; i++) {\n    if (bit_delta > 0) {\n      arr[i] = (this.getBits(i + arr_delta) >>> bit_delta) |\n          (this.getBits(i + arr_delta + 1) << (32 - bit_delta));\n    } else {\n      arr[i] = this.getBits(i + arr_delta);\n    }\n  }\n  return new goog.math.Integer(arr, this.sign_);\n};\n"],
+"names":["goog","provide","require","math","Integer","goog.math.Integer","bits","sign","sign_","localBits","top","i","length","val","bits_","IntCache_","fromInt","goog.math.Integer.fromInt","value","reflect","cache","fromNumber","goog.math.Integer.fromNumber","isNaN","isFinite","ZERO","negate","pow","TWO_PWR_32_DBL_","fromBits","goog.math.Integer.fromBits","high","fromString","goog.math.Integer.fromString","str","opt_radix","Error","radix","charAt","substring","indexOf","radixToPower","Math","result","size","min","parseInt","power","multiply","add","ONE","TWO_PWR_24_","prototype","toInt","goog.math.Integer.prototype.toInt","toNumber","goog.math.Integer.prototype.toNumber","isNegative","getBitsUnsigned","toString","goog.math.Integer.prototype.toString","isZero","rem","remDiv","divide","intval","subtract","digits","getBits","goog.math.Integer.prototype.getBits","index","goog.math.Integer.prototype.getBitsUnsigned","getSign","goog.math.Integer.prototype.getSign","goog.math.Integer.prototype.isZero","goog.math.Integer.prototype.isNegative","isOdd","goog.math.Integer.prototype.isOdd","equals","goog.math.Integer.prototype.equals","other","len","max","notEquals","goog.math.Integer.prototype.notEquals","greaterThan","goog.math.Integer.prototype.greaterThan","compare","greaterThanOrEqual","goog.math.Integer.prototype.greaterThanOrEqual","lessThan","goog.math.Integer.prototype.lessThan","lessThanOrEqual","goog.math.Integer.prototype.lessThanOrEqual","goog.math.Integer.prototype.compare","diff","shorten","goog.math.Integer.prototype.shorten","numBits","arr_index","bit_index","sigBits","goog.math.Integer.prototype.negate","not","abs","goog.math.Integer.prototype.abs","goog.math.Integer.prototype.add","arr","carry","a1","a0","b1","b0","c0","c1","goog.math.Integer.prototype.subtract","goog.math.Integer.prototype.multiply","j","carry16_","goog.math.Integer.carry16_","slowDivide_","goog.math.Integer.prototype.slowDivide_","twoPower","multiple","shiftLeft","res","shiftRight","total","total2","remainder","DivisionResult","goog.math.Integer.prototype.divide","divideAndRemainder","quotient","goog.math.Integer.DivisionResult","goog.math.Integer.prototype.divideAndRemainder","approx","floor","log2","ceil","log","LN2","delta","approxRes","approxRem","modulo","goog.math.Integer.prototype.modulo","goog.math.Integer.prototype.not","and","goog.math.Integer.prototype.and","or","goog.math.Integer.prototype.or","xor","goog.math.Integer.prototype.xor","goog.math.Integer.prototype.shiftLeft","arr_delta","bit_delta","goog.math.Integer.prototype.shiftRight"]
+}