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.
192 lines
4.7 KiB
Go
192 lines
4.7 KiB
Go
/*
|
|
Copyright (c) 2015, Emir Pasic
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
* Redistributions of source code must retain the above copyright notice, this
|
|
list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
this list of conditions and the following disclaimer in the documentation
|
|
and/or other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
package hashmap
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestHashMap(t *testing.T) {
|
|
|
|
m := New()
|
|
|
|
// insertions
|
|
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
|
|
|
|
// Test Size()
|
|
if actualValue := m.Size(); actualValue != 7 {
|
|
t.Errorf("Got %v expected %v", actualValue, 7)
|
|
}
|
|
|
|
// test Keys()
|
|
if actualValue, expactedValue := m.Keys(), []interface{}{1, 2, 3, 4, 5, 6, 7}; !sameElements(actualValue, expactedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
|
|
// test Values()
|
|
if actualValue, expactedValue := m.Values(), []interface{}{"a", "b", "c", "d", "e", "f", "g"}; !sameElements(actualValue, expactedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
|
|
// 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])
|
|
}
|
|
}
|
|
|
|
// removals
|
|
m.Remove(5)
|
|
m.Remove(6)
|
|
m.Remove(7)
|
|
m.Remove(8)
|
|
m.Remove(5)
|
|
|
|
// test Keys()
|
|
if actualValue, expactedValue := m.Keys(), []interface{}{1, 2, 3, 4}; !sameElements(actualValue, expactedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
|
|
// test Values()
|
|
if actualValue, expactedValue := m.Values(), []interface{}{"a", "b", "c", "d"}; !sameElements(actualValue, expactedValue) {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
// Test Size()
|
|
if actualValue := m.Size(); actualValue != 4 {
|
|
t.Errorf("Got %v expected %v", actualValue, 7)
|
|
}
|
|
|
|
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 {
|
|
// retrievals
|
|
actualValue, actualFound := m.Get(test[0])
|
|
if actualValue != test[1] || actualFound != test[2] {
|
|
t.Errorf("Got %v expected %v", actualValue, test[1])
|
|
}
|
|
}
|
|
|
|
// removals
|
|
m.Remove(1)
|
|
m.Remove(4)
|
|
m.Remove(2)
|
|
m.Remove(3)
|
|
m.Remove(2)
|
|
m.Remove(2)
|
|
|
|
// Test Keys()
|
|
if actualValue, expactedValue := fmt.Sprintf("", m.Keys()...), ""; actualValue != expactedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
|
|
// test Values()
|
|
if actualValue, expactedValue := fmt.Sprintf("", m.Values()...), ""; actualValue != expactedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
|
|
// Test Size()
|
|
if actualValue := m.Size(); actualValue != 0 {
|
|
t.Errorf("Got %v expected %v", actualValue, 0)
|
|
}
|
|
|
|
// Test Empty()
|
|
if actualValue := m.Empty(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
|
|
m.Put(1, "a")
|
|
m.Put(2, "b")
|
|
m.Clear()
|
|
|
|
// Test Empty()
|
|
if actualValue := m.Empty(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
|
|
}
|
|
|
|
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 BenchmarkHashMap(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
m := New()
|
|
for n := 0; n < 1000; n++ {
|
|
m.Put(n, n)
|
|
}
|
|
for n := 0; n < 1000; n++ {
|
|
m.Remove(n)
|
|
}
|
|
}
|
|
}
|