-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathvecops.hpp
187 lines (159 loc) · 5.34 KB
/
vecops.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
// Copyright (c) 2020 Elijah Seed Arita
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#pragma once
#include "vec.hpp"
namespace esd::math {
// -- SPECIAL FLOATING POINT VALUES -- //
// Check if all components are infinity
template <std::size_t L, AnyFloat T>
constexpr bool allinf(const Vec<L, T>& v) {
for (std::size_t i = 0; i < L; i++) if (!isinf(v[i])) return false;
return true;
}
// Check if any components are infinity
template <std::size_t L, AnyFloat T>
constexpr bool anyinf(const Vec<L, T>& v) {
for (std::size_t i = 0; i < L; i++) if (isinf(v[i])) return true;
return false;
}
// Check if all components are NaN
template <std::size_t L, AnyFloat T>
constexpr bool allnan(const Vec<L, T>& v) {
for (std::size_t i = 0; i < L; i++) if (!isnan(v[i])) return false;
return true;
}
// Check if any components are NaN
template <std::size_t L, AnyFloat T>
constexpr bool anynan(const Vec<L, T>& v) {
for (std::size_t i = 0; i < L; i++) if (isnan(v[i])) return true;
return false;
}
// -- GENERAL FUNCTIONS -- //
// Absolute value all components
template <std::size_t L, AnyNum T>
constexpr Vec<L, T> abs(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = abs(v[i]);
return out;
}
// Square all components
template <std::size_t L, AnyNum T>
constexpr Vec<L, T> sq(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = sq(v[i]);
return out;
}
// Square root all components
template <std::size_t L, AnyNum T>
inline Vec<L, T> sqrt(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = sqrt(v[i]);
return out;
}
// Raise components to a power
template <std::size_t L, AnyNum T0, AnyNum T1>
constexpr Vec<L, std::common_type_t<T0, T1>> pow(const Vec<L, T0>& b, T1 e) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = sq(v[i]);
return out;
}
// Dot product
template <std::size_t L, AnyNum T0, AnyNum T1>
constexpr std::common_type_t<T0, T1> dot(
const Vec<L, T0>& a,
const Vec<L, T1>& b
) {
decltype(T0(0) * T1(0)) out = 0;
for (std::size_t i = 0; i < L; i++) out += a[i] * b[i];
return out;
}
// Cross product
template <AnyNum T0, AnyNum T1>
constexpr Vec3<std::common_type_t<T0, T1>> cross(
const Vec3<T0>& a,
const Vec3<T1>& b
) {
return Vec3<decltype(T0(0) * T1(0))>(
a[1] * b[2] - a[2] * b[1],
a[2] * b[0] - a[0] * b[2],
a[0] * b[1] - a[1] * b[0]
);
}
// -- ROUNDING -- //
// Truncate all components
template <std::size_t L, AnyFloat T>
inline Vec<L, T> trunc(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = trunc(v[i]);
return out;
}
// Floor all components
template <std::size_t L, AnyFloat T>
inline Vec<L, T> floor(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = floor(v[i]);
return out;
}
// Ceil all components
template <std::size_t L, AnyFloat T>
inline Vec<L, T> ceil(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = ceil(v[i]);
return out;
}
// Round all components
template <std::size_t L, AnyFloat T>
inline Vec<L, T> round(const Vec<L, T>& v) {
Vec<L, T> out;
for (std::size_t i = 0; i < L; i++) out[i] = round(v[i]);
return out;
}
// -- DIRECT-TO-INT ROUNDING -- //
// See ops.hpp for "i" functions explanation
// Direct-to-int truncate all components
template <AnyInt I, std::size_t L, AnyFloat T>
constexpr Vec<L, I> itrunc(const Vec<L, T>& v) {
Vec<L, I> out;
for (std::size_t i = 0; i < L; i++) out[i] = itrunc<I>(v[i]);
return out;
}
// Direct-to-int floor all components
template <AnyInt I, std::size_t L, AnyFloat T>
constexpr Vec<L, I> ifloor(const Vec<L, T>& v) {
Vec<L, I> out;
for (std::size_t i = 0; i < L; i++) out[i] = ifloor<I>(v[i]);
return out;
}
// Direct-to-int ceil all components
template <AnyInt I, std::size_t L, AnyFloat T>
constexpr Vec<L, I> iceil(const Vec<L, T>& v) {
Vec<L, I> out;
for (std::size_t i = 0; i < L; i++) out[i] = iceil<I>(v[i]);
return out;
}
// Direct-to-int round all components
template <AnyInt I, std::size_t L, AnyFloat T>
constexpr Vec<L, I> iround(const Vec<L, T>& v) {
Vec<L, I> out;
for (std::size_t i = 0; i < L; i++) out[i] = iround<I>(v[i]);
return out;
}
}
namespace esdm = esd::math;