Archives
/
gods
mirror of https://github.com/emirpasic/gods
2
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

- refactor maps' tests

Browse Source
pull/15/head
Emir Pasic 8 years ago
parent 616c850bff
commit d07be9402c
2 changed files with 114 additions and 99 deletions
Show Stats Download Patch File Download Diff File

49
maps/hashmap/hashmap_test.go
Unescape Escape View File

@ -31,11 +31,8 @@ import (
"testing"
)
func TestHashMap(t *testing.T) {
func TestMapPut(t *testing.T) {
m := New()
// insertions
m.Put(5, "e")
m.Put(6, "f")
m.Put(7, "g")
@ -45,17 +42,12 @@ func TestHashMap(t *testing.T) {
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, expectedValue := m.Keys(), []interface{}{1, 2, 3, 4, 5, 6, 7}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// test Values()
if actualValue, expectedValue := m.Values(), []interface{}{"a", "b", "c", "d", "e", "f", "g"}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
@ -79,26 +71,34 @@ func TestHashMap(t *testing.T) {
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
// removals
m.Remove(5)
m.Remove(6)
m.Remove(7)
m.Remove(8)
m.Remove(5)
// test Keys()
if actualValue, expectedValue := m.Keys(), []interface{}{1, 2, 3, 4}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// test Values()
if actualValue, expectedValue := m.Values(), []interface{}{"a", "b", "c", "d"}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// Test Size()
if actualValue := m.Size(); actualValue != 4 {
t.Errorf("Got %v expected %v", actualValue, 7)
t.Errorf("Got %v expected %v", actualValue, 4)
}
tests2 := [][]interface{}{
@ -113,14 +113,12 @@ func TestHashMap(t *testing.T) {
}
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)
@ -128,35 +126,18 @@ func TestHashMap(t *testing.T) {
m.Remove(2)
m.Remove(2)
// Test Keys()
if actualValue, expectedValue := fmt.Sprintf("%s", m.Keys()), "[]"; actualValue != expectedValue {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// test Values()
if actualValue, expectedValue := fmt.Sprintf("%s", m.Values()), "[]"; actualValue != expectedValue {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// 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 {
@ -178,7 +159,7 @@ func sameElements(a []interface{}, b []interface{}) bool {
return true
}
func BenchmarkHashMap(b *testing.B) {
func BenchmarkMap(b *testing.B) {
for i := 0; i < b.N; i++ {
m := New()
for n := 0; n < 1000; n++ {

164
maps/treemap/treemap_test.go
Unescape Escape View File

@ -31,11 +31,8 @@ import (
"testing"
)
func TestTreeMap(t *testing.T) {
func TestMapPut(t *testing.T) {
m := NewWithIntComparator()
// insertions
m.Put(5, "e")
m.Put(6, "f")
m.Put(7, "g")
@ -45,31 +42,16 @@ func TestTreeMap(t *testing.T) {
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, expectedValue := fmt.Sprintf("%d%d%d%d%d%d%d", m.Keys()...), "1234567"; actualValue != expectedValue {
if actualValue, expectedValue := m.Keys(), []interface{}{1, 2, 3, 4, 5, 6, 7}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// test Values()
if actualValue, expectedValue := fmt.Sprintf("%s%s%s%s%s%s%s", m.Values()...), "abcdefg"; 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)
}
// test Min()
if key, value := m.Min(); key != 1 || value != "a" {
t.Errorf("Got %v expected %v", key, 1)
}
// test Max()
if key, value := m.Max(); key != 7 || value != "g" {
t.Errorf("Got %v expected %v", key, 7)
}
// key,expectedValue,expectedFound
tests1 := [][]interface{}{
{1, "a", true},
@ -89,27 +71,34 @@ func TestTreeMap(t *testing.T) {
t.Errorf("Got %v expected %v", actualValue, test[1])
}
}
}
func TestMapRemove(t *testing.T) {
m := NewWithIntComparator()
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
// removals
m.Remove(5)
m.Remove(6)
m.Remove(7)
m.Remove(8)
m.Remove(5)
// Test Keys()
if actualValue, expectedValue := fmt.Sprintf("%d%d%d%d", m.Keys()...), "1234"; actualValue != expectedValue {
if actualValue, expectedValue := m.Keys(), []interface{}{1, 2, 3, 4}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// test Values()
if actualValue, expectedValue := fmt.Sprintf("%s%s%s%s", m.Values()...), "abcd"; actualValue != expectedValue {
if actualValue, expectedValue := m.Values(), []interface{}{"a", "b", "c", "d"}; !sameElements(actualValue, expectedValue) {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// Test Size()
if actualValue := m.Size(); actualValue != 4 {
t.Errorf("Got %v expected %v", actualValue, 7)
t.Errorf("Got %v expected %v", actualValue, 4)
}
tests2 := [][]interface{}{
@ -124,14 +113,12 @@ func TestTreeMap(t *testing.T) {
}
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)
@ -139,53 +126,44 @@ func TestTreeMap(t *testing.T) {
m.Remove(2)
m.Remove(2)
// Test Keys()
if actualValue, expectedValue := fmt.Sprintf("%s", m.Keys()), "[]"; actualValue != expectedValue {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// test Values()
if actualValue, expectedValue := fmt.Sprintf("%s", m.Values()), "[]"; actualValue != expectedValue {
t.Errorf("Got %v expected %v", actualValue, expectedValue)
}
// 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)
}
}
// test Min()
if key, value := m.Min(); key != nil || value != nil {
t.Errorf("Got %v expected %v", key, nil)
func sameElements(a []interface{}, b []interface{}) bool {
if len(a) != len(b) {
return false
}
// test Max()
if key, value := m.Max(); key != nil || value != nil {
t.Errorf("Got %v expected %v", key, nil)
for _, av := range a {
found := false
for _, bv := range b {
if av == bv {
found = true
break
}
}
if !found {
return false
}
}
return true
}
func TestTreeMapEnumerableAndIterator(t *testing.T) {
func TestMapEach(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
// Each
count := 0
m.Each(func(key interface{}, value interface{}) {
count += 1
@ -209,8 +187,13 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
t.Errorf("Too many")
}
})
}
// Map
func TestMapMap(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
mappedMap := m.Map(func(key1 interface{}, value1 interface{}) (key2 interface{}, value2 interface{}) {
return key1, "mapped: " + key1.(string)
})
@ -226,8 +209,13 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
if mappedMap.Size() != 3 {
t.Errorf("Got %v expected %v", mappedMap.Size(), 3)
}
}
// Select
func TestMapSelect(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
selectedMap := m.Select(func(key interface{}, value interface{}) bool {
return key.(string) >= "a" && key.(string) <= "b"
})
@ -238,10 +226,15 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
t.Errorf("Got %v expected %v", actualValue, "value: b")
}
if selectedMap.Size() != 2 {
t.Errorf("Got %v expected %v", selectedMap.Size(), 3)
t.Errorf("Got %v expected %v", selectedMap.Size(), 2)
}
}
// Any
func TestMapAny(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
any := m.Any(func(key interface{}, value interface{}) bool {
return value.(int) == 3
})
@ -254,8 +247,13 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
if any != false {
t.Errorf("Got %v expected %v", any, false)
}
}
// All
func TestMapAll(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
all := m.All(func(key interface{}, value interface{}) bool {
return key.(string) >= "a" && key.(string) <= "c"
})
@ -268,8 +266,13 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
if all != false {
t.Errorf("Got %v expected %v", all, false)
}
}
// Find
func TestMapFind(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
foundKey, foundValue := m.Find(func(key interface{}, value interface{}) bool {
return key.(string) == "c"
})
@ -282,8 +285,38 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
if foundKey != nil || foundValue != nil {
t.Errorf("Got %v at %v expected %v at %v", foundValue, foundKey, nil, nil)
}
}
func TestMapChaining(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
chainedMap := m.Select(func(key interface{}, value interface{}) bool {
return value.(int) > 1
}).Map(func(key interface{}, value interface{}) (interface{}, interface{}) {
return key.(string) + key.(string), value.(int) * value.(int)
})
if actualValue := chainedMap.Size(); actualValue != 2 {
t.Errorf("Got %v expected %v", actualValue, 2)
}
if actualValue, found := chainedMap.Get("aa"); actualValue != nil || found {
t.Errorf("Got %v expected %v", actualValue, nil)
}
if actualValue, found := chainedMap.Get("bb"); actualValue != 4 || !found {
t.Errorf("Got %v expected %v", actualValue, 4)
}
if actualValue, found := chainedMap.Get("cc"); actualValue != 9 || !found {
t.Errorf("Got %v expected %v", actualValue, 9)
}
}
func TestMapIterator(t *testing.T) {
m := NewWithStringComparator()
m.Put("c", 3)
m.Put("a", 1)
m.Put("b", 2)
// Iterator
it := m.Iterator()
for it.Next() {
key := it.Key()
@ -305,6 +338,7 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
t.Errorf("Too many")
}
}
m.Clear()
it = m.Iterator()
for it.Next() {
@ -312,7 +346,7 @@ func TestTreeMapEnumerableAndIterator(t *testing.T) {
}
}
func BenchmarkTreeMap(b *testing.B) {
func BenchmarkMap(b *testing.B) {
for i := 0; i < b.N; i++ {
m := NewWithIntComparator()
for n := 0; n < 1000; n++ {

Write Preview
Loading…
Cancel
Save