11 for (
size_t i = 0;
i < 8;
i++) {
14 while (next != 8 &&
address[next] == 0) ++next;
15 const size_t count = next -
i;
26std::string
ipv6(
const std::array<uint16_t, 8>&
address)
noexcept {
37 std::string
output(4 * 8 + 7 + 2,
'\0');
68 std::string
output(15,
'\0');
72 for (
int i = 2;
i >= 0;
i--) {
Includes all definitions for Ada.
Includes the definitions for URL serializers.
std::string ipv6(const std::array< uint16_t, 8 > &address) noexcept
void find_longest_sequence_of_ipv6_pieces(const std::array< uint16_t, 8 > &address, size_t &compress, size_t &compress_length) noexcept
std::string ipv4(uint64_t address) noexcept
ada_warn_unused ada::result< result_type > parse(std::string_view input, const result_type *base_url=nullptr)