A map using a lock-free concurrency using left-right algo, written in Go

Fix AI slop :|

+4 -4
+4 -4
lrmap_test.go
··· 148 148 t.Errorf("created %d read handlers, cleaned up %d read handlers", created, cleanedUp) 149 149 } 150 150 151 - if len(lrmap.readHandlers) != n { 152 - t.Errorf("expected %d read handlers, got %d", n, len(lrmap.readHandlers)) 151 + if nn := len(lrmap.readHandlers); nn != n { 152 + t.Errorf("expected %d read handlers, got %d", n, nn) 153 153 } 154 154 155 155 for i := range readHandlers { ··· 162 162 t.Errorf("created %d read handlers, cleaned up %d read handlers", created, cleanedUp) 163 163 } 164 164 165 - if len(lrmap.readHandlers) != 0 { 166 - t.Errorf("expected no read handlers, got %d", len(lrmap.readHandlers)) 165 + if nn := len(lrmap.readHandlers); nn != 0 { 166 + t.Errorf("expected no read handlers, got %d", nn) 167 167 } 168 168 }