go/fp-go
1
0
Fork 0
mirror of https://github.com/IBM/fp-go.git synced 2025-08-10 22:31:32 +02:00
Code Issues Releases Activity

fix: linter bugs

Browse Source 
Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com>
This commit is contained in:
Dr. Carsten Leue
2024-02-07 10:07:37 +01:00
parent 9b3d9c6930
commit 909f7c3bce
42 changed files with 184 additions and 103 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
ord/monoid.go
View File

@@ -42,11 +42,11 @@ func Monoid[A any]() M.Monoid[Ord[A]] {
}
// MaxSemigroup returns a semigroup where `concat` will return the maximum, based on the provided order.
func MaxSemigroup[A any](O Ord[A]) S.Semigroup[A] {
return S.MakeSemigroup(Max(O))
func MaxSemigroup[A any](o Ord[A]) S.Semigroup[A] {
return S.MakeSemigroup(Max(o))
}
// MaxSemigroup returns a semigroup where `concat` will return the minimum, based on the provided order.
func MinSemigroup[A any](O Ord[A]) S.Semigroup[A] {
return S.MakeSemigroup(Min(O))
func MinSemigroup[A any](o Ord[A]) S.Semigroup[A] {
return S.MakeSemigroup(Min(o))
}

4
ord/ord.go
View File

@@ -132,10 +132,10 @@ func FromStrictCompare[A C.Ordered]() Ord[A] {
}
// Lt tests whether one value is strictly less than another
func Lt[A any](O Ord[A]) func(A) func(A) bool {
func Lt[A any](o Ord[A]) func(A) func(A) bool {
return func(second A) func(A) bool {
return func(first A) bool {
return O.Compare(first, second) < 0
return o.Compare(first, second) < 0
}
}
}