Struct vstd::hash_map::HashMapWithView

source · 
pub struct HashMapWithView<Key, Value>
where
    Key: View + Eq + Hash,
{ /* private fields */ }

Implementations§

source§

impl<Key, Value> HashMapWithView<Key, Value>
where Key: View + Eq + Hash,

source

pub exec fn new() -> result : Self

requires
obeys_key_model::<Key>(),
forall |k1: Key, k2: Key| k1@ == k2@ ==> k1 == k2,
ensures
result@ == Map::<<Key as View>::V, Value>::empty(),
source

pub exec fn with_capacity(capacity: usize) -> result : Self

requires
obeys_key_model::<Key>(),
forall |k1: Key, k2: Key| k1@ == k2@ ==> k1 == k2,
ensures
result@ == Map::<<Key as View>::V, Value>::empty(),
source

pub exec fn reserve(&mut self, additional: usize)

ensures
self@ == old(self)@,
source

pub open spec fn spec_len(&self) -> usize

{}
source

pub exec fn len(&self) -> result : usize

ensures
result == self@.len(),
source

pub exec fn insert(&mut self, k: Key, v: Value)

ensures
self@ == old(self)@.insert(k@, v),
source

pub exec fn remove(&mut self, k: &Key)

ensures
self@ == old(self)@.remove(k@),
source

pub exec fn contains_key(&self, k: &Key) -> result : bool

ensures
result == self@.contains_key(k@),
source

pub exec fn get<'a>(&'a self, k: &Key) -> result : Option<&'a Value>

ensures
match result {
    Some(v) => self@.contains_key(k@) && *v == self@[k@],
    None => !self@.contains_key(k@),
},
source

pub exec fn clear(&mut self)

ensures
self@ == Map::<<Key as View>::V, Value>::empty(),
source

pub exec fn union_prefer_right(&mut self, other: Self)

ensures
self@ == old(self)@.union_prefer_right(other@),

Trait Implementations§

source§

impl<Key, Value> View for HashMapWithView<Key, Value>
where Key: View + Eq + Hash,

source§

closed spec fn view(&self) -> Self::V

§

type V = Map<<Key as View>::V, Value>

Auto Trait Implementations§

§

impl<Key, Value> RefUnwindSafe for HashMapWithView<Key, Value>
where Key: RefUnwindSafe, Value: RefUnwindSafe,

§

impl<Key, Value> Send for HashMapWithView<Key, Value>
where Key: Send, Value: Send,

§

impl<Key, Value> Sync for HashMapWithView<Key, Value>
where Key: Sync, Value: Sync,

§

impl<Key, Value> Unpin for HashMapWithView<Key, Value>
where Key: Unpin, Value: Unpin,

§

impl<Key, Value> UnwindSafe for HashMapWithView<Key, Value>
where Key: UnwindSafe, Value: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

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

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

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

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

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

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

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

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

Performs the conversion.