Implement v2 using type aliases (#141)

* 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>
2025-11-25 22:21:49 +02:00 · 2025-11-06 09:27:00 +01:00
parent 7874859c4b
commit 3385c705dc
748 changed files with 97722 additions and 24 deletions
--- a/v2/samples/presentation/benchmarks/map_test.go
+++ b/v2/samples/presentation/benchmarks/map_test.go
@@ -0,0 +1,177 @@
+// 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 benchmarks
+
+import (
+	"math/big"
+	"strings"
+	"testing"
+
+	A "github.com/IBM/fp-go/v2/array"
+	F "github.com/IBM/fp-go/v2/function"
+	N "github.com/IBM/fp-go/v2/number"
+	O "github.com/IBM/fp-go/v2/option"
+)
+
+var (
+	createStringSet  = createRandom(createRandomString(256))(256)
+	createIntDataSet = createRandom(randInt(10000))(256)
+
+	globalResult any
+)
+
+func BenchmarkMap(b *testing.B) {
+
+	data := createStringSet()
+
+	var benchResult []string
+
+	b.Run("functional", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			benchResult = F.Pipe1(
+				data,
+				A.Map(strings.ToUpper),
+			)
+		}
+	})
+
+	b.Run("idiomatic", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			var result = make([]string, 0, len(data))
+			for _, value := range data {
+				result = append(result, strings.ToUpper(value))
+			}
+			benchResult = result
+		}
+	})
+
+	globalResult = benchResult
+}
+
+func isEven(data int) bool {
+	return data%2 == 0
+}
+
+func isPrime(data int) bool {
+	return big.NewInt(int64(data)).ProbablyPrime(0)
+}
+
+func BenchmarkMapThenFilter(b *testing.B) {
+
+	data := createIntDataSet()
+	var benchResult []int
+
+	b.Run("functional isPrime", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			benchResult = F.Pipe2(
+				data,
+				A.Filter(isPrime),
+				A.Map(N.Div[int](2)),
+			)
+		}
+	})
+
+	b.Run("idiomatic isPrime", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			var result []int
+			for _, value := range data {
+				if isPrime(value) {
+					result = append(result, value/2)
+				}
+			}
+			benchResult = result
+		}
+	})
+	b.Run("functional isEven", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			benchResult = F.Pipe2(
+				data,
+				A.Filter(isEven),
+				A.Map(N.Div[int](2)),
+			)
+		}
+	})
+
+	b.Run("idiomatic isEven", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			var result []int
+			for _, value := range data {
+				if isEven(value) {
+					result = append(result, value/2)
+				}
+			}
+			benchResult = result
+		}
+	})
+
+	globalResult = benchResult
+}
+
+func BenchmarkFilterMap(b *testing.B) {
+
+	data := createIntDataSet()
+	var benchResult []int
+
+	b.Run("functional isPrime", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			benchResult = F.Pipe1(
+				data,
+				A.FilterMap(F.Flow2(
+					O.FromPredicate(isPrime),
+					O.Map(N.Div[int](2)),
+				)),
+			)
+		}
+	})
+
+	b.Run("idiomatic isPrime", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			var result []int
+			for _, value := range data {
+				if isPrime(value) {
+					result = append(result, value/2)
+				}
+			}
+			benchResult = result
+		}
+	})
+
+	b.Run("functional isEven", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			benchResult = F.Pipe1(
+				data,
+				A.FilterMap(F.Flow2(
+					O.FromPredicate(isEven),
+					O.Map(N.Div[int](2)),
+				)),
+			)
+		}
+	})
+
+	b.Run("idiomatic isEven", func(b *testing.B) {
+		for n := 0; n < b.N; n++ {
+			var result []int
+			for _, value := range data {
+				if isEven(value) {
+					result = append(result, value/2)
+				}
+			}
+			benchResult = result
+		}
+	})
+
+	globalResult = benchResult
+}