go get github.com/logic-building/functional-go/fp/
go get github.com/logic-building/functional-go/set/
go install github.com/logic-building/functional-go/gofp
go get -u github.com/logic-building/functional-go/fp/
go get -u github.com/logic-building/functional-go/set/
go install github.com/logic-building/functional-go/gofp
[[constraint]]
name = "github.com/logic-building/functional-go"
version = "8.14.0"import "github.com/logic-building/functional-go/fp"
fp.MapInt(square, []int{1, 2, 3, 4}) // Returns: [1 4 9 16]
func square(num int) int {
return num * num
}package main
import (
"fmt"
"github.com/logic-building/functional-go/fp"
)
var v1 int = 1
var v2 int = 2
var v3 int = 3
var v4 int = 4
func main() {
result := fp.MapIntPtr(square, []*int{&v1, &v2, &v3, &v4})
fmt.Println(*result[0], *result[1], *result[2], *result[3])
}
func square(num *int) *int {
r := *num * *num
return &r
}
/*
output:
1 4 9 16
*/package main
import (
"errors"
"fmt"
"github.com/logic-building/functional-go/fp"
)
func main() {
result, _ := fp.MapIntErr(square, []int{1, 2, 3, 4})
fmt.Println(result[0], result[1], result[2], result[3])
}
func square(num int) (int, error) {
if num == -1 {
return 0, errors.New("-1 is not valid")
}
r := num * num
return r, nil
}
/*
output:
1 4 9 16
*/package main
import (
"errors"
"fmt"
"github.com/logic-building/functional-go/fp"
)
func main() {
var v1 int = 1
var v2 int = 2
var v3 int = 3
var v4 int = 4
result, _ := fp.MapIntPtrErr(square, []*int{&v1, &v2, &v3, &v4})
fmt.Println(*result[0], *result[1], *result[2], *result[3])
}
func square(num *int) (*int, error) {
if *num == -1 {
return nil, errors.New("-1 is not valid")
}
r := *num * *num
return &r, nil
}
/*
output:
1 4 9 16
*/Design 1: Functional code distributed within different package
Design 2: All functional code in one place
type Employee struct {
id int
name string
salary float64
}//go:generate gofp -destination fp.go -pkg employee -type "Employee" //go:generate gofp -destination fp.go -pkg employee -type "Employee"
type Employee struct {
id int
name string
salary float64
}//go:generate gofp -destination fp.go -pkg employee -type "Employee"
-destination fp.go : fp.go is a new file which contains functional code for struct - Employee
-pkg employee : employee is package where struct "Employee" resides
-type "Employee" : Employee is struct for which functional code is generated.
go get github.com/logic-building/functional-go/gofp
go get -u github.com/logic-building/functional-go/gofp
go install github.com/logic-building/functional-go/gofp
go generate ./...
emp1 := employee.Employee{1, "A", 1000}
emp2 := employee.Employee{2, "B", 1000}
emp3 := employee.Employee{3, "C", 1000}
empList := []employee.Employee{emp1, emp2, emp3}
newEmpList := employee.Map(incrementSalary, empList) // Returns: [{1 A 1500} {2 B 1500} {3 C 1500}]
func incrementSalary(emp employee.Employee) employee.Employee {
emp.Salary = emp.Salary + 500
return emp
}Options on go:generate :
A: -only: overrides default behavior of generating all the functions. But it always includes Map and Filter
//go:generate gofp -destination fp.go -pkg employee -type "Employee" -only "Distinct, DistinctPtr, DistinctP"
full-list-values-for-only: "Distinct, DistinctP, DropLast, DropLastPtr,
DropWhile, DropWhileErr, DropWhilePtr, DropWhilePtrErr, Every, EveryErr, EveryPtr,
EveryPtrErr, FilterMap, FilterMapErr, FilterMapPtr, FilterMapPtrErr,
Remove, RemoveErr, RemovePtr, RemovePtrErr, Reduce, ReduceErr, ReducePtr, ReducePtrErr, Rest, RestPtr,
Reverse, ReversePtr, Some, SomeErr, SomePtr, SomePtrErr, Take, TakePtr,
TakeWhile, TakeWhileErr, TakeWhilePtr, TakeWhilePtrErr"
B. -sort: generate sorting functions for struct will override default behavior of generating sorting functions by each member of sturct of basic types
//go:generate gofp -destination fp.go -pkg employee -type "Employee" -sort "Employee:Name, Employee:Salary"
C. -set: generate set functions-Union, Intersection, Difference, Set, Superset, Subset for struct will override default behavior of generating set functions by each member of struct of basic types
//go:generate gofp -destination fp.go -pkg employee -type "Employee" -set "Employee:Name:string"
D. -mapfun: To generate Merge & Zip functions for struct
//go:generate gofp -destination fp.go -pkg employee -type "Employee" -mapfun "true"
Caution: It will complain at runtime if struct contains slice or array
1. Install "gofp" to generate code
go get -u github.com/logic-building/functional-go/gofp
go install github.com/logic-building/functional-go/gofp
2. create package "gfp" : See the example - internal/gfp/gfp.go
and two lines given below
package gfp
//go:generate gofp -destination fp.go -pkg gfp -type "employer.Employer, employee.Employee, int" -imports "github.com/logic-building/functional-go/internal/employee, github.com/logic-building/functional-go/internal/employer"
-destination fp.go : Generated file in package "gfp" will be "fp.go" which contains all the functional code
-pkg gfp : Saying that package is "gfp"
-type "employer.Employer, employee.Employee, int" : Generate functions for the combinations of these three data types
-imports "github.com/logic-building/functional-go/internal/employee, github.com/logic-building/functional-go/internal/employer" : import statements for two user defined types
"employee.Employee" and employer.Employer. The value for -imports should be comma separated
3. Generate functional code : Run the command given below from the root folder of your project
go generate ./...
4. Now write your code
gfp.MapEmployer
or
gfp.MapEmployee
or
gfp.MapEmployerEmployee
1. Dedupe<Type> : Returns a new list removing consecutive duplicates in provided list.
2. Difference<Type> : Returns a set that is the first set without elements of the remaining sets
3. Distinct<Type> : Returns a new list with duplicates removed.
4. Distinct<Type>P : Returns true if no two of the arguments are =
5. Drop<Type> : Returns a new list after dropping the given item
6. DropWhile<Type> : Returns a new list after dropping the items in the given list as long as condition satisfies(1st argument - predicate)
7. Equal<Type>sP : Returns true if both list are equal else returns false
8. EqualMap<Type>P : Returns true if both maps are equal else returns false
9. EqualMap<Type1><Type2>P : Returns true if both maps are equal else returns false
10. Even<Type>P : Returns true if n is even
11. Every<Type> : Returns true if supplied predicate function(1st argument) returns logical true for every item in the list
12. Exists<Type> : Returns true if given item exists in the list else false
13. Filter<Type> : Returns a new list after filtering the list(2nd argument) based on predicate function passed (1st argument)
14. FilterMap<Type> : Returns a new list after filtering given list(3rd argument), based on predicate function(1st argument) then apply function(2nd argument) on each item in the list(3rd argument)
15. FilterMap<InputType><OutputType> : similar to FilterMap<Type> with additional feature - input(3rd argument) type is different
output(return list) type is different
16. Intersection<Type> : Returns a set that is the intersection of the input sets. Repeated value within the list(arguments) will be ignored
17. Keys<Type> : Returns new a list of map's keys
18. Keys<Type1><Type2> : Returns new a list of map's Keys
19. Map<Type> : Returns a new list after applying the function(1st argument) on each item in the list(2nd argument)
20. Map<InputType><OutputType> : Similar to Map<Type> with additional feature - input(2nd argument) type is different and output(return) type is different
21. Max<Type> : Returns max item from the list.
22. Merge<Type> : Returns new map[<Type>]<Type> after merging map[<Type>]<Type> and map[<Type>]<Type>
23. Merge<Type1><Type2>: Returns new map<[<Type1>]<Type2> after merging map[<Type1>]<Type2> and map[<Type1>]<Type2>
24. Min<Type> : Returns min item from the list.
25. MinMax<Type> : Returns min and max items from the list.
26. Neg<Type>P : Returns true if num is less than zero, else false
27. Odd<Type>P : Returns true if n is odd
28. PMap<Type> : Similar to Map<Type> with additional feature - function(1st) argument runs concurrently for each item in the list(2nd argument)
EX. PMapInt(squareInt, []int{v1, v2, v3})
PMapInt(squareInt, []int{v1, v2, v3}, Optional{FixedPool: 2, RandomOrder: true})
29. PMap<InputType><OutputType>: Similar to Map<InputType><OutputType> with additional feature - function(1st) argument runs concurrently for each item in the list(2nd argument)
EX. PMapIntInt64(plusOneIntInt64, []int{1, 2, 3}) // input: list(int), returns: list(int64)
PMapIntInt64(plusOneIntInt64, []int{1, 2, 3}, Optional{FixedPool: 2, RandomOrder: true})
30. Pos<Type>P : Returns true if num is greater than zero, else false
31. Range<Type> : Returns a new list of range between lower and upper value. Optional argument(3rd) will increment value by given number
32. Reduce<Type> : Reduces a list to a single value by combining elements via a supplied function
33. Remove<Type> : Returns a new list after removing the items from the given list(2nd argument) based on supplied predicate function(1st argument)
34. Rest<Type> : Returns a new list after removing 1st item in the list(2nd argument)
35. Reverse<Type> : Returns a new list after reversing the list
36. Set<Type> : Returns a new list after removing duplicates items in the list
37. Some<Type> : Returns true if item is found in the list(2nd argument) based on predicate function(1st argument)
38. Sort<Type>s : Returns new sorted list
39. Subset<Type> : Returns true or false by checking if set1 is a subset of set2. Repeated value within list(argument) will be ignored
40. Superset<Type> : Returns true or false by checking if set1 is a superset of set2. Repeated value within list(argument) will be ignored
41. Take<Type> : Returns n items in the list
42. TakeWhile<Type> : Returns a new list based on predicate function(1st argument). It returns new list once condition fails.
43. Union<Type> : Return a set that is the union of the input sets. Repeated value within list(argument) will be ignored
44. Zero<Type>P : Returns true if num is zero, else false
45. Zip<Type> : Returns New map([<Type>])Type after merging two lists
46. Zip<Type1><Type2> : Similar to Zip<Type> with additional feature: Type of both list can be different
Note:
Comparison logic for struct is based on == operator as long as the members of struct are of simple types.
But reflect.DeepEqual is used for struct comparison if the struct contains any slices, maps.
1. Difference : Returns a set that is the first set without elements of the remaining sets
2. Difference<struct>By<Field>
3. Distinct : Returns a new list with duplicates removed
4. DistinctP : Returns true if no two of the arguments are =
5. DropWhile : Returns a new list after dropping the items in the given list as long as condition satisfies(1st argument - predicate)
6. Every : Returns true if supplied predicate function(1st argument) returns logical true for every item in the list
7. Filter : Returns a new list after filtering the list(2nd argument) based on predicate function passed (1st argument)
8. FilterMap : Returns a new list after filtering given list(3rd argument), based on predicate function(1st argument) then apply function(2nd argument) on each item in the list(3rd argument)
9. Intersection : Returns a set that is the intersection of the input sets. Repeated value within the list(arguments) will be ignored
10. Intersection<struct>By<Field>
11. Map : Returns a new list after applying the function(1st argument) on each item in the list(2nd argument)
12. PMap : Similar to Map<Type> with additional feature - function(1st) argument runs concurrently for each item in the list(2nd argument)
13. Reduce : Reduces a list to a single value by combining elements via a supplied function
14. Remove : Returns a new list after removing the items from the given list(2nd argument) based on supplied predicate function(1st argument)
15. Rest : Returns a new list after removing 1st item in the list(2nd argument)
16. Reverse : Returns a new list after reversing the list
17. Set : Returns a new list after removing duplicates items in the list
18. Set<struct>By<Field>
19. Some : Returns true if item is found in the list(2nd argument) based on predicate function(1st argument)
20. Sort<struct>By<Field> : Returns new sorted list
21. Subset : Returns true or false by checking if set1 is a subset of set2. Repeated value within list(argument) will be ignored
22. Subset<struct>By<Field>
23. Superset : Returns true or false by checking if set1 is a superset of set2. Repeated value within list(argument) will be ignored
24. Superset<struct>By<Field>
25. TakeWhile : Returns a new list based on predicate function(1st argument). It returns new list once condition fails.
26. Union : Return a set that is the union of the input sets. Repeated value within list(argument) will be ignored
27. Union<struct>By<Field>
// Use MakeIntSlicePtr for pointer version
r := fp.MakeIntSlice([]int{3, 2, 1}...).
Filter(odd).
Map(square).
Sort()
fmt.Println(r) // [1 9]
func odd (num int) bool {
return num % 2 != 0
}
func square(num int) int {
return num * num
}
Takes list as argument and returns Distinct list. Returns empty list if 2nd parameter is empty or nil
DistinctInt
DistinctInt64
DistinctInt32
DistinctInt16
DistinctInt8
DistinctUint
DistinctUint64
DistinctUint32
DistinctUint16
DistinctUint8
DistinctFloat64
DistinctFloat32
DistinctStr
add Ptr at end for pointer versioon function
eg. DistinctIntPtr
Takes function as argument and apply it on each item in the list and return list
MapInt
MapInt64
MapInt32
MapInt16
MapInt8
MapUint
MapUint64
MapUint32
MapUint16
MapUint8
MapFloat64
MapFloat32
MapStr
And also all basic combination such as
MapStrInt64
MapInt64Str
...
Pmap : For parallel processing
PmapInt
PmapInt64
PmapInt32
PmapInt16
PmapInt8
PmapUint
PmapUint64
PmapUint32
PmapUint16
PmapUint8
PmapFloat64
PmapFloat32
PmapStr
And also all basic combination such as
PMapStrInt64
PMapInt64Str
add Ptr at end for pointer versioon function
eg. PMapInt64StrPtr
Takes function as argument and apply it on each item in the list and return filtered list
FilterInt
FilterInt64
FilterInt32
FilterInt16
FilterInt8
FilterUint
FilterUint64
FilterUint32
FilterUint16
FilterUint8
FilterFloat64
FilterFloat32
FilterStr
add Ptr at end for pointer versioon function
eg. FilterIntPtr
Takes two functions as argument and apply them on each item in the list and return the filtered list
FilterMapInt
FilterMapInt64
FilterMapInt32
FilterMapInt16
FilterMapInt8
FilterMapUint
FilterMapUint64
FilterMapUint32
FilterMapUint16
FilterMapUint8
FilterMapFloat64
FilterMapFloat32
FilterMapStr
And also all basic combination such as
FilterMapStrInt64
FilterMapInt64Str
add Ptr at end for pointer versioon function
eg. FilterMapIntPtr
Takes list as parameter and returns new list which includes all the items except 1st one.
Input: list
output: New list includes all the items except 1st one.
Returns new empty list if the input is either nil or empty or length 1 list
Ex.
list := []int{1, 2, 3, 4, 5}
RestInt(list) // returns [2, 3, 4, 5]
RestInt
RestInt64
RestInt32
RestInt16
RestInt8
RestUint
RestUint64
RestUint32
RestUint16
RestUint8
RestFloat64
RestFloat32
RestStr
add Ptr at end for pointer versioon function
eg. RestIntPtr
Takes function as argument and apply it on each item in the list and return true/false. Returns false if 2nd argument is empty
EveryBool : Takes two arguments
a. function without arguments and returns bool
b. list of boolean values
return:
true if all the values in the list are true, otherwise false
See example below
EveryInt :
Takes two arguments
a. function with 1 argument type int and returns bool
b. list of int
return: True if function-1st argument returns true for each item in the list, otherwise false
EveryInt64
EveryInt32
EveryInt16
EveryInt8
EveryUint
EveryUint64
EveryUint32
EveryUint16
EveryUint8
EveryFloat64
EveryFloat32
EveryStr
add Ptr at end for pointer versioon function
eg. EveryIntPtr
Takes a number and a list as arguments and returns true if number exists in the list else returns false
ExistsInt
ExistsInt64
ExistsInt32
ExistsInt16
ExistsInt8
ExistsUint
ExistsUint64
ExistsUint32
ExistsUint16
ExistsUint8
ExistsFloat64
ExistsFloat32
ExistsStr
add Ptr at end for pointer versioon function
eg. ExistsIntPtr
Takes list as argument and return max number
- Returns 0 if list is either empty or nil
MaxInt
MaxInt64
MaxInt32
MaxInt16
MaxInt8
MaxUint
MaxUint64
MaxUint32
MaxUint16
MaxUint8
MaxFloat64
MaxFloat32
add Ptr at end for pointer versioon function
eg. MaxIntPtr
Takes list as argument and return min number
- Returns 0 if list is either empty or nil
MinInt
MinInt64
MinInt32
MinInt8
MinUint
MinUint64
MinUint32
MinUint16
MinUint8
MinFloat64
MinFloat32
Takes List as argument and returns Min and Max
- Returns 0, 0 if list is either empty or nil
- Returns same result for min and max if there is only one item in the list
MinMaxInt
MinMaxInt64
MinMaxInt32
MinMaxInt8
MinMaxUint
MinMaxUint64
MinMaxUint32
MinMaxUint16
MinMaxUint8
MinMaxFloat64
MinMaxFloat32
Returns a new list after dropping single item or multiple items
DropInt
DropInts
DropInt64
DropInts64
DropInt32
DropInts32
DropInt16
DropInts16
DropInt8
DropInts8
DropUint
DropUInts
DropUint64
DropUints64
DropUint32
DropUints32
DropUint16
DropUints16
DropUint8
DropUints8
DropFloat64
DropFloats64
DropFloat32
DropFloats32
DropStr
DropStrIgnoreCase
DropStrs
DropStrsIgnoreCase
DropWhile:
Drop the items in the list based on condition
Takes 2 inputs
a. Function : takes 1 input - int or float or string and return true/false
b. list
returns:
NewList
see example
DropWhileInt
DropWhileInt64
DropWhileInt32
DropWhileInt16
DropWhileInt8
DropWhileUint
DropWhileUint64
DropWhileUint32
DropWhileUint16
DropWhileUint8
DropWhileFloat64
DropWhileFloat32
DropWhileStr
TakeWhile:
take the items in the list based on condition
Takes 2 inputs
a. Function : takes 1 input - int or float or string and return true/false
b. list
returns:
NewList
see example
TakeWhileInt
TakeWhileInt64
TakeWhileInt32
TakeWhileInt16
TakeWhileInt8
TakeWhileUint
TakeWhileUint64
TakeWhileUint32
TakeWhileUint16
TakeWhileUint8
TakeWhileFloat64
TakeWhileFloat32
TakeWhileStr
Takes function and list as arguments and remove items based on function passed and return new list. See example
RemoveInt
RemoveInts
RemoveInt64
RemoveInts64
RemoveInt32
RemoveInts32
RemoveInt16
RemoveInts16
RemoveInt8
RemoveInts8
RemoveUint
RemoveUInts
RemoveUint64
RemoveUints64
RemoveUint32
RemoveUints32
RemoveUint16
RemoveUints16
RemoveUint8
RemoveUints8
RemoveFloat64
RemoveFloats64
RemoveFloat32
RemoveFloats32
RemoveStr
RemoveStrIgnoreCase
RemoveStrs
RemoveStrsIgnoreCase
Range function
Takes 3 inputs:
a. lower
b. upper
c. hops(optional)
Returns list of range between lower and upper value
Returns empty list if 3rd arguments is either of the following
a. 0
b. Negative number
Note: 3rd argument is considered as hops value if 3 or more than 3 arguments are passed.
RangeInt
RangeInt64
RangeInt32
RangeInt16
RangeInt8
RangeUint
RangeUint64
RangeUint32
RangeUint16
RangeUint8
SomeInt: takes two parameters
A. Function - one parameter and returns boolean
B. list
Returns:
Bool
Ex.
SomeInt(isEven, []int{1, 2, 3, 5}) : returns true
SomeInt(nil, nil) : returns false
SomeInt(isEven, []int{}) : returns false
SomeInt
SomeInt64
SomeInt32
SomeInt16
SomeInt8
SomeUint
SomeUint64
SomeUint32
SomeUint16
SomeUint8
SomeFloat64
SomeFloat32
SomeStr
Takes three inputs:
A. function - takes two argument
B. list
c. initializer - optional
Returns:
single value
Example
list := []int{1, 2, 3, 4, 5}
ReduceInt(plusInt, list) // returns: 15
func plusInt(num1, num2 int) int {
return num1 + num2
}
ReduceInt
ReduceInt64
ReduceInt32
ReduceInt16
ReduceInt8
ReduceUint
ReduceUint64
ReduceUint32
ReduceUint16
ReduceUint8
ReduceFloat64
ReduceFloat32
ReduceStr
Merge : Takes two inputs - map1 and map2 and returns new map after merging map1 and map2
MergeInt - takes input1: map<int,int>, input2: map<int, int>
MergeInt64
MergeInt32
MergeInt16
MergeInt8
MergeUint
MergeUInt64
MergeUint32
MergeUint16
MergeUint8
MergeFloat64
MergeFloat32
MergeBool
MergeStr
and there are also functions available for different combination of inputs in map
MergeIntStr - takes input1: map<int,string>, input2: map<int, string>
MergeStrFloat64
...
Example:
map1 := map[int]int{1: 10, 2: 20, 3: 30}
map2 := map[int]int{4: 40, 5: 50, 3: 300}
MergeIntInt(map1, map2) // Returns: map[1:10 2:20 4:40 5:50 3:300]
Zip: Takes two inputs - list1 and list2 and returns new map after zipping two lists
ZipInt : takes input1 - type "int", input2 - type "int"
ZipInt64 : takes input1 - type "int64", input2 - type "int64"
ZipInt32
ZipInt16
ZipInt8
ZipUint
ZipUint64
ZipUint32
ZipUint16
ZipUint8
ZipFloat64
ZipFloat32
ZipStr
ZipBool
and there are also functions available for different combination of inputs,
ZipIntStr : takes input1 - type "int", input2 - type "string"
ZipStrFloat64 : takes input1 - type "string", input2 - type "float64"
...
Example:
list1 := []int{1, 2, 3, 4}
list2 := []int{10, 20, 30, 40}
ZipInt(list1, list2) // returns map[1: 10, 2: 20, 3: 30, 4: 40]
Set operations: Add, Remove, Clear, GetList, NewSetInt, Join, Intersection, Minus, Subset, Superset
SetInt
SetIntSync
SetInt64
SetInt64Sync
SetInt32
SetInt32Sync
SetInt16
SetInt16Sync
SetInt8
SetInt8Sync
SetUint
SetUintSync
SetUint64
SetUint64Sync
SetUint32
SetUint32Sync
SetUint16
SetUint16Sync
SetUint8
SetUint8Sync
SetUintFloat64
SetUintFloat64Sync
SetUintFloat32
SetUintFloat32Sync
SetStr
SetStrSync
squareList := fp.MapInt(squareInt, []int{1, 2, 3}) // see the map_test.go for detail
func squareInt(num int) int {
return num * num
}
output
-------
[1, 4, 9]filteredList := fp.FilterInt(isEven, []int{1, 2, 3, 4})
func isEven(num int) bool {
return num%2 == 0
}
output:
[2, 4]filteredList := FilterMapInt(isPositive, multiplyBy2, []int{-1, 0, 2, 4})
func isPositive(num int) bool {
return num > 0
}
func multiplyBy2(num int) int {
return num * 2
}
output:
[4, 8]list := []bool{true, true, true, true}
fp.EveryBool(fp.True, list) // Returns true
list1 := []int{8, 2, 10, 4}
fp.EveryInt(isEven, list1) // Returns truelist1 := []int{8, 2, 10, 4}
fp.ExistsInt(8, list1) // returns truelist := []int{8, 2, 10, 4}
max := fp.MaxInt(list) // returns 10list := []int{8, 2, 10, 4}
min := fp.MinInt(list) // returns 2newList := fp.DropInt(1, []int{1, 2, 3, 1}) // returns [2, 3]
To drop multiple items:
newList := fp.DropInts([]int{1, 2}, []int{1, 2, 3, 1}) // returns [3]list := []int{8, 2, 8, 0, 2, 0}
distinct := fp.DistinctInt(list) // returns [8, 2, 0] mySet1 := set.NewInt([]int{10, 20, 30, 20})
mySet2 := set.NewInt([]int{30, 40, 50})
mySet3 := mySet1.Union(mySet2) // Returns [10, 20, 30, 40, 50] fp.Range(1, 5) // returns [1, 2, 3, 4]
fp.Range(1, 5, 2) // returns [1, 3] NewList := RemoveInt(isEven, []int{1, 2, 3, 4}) // returns [1, 3]
func isEven(num int) bool {
return num%2 == 0
} NewList := DropWhile(isEven, []int{4, 2, 3, 4}) // returns [3, 4]
func isEven(num int) bool {
return num%2 == 0
} NewList := TakeWhile(isEven, []int{4, 2, 3, 4}) // returns [4, 2]
func isEven(num int) bool {
return num%2 == 0
}Tests Passed : 1217
ok functional-go/fp 0.015s coverage: 99.7% of statements
ok functional-go/set 0.031s coverage: 100.0% of statements
go test ./... -v | grep -c RUN
4762
Model Identifier: MacBookPro11,5
Processor Name: Intel Core i7
Processor Speed: 2.5 GHz
Number of Processors: 1
Total Number of Cores: 4
Memory: 16 GB
Note: Bench result can vary bassed on the function passed. Check the test file for the detail.
goos: darwin
goarch: amd64
pkg: functional-go/fp
BenchmarkFilterInt64-8 1000000 5030 ns/op
BenchmarkFilterMapInt64-8 1000000 5865 ns/op
BenchmarkMapInt64_PassedMethod_1_Arg-8 1000000 3597 ns/op
BenchmarkMapInt64_PassedMethod_2_Arg-8 1000000 3622 ns/op
BenchmarkMapStr-8 1000000 49438 ns/op
PASS
ok functional-go/fp 67.567s
go test -benchtime=200x -bench=BenchmarkPMapInt
goos: darwin
goarch: amd64
pkg: github.com/logic-building/functional-go/fp
BenchmarkPMapInt-8 200 16224 ns/op
BenchmarkPMapIntRandomOrder-8 200 10091 ns/op
PASS
ok github.com/logic-building/functional-go/fp 4.549s