pub fn clear(&mut self) {
        let mut destroy_callback = |_| {};
        loop {
            let node = self.hash_table.pop_first_index();
            if node.is_null() {
                break;
            }
            self.recurse_destroy(node, &mut destroy_callback);
        }
        debug_assert_eq!(self.hash_table.size(), 0);
    }
/// Clears the map, removing all key-value pairs. Keeps the allocated memory
/// for reuse.
///
/// # Examples
///
/// ```
/// use hash_ord::hash_map::HashMap;
///
/// let mut a = HashMap::new();
/// a.insert(1, "a");
/// a.clear();
/// assert!(a.is_empty());
/// ```
Clears the map, removing all key-value pairs. Keeps the allocated memory
for reuse.
Clears the map removing all key - value pairs . Keeps the allocated memory for reuse .
pub fn clear(&mut self) {
        let mut destroy_callback = |_| {};
        loop {
            let node = self.hash_table.pop_first_index();
            if node.is_null() {
                break;
            }
            self.recurse_destroy(node, &mut destroy_callback);
        }
        debug_assert_eq!(self.hash_table.size(), 0);
    }
pub fn clear ( & mut self ) { let mut destroy_callback = | _ | { } ; loop { let node = self . hash_table . pop_first_index ( ) ; if node . is_null ( ) { break ; } self . recurse_destroy ( node , & mut destroy_callback ) ; } debug_assert_eq ! ( self hash_table size ( ) 0 ) ; }
Clears the map, removing all key-value pairs.
Clears the map removing all key - value pairs .
&mut self
examples
```
use hash_ord::hash_map::HashMap.


` ` ` use hash_ord :: hash_map :: HashMap .