mirror of
https://github.com/IBM/fp-go.git
synced 2025-08-10 22:31:32 +02:00
84 lines
2.1 KiB
Go
84 lines
2.1 KiB
Go
// 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 mostlyadequate
|
|
|
|
import (
|
|
"fmt"
|
|
"math"
|
|
"regexp"
|
|
"strings"
|
|
|
|
A "github.com/IBM/fp-go/array"
|
|
F "github.com/IBM/fp-go/function"
|
|
N "github.com/IBM/fp-go/number"
|
|
I "github.com/IBM/fp-go/number/integer"
|
|
S "github.com/IBM/fp-go/string"
|
|
)
|
|
|
|
var (
|
|
Match = F.Curry2((*regexp.Regexp).FindStringSubmatch)
|
|
Matches = F.Curry2((*regexp.Regexp).MatchString)
|
|
Split = F.Curry2(F.Bind3of3((*regexp.Regexp).Split)(-1))
|
|
|
|
Add = N.Add[int]
|
|
ToString = I.ToString
|
|
ToLower = strings.ToLower
|
|
ToUpper = strings.ToUpper
|
|
Concat = F.Curry2(S.Monoid.Concat)
|
|
)
|
|
|
|
// Replace cannot be generated via [F.Curry3] because the order of parameters does not match our desired curried order
|
|
func Replace(search *regexp.Regexp) func(replace string) func(s string) string {
|
|
return func(replace string) func(s string) string {
|
|
return func(s string) string {
|
|
return search.ReplaceAllString(s, replace)
|
|
}
|
|
}
|
|
}
|
|
|
|
func Example_solution04A() {
|
|
// words :: String -> [String]
|
|
words := Split(regexp.MustCompile(` `))
|
|
|
|
fmt.Println(words("Jingle bells Batman smells"))
|
|
|
|
// Output:
|
|
// [Jingle bells Batman smells]
|
|
}
|
|
|
|
func Example_solution04B() {
|
|
// filterQs :: [String] -> [String]
|
|
filterQs := A.Filter(Matches(regexp.MustCompile(`q`)))
|
|
|
|
fmt.Println(filterQs(A.From("quick", "camels", "quarry", "over", "quails")))
|
|
|
|
// Output:
|
|
// [quick quarry quails]
|
|
}
|
|
|
|
func Example_solution04C() {
|
|
|
|
keepHighest := N.Max[int]
|
|
|
|
// max :: [Number] -> Number
|
|
max := A.Reduce(keepHighest, math.MinInt)
|
|
|
|
fmt.Println(max(A.From(323, 523, 554, 123, 5234)))
|
|
|
|
// Output:
|
|
// 5234
|
|
}
|