README ΒΆ
π github.com/elliotchance/pie
Enjoy a slice! pie
is a code generator for dealing with slices that
focuses on type safety, performance and immutability.
Quick Start
Install/Update
go get -u github.com/elliotchance/pie
Built-in Types
pie
ships with some slice types ready to go (pun intended). These include:
These can be used without needing go generate
. For example:
package main
import (
"fmt"
"strings"
"github.com/elliotchance/pie/pie"
)
func main() {
name := pie.Strings{"Bob", "Sally", "John", "Jane"}.
FilterNot(func (name string) bool {
return strings.HasPrefix(name, "J")
}).
Map(strings.ToUpper).
Last()
fmt.Println(name) // "SALLY"
}
Custom Types
Annotate the slice type in your source code:
type Car struct {
Name, Color string
}
//go:generate pie Cars.*
type Cars []Car
Run go generate
. This will create a file called cars_pie.go
. You should
commit this with the rest of your code. Run go generate
any time you need to
add more types.
Now you can use the slices:
cars := Cars{
{"Bob", "blue"},
{"Sally", "green"},
{"John", "red"},
{"Jane", "red"},
}
redCars := cars.Filter(func(car Car) bool {
return car.Color == "red"
})
// redCars = Cars{{"John", "red"}, {"Jane", "red"}}
Or, more complex operations can be chained:
cars.FilterNot(func (car Car) {
return strings.HasPrefix(car.Name, "J")
}).
Map(func (car Car) Car {
car.Name = strings.ToUpper(car.Name)
return car
}).
Last()
// Car{"SALLY", "green"}
Limiting Functions Generated
The .*
can be used to generate all functions. This is easy to get going but
creates a lot of unused code. You can limit the functions generated by chaining
the function names with a dot syntax, like:
//go:generate myInts.Average.Sum myStrings.Filter
This will only generate myInts.Average
, myInts.Sum
and myStrings.Filter
.
Functions
Function | String | Number | Struct | Maps | Big-O | Description |
---|---|---|---|---|---|---|
Abs |
β | n | Abs will return the absolute value of all values in the slice. | |||
All |
β | β | β | n | All will return true if all callbacks return true. If the list is empty then true is always returned. | |
Any |
β | β | β | n | Any will return true if any callbacks return true. If the list is empty then false is always returned. | |
Append |
β | β | β | n | A new slice with the elements appended to the end. | |
AreSorted |
β | β | n | Check if the slice is already sorted. | ||
AreUnique |
β | β | n | Check if the slice contains only unique elements. | ||
Average |
β | n | The average (mean) value, or a zeroed value. | |||
Bottom |
β | β | β | n | Gets n elements from bottom. | |
Contains |
β | β | β | n | Check if the value exists in the slice. | |
Extend |
β | β | β | n | A new slice with the elements from each slice appended to the end. | |
Each |
β | β | β | n | Perform an action on each element. | |
Filter |
β | β | β | n | A new slice containing only the elements that returned true from the condition. | |
FilterNot |
β | β | β | n | A new slice containing only the elements that returned false from the condition. | |
First |
β | β | β | 1 | The first element, or a zeroed value. | |
FirstOr |
β | β | β | 1 | The first element, or a default value. | |
Intersect |
β | β | n | Intersect returns elements which exists in all slices. | ||
Join |
β | n | A string from joining each of the elements. | |||
JSONString |
β | β | β | n | The JSON encoded string. | |
Keys |
β | n | Returns all keys in the map (in random order). | |||
Last |
β | β | β | 1 | The last element, or a zeroed value. | |
LastOr |
β | β | β | 1 | The last element, or a default value. | |
Len |
β | β | β | 1 | Number of elements. | |
Map |
β | β | β | n | A new slice where each element has been mapped (transformed). | |
Max |
β | β | n | The maximum value, or a zeroes value. | ||
Median |
β | nβ log(n) | Median returns the value separating the higher half from the lower half of a data sample. | |||
Min |
β | β | n | The minimum value, or a zeroed value. | ||
Product |
β | n | Product of all elements. | |||
Random |
β | β | β | 1 | Select a random element, or a zeroed value if empty. | |
Reduce |
β | β | n | Continously apply a function to the slice (left to right), reducing it to a single value. | ||
Reverse |
β | β | β | n | Reverse elements. | |
Send |
β | β | β | n | Send all element to channel. | |
Sort |
β | β | nβ log(n) | Return a new sorted slice. | ||
Sum |
β | n | Sum (total) of all elements. | |||
Shuffle |
β | β | β | n | Returns a new shuffled slice. | |
Top |
β | β | β | n | Gets several elements from top(head of slice). | |
ToStrings |
β | β | β | n | Transforms each element to a string. | |
Unique |
β | β | n | Return a new slice with only unique elements. | ||
Values |
β | n | Returns all values in the map (in random order). |
FAQ
What are the requirements?
pie
supports many Go versions, all the way back to Go 1.8.
What are the goals of pie
?
-
Type safety. I never want to hit runtime bugs because I could pass in the wrong type, or perform an invalid type case out the other end.
-
Performance. The functions need to be as fast as native Go implementations otherwise there's no point in this library existing.
-
Nil-safe. All of the functions will happily accept nil and treat them as empty slices. Apart from less possible panics, it makes it easier to chain.
-
Immutable. Functions never modify inputs, unlike some built-ins such as
sort.Strings
.
How do I contribute a function?
Pull requests are always welcome.
Here is a comprehensive list of steps to follow to add a new function:
-
Create a new file in the
functions/
directory. The file should be named the same as the function. You must include documentation for your function. -
Update
functions/main.go
to register the new function by adding an entry toFunctions
. Make sure you choose the correctFor
value that is appropriate for your function. -
Run
go generate ./... && go install && go generate ./...
. The firstgenerate
is to create the pie templates,install
will update your binary for the annotations and the secondgenerate
will use the newly created templates to update the generated code for the internal types. If you encounter errors with your code you can safely rerun the command above. -
If you chose
ForAll
orForStructs
, then you must add unit tests topie/carpointers_test.go
andpie/cars_test.go
. -
If you chose
ForAll
,ForNumbersAndStrings
orForNumbers
, then you must add unit tests topie/float64s_test.go
andpie/ints_test.go
. -
If you chose
ForAll
orForStrings
, then you must add unit tests topie/strings_test.go
. -
If you chose
ForMaps
, then you must add unit tests topie/currencies.go
. -
Update the README to list the new functions.
Why is the emoji a slice of pizza instead of a pie?
I wanted to pick a name for the project that was short and had an associated emoji. I liked pie, but then I found out that the pie emoji is not fully supported everywhere. I didn't want to change the name of the project to cake, but pizza pie still made sense. I'm not sure if I will change it back to a pie later.