Struct rustc_middle::mir::interpret::allocation::Relocations

pub struct Relocations<Prov = AllocId>(SortedMap<Size, Prov>);

“Relocations” stores the provenance information of pointers stored in memory.

Tuple Fields

0: SortedMap<Size, Prov>

Implementations

impl<Prov> Relocations<Prov>

pub fn new() -> Self

pub fn from_presorted(r: Vec<(Size, Prov)>) -> Self

Trait Implementations

impl<Prov: Clone> Clone for Relocations<Prov>

fn clone(&self) -> Relocations<Prov>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Prov: Debug> Debug for Relocations<Prov>

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

Formats the value using the given formatter.

impl<'tcx, Prov, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Relocations<Prov> where
    Prov: Decodable<__D>, 

fn decode(__decoder: &mut __D) -> Self

impl<Prov> Deref for Relocations<Prov>

type Target = SortedMap<Size, Prov>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'tcx, Prov, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Relocations<Prov> where
    Prov: Encodable<__E>, 

fn encode(&self, __encoder: &mut __E)

impl<Prov: Hash> Hash for Relocations<Prov>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'a, Prov> HashStable<StableHashingContext<'a>> for Relocations<Prov> where
    Prov: HashStable<StableHashingContext<'a>>, 

fn hash_stable(
    &self,
    hcx: &mut StableHashingContext<'a>,
    hasher: &mut StableHasher
)

impl<Prov: Ord> Ord for Relocations<Prov>

fn cmp(&self, other: &Relocations<Prov>) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

Restrict a value to a certain interval.

impl<Prov: PartialEq> PartialEq<Relocations<Prov>> for Relocations<Prov>

fn eq(&self, other: &Relocations<Prov>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Relocations<Prov>) -> bool

This method tests for !=.

impl<Prov: PartialOrd> PartialOrd<Relocations<Prov>> for Relocations<Prov>

fn partial_cmp(&self, other: &Relocations<Prov>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Prov: Eq> Eq for Relocations<Prov>

impl<Prov> StructuralEq for Relocations<Prov>

impl<Prov> StructuralPartialEq for Relocations<Prov>

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 24 bytes