mirror of
https://git.suyu.dev/suyu/suyu.git
synced 2024-11-29 23:06:23 -05:00
969cd6dc1d
Avoids potentially performing multiple reallocations (depending on the size of the input data) by reserving the necessary amount of memory ahead of time. This is trivially doable, so there's no harm in it.
54 lines
1.6 KiB
C++
54 lines
1.6 KiB
C++
// Copyright 2013 Dolphin Emulator Project / 2014 Citra Emulator Project
|
|
// Licensed under GPLv2 or any later version
|
|
// Refer to the license.txt file included.
|
|
|
|
#pragma once
|
|
|
|
#include <array>
|
|
#include <cstddef>
|
|
#include <string>
|
|
#include <type_traits>
|
|
#include <vector>
|
|
#include <fmt/format.h>
|
|
#include "common/common_types.h"
|
|
|
|
namespace Common {
|
|
|
|
u8 ToHexNibble(char c1);
|
|
|
|
std::vector<u8> HexStringToVector(std::string_view str, bool little_endian);
|
|
|
|
template <std::size_t Size, bool le = false>
|
|
std::array<u8, Size> HexStringToArray(std::string_view str) {
|
|
std::array<u8, Size> out{};
|
|
if constexpr (le) {
|
|
for (std::size_t i = 2 * Size - 2; i <= 2 * Size; i -= 2)
|
|
out[i / 2] = (ToHexNibble(str[i]) << 4) | ToHexNibble(str[i + 1]);
|
|
} else {
|
|
for (std::size_t i = 0; i < 2 * Size; i += 2)
|
|
out[i / 2] = (ToHexNibble(str[i]) << 4) | ToHexNibble(str[i + 1]);
|
|
}
|
|
return out;
|
|
}
|
|
|
|
template <typename ContiguousContainer>
|
|
std::string HexToString(const ContiguousContainer& data, bool upper = true) {
|
|
static_assert(std::is_same_v<typename ContiguousContainer::value_type, u8>,
|
|
"Underlying type within the contiguous container must be u8.");
|
|
|
|
constexpr std::size_t pad_width = 2;
|
|
|
|
std::string out;
|
|
out.reserve(std::size(data) * pad_width);
|
|
|
|
for (const u8 c : data) {
|
|
out += fmt::format(upper ? "{:02X}" : "{:02x}", c);
|
|
}
|
|
|
|
return out;
|
|
}
|
|
|
|
std::array<u8, 0x10> operator"" _array16(const char* str, std::size_t len);
|
|
std::array<u8, 0x20> operator"" _array32(const char* str, std::size_t len);
|
|
|
|
} // namespace Common
|