Struct BasicBlockMap 

pub struct BasicBlockMap { /* private fields */ }

The underlying hash map of the BasicBlockList.

Trait Implementations

impl Map<BasicBlock, BasicBlockNode> for BasicBlockMap

fn len(&self) -> usize

Returns the number of elements in the map.

fn clear(&mut self)

Clears the map, removing all key-value pairs. Keeps the allocated memory for reuse.

fn get<Q>(&self, k: &Q) -> Option<&BasicBlockNode>

where BasicBlock: Borrow<Q>, Q: ?Sized + Hash + Eq,

Returns a reference to the value corresponding to the key.

fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut BasicBlockNode>

where BasicBlock: Borrow<Q>, Q: ?Sized + Hash + Eq,

Returns a mutable reference to the value corresponding to the key.

fn insert<T>(&mut self, k: BasicBlock, v: T) -> Result<(), (BasicBlock, T)>

where T: Into<BasicBlockNode>,

Inserts a key-value pair into the map.

fn remove_entry<Q>(&mut self, k: &Q) -> Option<(BasicBlock, BasicBlockNode)>

where BasicBlock: Borrow<Q>, Q: ?Sized + Hash + Eq,

Removes a key from the map, returning the stored key and value if the key was previously in the map.

fn is_empty(&self) -> bool

Returns true if the map contains no elements.

fn contains_key<Q>(&self, k: &Q) -> bool

where K: Hash + Eq + Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns true if the map contains a value for the specified key.

fn remove<Q>(&mut self, k: &Q) -> Option<V>

where K: Hash + Eq + Borrow<Q>, Q: Hash + Eq + ?Sized,

Removes a key from the map, returning the value at the key if the key was previously in the map.