Files
spdlog/include/spdlog/details/fmt_helper.h

141 lines
3.1 KiB
C
Raw Normal View History

2018-06-15 14:15:35 +03:00
//
// Created by gabi on 6/15/18.
//
#pragma once
// Some fmt helpers to efficiently format and pad ints and strings
namespace spdlog {
namespace details {
namespace fmt_helper {
2018-07-09 21:07:44 +03:00
template <size_t Buffer_Size>
inline void append_str(const std::string &str, fmt::basic_memory_buffer<char, Buffer_Size> &dest)
2018-06-15 14:15:35 +03:00
{
auto *str_ptr = str.data();
2018-06-15 14:15:35 +03:00
dest.append(str_ptr, str_ptr + str.size());
}
2018-07-09 21:07:44 +03:00
template <size_t Buffer_Size>
inline void append_c_str(const char *c_str, fmt::basic_memory_buffer<char, Buffer_Size> &dest)
2018-06-24 01:32:39 +03:00
{
2018-06-26 02:32:19 +03:00
char ch;
while ((ch = *c_str) != '\0')
{
dest.push_back(ch);
++c_str;
}
2018-06-24 01:32:39 +03:00
}
2018-07-09 21:07:44 +03:00
template<size_t Buffer_Size1, size_t Buffer_Size2>
inline void append_buf(const fmt::basic_memory_buffer<char, Buffer_Size1> &buf, fmt::basic_memory_buffer<char, Buffer_Size2> &dest)
2018-06-15 14:15:35 +03:00
{
2018-07-04 00:38:23 +03:00
auto *buf_ptr = buf.data();
2018-06-15 14:15:35 +03:00
dest.append(buf_ptr, buf_ptr + buf.size());
}
2018-07-09 21:07:44 +03:00
template<typename T, size_t Buffer_Size>
inline void append_int(T n, fmt::basic_memory_buffer<char, Buffer_Size> &dest)
2018-06-15 14:15:35 +03:00
{
fmt::format_int i(n);
dest.append(i.data(), i.data() + i.size());
}
2018-07-09 21:07:44 +03:00
template <size_t Buffer_Size>
inline void pad2(int n, fmt::basic_memory_buffer<char, Buffer_Size> &dest)
2018-06-15 14:15:35 +03:00
{
2018-06-26 02:00:33 +03:00
if (n > 99)
2018-06-15 14:15:35 +03:00
{
append_int(n, dest);
return;
}
2018-06-26 02:00:33 +03:00
if (n > 9) // 10-99
{
dest.push_back('0' + (n / 10));
dest.push_back('0' + (n % 10));
return;
}
2018-06-15 14:15:35 +03:00
if (n >= 0) // 0-9
{
dest.push_back('0');
2018-06-26 02:00:33 +03:00
dest.push_back('0' + n);
2018-06-15 14:15:35 +03:00
return;
}
2018-06-26 02:00:33 +03:00
// negatives (unlikely, but just in case, let fmt deal with it)
2018-06-15 14:15:35 +03:00
fmt::format_to(dest, "{:02}", n);
}
2018-07-09 21:07:44 +03:00
template <size_t Buffer_Size>
inline void pad3(int n, fmt::basic_memory_buffer<char, Buffer_Size> &dest)
2018-06-15 14:15:35 +03:00
{
if (n > 99)
{
append_int(n, dest);
return;
}
if (n > 9) // 10-99
{
dest.push_back('0');
2018-06-26 02:00:33 +03:00
dest.push_back('0' + n / 10);
dest.push_back('0' + n % 10);
2018-06-15 14:15:35 +03:00
return;
}
2018-06-26 02:00:33 +03:00
if (n >= 0)
2018-06-15 14:15:35 +03:00
{
dest.push_back('0');
dest.push_back('0');
2018-06-26 02:00:33 +03:00
dest.push_back('0' + n);
2018-06-15 14:15:35 +03:00
return;
}
2018-06-26 02:00:33 +03:00
// negatives (unlikely, but just in case let fmt deal with it)
fmt::format_to(dest, "{:03}", n);
2018-06-15 14:15:35 +03:00
}
2018-07-09 21:07:44 +03:00
template <size_t Buffer_Size>
inline void pad6(size_t n, fmt::basic_memory_buffer<char, Buffer_Size> &dest)
2018-07-04 01:41:05 +03:00
{
2018-07-07 14:04:31 +03:00
// todo: maybe replace this implementation with
// pad3(n / 1000, dest);
// pad3(n % 1000, dest);
2018-07-04 01:41:05 +03:00
if (n > 99999)
{
append_int(n, dest);
return;
}
if (n > 9999)
{
dest.push_back('0');
}
else if (n > 999)
{
dest.push_back('0');
dest.push_back('0');
}
else if (n > 99)
{
dest.push_back('0');
dest.push_back('0');
dest.push_back('0');
}
else if (n > 9)
{
dest.push_back('0');
dest.push_back('0');
dest.push_back('0');
dest.push_back('0');
}
2018-07-05 12:57:14 +03:00
else // 0-9
2018-07-04 01:41:05 +03:00
{
dest.push_back('0');
dest.push_back('0');
dest.push_back('0');
dest.push_back('0');
dest.push_back('0');
2018-07-07 13:22:43 +03:00
}
2018-07-04 01:41:05 +03:00
append_int(n, dest);
}
2018-06-15 14:15:35 +03:00
} // namespace fmt_helper
} // namespace details
} // namespace spdlog