dl
dl_range_each.h
浏览该文件的文档.
1
12#pragma once
13
14#include "dl_concept.h"
15
16namespace dl::Each
17{
22template<typename T, size_t N>
23std::array<T, N> Min(const std::array<T, N>& a, const std::array<T, N>& b)
24{
25 std::array<T, N> ret;
26 for (size_t i = 0; i < N; ++i)
27 {
28 ret[i] = (std::min)(a[i], b[i]);
29 }
30 return ret;
31}
32
37template<typename T, size_t N>
38std::array<T, N> Max(const std::array<T, N>& a, const std::array<T, N>& b)
39{
40 std::array<T, N> ret;
41 for (size_t i = 0; i < N; ++i)
42 {
43 ret[i] = (std::max)(a[i], b[i]);
44 }
45 return ret;
46}
47
52template<IsInteger T, size_t N>
53std::array<T, N> Limit(const std::array<T, N>& a, const std::array<T, N>& b, const std::array<T, N>& c)
54{
55 std::array<T, N> ret;
56 for (size_t i = 0; i < N; ++i)
57 {
58 if (a[i] < b[i])
59 ret[i] = b[i];
60 else if (a[i] >= c[i])
61 ret[i] = c[i] - 1;
62 else
63 ret[i] = a[i];
64 }
65 return ret;
66}
67
72template<typename T, size_t N>
73constexpr bool Less(const std::array<T, N>& a, const std::array<T, N>& b)
74{
75 for (size_t i = 0; i < N; ++i)
76 {
77 if (!(a[i] < b[i]))
78 return false;
79 }
80 return true;
81}
82
88template<IsReal T, size_t N>
89std::array<T, N> Lerp(const std::array<T, N>& a, const std::array<T, N>& b, T t)
90{
91 std::array<T, N> ret;
92 for (size_t i = 0; i < N; ++i)
93 {
94 ret[i] = std::lerp(a[i], b[i], t);
95 }
96 return ret;
97}
98
106template<typename T, size_t N, IsReal R>
107std::array<T, N> Lerp(const std::array<T, N>& a, const std::array<T, N>& b, R t, R(*func)(R))
108{
109 std::array<T, N> ret;
110 for (size_t i = 0; i < N; ++i)
111 {
112 ret[i] = (T)func(std::lerp((R)a[i], (R)b[i], t));
113 }
114 return ret;
115}
116
120template<typename T, size_t N>
121std::array<T, N> FMod(const std::array<T, N>& a, const std::array<T, N>& b)
122{
123 std::array<T, N> ret;
124 for (size_t i = 0; i < N; ++i)
125 {
126 ret[i] = std::fmod(a[i], b[i]);
127 }
128 return ret;
129}
130
137template<typename C0, typename C1, typename F>
138bool Yes(const C0& container0, const C1& container1, F func)
139{
140 if (container0.size() != container1.size())
141 return false;
142 auto iter0 = container0.begin();
143 auto iter1 = container1.begin();
144 while (iter0 != container0.end())
145 {
146 if (!func(*iter0, *iter1))
147 return false;
148 ++iter0;
149 ++iter1;
150 }
151 return true;
152}
153
160template<typename C0, typename C1>
161void Clone(C1& tar, const C0& src)
162{
163 tar.resize(src.size());
164 auto iter0 = src.begin();
165 auto iter1 = tar.begin();
166 while (iter0 != src.end())
167 {
168 *iter1++ = *iter0++;
169 }
170}
171
178template<typename C0, typename C1>
179void Copy(C1& tar, const C0& src)
180{
181 std::size_t num = (std::min)(tar.size(), src.size());
182 auto iter0 = src.begin();
183 auto iter1 = tar.begin();
184 while (num--)
185 {
186 *iter1++ = *iter0++;
187 }
188}
189
190
191}
用于模板限定,更好的报错信息
std::array< T, N > Limit(const std::array< T, N > &a, const std::array< T, N > &b, const std::array< T, N > &c)
限制元素到 前闭后开区间(过大自动减1)
std::array< T, N > Lerp(const std::array< T, N > &a, const std::array< T, N > &b, T t)
线性插值
void Clone(C1 &tar, const C0 &src)
克隆容器到另一个
std::array< T, N > Max(const std::array< T, N > &a, const std::array< T, N > &b)
取两者最大值为新元素
std::array< T, N > FMod(const std::array< T, N > &a, const std::array< T, N > &b)
浮点数求模
void Copy(C1 &tar, const C0 &src)
复制容器
constexpr bool Less(const std::array< T, N > &a, const std::array< T, N > &b)
每个元素都小于返回真
std::array< T, N > Min(const std::array< T, N > &a, const std::array< T, N > &b)
取两者最小值为新元素
bool Yes(const C0 &container0, const C1 &container1, F func)
判断两个容器 每个元素都满足条件