Go Benchmark for Subset Function

run.sh

#!/bin/sh

# to run the benchmark
go test -bench=.

subset.go

package main

func subsetOfCount(child, parent []int) bool {
	// http://stackoverflow.com/a/18879994/4352712
	
	set := make(map[int]int)
	for _, value := range parent {
		set[value] += 1
	}

	for _, value := range child {
		if count, found := set[value]; !found {
			return false
		} else if count < 1 {
			return false
		} else {
			set[value] = count - 1
		}
	}

	return true
}

// Does not care about duplicates
func subsetOfBool(child, parent []int) bool {
	seen := make(map[int]bool)

	for _, element := range parent {
		seen[element] = true
	}

	for _, element := range child {
		if !seen[element] {
			return false
		}
	}

	return true
}

subset_test.go

package main

import "testing"

func BenchmarkSubsetOfCount(b *testing.B) {
	for n := 0; n < b.N; n++ {
		subsetOfCount([]int{1, 2, 3}, []int{1, 2, 3, 4})
	}
}

func BenchmarkSubsetOfBool(b *testing.B) {
	for n := 0; n < b.N; n++ {
		subsetOfBool([]int{1, 2, 3}, []int{1, 2, 3, 4})
	}
}