lo
lo copied to clipboard
💥 A Lodash-style Go library based on Go 1.18+ Generics (map, filter, contains, find...)
Motivation : merging maps from left to right with grouping ```go func AssignByPartition[K comparable, V any, T comparable](iteratee func(key K, value V) T, maps ...map[K]V) map[T]map[K]V ``` ```go oddEvenValue :=...
adding two new functions to `find.go` for fetching the first element of the slice.
The `Attempt` like functions are awesome and help a lot with operations prone to fail, i.e. networking stuff. Nevertheless, only procedure implementation is available in the library. So, it forced...
Closes #446
basically this is the other end of https://github.com/samber/mo/issues/40 -- implement .Get() -> (T, U, V, ...) for the Tuple family of types instead of having samber/mo's Result and Option implement...
Using map indexing, we can improve the performance of `PickByKeys` / `OmitByKeys`, by ranging over the input key array and checking the input map, rather than ranging over the input...
## Overview * Added CI tests of Go 1.19, 1.20, 1.21, 1.22 and stable * Codecov job runs on go 1.18 only
Same as `Coalesce` but for pointers