181 lines
3.3 KiB
C++
181 lines
3.3 KiB
C++
#include "dl_string.h"
|
|
|
|
#include <cstdarg>
|
|
#include <cstdio>
|
|
|
|
|
|
namespace dl
|
|
{
|
|
std::string to_string(std::error_code code)
|
|
{
|
|
return fmt::format("{}({}): {}",
|
|
code.category().name(),
|
|
code.value(),
|
|
CodeCvt::MultiByteToUtf8(code.message()));
|
|
}
|
|
|
|
template<>
|
|
std::string to_string<BufferView>(BufferView buf)
|
|
{
|
|
std::string ret = { (char*)buf.data(), buf.size() };
|
|
assert(CodeCvt::Utf8::Check(ret));
|
|
return ret;
|
|
}
|
|
|
|
|
|
namespace String
|
|
{
|
|
std::string Sprintf(const char* format, ...)
|
|
{
|
|
va_list args;
|
|
int len;
|
|
|
|
va_start(args, format);
|
|
len = vsnprintf(nullptr, 0, format, args) + 1;
|
|
va_end(args);
|
|
|
|
std::string ret;
|
|
ret.resize(len);
|
|
|
|
va_start(args, format);
|
|
vsnprintf((char*)ret.data(), len, format, args);
|
|
va_end(args);
|
|
|
|
ret.pop_back();
|
|
|
|
return ret;
|
|
}
|
|
|
|
|
|
std::string CvtRelativePath(std::string path_cur, std::string_view path)
|
|
{
|
|
if (!IsRelativePath(path))
|
|
return std::string{ path };
|
|
|
|
|
|
//直到首位不是 “./”和“../”
|
|
size_t i = 0;
|
|
size_t size = path.size();
|
|
while ((i < size)
|
|
&& (path[i] == '.'))
|
|
{
|
|
if ((i + 1 < size)
|
|
&& (path[i + 1] == '/'))
|
|
{//当前目录
|
|
i += 2;
|
|
}
|
|
else if ((i + 2 < size)
|
|
&& (path[i + 1] == '.' && path[i + 2] == '/'))
|
|
{//向上目录
|
|
i += 3;
|
|
path_cur.pop_back();
|
|
Erase::TailFromLast(path_cur, '/');
|
|
}
|
|
else
|
|
break;
|
|
}
|
|
return path_cur + std::string(path.begin() + i, path.end());
|
|
}
|
|
|
|
bool GetPathAndRes(std::string_view path_root, std::string_view path_name, std::string& path_real, std::string& res_name, std::string_view name /*= ""*/)
|
|
{
|
|
if (IsRelativePath(path_name))
|
|
{
|
|
path_real = fmt::format("{}{}", path_root, path_name);
|
|
if (name.empty())
|
|
{
|
|
res_name = path_name;
|
|
if (Erase::TailFromLast(res_name, '.'))
|
|
res_name.pop_back();//去后缀
|
|
Every::Replace(res_name, '/', '.');//斜杠变.
|
|
}
|
|
else
|
|
res_name = name;
|
|
}
|
|
else
|
|
{
|
|
if (name.empty())
|
|
{
|
|
path_real = path_name;
|
|
res_name = "error";
|
|
log_err0("绝对路径加载,必须设定资源名字!");
|
|
return false;
|
|
}
|
|
else
|
|
{
|
|
path_real = path_name;
|
|
res_name = name;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
std::string GetResName(std::string_view path_root, std::string_view path_name)
|
|
{
|
|
std::string name = std::string{ path_name };
|
|
auto iter_path = name.find(path_root);
|
|
if (iter_path != 0)
|
|
{
|
|
log_err0("路径错误:" + std::string{ name });
|
|
}
|
|
else
|
|
name.erase(0, path_root.size());
|
|
|
|
if (Erase::TailFromLast(name, '.'))//去后缀
|
|
{
|
|
name.pop_back();
|
|
}
|
|
|
|
Every::Replace(name, '/', '.');
|
|
return name;
|
|
}
|
|
|
|
std::vector<std::string> FormatString2(const Vector2<std::string>& arr)
|
|
{
|
|
std::size_t W = arr.GetWidth();
|
|
std::size_t H = arr.GetHeight();
|
|
|
|
//每一列得到一个最大宽度
|
|
std::vector<size_t> mul_col;
|
|
mul_col.resize(W);
|
|
for (size_t j = 0; j < H; ++j)
|
|
{
|
|
for (size_t i = 0; i < W; ++i)
|
|
{
|
|
if (arr[j][i].size() > mul_col[i])
|
|
mul_col[i] = arr[j][i].size();
|
|
}
|
|
}
|
|
//合并每行
|
|
std::vector<std::string> ret;
|
|
ret.resize(H);
|
|
for (size_t i = 0; i < W; ++i)
|
|
{
|
|
std::string fmt = std::string("{:<") + std::to_string(mul_col[i] + 1) + "}";
|
|
for (size_t j = 0; j < H; ++j)
|
|
{
|
|
ret[j] += fmt::vformat(fmt, fmt::make_format_args(arr[j][i]));
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
}
|
|
|
|
std::string to_string_hex(BufferView buf, bool add_tag /*= false*/)
|
|
{
|
|
std::string ret;
|
|
if (add_tag)
|
|
ret += "0x";
|
|
|
|
for (size_t i = 0; i < buf.size(); ++i)
|
|
{
|
|
ret += fmt::format("{:02x}", (unsigned char)buf[i]);
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
}
|
|
|
|
|