mirror of
https://github.com/Luzifer/ansible-role-version.git
synced 2024-12-24 11:31:21 +00:00
243 lines
4.6 KiB
Go
243 lines
4.6 KiB
Go
|
// Copyright (c) 2015, Emir Pasic. All rights reserved.
|
||
|
// Use of this source code is governed by a BSD-style
|
||
|
// license that can be found in the LICENSE file.
|
||
|
|
||
|
package hashset
|
||
|
|
||
|
import (
|
||
|
"testing"
|
||
|
)
|
||
|
|
||
|
func TestSetAdd(t *testing.T) {
|
||
|
set := New()
|
||
|
set.Add()
|
||
|
set.Add(1)
|
||
|
set.Add(2)
|
||
|
set.Add(2, 3)
|
||
|
set.Add()
|
||
|
if actualValue := set.Empty(); actualValue != false {
|
||
|
t.Errorf("Got %v expected %v", actualValue, false)
|
||
|
}
|
||
|
if actualValue := set.Size(); actualValue != 3 {
|
||
|
t.Errorf("Got %v expected %v", actualValue, 3)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestSetContains(t *testing.T) {
|
||
|
set := New()
|
||
|
set.Add(3, 1, 2)
|
||
|
set.Add(2, 3)
|
||
|
set.Add()
|
||
|
if actualValue := set.Contains(); actualValue != true {
|
||
|
t.Errorf("Got %v expected %v", actualValue, true)
|
||
|
}
|
||
|
if actualValue := set.Contains(1); actualValue != true {
|
||
|
t.Errorf("Got %v expected %v", actualValue, true)
|
||
|
}
|
||
|
if actualValue := set.Contains(1, 2, 3); actualValue != true {
|
||
|
t.Errorf("Got %v expected %v", actualValue, true)
|
||
|
}
|
||
|
if actualValue := set.Contains(1, 2, 3, 4); actualValue != false {
|
||
|
t.Errorf("Got %v expected %v", actualValue, false)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestSetRemove(t *testing.T) {
|
||
|
set := New()
|
||
|
set.Add(3, 1, 2)
|
||
|
set.Remove()
|
||
|
if actualValue := set.Size(); actualValue != 3 {
|
||
|
t.Errorf("Got %v expected %v", actualValue, 3)
|
||
|
}
|
||
|
set.Remove(1)
|
||
|
if actualValue := set.Size(); actualValue != 2 {
|
||
|
t.Errorf("Got %v expected %v", actualValue, 2)
|
||
|
}
|
||
|
set.Remove(3)
|
||
|
set.Remove(3)
|
||
|
set.Remove()
|
||
|
set.Remove(2)
|
||
|
if actualValue := set.Size(); actualValue != 0 {
|
||
|
t.Errorf("Got %v expected %v", actualValue, 0)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestSetSerialization(t *testing.T) {
|
||
|
set := New()
|
||
|
set.Add("a", "b", "c")
|
||
|
|
||
|
var err error
|
||
|
assert := func() {
|
||
|
if actualValue, expectedValue := set.Size(), 3; actualValue != expectedValue {
|
||
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
||
|
}
|
||
|
if actualValue := set.Contains("a", "b", "c"); actualValue != true {
|
||
|
t.Errorf("Got %v expected %v", actualValue, true)
|
||
|
}
|
||
|
if err != nil {
|
||
|
t.Errorf("Got error %v", err)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
assert()
|
||
|
|
||
|
json, err := set.ToJSON()
|
||
|
assert()
|
||
|
|
||
|
err = set.FromJSON(json)
|
||
|
assert()
|
||
|
}
|
||
|
|
||
|
func benchmarkContains(b *testing.B, set *Set, size int) {
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Contains(n)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func benchmarkAdd(b *testing.B, set *Set, size int) {
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func benchmarkRemove(b *testing.B, set *Set, size int) {
|
||
|
for i := 0; i < b.N; i++ {
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Remove(n)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetContains100(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 100
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkContains(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetContains1000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 1000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkContains(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetContains10000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 10000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkContains(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetContains100000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 100000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkContains(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetAdd100(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 100
|
||
|
set := New()
|
||
|
b.StartTimer()
|
||
|
benchmarkAdd(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetAdd1000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 1000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkAdd(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetAdd10000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 10000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkAdd(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetAdd100000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 100000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkAdd(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetRemove100(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 100
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkRemove(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetRemove1000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 1000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkRemove(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetRemove10000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 10000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkRemove(b, set, size)
|
||
|
}
|
||
|
|
||
|
func BenchmarkHashSetRemove100000(b *testing.B) {
|
||
|
b.StopTimer()
|
||
|
size := 100000
|
||
|
set := New()
|
||
|
for n := 0; n < size; n++ {
|
||
|
set.Add(n)
|
||
|
}
|
||
|
b.StartTimer()
|
||
|
benchmarkRemove(b, set, size)
|
||
|
}
|