append item to vector, returning if item was added

Overload @param s The character string to parse. @param ec */

Copy a substring to another string. Copies `std::min(count, size() - pos)` characters starting at index `pos` to the string pointed t

assumes p..p+15 are valid

Convert characters for 0-9, A-Z, a-z to 0-35. Anything else is 255

Computes 5^-i in the form required by Ryu, and stores it in the given pointer.

Computes 5^i in the form required by Ryu, and stores it in the given pointer.

Check if calling `deallocate` on the memory resource has no effect. This function is used to determine if the deallocate function of the

returns true if we use a linear search instead of the hash table.

Helper C++11 constexpr generic implementation of leading_zeroes */

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 lim

normalize the big integer, so most-significant zero limbs are removed.

credit @aqrit

multiply as if by 2 raised to a power.

* For q in (0,350), we have that * f = (((152170 + 65536) * q ) >> 16); * is equal to * floor(p) + q * where * p = log(5**q)/log(2) = q * lo

set the length, without bounds checking.

get the number of bits in the bigint.

compare two big integers, returning the large value. assumes both are normalized. if the return value is negative, other is larger, if the return valu

Attempts to compute i * 10^(power) exactly; and if "negative" is true, negate the result. This function will only work in some cases, when it does no