# Struct alloc::sync::Arc

1.0.0 · source ·

    pub struct Arc<T: ?Sized, A: Allocator = Global> { /* private fields */ }

Expand description

A thread-safe reference-counting pointer. ‘Arc’ stands for ‘Atomically Reference Counted’.

The type `Arc<T>` provides shared ownership of a value of type `T`, allocated in the heap. Invoking `clone` on `Arc` produces a new `Arc` instance, which points to the same allocation on the heap as the source `Arc`, while increasing a reference count. When the last `Arc` pointer to a given allocation is destroyed, the value stored in that allocation (often referred to as “inner value”) is also dropped.

Shared references in Rust disallow mutation by default, and `Arc` is no exception: you cannot generally obtain a mutable reference to something inside an `Arc`. If you need to mutate through an `Arc`, use `Mutex`, `RwLock`, or one of the `Atomic` types.

Note: This type is only available on platforms that support atomic loads and stores of pointers, which includes all platforms that support the `std` crate but not all those which only support `alloc`. This may be detected at compile time using `#[cfg(target_has_atomic = "ptr")]`.

### Thread Safety

Unlike `Rc<T>`, `Arc<T>` uses atomic operations for its reference counting. This means that it is thread-safe. The disadvantage is that atomic operations are more expensive than ordinary memory accesses. If you are not sharing reference-counted allocations between threads, consider using `Rc<T>` for lower overhead. `Rc<T>` is a safe default, because the compiler will catch any attempt to send an `Rc<T>` between threads. However, a library might choose `Arc<T>` in order to give library consumers more flexibility.

`Arc<T>` will implement `Send` and `Sync` as long as the `T` implements `Send` and `Sync`. Why can’t you put a non-thread-safe type `T` in an `Arc<T>` to make it thread-safe? This may be a bit counter-intuitive at first: after all, isn’t the point of `Arc<T>` thread safety? The key is this: `Arc<T>` makes it thread safe to have multiple ownership of the same data, but it doesn’t add thread safety to its data. Consider `Arc<RefCell<T>>`. `RefCell<T>` isn’t `Sync`, and if `Arc<T>` was always `Send`, `Arc<RefCell<T>>` would be as well. But then we’d have a problem: `RefCell<T>` is not thread safe; it keeps track of the borrowing count using non-atomic operations.

In the end, this means that you may need to pair `Arc<T>` with some sort of `std::sync` type, usually `Mutex<T>`.

### Breaking cycles with `Weak`

The `downgrade` method can be used to create a non-owning `Weak` pointer. A `Weak` pointer can be `upgrade`d to an `Arc`, but this will return `None` if the value stored in the allocation has already been dropped. In other words, `Weak` pointers do not keep the value inside the allocation alive; however, they do keep the allocation (the backing store for the value) alive.

A cycle between `Arc` pointers will never be deallocated. For this reason, `Weak` is used to break cycles. For example, a tree could have strong `Arc` pointers from parent nodes to children, and `Weak` pointers from children back to their parents.

## Cloning references

Creating a new reference from an existing reference-counted pointer is done using the `Clone` trait implemented for `Arc<T>` and `Weak<T>`.

    use std::sync::Arc;
    let foo = Arc::new(vec![1.0, 2.0, 3.0]);
    // The two syntaxes below are equivalent.
    let a = foo.clone();
    let b = Arc::clone(&foo);
    // a, b, and foo are all Arcs that point to the same memory location

Run

### `Deref` behavior

`Arc<T>` automatically dereferences to `T` (via the `Deref` trait), so you can call `T`’s methods on a value of type `Arc<T>`. To avoid name clashes with `T`’s methods, the methods of `Arc<T>` itself are associated functions, called using fully qualified syntax:

    use std::sync::Arc;

    let my_arc = Arc::new(());
    let my_weak = Arc::downgrade(&my_arc);

Run

`Arc<T>`’s implementations of traits like `Clone` may also be called using fully qualified syntax. Some people prefer to use fully qualified syntax, while others prefer using method-call syntax.

    use std::sync::Arc;

    let arc = Arc::new(());
    // Method-call syntax
    let arc2 = arc.clone();
    // Fully qualified syntax
    let arc3 = Arc::clone(&arc);

Run

`Weak<T>` does not auto-dereference to `T`, because the inner value may have already been dropped.

## Examples

Sharing some immutable data between threads:

    use std::sync::Arc;
    use std::thread;

    let five = Arc::new(5);

    for _ in 0..10 {
        let five = Arc::clone(&five);

        thread::spawn(move || {
            println!("{five:?}");
        });
    }

Run

Sharing a mutable `AtomicUsize`:

    use std::sync::Arc;
    use std::sync::atomic::{AtomicUsize, Ordering};
    use std::thread;

    let val = Arc::new(AtomicUsize::new(5));

    for _ in 0..10 {
        let val = Arc::clone(&val);

        thread::spawn(move || {
            let v = val.fetch_add(1, Ordering::SeqCst);
            println!("{v:?}");
        });
    }

Run

See the `rc` documentation for more examples of reference counting in general.

## Implementations§

source§

### impl<T> Arc<T>

source

#### pub fn new(data: T) -> Arc<T>

Constructs a new `Arc<T>`.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

Run
1.60.0 · source

#### pub fn new_cyclic<F>(data_fn: F) -> Arc<T>where F: FnOnce(&Weak<T>) -> T,

Constructs a new `Arc<T>` while giving you a `Weak<T>` to the allocation, to allow you to construct a `T` which holds a weak pointer to itself.

Generally, a structure circularly referencing itself, either directly or indirectly, should not hold a strong reference to itself to prevent a memory leak. Using this function, you get access to the weak pointer during the initialization of `T`, before the `Arc<T>` is created, such that you can clone and store it inside the `T`.

`new_cyclic` first allocates the managed allocation for the `Arc<T>`, then calls your closure, giving it a `Weak<T>` to this allocation, and only afterwards completes the construction of the `Arc<T>` by placing the `T` returned from your closure into the allocation.

Since the new `Arc<T>` is not fully-constructed until `Arc<T>::new_cyclic` returns, calling `upgrade` on the weak reference inside your closure will fail and result in a `None` value.

##### Panics

If `data_fn` panics, the panic is propagated to the caller, and the temporary `Weak<T>` is dropped normally.

##### Example

    use std::sync::{Arc, Weak};

    struct Gadget {
        me: Weak<Gadget>,
    }

    impl Gadget {
        /// Construct a reference counted Gadget.
        fn new() -> Arc<Self> {
            // `me` is a `Weak<Gadget>` pointing at the new allocation of the
            // `Arc` we're constructing.
            Arc::new_cyclic(|me| {
                // Create the actual struct here.
                Gadget { me: me.clone() }
            })
        }

        /// Return a reference counted pointer to Self.
        fn me(&self) -> Arc<Self> {
            self.me.upgrade().unwrap()
        }
    }

Run
source

#### pub fn new_uninit() -> Arc<MaybeUninit<T>>

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Constructs a new `Arc` with uninitialized contents.

##### Examples

    #![feature(new_uninit)]
    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let mut five = Arc::<u32>::new_uninit();

    // Deferred initialization:
    Arc::get_mut(&mut five).unwrap().write(5);

    let five = unsafe { five.assume_init() };

    assert_eq!(*five, 5)

Run
source

#### pub fn new_zeroed() -> Arc<MaybeUninit<T>>

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Constructs a new `Arc` with uninitialized contents, with the memory being filled with `0` bytes.

See `MaybeUninit::zeroed` for examples of correct and incorrect usage of this method.

##### Examples

    #![feature(new_uninit)]

    use std::sync::Arc;

    let zero = Arc::<u32>::new_zeroed();
    let zero = unsafe { zero.assume_init() };

    assert_eq!(*zero, 0)

Run
1.33.0 · source

#### pub fn pin(data: T) -> Pin<Arc<T>>

Constructs a new `Pin<Arc<T>>`. If `T` does not implement `Unpin`, then `data` will be pinned in memory and unable to be moved.

source

#### pub fn try_pin(data: T) -> Result<Pin<Arc<T>>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Pin<Arc<T>>`, return an error if allocation fails.

source

#### pub fn try_new(data: T) -> Result<Arc<T>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc<T>`, returning an error if allocation fails.

##### Examples

    #![feature(allocator_api)]
    use std::sync::Arc;

    let five = Arc::try_new(5)?;

Run
source

#### pub fn try_new_uninit() -> Result<Arc<MaybeUninit<T>>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc` with uninitialized contents, returning an error if allocation fails.

##### Examples

    #![feature(new_uninit, allocator_api)]
    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let mut five = Arc::<u32>::try_new_uninit()?;

    // Deferred initialization:
    Arc::get_mut(&mut five).unwrap().write(5);

    let five = unsafe { five.assume_init() };

    assert_eq!(*five, 5);

Run
source

#### pub fn try_new_zeroed() -> Result<Arc<MaybeUninit<T>>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc` with uninitialized contents, with the memory being filled with `0` bytes, returning an error if allocation fails.

See `MaybeUninit::zeroed` for examples of correct and incorrect usage of this method.

##### Examples

    #![feature(new_uninit, allocator_api)]

    use std::sync::Arc;

    let zero = Arc::<u32>::try_new_zeroed()?;
    let zero = unsafe { zero.assume_init() };

    assert_eq!(*zero, 0);

Run
source§

### impl<T, A: Allocator> Arc<T, A>

source

#### pub fn allocator(this: &Self) -> &A

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Returns a reference to the underlying allocator.

Note: this is an associated function, which means that you have to call it as `Arc::allocator(&a)` instead of `a.allocator()`. This is so that there is no conflict with a method on the inner type.

source

#### pub fn new_in(data: T, alloc: A) -> Arc<T, A>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc<T>` in the provided allocator.

##### Examples

    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let five = Arc::new_in(5, System);

Run
source

#### pub fn new_uninit_in(alloc: A) -> Arc<MaybeUninit<T>, A>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc` with uninitialized contents in the provided allocator.

##### Examples

    #![feature(new_uninit)]
    #![feature(get_mut_unchecked)]
    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let mut five = Arc::<u32, _>::new_uninit_in(System);

    let five = unsafe {
        // Deferred initialization:
        Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);

        five.assume_init()
    };

    assert_eq!(*five, 5)

Run
source

#### pub fn new_zeroed_in(alloc: A) -> Arc<MaybeUninit<T>, A>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc` with uninitialized contents, with the memory being filled with `0` bytes, in the provided allocator.

See `MaybeUninit::zeroed` for examples of correct and incorrect usage of this method.

##### Examples

    #![feature(new_uninit)]
    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let zero = Arc::<u32, _>::new_zeroed_in(System);
    let zero = unsafe { zero.assume_init() };

    assert_eq!(*zero, 0)

Run
source

#### pub fn pin_in(data: T, alloc: A) -> Pin<Arc<T, A>>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Pin<Arc<T, A>>` in the provided allocator. If `T` does not implement `Unpin`, then `data` will be pinned in memory and unable to be moved.

source

#### pub fn try_pin_in(data: T, alloc: A) -> Result<Pin<Arc<T, A>>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Pin<Arc<T, A>>` in the provided allocator, return an error if allocation fails.

source

#### pub fn try_new_in(data: T, alloc: A) -> Result<Arc<T, A>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc<T, A>` in the provided allocator, returning an error if allocation fails.

##### Examples

    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let five = Arc::try_new_in(5, System)?;

Run
source

#### pub fn try_new_uninit_in(alloc: A) -> Result<Arc<MaybeUninit<T>, A>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc` with uninitialized contents, in the provided allocator, returning an error if allocation fails.

##### Examples

    #![feature(new_uninit, allocator_api)]
    #![feature(get_mut_unchecked)]

    use std::sync::Arc;
    use std::alloc::System;

    let mut five = Arc::<u32, _>::try_new_uninit_in(System)?;

    let five = unsafe {
        // Deferred initialization:
        Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);

        five.assume_init()
    };

    assert_eq!(*five, 5);

Run
source

#### pub fn try_new_zeroed_in(alloc: A) -> Result<Arc<MaybeUninit<T>, A>, AllocError>

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs a new `Arc` with uninitialized contents, with the memory being filled with `0` bytes, in the provided allocator, returning an error if allocation fails.

See `MaybeUninit::zeroed` for examples of correct and incorrect usage of this method.

##### Examples

    #![feature(new_uninit, allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let zero = Arc::<u32, _>::try_new_zeroed_in(System)?;
    let zero = unsafe { zero.assume_init() };

    assert_eq!(*zero, 0);

Run
1.4.0 · source

#### pub fn try_unwrap(this: Self) -> Result<T, Self>

Returns the inner value, if the `Arc` has exactly one strong reference.

Otherwise, an `Err` is returned with the same `Arc` that was passed in.

This will succeed even if there are outstanding weak references.

It is strongly recommended to use `Arc::into_inner` instead if you don’t want to keep the `Arc` in the `Err` case. Immediately dropping the `Err` payload, like in the expression `Arc::try_unwrap(this).ok()`, can still cause the strong count to drop to zero and the inner value of the `Arc` to be dropped: For instance if two threads each execute this expression in parallel, then there is a race condition. The threads could first both check whether they have the last clone of their `Arc` via `Arc::try_unwrap`, and then both drop their `Arc` in the call to `ok`, taking the strong count from two down to zero.

##### Examples

    use std::sync::Arc;

    let x = Arc::new(3);
    assert_eq!(Arc::try_unwrap(x), Ok(3));

    let x = Arc::new(4);
    let _y = Arc::clone(&x);
    assert_eq!(*Arc::try_unwrap(x).unwrap_err(), 4);

Run
1.70.0 · source

#### pub fn into_inner(this: Self) -> Option<T>

Returns the inner value, if the `Arc` has exactly one strong reference.

Otherwise, `None` is returned and the `Arc` is dropped.

This will succeed even if there are outstanding weak references.

If `Arc::into_inner` is called on every clone of this `Arc`, it is guaranteed that exactly one of the calls returns the inner value. This means in particular that the inner value is not dropped.

The similar expression `Arc::try_unwrap(this).ok()` does not offer such a guarantee. See the last example below and the documentation of `Arc::try_unwrap`.

##### Examples

Minimal example demonstrating the guarantee that `Arc::into_inner` gives.

    use std::sync::Arc;

    let x = Arc::new(3);
    let y = Arc::clone(&x);

    // Two threads calling `Arc::into_inner` on both clones of an `Arc`:
    let x_thread = std::thread::spawn(|| Arc::into_inner(x));
    let y_thread = std::thread::spawn(|| Arc::into_inner(y));

    let x_inner_value = x_thread.join().unwrap();
    let y_inner_value = y_thread.join().unwrap();

    // One of the threads is guaranteed to receive the inner value:
    assert!(matches!(
        (x_inner_value, y_inner_value),
        (None, Some(3)) | (Some(3), None)
    ));
    // The result could also be `(None, None)` if the threads called
    // `Arc::try_unwrap(x).ok()` and `Arc::try_unwrap(y).ok()` instead.

Run

A more practical example demonstrating the need for `Arc::into_inner`:

    use std::sync::Arc;

    // Definition of a simple singly linked list using `Arc`:
    #[derive(Clone)]
    struct LinkedList<T>(Option<Arc<Node<T>>>);
    struct Node<T>(T, Option<Arc<Node<T>>>);

    // Dropping a long `LinkedList<T>` relying on the destructor of `Arc`
    // can cause a stack overflow. To prevent this, we can provide a
    // manual `Drop` implementation that does the destruction in a loop:
    impl<T> Drop for LinkedList<T> {
        fn drop(&mut self) {
            let mut link = self.0.take();
            while let Some(arc_node) = link.take() {
                if let Some(Node(_value, next)) = Arc::into_inner(arc_node) {
                    link = next;
                }
            }
        }
    }

    // Implementation of `new` and `push` omitted
    impl<T> LinkedList<T> {
        /* ... */
    }

    // The following code could have still caused a stack overflow
    // despite the manual `Drop` impl if that `Drop` impl had used
    // `Arc::try_unwrap(arc).ok()` instead of `Arc::into_inner(arc)`.

    // Create a long list and clone it
    let mut x = LinkedList::new();
    for i in 0..100000 {
        x.push(i); // Adds i to the front of x
    }
    let y = x.clone();

    // Drop the clones in parallel
    let x_thread = std::thread::spawn(|| drop(x));
    let y_thread = std::thread::spawn(|| drop(y));
    x_thread.join().unwrap();
    y_thread.join().unwrap();

Run
source§

### impl<T> Arc<[T]>

source

#### pub fn new_uninit_slice(len: usize) -> Arc<[MaybeUninit<T>]>

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Constructs a new atomically reference-counted slice with uninitialized contents.

##### Examples

    #![feature(new_uninit)]
    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let mut values = Arc::<[u32]>::new_uninit_slice(3);

    // Deferred initialization:
    let data = Arc::get_mut(&mut values).unwrap();
    data[0].write(1);
    data[1].write(2);
    data[2].write(3);

    let values = unsafe { values.assume_init() };

    assert_eq!(*values, [1, 2, 3])

Run
source

#### pub fn new_zeroed_slice(len: usize) -> Arc<[MaybeUninit<T>]>

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Constructs a new atomically reference-counted slice with uninitialized contents, with the memory being filled with `0` bytes.

See `MaybeUninit::zeroed` for examples of correct and incorrect usage of this method.

##### Examples

    #![feature(new_uninit)]

    use std::sync::Arc;

    let values = Arc::<[u32]>::new_zeroed_slice(3);
    let values = unsafe { values.assume_init() };

    assert_eq!(*values, [0, 0, 0])

Run
source§

### impl<T, A: Allocator> Arc<[T], A>

source

#### pub fn new_uninit_slice_in(len: usize, alloc: A) -> Arc<[MaybeUninit<T>], A>

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Constructs a new atomically reference-counted slice with uninitialized contents in the provided allocator.

##### Examples

    #![feature(new_uninit)]
    #![feature(get_mut_unchecked)]
    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let mut values = Arc::<[u32], _>::new_uninit_slice_in(3, System);

    let values = unsafe {
        // Deferred initialization:
        Arc::get_mut_unchecked(&mut values)[0].as_mut_ptr().write(1);
        Arc::get_mut_unchecked(&mut values)[1].as_mut_ptr().write(2);
        Arc::get_mut_unchecked(&mut values)[2].as_mut_ptr().write(3);

        values.assume_init()
    };

    assert_eq!(*values, [1, 2, 3])

Run
source

#### pub fn new_zeroed_slice_in(len: usize, alloc: A) -> Arc<[MaybeUninit<T>], A>

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Constructs a new atomically reference-counted slice with uninitialized contents, with the memory being filled with `0` bytes, in the provided allocator.

See `MaybeUninit::zeroed` for examples of correct and incorrect usage of this method.

##### Examples

    #![feature(new_uninit)]
    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let values = Arc::<[u32], _>::new_zeroed_slice_in(3, System);
    let values = unsafe { values.assume_init() };

    assert_eq!(*values, [0, 0, 0])

Run
source§

### impl<T, A: Allocator> Arc<MaybeUninit<T>, A>

source

#### pub unsafe fn assume_init(self) -> Arc<T, A>where A: Clone,

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Converts to `Arc<T>`.

##### Safety

As with `MaybeUninit::assume_init`, it is up to the caller to guarantee that the inner value really is in an initialized state. Calling this when the content is not yet fully initialized causes immediate undefined behavior.

##### Examples

    #![feature(new_uninit)]
    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let mut five = Arc::<u32>::new_uninit();

    // Deferred initialization:
    Arc::get_mut(&mut five).unwrap().write(5);

    let five = unsafe { five.assume_init() };

    assert_eq!(*five, 5)

Run
source§

### impl<T, A: Allocator> Arc<[MaybeUninit<T>], A>

source

#### pub unsafe fn assume_init(self) -> Arc<[T], A>where A: Clone,

🔬This is a nightly-only experimental API. (`new_uninit` #63291)

Converts to `Arc<[T]>`.

##### Safety

As with `MaybeUninit::assume_init`, it is up to the caller to guarantee that the inner value really is in an initialized state. Calling this when the content is not yet fully initialized causes immediate undefined behavior.

##### Examples

    #![feature(new_uninit)]
    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let mut values = Arc::<[u32]>::new_uninit_slice(3);

    // Deferred initialization:
    let data = Arc::get_mut(&mut values).unwrap();
    data[0].write(1);
    data[1].write(2);
    data[2].write(3);

    let values = unsafe { values.assume_init() };

    assert_eq!(*values, [1, 2, 3])

Run
source§

### impl<T: ?Sized> Arc<T>

1.17.0 · source

#### pub unsafe fn from_raw(ptr: *const T) -> Self

Constructs an `Arc<T>` from a raw pointer.

The raw pointer must have been previously returned by a call to `Arc<U>::into_raw` where `U` must have the same size and alignment as `T`. This is trivially true if `U` is `T`. Note that if `U` is not `T` but has the same size and alignment, this is basically like transmuting references of different types. See `mem::transmute` for more information on what restrictions apply in this case.

The user of `from_raw` has to make sure a specific value of `T` is only dropped once.

This function is unsafe because improper use may lead to memory unsafety, even if the returned `Arc<T>` is never accessed.

##### Examples

    use std::sync::Arc;

    let x = Arc::new("hello".to_owned());
    let x_ptr = Arc::into_raw(x);

    unsafe {
        // Convert back to an `Arc` to prevent leak.
        let x = Arc::from_raw(x_ptr);
        assert_eq!(&*x, "hello");

        // Further calls to `Arc::from_raw(x_ptr)` would be memory-unsafe.
    }

    // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!

Run
1.51.0 · source

#### pub unsafe fn increment_strong_count(ptr: *const T)

Increments the strong reference count on the `Arc<T>` associated with the provided pointer by one.

##### Safety

The pointer must have been obtained through `Arc::into_raw`, and the associated `Arc` instance must be valid (i.e. the strong count must be at least 1) for the duration of this method.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    unsafe {
        let ptr = Arc::into_raw(five);
        Arc::increment_strong_count(ptr);

        // This assertion is deterministic because we haven't shared
        // the `Arc` between threads.
        let five = Arc::from_raw(ptr);
        assert_eq!(2, Arc::strong_count(&five));
    }

Run
1.51.0 · source

#### pub unsafe fn decrement_strong_count(ptr: *const T)

Decrements the strong reference count on the `Arc<T>` associated with the provided pointer by one.

##### Safety

The pointer must have been obtained through `Arc::into_raw`, and the associated `Arc` instance must be valid (i.e. the strong count must be at least 1) when invoking this method. This method can be used to release the final `Arc` and backing storage, but should not be called after the final `Arc` has been released.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    unsafe {
        let ptr = Arc::into_raw(five);
        Arc::increment_strong_count(ptr);

        // Those assertions are deterministic because we haven't shared
        // the `Arc` between threads.
        let five = Arc::from_raw(ptr);
        assert_eq!(2, Arc::strong_count(&five));
        Arc::decrement_strong_count(ptr);
        assert_eq!(1, Arc::strong_count(&five));
    }

Run
source§

### impl<T: ?Sized, A: Allocator> Arc<T, A>

1.17.0 · source

#### pub fn into_raw(this: Self) -> *const T

Consumes the `Arc`, returning the wrapped pointer.

To avoid a memory leak the pointer must be converted back to an `Arc` using `Arc::from_raw`.

##### Examples

    use std::sync::Arc;

    let x = Arc::new("hello".to_owned());
    let x_ptr = Arc::into_raw(x);
    assert_eq!(unsafe { &*x_ptr }, "hello");

Run
1.45.0 · source

#### pub fn as_ptr(this: &Self) -> *const T

Provides a raw pointer to the data.

The counts are not affected in any way and the `Arc` is not consumed. The pointer is valid for as long as there are strong counts in the `Arc`.

##### Examples

    use std::sync::Arc;

    let x = Arc::new("hello".to_owned());
    let y = Arc::clone(&x);
    let x_ptr = Arc::as_ptr(&x);
    assert_eq!(x_ptr, Arc::as_ptr(&y));
    assert_eq!(unsafe { &*x_ptr }, "hello");

Run
source

#### pub unsafe fn from_raw_in(ptr: *const T, alloc: A) -> Self

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Constructs an `Arc<T, A>` from a raw pointer.

The raw pointer must have been previously returned by a call to `Arc<U, A>::into_raw` where `U` must have the same size and alignment as `T`. This is trivially true if `U` is `T`. Note that if `U` is not `T` but has the same size and alignment, this is basically like transmuting references of different types. See `mem::transmute` for more information on what restrictions apply in this case.

The raw pointer must point to a block of memory allocated by `alloc`

The user of `from_raw` has to make sure a specific value of `T` is only dropped once.

This function is unsafe because improper use may lead to memory unsafety, even if the returned `Arc<T>` is never accessed.

##### Examples

    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let x = Arc::new_in("hello".to_owned(), System);
    let x_ptr = Arc::into_raw(x);

    unsafe {
        // Convert back to an `Arc` to prevent leak.
        let x = Arc::from_raw_in(x_ptr, System);
        assert_eq!(&*x, "hello");

        // Further calls to `Arc::from_raw(x_ptr)` would be memory-unsafe.
    }

    // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!

Run
1.4.0 · source

#### pub fn downgrade(this: &Self) -> Weak<T, A>where A: Clone,

Creates a new `Weak` pointer to this allocation.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    let weak_five = Arc::downgrade(&five);

Run
1.15.0 · source

#### pub fn weak_count(this: &Self) -> usize

Gets the number of `Weak` pointers to this allocation.

##### Safety

This method by itself is safe, but using it correctly requires extra care. Another thread can change the weak count at any time, including potentially between calling this method and acting on the result.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);
    let _weak_five = Arc::downgrade(&five);

    // This assertion is deterministic because we haven't shared
    // the `Arc` or `Weak` between threads.
    assert_eq!(1, Arc::weak_count(&five));

Run
1.15.0 · source

#### pub fn strong_count(this: &Self) -> usize

Gets the number of strong (`Arc`) pointers to this allocation.

##### Safety

This method by itself is safe, but using it correctly requires extra care. Another thread can change the strong count at any time, including potentially between calling this method and acting on the result.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);
    let _also_five = Arc::clone(&five);

    // This assertion is deterministic because we haven't shared
    // the `Arc` between threads.
    assert_eq!(2, Arc::strong_count(&five));

Run
source

#### pub unsafe fn increment_strong_count_in(ptr: *const T, alloc: A)where A: Clone,

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Increments the strong reference count on the `Arc<T>` associated with the provided pointer by one.

##### Safety

The pointer must have been obtained through `Arc::into_raw`, and the associated `Arc` instance must be valid (i.e. the strong count must be at least 1) for the duration of this method,, and `ptr` must point to a block of memory allocated by `alloc`.

##### Examples

    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let five = Arc::new_in(5, System);

    unsafe {
        let ptr = Arc::into_raw(five);
        Arc::increment_strong_count_in(ptr, System);

        // This assertion is deterministic because we haven't shared
        // the `Arc` between threads.
        let five = Arc::from_raw_in(ptr, System);
        assert_eq!(2, Arc::strong_count(&five));
    }

Run
source

#### pub unsafe fn decrement_strong_count_in(ptr: *const T, alloc: A)

🔬This is a nightly-only experimental API. (`allocator_api` #32838)

Decrements the strong reference count on the `Arc<T>` associated with the provided pointer by one.

##### Safety

The pointer must have been obtained through `Arc::into_raw`, the associated `Arc` instance must be valid (i.e. the strong count must be at least 1) when invoking this method, and `ptr` must point to a block of memory allocated by `alloc`. This method can be used to release the final `Arc` and backing storage, but should not be called after the final `Arc` has been released.

##### Examples

    #![feature(allocator_api)]

    use std::sync::Arc;
    use std::alloc::System;

    let five = Arc::new_in(5, System);

    unsafe {
        let ptr = Arc::into_raw(five);
        Arc::increment_strong_count_in(ptr, System);

        // Those assertions are deterministic because we haven't shared
        // the `Arc` between threads.
        let five = Arc::from_raw_in(ptr, System);
        assert_eq!(2, Arc::strong_count(&five));
        Arc::decrement_strong_count_in(ptr, System);
        assert_eq!(1, Arc::strong_count(&five));
    }

Run
1.17.0 · source

#### pub fn ptr_eq(this: &Self, other: &Self) -> bool

Returns `true` if the two `Arc`s point to the same allocation in a vein similar to `ptr::eq`. This function ignores the metadata of `dyn Trait` pointers.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);
    let same_five = Arc::clone(&five);
    let other_five = Arc::new(5);

    assert!(Arc::ptr_eq(&five, &same_five));
    assert!(!Arc::ptr_eq(&five, &other_five));

Run
source§

### impl<T: Clone, A: Allocator + Clone> Arc<T, A>

1.4.0 · source

#### pub fn make_mut(this: &mut Self) -> &mut T

Makes a mutable reference into the given `Arc`.

If there are other `Arc` pointers to the same allocation, then `make_mut` will `clone` the inner value to a new allocation to ensure unique ownership. This is also referred to as clone-on-write.

However, if there are no other `Arc` pointers to this allocation, but some `Weak` pointers, then the `Weak` pointers will be dissociated and the inner value will not be cloned.

See also `get_mut`, which will fail rather than cloning the inner value or dissociating `Weak` pointers.

##### Examples

    use std::sync::Arc;

    let mut data = Arc::new(5);

    *Arc::make_mut(&mut data) += 1;         // Won't clone anything
    let mut other_data = Arc::clone(&data); // Won't clone inner data
    *Arc::make_mut(&mut data) += 1;         // Clones inner data
    *Arc::make_mut(&mut data) += 1;         // Won't clone anything
    *Arc::make_mut(&mut other_data) *= 2;   // Won't clone anything

    // Now `data` and `other_data` point to different allocations.
    assert_eq!(*data, 8);
    assert_eq!(*other_data, 12);

Run

`Weak` pointers will be dissociated:

    use std::sync::Arc;

    let mut data = Arc::new(75);
    let weak = Arc::downgrade(&data);

    assert!(75 == *data);
    assert!(75 == *weak.upgrade().unwrap());

    *Arc::make_mut(&mut data) += 1;

    assert!(76 == *data);
    assert!(weak.upgrade().is_none());

Run
source

#### pub fn unwrap_or_clone(this: Self) -> T

🔬This is a nightly-only experimental API. (`arc_unwrap_or_clone` #93610)

If we have the only reference to `T` then unwrap it. Otherwise, clone `T` and return the clone.

Assuming `arc_t` is of type `Arc<T>`, this function is functionally equivalent to `(*arc_t).clone()`, but will avoid cloning the inner value where possible.

##### Examples

    #![feature(arc_unwrap_or_clone)]
    let inner = String::from("test");
    let ptr = inner.as_ptr();

    let arc = Arc::new(inner);
    let inner = Arc::unwrap_or_clone(arc);
    // The inner value was not cloned
    assert!(ptr::eq(ptr, inner.as_ptr()));

    let arc = Arc::new(inner);
    let arc2 = arc.clone();
    let inner = Arc::unwrap_or_clone(arc);
    // Because there were 2 references, we had to clone the inner value.
    assert!(!ptr::eq(ptr, inner.as_ptr()));
    // `arc2` is the last reference, so when we unwrap it we get back
    // the original `String`.
    let inner = Arc::unwrap_or_clone(arc2);
    assert!(ptr::eq(ptr, inner.as_ptr()));

Run
source§

### impl<T: ?Sized, A: Allocator> Arc<T, A>

1.4.0 · source

#### pub fn get_mut(this: &mut Self) -> Option<&mut T>

Returns a mutable reference into the given `Arc`, if there are no other `Arc` or `Weak` pointers to the same allocation.

Returns `None` otherwise, because it is not safe to mutate a shared value.

See also `make_mut`, which will `clone` the inner value when there are other `Arc` pointers.

##### Examples

    use std::sync::Arc;

    let mut x = Arc::new(3);
    *Arc::get_mut(&mut x).unwrap() = 4;
    assert_eq!(*x, 4);

    let _y = Arc::clone(&x);
    assert!(Arc::get_mut(&mut x).is_none());

Run
source

#### pub unsafe fn get_mut_unchecked(this: &mut Self) -> &mut T

🔬This is a nightly-only experimental API. (`get_mut_unchecked` #63292)

Returns a mutable reference into the given `Arc`, without any check.

See also `get_mut`, which is safe and does appropriate checks.

##### Safety

If any other `Arc` or `Weak` pointers to the same allocation exist, then they must not be dereferenced or have active borrows for the duration of the returned borrow, and their inner type must be exactly the same as the inner type of this Rc (including lifetimes). This is trivially the case if no such pointers exist, for example immediately after `Arc::new`.

##### Examples

    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let mut x = Arc::new(String::new());
    unsafe {
        Arc::get_mut_unchecked(&mut x).push_str("foo")
    }
    assert_eq!(*x, "foo");

Run

Other `Arc` pointers to the same allocation must be to the same type.

    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let x: Arc<str> = Arc::from("Hello, world!");
    let mut y: Arc<[u8]> = x.clone().into();
    unsafe {
        // this is Undefined Behavior, because x's inner type is str, not [u8]
        Arc::get_mut_unchecked(&mut y).fill(0xff); // 0xff is invalid in UTF-8
    }
    println!("{}", &*x); // Invalid UTF-8 in a str

Run

Other `Arc` pointers to the same allocation must be to the exact same type, including lifetimes.

    #![feature(get_mut_unchecked)]

    use std::sync::Arc;

    let x: Arc<&str> = Arc::new("Hello, world!");
    {
        let s = String::from("Oh, no!");
        let mut y: Arc<&str> = x.clone().into();
        unsafe {
            // this is Undefined Behavior, because x's inner type
            // is &'long str, not &'short str
            *Arc::get_mut_unchecked(&mut y) = &s;
        }
    }
    println!("{}", &*x); // Use-after-free

Run
source§

### impl<A: Allocator + Clone> Arc<dyn Any + Send + Sync, A>

1.29.0 · source

#### pub fn downcast<T>(self) -> Result<Arc<T, A>, Self>where T: Any + Send + Sync,

Attempt to downcast the `Arc<dyn Any + Send + Sync>` to a concrete type.

##### Examples

    use std::any::Any;
    use std::sync::Arc;

    fn print_if_string(value: Arc<dyn Any + Send + Sync>) {
        if let Ok(string) = value.downcast::<String>() {
            println!("String ({}): {}", string.len(), string);
        }
    }

    let my_string = "Hello World".to_string();
    print_if_string(Arc::new(my_string));
    print_if_string(Arc::new(0i8));

Run
source

#### pub unsafe fn downcast_unchecked<T>(self) -> Arc<T, A>where T: Any + Send + Sync,

🔬This is a nightly-only experimental API. (`downcast_unchecked` #90850)

Downcasts the `Arc<dyn Any + Send + Sync>` to a concrete type.

For a safe alternative see `downcast`.

##### Examples

    #![feature(downcast_unchecked)]

    use std::any::Any;
    use std::sync::Arc;

    let x: Arc<dyn Any + Send + Sync> = Arc::new(1_usize);

    unsafe {
        assert_eq!(*x.downcast_unchecked::<usize>(), 1);
    }

Run

##### Safety

The contained value must be of type `T`. Calling this method with the incorrect type is undefined behavior.

## Trait Implementations§

1.5.0 · source§

### impl<T: ?Sized, A: Allocator> AsRef<T> for Arc<T, A>

source§

#### fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.
source§

### impl<T: ?Sized, A: Allocator> Borrow<T> for Arc<T, A>

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T: ?Sized, A: Allocator + Clone> Clone for Arc<T, A>

source§

#### fn clone(&self) -> Arc<T, A>

Makes a clone of the `Arc` pointer.

This creates another pointer to the same allocation, increasing the strong reference count.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    let _ = Arc::clone(&five);

Run
source§

#### fn clone_from(&mut self, source: &Self)

Performs copy-assignment from `source`. Read more
source§

### impl<T: ?Sized + Debug, A: Allocator> Debug for Arc<T, A>

source§

#### fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

### impl<T: Default> Default for Arc<T>

source§

#### fn default() -> Arc<T>

Creates a new `Arc<T>`, with the `Default` value for `T`.

##### Examples

    use std::sync::Arc;

    let x: Arc<i32> = Default::default();
    assert_eq!(*x, 0);

Run
source§

### impl<T: ?Sized, A: Allocator> Deref for Arc<T, A>

§

#### type Target = T

The resulting type after dereferencing.
source§

#### fn deref(&self) -> &T

Dereferences the value.
source§

### impl<T: ?Sized + Display, A: Allocator> Display for Arc<T, A>

source§

#### fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

### impl<T: ?Sized, A: Allocator> Drop for Arc<T, A>

source§

#### fn drop(&mut self)

Drops the `Arc`.

This will decrement the strong reference count. If the strong reference count reaches zero then the only other references (if any) are `Weak`, so we `drop` the inner value.

##### Examples

    use std::sync::Arc;

    struct Foo;

    impl Drop for Foo {
        fn drop(&mut self) {
            println!("dropped!");
        }
    }

    let foo  = Arc::new(Foo);
    let foo2 = Arc::clone(&foo);

    drop(foo);    // Doesn't print anything
    drop(foo2);   // Prints "dropped!"

Run
1.52.0 · source§

### impl<T: Error + ?Sized> Error for Arc<T>

source§

#### fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
source§

#### fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

#### fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
source§

#### fn provide<'a>(&'a self, req: &mut Request<'a>)

🔬This is a nightly-only experimental API. (`error_generic_member_access` #99301)
Provides type based access to context intended for error reports. Read more
1.21.0 · source§

### impl<T: Clone> From<&[T]> for Arc<[T]>

source§

#### fn from(v: &[T]) -> Arc<[T]>

Allocate a reference-counted slice and fill it by cloning `v`’s items.

##### Example

    let original: &[i32] = &[1, 2, 3];
    let shared: Arc<[i32]> = Arc::from(original);
    assert_eq!(&[1, 2, 3], &shared[..]);

Run
1.24.0 · source§

### impl From<&CStr> for Arc<CStr>

source§

#### fn from(s: &CStr) -> Arc<CStr>

Converts a `&CStr` into a `Arc<CStr>`, by copying the contents into a newly allocated `Arc`.

1.21.0 · source§

### impl From<&str> for Arc<str>

source§

#### fn from(v: &str) -> Arc<str>

Allocate a reference-counted `str` and copy `v` into it.

##### Example

    let shared: Arc<str> = Arc::from("eggplant");
    assert_eq!("eggplant", &shared[..]);

Run
1.74.0 · source§

### impl<T, const N: usize> From<[T; N]> for Arc<[T]>

source§

#### fn from(v: [T; N]) -> Arc<[T]>

Converts a `[T; N]` into an `Arc<[T]>`.

The conversion moves the array into a newly allocated `Arc`.

##### Example

    let original: [i32; 3] = [1, 2, 3];
    let shared: Arc<[i32]> = Arc::from(original);
    assert_eq!(&[1, 2, 3], &shared[..]);

Run
1.51.0 · source§

### impl<W: Wake + Send + Sync + 'static> From<Arc<W>> for RawWaker

source§

#### fn from(waker: Arc<W>) -> RawWaker

Use a `Wake`-able type as a `RawWaker`.

No heap allocations or atomic operations are used for this conversion.

1.51.0 · source§

### impl<W: Wake + Send + Sync + 'static> From<Arc<W>> for Waker

source§

#### fn from(waker: Arc<W>) -> Waker

Use a `Wake`-able type as a `Waker`.

No heap allocations or atomic operations are used for this conversion.

1.62.0 · source§

### impl From<Arc<str>> for Arc<[u8]>

source§

#### fn from(rc: Arc<str>) -> Self

Converts an atomically reference-counted string slice into a byte slice.

##### Example

    let string: Arc<str> = Arc::from("eggplant");
    let bytes: Arc<[u8]> = Arc::from(string);
    assert_eq!("eggplant".as_bytes(), bytes.as_ref());

Run
1.21.0 · source§

### impl<T: ?Sized, A: Allocator> From<Box<T, A>> for Arc<T, A>

source§

#### fn from(v: Box<T, A>) -> Arc<T, A>

Move a boxed object to a new, reference-counted allocation.

##### Example

    let unique: Box<str> = Box::from("eggplant");
    let shared: Arc<str> = Arc::from(unique);
    assert_eq!("eggplant", &shared[..]);

Run
1.24.0 · source§

### impl From<CString> for Arc<CStr>

source§

#### fn from(s: CString) -> Arc<CStr>

Converts a `CString` into an `Arc<CStr>` by moving the `CString` data into a new `Arc` buffer.

1.45.0 · source§

### impl<'a, B> From<Cow<'a, B>> for Arc<B>where B: ToOwned + ?Sized, Arc<B>: From<&'a B> + From<B::Owned>,

source§

#### fn from(cow: Cow<'a, B>) -> Arc<B>

Create an atomically reference-counted pointer from a clone-on-write pointer by copying its content.

##### Example

    let cow: Cow<'_, str> = Cow::Borrowed("eggplant");
    let shared: Arc<str> = Arc::from(cow);
    assert_eq!("eggplant", &shared[..]);

Run
1.21.0 · source§

### impl From<String> for Arc<str>

source§

#### fn from(v: String) -> Arc<str>

Allocate a reference-counted `str` and copy `v` into it.

##### Example

    let unique: String = "eggplant".to_owned();
    let shared: Arc<str> = Arc::from(unique);
    assert_eq!("eggplant", &shared[..]);

Run
1.6.0 · source§

### impl<T> From<T> for Arc<T>

source§

#### fn from(t: T) -> Self

Converts a `T` into an `Arc<T>`

The conversion moves the value into a newly allocated `Arc`. It is equivalent to calling `Arc::new(t)`.

##### Example

    let x = 5;
    let arc = Arc::new(5);

    assert_eq!(Arc::from(x), arc);

Run
1.21.0 · source§

### impl<T, A: Allocator + Clone> From<Vec<T, A>> for Arc<[T], A>

source§

#### fn from(v: Vec<T, A>) -> Arc<[T], A>

Allocate a reference-counted slice and move `v`’s items into it.

##### Example

    let unique: Vec<i32> = vec![1, 2, 3];
    let shared: Arc<[i32]> = Arc::from(unique);
    assert_eq!(&[1, 2, 3], &shared[..]);

Run
1.37.0 · source§

### impl<T> FromIterator<T> for Arc<[T]>

source§

#### fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Takes each element in the `Iterator` and collects it into an `Arc<[T]>`.

##### Performance characteristics

###### The general case

In the general case, collecting into `Arc<[T]>` is done by first collecting into a `Vec<T>`. That is, when writing the following:

    let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0).collect();

Run

this behaves as if we wrote:

    let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0)
        .collect::<Vec<_>>() // The first set of allocations happens here.
        .into(); // A second allocation for `Arc<[T]>` happens here.

Run

This will allocate as many times as needed for constructing the `Vec<T>` and then it will allocate once for turning the `Vec<T>` into the `Arc<[T]>`.

###### Iterators of known length

When your `Iterator` implements `TrustedLen` and is of an exact size, a single allocation will be made for the `Arc<[T]>`. For example:

    let evens: Arc<[u8]> = (0..10).collect(); // Just a single allocation happens here.

Run
source§

### impl<T: ?Sized + Hash, A: Allocator> Hash for Arc<T, A>

source§

#### fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given `Hasher`. Read more
1.3.0 · source§

#### fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given `Hasher`. Read more
source§

### impl<T: ?Sized + Ord, A: Allocator> Ord for Arc<T, A>

source§

#### fn cmp(&self, other: &Arc<T, A>) -> Ordering

Comparison for two `Arc`s.

The two are compared by calling `cmp()` on their inner values.

##### Examples

    use std::sync::Arc;
    use std::cmp::Ordering;

    let five = Arc::new(5);

    assert_eq!(Ordering::Less, five.cmp(&Arc::new(6)));

Run
1.21.0 · source§

#### fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

#### fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

#### fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

### impl<T: ?Sized + PartialEq, A: Allocator> PartialEq for Arc<T, A>

source§

#### fn eq(&self, other: &Arc<T, A>) -> bool

Equality for two `Arc`s.

Two `Arc`s are equal if their inner values are equal, even if they are stored in different allocation.

If `T` also implements `Eq` (implying reflexivity of equality), two `Arc`s that point to the same allocation are always equal.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    assert!(five == Arc::new(5));

Run
source§

#### fn ne(&self, other: &Arc<T, A>) -> bool

Inequality for two `Arc`s.

Two `Arc`s are not equal if their inner values are not equal.

If `T` also implements `Eq` (implying reflexivity of equality), two `Arc`s that point to the same value are always equal.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    assert!(five != Arc::new(6));

Run
source§

### impl<T: ?Sized + PartialOrd, A: Allocator> PartialOrd for Arc<T, A>

source§

#### fn partial_cmp(&self, other: &Arc<T, A>) -> Option<Ordering>

Partial comparison for two `Arc`s.

The two are compared by calling `partial_cmp()` on their inner values.

##### Examples

    use std::sync::Arc;
    use std::cmp::Ordering;

    let five = Arc::new(5);

    assert_eq!(Some(Ordering::Less), five.partial_cmp(&Arc::new(6)));

Run
source§

#### fn lt(&self, other: &Arc<T, A>) -> bool

Less-than comparison for two `Arc`s.

The two are compared by calling `<` on their inner values.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    assert!(five < Arc::new(6));

Run
source§

#### fn le(&self, other: &Arc<T, A>) -> bool

‘Less than or equal to’ comparison for two `Arc`s.

The two are compared by calling `<=` on their inner values.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    assert!(five <= Arc::new(5));

Run
source§

#### fn gt(&self, other: &Arc<T, A>) -> bool

Greater-than comparison for two `Arc`s.

The two are compared by calling `>` on their inner values.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    assert!(five > Arc::new(4));

Run
source§

#### fn ge(&self, other: &Arc<T, A>) -> bool

‘Greater than or equal to’ comparison for two `Arc`s.

The two are compared by calling `>=` on their inner values.

##### Examples

    use std::sync::Arc;

    let five = Arc::new(5);

    assert!(five >= Arc::new(5));

Run
source§

### impl<T: ?Sized, A: Allocator> Pointer for Arc<T, A>

source§

#### fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.
1.43.0 · source§

### impl<T, A: Allocator + Clone, const N: usize> TryFrom<Arc<[T], A>> for Arc<[T; N], A>

§

#### type Error = Arc<[T], A>

The type returned in the event of a conversion error.
source§

#### fn try_from(boxed_slice: Arc<[T], A>) -> Result<Self, Self::Error>

Performs the conversion.
source§

### impl<T: ?Sized + Unsize<U>, U: ?Sized, A: Allocator> CoerceUnsized<Arc<U, A>> for Arc<T, A>

source§

### impl<T: ?Sized + Unsize<U>, U: ?Sized> DispatchFromDyn<Arc<U>> for Arc<T>

source§

### impl<T: ?Sized + Eq, A: Allocator> Eq for Arc<T, A>

source§

### impl<T: ?Sized + Sync + Send, A: Allocator + Send> Send for Arc<T, A>

source§

### impl<T: ?Sized + Sync + Send, A: Allocator + Sync> Sync for Arc<T, A>

1.33.0 · source§

### impl<T: ?Sized, A: Allocator> Unpin for Arc<T, A>

1.9.0 · source§

### impl<T: RefUnwindSafe + ?Sized, A: Allocator + UnwindSafe> UnwindSafe for Arc<T, A>

## Auto Trait Implementations§

§

### impl<T: ?Sized, A> RefUnwindSafe for Arc<T, A>where A: RefUnwindSafe, T: RefUnwindSafe,

## Blanket Implementations§

source§

### impl<T> Any for Twhere T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for Twhere T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

### impl<T> From<!> for T

source§

#### fn from(t: !) -> T

Converts to this type from the input type.
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for Twhere U: From<T>,

source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T> ToOwned for Twhere T: Clone,

§

#### type Owned = T

The resulting type after obtaining ownership.
source§

#### fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

#### fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

### impl<T> ToString for Twhere T: Display + ?Sized,

source§

#### default fn to_string(&self) -> String

Converts the given value to a `String`. Read more
source§

### impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

### impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.