map

Author: miton18

maps/maps.go

@@ -0,0 +1,74 @@
+package maps
+
+import "sync"
+
+// Map which support multi-threading
+type Map[K comparable, V any] struct {
+	lock  sync.RWMutex
+	inner map[K]V
+}
+
+func NewMap[K comparable, V any](from map[K]V) *Map[K, V] {
+	m := &Map[K, V]{
+		lock: sync.RWMutex{},
+	}
+	m.Clear()
+
+	for k, v := range from {
+		m.Set(k, v)
+	}
+
+	return m
+}
+
+func (m *Map[K, V]) Set(key K, value V) *Map[K, V] {
+	m.lock.Lock()
+	defer m.lock.Unlock()
+
+	m.inner[key] = value
+	return m
+}
+
+func (m *Map[K, V]) Get(key K) V {
+	m.lock.RLock()
+	defer m.lock.RUnlock()
+
+	return m.inner[key]
+}
+
+// Iterator implementation
+func (m *Map[K, V]) All(yield func(K, V) bool) {
+	m.lock.RLock()
+	defer m.lock.RUnlock()
+
+	for k, v := range m.inner {
+		if !yield(k, v) {
+			break
+		}
+	}
+}
+
+func (m *Map[K, V]) Delete(key K) *Map[K, V] {
+	m.lock.Lock()
+	defer m.lock.Unlock()
+
+	delete(m.inner, key)
+	return m
+}
+
+func (m *Map[K, V]) First(filter func(K, V) bool) *K {
+	for k, v := range m.inner {
+		if filter(k, v) {
+			return &k
+		}
+	}
+	return nil
+}
+
+func (m *Map[K, V]) Clear() *Map[K, V] {
+	m.lock.Lock()
+	defer m.lock.Unlock()
+
+	m.inner = make(map[K]V)
+	return m
+}

maps/maps_test.go

@@ -0,0 +1,35 @@
+package maps
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestNewMap(t *testing.T) {
+
+	tests := []struct {
+		name string
+		m    *Map[string, string]
+		want string
+	}{{
+		name: "main",
+		m: NewMap(map[string]string{
+			"1": "1",
+			"2": "2",
+			"3": "3",
+		}),
+		want: "2",
+	}}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			got := tt.m.First(func(s1, s2 string) bool { return s1 == "2" })
+
+			if got == nil {
+				t.Errorf("NewMap() = <nil>, want %v", tt.want)
+			}
+			if !reflect.DeepEqual(*got, tt.want) {
+				t.Errorf("NewMap() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}