mirror of
https://github.com/IBM/fp-go.git
synced 2025-11-23 22:14:53 +02:00
* fix: initial checkin of v2 Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: slowly migrate IO Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: migrate MonadTraverseArray and TraverseArray Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: migrate traversal Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: complete migration of IO Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: migrate ioeither Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: refactorY Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: next step in migration Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: adjust IO generation code Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: get rid of more IO methods Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: get rid of more IO * fix: convert iooption Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: convert reader Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: convert a bit of reader Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: new build script Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: cleanup Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: reformat Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: simplify Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: some cleanup Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: adjust Pair to Haskell semantic Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: documentation and testcases Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: some performance optimizations Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: remove coverage Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> * fix: better doc Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com> --------- Signed-off-by: Dr. Carsten Leue <carsten.leue@de.ibm.com>
74 lines
1.7 KiB
Go
74 lines
1.7 KiB
Go
// 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 number
|
|
|
|
import (
|
|
C "github.com/IBM/fp-go/v2/constraints"
|
|
)
|
|
|
|
type Number interface {
|
|
C.Integer | C.Float | C.Complex
|
|
}
|
|
|
|
// Add is a curried function used to add two numbers
|
|
func Add[T Number](right T) func(T) T {
|
|
return func(left T) T {
|
|
return left + right
|
|
}
|
|
}
|
|
|
|
// Sub is a curried function used to subtract two numbers
|
|
func Sub[T Number](right T) func(T) T {
|
|
return func(left T) T {
|
|
return left - right
|
|
}
|
|
}
|
|
|
|
// Mul is a curried function used to multiply two numbers
|
|
func Mul[T Number](right T) func(T) T {
|
|
return func(left T) T {
|
|
return left * right
|
|
}
|
|
}
|
|
|
|
// Div is a curried function used to divide two numbers
|
|
func Div[T Number](right T) func(T) T {
|
|
return func(left T) T {
|
|
return left / right
|
|
}
|
|
}
|
|
|
|
// Inc is a function that increments a number
|
|
func Inc[T Number](value T) T {
|
|
return value + 1
|
|
}
|
|
|
|
// Min takes the minimum of two values. If they are considered equal, the first argument is chosen
|
|
func Min[A C.Ordered](a, b A) A {
|
|
if a < b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|
|
|
|
// Max takes the maximum of two values. If they are considered equal, the first argument is chosen
|
|
func Max[A C.Ordered](a, b A) A {
|
|
if a > b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|