Struct rustc_middle::mir::interpret::Relocations

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

Relocations.

Implementations

impl<Tag, Id> Relocations<Tag, Id>

pub fn new() -> Self

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

Methods from Deref<Target = SortedMap<Size, (Tag, AllocId)>>

pub fn insert(&mut self, key: K, value: V) -> Option<V>

pub fn remove(&mut self, key: &K) -> Option<V>

pub fn get<Q>(&self, key: &Q) -> Option<&V> where
    K: Borrow<Q>,
    Q: Ord + ?Sized, 

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V> where
    K: Borrow<Q>,
    Q: Ord + ?Sized, 

pub fn clear(&mut self)

pub fn iter(&self) -> Iter<'_, (K, V)>

Iterate over elements, sorted by key

pub fn keys(
    &self
) -> impl DoubleEndedIterator + ExactSizeIterator + Iterator<Item = &K>

Iterate over the keys, sorted

pub fn values(
    &self
) -> impl DoubleEndedIterator + ExactSizeIterator + Iterator<Item = &V>

Iterate over values, sorted by key

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn range<R>(&self, range: R) -> &[(K, V)] where
    R: RangeBounds<K>, 

pub fn remove_range<R>(&mut self, range: R) where
    R: RangeBounds<K>, 

pub fn offset_keys<F>(&mut self, f: F) where
    F: Fn(&mut K), 

Mutate all keys with the given function f. This mutation must not change the sort-order of keys.

pub fn insert_presorted(&mut self, elements: Vec<(K, V)>)

Inserts a presorted range of elements into the map. If the range can be inserted as a whole in between to existing elements of the map, this will be faster than inserting the elements individually.

It is up to the caller to make sure that the elements are sorted by key and that there are no duplicates.

pub fn contains_key<Q>(&self, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Ord + ?Sized, 

Trait Implementations

impl<Tag: Clone, Id: Clone> Clone for Relocations<Tag, Id>

fn clone(&self) -> Relocations<Tag, Id>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Tag: Debug, Id: Debug> Debug for Relocations<Tag, Id>

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

Formats the value using the given formatter.

impl<'tcx, Tag, Id, __D: TyDecoder<'tcx>> Decodable<__D> for Relocations<Tag, Id> where
    Tag: Decodable<__D>,
    Id: Decodable<__D>, 

fn decode(__decoder: &mut __D) -> Result<Self, <__D as Decoder>::Error>

impl<Tag> Deref for Relocations<Tag>

type Target = SortedMap<Size, (Tag, AllocId)>

The resulting type after dereferencing.

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

Dereferences the value.

impl<Tag> DerefMut for Relocations<Tag>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'tcx, Tag, Id, __E: TyEncoder<'tcx>> Encodable<__E> for Relocations<Tag, Id> where
    Tag: Encodable<__E>,
    Id: Encodable<__E>, 

fn encode(&self, __encoder: &mut __E) -> Result<(), <__E as Encoder>::Error>

impl<Tag: Eq, Id: Eq> Eq for Relocations<Tag, Id>

impl<Tag: Hash, Id: Hash> Hash for Relocations<Tag, Id>

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, Tag> HashStable<StableHashingContext<'a>> for Relocations<Tag> where
    Tag: HashStable<StableHashingContext<'a>>, 

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

impl<Tag: Ord, Id: Ord> Ord for Relocations<Tag, Id>

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

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

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

Restrict a value to a certain interval.

impl<Tag: PartialEq, Id: PartialEq> PartialEq<Relocations<Tag, Id>> for Relocations<Tag, Id>

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

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

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

This method tests for !=.

impl<Tag: PartialOrd, Id: PartialOrd> PartialOrd<Relocations<Tag, Id>> for Relocations<Tag, Id>

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

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

fn lt(&self, other: &Relocations<Tag, Id>) -> bool

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

fn le(&self, other: &Relocations<Tag, Id>) -> bool

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

fn gt(&self, other: &Relocations<Tag, Id>) -> bool

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

fn ge(&self, other: &Relocations<Tag, Id>) -> bool

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

impl<Tag, Id> StructuralEq for Relocations<Tag, Id>

impl<Tag, Id> StructuralPartialEq for Relocations<Tag, Id>