aboutsummaryrefslogtreecommitdiffhomepage
path: root/internal/app/state/state_test.go
diff options
context:
space:
mode:
authorOphestra <cat@gensokyo.uk>2025-10-25 21:28:49 +0900
committerOphestra <cat@gensokyo.uk>2025-10-25 21:29:24 +0900
commit470e545d2761b77f95147f61f633f4d629750ee7 (patch)
tree5badf0a34ecaa1487e88ffe6aa0467f7d55cd4c4 /internal/app/state/state_test.go
parent8d3381821f2a8d257a4c55c0dd311019bd0e78eb (diff)
internal/app/state: use internal/lockedfile
This is a pretty solid implementation backed by robust tests, with a much cleaner interface. Signed-off-by: Ophestra <cat@gensokyo.uk>
Diffstat (limited to 'internal/app/state/state_test.go')
-rw-r--r--internal/app/state/state_test.go83
1 files changed, 35 insertions, 48 deletions
diff --git a/internal/app/state/state_test.go b/internal/app/state/state_test.go
index 2e191f31..a334c348 100644
--- a/internal/app/state/state_test.go
+++ b/internal/app/state/state_test.go
@@ -62,62 +62,49 @@ func testStore(t *testing.T, s state.Store) {
})
}
- t.Run("insert entry checked", func(t *testing.T) {
- insert(insertEntryChecked, 0)
- check(insertEntryChecked, 0)
- })
+ // insert entry checked
+ insert(insertEntryChecked, 0)
+ check(insertEntryChecked, 0)
- t.Run("insert entry unchecked", func(t *testing.T) {
- insert(insertEntryNoCheck, 0)
- })
+ // insert entry unchecked
+ insert(insertEntryNoCheck, 0)
- t.Run("insert entry different identity", func(t *testing.T) {
- insert(insertEntryOtherApp, 1)
- check(insertEntryOtherApp, 1)
- })
+ // insert entry different identity
+ insert(insertEntryOtherApp, 1)
+ check(insertEntryOtherApp, 1)
- t.Run("check previous insertion", func(t *testing.T) {
- check(insertEntryNoCheck, 0)
- })
+ // check previous insertion
+ check(insertEntryNoCheck, 0)
- t.Run("list identities", func(t *testing.T) {
- if identities, err := s.List(); err != nil {
- t.Fatalf("List: error = %v", err)
- } else {
- slices.Sort(identities)
- want := []int{0, 1}
- if !slices.Equal(identities, want) {
- t.Fatalf("List() = %#v, want %#v", identities, want)
- }
+ // list identities
+ if identities, err := s.List(); err != nil {
+ t.Fatalf("List: error = %v", err)
+ } else {
+ slices.Sort(identities)
+ want := []int{0, 1}
+ if !slices.Equal(identities, want) {
+ t.Fatalf("List() = %#v, want %#v", identities, want)
}
- })
+ }
- t.Run("join store", func(t *testing.T) {
- if entries, err := state.Join(s); err != nil {
- t.Fatalf("Join: error = %v", err)
- } else if len(entries) != 3 {
- t.Fatalf("Join(s) = %#v", entries)
- }
- })
+ // join store
+ if entries, err := state.Join(s); err != nil {
+ t.Fatalf("Join: error = %v", err)
+ } else if len(entries) != 3 {
+ t.Fatalf("Join(s) = %#v", entries)
+ }
- t.Run("clear identity 1", func(t *testing.T) {
- do(1, func(c state.Cursor) {
- if err := c.Destroy(tc[insertEntryOtherApp].ID); err != nil {
- t.Fatalf("Destroy: error = %v", err)
- }
- })
- do(1, func(c state.Cursor) {
- if l, err := c.Len(); err != nil {
- t.Fatalf("Len: error = %v", err)
- } else if l != 0 {
- t.Fatalf("Len: %d, want 0", l)
- }
- })
+ // clear identity 1
+ do(1, func(c state.Cursor) {
+ if err := c.Destroy(tc[insertEntryOtherApp].ID); err != nil {
+ t.Fatalf("Destroy: error = %v", err)
+ }
})
-
- t.Run("close store", func(t *testing.T) {
- if err := s.Close(); err != nil {
- t.Fatalf("Close: error = %v", err)
+ do(1, func(c state.Cursor) {
+ if l, err := c.Len(); err != nil {
+ t.Fatalf("Len: error = %v", err)
+ } else if l != 0 {
+ t.Fatalf("Len: %d, want 0", l)
}
})
}