map

maps/hash_map.go

@@ -0,0 +1,58 @@
+package maps
+
+import (
+	"golang.org/x/exp/constraints"
+)
+
+type hashMap[K constraints.Ordered, V any] struct {
+	m map[K]V
+}
+
+func NewHashMap[K constraints.Ordered, V any]() *hashMap[K, V] {
+	return &hashMap[K, V]{m: make(map[K]V)}
+}
+
+func newHashMap[K constraints.Ordered, V any](m map[K]V) *hashMap[K, V] {
+	return &hashMap[K, V]{m: m}
+}
+
+func (m *hashMap[K, V]) Set(key K, value V) {
+	m.m[key] = value
+}
+
+func (m *hashMap[K, V]) Get(key K) (V, bool) {
+	v, exist := m.m[key]
+	return v, exist
+}
+
+func (m *hashMap[K, V]) Delete(key K) {
+	delete(m.m, key)
+}
+
+func (m *hashMap[K, V]) Exist(key K) bool {
+	_, ok := m.m[key]
+	return ok
+}
+
+func (m *hashMap[K, V]) ForEach(f func(K, V)) {
+	for k, v := range m.m {
+		f(k, v)
+	}
+}
+
+func (m *hashMap[K, V]) Clear() {
+	m.m = make(map[K]V)
+}
+
+func (m *hashMap[K, V]) Count() int {
+	return len(m.m)
+}
+
+func (m *hashMap[K, V]) Clone() Map[K, V] {
+	r := make(map[K]V, len(m.m))
+	for k, v := range m.m {
+		r[k] = v
+	}
+
+	return newHashMap(r)
+}