Add delete feature

bimap.go

@@ -1,43 +1,60 @@
 package bimap
 
-type BiMap struct {
+type biMap struct {
 	forward map[string]string
 	inverse map[string]string
 }
 
-func NewBiMap() *BiMap {
-	return &BiMap{forward: make(map[string]string), inverse: make(map[string]string)}
+func NewBiMap() *biMap {
+	return &biMap{forward: make(map[string]string), inverse: make(map[string]string)}
 }
 
-func (b *BiMap) Insert(k string, v string) {
+
+func (b *biMap) Insert(k string, v string) {
 	b.forward[k] = v
 	b.inverse[v] = k
 }
 
-func (b *BiMap) Exists(k string) bool {
+func (b *biMap) Exists(k string) bool {
 	_, ok := b.forward[k]
 	return ok
 }
 
-func (b *BiMap) InverseExists(k string) bool {
+func (b *biMap) InverseExists(k string) bool {
 	_, ok := b.inverse[k]
 	return ok
 }
 
-func (b *BiMap) Get(k string) (string, bool) {
+func (b *biMap) Get(k string) (string, bool) {
 	if b.Exists(k) {
 		return b.forward[k], true
 	}
 	return "", false
 }
 
-func (b *BiMap) GetInverse(k string) (string, bool) {
+func (b *biMap) InverseGet(k string) (string, bool) {
 	if b.InverseExists(k) {
 		return b.inverse[k], true
 	}
 	return "", false
 }
 
-func (b*BiMap) Size() int {
+func (b *biMap) Delete(k string) {
+	if b.Exists(k) {
+		val, _ := b.Get(k)
+		delete(b.forward, k)
+		delete(b.inverse, val)
+	}
+}
+
+func (b *biMap) InverseDelete(v string) {
+	if b.InverseExists(v) {
+		key, _ := b.InverseGet(v)
+		delete(b.inverse, v)
+		delete(b.forward, key)
+	}
+}
+
+func (b*biMap) Size() int {
 	return len(b.forward)
 }

bimap_test.go

@@ -5,8 +5,141 @@ import (
 	"github.com/stretchr/testify/assert"
 )
 
+
+const key = "key"
+const value = "value"
+
 func TestNewBiMap(t *testing.T) {
-	biMap := NewBiMap()
-	expected := BiMap{forward:make(map[string]string), inverse:make(map[string]string)}
-	assert.Equal(t, *biMap, expected, "They should be equal")
+	actual := NewBiMap()
+	expected := biMap{forward:make(map[string]string), inverse:make(map[string]string)}
+	assert.Equal(t, expected, *actual, "They should be equal")
 }
+
+func TestBiMap_Insert(t *testing.T) {
+	actual := NewBiMap()
+	actual.Insert(key, value)
+
+	fwdExpected := make(map[string]string)
+	invExpected := make(map[string]string)
+	fwdExpected[key] = value
+	invExpected[value] = key
+	expected := biMap{forward:fwdExpected, inverse:invExpected}
+
+	assert.Equal(t, expected, *actual, "They should be equal")
+}
+
+func TestBiMap_Exists(t *testing.T) {
+	actual := NewBiMap()
+
+	actual.Insert(key, value)
+	assert.False(t, actual.Exists("ARBITARY_KEY"), "Key should not exist")
+	assert.True(t, actual.Exists(key), "Inserted key should exist")
+}
+
+func TestBiMap_InverseExists(t *testing.T) {
+	actual := NewBiMap()
+
+	actual.Insert(key, value)
+	assert.False(t, actual.InverseExists("ARBITARY_VALUE"), "Value should not exist")
+	assert.True(t, actual.InverseExists(value), "Inserted value should exist")
+}
+
+func TestBiMap_Get(t *testing.T) {
+	actual := NewBiMap()
+
+	actual.Insert(key, value)
+
+	actualVal, ok := actual.Get(key)
+
+	assert.True(t, ok, "It should return true")
+	assert.Equal(t, value, actualVal,  "Value and returned val should be equal")
+
+	actualVal, ok = actual.Get(value)
+
+	assert.False(t, ok, "It should return false")
+	assert.Empty(t, actualVal, "Actual val should be empty")
+}
+
+func TestBiMap_GetInverse(t *testing.T) {
+	actual := NewBiMap()
+
+	actual.Insert(key, value)
+
+	actualKey, ok := actual.InverseGet(value)
+
+	assert.True(t, ok, "It should return true")
+	assert.Equal(t, key, actualKey,"Key and returned key should be equal")
+
+	actualKey, ok = actual.Get(value)
+
+	assert.False(t, ok, "It should return false")
+	assert.Empty(t, actualKey, "Actual key should be empty")
+}
+
+func TestBiMap_Size(t *testing.T) {
+	actual := NewBiMap()
+
+	assert.Equal(t, 0, actual.Size(), "Length of empty bimap should be zero")
+
+	actual.Insert(key, value)
+
+	assert.Equal(t, 1, actual.Size(), "Length of bimap should be one")
+}
+
+func TestBiMap_Delete(t *testing.T) {
+	actual := NewBiMap()
+	dummyKey := "DummyKey"
+	dummyVal := "DummyVal"
+	actual.Insert(key, value)
+	actual.Insert(dummyKey, dummyVal)
+
+	assert.Equal(t, 2, actual.Size(), "Size of bimap should be two")
+
+	actual.Delete(dummyKey)
+
+	fwdExpected := make(map[string]string)
+	invExpected := make(map[string]string)
+	fwdExpected[key] = value
+	invExpected[value] = key
+
+	expected := biMap{forward:fwdExpected, inverse:invExpected}
+
+	assert.Equal(t, 1, actual.Size(), "Size of bimap should be two")
+	assert.Equal(t, expected, *actual, "They should be the same")
+
+	actual.Delete(dummyKey)
+
+	assert.Equal(t, 1, actual.Size(), "Size of bimap should be two")
+	assert.Equal(t, expected, *actual, "They should be the same")
+}
+
+func TestBiMap_InverseDelete(t *testing.T) {
+	actual := NewBiMap()
+	dummyKey := "DummyKey"
+	dummyVal := "DummyVal"
+	actual.Insert(key, value)
+	actual.Insert(dummyKey, dummyVal)
+
+	assert.Equal(t, 2, actual.Size(), "Size of bimap should be two")
+
+	actual.InverseDelete(dummyVal)
+
+	fwdExpected := make(map[string]string)
+	invExpected := make(map[string]string)
+	fwdExpected[key] = value
+	invExpected[value] = key
+
+	expected := biMap{forward:fwdExpected, inverse:invExpected}
+
+	assert.Equal(t, 1, actual.Size(), "Size of bimap should be two")
+	assert.Equal(t, expected, *actual, "They should be the same")
+
+	actual.InverseDelete(dummyVal)
+
+	assert.Equal(t, 1, actual.Size(), "Size of bimap should be two")
+	assert.Equal(t, expected, *actual, "They should be the same")
+}
+
+
+
+