22template<
typename T,
size_t N>
23std::array<T, N>
Min(
const std::array<T, N>& a,
const std::array<T, N>& b)
26 for (
size_t i = 0; i <
N; ++i)
28 ret[i] = (std::min)(a[i], b[i]);
37template<
typename T,
size_t N>
38std::array<T, N>
Max(
const std::array<T, N>& a,
const std::array<T, N>& b)
41 for (
size_t i = 0; i <
N; ++i)
43 ret[i] = (std::max)(a[i], b[i]);
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)
56 for (
size_t i = 0; i <
N; ++i)
60 else if (a[i] >= c[i])
72template<
typename T,
size_t N>
73constexpr bool Less(
const std::array<T, N>& a,
const std::array<T, N>& b)
75 for (
size_t i = 0; i <
N; ++i)
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)
92 for (
size_t i = 0; i <
N; ++i)
94 ret[i] = std::lerp(a[i], b[i], t);
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))
109 std::array<T, N> ret;
110 for (
size_t i = 0; i <
N; ++i)
112 ret[i] = (
T)func(std::lerp((
R)a[i], (
R)b[i], t));
120template<
typename T,
size_t N>
121std::array<T, N>
FMod(
const std::array<T, N>& a,
const std::array<T, N>& b)
123 std::array<T, N> ret;
124 for (
size_t i = 0; i <
N; ++i)
126 ret[i] = std::fmod(a[i], b[i]);
137template<
typename C0,
typename C1,
typename F>
138bool Yes(
const C0& container0,
const C1& container1,
F func)
140 if (container0.size() != container1.size())
142 auto iter0 = container0.begin();
143 auto iter1 = container1.begin();
144 while (iter0 != container0.end())
146 if (!func(*iter0, *iter1))
160template<
typename C0,
typename C1>
163 tar.resize(src.size());
164 auto iter0 = src.begin();
165 auto iter1 = tar.begin();
166 while (iter0 != src.end())
178template<
typename C0,
typename C1>
179void Copy(C1& tar,
const C0& src)
181 std::size_t num = (std::min)(tar.size(), src.size());
182 auto iter0 = src.begin();
183 auto iter1 = tar.begin();
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)
判断两个容器 每个元素都满足条件