mpvrc/search.desc/crossbeam_utils/crossbeam_utils-desc-0-.js

searchState.loadedDescShard("crossbeam_utils", 0, "Miscellaneous tools for concurrent programming.\nPerforms exponential backoff in spin loops.\nPads and aligns a value to the length of a cache line.\nAtomic types.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nReturns the inner value.\nReturns <code>true</code> if exponential backoff has completed and …\nCreates a new <code>Backoff</code>.\nPads and aligns a value to the length of a cache line.\nResets the <code>Backoff</code>.\nBacks off in a blocking loop.\nBacks off in a lock-free loop.\nThread synchronization primitives.\nThreads that can borrow variables from the stack.\nA thread-safe mutable memory location.\nTrait which allows reading from primitive atomic types …\nType returned by <code>load_consume</code>.\nReturns a raw pointer to the underlying data in this …\nIf the current value equals <code>current</code>, stores <code>new</code> into the …\nIf the current value equals <code>current</code>, stores <code>new</code> into the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nIncrements the current value by <code>val</code> and returns the …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies logical “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nApplies bitwise “and” to the current value and returns …\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the maximum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nCompares and sets the minimum of the current value and <code>val</code>,\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies logical “nand” to the current value and …\nApplies bitwise “nand” to the current value and …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies logical “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nApplies bitwise “or” to the current value and returns …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nDecrements the current value by <code>val</code> and returns the …\nFetches the value, and applies a function to it that …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies logical “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nApplies bitwise “xor” to the current value and returns …\nReturns the argument unchanged.\nCalls <code>U::from(self)</code>.\nConsumes the atomic and returns the contained value.\nReturns <code>true</code> if operations on values of this type are …\nLoads a value from the atomic cell.\nLoads a value from the atomic using a “consume” memory …\nCreates a new atomic cell initialized with <code>val</code>.\nStores <code>val</code> into the atomic cell.\nStores <code>val</code> into the atomic cell and returns the previous …\nTakes the value of the atomic cell, leaving …\nA thread parking primitive.\nA sharded reader-writer lock.\nA guard used to release the shared read access of a …\nA guard used to release the exclusive write access of a …\nUnparks a thread parked by the associated <code>Parker</code>.\nEnables threads to synchronize the beginning or end of …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nConverts a raw pointer into a <code>Parker</code>.\nConverts a raw pointer into an <code>Unparker</code>.\nReturns a mutable reference to the underlying data.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nConsumes this lock, returning the underlying data.\nConverts a <code>Parker</code> into a raw pointer.\nConverts an <code>Unparker</code> into a raw pointer.\nReturns <code>true</code> if the lock is poisoned.\nCreates a new <code>Parker</code>.\nCreates a new sharded reader-writer lock.\nCreates a new wait group and returns the single reference …\nBlocks the current thread until the token is made …\nBlocks the current thread until the token is made …\nBlocks the current thread until the token is made …\nLocks with shared read access, blocking the current thread …\nAttempts to acquire this lock with shared read access.\nAttempts to acquire this lock with exclusive write access.\nAtomically makes the token available if it is not already.\nReturns a reference to an associated <code>Unparker</code>.\nDrops this reference and waits until all other references …\nLocks with exclusive write access, blocking the current …\nA scope for spawning threads.\nA handle that can be used to join its scoped thread.\nConfigures the properties of a new thread.\nCreates a builder that can configure a thread before …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nWaits for the thread to finish and returns its result.\nSets the name for the new thread.\nCreates a new scope for spawning threads.\nSpawns a scoped thread.\nSpawns a scoped thread with this configuration.\nSets the size of the stack for the new thread.\nReturns a handle to the underlying thread.")