From aba1a6d769f76f0c873c93d8286eaa2f50ec4920 Mon Sep 17 00:00:00 2001 From: Alessandro Leite Date: Thu, 19 Jan 2017 21:18:01 +0100 Subject: [PATCH 1/4] Include gota and Go Cheat Sheet * gota is an implementation of dataframes in Go * Go Cheat Sheet is a reference card of Go --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 5af47f5a..a84ea44e 100644 --- a/README.md +++ b/README.md @@ -217,6 +217,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [boomfilters](https://github.com/tylertreat/BoomFilters) - Probabilistic data structures for processing continuous, unbounded streams * [count-min-log](https://github.com/seiflotfy/count-min-log) - A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). * [cuckoofilter](https://github.com/seiflotfy/cuckoofilter) - Cuckoo filter: a good alternative to a counting bloom filter implemented in Go. +* [gota](https://github.com/kniren/gota/) - An implementation of dataframes, series, and data wrangling methods for Go. * [encoding](https://github.com/zhenjl/encoding) - Integer Compression Libraries for Go. * [go-adaptive-radix-tree](https://github.com/plar/go-adaptive-radix-tree) - A Go implementation of Adaptive Radix Tree. * [go-datastructures](https://github.com/Workiva/go-datastructures) - A collection of useful, performant, and thread-safe data structures @@ -1461,6 +1462,7 @@ Where to discover new Go libraries. * [Building Go Web Applications and Microservices Using Gin](https://semaphoreci.com/community/tutorials/building-go-web-applications-and-microservices-using-gin) - Get familiar with Gin and find out how it can help you reduce boilerplate code and build a request handling pipeline. * [Go By Example](https://gobyexample.com/) - A hands-on introduction to Go using annotated example programs. * [Go database/sql tutorial](http://go-database-sql.org/) - Introduction to database/sql. +* [Go Cheat Sheet](https://github.com/a8m/go-lang-cheat-sheet) - A Go's reference card. * [How to Use Godog for Behavior-driven Development in Go](https://semaphoreci.com/community/tutorials/how-to-use-godog-for-behavior-driven-development-in-go) - Get started with Godog — a Behavior-driven development framework for building and testing Go applications. * [Working with Go](https://github.com/mkaz/working-with-go) - An intro to go for experienced programmers. From 2e85e2e929172fd94501390f003702d0fc0f3995 Mon Sep 17 00:00:00 2001 From: Alessandro Leite Date: Mon, 23 Jan 2017 20:02:23 +0100 Subject: [PATCH 2/4] Fix the problem with the alphabetical order --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index a84ea44e..8c2a57f1 100644 --- a/README.md +++ b/README.md @@ -217,7 +217,6 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [boomfilters](https://github.com/tylertreat/BoomFilters) - Probabilistic data structures for processing continuous, unbounded streams * [count-min-log](https://github.com/seiflotfy/count-min-log) - A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). * [cuckoofilter](https://github.com/seiflotfy/cuckoofilter) - Cuckoo filter: a good alternative to a counting bloom filter implemented in Go. -* [gota](https://github.com/kniren/gota/) - An implementation of dataframes, series, and data wrangling methods for Go. * [encoding](https://github.com/zhenjl/encoding) - Integer Compression Libraries for Go. * [go-adaptive-radix-tree](https://github.com/plar/go-adaptive-radix-tree) - A Go implementation of Adaptive Radix Tree. * [go-datastructures](https://github.com/Workiva/go-datastructures) - A collection of useful, performant, and thread-safe data structures @@ -225,6 +224,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [gods](https://github.com/emirpasic/gods) - Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc. * [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go. * [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go. +e* [gota](https://github.com/kniren/gota) - An implementation of dataframes, series, and data wrangling methods for Go. * [hilbert](https://github.com/google/hilbert) - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. * [levenshtein](https://github.com/agnivade/levenshtein) - Implementation to calculate levenshtein distance in Go. * [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing From 2abf3731c1734b55ee66ec479048b4a649a16898 Mon Sep 17 00:00:00 2001 From: Alessandro Leite Date: Mon, 23 Jan 2017 20:02:23 +0100 Subject: [PATCH 3/4] Fix the problem with the alphabetical order --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index a84ea44e..4be4cd57 100644 --- a/README.md +++ b/README.md @@ -217,7 +217,6 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [boomfilters](https://github.com/tylertreat/BoomFilters) - Probabilistic data structures for processing continuous, unbounded streams * [count-min-log](https://github.com/seiflotfy/count-min-log) - A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). * [cuckoofilter](https://github.com/seiflotfy/cuckoofilter) - Cuckoo filter: a good alternative to a counting bloom filter implemented in Go. -* [gota](https://github.com/kniren/gota/) - An implementation of dataframes, series, and data wrangling methods for Go. * [encoding](https://github.com/zhenjl/encoding) - Integer Compression Libraries for Go. * [go-adaptive-radix-tree](https://github.com/plar/go-adaptive-radix-tree) - A Go implementation of Adaptive Radix Tree. * [go-datastructures](https://github.com/Workiva/go-datastructures) - A collection of useful, performant, and thread-safe data structures @@ -225,6 +224,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [gods](https://github.com/emirpasic/gods) - Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc. * [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go. * [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go. +e* [gota](https://github.com/kniren/gota) - An implementation of dataframes, series, and data wrangling methods for Go. * [hilbert](https://github.com/google/hilbert) - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. * [levenshtein](https://github.com/agnivade/levenshtein) - Implementation to calculate levenshtein distance in Go. * [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing @@ -1461,8 +1461,8 @@ Where to discover new Go libraries. * [A Tour of Go](http://tour.golang.org/) - Interactive tour of Go. * [Building Go Web Applications and Microservices Using Gin](https://semaphoreci.com/community/tutorials/building-go-web-applications-and-microservices-using-gin) - Get familiar with Gin and find out how it can help you reduce boilerplate code and build a request handling pipeline. * [Go By Example](https://gobyexample.com/) - A hands-on introduction to Go using annotated example programs. -* [Go database/sql tutorial](http://go-database-sql.org/) - Introduction to database/sql. * [Go Cheat Sheet](https://github.com/a8m/go-lang-cheat-sheet) - A Go's reference card. +* [Go database/sql tutorial](http://go-database-sql.org/) - Introduction to database/sql. * [How to Use Godog for Behavior-driven Development in Go](https://semaphoreci.com/community/tutorials/how-to-use-godog-for-behavior-driven-development-in-go) - Get started with Godog — a Behavior-driven development framework for building and testing Go applications. * [Working with Go](https://github.com/mkaz/working-with-go) - An intro to go for experienced programmers. From cf9a2bcf1a84a8e6ca2fb130bf012af3b81b978e Mon Sep 17 00:00:00 2001 From: Alessandro Leite Date: Thu, 26 Jan 2017 20:49:53 +0100 Subject: [PATCH 4/4] Remove an 'e' before the description of the gota's entry --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index ac5091a4..7fc45fe5 100644 --- a/README.md +++ b/README.md @@ -225,7 +225,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [gods](https://github.com/emirpasic/gods) - Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc. * [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go. * [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go. -e* [gota](https://github.com/kniren/gota) - An implementation of dataframes, series, and data wrangling methods for Go. +* [gota](https://github.com/kniren/gota) - An implementation of dataframes, series, and data wrangling methods for Go. * [hilbert](https://github.com/google/hilbert) - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. * [levenshtein](https://github.com/agnivade/levenshtein) - Implementation to calculate levenshtein distance in Go. * [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing