@@ -27,8 +27,8 @@ pub struct List<K, V> {
27
27
head : Atomic < Node < K , V > > ,
28
28
}
29
29
30
- // Unlike stack and queue, we need `K` and `V` to be `Sync` for the list to be `Sync`,
31
- // as both `K` and `V` are accessed concurrently in `find` and `delete`, respectively.
30
+ // Unlike stack and queue, we need `K` and `V` to be `Sync` for the list to be `Sync`, as both `K`
31
+ // and `V` are accessed concurrently in `find` and `delete`, respectively.
32
32
unsafe impl < K : Sync , V : Sync > Sync for List < K , V > { }
33
33
unsafe impl < K : Send , V : Send > Send for List < K , V > { }
34
34
@@ -155,8 +155,8 @@ where
155
155
while node. with_tag ( 0 ) != self . curr {
156
156
// SAFETY: All nodes in the unlinked chain are not null.
157
157
//
158
- // NOTE: It may seem like this load could be non-atomic, but that would
159
- // race with the `fetch_or` done in `remove`.
158
+ // NOTE: It may seem like this load could be non-atomic, but that would race with the
159
+ // `fetch_or` done in `remove`.
160
160
let next = unsafe { node. deref ( ) } . next . load ( Relaxed , guard) ;
161
161
162
162
// SAFETY: we unlinked the chain with above CAS.
0 commit comments