- start on treebidimap
Emir Pasic
9 years ago
parent
16fd6c0e09
commit
20e2a00f13
@ -0,0 +1,104 @@
|
||||
// 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 treebidimap implements a bidirectional map backed by a red-black tree.
|
||||
// This structure guarantees that the map will be in both ascending key and value order.
|
||||
// The goal with this structure is to avoid duplication of elements, which can be significant if contained elements are large.
|
||||
//
|
||||
// A bidirectional map, or hash bag, is an associative data structure in which the (key,value) pairs form a one-to-one correspondence.
|
||||
// Thus the binary relation is functional in each direction: value can also act as a key to key.
|
||||
// A pair (a,b) thus provides a unique coupling between 'a' and 'b' so that 'b' can be found when 'a' is used as a key and 'a' can be found when 'b' is used as a key.
|
||||
//
|
||||
// Elements are unordered in the map.
|
||||
//
|
||||
// Structure is not thread safe.
|
||||
//
|
||||
// Reference: https://en.wikipedia.org/wiki/Bidirectional_map
|
||||
package treebidimap
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"github.com/emirpasic/gods/maps"
|
||||
"github.com/emirpasic/gods/maps/hashmap"
|
||||
)
|
||||
|
||||
func assertMapImplementation() {
|
||||
var _ maps.BidiMap = (*Map)(nil)
|
||||
}
|
||||
|
||||
// Map holds the elements in two hashmaps.
|
||||
type Map struct {
|
||||
forwardMap hashmap.Map
|
||||
inverseMap hashmap.Map
|
||||
}
|
||||
|
||||
// New instantiates a bidirectional map.
|
||||
func New() *Map {
|
||||
return &Map{*hashmap.New(), *hashmap.New()}
|
||||
}
|
||||
|
||||
// Put inserts element into the map.
|
||||
func (m *Map) Put(key interface{}, value interface{}) {
|
||||
if valueByKey, ok := m.forwardMap.Get(key); ok {
|
||||
m.inverseMap.Remove(valueByKey)
|
||||
}
|
||||
if keyByValue, ok := m.inverseMap.Get(value); ok {
|
||||
m.forwardMap.Remove(keyByValue)
|
||||
}
|
||||
m.forwardMap.Put(key, value)
|
||||
m.inverseMap.Put(value, key)
|
||||
}
|
||||
|
||||
// Get searches the element in the map by key and returns its value or nil if key is not found in map.
|
||||
// Second return parameter is true if key was found, otherwise false.
|
||||
func (m *Map) Get(key interface{}) (value interface{}, found bool) {
|
||||
return m.forwardMap.Get(key)
|
||||
}
|
||||
|
||||
// GetKey searches the element in the map by value and returns its key or nil if value is not found in map.
|
||||
// Second return parameter is true if value was found, otherwise false.
|
||||
func (m *Map) GetKey(value interface{}) (key interface{}, found bool) {
|
||||
return m.inverseMap.Get(value)
|
||||
}
|
||||
|
||||
// Remove removes the element from the map by key.
|
||||
func (m *Map) Remove(key interface{}) {
|
||||
if value, found := m.forwardMap.Get(key); found {
|
||||
m.forwardMap.Remove(key)
|
||||
m.inverseMap.Remove(value)
|
||||
}
|
||||
}
|
||||
|
||||
// Empty returns true if map does not contain any elements
|
||||
func (m *Map) Empty() bool {
|
||||
return m.Size() == 0
|
||||
}
|
||||
|
||||
// Size returns number of elements in the map.
|
||||
func (m *Map) Size() int {
|
||||
return m.forwardMap.Size()
|
||||
}
|
||||
|
||||
// Keys returns all keys (random order).
|
||||
func (m *Map) Keys() []interface{} {
|
||||
return m.forwardMap.Keys()
|
||||
}
|
||||
|
||||
// Values returns all values (random order).
|
||||
func (m *Map) Values() []interface{} {
|
||||
return m.inverseMap.Keys()
|
||||
}
|
||||
|
||||
// Clear removes all elements from the map.
|
||||
func (m *Map) Clear() {
|
||||
m.forwardMap.Clear()
|
||||
m.inverseMap.Clear()
|
||||
}
|
||||
|
||||
// String returns a string representation of container
|
||||
func (m *Map) String() string {
|
||||
str := "HashMap\n"
|
||||
str += fmt.Sprintf("%v", m.forwardMap)
|
||||
return str
|
||||
}
|
||||
@ -0,0 +1,182 @@
|
||||
// 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 treebidimap
|
||||
|
||||
import (
|
||||
"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 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 BenchmarkMap(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)
|
||||
}
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue