29 return std::clamp<T>(x, 0, 1);
38 return x >= 0 && x <= 1;
45constexpr std::array<T, 3>
cross(
const std::array<T, 3>& a,
const std::array<T, 3>& b)
48 a[1] * b[2] - a[2] * b[1],
49 a[2] * b[0] - a[0] * b[2],
50 a[0] * b[1] - a[1] * b[0] };
63 return dynamic_cast<T>(p);
70template<
typename T,
size_t N>
71bool limit_bigger(std::array<T, N>& a,
const std::array<T, N>& limit)
74 for (
int i = 0; i !=
N; ++i)
94template<
typename T,
typename V>
97 auto iter = find(container.rbegin(), container.rend(), a);
99 if (iter != container.rend())
100 container.erase(container.begin(), iter.base());
111template<PopFrontAble C,
typename F>
114 while (!container.empty())
116 auto iter = container.front();
117 container.pop_front();
212 for (
auto iter = container.begin(); iter != container.end(); ++iter)
216 for (; iter1 < container.end(); ++iter1)
222 return container.end();
230template<
typename T,
typename V>
233 if (container.size() <= per_num)
236 size_t num = (container.size() - 1) / per_num;
238 ret.resize(num + container.size());
241 auto iter = container.begin();
242 auto iter_ret = ret.begin();
243 while (iter != container.end())
245 *iter_ret++ = *iter++;
249 && i < container.size())
260template<
typename T,
typename V>
263 if (container.size() <= per_num)
266 size_t num = (container.size() - 1) / per_num;
268 ret.resize(num + container.size());
271 auto iter = container.rbegin();
272 auto iter_ret = ret.rbegin();
273 while (iter != container.rend())
275 *iter_ret++ = *iter++;
279 && i < container.size())
298template<
typename T,
typename V>
299void split(
const T& container,
V delimiter, std::vector<T>& ret)
301 if (container.empty())
return;
304 auto iter_begin = container.begin();
309 if (*iter_begin == delimiter)
312 if (++iter_begin == container.end())
321 auto iter_find = find(iter_begin, container.end(), delimiter);
323 if (iter_find == container.end())
325 ret.push_back(
T(iter_begin, container.end()));
330 ret.push_back(
T(iter_begin, iter_find));
331 iter_begin = iter_find + 1;
332 if (iter_begin == container.end())
334 ret.push_back(
T(iter_begin, container.end()));
354template<
typename T,
typename V>
357 if (container.empty())
return;
360 auto iter_begin = container.begin();
365 if (*iter_begin == delimiter)
367 if (++iter_begin == container.end())
373 auto iter_find = find(iter_begin, container.end(), delimiter);
375 if (iter_find == container.end())
377 ret.push_back(
T(iter_begin, container.end()));
382 ret.push_back(
T(iter_begin, iter_find));
383 iter_begin = iter_find + 1;
384 if (iter_begin == container.end())
401void split_sub(
const T& container,
const T& delimiter, std::vector<T>& ret)
403 if (container.empty())
405 assert(!delimiter.empty());
407 auto iter_pre = container.begin();
408 auto iter_d = delimiter.begin();
411 auto iter_cur = iter_pre;
413 auto iter_cat = iter_pre;
419 if (*iter_cur == *iter_d)
430 if (iter_cur == container.end())
432 ret.push_back(
T(iter_pre, iter_cur));
439 if (iter_d == delimiter.end())
441 ret.push_back(
T(iter_pre, iter_cat));
443 iter_d = delimiter.begin();
448 if (iter_cur == container.end())
450 ret.push_back(
T(iter_pre, iter_cur));
454 if (*iter_cur == *iter_d)
463 iter_d = delimiter.begin();
475template<
typename T,
typename V>
476void make_sequence(
T& c,
const std::initializer_list<std::initializer_list<V>>& vec)
478 for (
auto& iter : vec)
480 assert(iter.size() == 2);
482 const V& b = *(iter.begin() + 1);
499template<
typename C,
typename F>
502 if (container.empty())
507 auto iter_pre = begin(container);
508 auto iter_cur = iter_pre + 1;
510 for (; iter_cur != end(container);)
512 func(*iter_pre, *iter_cur);
517 func(*iter_pre, *begin(container));
528template<IsPo
inter T,
typename FC,
typename F>
536 T node_this = s.top();
541 using C =
decltype(func_child(node_this));
542 C c = func_child(node_this);
543 for (
auto iter = c->rbegin(); iter != c->rend(); ++iter)
558 finally(
F&& func) : _func(func) {}
579template<
typename T,
size_t N>
611 static_assert(
N > 0 &&
N <= 11,
"字符串长度过长!");
613 for (
size_t i = 0; i <
N - 1; ++i)
617 if (ch >= 48 && ch <= 57)
619 else if (ch >= 65 && ch <= 90)
621 else if (ch >= 97 && ch <= 122)
628 assert(0 &&
"只能是字母、数字、下划线、点!");
630 ret |= ((uint64_t)ch << (i * 6));
T r_insert_per_num(const T &container, V v, size_t per_num)
从后面往前,隔n个元素就插入1个值,首尾不会出现分割符
void split_no_empty(const T &container, V delimiter, std::vector< T > &ret)
以 元素 分割 容器
void for_couple(const C &container, F func, bool ring=false)
成对遍历
constexpr std::array< T, 3 > cross(const std::array< T, 3 > &a, const std::array< T, 3 > &b)
向量叉乘
void for_tree(T root, FC func_child, F func)
遍历树(使用栈,深度优先)
T cast_dynamic(void *p)
动态类型强转
void split_sub(const T &container, const T &delimiter, std::vector< T > &ret)
以 子串 分割 容器
constexpr T is_saturate(const T &x)
是否数值在[0, 1]
void make_sequence(T &c, const std::initializer_list< std::initializer_list< V > > &vec)
生成序列
void split(const T &container, V delimiter, std::vector< T > &ret)
以 元素 分割 容器
void operate_front(C &container, F func)
从容器container不断取出第一个元素,执行操作
bool limit_bigger(std::array< T, N > &a, const std::array< T, N > &limit)
限制到大于某个值,如果修改了原值则返回true
const T & constant(T &v)
加上const修饰
constexpr T sign(const T &v)
返回符号,正数返回1、负数返回-1、0返回0
consteval uint64_t str_uid(const char(&str)[N])
固定条件的字符串,生成唯一id
T insert_per_num(const T &container, V v, size_t per_num)
隔n个元素就插入1个分割符,首尾不会出现分割符
constexpr T saturate(const T &x)
限制数值到 [0, 1]
void erase_head_from_last(T &container, const V &a)
从容器container中移除 最后 匹配到的a元素 之前(包含a)的所有元素,如果没有匹配到,则什么都不做。
auto find_equal(C &container)
替换容器元素值
constexpr T & arr_last(const T(&arr)[N])
返回静态数组长度