Lines Matching refs:store
10934 VERSIONS.store(0, Relaxed);
10936 DROP_COUNTS[i].store(0, Relaxed);
13736 DROP_COUNTER.store(0, Ordering::SeqCst);
15958 a.store(true, SeqCst);
16351 /// uses to store its data. The length is the number of bytes currently stored
19523 //! (the backing store for the inner value) alive.
20995 /// store large values, that are slow to clone, but also heavy to check for equality, causing this
21430 /// itself (the backing store) from being deallocated.
23378 /// (the backing store for the value) alive.
23529 /// itself (the backing store) from being deallocated.
24661 this.inner().strong.store(1, Release);
24766 self.inner().weak.store(1, Release); // release the lock
25329 /// store large values, that are slow to clone, but also heavy to check for equality, causing this
38106 /// the node itself does not store. We only need to store the height of the root
41560 // We store drain_tail as self.head, and drain_head and self.head as
42614 // ABCDEFGHIJM...KL - swap until the left edge reaches the temp store
42615 // - then restart the algorithm with a new (smaller) store
42616 // Sometimes the temp store is reached when the right edge is at the end
47081 /// on an empty Vec, it will not allocate memory. Similarly, if you store zero-sized
49006 // may not realize the store through `ptr` through self.set_len()