String Matching

Contributed by

How do you search for a string? If it’s just once, strings.Index(text, pattern) is probably your best option. The standard library currently uses Rabin-Karp to search the text for the pattern. However, there are lots of different cases for string searching, each of which has its own set of “best” algorithms. Fortunately for us, many of them already have implementations in Go. index/suffixarray What if you had a single text you wanted to do lots of searches through for different patterns?

Read more...

Post Dec 05, 2014

Git2go inception

Contributed by

How many levels of inception we need to master git? This tutorial that explains how to use git2go to publish an article for the Go Advent 2014. Git2go implements go bindings for libgit2, a pure C implementation of the Git core methods. This is important because, unlike other libraries, libgit2 doesn’t talk with any git binary. You won’t find the installation complicated if you’ve worked already with other C libraries. I recommend you to read the installation section in the readme.

Read more...

Post Dec 04, 2014

Delve: Go debugger

Contributed by

Delve Delve is a Go debugger. Currently the project is in beta, with most of the functionality implemented, and various improvements and platform support on the way. Why I started work on Delve sometime shortly after Gophercon 2014. Delve began as a fun and interesting project to hack on, and has since become a useful tool with a lot of potential. Delve was created to address issues with debugging Go programs with GDB.

Read more...

Post Dec 03, 2014

Handwritten Parsers & Lexers in Go

Contributed by

Handwritten Parsers & Lexers in Go In these days of web apps and REST APIs it seems that writing parsers is a dying art. You may think parsers are a complex undertaking only reserved for programming language designers but I’d like to dispel this idea. Over the past few years I’ve written parsers for JSON, CSS3, and database query languages and the more that I write parsers the more that I love them.

Read more...

Post Dec 02, 2014

Probabilistic Data Structures for Go

Contributed by

Imagine you had access logs for a very high traffic website. How would you determine how many different IP addresses accessed your site? Or how many hits from a particular IP? Or which ones accessed it the most? Assuming IPv4 addresses, you could use a map[uint32]int to maintain the counts, but that could end up using a lot of memory. It’s certainly possible to have a map with 4 billion entries, and a real log server wouldn’t have accesses from every single valid IP address, but the problem still exists.

Read more...

Post Dec 01, 2014

---