-
Notifications
You must be signed in to change notification settings - Fork 48
/
monoid.go
58 lines (52 loc) · 1.53 KB
/
monoid.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
// Copyright (c) 2023 IBM Corp.
// All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package predicate
import (
F "github.com/IBM/fp-go/function"
M "github.com/IBM/fp-go/monoid"
S "github.com/IBM/fp-go/semigroup"
)
// SemigroupAny combines predicates via ||
func SemigroupAny[A any]() S.Semigroup[func(A) bool] {
return S.MakeSemigroup(func(first func(A) bool, second func(A) bool) func(A) bool {
return F.Pipe1(
first,
Or(second),
)
})
}
// SemigroupAll combines predicates via &&
func SemigroupAll[A any]() S.Semigroup[func(A) bool] {
return S.MakeSemigroup(func(first func(A) bool, second func(A) bool) func(A) bool {
return F.Pipe1(
first,
And(second),
)
})
}
// MonoidAny combines predicates via ||
func MonoidAny[A any]() S.Semigroup[func(A) bool] {
return M.MakeMonoid(
SemigroupAny[A]().Concat,
F.Constant1[A](false),
)
}
// MonoidAll combines predicates via &&
func MonoidAll[A any]() S.Semigroup[func(A) bool] {
return M.MakeMonoid(
SemigroupAll[A]().Concat,
F.Constant1[A](true),
)
}