An implementation of utility functions inspired by Lodash for the Go language, focusing on efficiency without the use of reflection.
All slice utilities opt for immutability so always a new copy of the array is returned instead of a different slice over the same array.
Some of the motivation behind this library is discussed in this blog post.
Returns a new array in reverse order.
_int.Reverse([]int{1, 2, 3})
// => []int{3, 2, 1}Returns a new array without duplicates (all elements are unique).
_int.Uniq([]int{1, 2, 1, 3, 3})
// => []int{1, 2, 3}Returns a new array of all elements which the function predicate returns true for.
even := func (element int, index int) bool {
return element % 2 == 0
}
_int.Filter([]int{1, 2, 3, 4}, even)
// => []int{2, 4}Returns a new array of all elements after the function has been executed on them.
double := func (element int, index int) int {
return 2 * element
}
_int.Map([]int{1, 2, 3, 4}, double)
// => []int{2, 4, 6, 8}Reduces the slice to a single value which is the accumulated result of running each element through the function.
sum := func (acc int, element int, index int) int {
return acc + element
}
_int.Reduce([]int{1, 2, 3, 4}, sum, 0)
// => int(10)Returns a new array which is the first slice with the second concatenated at its end.
_int.Concat([]int{1, 2, 3}, []int{4, 5})
// => []int{1, 2, 3, 4, 5}Returns the first element in the slice.
_int.First([]int{1, 2, 3, 4})
// => int(1)Returns the last element in the slice.
_int.Last([]int{1, 2, 3, 4})
// => int(4)Returns a new array where n elements are dropped from the beginning.
_int.Drop([]int{1, 2, 3, 4, 5}, 2)
// => []int{3, 4, 5}Returns a new array where n elements are dropped from the end.
_int.DropRight([]int{1, 2, 3, 4, 5}, 2)
// => []int{1, 2, 3}Chains multiple actions together and runs each on the result of the previous one. Value() returns the final result.
_int.Chain([]int{1, 2, 1, 3}).Uniq().Reverse().Value()
// => []int{3, 2, 1}
In order to avoid inefficient reflection, the library creates dedicated implementations for each type you need.
In the original Lodash, the library is used through the underscore character _. For example: _.uniq().
We keep the same convention, except that the underscore is followed by the type. For example: _int.Uniq() for integers, _string.Uniq() for strings.
Simply import the relevant subset of the library with the type appearing after the underscore:
import "github.com/go-dash/slice/_string"
func main() {
_string.Uniq([]string{"aa", "bb", "aa"})
// => []string{"aa", "bb"}
}Do the same thing, just add a comment afterwards of where the struct is defined.
import "github.com/go-dash/slice/_Person" // github.com/my-user/my-repo/person
func main() {
_Person.Uniq([]Person{Person{"John", 18}, Person{"Rachel", 17}, Person{"John", 18}})
// => []Person{Person{"John", 18}, Person{"Rachel", 17}}
}
-
Install the
_gencommand line tool which generates code for the types you need:brew install go-dash/tools/genVerify with
_gen --version -
Go get the library:
go get github.com/go-dash/slice -
In your project, import the relevant subsets for the types you need:
import ( "github.com/go-dash/slice/_string" "github.com/go-dash/slice/_int" )
-
Once, generate the code for the library subsets by running the following in your project root:
cd my-project _gen
A working example is available in the test suite.
From the root directory run ./test.sh.
This is mostly a thought experiment coming from the love of lodash and missing basic functional operations for slices in golang. Implementations based on reflection miss the point IMO since they're inefficient in runtime. Since golang doesn't currently support generics, code generation is the closest we can come.
If you like this approach and want to contribute to porting all of lodash to golang, don't hesitate to come help!
MIT
Godash is developed by the Orbs.com engineering team. Orbs is a public blockchain infrastructure for decentralized consumer applications with millions of users. Orbs core has an open source implementation in golang.