From 0abe8ad0ac873436e417a9d8a683b68d68b48fda Mon Sep 17 00:00:00 2001
From: Erik Winter <e@ewintr.nl>
Date: Mon, 20 Jan 2025 10:52:03 +0100
Subject: [PATCH] mem

---
 plan/storage/memory/schedule.go      | 54 +++++++++++++++++
 plan/storage/memory/schedule_test.go | 87 ++++++++++++++++++++++++++++
 2 files changed, 141 insertions(+)
 create mode 100644 plan/storage/memory/schedule.go
 create mode 100644 plan/storage/memory/schedule_test.go

diff --git a/plan/storage/memory/schedule.go b/plan/storage/memory/schedule.go
new file mode 100644
index 0000000..84639b8
--- /dev/null
+++ b/plan/storage/memory/schedule.go
@@ -0,0 +1,54 @@
+package memory
+
+import (
+	"sync"
+
+	"go-mod.ewintr.nl/planner/item"
+	"go-mod.ewintr.nl/planner/plan/storage"
+)
+
+type Schedule struct {
+	scheds map[string]item.Schedule
+	mutex  sync.RWMutex
+}
+
+func NewSchedule() *Schedule {
+	return &Schedule{
+		scheds: make(map[string]item.Schedule),
+	}
+}
+
+func (s *Schedule) Store(sched item.Schedule) error {
+	s.mutex.Lock()
+	defer s.mutex.Unlock()
+
+	s.scheds[sched.ID] = sched
+	return nil
+}
+
+func (s *Schedule) Find(start, end item.Date) ([]item.Schedule, error) {
+	s.mutex.RLock()
+	defer s.mutex.RUnlock()
+
+	res := make([]item.Schedule, 0)
+	for _, sched := range s.scheds {
+		if start.After(sched.Date) || sched.Date.After(end) {
+			continue
+		}
+		res = append(res, sched)
+	}
+
+	return res, nil
+}
+
+func (s *Schedule) Delete(id string) error {
+	s.mutex.Lock()
+	defer s.mutex.Unlock()
+
+	if _, exists := s.scheds[id]; !exists {
+		return storage.ErrNotFound
+	}
+	delete(s.scheds, id)
+
+	return nil
+}
diff --git a/plan/storage/memory/schedule_test.go b/plan/storage/memory/schedule_test.go
new file mode 100644
index 0000000..458e3fc
--- /dev/null
+++ b/plan/storage/memory/schedule_test.go
@@ -0,0 +1,87 @@
+package memory_test
+
+import (
+	"sort"
+	"testing"
+
+	"github.com/google/go-cmp/cmp"
+	"go-mod.ewintr.nl/planner/item"
+	"go-mod.ewintr.nl/planner/plan/storage/memory"
+)
+
+func TestSchedule(t *testing.T) {
+	t.Parallel()
+
+	mem := memory.NewSchedule()
+
+	actScheds, actErr := mem.Find(item.NewDateFromString("1900-01-01"), item.NewDateFromString("9999-12-31"))
+	if actErr != nil {
+		t.Errorf("exp nil, got %v", actErr)
+	}
+	if len(actScheds) != 0 {
+		t.Errorf("exp 0, got %d", len(actScheds))
+	}
+
+	s1 := item.Schedule{
+		ID:   "id-1",
+		Date: item.NewDateFromString("2025-01-20"),
+	}
+	if err := mem.Store(s1); err != nil {
+		t.Errorf("exp nil, got %v", err)
+	}
+	s2 := item.Schedule{
+		ID:   "id-2",
+		Date: item.NewDateFromString("2025-01-21"),
+	}
+	if err := mem.Store(s2); err != nil {
+		t.Errorf("exp nil, got %v", err)
+	}
+
+	for _, tc := range []struct {
+		name  string
+		start string
+		end   string
+		exp   []string
+	}{
+		{
+			name:  "all",
+			start: "1900-01-01",
+			end:   "9999-12-31",
+			exp:   []string{s1.ID, s2.ID},
+		},
+		{
+			name:  "last",
+			start: s2.Date.String(),
+			end:   "9999-12-31",
+			exp:   []string{s2.ID},
+		},
+		{
+			name:  "first",
+			start: "1900-01-01",
+			end:   s1.Date.String(),
+			exp:   []string{s1.ID},
+		},
+		{
+			name:  "none",
+			start: "1900-01-01",
+			end:   "2025-01-01",
+			exp:   make([]string, 0),
+		},
+	} {
+		t.Run(tc.name, func(t *testing.T) {
+			actScheds, actErr = mem.Find(item.NewDateFromString(tc.start), item.NewDateFromString(tc.end))
+			if actErr != nil {
+				t.Errorf("exp nil, got %v", actErr)
+			}
+			actIDs := make([]string, 0, len(actScheds))
+			for _, s := range actScheds {
+				actIDs = append(actIDs, s.ID)
+			}
+			sort.Strings(actIDs)
+			if diff := cmp.Diff(tc.exp, actIDs); diff != "" {
+				t.Errorf("(+exp, -got)%s\n", diff)
+			}
+		})
+	}
+
+}