/
ordered.go
45 lines (38 loc) · 943 Bytes
/
ordered.go
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
package vec
import "golang.org/x/exp/constraints"
func Less[E constraints.Ordered, Z Bool, XY Vector[E]](z Z, x, y XY) {
binaryBool[E](z, x, y, func(a, b E) bool {
return a < b
})
}
func LessOrEqual[E constraints.Ordered, Z Bool, XY Vector[E]](z Z, x, y XY) {
binaryBool[E](z, x, y, func(a, b E) bool {
return a <= b
})
}
func Greater[E constraints.Ordered, Z Bool, XY Vector[E]](z Z, x, y XY) {
binaryBool[E](z, x, y, func(a, b E) bool {
return a > b
})
}
func GreaterOrEqual[E constraints.Ordered, Z Bool, XY Vector[E]](z Z, x, y XY) {
binaryBool[E](z, x, y, func(a, b E) bool {
return a >= b
})
}
func Min[E constraints.Ordered, XYZ Vector[E]](z, x, y XYZ, m *Mask) {
binary[E, E](m, z, x, y, func(a, b E) E {
if a < b {
return a
}
return b
})
}
func Max[E constraints.Ordered, XYZ Vector[E]](z, x, y XYZ, m *Mask) {
binary[E, E](m, z, x, y, func(a, b E) E {
if a > b {
return a
}
return b
})
}