A map using a lock-free concurrency using left-right algo, written in Go
Another cosmetic change
authored by
Johannes Kohnen
and committed by
+2
-6
+2
-6
lrmap.go2
+2
-6
lrmap.go2
···
141
141
)
142
142
143
143
switch read {
144
-
case nil:
145
-
// initial case: start with left map as reader, right map as writer
146
-
read = &(m.left)
147
-
write = &(m.right)
148
-
case &(m.left):
144
+
case nil /* initial case */, &(m.left):
149
145
read = &(m.right)
150
146
write = &(m.left)
151
147
case &(m.right):
···
259
255
260
256
func (rh *ReadHandler[K, V]) assertReady() {
261
257
if rh.inner == nil {
262
-
panic("reader illegal state: must create with NewReadHandler()") // TODO
258
+
panic("reader illegal state: must create with NewReadHandler()")
263
259
}
264
260
265
261
if !rh.ready {