In programming in general, and in Golang in particular, many roads lead to Rome.
From time to time I ask myself which of these ways is the fastest.
In Golang there is a wonderful solution, with go test -bench you can measure the speed very easily and quickly.
In order for you to benefit from it too, I will publish such benchmarks in this repository in the future.
- base64
- between
- caseinsensitivecompare
- concat
- contains
- floodfill
- foreach
- hash
- index
- json
- math
- parse
- random
- regexp
- template
- trim
I published another repository where I show some Golang examples. If you're interested in new programming languages, you should definitely take a look at Golang:
Golang Version: go version go1.23.2 darwin/arm64
Hardware Spec: Apple MacBook Pro 16-Inch M2 Max 2023 (?) (buy)
// Package base64 benchmarks some base64 functions.
// On all tested systems it's faster to decode a
// base64 encoded string instead of a check via regex.
package base64
import (
"encoding/base64"
"regexp"
"testing"
)
func base64decode(s string) bool {
_, err := base64.StdEncoding.DecodeString(s)
return err == nil
}
func base64regex(s string) bool {
matched, _ := regexp.MatchString(`^([A-Za-z0-9+/]{4})*([A-Za-z0-9+/]{4}|[A-Za-z0-9+/]{3}=|[A-Za-z0-9+/]{2}==)$`, s)
return matched
}
func BenchmarkBase64decode(b *testing.B) {
isNotBase64 := `Invalid string`
isBase64 := `VmFsaWQgc3RyaW5nCg==`
for n := 0; n < b.N; n++ {
base64decode(isNotBase64)
base64decode(isBase64)
}
}
func BenchmarkBase64regex(b *testing.B) {
isNotBase64 := `Invalid string`
isBase64 := `VmFsaWQgc3RyaW5nCg==`
for n := 0; n < b.N; n++ {
base64regex(isNotBase64)
base64regex(isBase64)
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkBase64decode-12 22039941 54.32 ns/op 32 B/op 2 allocs/op
BenchmarkBase64regex-12 124032 9594 ns/op 21918 B/op 198 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/base64 3.658s
// Package between compares the performance of checking
// if a number is between two other numbers via regex
// and by parsing the number as integers.
package between
import (
"regexp"
"simonwaldherr.de/go/golibs/as"
"simonwaldherr.de/go/ranger"
"testing"
)
func BenchmarkNumberRegEx(b *testing.B) {
re := ranger.Compile(89, 1001)
re = "^(" + re + ")$"
b.ResetTimer()
for n := 0; n < b.N; n++ {
matched, err := regexp.MatchString(re, "404")
if !matched || err != nil {
b.Log("Error in Benchmark")
}
matched, err = regexp.MatchString(re, "2000")
if matched || err != nil {
b.Log("Error in Benchmark")
}
}
}
func BenchmarkFulltextRegEx(b *testing.B) {
re := ranger.Compile(89, 1001)
re = " (" + re + ") "
b.ResetTimer()
for n := 0; n < b.N; n++ {
matched, err := regexp.MatchString(re, "lorem ipsum 404 dolor sit")
if !matched || err != nil {
b.Log("Error in Benchmark")
}
matched, err = regexp.MatchString(re, "lorem ipsum 2000 dolor sit")
if matched || err != nil {
b.Log("Error in Benchmark")
}
}
}
func BenchmarkNumberParse(b *testing.B) {
for n := 0; n < b.N; n++ {
i1 := as.Int("404")
i2 := as.Int("2000")
if i1 < 89 || i1 > 1001 {
b.Log("Error in Benchmark")
}
if !(i2 < 89 || i2 > 1001) {
b.Log("Error in Benchmark")
}
}
}
func BenchmarkFulltextParse(b *testing.B) {
re := regexp.MustCompile("[0-9]+")
b.ResetTimer()
for n := 0; n < b.N; n++ {
i1 := as.Int(re.FindString("lorem ipsum 404 dolor sit"))
i2 := as.Int(re.FindString("lorem ipsum 2000 dolor sit"))
if i1 < 89 || i1 > 1001 {
b.Log("Error in Benchmark")
}
if !(i2 < 89 || i2 > 1001) {
b.Log("Error in Benchmark")
}
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkNumberRegEx-12 182492 6580 ns/op 16874 B/op 142 allocs/op
BenchmarkFulltextRegEx-12 219794 5438 ns/op 12086 B/op 104 allocs/op
BenchmarkNumberParse-12 33438873 36.12 ns/op 0 B/op 0 allocs/op
BenchmarkFulltextParse-12 2588906 464.8 ns/op 32 B/op 2 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/between 6.530s
package trim
import (
"strings"
"testing"
)
func BenchmarkEqualFold(b *testing.B) {
for n := 0; n < b.N; n++ {
_ = strings.EqualFold("abc", "ABC")
_ = strings.EqualFold("ABC", "ABC")
_ = strings.EqualFold("1aBcD", "1AbCd")
}
}
func BenchmarkToUpper(b *testing.B) {
for n := 0; n < b.N; n++ {
_ = strings.ToUpper("abc") == strings.ToUpper("ABC")
_ = strings.ToUpper("ABC") == strings.ToUpper("ABC")
_ = strings.ToUpper("1aBcD") == strings.ToUpper("1AbCd")
}
}
func BenchmarkToLower(b *testing.B) {
for n := 0; n < b.N; n++ {
_ = strings.ToLower("abc") == strings.ToLower("ABC")
_ = strings.ToLower("ABC") == strings.ToLower("ABC")
_ = strings.ToLower("1aBcD") == strings.ToLower("1AbCd")
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkEqualFold-12 82182910 14.27 ns/op 0 B/op 0 allocs/op
BenchmarkToUpper-12 10489498 113.5 ns/op 24 B/op 3 allocs/op
BenchmarkToLower-12 8736387 139.3 ns/op 40 B/op 5 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/caseinsensitivecompare 4.714s
// Package concat benchmarks the performance of
// various string concatenation methods.
// Instead of just concatenating a string to another string
// it is also possible (and much faster) to use
// a bytes buffer.
package concat
import (
"bytes"
"strings"
"testing"
)
func BenchmarkConcatString(b *testing.B) {
var str string
for n := 0; n < b.N; n++ {
str += "x"
}
}
func BenchmarkConcatBuffer(b *testing.B) {
var buffer bytes.Buffer
for n := 0; n < b.N; n++ {
buffer.WriteString("x")
}
}
func BenchmarkConcatBuilder(b *testing.B) {
var builder strings.Builder
for n := 0; n < b.N; n++ {
builder.WriteString("x")
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkConcatString-12 1000000 28080 ns/op 503995 B/op 1 allocs/op
BenchmarkConcatBuffer-12 328286610 3.899 ns/op 3 B/op 0 allocs/op
BenchmarkConcatBuilder-12 569224069 2.338 ns/op 5 B/op 0 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/concat 31.494s
// Package contains tests various ways of checking
// if a string is contained in another string.
package contains
import (
"bytes"
"regexp"
"strings"
"testing"
)
// strings.Contains
func contains() bool {
return strings.Contains("Lorem Ipsum", "em Ip")
}
func containsNot() bool {
return strings.Contains("Lorem Ipsum", "Dolor")
}
func TestContains(t *testing.T) {
if contains() == false {
t.Error("ERROR: contains")
}
if containsNot() == true {
t.Error("ERROR: contains not")
}
}
func BenchmarkContains(b *testing.B) {
for n := 0; n < b.N; n++ {
contains()
}
}
func BenchmarkContainsNot(b *testing.B) {
for n := 0; n < b.N; n++ {
containsNot()
}
}
// bytes.Contains
func containsBytes() bool {
return bytes.Contains([]byte("Lorem Ipsum"), []byte("em Ip"))
}
func containsBytesNot() bool {
return bytes.Contains([]byte("Lorem Ipsum"), []byte("Dolor"))
}
func TestContainsBytes(t *testing.T) {
if containsBytes() == false {
t.Error("ERROR: bytes contains")
}
if containsBytesNot() == true {
t.Error("ERROR: bytes contains not")
}
}
func BenchmarkContainsBytes(b *testing.B) {
for n := 0; n < b.N; n++ {
containsBytes()
}
}
func BenchmarkContainsBytesNot(b *testing.B) {
for n := 0; n < b.N; n++ {
containsBytesNot()
}
}
// regexp.MustCompile + regexp.MatchString
func compileMatch(re *regexp.Regexp) bool {
matched := re.MatchString("Lorem Ipsum")
return matched
}
func compileMatchNot(re *regexp.Regexp) bool {
matched := re.MatchString("Lorem Ipsum")
return matched
}
func TestCompileMatch(t *testing.T) {
re1 := regexp.MustCompile("em Ip")
re2 := regexp.MustCompile("Dolor")
if compileMatch(re1) == false {
t.Error("ERROR: compile match")
}
if compileMatchNot(re2) == true {
t.Error("ERROR: compile match not")
}
}
func BenchmarkCompileMatch(b *testing.B) {
re := regexp.MustCompile("em Ip")
for n := 0; n < b.N; n++ {
compileMatch(re)
}
}
func BenchmarkCompileMatchNot(b *testing.B) {
re := regexp.MustCompile("Dolor")
for n := 0; n < b.N; n++ {
compileMatchNot(re)
}
}
// regexp.MatchString
func match() bool {
matched, _ := regexp.MatchString("em Ip", "Lorem Ipsum")
return matched
}
func matchNot() bool {
matched, _ := regexp.MatchString("Dolor", "Lorem Ipsum")
return matched
}
func TestMatch(t *testing.T) {
if match() == false {
t.Error("ERROR: match")
}
if matchNot() == true {
t.Error("ERROR: match not")
}
}
func BenchmarkMatch(b *testing.B) {
for n := 0; n < b.N; n++ {
match()
}
}
func BenchmarkMatchNot(b *testing.B) {
for n := 0; n < b.N; n++ {
matchNot()
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkContains-12 248628807 4.663 ns/op 0 B/op 0 allocs/op
BenchmarkContainsNot-12 205505241 5.833 ns/op 0 B/op 0 allocs/op
BenchmarkContainsBytes-12 242345499 4.979 ns/op 0 B/op 0 allocs/op
BenchmarkContainsBytesNot-12 193440084 6.183 ns/op 0 B/op 0 allocs/op
BenchmarkCompileMatch-12 25981101 46.99 ns/op 0 B/op 0 allocs/op
BenchmarkCompileMatchNot-12 50593507 23.41 ns/op 0 B/op 0 allocs/op
BenchmarkMatch-12 1709066 695.7 ns/op 1398 B/op 17 allocs/op
BenchmarkMatchNot-12 1786652 667.6 ns/op 1398 B/op 17 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/contains 13.447s
// Package floodfill benchmarks various flood fill implementations.
package main
import (
"testing"
)
// Rekursive Implementierung
func floodFillRecursive(image [][]int, sr int, sc int, newColor int) [][]int {
oldColor := image[sr][sc]
if oldColor == newColor {
return image
}
floodFillRecurse(image, sr, sc, oldColor, newColor)
return image
}
func floodFillRecurse(image [][]int, sr int, sc int, oldColor int, newColor int) {
if sr < 0 || sr >= len(image) || sc < 0 || sc >= len(image[0]) || image[sr][sc] != oldColor {
return
}
image[sr][sc] = newColor
floodFillRecurse(image, sr+1, sc, oldColor, newColor)
floodFillRecurse(image, sr-1, sc, oldColor, newColor)
floodFillRecurse(image, sr, sc+1, oldColor, newColor)
floodFillRecurse(image, sr, sc-1, oldColor, newColor)
}
// Iterative Implementierung mit Stack (DFS)
func floodFillDFS(image [][]int, sr int, sc int, newColor int) [][]int {
oldColor := image[sr][sc]
if oldColor == newColor {
return image
}
stack := [][]int{{sr, sc}}
for len(stack) > 0 {
current := stack[len(stack)-1]
stack = stack[:len(stack)-1]
r, c := current[0], current[1]
if r < 0 || r >= len(image) || c < 0 || c >= len(image[0]) || image[r][c] != oldColor {
continue
}
image[r][c] = newColor
stack = append(stack, []int{r + 1, c})
stack = append(stack, []int{r - 1, c})
stack = append(stack, []int{r, c + 1})
stack = append(stack, []int{r, c - 1})
}
return image
}
// Iterative Implementierung mit Queue (BFS)
func floodFillBFS(image [][]int, sr int, sc int, newColor int) [][]int {
oldColor := image[sr][sc]
if oldColor == newColor {
return image
}
queue := [][]int{{sr, sc}}
for len(queue) > 0 {
current := queue[0]
queue = queue[1:]
r, c := current[0], current[1]
if r < 0 || r >= len(image) || c < 0 || c >= len(image[0]) || image[r][c] != oldColor {
continue
}
image[r][c] = newColor
queue = append(queue, []int{r + 1, c})
queue = append(queue, []int{r - 1, c})
queue = append(queue, []int{r, c + 1})
queue = append(queue, []int{r, c - 1})
}
return image
}
// Iterative Implementierung mit Stack (4-Wege-Verbindung)
func floodFillStack4Way(image [][]int, sr int, sc int, newColor int) [][]int {
oldColor := image[sr][sc]
if oldColor == newColor {
return image
}
stack := [][]int{{sr, sc}}
directions := [][]int{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}
for len(stack) > 0 {
current := stack[len(stack)-1]
stack = stack[:len(stack)-1]
r, c := current[0], current[1]
if r < 0 || r >= len(image) || c < 0 || c >= len(image[0]) || image[r][c] != oldColor {
continue
}
image[r][c] = newColor
for _, dir := range directions {
stack = append(stack, []int{r + dir[0], c + dir[1]})
}
}
return image
}
// Komplexes Beispielbild
var complexImage = [][]int{
{0, 0, 0, 0, 0, 0},
{0, 1, 1, 0, 1, 0},
{0, 1, 0, 0, 1, 0},
{0, 1, 1, 1, 1, 0},
{0, 0, 0, 0, 0, 0},
{0, 1, 1, 0, 1, 1},
}
// Benchmark für die rekursive Implementierung
func BenchmarkFloodFillRecursive(b *testing.B) {
for i := 0; i < b.N; i++ {
image := make([][]int, len(complexImage))
for j := range complexImage {
image[j] = make([]int, len(complexImage[j]))
copy(image[j], complexImage[j])
}
floodFillRecursive(image, 1, 1, 2)
}
}
// Benchmark für die iterative Implementierung mit Stack (DFS)
func BenchmarkFloodFillDFS(b *testing.B) {
for i := 0; i < b.N; i++ {
image := make([][]int, len(complexImage))
for j := range complexImage {
image[j] = make([]int, len(complexImage[j]))
copy(image[j], complexImage[j])
}
floodFillDFS(image, 1, 1, 2)
}
}
// Benchmark für die iterative Implementierung mit Queue (BFS)
func BenchmarkFloodFillBFS(b *testing.B) {
for i := 0; i < b.N; i++ {
image := make([][]int, len(complexImage))
for j := range complexImage {
image[j] = make([]int, len(complexImage[j]))
copy(image[j], complexImage[j])
}
floodFillBFS(image, 1, 1, 2)
}
}
// Benchmark für die iterative Implementierung mit Stack (4-Wege-Verbindung)
func BenchmarkFloodFillStack4Way(b *testing.B) {
for i := 0; i < b.N; i++ {
image := make([][]int, len(complexImage))
for j := range complexImage {
image[j] = make([]int, len(complexImage[j]))
copy(image[j], complexImage[j])
}
floodFillStack4Way(image, 1, 1, 2)
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkFloodFillRecursive-12 5543814 194.7 ns/op 432 B/op 7 allocs/op
BenchmarkFloodFillDFS-12 1357302 886.0 ns/op 1744 B/op 48 allocs/op
BenchmarkFloodFillBFS-12 1000000 1115 ns/op 2728 B/op 54 allocs/op
BenchmarkFloodFillStack4Way-12 1297534 927.6 ns/op 1744 B/op 48 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/floodfill 6.841s
// Package foreach benchmarks ranging over slices and maps.
package foreach
import (
"testing"
)
var amap map[int]string
var aslice []string
func init() {
amap = map[int]string{
0: "lorem",
1: "ipsum",
2: "dolor",
3: "sit",
4: "amet",
}
aslice = []string{
"lorem",
"ipsum",
"dolor",
"sit",
"amet",
}
}
func forMap() {
for i := 0; i < len(amap); i++ {
_ = amap[i]
}
}
func rangeMap() {
for _, v := range amap {
_ = v
}
}
func rangeSlice() {
for _, v := range aslice {
_ = v
}
}
func rangeSliceKey() {
for k := range aslice {
_ = aslice[k]
}
}
func BenchmarkForMap(b *testing.B) {
for n := 0; n < b.N; n++ {
forMap()
}
}
func BenchmarkRangeMap(b *testing.B) {
for n := 0; n < b.N; n++ {
rangeMap()
}
}
func BenchmarkRangeSlice(b *testing.B) {
for n := 0; n < b.N; n++ {
rangeSlice()
}
}
func BenchmarkRangeSliceKey(b *testing.B) {
for n := 0; n < b.N; n++ {
rangeSliceKey()
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkForMap-12 62046307 19.13 ns/op 0 B/op 0 allocs/op
BenchmarkRangeMap-12 25168642 47.99 ns/op 0 B/op 0 allocs/op
BenchmarkRangeSlice-12 462297100 2.626 ns/op 0 B/op 0 allocs/op
BenchmarkRangeSliceKey-12 416866536 2.904 ns/op 0 B/op 0 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/foreach 6.315s
// Package hash benchmarks various hashing algorithms.
// Especially with hashing algorithms, faster is not always better.
// One should always decide on the basis of the respective requirements.
package hash
import (
"crypto/md5"
"crypto/sha1"
"crypto/sha256"
"crypto/sha512"
"hash"
"hash/adler32"
"hash/crc32"
"hash/crc64"
"hash/fnv"
"math/rand"
"testing"
"github.com/jzelinskie/whirlpool"
"github.com/reusee/mmh3"
"github.com/zeebo/blake3"
"golang.org/x/crypto/bcrypt"
"golang.org/x/crypto/blake2b"
"golang.org/x/crypto/md4"
"golang.org/x/crypto/ripemd160"
"golang.org/x/crypto/sha3"
)
func benchmarkHashAlgo(b *testing.B, h hash.Hash) {
data := make([]byte, 2048)
rand.Read(data)
b.ResetTimer()
for n := 0; n < b.N; n++ {
h.Reset()
h.Write(data)
_ = h.Sum(nil)
}
}
func benchmarkBCryptHashAlgo(b *testing.B, cost int) {
data := make([]byte, 2048)
rand.Read(data)
b.ResetTimer()
for n := 0; n < b.N; n++ {
bcrypt.GenerateFromPassword(data, cost)
}
}
func BenchmarkAdler32(b *testing.B) {
benchmarkHashAlgo(b, adler32.New())
}
func BenchmarkBCryptCost4(b *testing.B) {
benchmarkBCryptHashAlgo(b, 4)
}
func BenchmarkBCryptCost10(b *testing.B) {
benchmarkBCryptHashAlgo(b, 10)
}
func BenchmarkBCryptCost16(b *testing.B) {
benchmarkBCryptHashAlgo(b, 16)
}
/*
func BenchmarkBCryptCost22(b *testing.B) {
benchmarkBCryptHashAlgo(b, 22)
}
func BenchmarkBCryptCost28(b *testing.B) {
benchmarkBCryptHashAlgo(b, 28)
}
func BenchmarkBCryptCost31(b *testing.B) {
benchmarkBCryptHashAlgo(b, 31)
}
*/
func BenchmarkBlake2b256(b *testing.B) {
h, err := blake2b.New256(nil)
if err != nil {
b.Fatal(err)
}
benchmarkHashAlgo(b, h)
}
func BenchmarkBlake2b512(b *testing.B) {
h, err := blake2b.New512(nil)
if err != nil {
b.Fatal(err)
}
benchmarkHashAlgo(b, h)
}
func BenchmarkBlake3256(b *testing.B) {
benchmarkHashAlgo(b, blake3.New())
}
func BenchmarkMMH3(b *testing.B) {
benchmarkHashAlgo(b, mmh3.New128())
}
func BenchmarkCRC32(b *testing.B) {
benchmarkHashAlgo(b, crc32.NewIEEE())
}
func BenchmarkCRC64ISO(b *testing.B) {
benchmarkHashAlgo(b, crc64.New(crc64.MakeTable(crc64.ISO)))
}
func BenchmarkCRC64ECMA(b *testing.B) {
benchmarkHashAlgo(b, crc64.New(crc64.MakeTable(crc64.ECMA)))
}
func BenchmarkFnv32(b *testing.B) {
benchmarkHashAlgo(b, fnv.New32())
}
func BenchmarkFnv32a(b *testing.B) {
benchmarkHashAlgo(b, fnv.New32a())
}
func BenchmarkFnv64(b *testing.B) {
benchmarkHashAlgo(b, fnv.New64())
}
func BenchmarkFnv64a(b *testing.B) {
benchmarkHashAlgo(b, fnv.New64a())
}
func BenchmarkFnv128(b *testing.B) {
benchmarkHashAlgo(b, fnv.New128())
}
func BenchmarkFnv128a(b *testing.B) {
benchmarkHashAlgo(b, fnv.New128a())
}
func BenchmarkMD4(b *testing.B) {
benchmarkHashAlgo(b, md4.New())
}
func BenchmarkMD5(b *testing.B) {
benchmarkHashAlgo(b, md5.New())
}
func BenchmarkSHA1(b *testing.B) {
benchmarkHashAlgo(b, sha1.New())
}
func BenchmarkSHA224(b *testing.B) {
benchmarkHashAlgo(b, sha256.New224())
}
func BenchmarkSHA256(b *testing.B) {
benchmarkHashAlgo(b, sha256.New())
}
func BenchmarkSHA384(b *testing.B) {
benchmarkHashAlgo(b, sha512.New384())
}
func BenchmarkSHA512(b *testing.B) {
benchmarkHashAlgo(b, sha512.New())
}
func BenchmarkSHA3256(b *testing.B) {
benchmarkHashAlgo(b, sha3.New256())
}
func BenchmarkSHA3512(b *testing.B) {
benchmarkHashAlgo(b, sha3.New512())
}
func BenchmarkRIPEMD160(b *testing.B) {
benchmarkHashAlgo(b, ripemd160.New())
}
func BenchmarkWhirlpool(b *testing.B) {
benchmarkHashAlgo(b, whirlpool.New())
}
func BenchmarkSHA256Parallel(b *testing.B) {
b.RunParallel(func(pb *testing.PB) {
data := make([]byte, 2048)
rand.Read(data)
for pb.Next() {
h := sha256.New()
h.Write(data)
h.Sum(nil)
}
})
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkAdler32-12 1773306 658.2 ns/op 8 B/op 1 allocs/op
BenchmarkBCryptCost4-12 630446217 1.909 ns/op 0 B/op 0 allocs/op
BenchmarkBCryptCost10-12 630021440 1.919 ns/op 0 B/op 0 allocs/op
BenchmarkBCryptCost16-12 627110372 1.920 ns/op 0 B/op 0 allocs/op
BenchmarkBlake2b256-12 474422 2520 ns/op 32 B/op 1 allocs/op
BenchmarkBlake2b512-12 478998 2522 ns/op 64 B/op 1 allocs/op
BenchmarkBlake3256-12 413982 2889 ns/op 64 B/op 2 allocs/op
BenchmarkMMH3-12 3754330 320.3 ns/op 16 B/op 1 allocs/op
BenchmarkCRC32-12 4951921 240.3 ns/op 8 B/op 1 allocs/op
BenchmarkCRC64ISO-12 1000000 1163 ns/op 8 B/op 1 allocs/op
BenchmarkCRC64ECMA-12 1000000 1159 ns/op 8 B/op 1 allocs/op
BenchmarkFnv32-12 505454 2354 ns/op 8 B/op 1 allocs/op
BenchmarkFnv32a-12 508664 2369 ns/op 8 B/op 1 allocs/op
BenchmarkFnv64-12 506581 2371 ns/op 8 B/op 1 allocs/op
BenchmarkFnv64a-12 496144 2360 ns/op 8 B/op 1 allocs/op
BenchmarkFnv128-12 302470 3929 ns/op 24 B/op 2 allocs/op
BenchmarkFnv128a-12 483622 2474 ns/op 24 B/op 2 allocs/op
BenchmarkMD4-12 412834 2852 ns/op 24 B/op 2 allocs/op
BenchmarkMD5-12 408076 2965 ns/op 16 B/op 1 allocs/op
BenchmarkSHA1-12 1441970 833.2 ns/op 24 B/op 1 allocs/op
BenchmarkSHA224-12 1433124 837.3 ns/op 32 B/op 1 allocs/op
BenchmarkSHA256-12 1433647 837.3 ns/op 32 B/op 1 allocs/op
BenchmarkSHA384-12 821949 1452 ns/op 48 B/op 1 allocs/op
BenchmarkSHA512-12 838513 1450 ns/op 64 B/op 1 allocs/op
BenchmarkSHA3256-12 235372 5140 ns/op 480 B/op 2 allocs/op
BenchmarkSHA3512-12 133970 8992 ns/op 512 B/op 2 allocs/op
BenchmarkRIPEMD160-12 202741 5895 ns/op 24 B/op 1 allocs/op
BenchmarkWhirlpool-12 45649 26371 ns/op 64 B/op 1 allocs/op
BenchmarkSHA256Parallel-12 12719010 95.58 ns/op 32 B/op 1 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/hash 40.138s
// Package index benchmarks access on maps with various data types as keys.
package index
import (
"math/rand"
"strconv"
"testing"
)
var NumItems int = 1000000
var ms map[string]string
var ks []string
var mi map[int]string
var ki []int
func initMapStringIndex() {
ms = make(map[string]string)
ks = make([]string, 0)
for i := 0; i < NumItems; i++ {
key := strconv.Itoa(rand.Intn(NumItems))
ms[key] = "value" + strconv.Itoa(i)
ks = append(ks, key)
}
}
func initMapIntIndex() {
mi = make(map[int]string)
ki = make([]int, 0)
for i := 0; i < NumItems; i++ {
key := rand.Intn(NumItems)
mi[key] = "value" + strconv.Itoa(i)
ki = append(ki, key)
}
}
func init() {
initMapStringIndex()
initMapIntIndex()
}
func BenchmarkMapStringKeys(b *testing.B) {
i := 0
for n := 0; n < b.N; n++ {
if _, ok := ms[ks[i]]; ok {
}
i++
if i >= NumItems {
i = 0
}
}
}
func BenchmarkMapIntKeys(b *testing.B) {
i := 0
for n := 0; n < b.N; n++ {
if _, ok := mi[ki[i]]; ok {
}
i++
if i >= NumItems {
i = 0
}
}
}
func BenchmarkMapStringIndex(b *testing.B) {
i := 0
for n := 0; n < b.N; n++ {
_ = ms[ks[i]]
i++
if i >= NumItems {
i = 0
}
}
}
func BenchmarkMapIntIndex(b *testing.B) {
i := 0
for n := 0; n < b.N; n++ {
_ = mi[ki[i]]
i++
if i >= NumItems {
i = 0
}
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkMapStringKeys-12 23367214 47.56 ns/op 0 B/op 0 allocs/op
BenchmarkMapIntKeys-12 48721192 24.65 ns/op 0 B/op 0 allocs/op
BenchmarkMapStringIndex-12 25738339 47.11 ns/op 0 B/op 0 allocs/op
BenchmarkMapIntIndex-12 48340831 25.37 ns/op 0 B/op 0 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/index 8.792s
package json
import (
"encoding/json"
"math"
"math/big"
"testing"
"time"
)
type Data struct {
String string
Time time.Time
Int int
Int8 int8
Int16 int16
Int32 int32
Int64 int64
Boolean bool
Float32 float32
Float64 float64
BigInt big.Int
BigFloat big.Float
}
func BenchmarkJsonMarshal(b *testing.B) {
for n := 0; n < b.N; n++ {
var d = Data{
String: "",
Time: time.Now(),
Int: math.MaxInt32,
Int8: math.MaxInt8,
Int16: math.MaxInt16,
Int32: math.MaxInt32,
Int64: math.MaxInt64,
Boolean: false,
Float32: math.MaxFloat32,
Float64: math.MaxFloat64,
BigInt: *big.NewInt(math.MaxInt64),
BigFloat: *big.NewFloat(math.MaxFloat64),
}
_, err := json.Marshal(d)
if err != nil {
b.Error(err)
b.Fail()
return
}
}
}
func BenchmarkJsonUnmarshal(b *testing.B) {
str := `
{
"String": "",
"Time": "2019-10-30T16:41:29.853426+07:00",
"Int": 2147483647,
"Int8": 127,
"Int16": 32767,
"Int32": 2147483647,
"Int64": 9223372036854775807,
"Boolean": false,
"Float32": 3.4028235e+38,
"Float64": 1.7976931348623157e+308,
"BigInt": 9999999999999999999,
"BigFloat": "2.7976931348623157e+308"
}
`
for n := 0; n < b.N; n++ {
var d Data
err := json.Unmarshal([]byte(str), &d)
if err != nil {
b.Error(err)
b.Fail()
return
}
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkJsonMarshal-12 1696489 691.1 ns/op 480 B/op 5 allocs/op
BenchmarkJsonUnmarshal-12 345278 3497 ns/op 1816 B/op 27 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/json 3.173s
// Package math compares the speed of various mathematical operations.
package math
import (
"sync"
"sync/atomic"
"testing"
)
func BenchmarkMathInt8(b *testing.B) {
var intVal int8
for n := 0; n < b.N; n++ {
intVal = intVal + 2
}
}
func BenchmarkMathInt32(b *testing.B) {
var intVal int32
for n := 0; n < b.N; n++ {
intVal = intVal + 2
}
}
func BenchmarkMathInt64(b *testing.B) {
var intVal int64
for n := 0; n < b.N; n++ {
intVal = intVal + 2
}
}
func BenchmarkMathAtomicInt32(b *testing.B) {
var intVal int32
for n := 0; n < b.N; n++ {
atomic.AddInt32(&intVal, 2)
}
}
func BenchmarkMathAtomicInt64(b *testing.B) {
var intVal int64
for n := 0; n < b.N; n++ {
atomic.AddInt64(&intVal, 2)
}
}
type IntMutex struct {
v int64
mux sync.Mutex
}
func BenchmarkMathMutexInt(b *testing.B) {
var m IntMutex
for n := 0; n < b.N; n++ {
m.mux.Lock()
m.v = m.v + 2
m.mux.Unlock()
}
}
func BenchmarkMathFloat32(b *testing.B) {
var floatVal float32
for n := 0; n < b.N; n++ {
floatVal = floatVal + 2
}
}
func BenchmarkMathFloat64(b *testing.B) {
var floatVal float64
for n := 0; n < b.N; n++ {
floatVal = floatVal + 2
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkMathInt8-12 1000000000 0.2957 ns/op 0 B/op 0 allocs/op
BenchmarkMathInt32-12 1000000000 0.2905 ns/op 0 B/op 0 allocs/op
BenchmarkMathInt64-12 1000000000 0.2920 ns/op 0 B/op 0 allocs/op
BenchmarkMathAtomicInt32-12 303743928 3.946 ns/op 0 B/op 0 allocs/op
BenchmarkMathAtomicInt64-12 304287505 3.936 ns/op 0 B/op 0 allocs/op
BenchmarkMathMutexInt-12 152232505 7.862 ns/op 0 B/op 0 allocs/op
BenchmarkMathFloat32-12 1000000000 0.2913 ns/op 0 B/op 0 allocs/op
BenchmarkMathFloat64-12 1000000000 0.2923 ns/op 0 B/op 0 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/math 6.998s
// Package parse benchmarks parsing.
package parse
import (
"strconv"
"testing"
)
func BenchmarkParseBool(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := strconv.ParseBool("true")
if err != nil {
panic(err)
}
}
}
func BenchmarkParseInt(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := strconv.ParseInt("1337", 10, 64)
if err != nil {
panic(err)
}
}
}
func BenchmarkParseFloat(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := strconv.ParseFloat("3.141592653589793238462643383", 64)
if err != nil {
panic(err)
}
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkParseBool-12 1000000000 0.2974 ns/op 0 B/op 0 allocs/op
BenchmarkParseInt-12 123617468 9.606 ns/op 0 B/op 0 allocs/op
BenchmarkParseFloat-12 20286446 59.19 ns/op 0 B/op 0 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/parse 3.952s
// Package random compares math/rand with crypto/rand.
// math/rand is much faster than crypto/rand, but it
// returns only a pseudo random number.
package random
import (
crand "crypto/rand"
"encoding/base64"
"math/big"
mrand "math/rand"
"testing"
)
func BenchmarkMathRand(b *testing.B) {
for n := 0; n < b.N; n++ {
mrand.Int63n(0xFFFF)
}
}
func BenchmarkCryptoRand(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := crand.Int(crand.Reader, big.NewInt(0xFFFF))
if err != nil {
panic(err)
}
}
}
func BenchmarkCryptoRandString(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := GenerateRandomString(32)
if err != nil {
panic(err)
}
}
}
func BenchmarkCryptoRandBytes(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := GenerateRandomBytes(32)
if err != nil {
panic(err)
}
}
}
func GenerateRandomBytes(n int) ([]byte, error) {
b := make([]byte, n)
_, err := mrand.Read(b)
if err != nil {
return nil, err
}
return b, nil
}
func GenerateRandomString(s int) (string, error) {
b, err := GenerateRandomBytes(s)
return base64.URLEncoding.EncodeToString(b), err
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkMathRand-12 177292024 6.587 ns/op 0 B/op 0 allocs/op
BenchmarkCryptoRand-12 9639430 124.9 ns/op 48 B/op 3 allocs/op
BenchmarkCryptoRandString-12 10743261 111.9 ns/op 128 B/op 3 allocs/op
BenchmarkCryptoRandBytes-12 20145973 59.06 ns/op 32 B/op 1 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/random 5.932s
// Package regexp benchmarks the performance of a pre-compiled regexp match
// a non-pre-compiled match and JIT-cached-compilation via golibs: https://simonwaldherr.de/go/golibs
package regexp
import (
"regexp"
"testing"
"simonwaldherr.de/go/golibs/regex"
)
var regexpStr string = `^[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Za-z]{2,9}$`
func BenchmarkMatchString(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := regexp.MatchString(regexpStr, "[email protected]")
if err != nil {
panic(err)
}
}
}
func BenchmarkMatchStringCompiled(b *testing.B) {
r, err := regexp.Compile(regexpStr)
if err != nil {
panic(err)
}
b.ResetTimer()
for n := 0; n < b.N; n++ {
r.MatchString("[email protected]")
}
}
func BenchmarkMatchStringGolibs(b *testing.B) {
for n := 0; n < b.N; n++ {
_, err := regex.MatchString("[email protected]", regexpStr)
if err != nil {
panic(err)
}
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkMatchString-12 292782 4073 ns/op 10219 B/op 86 allocs/op
BenchmarkMatchStringCompiled-12 3814897 311.3 ns/op 0 B/op 0 allocs/op
BenchmarkMatchStringGolibs-12 3825850 315.4 ns/op 0 B/op 0 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/regexp 5.264s
// Package template benchmarks the performance of different templating methods
package template
import (
"bytes"
htmltemplate "html/template"
"regexp"
"testing"
texttemplate "text/template"
)
// Define a struct to hold the data for the templates
type Data struct {
Name string
Address string
}
// Prepare the templates and data
var (
data = Data{Name: "John Doe", Address: "123 Elm St"}
textTplString = "Name: {{.Name}}, Address: {{.Address}}"
htmlTplString = "<div>Name: {{.Name}}</div><div>Address: {{.Address}}</div>"
regExpString = "Name: {{NAME}}, Address: {{ADDRESS}}"
)
// Benchmark for text/template
func BenchmarkTextTemplate(b *testing.B) {
tpl, _ := texttemplate.New("text").Parse(textTplString)
b.ResetTimer()
for i := 0; i < b.N; i++ {
var buf bytes.Buffer
tpl.Execute(&buf, data)
}
}
// Benchmark for html/template
func BenchmarkHTMLTemplate(b *testing.B) {
tpl, _ := htmltemplate.New("html").Parse(htmlTplString)
b.ResetTimer()
for i := 0; i < b.N; i++ {
var buf bytes.Buffer
tpl.Execute(&buf, data)
}
}
// Benchmark for replacing placeholders using regexp
func BenchmarkRegExp(b *testing.B) {
rName := regexp.MustCompile(`{{NAME}}`)
rAddress := regexp.MustCompile(`{{ADDRESS}}`)
b.ResetTimer()
for i := 0; i < b.N; i++ {
result := rName.ReplaceAllString(regExpString, data.Name)
result = rAddress.ReplaceAllString(result, data.Address)
}
}$ go test -bench . -benchmem
goos: darwin
goarch: arm64
cpu: Apple M2 Max
BenchmarkTextTemplate-12 3484928 329.1 ns/op 208 B/op 6 allocs/op
BenchmarkHTMLTemplate-12 1000000 1144 ns/op 528 B/op 20 allocs/op
BenchmarkRegExp-12 2902995 418.8 ns/op 298 B/op 9 allocs/op
PASS
ok _/Users/simonwaldherr/git/golang-benchmarks/template 4.484s
