check if any limbs are non-zero after the given index. this needs to be done in reverse order, since the index is relative to the most significant limbs.
| 1779 | // this needs to be done in reverse order, since the index |
| 1780 | // is relative to the most significant limbs. |
| 1781 | bool nonzero(size_t index) const noexcept { |
| 1782 | while (index < len()) { |
| 1783 | if (rindex(index) != 0) { |
| 1784 | return true; |
| 1785 | } |
| 1786 | index++; |
| 1787 | } |
| 1788 | return false; |
| 1789 | } |
| 1790 | // normalize the big integer, so most-significant zero limbs are removed. |
| 1791 | void normalize() noexcept { |
| 1792 | while (len() > 0 && rindex(0) == 0) { |