dl
dl_string.h
浏览该文件的文档.
1
20#pragma once
21#include <array>
22#include <string>
23#include <system_error>
24
25#include <fmt/format.h>
26
27#include "memory/dl_code_cvt.h"
28#include "dl_range.h"
29#include "dl_algorithm.h"
30#include "io/dl_log.h"
31#include "base/dl_type_def.h"
32
33namespace dl
34{
35
36//-----------------------------字符串连接-------------------
37inline std::string& operator+=(std::string& a, std::string_view b)
38{
39 a.append(b);
40 return a;
41}
42
43inline std::string operator+(const std::string& a, std::string_view b)
44{
45 std::string ret = a;
46 return ret += b;
47}
48
49
53template<typename T, size_t N>
54std::string to_string(const std::array<T, N>& arr, std::string_view delimiter = ", ")
55{
56 static_assert(N != 0);
57 std::string ret;
58 for (size_t i = 0; i < N - 1; ++i)
59 {
60 ret += std::to_string(arr[i]);
61 ret += delimiter;
62 }
63 ret += std::to_string(arr[N - 1]);
64 return ret;
65}
66
71template<size_t W, size_t H>
72std::array<std::string, H> to_string(const std::array<std::array<std::string, W>, H>& arr)
73{
74 //每一列得到一个最大宽度
75 std::array<size_t, W> mul_col{};
76 for (size_t j = 0; j < H; ++j)
77 {
78 for (size_t i = 0; i < W; ++i)
79 {
80 if (arr[j][i].size() > mul_col[i])
81 mul_col[i] = arr[j][i].size();
82 }
83 }
84 //合并每行
85 std::array<std::string, H> ret;
86 for (size_t i = 0; i < W; ++i)
87 {
88 std::string fmt = std::string("{:<") + std::to_string(mul_col[i] + 1) + "}";
89 for (size_t j = 0; j < H; ++j)
90 {
91 ret[j] += fmt::vformat(fmt, fmt::make_format_args(arr[j][i]));
92 }
93 }
94 return ret;
95}
96
98std::string to_string(std::error_code code);
99
103template<size_t N = 2>
104std::string to_string(double v)
105{
106 // std::string f = "{:." + to_string(N) + "f}";
107 // return fmt::format(f, v);
108 if constexpr (N == 2)
109 {
110 return fmt::format("{:.2f}", v);
111 }
112 else
113 return to_string(v);
114}
118template<size_t N>
119std::string to_string(const std::array<std::byte, N>& buf, bool add_tag = false)
120{
121 std::string ret;
122 if (add_tag)
123 ret += "0x";
124
125 for (size_t i = 0; i < N; ++i)
126 {
127 ret += fmt::format("{:02x}", (unsigned char)buf[i]);
128 }
129 return ret;
130}
131
132
133namespace String
134{
135
136
140template<std::size_t N>
141std::array<int, N> toPoint(std::string_view str)
142{
143 std::vector<std::string> vec;
144 split(std::string(str), ',', vec);
145 assert(vec.size() == N);
146 return { stoi(vec[0]), stoi(vec[1]) };
147}
148
149inline Point2 toPoint2(std::string_view str)
150{
151 return toPoint<2>(str);
152}
153
157constexpr std::string_view GetNotFileName()
158{
159 return R"(<>/\|:"*?)";
160}
161
165inline void EraseNotFileName(std::string& name)
166{
167 Erase::Match(name, std::string{ String::GetNotFileName() });
168}
169
173inline void ToLower(std::string& str)
174{
175 std::transform(str.begin(), str.end(), str.begin(), ::tolower);
176}
177
181inline std::string ToLower(const std::string& str)
182{
183 std::string ret = str;
184 std::transform(ret.begin(), ret.end(), ret.begin(), ::tolower);
185 return ret;
186}
187
191inline bool EqualToLower(std::string_view a, std::string_view b)
192{
193 if (a.size() != b.size())
194 return false;
195 if (a.empty())
196 return true;
197 for (size_t i = 0; i < a.size(); ++i)
198 {
199 if (std::tolower(a[i]) != std::tolower(b[i]))
200 return false;
201 }
202 return true;
203}
204
208inline std::string Splicing(const std::vector<std::string>& vec, const std::string& delimiter, const std::string& end)
209{
210 if (vec.empty())
211 return {};
212 if (vec.size() == 1)
213 return vec[0] + end;
214
215 std::string ret;
216 for (size_t i = 0; i < vec.size() - 1; ++i)
217 {
218 ret += vec[i];
219 ret += delimiter;
220 }
221 ret += vec[vec.size() - 1];
222 ret += end;
223 return ret;
224}
225
229inline std::string GetUtf8ByWchar(wchar_t wc, size_t offset)
230{
231 // 某些平台wchar_t是4字节,必须使用u32string
232 std::u32string s{ (char32_t)(wc + offset) };
233
234 return CodeCvt::Utf32ToUtf8(s);
235}
236
237
241//string GetAscii()
242//{
243// string str_ascii = format("ascii表:\n0 -> /0[t_8]");
244// for (char ch = 1; ch < 128; ++ch)
245// {
246// if (ch == '\n')
247// str_ascii += format("{} -> {}[t_8]", to_string(ch), "/n");
248// else if (ch == '\t')
249// str_ascii += format("{} -> {}[t_8]", to_string(ch), "/t");
250// else if (ch == '[')
251// str_ascii += format("{} -> {}[t_8]", to_string(ch), "[l]");
252// else if (ch == ']')
253// str_ascii += format("{} -> {}[t_8]", to_string(ch), "[r]");
254// else
255// str_ascii += format("{} -> {}[t_8]", to_string(ch), char(ch));
256//
257// if ((ch - 1) % 6 == 0)
258// str_ascii += "\n";
259// }
260// return str_ascii;
261//}
262
266std::string Sprintf(const char* format, ...);
267
271template<typename T>
272std::string SplitIntegerToThousands(T integer)
273{
274 return r_insert_per_num(to_string(integer), ',', 3);
275}
276
280inline std::vector<std::string> Split(const std::string& str, char d)
281{
282 std::vector<std::string> ret;
283 split(str, d, ret);
284 return ret;
285}
286
290inline std::vector<std::string> Split(const std::string& str, const std::string& d)
291{
292 std::vector<std::string> ret;
293 split_sub(str, d, ret);
294 return ret;
295}
296
301inline void EraseExtension(std::string& path_name)
302{
303 if (Erase::TailFromLast(path_name, '.'))
304 path_name.pop_back();
305}
306[[nodiscard]]
307inline std::string EraseExtension(std::string_view path_name)
308{
309 std::string ret = std::string{ path_name };
310 EraseExtension(ret);
311 return ret;
312}
313
320inline void ReplaceExtension(std::string& path_name, std::string_view fmt)
321{
322 if (Erase::TailFromLast(path_name, '.'))
323 {
324 path_name += fmt;
325 return;
326 }
327 path_name += ".";
328 path_name += std::string{ fmt };
329}
330[[nodiscard]]
331inline std::string ReplaceExtension(std::string_view path_name, std::string_view fmt)
332{
333 std::string ret = std::string{ path_name };
334 ReplaceExtension(ret, fmt);
335 return ret;
336}
337
342inline void EraseFilename(std::string& path_name)
343{
344 if (!Erase::TailFromLast(path_name, '/'))
345 log_err0("不是一个有效路径!");
346}
347[[nodiscard]]
348inline std::string EraseFilename(std::string_view path_name)
349{
350 std::string ret = std::string{ path_name };
351 EraseFilename(ret);
352 return ret;
353}
354
361inline bool IsRelativePath(std::string_view path_name)
362{
363 if (path_name.empty())
364 return true;
365
366 if (path_name[0] == '/')
367 return false;
368
369 size_t len = std::min(path_name.size(), (size_t)12);
370 for (size_t i = 0; i < len; ++i)
371 {
372 if (path_name[i] == ':')
373 return false;
374 }
375 return true;
376}
377
378
388bool GetPathAndRes(
389 std::string_view path_root, std::string_view path_name,
390 std::string& path_real, std::string& res_name,
391 std::string_view name = "");
392
393
399std::string GetResName(
400 std::string_view path_root,
401 std::string_view path_name);
402
403
410std::string CvtRelativePath(std::string path_cur, std::string_view path);
411
416inline void CvtPathSlash(std::string& path)
417{
418 Every::Replace(path, '\\', '/');
419}
420
424inline bool HasNumber(std::string_view str)
425{
426 return Any::Yes(str, isdigit);
427}
428
432inline bool HasLetter(std::string_view str)
433{
434 return Any::Yes(str, isalpha);
435}
436}
437
438}
439
440
441namespace dl
442{
443
444
445
446//#if (DL_PLATFORM == DL_PLATFORM_WIN32)
448//* @brief array的format特化
449//* @note
450//*/
451//template<typename T, size_t N, typename CharT>
452//struct std::formatter<std::array<T, N>, CharT> : std::formatter<std::string, CharT>
453//{
454// template <typename FormatParseContext>
455// auto parse(FormatParseContext& pc)
456// {
457// return pc.end();
458// }
459//
460// template<typename FormatContext>
461// auto format(array<T, N> t, FormatContext& fc)
462// {
463// if constexpr (N == 2)
464// return std::formatter<std::string, CharT>::format(
465// std::format("{}, {}", t[0], t[1]), fc);
466// if constexpr (N == 3)
467// return std::formatter<std::string, CharT>::format(
468// std::format("{}, {}, {}", t[0], t[1], t[2]), fc);
469// if constexpr (N == 4)
470// return std::formatter<std::string, CharT>::format(
471// std::format("{}, {}, {}, {}", t[0], t[1], t[2], t[3]), fc);
472// }
473//};
474//#endif
475}
编码转换
日志系统
范围操作
通用类型定义
Definition: dl_array2.h:17
T r_insert_per_num(const T &container, V v, size_t per_num)
从后面往前,隔n个元素就插入1个值,首尾不会出现分割符
Definition: dl_algorithm.h:261
std::string to_string(const SpriteID &id)
Definition: dl_sprite.h:50
void split_sub(const T &container, const T &delimiter, std::vector< T > &ret)
以 子串 分割 容器
Definition: dl_algorithm.h:394
std::array< int, 2 > Point2
Definition: dl_type_def.h:20
constexpr std::array< Point::value_type, N > toPoint(const std::array< T, N > &a)
void split(const T &container, V delimiter, std::vector< T > &ret)
以 元素 分割 容器
Definition: dl_algorithm.h:299
constexpr std::array< T, N > operator+(const std::array< T, N > &a, const std::array< T, N > &b)
Definition: dl_type_op.h:29
constexpr std::array< T, N > & operator+=(std::array< T, N > &a, const std::array< T, N > &b)
Definition: dl_type_op.h:21
void log_err0(std::string_view str, const std::source_location location=std::source_location::current())