Struct Arc 

pub struct Arc<T, A = Global>
where
    A: Allocator,
    T: ?Sized,
{
    ptr: NonNull<ArcInner<T>>,
    phantom: PhantomData<ArcInner<T>>,
    alloc: A,
}

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 do need to mutate through an Arc, you have several options:

1. Use interior mutability with synchronization primitives like Mutex, RwLock, or one of the Atomic types.

2. Use clone-on-write semantics with Arc::make_mut which provides efficient mutation without requiring interior mutability. This approach clones the data only when needed (when there are multiple references) and can be more efficient when mutations are infrequent.

3. Use Arc::get_mut when you know your Arc is not shared (has a reference count of 1), which provides direct mutable access to the inner value without any cloning.

use std::sync::Arc;

let mut data = Arc::new(vec![1, 2, 3]);

// This will clone the vector only if there are other references to it
Arc::make_mut(&mut data).push(4);

assert_eq!(*data, vec![1, 2, 3, 4]);

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 upgraded 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

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);

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);

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:?}");
    });
}

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::Relaxed);
        println!("{v:?}");
    });
}

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

Fields

ptr: NonNull<ArcInner<T>>

phantom: PhantomData<ArcInner<T>>

alloc: A

Implementations

impl<T> Arc<T>

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

Constructs a new Arc<T>.

Examples

use std::sync::Arc;

let five = Arc::new(5);

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 {
    /// Constructs 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() }
        })
    }

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

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

Constructs a new Arc with uninitialized contents.

Examples

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)

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

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

use std::sync::Arc;

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

assert_eq!(*zero, 0)

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.

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

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

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

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

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

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)?;

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

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

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

Examples

#![feature(allocator_api)]

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);

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

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

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( allocator_api)]

use std::sync::Arc;

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

assert_eq!(*zero, 0);

impl<T, A> Arc<T, A>

where A: Allocator,

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

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

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);

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

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

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

Examples

#![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)

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

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

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(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)

pub fn new_cyclic_in<F>(data_fn: F, alloc: A) -> Arc<T, A>

where F: FnOnce(&Weak<T, A>) -> T,

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

Constructs a new Arc<T, A> in the given allocator while giving you a Weak<T, A> 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, A> is created, such that you can clone and store it inside the T.

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

Since the new Arc<T, A> is not fully-constructed until Arc<T, A>::new_cyclic_in 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

See new_cyclic

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

where A: 'static,

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

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.

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

where A: 'static,

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

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

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

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

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)?;

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

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

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

Examples

#![feature(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);

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

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

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(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);

pub fn try_unwrap(this: Arc<T, A>) -> Result<T, Arc<T, A>>

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 keep the Arc in the Err case. Immediately dropping the Err-value, as the expression Arc::try_unwrap(this).ok() does, can cause the strong count to drop to zero and the inner value of the Arc to be dropped. For instance, if two threads execute such an expression in parallel, there is a race condition without the possibility of unsafety: The threads could first both check whether they own the last instance in Arc::try_unwrap, determine that they both do not, and then both discard and drop their instance in the call to ok. In this scenario, the value inside the Arc is safely destroyed by exactly one of the threads, but neither thread will ever be able to use the value.

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);

pub fn into_inner(this: Arc<T, A>) -> 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.

Arc::try_unwrap is conceptually similar to Arc::into_inner, but it is meant for different use-cases. If used as a direct replacement for Arc::into_inner anyway, such as with the expression Arc::try_unwrap(this).ok(), then it does not give the same guarantee as described in the previous paragraph. For more information, see the examples below and read 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.

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();
let size = 100000;
for i in 0..size {
    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();

impl<T> Arc<[T]>

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

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

Examples

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])

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

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

use std::sync::Arc;

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

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

pub fn into_array<const N: usize>(self) -> Option<Arc<[T; N]>>

🔬This is a nightly-only experimental API. (slice_as_array)

Converts the reference-counted slice into a reference-counted array.

This operation does not reallocate; the underlying array of the slice is simply reinterpreted as an array type.

If N is not exactly equal to the length of self, then this method returns None.

impl<T, A> Arc<[T], A>

where A: Allocator,

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

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

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

Examples

#![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])

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

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

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(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])

impl<T, A> Arc<MaybeUninit<T>, A>

where A: Allocator,

pub unsafe fn assume_init(self) -> Arc<T, A>

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

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)

impl<T, A> Arc<[MaybeUninit<T>], A>

where A: Allocator,

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

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

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])

impl<T> Arc<T>

where T: ?Sized,

pub unsafe fn from_raw(ptr: *const T) -> Arc<T>

Constructs an Arc<T> from a raw pointer.

The raw pointer must have been previously returned by a call to Arc<U>::into_raw with the following requirements:

• If U is sized, it must have the same size and alignment as T. This is trivially true if U is T.
• If U is unsized, its data pointer must have the same size and alignment as T. This is trivially true if Arc<U> was constructed through Arc<T> and then converted to Arc<U> through an unsized coercion.

Note that if U or U’s data pointer 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 the global allocator.

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!

Convert a slice back into its original array:

use std::sync::Arc;

let x: Arc<[u32]> = Arc::new([1, 2, 3]);
let x_ptr: *const [u32] = Arc::into_raw(x);

unsafe {
    let x: Arc<[u32; 3]> = Arc::from_raw(x_ptr.cast::<[u32; 3]>());
    assert_eq!(&*x, &[1, 2, 3]);
}

pub fn into_raw(this: Arc<T>) -> *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");

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 must satisfy the same layout requirements specified in Arc::from_raw_in. 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 the global allocator.

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));
}

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 must satisfy the same layout requirements specified in Arc::from_raw_in. 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 the global allocator. 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));
}

impl<T, A> Arc<T, A>

where A: Allocator, T: ?Sized,

pub fn allocator(this: &Arc<T, A>) -> &A

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

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.

pub fn into_raw_with_allocator(this: Arc<T, A>) -> (*const T, A)

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

Consumes the Arc, returning the wrapped pointer and allocator.

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

Examples

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

let x = Arc::new_in("hello".to_owned(), System);
let (ptr, alloc) = Arc::into_raw_with_allocator(x);
assert_eq!(unsafe { &*ptr }, "hello");
let x = unsafe { Arc::from_raw_in(ptr, alloc) };
assert_eq!(&*x, "hello");

pub fn as_ptr(this: &Arc<T, A>) -> *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");

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

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

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 with the following requirements:

• If U is sized, it must have the same size and alignment as T. This is trivially true if U is T.
• If U is unsized, its data pointer must have the same size and alignment as T. This is trivially true if Arc<U> was constructed through Arc<T> and then converted to Arc<U> through an unsized coercion.

Note that if U or U’s data pointer 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, alloc) = Arc::into_raw_with_allocator(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!

Convert a slice back into its original array:

#![feature(allocator_api)]

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

let x: Arc<[u32], _> = Arc::new_in([1, 2, 3], System);
let x_ptr: *const [u32] = Arc::into_raw_with_allocator(x).0;

unsafe {
    let x: Arc<[u32; 3], _> = Arc::from_raw_in(x_ptr.cast::<[u32; 3]>(), System);
    assert_eq!(&*x, &[1, 2, 3]);
}

pub fn downgrade(this: &Arc<T, A>) -> 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);

pub fn weak_count(this: &Arc<T, A>) -> 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));

pub fn strong_count(this: &Arc<T, A>) -> 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));

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

where A: Clone,

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

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 must satisfy the same layout requirements specified in Arc::from_raw_in. 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, _alloc) = Arc::into_raw_with_allocator(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));
}

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

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

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 must satisfy the same layout requirements specified in Arc::from_raw_in. 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, _alloc) = Arc::into_raw_with_allocator(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));
}

pub fn ptr_eq(this: &Arc<T, A>, other: &Arc<T, A>) -> bool

Returns true if the two Arcs 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));

impl<T, A> Arc<T, A>

where T: CloneToUninit + ?Sized, A: Allocator + Clone,

pub fn make_mut(this: &mut Arc<T, A>) -> &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);

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());

impl<T, A> Arc<T, A>

where T: Clone, A: Allocator,

pub fn unwrap_or_clone(this: Arc<T, A>) -> T

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

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()));

impl<T, A> Arc<T, A>

where A: Allocator, T: ?Sized,

pub fn get_mut(this: &mut Arc<T, A>) -> 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());

pub unsafe fn get_mut_unchecked(this: &mut Arc<T, A>) -> &mut T

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

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 Arc (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");

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

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();
    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

pub fn is_unique(this: &Arc<T, A>) -> bool

🔬This is a nightly-only experimental API. (arc_is_unique)

Determine whether this is the unique reference to the underlying data.

Returns true if there are no other Arc or Weak pointers to the same allocation; returns false otherwise.

If this function returns true, then is guaranteed to be safe to call get_mut_unchecked on this Arc, so long as no clones occur in between.

Examples

#![feature(arc_is_unique)]

use std::sync::Arc;

let x = Arc::new(3);
assert!(Arc::is_unique(&x));

let y = Arc::clone(&x);
assert!(!Arc::is_unique(&x));
drop(y);

// Weak references also count, because they could be upgraded at any time.
let z = Arc::downgrade(&x);
assert!(!Arc::is_unique(&x));

Pointer invalidation

This function will always return the same value as Arc::get_mut(arc).is_some(). However, unlike that operation it does not produce any mutable references to the underlying data, meaning no pointers to the data inside the Arc are invalidated by the call. Thus, the following code is valid, even though it would be UB if it used Arc::get_mut:

#![feature(arc_is_unique)]

use std::sync::Arc;

let arc = Arc::new(5);
let pointer: *const i32 = &*arc;
assert!(Arc::is_unique(&arc));
assert_eq!(unsafe { *pointer }, 5);

Atomic orderings

Concurrent drops to other Arc pointers to the same allocation will synchronize with this call - that is, this call performs an Acquire operation on the underlying strong and weak ref counts. This ensures that calling get_mut_unchecked is safe.

Note that this operation requires locking the weak ref count, so concurrent calls to downgrade may spin-loop for a short period of time.

impl<A> Arc<dyn Any + Sync + Send, A>

where A: Allocator,

pub fn downcast<T>(self) -> Result<Arc<T, A>, Arc<dyn Any + Sync + Send, A>>

where T: Any + Send + Sync,

Attempts 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));

pub unsafe fn downcast_unchecked<T>(self) -> Arc<T, A>

where T: Any + Send + Sync,

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

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);
}

Safety

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

Trait Implementations

impl<T> Access for Arc<T>

where T: Access + ?Sized,

All functions in Accessor only requires &self, so it’s safe to implement Accessor for Arc<impl Access>.

type Reader = <T as Access>::Reader

Reader is the associated reader returned in read operation.

type Writer = <T as Access>::Writer

Writer is the associated writer returned in write operation.

type Lister = <T as Access>::Lister

Lister is the associated lister returned in list operation.

type Deleter = <T as Access>::Deleter

Deleter is the associated deleter returned in delete operation.

type BlockingReader = <T as Access>::BlockingReader

BlockingReader is the associated reader returned blocking_read operation.

type BlockingWriter = <T as Access>::BlockingWriter

BlockingWriter is the associated writer returned blocking_write operation.

type BlockingLister = <T as Access>::BlockingLister

BlockingLister is the associated lister returned blocking_list operation.

type BlockingDeleter = <T as Access>::BlockingDeleter

BlockingDeleter is the associated deleter returned blocking_delete operation.

fn info(&self) -> Arc<AccessorInfo>

Invoke the info operation to get metadata of accessor.

fn create_dir( &self, path: &str, args: OpCreateDir, ) -> impl Future<Output = Result<RpCreateDir, Error>> + MaybeSend

Invoke the create operation on the specified path

fn stat( &self, path: &str, args: OpStat, ) -> impl Future<Output = Result<RpStat, Error>> + MaybeSend

Invoke the stat operation on the specified path.

fn read( &self, path: &str, args: OpRead, ) -> impl Future<Output = Result<(RpRead, <Arc<T> as Access>::Reader), Error>> + MaybeSend

Invoke the read operation on the specified path, returns a [Reader][crate::Reader] if operate successful.

fn write( &self, path: &str, args: OpWrite, ) -> impl Future<Output = Result<(RpWrite, <Arc<T> as Access>::Writer), Error>> + MaybeSend

Invoke the write operation on the specified path, returns a written size if operate successful.

fn delete( &self, ) -> impl Future<Output = Result<(RpDelete, <Arc<T> as Access>::Deleter), Error>> + MaybeSend

Invoke the delete operation on the specified path.

fn list( &self, path: &str, args: OpList, ) -> impl Future<Output = Result<(RpList, <Arc<T> as Access>::Lister), Error>> + MaybeSend

Invoke the list operation on the specified path.

fn copy( &self, from: &str, to: &str, args: OpCopy, ) -> impl Future<Output = Result<RpCopy, Error>> + MaybeSend

Invoke the copy operation on the specified from path and to path.

fn rename( &self, from: &str, to: &str, args: OpRename, ) -> impl Future<Output = Result<RpRename, Error>> + MaybeSend

Invoke the rename operation on the specified from path and to path.

fn presign( &self, path: &str, args: OpPresign, ) -> impl Future<Output = Result<RpPresign, Error>> + MaybeSend

Invoke the presign operation on the specified path.

fn blocking_create_dir( &self, path: &str, args: OpCreateDir, ) -> Result<RpCreateDir, Error>

Invoke the blocking_create operation on the specified path.

fn blocking_stat(&self, path: &str, args: OpStat) -> Result<RpStat, Error>

Invoke the blocking_stat operation on the specified path.

fn blocking_read( &self, path: &str, args: OpRead, ) -> Result<(RpRead, <Arc<T> as Access>::BlockingReader), Error>

Invoke the blocking_read operation on the specified path.

fn blocking_write( &self, path: &str, args: OpWrite, ) -> Result<(RpWrite, <Arc<T> as Access>::BlockingWriter), Error>

Invoke the blocking_write operation on the specified path.

fn blocking_delete( &self, ) -> Result<(RpDelete, <Arc<T> as Access>::BlockingDeleter), Error>

Invoke the blocking_delete operation on the specified path.

fn blocking_list( &self, path: &str, args: OpList, ) -> Result<(RpList, <Arc<T> as Access>::BlockingLister), Error>

Invoke the blocking_list operation on the specified path.

fn blocking_copy( &self, from: &str, to: &str, args: OpCopy, ) -> Result<RpCopy, Error>

Invoke the blocking_copy operation on the specified from path and to path.

fn blocking_rename( &self, from: &str, to: &str, args: OpRename, ) -> Result<RpRename, Error>

Invoke the blocking_rename operation on the specified from path and to path.

impl Array for Arc<dyn Array>

Ergonomics: Allow use of an ArrayRef as an &dyn Array

fn shrink_to_fit(&mut self)

For shared buffers, this is a no-op.

fn as_any(&self) -> &(dyn Any + 'static)

Returns the array as Any so that it can be downcasted to a specific implementation.

fn to_data(&self) -> ArrayData

Returns the underlying data of this array

fn into_data(self) -> ArrayData

Returns the underlying data of this array

fn data_type(&self) -> &DataType

Returns a reference to the [DataType] of this array.

fn slice(&self, offset: usize, length: usize) -> Arc<dyn Array>

Returns a zero-copy slice of this array with the indicated offset and length.

fn len(&self) -> usize

Returns the length (i.e., number of elements) of this array.

fn is_empty(&self) -> bool

Returns whether this array is empty.

fn offset(&self) -> usize

Returns the offset into the underlying data used by this array(-slice). Note that the underlying data can be shared by many arrays. This defaults to 0.

fn nulls(&self) -> Option<&NullBuffer>

Returns the null buffer of this array if any.

fn logical_nulls(&self) -> Option<NullBuffer>

Returns a potentially computed [NullBuffer] that represents the logical null values of this array, if any.

fn is_null(&self, index: usize) -> bool

Returns whether the element at index is null according to [Array::nulls]

fn is_valid(&self, index: usize) -> bool

Returns whether the element at index is not null, the opposite of [Self::is_null].

fn null_count(&self) -> usize

Returns the total number of physical null values in this array.

fn logical_null_count(&self) -> usize

Returns the total number of logical null values in this array.

fn is_nullable(&self) -> bool

Returns false if the array is guaranteed to not contain any logical nulls

fn get_buffer_memory_size(&self) -> usize

Returns the total number of bytes of memory pointed to by this array. The buffers store bytes in the Arrow memory format, and include the data as well as the validity map. Note that this does not always correspond to the exact memory usage of an array, since multiple arrays can share the same buffers or slices thereof.

fn get_array_memory_size(&self) -> usize

Returns the total number of bytes of memory occupied physically by this array. This value will always be greater than returned by get_buffer_memory_size() and includes the overhead of the data structures that contain the pointers to the various buffers.

impl Array for Arc<dyn Array>

Ergonomics: Allow use of an ArrayRef as an &dyn Array

fn shrink_to_fit(&mut self)

For shared buffers, this is a no-op.

fn as_any(&self) -> &(dyn Any + 'static)

Returns the array as Any so that it can be downcasted to a specific implementation.

fn to_data(&self) -> ArrayData

Returns the underlying data of this array

fn into_data(self) -> ArrayData

Returns the underlying data of this array

fn data_type(&self) -> &DataType

Returns a reference to the [DataType] of this array.

fn slice(&self, offset: usize, length: usize) -> Arc<dyn Array>

Returns a zero-copy slice of this array with the indicated offset and length.

fn len(&self) -> usize

Returns the length (i.e., number of elements) of this array.

fn is_empty(&self) -> bool

Returns whether this array is empty.

fn offset(&self) -> usize

Returns the offset into the underlying data used by this array(-slice). Note that the underlying data can be shared by many arrays. This defaults to 0.

fn nulls(&self) -> Option<&NullBuffer>

Returns the null buffer of this array if any.

fn logical_nulls(&self) -> Option<NullBuffer>

Returns a potentially computed [NullBuffer] that represents the logical null values of this array, if any.

fn is_null(&self, index: usize) -> bool

Returns whether the element at index is null according to [Array::nulls]

fn is_valid(&self, index: usize) -> bool

Returns whether the element at index is not null, the opposite of [Self::is_null].

fn null_count(&self) -> usize

Returns the total number of physical null values in this array.

fn logical_null_count(&self) -> usize

Returns the total number of logical null values in this array.

fn is_nullable(&self) -> bool

Returns false if the array is guaranteed to not contain any logical nulls

fn get_buffer_memory_size(&self) -> usize

Returns the total number of bytes of memory pointed to by this array. The buffers store bytes in the Arrow memory format, and include the data as well as the validity map. Note that this does not always correspond to the exact memory usage of an array, since multiple arrays can share the same buffers or slices thereof.

fn get_array_memory_size(&self) -> usize

Returns the total number of bytes of memory occupied physically by this array. This value will always be greater than returned by get_buffer_memory_size() and includes the overhead of the data structures that contain the pointers to the various buffers.

impl AsArray for Arc<dyn Array>

fn as_boolean_opt(&self) -> Option<&BooleanArray>

Downcast this to a [BooleanArray] returning None if not possible

fn as_primitive_opt<T>(&self) -> Option<&PrimitiveArray<T>>

where T: ArrowPrimitiveType,

Downcast this to a [PrimitiveArray] returning None if not possible

fn as_bytes_opt<T>(&self) -> Option<&GenericByteArray<T>>

where T: ByteArrayType,

Downcast this to a [GenericByteArray] returning None if not possible

fn as_byte_view_opt<T>(&self) -> Option<&GenericByteViewArray<T>>

where T: ByteViewType,

Downcast this to a [GenericByteViewArray] returning None if not possible

fn as_struct_opt(&self) -> Option<&StructArray>

Downcast this to a [StructArray] returning None if not possible

fn as_union_opt(&self) -> Option<&UnionArray>

Downcast this to a [UnionArray] returning None if not possible

fn as_list_opt<O>(&self) -> Option<&GenericListArray<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericListArray] returning None if not possible

fn as_list_view_opt<O>(&self) -> Option<&GenericListViewArray<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericListViewArray] returning None if not possible

fn as_fixed_size_binary_opt(&self) -> Option<&FixedSizeBinaryArray>

Downcast this to a [FixedSizeBinaryArray] returning None if not possible

fn as_fixed_size_list_opt(&self) -> Option<&FixedSizeListArray>

Downcast this to a [FixedSizeListArray] returning None if not possible

fn as_map_opt(&self) -> Option<&MapArray>

Downcast this to a [MapArray] returning None if not possible

fn as_dictionary_opt<K>(&self) -> Option<&DictionaryArray<K>>

where K: ArrowDictionaryKeyType,

Downcast this to a [DictionaryArray] returning None if not possible

fn as_any_dictionary_opt(&self) -> Option<&dyn AnyDictionaryArray>

Downcasts this to a [AnyDictionaryArray] returning None if not possible

fn as_boolean(&self) -> &BooleanArray

Downcast this to a [BooleanArray] panicking if not possible

fn as_primitive<T>(&self) -> &PrimitiveArray<T>

where T: ArrowPrimitiveType,

Downcast this to a [PrimitiveArray] panicking if not possible

fn as_bytes<T>(&self) -> &GenericByteArray<T>

where T: ByteArrayType,

Downcast this to a [GenericByteArray] panicking if not possible

fn as_string_opt<O>(&self) -> Option<&GenericByteArray<GenericStringType<O>>>

where O: OffsetSizeTrait,

Downcast this to a [GenericStringArray] returning None if not possible

fn as_string<O>(&self) -> &GenericByteArray<GenericStringType<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericStringArray] panicking if not possible

fn as_binary_opt<O>(&self) -> Option<&GenericByteArray<GenericBinaryType<O>>>

where O: OffsetSizeTrait,

Downcast this to a [GenericBinaryArray] returning None if not possible

fn as_binary<O>(&self) -> &GenericByteArray<GenericBinaryType<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericBinaryArray] panicking if not possible

fn as_string_view_opt(&self) -> Option<&GenericByteViewArray<StringViewType>>

Downcast this to a [StringViewArray] returning None if not possible

fn as_string_view(&self) -> &GenericByteViewArray<StringViewType>

Downcast this to a [StringViewArray] panicking if not possible

fn as_binary_view_opt(&self) -> Option<&GenericByteViewArray<BinaryViewType>>

Downcast this to a [BinaryViewArray] returning None if not possible

fn as_binary_view(&self) -> &GenericByteViewArray<BinaryViewType>

Downcast this to a [BinaryViewArray] panicking if not possible

fn as_byte_view<T>(&self) -> &GenericByteViewArray<T>

where T: ByteViewType,

Downcast this to a [GenericByteViewArray] panicking if not possible

fn as_struct(&self) -> &StructArray

Downcast this to a [StructArray] panicking if not possible

fn as_union(&self) -> &UnionArray

Downcast this to a [UnionArray] panicking if not possible

fn as_list<O>(&self) -> &GenericListArray<O>

where O: OffsetSizeTrait,

Downcast this to a [GenericListArray] panicking if not possible

fn as_list_view<O>(&self) -> &GenericListViewArray<O>

where O: OffsetSizeTrait,

Downcast this to a [GenericListViewArray] panicking if not possible

fn as_fixed_size_binary(&self) -> &FixedSizeBinaryArray

Downcast this to a [FixedSizeBinaryArray] panicking if not possible

fn as_fixed_size_list(&self) -> &FixedSizeListArray

Downcast this to a [FixedSizeListArray] panicking if not possible

fn as_map(&self) -> &MapArray

Downcast this to a [MapArray] panicking if not possible

fn as_dictionary<K>(&self) -> &DictionaryArray<K>

where K: ArrowDictionaryKeyType,

Downcast this to a [DictionaryArray] panicking if not possible

fn as_any_dictionary(&self) -> &dyn AnyDictionaryArray

Downcasts this to a [AnyDictionaryArray] panicking if not possible

impl AsArray for Arc<dyn Array>

fn as_boolean_opt(&self) -> Option<&BooleanArray>

Downcast this to a [BooleanArray] returning None if not possible

fn as_primitive_opt<T>(&self) -> Option<&PrimitiveArray<T>>

where T: ArrowPrimitiveType,

Downcast this to a [PrimitiveArray] returning None if not possible

fn as_bytes_opt<T>(&self) -> Option<&GenericByteArray<T>>

where T: ByteArrayType,

Downcast this to a [GenericByteArray] returning None if not possible

fn as_byte_view_opt<T>(&self) -> Option<&GenericByteViewArray<T>>

where T: ByteViewType,

Downcast this to a [GenericByteViewArray] returning None if not possible

fn as_struct_opt(&self) -> Option<&StructArray>

Downcast this to a [StructArray] returning None if not possible

fn as_union_opt(&self) -> Option<&UnionArray>

Downcast this to a [UnionArray] returning None if not possible

fn as_list_opt<O>(&self) -> Option<&GenericListArray<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericListArray] returning None if not possible

fn as_list_view_opt<O>(&self) -> Option<&GenericListViewArray<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericListViewArray] returning None if not possible

fn as_fixed_size_binary_opt(&self) -> Option<&FixedSizeBinaryArray>

Downcast this to a [FixedSizeBinaryArray] returning None if not possible

fn as_fixed_size_list_opt(&self) -> Option<&FixedSizeListArray>

Downcast this to a [FixedSizeListArray] returning None if not possible

fn as_map_opt(&self) -> Option<&MapArray>

Downcast this to a [MapArray] returning None if not possible

fn as_dictionary_opt<K>(&self) -> Option<&DictionaryArray<K>>

where K: ArrowDictionaryKeyType,

Downcast this to a [DictionaryArray] returning None if not possible

fn as_any_dictionary_opt(&self) -> Option<&dyn AnyDictionaryArray>

Downcasts this to a [AnyDictionaryArray] returning None if not possible

fn as_boolean(&self) -> &BooleanArray

Downcast this to a [BooleanArray] panicking if not possible

fn as_primitive<T>(&self) -> &PrimitiveArray<T>

where T: ArrowPrimitiveType,

Downcast this to a [PrimitiveArray] panicking if not possible

fn as_bytes<T>(&self) -> &GenericByteArray<T>

where T: ByteArrayType,

Downcast this to a [GenericByteArray] panicking if not possible

fn as_string_opt<O>(&self) -> Option<&GenericByteArray<GenericStringType<O>>>

where O: OffsetSizeTrait,

Downcast this to a [GenericStringArray] returning None if not possible

fn as_string<O>(&self) -> &GenericByteArray<GenericStringType<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericStringArray] panicking if not possible

fn as_binary_opt<O>(&self) -> Option<&GenericByteArray<GenericBinaryType<O>>>

where O: OffsetSizeTrait,

Downcast this to a [GenericBinaryArray] returning None if not possible

fn as_binary<O>(&self) -> &GenericByteArray<GenericBinaryType<O>>

where O: OffsetSizeTrait,

Downcast this to a [GenericBinaryArray] panicking if not possible

fn as_string_view_opt(&self) -> Option<&GenericByteViewArray<StringViewType>>

Downcast this to a [StringViewArray] returning None if not possible

fn as_string_view(&self) -> &GenericByteViewArray<StringViewType>

Downcast this to a [StringViewArray] panicking if not possible

fn as_binary_view_opt(&self) -> Option<&GenericByteViewArray<BinaryViewType>>

Downcast this to a [BinaryViewArray] returning None if not possible

fn as_binary_view(&self) -> &GenericByteViewArray<BinaryViewType>

Downcast this to a [BinaryViewArray] panicking if not possible

fn as_byte_view<T>(&self) -> &GenericByteViewArray<T>

where T: ByteViewType,

Downcast this to a [GenericByteViewArray] panicking if not possible

fn as_struct(&self) -> &StructArray

Downcast this to a [StructArray] panicking if not possible

fn as_union(&self) -> &UnionArray

Downcast this to a [UnionArray] panicking if not possible

fn as_list<O>(&self) -> &GenericListArray<O>

where O: OffsetSizeTrait,

Downcast this to a [GenericListArray] panicking if not possible

fn as_list_view<O>(&self) -> &GenericListViewArray<O>

where O: OffsetSizeTrait,

Downcast this to a [GenericListViewArray] panicking if not possible

fn as_fixed_size_binary(&self) -> &FixedSizeBinaryArray

Downcast this to a [FixedSizeBinaryArray] panicking if not possible

fn as_fixed_size_list(&self) -> &FixedSizeListArray

Downcast this to a [FixedSizeListArray] panicking if not possible

fn as_map(&self) -> &MapArray

Downcast this to a [MapArray] panicking if not possible

fn as_dictionary<K>(&self) -> &DictionaryArray<K>

where K: ArrowDictionaryKeyType,

Downcast this to a [DictionaryArray] panicking if not possible

fn as_any_dictionary(&self) -> &dyn AnyDictionaryArray

Downcasts this to a [AnyDictionaryArray] panicking if not possible

impl<T> AsFd for Arc<T>

where T: AsFd + ?Sized,

This impl allows implementing traits that require AsFd on Arc.

use std::net::UdpSocket;
use std::sync::Arc;

trait MyTrait: AsFd {}
impl MyTrait for Arc<UdpSocket> {}
impl MyTrait for Box<UdpSocket> {}

fn as_fd(&self) -> BorrowedFd<'_>

Borrows the file descriptor.

impl AsQuery for Arc<[u8]>

fn as_query(&self) -> Cow<'_, [u8]>

impl AsQuery for Arc<str>

fn as_query(&self) -> Cow<'_, [u8]>

impl<T> AsRawFd for Arc<T>

where T: AsRawFd,

This impl allows implementing traits that require AsRawFd on Arc.

use std::net::UdpSocket;
use std::sync::Arc;
trait MyTrait: AsRawFd {
}
impl MyTrait for Arc<UdpSocket> {}
impl MyTrait for Box<UdpSocket> {}

fn as_raw_fd(&self) -> i32

Extracts the raw file descriptor.

impl<T, A> AsRef<T> for Arc<T, A>

where A: Allocator, T: ?Sized,

fn as_ref(&self) -> &T

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

impl<T> AsyncPushSender for Arc<T>

where T: AsyncPushSender,

fn send(&self, info: PushInfo) -> Result<(), SendError>

The sender must send without blocking, otherwise it will block the sending connection.

impl<T> AsyncSleep for Arc<T>

where T: AsyncSleep + ?Sized,

fn sleep(&self, duration: Duration) -> Sleep

Returns a future that sleeps for the given duration of time.

impl<T, A> Borrow<T> for Arc<T, A>

where A: Allocator, T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value.

impl<'de, T> BorrowDecode<'de> for Arc<[T]>

where T: BorrowDecode<'de> + 'de,

fn borrow_decode<D>(decoder: &mut D) -> Result<Arc<[T]>, DecodeError>

where D: BorrowDecoder<'de>,

Attempt to decode this type with the given BorrowDecode.

impl<'de, T> BorrowDecode<'de> for Arc<T>

where T: BorrowDecode<'de>,

fn borrow_decode<D>(decoder: &mut D) -> Result<Arc<T>, DecodeError>

where D: BorrowDecoder<'de>,

Attempt to decode this type with the given BorrowDecode.

impl<'de> BorrowDecode<'de> for Arc<str>

fn borrow_decode<D>(decoder: &mut D) -> Result<Arc<str>, DecodeError>

where D: BorrowDecoder<'de>,

Attempt to decode this type with the given BorrowDecode.

impl<T, A> Clone for Arc<T, A>

where A: Allocator + Clone, T: ?Sized,

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);

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

Performs copy-assignment from source.

impl<T, A> Debug for Arc<T, A>

where T: Debug + ?Sized, A: Allocator,

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

Formats the value using the given formatter.

impl<T> Decode for Arc<[T]>

where T: Decode + 'static,

fn decode<D>(decoder: &mut D) -> Result<Arc<[T]>, DecodeError>

where D: Decoder,

Attempt to decode this type with the given Decode.

impl<T> Decode for Arc<T>

where T: Decode,

fn decode<D>(decoder: &mut D) -> Result<Arc<T>, DecodeError>

where D: Decoder,

Attempt to decode this type with the given Decode.

impl Decode for Arc<str>

fn decode<D>(decoder: &mut D) -> Result<Arc<str>, DecodeError>

where D: Decoder,

Attempt to decode this type with the given Decode.

impl<T> Default for Arc<[T]>

fn default() -> Arc<[T]>

Creates an empty [T] inside an Arc

This may or may not share an allocation with other Arcs.

impl Default for Arc<CStr>

fn default() -> Arc<CStr>

Creates an empty CStr inside an Arc

This may or may not share an allocation with other Arcs.

impl<T> Default for Arc<T>

where T: Default,

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);

impl Default for Arc<str>

fn default() -> Arc<str>

Creates an empty str inside an Arc

This may or may not share an allocation with other Arcs.

impl<T> Default for Pin<Arc<T>>

where Arc<T>: Default, T: ?Sized,

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

Returns the “default value” for a type.

impl<T, A> Deref for Arc<T, A>

where A: Allocator, T: ?Sized,

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<'de, T> Deserialize<'de> for Arc<T>

where Box<T>: Deserialize<'de>, T: ?Sized,

This impl requires the "rc" Cargo feature of Serde.

Deserializing a data structure containing Arc will not attempt to deduplicate Arc references to the same data. Every deserialized Arc will end up with a strong count of 1.

fn deserialize<D>( deserializer: D, ) -> Result<Arc<T>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, U> DeserializeAs<'de, Arc<T>> for Arc<U>

where U: DeserializeAs<'de, T>,

fn deserialize_as<D>( deserializer: D, ) -> Result<Arc<T>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, U> DeserializeAs<'de, Pin<Arc<T>>> for Pin<Arc<U>>

where U: DeserializeAs<'de, T>,

fn deserialize_as<D>( deserializer: D, ) -> Result<Pin<Arc<T>>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, A> Display for Arc<T, A>

where T: Display + ?Sized, A: Allocator,

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

Formats the value using the given formatter.

impl<T, A> Drop for Arc<T, A>

where A: Allocator, T: ?Sized,

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!"

impl<T> Encode for Arc<T>

where T: Encode + ?Sized,

fn encode<E>(&self, encoder: &mut E) -> Result<(), EncodeError>

where E: Encoder,

Encode a given type.

impl<T> Error for Arc<T>

where T: Error + ?Sized,

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

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

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

Returns the lower-level source of this error, if any.

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

🔬This is a nightly-only experimental API. (error_generic_member_access)

Provides type-based access to context intended for error reports.

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()

impl<T> EvalErrorReport for Arc<T>

where T: EvalErrorReport + ?Sized, Arc<T>: Clone + Send + Sync,

fn report(&self, error: ExprError)

Perform the error reporting.

impl ExecutionPlanProperties for Arc<dyn ExecutionPlan>

fn output_partitioning(&self) -> &Partitioning

Specifies how the output of this ExecutionPlan is split into partitions.

fn output_ordering(&self) -> Option<&LexOrdering>

If the output of this ExecutionPlan within each partition is sorted, returns Some(keys) describing the ordering. A None return value indicates no assumptions should be made on the output ordering.

fn boundedness(&self) -> Boundedness

Boundedness information of the stream corresponding to this ExecutionPlan. For more details, see [Boundedness].

fn pipeline_behavior(&self) -> EmissionType

Indicates how the stream of this ExecutionPlan emits its results. For more details, see [EmissionType].

fn equivalence_properties(&self) -> &EquivalenceProperties

Get the [EquivalenceProperties] within the plan.

impl ExecutionPlanProperties for Arc<dyn ExecutionPlan>

fn output_partitioning(&self) -> &Partitioning

Specifies how the output of this ExecutionPlan is split into partitions.

fn output_ordering(&self) -> Option<&LexOrdering>

If the output of this ExecutionPlan within each partition is sorted, returns Some(keys) describing the ordering. A None return value indicates no assumptions should be made on the output ordering.

fn boundedness(&self) -> Boundedness

Boundedness information of the stream corresponding to this ExecutionPlan. For more details, see [Boundedness].

fn pipeline_behavior(&self) -> EmissionType

Indicates how the stream of this ExecutionPlan emits its results. For more details, see [EmissionType].

fn equivalence_properties(&self) -> &EquivalenceProperties

Get the [EquivalenceProperties] within the plan.

impl<Exe> Executor for Arc<Exe>

where Exe: Executor,

fn spawn(&self, f: Pin<Box<dyn Future<Output = ()> + Send>>) -> Result<(), ()>

spawns a new task

fn spawn_blocking<F, Res>(&self, f: F) -> JoinHandle<Res>

where F: FnOnce() -> Res + Send + 'static, Res: Send + 'static,

spawns a new blocking task

fn interval(&self, duration: Duration) -> Interval

returns a Stream that will produce at regular intervals

fn delay(&self, duration: Duration) -> Delay

waits for a configurable time

fn kind(&self) -> ExecutorKind

returns which executor is currently used

impl<S> Filter<S> for Arc<dyn Filter<S> + Sync + Send>

fn enabled(&self, meta: &Metadata<'_>, cx: &Context<'_, S>) -> bool

Returns true if this layer is interested in a span or event with the given Metadata in the current [Context], similarly to Subscriber::enabled.

fn callsite_enabled(&self, meta: &'static Metadata<'static>) -> Interest

Returns an Interest indicating whether this layer will always, sometimes, or never be interested in the given Metadata.

fn max_level_hint(&self) -> Option<LevelFilter>

Returns an optional hint of the highest verbosity level that this Filter will enable.

fn event_enabled(&self, event: &Event<'_>, cx: &Context<'_, S>) -> bool

Called before the filtered [Layer]'s [on_event], to determine if on_event` should be called.

fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)

Notifies this filter that a new span was constructed with the given Attributes and Id.

fn on_record(&self, id: &Id, values: &Record<'_>, ctx: Context<'_, S>)

Notifies this filter that a span with the given Id recorded the given values.

fn on_enter(&self, id: &Id, ctx: Context<'_, S>)

Notifies this filter that a span with the given ID was entered.

fn on_exit(&self, id: &Id, ctx: Context<'_, S>)

Notifies this filter that a span with the given ID was exited.

fn on_close(&self, id: Id, ctx: Context<'_, S>)

Notifies this filter that a span with the given ID has been closed.

impl<T> From<&[T]> for Arc<[T]>

where T: Clone,

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

Allocates a reference-counted slice and fills 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[..]);

impl From<&CStr> for Arc<CStr>

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

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

impl From<&OsStr> for Arc<OsStr>

fn from(s: &OsStr) -> Arc<OsStr>

Copies the string into a newly allocated Arc<OsStr>.

impl From<&Path> for Arc<Path>

fn from(s: &Path) -> Arc<Path>

Converts a Path into an Arc by copying the Path data into a new Arc buffer.

impl<T> From<&mut [T]> for Arc<[T]>

where T: Clone,

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

Allocates a reference-counted slice and fills it by cloning v’s items.

Example

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

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

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

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

impl From<&mut OsStr> for Arc<OsStr>

fn from(s: &mut OsStr) -> Arc<OsStr>

Copies the string into a newly allocated Arc<OsStr>.

impl From<&mut Path> for Arc<Path>

fn from(s: &mut Path) -> Arc<Path>

Converts a Path into an Arc by copying the Path data into a new Arc buffer.

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

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

Allocates a reference-counted str and copies v into it.

Example

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

impl From<&str> for Arc<str>

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

Allocates a reference-counted str and copies v into it.

Example

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

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

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[..]);

impl From<Arc<[u8]>> for Arc<ByteStr>

fn from(s: Arc<[u8]>) -> Arc<ByteStr>

Converts to this type from the input type.

impl From<Arc<ByteStr>> for Arc<[u8]>

fn from(s: Arc<ByteStr>) -> Arc<[u8]>

Converts to this type from the input type.

impl<W> From<Arc<W>> for Waker

where W: Wake + Send + Sync + 'static,

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.

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

fn from(rc: Arc<str>) -> Arc<[u8]>

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());

impl<T, A> From<Box<T, A>> for Arc<T, A>

where A: Allocator, T: ?Sized,

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[..]);

impl From<CString> for Arc<CStr>

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

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

impl<'a, B> From<Cow<'a, B>> for Arc<B>

where B: ToOwned + ?Sized, Arc<B>: From<&'a B> + From<<B as ToOwned>::Owned>,

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

Creates 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[..]);

impl From<DFSchema> for Arc<Schema>

fn from(df_schema: DFSchema) -> Arc<Schema>

Converts to this type from the input type.

impl From<DFSchema> for Arc<Schema>

fn from(df_schema: DFSchema) -> Arc<Schema>

Converts to this type from the input type.

impl From<LexOrdering> for Arc<[PhysicalSortExpr]>

Convert a LexOrdering into a Arc[<PhysicalSortExpr>] for fast copies

fn from(value: LexOrdering) -> Arc<[PhysicalSortExpr]>

Converts to this type from the input type.

impl From<LexOrdering> for Arc<[PhysicalSortExpr]>

Convert a LexOrdering into a Arc[<PhysicalSortExpr>] for fast copies

fn from(value: LexOrdering) -> Arc<[PhysicalSortExpr]>

Converts to this type from the input type.

impl From<LimitExec> for Arc<dyn ExecutionPlan>

fn from(limit_exec: LimitExec) -> Arc<dyn ExecutionPlan>

Converts to this type from the input type.

impl From<LimitExec> for Arc<dyn ExecutionPlan>

fn from(limit_exec: LimitExec) -> Arc<dyn ExecutionPlan>

Converts to this type from the input type.

impl From<OpsMut> for Arc<[Op]>

fn from(v: OpsMut) -> Arc<[Op]>

Converts to this type from the input type.

impl From<OsString> for Arc<OsStr>

fn from(s: OsString) -> Arc<OsStr>

Converts an OsString into an Arc<OsStr> by moving the OsString data into a new Arc buffer.

impl From<PathBuf> for Arc<Path>

fn from(s: PathBuf) -> Arc<Path>

Converts a PathBuf into an Arc<Path> by moving the PathBuf data into a new Arc buffer.

impl From<String> for Arc<str>

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

Allocates a reference-counted str and copies v into it.

Example

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

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

fn from(t: T) -> Arc<T>

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);

impl<T, A> From<Vec<T, A>> for Arc<[T], A>

where A: Allocator + Clone,

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

Allocates a reference-counted slice and moves 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[..]);

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

fn from_iter<I>(iter: I) -> Arc<[T]>

where I: IntoIterator<Item = T>,

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();

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.

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.

impl<T> FromRedisValue for Arc<[T]>

where T: FromRedisValue,

fn from_redis_value(v: &Value) -> Result<Arc<[T]>, RedisError>

Given a redis Value this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.

fn from_owned_redis_value(v: Value) -> Result<Arc<[T]>, RedisError>

Given a redis Value this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.

fn from_redis_values(items: &[Value]) -> Result<Vec<Self>, RedisError>

Similar to from_redis_value but constructs a vector of objects from another vector of values. This primarily exists internally to customize the behavior for vectors of tuples.

fn from_owned_redis_values(items: Vec<Value>) -> Result<Vec<Self>, RedisError>

The same as from_redis_values, but takes a Vec<Value> instead of a &[Value].

fn from_each_owned_redis_values( items: Vec<Value>, ) -> Vec<Result<Self, RedisError>>

The same as from_owned_redis_values, but returns a result for each conversion to make handling them case-by-case possible.

fn from_byte_vec(_vec: &[u8]) -> Option<Vec<Self>>

Convert bytes to a single element vector.

fn from_owned_byte_vec(_vec: Vec<u8>) -> Result<Vec<Self>, RedisError>

Convert bytes to a single element vector.

impl<T> FromRedisValue for Arc<T>

where T: FromRedisValue,

fn from_redis_value(v: &Value) -> Result<Arc<T>, RedisError>

Given a redis Value this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.

fn from_owned_redis_value(v: Value) -> Result<Arc<T>, RedisError>

Given a redis Value this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.

fn from_redis_values(items: &[Value]) -> Result<Vec<Self>, RedisError>

Similar to from_redis_value but constructs a vector of objects from another vector of values. This primarily exists internally to customize the behavior for vectors of tuples.

fn from_owned_redis_values(items: Vec<Value>) -> Result<Vec<Self>, RedisError>

The same as from_redis_values, but takes a Vec<Value> instead of a &[Value].

fn from_each_owned_redis_values( items: Vec<Value>, ) -> Vec<Result<Self, RedisError>>

The same as from_owned_redis_values, but returns a result for each conversion to make handling them case-by-case possible.

fn from_byte_vec(_vec: &[u8]) -> Option<Vec<Self>>

Convert bytes to a single element vector.

fn from_owned_byte_vec(_vec: Vec<u8>) -> Result<Vec<Self>, RedisError>

Convert bytes to a single element vector.

impl FromValue for Arc<[u8]>

type Intermediate = Arc<[u8]>

fn from_value(v: Value) -> Self

Will panic if could not convert v to Self.

fn from_value_opt(v: Value) -> Result<Self, FromValueError>

Will return Err(Error::FromValueError(v)) if could not convert v to Self.

fn get_intermediate(v: Value) -> Result<Self::Intermediate, FromValueError>

Will return Err(Error::FromValueError(v)) if v is not convertible to Self.

impl FromValue for Arc<str>

type Intermediate = Arc<str>

fn from_value(v: Value) -> Self

Will panic if could not convert v to Self.

fn from_value_opt(v: Value) -> Result<Self, FromValueError>

Will return Err(Error::FromValueError(v)) if could not convert v to Self.

fn get_intermediate(v: Value) -> Result<Self::Intermediate, FromValueError>

Will return Err(Error::FromValueError(v)) if v is not convertible to Self.

impl<T, A> Hash for Arc<T, A>

where T: Hash + ?Sized, A: Allocator,

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

where H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> HashNode for Arc<T>

where T: HashNode + ?Sized,

fn hash_node<H>(&self, state: &mut H)

where H: Hasher,

impl<T> HashNode for Arc<T>

where T: HashNode + ?Sized,

fn hash_node<H>(&self, state: &mut H)

where H: Hasher,

impl<T> HttpFetch for Arc<T>

where T: HttpFetchDyn + ?Sized,

async fn fetch(&self, req: Request<Buffer>) -> Result<Response<HttpBody>, Error>

Fetch a request in async way.

impl<T> IntoOpaque for Arc<T>

where T: Send + Sync,

fn into_ptr(self) -> *mut c_void

Converts the object into a raw pointer.

unsafe fn from_ptr(ptr: *mut c_void) -> Arc<T>

Converts the raw pointer back to the original Rust object.

impl<T> JsonSchema for Arc<T>

where T: JsonSchema + ?Sized,

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

impl<Sp> LocalSpawn for Arc<Sp>

where Sp: LocalSpawn + ?Sized,

fn spawn_local_obj( &self, future: LocalFutureObj<'static, ()>, ) -> Result<(), SpawnError>

Spawns a future that will be run to completion.

fn status_local(&self) -> Result<(), SpawnError>

Determines whether the executor is able to spawn new tasks.

impl<T> Log for Arc<T>

where T: Log + ?Sized,

fn enabled(&self, metadata: &Metadata<'_>) -> bool

Determines if a log message with the specified metadata would be logged.

fn log(&self, record: &Record<'_>)

Logs the Record.

fn flush(&self)

Flushes any buffered records.

impl<'a, W> MakeWriter<'a> for Arc<W>

where &'a W: Write + 'a,

type Writer = &'a W

The concrete io::Write implementation returned by make_writer.

fn make_writer(&'a self) -> <Arc<W> as MakeWriter<'a>>::Writer

Returns an instance of Writer.

fn make_writer_for(&'a self, meta: &Metadata<'_>) -> Self::Writer

Returns a Writer for writing data from the span or event described by the provided Metadata.

impl ObjectStore for Arc<dyn ObjectStore>

fn put<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, payload: PutPayload, ) -> Pin<Box<dyn Future<Output = Result<PutResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Save the provided bytes to the specified location

fn put_opts<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, payload: PutPayload, opts: PutOptions, ) -> Pin<Box<dyn Future<Output = Result<PutResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Save the provided payload to location with the given options

fn put_multipart<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<Box<dyn MultipartUpload>, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Perform a multipart upload

fn put_multipart_opts<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, opts: PutMultipartOpts, ) -> Pin<Box<dyn Future<Output = Result<Box<dyn MultipartUpload>, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Perform a multipart upload with options

fn get<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<GetResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the bytes that are stored at the specified location.

fn get_opts<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, options: GetOptions, ) -> Pin<Box<dyn Future<Output = Result<GetResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Perform a get request with options

fn get_range<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, range: Range<usize>, ) -> Pin<Box<dyn Future<Output = Result<Bytes, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the bytes that are stored at the specified location in the given byte range.

fn get_ranges<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, location: &'life1 Path, ranges: &'life2 [Range<usize>], ) -> Pin<Box<dyn Future<Output = Result<Vec<Bytes>, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the bytes that are stored at the specified location in the given byte ranges

fn head<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<ObjectMeta, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the metadata for the specified location

fn delete<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Delete the object at the specified location.

fn delete_stream<'a>( &'a self, locations: Pin<Box<dyn Stream<Item = Result<Path, Error>> + Send + 'a>>, ) -> Pin<Box<dyn Stream<Item = Result<Path, Error>> + Send + 'a>>

Delete all the objects at the specified locations

fn list( &self, prefix: Option<&Path>, ) -> Pin<Box<dyn Stream<Item = Result<ObjectMeta, Error>> + Send + '_>>

List all the objects with the given prefix.

fn list_with_offset( &self, prefix: Option<&Path>, offset: &Path, ) -> Pin<Box<dyn Stream<Item = Result<ObjectMeta, Error>> + Send + '_>>

List all the objects with the given prefix and a location greater than offset

fn list_with_delimiter<'life0, 'life1, 'async_trait>( &'life0 self, prefix: Option<&'life1 Path>, ) -> Pin<Box<dyn Future<Output = Result<ListResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

List objects with the given prefix and an implementation specific delimiter. Returns common prefixes (directories) in addition to object metadata.

fn copy<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Copy an object from one path to another in the same object store.

fn rename<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Move an object from one path to another in the same object store.

fn copy_if_not_exists<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Copy an object from one path to another, only if destination is empty.

fn rename_if_not_exists<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Move an object from one path to another in the same object store.

impl ObjectStore for Arc<dyn ObjectStore>

fn put<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, payload: PutPayload, ) -> Pin<Box<dyn Future<Output = Result<PutResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Save the provided bytes to the specified location

fn put_opts<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, payload: PutPayload, opts: PutOptions, ) -> Pin<Box<dyn Future<Output = Result<PutResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Save the provided payload to location with the given options

fn put_multipart<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<Box<dyn MultipartUpload>, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Perform a multipart upload

fn put_multipart_opts<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, opts: PutMultipartOpts, ) -> Pin<Box<dyn Future<Output = Result<Box<dyn MultipartUpload>, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Perform a multipart upload with options

fn get<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<GetResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the bytes that are stored at the specified location.

fn get_opts<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, options: GetOptions, ) -> Pin<Box<dyn Future<Output = Result<GetResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Perform a get request with options

fn get_range<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, range: Range<u64>, ) -> Pin<Box<dyn Future<Output = Result<Bytes, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the bytes that are stored at the specified location in the given byte range.

fn get_ranges<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, location: &'life1 Path, ranges: &'life2 [Range<u64>], ) -> Pin<Box<dyn Future<Output = Result<Vec<Bytes>, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the bytes that are stored at the specified location in the given byte ranges

fn head<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<ObjectMeta, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Return the metadata for the specified location

fn delete<'life0, 'life1, 'async_trait>( &'life0 self, location: &'life1 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Delete the object at the specified location.

fn delete_stream<'a>( &'a self, locations: Pin<Box<dyn Stream<Item = Result<Path, Error>> + Send + 'a>>, ) -> Pin<Box<dyn Stream<Item = Result<Path, Error>> + Send + 'a>>

Delete all the objects at the specified locations

fn list( &self, prefix: Option<&Path>, ) -> Pin<Box<dyn Stream<Item = Result<ObjectMeta, Error>> + Send>>

List all the objects with the given prefix.

fn list_with_offset( &self, prefix: Option<&Path>, offset: &Path, ) -> Pin<Box<dyn Stream<Item = Result<ObjectMeta, Error>> + Send>>

List all the objects with the given prefix and a location greater than offset

fn list_with_delimiter<'life0, 'life1, 'async_trait>( &'life0 self, prefix: Option<&'life1 Path>, ) -> Pin<Box<dyn Future<Output = Result<ListResult, Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

List objects with the given prefix and an implementation specific delimiter. Returns common prefixes (directories) in addition to object metadata.

fn copy<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Copy an object from one path to another in the same object store.

fn rename<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Move an object from one path to another in the same object store.

fn copy_if_not_exists<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Copy an object from one path to another, only if destination is empty.

fn rename_if_not_exists<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 Path, to: &'life2 Path, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, Arc<dyn ObjectStore>: 'async_trait,

Move an object from one path to another in the same object store.

impl<T, A> Ord for Arc<T, A>

where T: Ord + ?Sized, A: Allocator,

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

Comparison for two Arcs.

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)));

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<U> OwnedRetriever<U> for Arc<RwLock<U>>

where U: Send + 'static,

fn view<T, F>(&self, f: F) -> Result<T, ()>

where F: FnOnce(&U) -> T,

fn unwrap(self) -> Result<U, ()>

impl<T, A> PartialEq for Arc<T, A>

where T: PartialEq + ?Sized, A: Allocator,

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

Equality for two Arcs.

Two Arcs 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 Arcs that point to the same allocation are always equal.

Examples

use std::sync::Arc;

let five = Arc::new(5);

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

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

Inequality for two Arcs.

Two Arcs are not equal if their inner values are not equal.

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

Examples

use std::sync::Arc;

let five = Arc::new(5);

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

impl<T, A> PartialOrd for Arc<T, A>

where T: PartialOrd + ?Sized, A: Allocator,

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

Partial comparison for two Arcs.

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)));

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

Less-than comparison for two Arcs.

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));

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

‘Less than or equal to’ comparison for two Arcs.

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));

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

Greater-than comparison for two Arcs.

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));

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

‘Greater than or equal to’ comparison for two Arcs.

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));

impl<T, A> Pointer for Arc<T, A>

where A: Allocator, T: ?Sized,

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

Formats the value using the given formatter.

impl ProvideCredentials for Arc<dyn ProvideCredentials>

fn provide_credentials<'a>(&'a self) -> ProvideCredentials<'a>

where Arc<dyn ProvideCredentials>: 'a,

Returns a future that provides credentials.

fn fallback_on_interrupt(&self) -> Option<Credentials>

Returns fallback credentials.

impl RangeKv for Arc<RwLock<RawRwLock, BTreeMap<FullKey<Bytes>, Option<Bytes>>>>

fn range( &self, range: (Bound<FullKey<Bytes>>, Bound<FullKey<Bytes>>), limit: Option<usize>, ) -> Result<Vec<(FullKey<Bytes>, Option<Bytes>)>, StorageError>

fn rev_range( &self, range: (Bound<FullKey<Bytes>>, Bound<FullKey<Bytes>>), limit: Option<usize>, ) -> Result<Vec<(FullKey<Bytes>, Option<Bytes>)>, StorageError>

fn ingest_batch( &self, kv_pairs: impl Iterator<Item = (FullKey<Bytes>, Option<Bytes>)>, ) -> Result<(), StorageError>

fn flush(&self) -> Result<(), StorageError>

impl Read for Arc<File>

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

Pull some bytes from this source into the specified buffer, returning how many bytes were read.

fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>

Like read, except that it reads into a slice of buffers.

fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

🔬This is a nightly-only experimental API. (read_buf)

Pull some bytes from this source into the specified buffer.

fn is_read_vectored(&self) -> bool

🔬This is a nightly-only experimental API. (can_vector)

Determines if this Reader has an efficient read_vectored implementation.

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Reads all bytes until EOF in this source, placing them into buf.

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Reads all bytes until EOF in this source, appending them to buf.

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

Reads the exact number of bytes required to fill buf.

fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

🔬This is a nightly-only experimental API. (read_buf)

Reads the exact number of bytes required to fill cursor.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Read.

fn bytes(self) -> Bytes<Self>

where Self: Sized,

Transforms this Read instance to an Iterator over its bytes.

fn chain<R>(self, next: R) -> Chain<Self, R>

where R: Read, Self: Sized,

Creates an adapter which will chain this stream with another.

fn take(self, limit: u64) -> Take<Self>

where Self: Sized,

Creates an adapter which will read at most limit bytes from it.

impl<T> RefCnt for Arc<T>

type Base = T

The base type the pointer points to.

fn into_ptr(me: Arc<T>) -> *mut T

Converts the smart pointer into a raw pointer, without affecting the reference count.

fn as_ptr(me: &Arc<T>) -> *mut T

Provides a view into the smart pointer as a raw pointer.

unsafe fn from_ptr(ptr: *const T) -> Arc<T>

Converts a raw pointer back into the smart pointer, without affecting the reference count.

fn inc(me: &Self) -> *mut Self::Base

Increments the reference count by one.

unsafe fn dec(ptr: *const Self::Base)

Decrements the reference count by one.

impl RowGroups for Arc<dyn FileReader>

fn num_rows(&self) -> usize

Get the number of rows in this collection

fn column_chunks( &self, column_index: usize, ) -> Result<Box<dyn PageIterator<Item = Result<Box<dyn PageReader<Item = Result<Page, ParquetError>>>, ParquetError>>>, ParquetError>

Returns a [PageIterator] for the column chunks with the given leaf column index

impl RowGroups for Arc<dyn FileReader>

fn num_rows(&self) -> usize

Get the number of rows in this collection

fn column_chunks( &self, column_index: usize, ) -> Result<Box<dyn PageIterator<Item = Result<Box<dyn PageReader<Item = Result<Page, ParquetError>>>, ParquetError>>>, ParquetError>

Returns a [PageIterator] for the column chunks with the given leaf column index

impl Seek for Arc<File>

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

Seek to an offset, in bytes, in a stream.

fn stream_len(&mut self) -> Result<u64, Error>

🔬This is a nightly-only experimental API. (seek_stream_len)

Returns the length of this stream (in bytes).

fn stream_position(&mut self) -> Result<u64, Error>

Returns the current seek position from the start of the stream.

fn rewind(&mut self) -> Result<(), Error>

Rewind to the beginning of a stream.

fn seek_relative(&mut self, offset: i64) -> Result<(), Error>

Seeks relative to the current position.

impl<T> Serialize for Arc<T>

where T: Serialize + ?Sized,

This impl requires the "rc" Cargo feature of Serde.

Serializing a data structure containing Arc will serialize a copy of the contents of the Arc each time the Arc is referenced within the data structure. Serialization will not attempt to deduplicate these repeated data.

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, U> SerializeAs<Arc<T>> for Arc<U>

where U: SerializeAs<T>,

fn serialize_as<S>( source: &Arc<T>, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, U> SerializeAs<Pin<Arc<T>>> for Pin<Arc<U>>

where U: SerializeAs<T>,

fn serialize_as<S>( source: &Pin<Arc<T>>, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<Request, S> Service<Request> for Arc<S>

where S: Service<Request> + ?Sized,

type Response = <S as Service<Request>>::Response

Responses given by the service.

type Error = <S as Service<Request>>::Error

Errors produced by the service.

type Future = <S as Service<Request>>::Future

The future response value.

fn call(&self, req: Request) -> <Arc<S> as Service<Request>>::Future

Process the request and return the response asynchronously. call takes &self instead of mut &self because:

impl<T> SourceCode for Arc<T>

where T: SourceCode + ?Sized,

fn read_span<'a>( &'a self, span: &SourceSpan, context_lines_before: usize, context_lines_after: usize, ) -> Result<Box<dyn SpanContents<'a> + 'a>, MietteError>

Read the bytes for a specific span from this SourceCode, keeping a certain number of lines before and after the span as context.

impl<Sp> Spawn for Arc<Sp>

where Sp: Spawn + ?Sized,

fn spawn_obj(&self, future: FutureObj<'static, ()>) -> Result<(), SpawnError>

Spawns a future that will be run to completion.

fn status(&self) -> Result<(), SpawnError>

Determines whether the executor is able to spawn new tasks.

impl<S> Subscriber for Arc<S>

where S: Subscriber + ?Sized,

fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest

Registers a new callsite with this subscriber, returning whether or not the subscriber is interested in being notified about the callsite.

fn enabled(&self, metadata: &Metadata<'_>) -> bool

Returns true if a span or event with the specified metadata would be recorded.

fn max_level_hint(&self) -> Option<LevelFilter>

Returns the highest verbosity level that this Subscriber will enable, or None, if the subscriber does not implement level-based filtering or chooses not to implement this method.

fn new_span(&self, span: &Attributes<'_>) -> Id

Visit the construction of a new span, returning a new span ID for the span being constructed.

fn record(&self, span: &Id, values: &Record<'_>)

Record a set of values on a span.

fn record_follows_from(&self, span: &Id, follows: &Id)

Adds an indication that span follows from the span with the id follows.

fn event_enabled(&self, event: &Event<'_>) -> bool

Determine if an [Event] should be recorded.

fn event(&self, event: &Event<'_>)

Records that an Event has occurred.

fn enter(&self, span: &Id)

Records that a span has been entered.

fn exit(&self, span: &Id)

Records that a span has been exited.

fn clone_span(&self, id: &Id) -> Id

Notifies the subscriber that a span ID has been cloned.

fn try_close(&self, id: Id) -> bool

Notifies the subscriber that a span ID has been dropped, and returns true if there are now 0 IDs that refer to that span.

fn drop_span(&self, id: Id)

👎Deprecated since 0.1.2: use Subscriber::try_close instead

This method is deprecated.

fn current_span(&self) -> Current

Returns a type representing this subscriber’s view of the current span.

unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>

If self is the same type as the provided TypeId, returns an untyped *const pointer to that type. Otherwise, returns None.

fn on_register_dispatch(&self, subscriber: &Dispatch)

Invoked when this subscriber becomes a [Dispatch].

impl ToDFSchema for Arc<Schema>

fn to_dfschema(self) -> Result<DFSchema, DataFusionError>

Attempt to create a DSSchema

fn to_dfschema_ref(self) -> Result<Arc<DFSchema>, DataFusionError>

Attempt to create a DSSchemaRef

impl ToDFSchema for Arc<Schema>

fn to_dfschema(self) -> Result<DFSchema, DataFusionError>

Attempt to create a DSSchema

fn to_dfschema_ref(self) -> Result<Arc<DFSchema>, DataFusionError>

Attempt to create a DSSchemaRef

impl<T> ToRedisArgs for Arc<T>

where T: ToRedisArgs,

fn write_redis_args<W>(&self, out: &mut W)

where W: RedisWrite + ?Sized,

This writes the value into a vector of bytes. Each item is a single argument. Most items generate a single item.

fn num_of_args(&self) -> usize

Returns the number of arguments this value will generate.

fn describe_numeric_behavior(&self) -> NumericBehavior

Returns an information about the contained value with regards to it’s numeric behavior in a redis context. This is used in some high level concepts to switch between different implementations of redis functions (for instance INCR vs INCRBYFLOAT).

fn to_redis_args(&self) -> Vec<Vec<u8>>

This converts the value into a vector of bytes. Each item is a single argument. Most items generate a vector of a single item.

impl<T> TreeNode for Arc<T>

where T: DynTreeNode + ?Sized,

Blanket implementation for any Arc<T> where T implements [DynTreeNode] (such as Arc<dyn PhysicalExpr>).

fn apply_children<'n, F>( &'n self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'n Arc<T>) -> Result<TreeNodeRecursion, DataFusionError>,

Low-level API used to implement other APIs.

fn map_children<F>(self, f: F) -> Result<Transformed<Arc<T>>, DataFusionError>

where F: FnMut(Arc<T>) -> Result<Transformed<Arc<T>>, DataFusionError>,

Low-level API used to implement other APIs.

fn visit<'n, V>( &'n self, visitor: &mut V, ) -> Result<TreeNodeRecursion, DataFusionError>

where V: TreeNodeVisitor<'n, Node = Self>,

Visit the tree node with a [TreeNodeVisitor], performing a depth-first walk of the node and its children.

fn rewrite<R>( self, rewriter: &mut R, ) -> Result<Transformed<Self>, DataFusionError>

where R: TreeNodeRewriter<Node = Self>,

Rewrite the tree node with a [TreeNodeRewriter], performing a depth-first walk of the node and its children.

fn apply<'n, F>(&'n self, f: F) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'n Self) -> Result<TreeNodeRecursion, DataFusionError>,

Applies f to the node then each of its children, recursively (a top-down, pre-order traversal).

fn transform<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the node’s children and then the node using f (a bottom-up post-order traversal).

fn transform_down<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the tree using f in a top-down (pre-order) fashion.

fn transform_up<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the node using f in a bottom-up (post-order) fashion.

fn transform_down_up<FD, FU>( self, f_down: FD, f_up: FU, ) -> Result<Transformed<Self>, DataFusionError>

where FD: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>, FU: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Transforms the node using f_down while traversing the tree top-down (pre-order), and using f_up while traversing the tree bottom-up (post-order).

fn exists<F>(&self, f: F) -> Result<bool, DataFusionError>

where F: FnMut(&Self) -> Result<bool, DataFusionError>,

Returns true if f returns true for any node in the tree.

impl<T> TreeNode for Arc<T>

where T: DynTreeNode + ?Sized,

Blanket implementation for any Arc<T> where T implements [DynTreeNode] (such as Arc<dyn PhysicalExpr>).

fn apply_children<'n, F>( &'n self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'n Arc<T>) -> Result<TreeNodeRecursion, DataFusionError>,

Low-level API used to implement other APIs.

fn map_children<F>(self, f: F) -> Result<Transformed<Arc<T>>, DataFusionError>

where F: FnMut(Arc<T>) -> Result<Transformed<Arc<T>>, DataFusionError>,

Low-level API used to implement other APIs.

fn visit<'n, V>( &'n self, visitor: &mut V, ) -> Result<TreeNodeRecursion, DataFusionError>

where V: TreeNodeVisitor<'n, Node = Self>,

Visit the tree node with a [TreeNodeVisitor], performing a depth-first walk of the node and its children.

fn rewrite<R>( self, rewriter: &mut R, ) -> Result<Transformed<Self>, DataFusionError>

where R: TreeNodeRewriter<Node = Self>,

Rewrite the tree node with a [TreeNodeRewriter], performing a depth-first walk of the node and its children.

fn apply<'n, F>(&'n self, f: F) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'n Self) -> Result<TreeNodeRecursion, DataFusionError>,

Applies f to the node then each of its children, recursively (a top-down, pre-order traversal).

fn transform<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the node’s children and then the node using f (a bottom-up post-order traversal).

fn transform_down<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the tree using f in a top-down (pre-order) fashion.

fn transform_up<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the node using f in a bottom-up (post-order) fashion.

fn transform_down_up<FD, FU>( self, f_down: FD, f_up: FU, ) -> Result<Transformed<Self>, DataFusionError>

where FD: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>, FU: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Transforms the node using f_down while traversing the tree top-down (pre-order), and using f_up while traversing the tree bottom-up (post-order).

fn exists<F>(&self, f: F) -> Result<bool, DataFusionError>

where F: FnMut(&Self) -> Result<bool, DataFusionError>,

Returns true if f returns true for any node in the tree.

impl<'a, T, C> TreeNodeContainer<'a, T> for Arc<C>

where T: 'a, C: TreeNodeContainer<'a, T> + Clone,

fn apply_elements<F>( &'a self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'a T) -> Result<TreeNodeRecursion, DataFusionError>,

Applies f to all elements of the container. This method is usually called from [TreeNode::apply_children] implementations as a node is actually a container of the node’s children.

fn map_elements<F>(self, f: F) -> Result<Transformed<Arc<C>>, DataFusionError>

where F: FnMut(T) -> Result<Transformed<T>, DataFusionError>,

Maps all elements of the container with f. This method is usually called from [TreeNode::map_children] implementations as a node is actually a container of the node’s children.

impl<'a, T, C> TreeNodeContainer<'a, T> for Arc<C>

where T: 'a, C: TreeNodeContainer<'a, T> + Clone,

fn apply_elements<F>( &'a self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'a T) -> Result<TreeNodeRecursion, DataFusionError>,

Applies f to all elements of the container. This method is usually called from [TreeNode::apply_children] implementations as a node is actually a container of the node’s children.

fn map_elements<F>(self, f: F) -> Result<Transformed<Arc<C>>, DataFusionError>

where F: FnMut(T) -> Result<Transformed<T>, DataFusionError>,

Maps all elements of the container with f. This method is usually called from [TreeNode::map_children] implementations as a node is actually a container of the node’s children.

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

where A: Allocator,

type Error = Arc<[T], A>

The type returned in the event of a conversion error.

fn try_from( boxed_slice: Arc<[T], A>, ) -> Result<Arc<[T; N], A>, <Arc<[T; N], A> as TryFrom<Arc<[T], A>>>::Error>

Performs the conversion.

impl TryFrom<DfSchema> for Arc<DFSchema>

type Error = Error

The type returned in the event of a conversion error.

fn try_from( df_schema: DfSchema, ) -> Result<Arc<DFSchema>, <Arc<DFSchema> as TryFrom<DfSchema>>::Error>

Performs the conversion.

impl TryFrom<Value> for Arc<[u8]>

type Error = FromValueError

The type returned in the event of a conversion error.

fn try_from(v: Value) -> Result<Arc<[u8]>, <Arc<[u8]> as TryFrom<Value>>::Error>

Performs the conversion.

impl TryFrom<Value> for Arc<str>

type Error = FromValueError

The type returned in the event of a conversion error.

fn try_from(v: Value) -> Result<Arc<str>, <Arc<str> as TryFrom<Value>>::Error>

Performs the conversion.

impl<T> ValueParserFactory for Arc<T>

where T: ValueParserFactory + Send + Sync + Clone, <T as ValueParserFactory>::Parser: TypedValueParser<Value = T>,

type Parser = MapValueParser<<T as ValueParserFactory>::Parser, fn(T) -> Arc<T>>

Generated parser, usually [ValueParser].

fn value_parser() -> <Arc<T> as ValueParserFactory>::Parser

Create the specified [Self::Parser]

impl WithDataType for Arc<Bytes>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Date>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Decimal>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Decimal>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Int256>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Interval>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<JsonbVal>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<OrderedFloat<f32>>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<OrderedFloat<f64>>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Serial>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<String>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Time>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Timestamp>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Timestamptz>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<Vec<u8>>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<bool>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<char>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<f32>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<f64>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<i16>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<i32>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl WithDataType for Arc<i64>

fn default_data_type() -> DataType

Returns the most obvious DataType for the rust type.

impl Write for Arc<File>

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

Writes a buffer into this writer, returning how many bytes were written.

fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>

Like write, except that it writes from a slice of buffers.

fn is_write_vectored(&self) -> bool

🔬This is a nightly-only experimental API. (can_vector)

Determines if this Writer has an efficient write_vectored implementation.

fn flush(&mut self) -> Result<(), Error>

Flushes this output stream, ensuring that all intermediately buffered contents reach their destination.

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

Attempts to write an entire buffer into this writer.

fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>

🔬This is a nightly-only experimental API. (write_all_vectored)

Attempts to write multiple buffers into this writer.

fn write_fmt(&mut self, args: Arguments<'_>) -> Result<(), Error>

Writes a formatted string into this writer, returning any error encountered.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Write.

impl<T> CloneFromCell for Arc<T>

where T: ?Sized,

impl<T, U, A> CoerceUnsized<Arc<U, A>> for Arc<T, A>

where T: Unsize<U> + ?Sized, A: Allocator, U: ?Sized,

impl<T, A> DerefPure for Arc<T, A>

where A: Allocator, T: ?Sized,

impl<T, U> DispatchFromDyn<Arc<U>> for Arc<T>

where T: Unsize<U> + ?Sized, U: ?Sized,

impl<T, A> Eq for Arc<T, A>

where T: Eq + ?Sized, A: Allocator,

impl<T, A> PinCoerceUnsized for Arc<T, A>

where A: Allocator, T: ?Sized,

impl<T, A> Send for Arc<T, A>

where T: Sync + Send + ?Sized, A: Allocator + Send,

impl<T, A> Sync for Arc<T, A>

where T: Sync + Send + ?Sized, A: Allocator + Sync,

impl<T, A> Unpin for Arc<T, A>

where A: Allocator, T: ?Sized,

impl<T, A> UnwindSafe for Arc<T, A>

where T: RefUnwindSafe + ?Sized, A: Allocator + UnwindSafe,

impl<T, A> UseCloned for Arc<T, A>

where A: Allocator + Clone, T: ?Sized,