return whether the iterator is at end

credit @aqrit

@brief return whether value is an unsigned integer number @sa https://json.nlohmann.me/api/basic_json/is_number_unsigned/

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

! @brief determine system byte order @return true if and only if system's byte order is little endian @note from https://stackoverflow.com/a/1001328

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.

! @brief post-increment (it++) @pre The iterator is initialized; i.e. `m_object != nullptr`. */

! @brief post-decrement (it--) @pre The iterator is initialized; i.e. `m_object != nullptr`. */

@brief remove last reference token @sa https://json.nlohmann.me/api/json_pointer/pop_back/

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

reset token_buffer; current character is beginning of token

set the length, without bounds checking.

@brief returns the number of elements @sa https://json.nlohmann.me/api/basic_json/size/

@brief exchanges the values @sa https://json.nlohmann.me/api/basic_json/swap/

! @param[in] j JSON value to serialize @pre j.type() == value_t::object */

! @param[in] j JSON value to serialize */

! @param[in] j JSON value to serialize */

get the number of bits in the bigint.

@brief returns a const reverse iterator to the last element @sa https://json.nlohmann.me/api/basic_json/crbegin/

@brief returns a const reverse iterator to one before the first @sa https://json.nlohmann.me/api/basic_json/crend/

! @brief dump a floating-point number Dump a given floating-point number to output stream @a o. Works internally with @a number_buffer. @param[i

! For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k. For n == 0, returns 1 and sets pow10 := 1. */

! For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached power-of-ten c = f_c * 2^e_c, such that the exponent of the product

! Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+. M- and M+ must be normalized and share the same exponent -60 <= e <= -32. */

get the high 64 bits from the vector, and if bits were truncated. this is to get the significant digits for the float.