(e, t)
| 665 | } |
| 666 | |
| 667 | function qCkv(e, t) { |
| 668 | var r = 0 |
| 669 | , n = 0 |
| 670 | , i = Math["min"](e["t"], this["t"]); |
| 671 | while (r < i) { |
| 672 | n += this[r] - e[r]; |
| 673 | t[r++] = n & this["DM"]; |
| 674 | n >>= this["DB"]; |
| 675 | } |
| 676 | if (e["t"] < this["t"]) { |
| 677 | n -= e["s"]; |
| 678 | while (r < this["t"]) { |
| 679 | n += this[r]; |
| 680 | t[r++] = n & this["DM"]; |
| 681 | n >>= this["DB"]; |
| 682 | } |
| 683 | n += this["s"]; |
| 684 | } else { |
| 685 | n += this["s"]; |
| 686 | while (r < e["t"]) { |
| 687 | n -= e[r]; |
| 688 | t[r++] = n & this["DM"]; |
| 689 | n >>= this["DB"]; |
| 690 | } |
| 691 | n -= e["s"]; |
| 692 | } |
| 693 | t["s"] = n < 0 ? -1 : 0; |
| 694 | if (n < -1) |
| 695 | t[r++] = this["DV"] + n; |
| 696 | else if (n > 0) |
| 697 | t[r++] = n; |
| 698 | t["t"] = r; |
| 699 | t["clamp"](); |
| 700 | } |
| 701 | |
| 702 | function rwaY(e, t) { |
| 703 | var r = this["abs"]() |
nothing calls this directly
no outgoing calls
no test coverage detected