Struct std::collections::linked_list::BackPlace

#[must_use = "places do nothing unless written to with `<-` syntax"]
pub struct BackPlace<'a, T> where T: 'a { /* fields omitted */ }

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

struct name and placement protocol are subject to change

A place for insertion at the back of a LinkedList.

See LinkedList::back_place for details.

Trait Implementations

impl<'a, T> Place<T> for BackPlace<'a, T>

fn pointer(&mut self) -> *mut T

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

Returns the address where the input value will be written. Note that the data at this address is generally uninitialized, and thus one should use ptr::write for initializing it.

impl<'a, T> InPlace<T> for BackPlace<'a, T>

type Owner = ()

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

Owner is the type of the end value of in (PLACE) EXPR

unsafe fn finalize(self)

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

Converts self into the final value, shifting deallocation/cleanup responsibilities (if any remain), over to the returned instance of Owner and forgetting self.

impl<'a, T> Placer<T> for BackPlace<'a, T>

type Place = BackPlace<'a, T>

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

Place is the intermedate agent guarding the uninitialized state for Data.

fn make_place(self) -> BackPlace<'a, T>

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

Creates a fresh place from self.