Struct DenseHashSet 

pub struct DenseHashSet<K, H = DenseHashDefault<K>, E = DenseEqDefault<K>> { /* private fields */ }

Implementations

impl<K, H, E> DenseHashSet<K, H, E>

where K: Clone, H: DenseHasher<K> + Default, E: DenseEq<K> + Default,

pub fn new(empty_key: K) -> DenseHashSet<K, H, E>

DenseHashSet(empty_key, buckets = 0). Reference: DenseHash.h:482-485.

pub fn insert(&mut self, key: K) -> &K

insert — inserts key if absent and returns a reference to the stored key. Reference: DenseHash.h:492-496.

pub fn find(&self, key: &K) -> Option<&K>

const Key* find(const Key&) const. Reference: DenseHash.h:498-501.

pub fn get(&self, key: &K) -> Option<&K>

std-style alias for generated Rust that spelled C++ find as get.

pub fn insert_mut(&mut self, key: K) -> &mut K

Mutable analogue of insert: inserts key if absent and returns a mutable reference to the stored key. C++ insert returns const Key& and callers reach for const_cast<Key&> when they need to fix up a stored entry in place (e.g. AstNameTable::getOrAddWithType rewriting a non-owned name pointer to an allocator-owned copy of the same bytes — the hash/eq are unchanged so the slot stays valid). This exposes that mutation soundly. Not a separate C++ method; the mutable access is the faithful Rust spelling of the const_cast idiom.

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

Mutable analogue of find.

pub fn contains(&self, key: &K) -> bool

contains. Reference: DenseHash.h:503-506.

pub fn size(&self) -> usize

size. Reference: DenseHash.h:508-511.

pub fn empty(&self) -> bool

empty. Reference: DenseHash.h:513-516.

pub fn clear(&mut self)

clear. Reference: DenseHash.h:487-490.

pub fn iter(&self) -> ConstIterator<'_, K, K, ItemInterfaceSet<K>, H, E>

begin()/end() iteration, yielding &Key.

Trait Implementations

impl<K, H, E> Clone for DenseHashSet<K, H, E>

where K: Clone, H: Clone, E: Clone,

fn clone(&self) -> DenseHashSet<K, H, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, H, E> Debug for DenseHashSet<K, H, E>

where K: Debug,

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

Formats the value using the given formatter.

impl<K, H, E> Default for DenseHashSet<K, H, E>

where K: Clone + DenseDefault, H: DenseHasher<K> + Default, E: DenseEq<K> + Default,

C++ members declare their empty key inline (DenseHashSet<T> x{emptyT}); Rust #[derive(Default)] on containing structs needs this. The empty key comes from the element’s DenseDefault sentinel.

fn default() -> DenseHashSet<K, H, E>

Returns the “default value” for a type.

impl<K, H, E> PartialEq for DenseHashSet<K, H, E>

where K: Clone, H: DenseHasher<K> + Default, E: DenseEq<K> + Default,

operator== / operator!= — set equality. Reference: DenseHash.h:538-555.

fn eq(&self, other: &DenseHashSet<K, H, E>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl VisitSeen for DenseHashSet<*mut c_void>

fn has_seen(&mut self, tv: *const c_void) -> bool

fn unsee(&mut self, tv: *const c_void)