-
Notifications
You must be signed in to change notification settings - Fork 1
/
utils.go
116 lines (93 loc) · 1.92 KB
/
utils.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
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
package flinx
import (
"reflect"
"golang.org/x/exp/constraints"
"github.com/kom0055/go-flinx/hashset"
)
func Self[T any](t T) T {
return t
}
func Not[T any](predicate func(T) bool) func(T) bool {
return func(t T) bool {
return !predicate(t)
}
}
func Nil(t any) bool {
valueOf := reflect.ValueOf(t)
k := valueOf.Kind()
switch k {
case reflect.Chan, reflect.Func, reflect.Map, reflect.Ptr, reflect.UnsafePointer, reflect.Interface, reflect.Slice:
return valueOf.IsNil()
default:
}
return t == nil
}
func NonNil(t any) bool {
return !Nil(t)
}
func Gte[T constraints.Ordered](v T) func(t T) bool {
return func(t T) bool {
return t >= v
}
}
func Lte[T constraints.Ordered](v T) func(t T) bool {
return func(t T) bool {
return t <= v
}
}
func Gt[T constraints.Ordered](v T) func(t T) bool {
return Not(Lte(v))
}
func Lt[T constraints.Ordered](v T) func(t T) bool {
return Not(Gte(v))
}
func Eq[T comparable](v T) func(t T) bool {
return func(t T) bool {
return t == v
}
}
func Neq[T comparable](v T) func(t T) bool {
return Not(Eq(v))
}
func In[T comparable](v ...T) func(t T) bool {
return func(t T) bool {
return hashset.NewAny(v...).Has(t)
}
}
func NotIn[T comparable](v ...T) func(t T) bool {
return Not(In(v...))
}
func ValidateQuery[T comparable](q Query[T], output []T) bool {
next := q.Iterate()
for _, oitem := range output {
qitem, _ := next()
if oitem != qitem {
return false
}
}
_, ok := next()
_, ok2 := next()
return !(ok || ok2)
}
func Predicates[T any](predicates ...func(T) bool) func(T) bool {
return func(t T) bool {
for i := range predicates {
item := predicates[i]
if !item(t) {
return false
}
}
return true
}
}
func PredicatesIndexed[T any](predicates ...func(int, T) bool) func(int, T) bool {
return func(idx int, t T) bool {
for i := range predicates {
item := predicates[i]
if !item(idx, t) {
return false
}
}
return true
}
}