A proper mutex implementation regardless of the "flavor of task" which is acquiring the lock.

A "once initialization" primitive

Raw concurrency primitives you know and love.

An atomically reference counted wrapper for shared state.

A barrier enables multiple tasks to synchronize the beginning of some computation.

A condition variable, a mechanism for unlock-and-descheduling and signaling, for use with the lock types.

An extension of pipes::stream that allows both sending and receiving.

A type encapsulating the result of a computation which may not be complete

A wrapper type which provides synchronized access to the underlying data, of type T. A mutex always provides exclusive access, and concurrent requests will block while the mutex is already locked.

An guard which is created by locking a mutex. Through this guard the underlying data can be accessed.

A dual-mode reader-writer lock. The data can be accessed mutably or immutably, and immutably-accessing tasks may run concurrently.

A guard which is created by locking an rwlock in read mode. Through this guard the underlying data can be accessed.

A guard which is created by locking an rwlock in write mode. Through this guard the underlying data can be accessed.

A weak pointer to an Arc.

Creates a bidirectional stream.