31 return std::clamp<T>(x, 0, 1);
40 return x >= 0 && x <= 1;
50 a[1] * b[2] - a[2] * b[1],
51 a[2] * b[0] - a[0] * b[2],
52 a[0] * b[1] - a[1] * b[0] };
65 return dynamic_cast<T>(p);
72template<
typename T,
size_t N>
76 for (
int i = 0; i !=
N; ++i)
90#if DL_PLATFORM == DL_PLATFORM_WIN32
91 return std::as_const(a);
105template<
typename T,
typename V>
108 auto iter = find(container.rbegin(), container.rend(), a);
110 if (iter != container.rend())
111 container.erase(container.begin(), iter.base());
122template<PopFrontAble C,
typename F>
125 while (!container.empty())
127 auto iter = container.front();
128 container.pop_front();
223 for (
auto iter = container.begin(); iter != container.end(); ++iter)
227 for (; iter1 < container.end(); ++iter1)
233 return container.end();
241template<
typename T,
typename V>
244 if (container.size() <= per_num)
247 size_t num = (container.size() - 1) / per_num;
249 ret.resize(num + container.size());
252 auto iter = container.begin();
253 auto iter_ret = ret.begin();
254 while (iter != container.end())
256 *iter_ret++ = *iter++;
260 && i < container.size())
272template<
typename T,
typename V>
275 if (container.size() <= per_num)
278 size_t num = (container.size() - 1) / per_num;
280 ret.resize(num + container.size());
283 auto iter = container.rbegin();
284 auto iter_ret = ret.rbegin();
285 while (iter != container.rend())
287 *iter_ret++ = *iter++;
291 && i < container.size())
312template<
typename T,
typename V>
313void split(
const T& container,
V delimiter, std::vector<T>& ret)
315 if (container.empty())
319 auto iter_begin = container.begin();
324 if (*iter_begin == delimiter)
327 if (++iter_begin == container.end())
336 auto iter_find = std::find(iter_begin, container.end(), delimiter);
338 if (iter_find == container.end())
340 ret.push_back(
T(iter_begin, container.end()));
345 ret.push_back(
T(iter_begin, iter_find));
346 iter_begin = iter_find + 1;
347 if (iter_begin == container.end())
349 ret.push_back(
T(iter_begin, container.end()));
369template<
typename T,
typename V>
372 if (container.empty())
376 auto iter_begin = container.begin();
381 if (*iter_begin == delimiter)
383 if (++iter_begin == container.end())
389 auto iter_find = find(iter_begin, container.end(), delimiter);
391 if (iter_find == container.end())
393 ret.push_back(
T(iter_begin, container.end()));
398 ret.push_back(
T(iter_begin, iter_find));
399 iter_begin = iter_find + 1;
400 if (iter_begin == container.end())
417void split_sub(
const T& container,
const T& delimiter, std::vector<T>& ret)
419 if (container.empty())
421 assert(!delimiter.empty());
423 auto iter_pre = container.begin();
424 auto iter_d = delimiter.begin();
427 auto iter_cur = iter_pre;
429 auto iter_cat = iter_pre;
435 if (*iter_cur == *iter_d)
446 if (iter_cur == container.end())
448 ret.push_back(
T(iter_pre, iter_cur));
455 if (iter_d == delimiter.end())
457 ret.push_back(
T(iter_pre, iter_cat));
459 iter_d = delimiter.begin();
464 if (iter_cur == container.end())
466 ret.push_back(
T(iter_pre, iter_cur));
470 if (*iter_cur == *iter_d)
479 iter_d = delimiter.begin();
491template<
typename T,
typename V>
492void make_sequence(
T& c,
const std::initializer_list<std::initializer_list<V>>& vec)
494 for (
auto& iter : vec)
496 assert(iter.size() == 2);
498 const V& b = *(iter.begin() + 1);
515template<
typename C,
typename F>
518 if (container.empty())
523 auto iter_pre = std::begin(container);
524 auto iter_cur = std::next(iter_pre);
526 for (; iter_cur != std::end(container);)
528 func(*iter_pre, *iter_cur);
533 func(*iter_pre, *std::begin(container));
540template<
typename C,
typename F>
543 if (container.empty())
548 auto iter_pre = std::rbegin(container);
549 auto iter_cur = std::next(iter_pre);
551 for (; iter_cur != std::rend(container);)
553 func(*iter_pre, *iter_cur);
558 func(*iter_pre, *std::rbegin(container));
569template<IsPo
inter T,
typename FC,
typename F>
577 T node_this = s.top();
582 using C =
decltype(func_child(node_this));
583 C c = func_child(node_this);
584 for (
auto iter = c->rbegin(); iter != c->rend(); ++iter)
599 finally(
F&& func) : _func(func) {}
620template<
typename T,
size_t N>
652 static_assert(
N > 0 &&
N <= 11,
"字符串长度过长!");
654 for (
size_t i = 0; i <
N - 1; ++i)
658 if (ch >= 48 && ch <= 57)
660 else if (ch >= 65 && ch <= 90)
662 else if (ch >= 97 && ch <= 122)
669 assert(0 &&
"只能是字母、数字、下划线、点!");
671 ret |= ((uint64_t)ch << (i * 6));
类似std::array,增加xyzw、wh等成员访问
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)
以 元素 分割 容器
bool limit_bigger(Array< T, N > &a, const Array< T, N > &limit)
限制到大于某个值,如果修改了原值则返回true
void for_couple(const C &container, F func, bool ring=false)
成对遍历
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 for_couple_r(const C &container, F func, bool ring=false)
反向成对遍历
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不断取出第一个元素,执行操作
const T & constant(T &v)
加上const修饰
constexpr Array< T, 3 > cross(const Array< T, 3 > &a, const Array< T, 3 > &b)
向量叉乘
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])
返回静态数组长度