24#if (DL_PLATFORM == DL_PLATFORM_WIN32)
41 template<
typename T,
size_t N>
44 for (
size_t i = 0; i <
N; ++i)
46 container[i] = (std::numeric_limits<T>::min)();
49 template<
typename T,
size_t N>
52 for (
size_t i = 0; i <
N; ++i)
54 container[i] = (std::numeric_limits<T>::max)();
76 return x < a || b < x;
89 for (
T i = 0; i < n; ++i)
95constexpr uint64_t
Pow64(uint64_t x, uint8_t n)
98 for (uint8_t i = 0; i < n; ++i)
104constexpr uint32_t
Pow32(uint32_t x, uint8_t n)
107 for (uint8_t i = 0; i < n; ++i)
118 Pow64(2,0),
Pow64(2,1),
Pow64(2,2),
Pow64(2,3),
Pow64(2,4),
Pow64(2,5),
Pow64(2,6),
Pow64(2,7),
119 Pow64(2,8),
Pow64(2,9),
Pow64(2,10),
Pow64(2,11),
Pow64(2,12),
Pow64(2,13),
Pow64(2,14),
Pow64(2,15),
120 Pow64(2,16),
Pow64(2,17),
Pow64(2,18),
Pow64(2,19),
Pow64(2,20),
Pow64(2,21),
Pow64(2,22),
Pow64(2,23),
121 Pow64(2,24),
Pow64(2,25),
Pow64(2,26),
Pow64(2,27),
Pow64(2,28),
Pow64(2,29),
Pow64(2,30),
Pow64(2,31),
122 Pow64(2,32),
Pow64(2,33),
Pow64(2,34),
Pow64(2,35),
Pow64(2,36),
Pow64(2,37),
Pow64(2,38),
Pow64(2,39),
123 Pow64(2,40),
Pow64(2,41),
Pow64(2,42),
Pow64(2,43),
Pow64(2,44),
Pow64(2,45),
Pow64(2,46),
Pow64(2,47),
124 Pow64(2,48),
Pow64(2,49),
Pow64(2,50),
Pow64(2,51),
Pow64(2,52),
Pow64(2,53),
Pow64(2,54),
Pow64(2,55),
125 Pow64(2,56),
Pow64(2,57),
Pow64(2,58),
Pow64(2,59),
Pow64(2,60),
Pow64(2,61),
Pow64(2,62),
Pow64(2,63) };
127 Pow32(2,0),
Pow32(2,1),
Pow32(2,2),
Pow32(2,3),
Pow32(2,4),
Pow32(2,5),
Pow32(2,6),
Pow32(2,7),
128 Pow32(2,8),
Pow32(2,9),
Pow32(2,10),
Pow32(2,11),
Pow32(2,12),
Pow32(2,13),
Pow32(2,14),
Pow32(2,15),
129 Pow32(2,16),
Pow32(2,17),
Pow32(2,18),
Pow32(2,19),
Pow32(2,20),
Pow32(2,21),
Pow32(2,22),
Pow32(2,23),
130 Pow32(2,24),
Pow32(2,25),
Pow32(2,26),
Pow32(2,27),
Pow32(2,28),
Pow32(2,29),
Pow32(2,30),
Pow32(2,31) };
137#define DND_ARRAY_POW_LINE(index) if (x <= ARRAY_POW2[index])return ARRAY_POW2[index]
149 log(
"数值过大,超过2^63:" + std::to_string(x));
152#define DND_ARRAY_POW_LINE_32(index) if (x <= ARRAY_POW2_32[index])return ARRAY_POW2_32[index]
160 log(
"数值过大,超过2^31:" + std::to_string(x));
171#if (DL_PLATFORM == DL_PLATFORM_WIN32)
172 return std::bit_ceil(x);
189 const float threehalfs = 1.5f;
194 i = 0x5f3759df - (i >> 1);
196 y = y * (threehalfs - (x2 * y * y));
208 for (
size_t i = 0; i <
N; ++i)
210 length += (v[i] * v[i]);
213 length =
RSqrt(length);
214 for (
size_t i = 0; i <
N; ++i)
228 return a[0] * a[0] + a[1] * a[1];
234 return a[0] * a[0] + a[1] * a[1] + a[2] * a[2];
240 return a[0] * a[0] + a[1] * a[1] + a[2] * a[2] + a[3] * a[3];
257template <IsUn
signed T0, IsSigned T1>
263 return nag_b < a ? a - nag_b : 0;
268template <IsUn
signed T0, IsSigned T1,
size_t N>
271 for (
size_t i = 0; i <
N; ++i)
272 a[i] =
AddU(a[i], b[i]);
275template <IsUn
signed T0, IsSigned T1,
size_t N>
280 for (
size_t i = 0; i <
N; ++i)
287template <IsUn
signed T0, IsSigned T1>
301template <IsUn
signed T0, IsSigned T1,
size_t N>
304 for (
size_t i = 0; i <
N; ++i)
315template <IsUn
signed T>
318 return a > b ? a - b : 0;
323template <IsUn
signed T0, IsSigned T1>
328 return SubU(a, (T0)b);
333template <IsUn
signed T,
size_t N>
337 for (
size_t i = 0; i <
N; ++i)
338 ret[i] =
SubU(a[i], b[i]);
344template <IsUn
signed T0, IsSigned T1,
size_t N>
348 for (
size_t i = 0; i <
N; ++i)
349 ret[i] =
SubU(a[i], b[i]);
356template <IsUn
signed T>
359 return a < b ? b - a : a - b;
365template <IsUn
signed T,
size_t N>
369 for (
size_t i = 0; i <
N; ++i)
370 ret[i] =
DisU(a[i], b[i]);
379template <IsUn
signed T>
382 unsigned dx =
DisU(a[0], b[0]);
383 unsigned dy =
DisU(a[1], b[1]);
384 return dx * dx + dy * dy;
386template <IsUn
signed T>
394template <IsSigned T,
size_t N>
398 length = sqrt(length);
403template <IsSigned T,
size_t N>
429constexpr double PI(
unsigned n = 1,
unsigned d = 1)
432 return std::numbers::pi * n / d;
434 return 3.1415926535897932384626433832795 * n / d;
524template<IsUn
signed T>
542 return x && !(x & (x - 1));
554 return (x + align - 1) & ~(align - 1);
566 return r >= (d >> 1) ? q + 1 : q;
577 return (n + (d >> 1)) / d;
591constexpr float OffsetOrder(
float order,
int u = 1,
int v = 0,
int w = 0)
593 constexpr int NUM_ORDER_DT = 100;
594 float ret = order + (w + v * NUM_ORDER_DT + u * NUM_ORDER_DT * NUM_ORDER_DT)
595 * std::numeric_limits<float>::epsilon();
598 log_(
"order超出范围:{}", ret);
608 return a[0] * b[1] - a[1] * b[0];
614 a[1] * b[2] - b[1] * a[2],
615 a[2] * b[0] - b[2] * a[0],
616 a[0] * b[1] - b[0] * a[1]
623template<
typename T,
size_t N>
627 for (
size_t i = 0; i <
N; ++i)
703 if (list_pos.size() < 3)
705 auto iter_last = list_pos.end();
707 for (
auto iter_0 = list_pos.begin(); iter_0 != iter_last;)
710 auto iter_0_next = iter_0;
714 for (
auto iter_1 = iter_last; iter_1 != iter_0_next; --iter_1)
716 if (func_pass(*iter_0, *iter_1))
718 for (
auto iter = iter_0_next; iter != iter_1;)
719 iter = list_pos.erase(iter);
738 return quad[2] - quad[0];
748 return { quad[0], quad[1], quad[2] };
753 return { quad[0], quad[2], quad[3] };
764 return rect[0] <= rect[2]
765 && rect[1] <= rect[3];
774 return rect[0] == rect[2]
775 && rect[1] == rect[3];
789 && rect[2] <= size[0]
790 && rect[3] <= size[1];
800 return unsigned(xy[0]) < size[0]
801 && unsigned(xy[1]) < size[1];
810 return xy[0] >= rect[0]
821 Position ab = triangle[0] - triangle[1];
822 Position ac = triangle[0] - triangle[2];
842 return t1 * t2 >= 0 &&
#define DND_ARRAY_POW_LINE_32(index)
#define DND_ARRAY_POW_LINE(index)
向上取2的幂次
constexpr bool Less(const Array< T, N > &a, const Array< T, N > &b)
每个元素都小于返回真
T SubU(T a, T b)
无符号类型相减,负数转为0
constexpr unsigned IsPow2(unsigned x)
是否2的幂
std::vector< Point > DrawLineOrth(const Point &p0, const Point &p1)
正交 画线算法
constexpr bool IsXyInRect(const Point &xy, const Rect &rect)
判断 点是否在矩形内
constexpr uint64_t Pow64(uint64_t x, uint8_t n)
T DistancePow2U(const Array< T, 2 > &a, const Array< T, 2 > &b)
返回 距离的平方
constexpr bool IsOutRange(T x, T a, T b)
判断数值是否越界(前闭后开)
constexpr T Align(T x, T align)
对齐align的倍数
constexpr Float CrossProduct(const Position2 &a, const Position2 &b)
叉乘
constexpr bool IsTriangle(const Triangle &triangle)
判断是否三角形
constexpr unsigned AlignPow2(unsigned x, unsigned align)
对齐align的倍数
constexpr Position CreatePositionByRatioGoldW(Float w)
判断点是否在凸四边形内
constexpr float OffsetOrder(float order, int u=1, int v=0, int w=0)
偏移order
std::vector< Point > DrawLineLerp(const Point &p0, const Point &p1)
线性插值 画线算法
void MergePathDirect(std::list< Point > &list_pos, F func_pass)
路径合并(网格路径)
constexpr uint32_t ARRAY_POW2_32[]
constexpr T AlignF(T x, T align)
RGP资源下标转方向
std::vector< PointU > GetCircle(const Size &size, const PointU &xy, unsigned rad)
返回圆形范围的节点,考虑越界
constexpr unsigned div_found(unsigned n, unsigned d)
无符号除法,返回四舍五入结果
constexpr bool IsRectEmpty(const Array< T, 4 > &rect)
判断 矩形 是否空
constexpr bool IsXyInSize(const Point &xy, const Size &size)
判断 点是否在大小内
constexpr T GetQuadSize(const Array< T, 4 > &quad)
返回 Quad 的大小
constexpr uint32_t Pow32(uint32_t x, uint8_t n)
constexpr T Pow(T x, T n)
返回x的n次方
bool AddUCheck(T0 a, T1 b, T0 &ret)
无符号 加 有符号,检查负数
std::vector< Point > DrawLineCover(const Point &p0, const Point &p1)
覆盖 画线算法
void Normalize(Array< T, N > &v)
向量单位化
constexpr unsigned div_found_fast(unsigned n, unsigned d)
无符号除法,返回四舍五入结果
constexpr Array< T, 3 > GetQuadTriangle0(const Array< T, 4 > &quad)
返回 Quad的三角形
Position4 Slerp(const Position4 &q0, const Position4 &q1, const Float &t)
球面线性插值
constexpr double PI(unsigned n=1, unsigned d=1)
返回PI的分数
void MergePath(std::list< Point > &list_pos)
路径合并(网格路径)
float RSqrt(float x)
返回平方根的倒数
T DisU(T a, T b)
返回无符号类型的差值
void NormalizeFast(Array< float, N > &v)
向量单位化,精度低速度快
constexpr uint64_t ARRAY_POW2[]
2的整数次幂列表
T DistancePow2(const Array< T, 2 > &a)
返回 向量 距离的平方
std::vector< Point > DrawLineBresenham(const Point &p0, const Point &p1)
bresenham 画线算法
constexpr auto DistanceDiagonal(const C &p0, const C &p1)
纹理区域转uv
constexpr T DotProduct(const Array< T, N > &a, const Array< T, N > &b)
点乘
constexpr bool IsDotInQuad(const Position &dot, const Quad &quad)
判断点是否在四边形内(包含边)
constexpr uint64_t CeilToPow2(uint64_t &&x)
constexpr Array< T, 3 > GetQuadTriangle1(const Array< T, 4 > &quad)
T DistanceU(const Array< T, 2 > &a, const Array< T, 2 > &b)
constexpr bool IsRectValid(const Array< T, 4 > &rect)
判断 矩形 是否有效
constexpr bool IsRectInSize(const Array< T, 4 > &rect, const Size &size)
判断 矩形 在 大小 内,首先它必须是有效的矩形
T0 AddU(T0 a, T1 b)
无符号 加 有符号,防止小于0
constexpr bool IsDotInTriangle(const Position &dot, const Triangle &triangle)
判断点是否在三角形内(包含边)
constexpr Float EULER
自然常数
constexpr Float EARTH_fADIUS
地球半径km
constexpr Float GRAVITY
地球重力加速度(赤道最小)
constexpr Float RATIO_GOLD
黄金比例
void Min(Array< T, N > &container)
返回的是最小正数(假设有符号)
void Max(Array< T, N > &container)
constexpr auto Max(const C &container)
返回容器最大值
Array< Float, 2 > Position2
constexpr T is_saturate(const T &x)
是否数值在[0, 1]
Array< Position, 3 > Triangle
void log(std::string_view str, const std::source_location location=std::source_location::current())
以当前设置输出
Array< Float, 3 > Position3
Array< Float, 4 > Position4
constexpr T saturate(const T &x)
限制数值到 [0, 1]
Array< Position, 4 > Quad