cmd: continue lint fixes.

cache/lru/lru_internal_test.go

@@ -1,87 +1,87 @@
 package lru
 
 import (
-    "testing"
-    "time"
+	"testing"
+	"time"
 
-    "github.com/benbjohnson/clock"
+	"github.com/benbjohnson/clock"
 )
 
 // These tests mirror the MRU-style behavior present in this LRU package
 // implementation (eviction removes the most-recently-used entry).
 func TestBasicCacheEviction(t *testing.T) {
-    mock := clock.NewMock()
-    c := NewStringKeyCache[int](2)
-    c.clock = mock
+	mock := clock.NewMock()
+	c := NewStringKeyCache[int](2)
+	c.clock = mock
 
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    if c.Len() != 0 {
-        t.Fatal("cache should have size 0")
-    }
+	if c.Len() != 0 {
+		t.Fatal("cache should have size 0")
+	}
 
-    c.evict()
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	c.evict()
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    c.Store("raven", 1)
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	c.Store("raven", 1)
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    if len(c.store) != 1 {
-        t.Fatalf("store should have length=1, have length=%d", len(c.store))
-    }
+	if len(c.store) != 1 {
+		t.Fatalf("store should have length=1, have length=%d", len(c.store))
+	}
 
-    mock.Add(time.Second)
-    c.Store("owl", 2)
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	mock.Add(time.Second)
+	c.Store("owl", 2)
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    if len(c.store) != 2 {
-        t.Fatalf("store should have length=2, have length=%d", len(c.store))
-    }
+	if len(c.store) != 2 {
+		t.Fatalf("store should have length=2, have length=%d", len(c.store))
+	}
 
-    mock.Add(time.Second)
-    c.Store("goat", 3)
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	mock.Add(time.Second)
+	c.Store("goat", 3)
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    if len(c.store) != 2 {
-        t.Fatalf("store should have length=2, have length=%d", len(c.store))
-    }
+	if len(c.store) != 2 {
+		t.Fatalf("store should have length=2, have length=%d", len(c.store))
+	}
 
-    // Since this implementation evicts the most-recently-used item, inserting
-    // "goat" when full evicts "owl" (the most recent at that time).
-    mock.Add(time.Second)
-    if _, ok := c.Get("owl"); ok {
-        t.Fatal("store should not have an entry for owl (MRU-evicted)")
-    }
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	// Since this implementation evicts the most-recently-used item, inserting
+	// "goat" when full evicts "owl" (the most recent at that time).
+	mock.Add(time.Second)
+	if _, ok := c.Get("owl"); ok {
+		t.Fatal("store should not have an entry for owl (MRU-evicted)")
+	}
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    mock.Add(time.Second)
-    c.Store("elk", 4)
-    if err := c.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	mock.Add(time.Second)
+	c.Store("elk", 4)
+	if err := c.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    if !c.Has("elk") {
-        t.Fatal("store should contain an entry for 'elk'")
-    }
+	if !c.Has("elk") {
+		t.Fatal("store should contain an entry for 'elk'")
+	}
 
-    // Before storing elk, keys were: raven (older), goat (newer). Evict MRU -> goat.
-    if !c.Has("raven") {
-        t.Fatal("store should contain an entry for 'raven'")
-    }
+	// Before storing elk, keys were: raven (older), goat (newer). Evict MRU -> goat.
+	if !c.Has("raven") {
+		t.Fatal("store should contain an entry for 'raven'")
+	}
 
-    if c.Has("goat") {
-        t.Fatal("store should not contain an entry for 'goat'")
-    }
+	if c.Has("goat") {
+		t.Fatal("store should not contain an entry for 'goat'")
+	}
 }

cache/lru/timestamps_internal_test.go

@@ -1,50 +1,50 @@
 package lru
 
 import (
-    "testing"
-    "time"
+	"testing"
+	"time"
 
-    "github.com/benbjohnson/clock"
+	"github.com/benbjohnson/clock"
 )
 
 // These tests validate timestamps ordering semantics for the LRU package.
 // Note: The LRU timestamps are sorted with most-recent-first (descending by t).
 func TestTimestamps(t *testing.T) {
-    ts := newTimestamps[string](3)
-    mock := clock.NewMock()
+	ts := newTimestamps[string](3)
+	mock := clock.NewMock()
 
-    // raven
-    ts.Update("raven", mock.Now().UnixNano())
+	// raven
+	ts.Update("raven", mock.Now().UnixNano())
 
-    // raven, owl
-    mock.Add(time.Millisecond)
-    ts.Update("owl", mock.Now().UnixNano())
+	// raven, owl
+	mock.Add(time.Millisecond)
+	ts.Update("owl", mock.Now().UnixNano())
 
-    // raven, owl, goat
-    mock.Add(time.Second)
-    ts.Update("goat", mock.Now().UnixNano())
+	// raven, owl, goat
+	mock.Add(time.Second)
+	ts.Update("goat", mock.Now().UnixNano())
 
-    if err := ts.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	if err := ts.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    // make owl the most recent
-    mock.Add(time.Millisecond)
-    ts.Update("owl", mock.Now().UnixNano())
-    if err := ts.ConsistencyCheck(); err != nil {
-        t.Fatal(err)
-    }
+	// make owl the most recent
+	mock.Add(time.Millisecond)
+	ts.Update("owl", mock.Now().UnixNano())
+	if err := ts.ConsistencyCheck(); err != nil {
+		t.Fatal(err)
+	}
 
-    // For LRU timestamps: most recent first. Expected order: owl, goat, raven.
-    if ts.K(0) != "owl" {
-        t.Fatalf("first key should be owl, have %s", ts.K(0))
-    }
+	// For LRU timestamps: most recent first. Expected order: owl, goat, raven.
+	if ts.K(0) != "owl" {
+		t.Fatalf("first key should be owl, have %s", ts.K(0))
+	}
 
-    if ts.K(1) != "goat" {
-        t.Fatalf("second key should be goat, have %s", ts.K(1))
-    }
+	if ts.K(1) != "goat" {
+		t.Fatalf("second key should be goat, have %s", ts.K(1))
+	}
 
-    if ts.K(2) != "raven" {
-        t.Fatalf("third key should be raven, have %s", ts.K(2))
-    }
+	if ts.K(2) != "raven" {
+		t.Fatalf("third key should be raven, have %s", ts.K(2))
+	}
 }