Method remove

crates/table/src/pointer_map.rs:285–318

Removes the association `hash -> ptr`. Returns whether the association was deleted.

(&mut self, hash: RowHash, ptr: RowPointer)

    ///
    /// Returns whether the association was deleted.
    pub fn remove(&mut self, hash: RowHash, ptr: RowPointer) -> bool {
        'fun: {
            let Entry::Occupied(mut entry) = self.map.entry(hash) else {
                break 'fun false;
            };

            match entry.get().unpack() {
                // Remove entry on `hash -> [ptr]`.
                MapSlotRef::Pointer(o) if *o == ptr => drop(entry.remove()),
                MapSlotRef::Pointer(_) => break 'fun false,
                MapSlotRef::Collider(ci) => {
                    // Find `ptr` in slot and remove.
                    let slot = &mut self.colliders[ci.idx()];
                    let Some(idx) = slot.iter().position(|o| *o == ptr) else {
                        break 'fun false;
                    };
                    slot.swap_remove(idx);

                    match slot.len() {
                        // SAFETY: This never happens per `self.maintains_collider_invariant()`.
                        0 => unsafe { hint::unreachable_unchecked() },
                        // Simplify; don't use collider list since `hash -> [a_ptr]`.
                        1 => *entry.get_mut() = PtrOrCollider::ptr(slot.pop().unwrap()),
                        _ => break 'fun true,
                    }

                    // Slot is now empty; reuse later.
                    self.emptied_collider_slots.push(ci);
                }
            }

            true
        }
    }

    /// Returns an iterator over all row hash x row pointer pairs.
    pub fn iter(&self) -> impl '_ + Iterator<Item = (RowHash, RowPointer)> {