Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add immutable map accessors to OccupiedEntry and VacantEntry #600

Closed
wants to merge 3 commits into from
Closed

Add immutable map accessors to OccupiedEntry and VacantEntry #600

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
dc60c71
Add immutable map accessors to OccupiedEntry and VacantEntry
apasel422 Dec 11, 2024
50da716
s/map/hash_map/
apasel422 Dec 11, 2024
a709ffa
Add hash_map for Entry, EntryRef, VacantEntryRef
apasel422 Dec 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
129 changes: 129 additions & 0 deletions src/map.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3714,6 +3714,33 @@ impl<'a, K, V, S, A: Allocator> Entry<'a, K, V, S, A> {
Entry::Vacant(_) => self,
}
}

/// Gets a reference to the map that owns this entry.
///
/// This can be used to perform additional lookups while deciding
/// how to process the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap<&str, u32> = HashMap::new();
///
/// fn some_expensive_operation(val: Option<&u32>) -> bool { true }
///
/// let e = map.entry("abc");
/// if some_expensive_operation(e.hash_map().get("def")) {
/// e.insert(5);
/// }
/// ```
pub fn hash_map(&self) -> &HashMap<K, V, S, A> {
match *self {
Entry::Occupied(ref entry) => entry.hash_map(),
Entry::Vacant(ref entry) => entry.hash_map(),
}
}
}

impl<'a, K, V: Default, S, A: Allocator> Entry<'a, K, V, S, A> {
Expand Down Expand Up @@ -4011,6 +4038,31 @@ impl<'a, K, V, S, A: Allocator> OccupiedEntry<'a, K, V, S, A> {
}
}
}

/// Gets a reference to the map that owns this entry.
///
/// This can be used to perform additional lookups while deciding
/// how to process the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap<&str, u32> = HashMap::new();
///
/// fn some_expensive_operation(val: Option<&u32>) -> bool { true }
///
/// if let Entry::Occupied(mut e) = map.entry("abc") {
/// if some_expensive_operation(e.hash_map().get("def")) {
/// e.insert(5);
/// }
/// }
/// ```
pub fn hash_map(&self) -> &HashMap<K, V, S, A> {
self.table
}
}

impl<'a, K, V, S, A: Allocator> VacantEntry<'a, K, V, S, A> {
Expand Down Expand Up @@ -4113,6 +4165,31 @@ impl<'a, K, V, S, A: Allocator> VacantEntry<'a, K, V, S, A> {
table: self.table,
}
}

/// Gets a reference to the map that owns this entry.
///
/// This can be used to perform additional lookups while deciding
/// how to process the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap<&str, u32> = HashMap::new();
///
/// fn some_expensive_operation(val: Option<&u32>) -> bool { true }
///
/// if let Entry::Vacant(e) = map.entry("abc") {
/// if some_expensive_operation(e.hash_map().get("def")) {
/// e.insert(5);
/// }
/// }
/// ```
pub fn hash_map(&self) -> &HashMap<K, V, S, A> {
self.table
}
}

impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator> EntryRef<'a, 'b, K, Q, V, S, A> {
Expand Down Expand Up @@ -4295,6 +4372,33 @@ impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator> EntryRef<'a, 'b, K, Q, V, S, A> {
EntryRef::Vacant(entry) => EntryRef::Vacant(entry),
}
}

/// Gets a reference to the map that owns this entry.
///
/// This can be used to perform additional lookups while deciding
/// how to process the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap<&str, u32> = HashMap::new();
///
/// fn some_expensive_operation(val: Option<&u32>) -> bool { true }
///
/// let e = map.entry_ref("abc");
/// if some_expensive_operation(e.hash_map().get("def")) {
/// e.insert(5);
/// }
/// ```
pub fn hash_map(&self) -> &HashMap<K, V, S, A> {
match *self {
EntryRef::Occupied(ref entry) => entry.hash_map(),
EntryRef::Vacant(ref entry) => entry.hash_map(),
}
}
}

impl<'a, 'b, K, Q: ?Sized, V: Default, S, A: Allocator> EntryRef<'a, 'b, K, Q, V, S, A> {
Expand Down Expand Up @@ -4413,6 +4517,31 @@ impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator> VacantEntryRef<'a, 'b, K, Q, V, S
table: self.table,
}
}

/// Gets a reference to the map that owns this entry.
///
/// This can be used to perform additional lookups while deciding
/// how to process the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap<&str, u32> = HashMap::new();
///
/// fn some_expensive_operation(val: Option<&u32>) -> bool { true }
///
/// if let EntryRef::Vacant(e) = map.entry_ref("abc") {
/// if some_expensive_operation(e.hash_map().get("def")) {
/// e.insert(5);
/// }
/// }
/// ```
pub fn hash_map(&self) -> &HashMap<K, V, S, A> {
self.table
}
}

impl<K, V, S, A> FromIterator<(K, V)> for HashMap<K, V, S, A>
Expand Down
Loading