mirror of https://github.com/emirpasic/gods
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
361 lines
7.2 KiB
Go
361 lines
7.2 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 hashbidimap
|
|
|
|
import (
|
|
"encoding/json"
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestMapPut(t *testing.T) {
|
|
m := New()
|
|
m.Put(5, "e")
|
|
m.Put(6, "f")
|
|
m.Put(7, "g")
|
|
m.Put(3, "c")
|
|
m.Put(4, "d")
|
|
m.Put(1, "x")
|
|
m.Put(2, "b")
|
|
m.Put(1, "a") //overwrite
|
|
|
|
if actualValue := m.Size(); actualValue != 7 {
|
|
t.Errorf("Got %v expected %v", actualValue, 7)
|
|
}
|
|
if actualValue, expectedValue := m.Keys(), []interface{}{1, 2, 3, 4, 5, 6, 7}; !sameElements(actualValue, expectedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if actualValue, expectedValue := m.Values(), []interface{}{"a", "b", "c", "d", "e", "f", "g"}; !sameElements(actualValue, expectedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
|
|
// key,expectedValue,expectedFound
|
|
tests1 := [][]interface{}{
|
|
{1, "a", true},
|
|
{2, "b", true},
|
|
{3, "c", true},
|
|
{4, "d", true},
|
|
{5, "e", true},
|
|
{6, "f", true},
|
|
{7, "g", true},
|
|
{8, nil, false},
|
|
}
|
|
|
|
for _, test := range tests1 {
|
|
// retrievals
|
|
actualValue, actualFound := m.Get(test[0])
|
|
if actualValue != test[1] || actualFound != test[2] {
|
|
t.Errorf("Got %v expected %v", actualValue, test[1])
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestMapRemove(t *testing.T) {
|
|
m := New()
|
|
m.Put(5, "e")
|
|
m.Put(6, "f")
|
|
m.Put(7, "g")
|
|
m.Put(3, "c")
|
|
m.Put(4, "d")
|
|
m.Put(1, "x")
|
|
m.Put(2, "b")
|
|
m.Put(1, "a") //overwrite
|
|
|
|
m.Remove(5)
|
|
m.Remove(6)
|
|
m.Remove(7)
|
|
m.Remove(8)
|
|
m.Remove(5)
|
|
|
|
if actualValue, expectedValue := m.Keys(), []interface{}{1, 2, 3, 4}; !sameElements(actualValue, expectedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
|
|
if actualValue, expectedValue := m.Values(), []interface{}{"a", "b", "c", "d"}; !sameElements(actualValue, expectedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if actualValue := m.Size(); actualValue != 4 {
|
|
t.Errorf("Got %v expected %v", actualValue, 4)
|
|
}
|
|
|
|
tests2 := [][]interface{}{
|
|
{1, "a", true},
|
|
{2, "b", true},
|
|
{3, "c", true},
|
|
{4, "d", true},
|
|
{5, nil, false},
|
|
{6, nil, false},
|
|
{7, nil, false},
|
|
{8, nil, false},
|
|
}
|
|
|
|
for _, test := range tests2 {
|
|
actualValue, actualFound := m.Get(test[0])
|
|
if actualValue != test[1] || actualFound != test[2] {
|
|
t.Errorf("Got %v expected %v", actualValue, test[1])
|
|
}
|
|
}
|
|
|
|
m.Remove(1)
|
|
m.Remove(4)
|
|
m.Remove(2)
|
|
m.Remove(3)
|
|
m.Remove(2)
|
|
m.Remove(2)
|
|
|
|
if actualValue, expectedValue := fmt.Sprintf("%s", m.Keys()), "[]"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if actualValue, expectedValue := fmt.Sprintf("%s", m.Values()), "[]"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if actualValue := m.Size(); actualValue != 0 {
|
|
t.Errorf("Got %v expected %v", actualValue, 0)
|
|
}
|
|
if actualValue := m.Empty(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
}
|
|
|
|
func TestMapGetKey(t *testing.T) {
|
|
m := New()
|
|
m.Put(5, "e")
|
|
m.Put(6, "f")
|
|
m.Put(7, "g")
|
|
m.Put(3, "c")
|
|
m.Put(4, "d")
|
|
m.Put(1, "x")
|
|
m.Put(2, "b")
|
|
m.Put(1, "a") //overwrite
|
|
|
|
// key,expectedValue,expectedFound
|
|
tests1 := [][]interface{}{
|
|
{1, "a", true},
|
|
{2, "b", true},
|
|
{3, "c", true},
|
|
{4, "d", true},
|
|
{5, "e", true},
|
|
{6, "f", true},
|
|
{7, "g", true},
|
|
{nil, "x", false},
|
|
}
|
|
|
|
for _, test := range tests1 {
|
|
// retrievals
|
|
actualValue, actualFound := m.GetKey(test[1])
|
|
if actualValue != test[0] || actualFound != test[2] {
|
|
t.Errorf("Got %v expected %v", actualValue, test[0])
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestMapSerialization(t *testing.T) {
|
|
m := New()
|
|
m.Put("a", 1.0)
|
|
m.Put("b", 2.0)
|
|
m.Put("c", 3.0)
|
|
|
|
var err error
|
|
assert := func() {
|
|
if actualValue, expectedValue := m.Keys(), []interface{}{"a", "b", "c"}; !sameElements(actualValue, expectedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if actualValue, expectedValue := m.Values(), []interface{}{1.0, 2.0, 3.0}; !sameElements(actualValue, expectedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if actualValue, expectedValue := m.Size(), 3; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if err != nil {
|
|
t.Errorf("Got error %v", err)
|
|
}
|
|
}
|
|
|
|
assert()
|
|
|
|
bytes, err := m.ToJSON()
|
|
assert()
|
|
|
|
err = m.FromJSON(bytes)
|
|
assert()
|
|
|
|
bytes, err = json.Marshal([]interface{}{"a", "b", "c", m})
|
|
if err != nil {
|
|
t.Errorf("Got error %v", err)
|
|
}
|
|
}
|
|
|
|
func sameElements(a []interface{}, b []interface{}) bool {
|
|
if len(a) != len(b) {
|
|
return false
|
|
}
|
|
for _, av := range a {
|
|
found := false
|
|
for _, bv := range b {
|
|
if av == bv {
|
|
found = true
|
|
break
|
|
}
|
|
}
|
|
if !found {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
func benchmarkGet(b *testing.B, m *Map, size int) {
|
|
for i := 0; i < b.N; i++ {
|
|
for n := 0; n < size; n++ {
|
|
m.Get(n)
|
|
}
|
|
}
|
|
}
|
|
|
|
func benchmarkPut(b *testing.B, m *Map, size int) {
|
|
for i := 0; i < b.N; i++ {
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
}
|
|
}
|
|
|
|
func benchmarkRemove(b *testing.B, m *Map, size int) {
|
|
for i := 0; i < b.N; i++ {
|
|
for n := 0; n < size; n++ {
|
|
m.Remove(n)
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkHashBidiMapGet100(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkGet(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapGet1000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 1000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkGet(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapGet10000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 10000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkGet(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapGet100000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkGet(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapPut100(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100
|
|
m := New()
|
|
b.StartTimer()
|
|
benchmarkPut(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapPut1000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 1000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPut(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapPut10000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 10000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPut(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapPut100000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPut(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapRemove100(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkRemove(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapRemove1000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 1000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkRemove(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapRemove10000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 10000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkRemove(b, m, size)
|
|
}
|
|
|
|
func BenchmarkHashBidiMapRemove100000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100000
|
|
m := New()
|
|
for n := 0; n < size; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkRemove(b, m, size)
|
|
}
|