! * @brief convert a byte to a uppercase hex representation * @param[in] byte byte to represent * @return representation ("00".."FF")

=========================================================================== * Initialize a new block. */

return whether the iterator is at end

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

! @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

* this only works with sorted cuesheets (the spec strongly recommends but * does not require sorted cuesheets). but if it's not sorted, picking a *

slightly different that strndup(): this always copies 'size' bytes starting from s into a NUL-terminated string. */

* also disallows non-shortest-form encodings, c.f. * http://www.unicode.org/versions/corrigendum1.html * and a more clear explanation at the end o

For 80x86 and 680x0, an optimized version will be provided in match.asm or * match.S. The code will be functionally equivalent. */

MAKECRCH */ Generate tables for a byte-wise 32-bit CRC calculation on the polynomial: x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+

initialize the struct to a known state */

! @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/

=========================================================================== * Restore the heap property by moving down the tree starting at node k,