Erik Brakkee
fd18a63360
Using LinkedMap that preserves insertion order for the implementation and also added unit tests for that.
131 lines
2.9 KiB
Go
131 lines
2.9 KiB
Go
package collections
|
|
|
|
import (
|
|
"github.com/stretchr/testify/assert"
|
|
"os"
|
|
"testing"
|
|
)
|
|
|
|
func TestMain(m *testing.M) {
|
|
checkStatus = true
|
|
exitCode := m.Run()
|
|
checkStatus = false
|
|
os.Exit(exitCode)
|
|
}
|
|
|
|
func contentCheck(t *testing.T, m *LinkedMap[string, int],
|
|
keys []string, values []int) {
|
|
|
|
assert.True(t, len(keys) == len(values), "input error expected keys and values differ in length")
|
|
|
|
// keys
|
|
i := 0
|
|
for key := range m.RangeKeys() {
|
|
assert.True(t, i < len(keys), "Too many elements in map")
|
|
assert.Equal(t, keys[i], key)
|
|
i++
|
|
}
|
|
assert.Equal(t, len(keys), i)
|
|
|
|
// values
|
|
i = 0
|
|
for value := range m.RangeValues() {
|
|
assert.True(t, i < len(values), "Too many elements in map")
|
|
assert.Equal(t, values[i], value)
|
|
i++
|
|
}
|
|
assert.Equal(t, len(values), i)
|
|
|
|
// Entries
|
|
i = 0
|
|
for entry := range m.RangeEntries() {
|
|
assert.True(t, i < len(values), "Too many elements in map")
|
|
assert.Equal(t, keys[i], entry.Key)
|
|
assert.Equal(t, values[i], entry.Value)
|
|
i++
|
|
}
|
|
assert.Equal(t, len(values), i)
|
|
|
|
// Get and Contains
|
|
for i, key := range keys {
|
|
v, ok := m.Get(key)
|
|
assert.True(t, ok)
|
|
assert.Equal(t, values[i], v)
|
|
assert.True(t, m.Contains(key))
|
|
}
|
|
}
|
|
|
|
func Test_emptymap(t *testing.T) {
|
|
m := NewLinkedMap[string, int]()
|
|
contentCheck(t, m, []string{}, []int{})
|
|
}
|
|
|
|
func Test_elementAddRemove(t *testing.T) {
|
|
m := NewLinkedMap[string, int]()
|
|
m.Put("a", 1)
|
|
contentCheck(t, m, []string{"a"}, []int{1})
|
|
|
|
assert.False(t, m.Delete("b"))
|
|
contentCheck(t, m, []string{"a"}, []int{1})
|
|
|
|
assert.True(t, m.Delete("a"))
|
|
contentCheck(t, m, []string{}, []int{})
|
|
}
|
|
|
|
func Test_GetContainsForElementsNotInMap(t *testing.T) {
|
|
m := createSimpleMap(t)
|
|
|
|
assert.False(t, m.Contains("d"))
|
|
val, ok := m.Get("d")
|
|
assert.False(t, ok)
|
|
assert.Equal(t, 0, val)
|
|
}
|
|
|
|
func Test_elementRemoveBeginning(t *testing.T) {
|
|
m := createSimpleMap(t)
|
|
|
|
assert.True(t, m.Delete("a"))
|
|
contentCheck(t, m, []string{"b", "c"}, []int{2, 3})
|
|
}
|
|
|
|
func Test_elementRemoveMiddle(t *testing.T) {
|
|
m := createSimpleMap(t)
|
|
|
|
assert.True(t, m.Delete("b"))
|
|
contentCheck(t, m, []string{"a", "c"}, []int{1, 3})
|
|
}
|
|
|
|
func Test_elementRemoveEnd(t *testing.T) {
|
|
m := createSimpleMap(t)
|
|
|
|
assert.True(t, m.Delete("c"))
|
|
contentCheck(t, m, []string{"a", "b"}, []int{1, 2})
|
|
}
|
|
|
|
func Test_addSameElementAgain(t *testing.T) {
|
|
m := createSimpleMap(t)
|
|
|
|
m.Put("b", 4)
|
|
contentCheck(t, m, []string{"a", "c", "b"}, []int{1, 3, 4})
|
|
}
|
|
|
|
func createSimpleMap(t *testing.T) *LinkedMap[string, int] {
|
|
m := NewLinkedMap[string, int]()
|
|
m.Put("a", 1)
|
|
m.Put("b", 2)
|
|
m.Put("c", 3)
|
|
contentCheck(t, m, []string{"a", "b", "c"}, []int{1, 2, 3})
|
|
return m
|
|
}
|
|
|
|
func Test_manyElements(t *testing.T) {
|
|
m := NewLinkedMap[string, int]()
|
|
chars := "0123456789"
|
|
for i := 0; i < 10000; i++ {
|
|
m.Put(chars[i%10:i%10+1], i)
|
|
}
|
|
contentCheck(t, m,
|
|
[]string{"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"},
|
|
[]int{9990, 9991, 9992, 9993, 9994, 9995, 9996, 9997, 9998, 9999})
|
|
}
|