rtic/1/api/search.desc/spin/spin-desc-0-.js

1 line
6.7 KiB
JavaScript
Raw Normal View History

searchState.loadedDescShard("spin", 0, "This crate provides spin-based versions of the primitives \nA primitive that synchronizes the execution of multiple \nA value which is initialized on the first access. See \nA primitive that synchronizes the execution of multiple \nA primitive that provides lazy one-time initialization. \nA lock that provides data access to either one writer or \nA guard that provides immutable data access but can be \nA guard that provides mutable data access. See \nSynchronization primitive allowing multiple threads to \nSynchronization primitives for lazy evaluation.\nSpin synchronisation primitives, but compatible with \nLocks that have the same behaviour as a mutex.\nSynchronization primitives for one-time evaluation.\nStrategies that determine the behaviour of locks when \nA lock that provides data access to either one writer or \nA primitive that synchronizes the execution of multiple \nA <code>BarrierWaitResult</code> is returned by <code>wait</code> when all threads \nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nReturns whether this thread from <code>wait</code> is the leader \nCreates a new barrier that can block a given number of \nBlocks the current thread until all threads have \nA value which is initialized on the first access.\nRetrieves a mutable pointer to the inner data.\nCreates a new lazy value using <code>Default</code> as the initializing \nForces the evaluation of this lazy value and returns a \nReturns the argument unchanged.\nCalls <code>U::from(self)</code>.\nCreates a new lazy value with the given initializing \nA lock that provides mutually exclusive data access \nA guard that provides mutable data access (compatible with \nA lock that provides data access to either one writer or \nA guard that provides immutable data access (compatible \nA guard that provides immutable data access but can be \nA guard that provides mutable data access (compatible with \nA spin-based lock providing mutually exclusive access to \nA generic guard that will protect some data access and \nForce unlock this <code>Mutex</code>.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns a mutable reference to the underlying data.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nConsumes this <code>Mutex</code> and unwraps the underlying data.\nReturns <code>true</code> if the lock is currently held.\nLeak the lock guard, yielding a mutable reference to the \nLocks the <code>Mutex</code> and returns a guard that permits access to \nCreates a new <code>Mutex</code> wrapping the supplied data.\nA naïve spinning mutex.\nTry to lock this <code>Mutex</code>, returning a lock guard if \nA spin lock providing mutually exclusive access to data.\nA guard that provides mutable data access.\nReturns a mutable pointer to the underlying data.\nThe dropping of the MutexGuard will release the lock it \nForce unlock this <code>SpinMutex</code>.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns a mutable reference to the underlying data.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nConsumes this <code>SpinMutex</code> and unwraps the underlying data.\nReturns <code>true</code> if the lock is currently held.\nLeak the lock guard, yielding a mutable reference to the \nLocks the <code>SpinMutex</code> and returns a guard that permits \nCreates a new <code>SpinMutex</code> wrapping the supplied data.\nTry to lock this <code>SpinMutex</code>, returning a lock guard if \nInitialization constant of <code>Once</code>.\nA primitive that provides lazy one-time initialization.\nRetrieve a pointer to the inner data.\nPerforms an initialization routine once and only once. The \nReturns the argument unchanged.\nReturns a reference to the inner value if the <code>Once</code> has \nReturns a mutable reference to the inner value if the <c