eson
368447c31d
new file: LICENSE new file: README.md new file: compare/compare.go new file: for_test.go new file: heap/heap.go new file: heap/heap_test.go new file: interface.go new file: lastack/lastack.go new file: lastack/lastack_test.go new file: list/list.go new file: list/list_test.go new file: map/hashmap/hashmap.go new file: map/hashmap/hashmap_test.go new file: priority_list/iterator.go new file: priority_list/priority_list.go new file: priority_list/priority_list_test.go new file: priority_queue/iterator.go new file: priority_queue/priority_queue.go new file: priority_queue/priority_queue_test.go new file: priority_queue/vbt.go new file: priority_queue/vbt_test.go new file: priority_queuekey/iterator.go new file: priority_queuekey/priority_queuekey.go new file: priority_queuekey/priority_queuekey_test.go new file: priority_queuekey/vbt.go new file: priority_queuekey/vbt_test.go new file: set/hashset/hashset.go new file: set/hashset/hashset_test.go new file: set/treeset/treeset.go new file: set/treeset/treeset_test.go new file: sparse_array/array2/array2.go new file: sparse_array/array2/array2_test.go new file: sparse_array/array3/array3.go new file: sparse_array/array3/array3_test.go new file: sparse_array/arrayn/arrayn.go new file: sparse_array/arrayn/arrayn_test.go new file: stack/stack.go new file: stack/stack_test.go new file: tree/avl/avl.go new file: tree/avl/avl_test.go new file: tree/avl/iterator.go new file: tree/avldup/avldup.go new file: tree/avldup/avldup_test.go new file: tree/avldup/iterator.go new file: tree/avlkey/avlkey.go new file: tree/avlkey/avlkey_test.go new file: tree/avlkey/iterator.go new file: tree/avlkeydup/avlkeydup.go new file: tree/avlkeydup/avlkeydup_test.go new file: tree/avlkeydup/iterator.go new file: tree/vbt/iterator.go new file: tree/vbt/vbt.go new file: tree/vbt/vbt_test.go new file: tree/vbtkey/iterator.go new file: tree/vbtkey/vbtkey.go new file: tree/vbtkey/vbtkey_test.go
64 lines
1.1 KiB
Go
64 lines
1.1 KiB
Go
package hashmap
|
|
|
|
import "fmt"
|
|
|
|
type HashMap struct {
|
|
hm map[interface{}]interface{}
|
|
}
|
|
|
|
// New instantiates a hash map.
|
|
func New() *HashMap {
|
|
return &HashMap{hm: make(map[interface{}]interface{})}
|
|
}
|
|
|
|
// Put inserts element into the map.
|
|
func (hm *HashMap) Put(key interface{}, value interface{}) {
|
|
hm.hm[key] = value
|
|
}
|
|
|
|
func (hm *HashMap) Get(key interface{}) (value interface{}, isfound bool) {
|
|
value, isfound = hm.hm[key]
|
|
return
|
|
}
|
|
|
|
func (hm *HashMap) Remove(key interface{}) {
|
|
delete(hm.hm, key)
|
|
}
|
|
|
|
func (hm *HashMap) Empty() bool {
|
|
return len(hm.hm) == 0
|
|
}
|
|
|
|
func (hm *HashMap) Size() int {
|
|
return len(hm.hm)
|
|
}
|
|
|
|
func (hm *HashMap) Keys() []interface{} {
|
|
keys := make([]interface{}, len(hm.hm))
|
|
count := 0
|
|
for key := range hm.hm {
|
|
keys[count] = key
|
|
count++
|
|
}
|
|
return keys
|
|
}
|
|
|
|
func (hm *HashMap) Values() []interface{} {
|
|
values := make([]interface{}, len(hm.hm))
|
|
count := 0
|
|
for _, value := range hm.hm {
|
|
values[count] = value
|
|
count++
|
|
}
|
|
return values
|
|
}
|
|
|
|
func (hm *HashMap) Clear() {
|
|
hm.hm = make(map[interface{}]interface{})
|
|
}
|
|
|
|
func (hm *HashMap) String() string {
|
|
str := fmt.Sprintf("%v", hm.hm)
|
|
return str
|
|
}
|