2025-11-06 09:27:00 +01:00
|
|
|
// Copyright (c) 2023 - 2025 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 either
|
|
|
|
|
|
|
|
|
|
import (
|
|
|
|
|
M "github.com/IBM/fp-go/v2/monoid"
|
|
|
|
|
S "github.com/IBM/fp-go/v2/semigroup"
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
// ApplySemigroup lifts a Semigroup over the Right values of Either.
|
|
|
|
|
// Combines two Right values using the provided Semigroup.
|
|
|
|
|
// If either value is Left, returns the first Left encountered.
|
|
|
|
|
//
|
|
|
|
|
// Example:
|
|
|
|
|
//
|
|
|
|
|
// intAdd := semigroup.MakeSemigroup(func(a, b int) int { return a + b })
|
|
|
|
|
// eitherSemi := either.ApplySemigroup[error](intAdd)
|
|
|
|
|
// result := eitherSemi.Concat(either.Right[error](2), either.Right[error](3)) // Right(5)
|
2025-11-06 10:54:24 +01:00
|
|
|
//
|
|
|
|
|
//go:inline
|
2025-11-06 09:27:00 +01:00
|
|
|
func ApplySemigroup[E, A any](s S.Semigroup[A]) S.Semigroup[Either[E, A]] {
|
|
|
|
|
return S.ApplySemigroup(MonadMap[E, A, func(A) A], MonadAp[A, E, A], s)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// ApplicativeMonoid returns a Monoid that concatenates Either instances via their applicative.
|
|
|
|
|
// Provides an empty Either (Right with monoid's empty value) and combines Right values using the monoid.
|
|
|
|
|
//
|
|
|
|
|
// Example:
|
|
|
|
|
//
|
|
|
|
|
// intAddMonoid := monoid.MakeMonoid(0, func(a, b int) int { return a + b })
|
|
|
|
|
// eitherMon := either.ApplicativeMonoid[error](intAddMonoid)
|
|
|
|
|
// empty := eitherMon.Empty() // Right(0)
|
2025-11-06 10:54:24 +01:00
|
|
|
//
|
|
|
|
|
//go:inline
|
2025-11-06 09:27:00 +01:00
|
|
|
func ApplicativeMonoid[E, A any](m M.Monoid[A]) M.Monoid[Either[E, A]] {
|
|
|
|
|
return M.ApplicativeMonoid(Of[E, A], MonadMap[E, A, func(A) A], MonadAp[A, E, A], m)
|
|
|
|
|
}
|