dist/gcc/hash-table.h

56          individual elements of the table need to be disposed of (e.g.,
57          when deleting a hash table, removing elements from the table, etc).
60 	 function is provided only for garbage-collected elements that
78          allocates the data elements in the table.
81          deallocates the data elements in the table.
114          uses 'keep_cache_entry' (described above) to keep elements that
134    If your elements are pointers, it is usually easiest to start with one
185    There are four descriptors for pointer elements, one for each of
193    These descriptors hash and compare elements by their pointer value,
361    The table stores elements of type Descriptor::value_type and uses
363    to hash, compare and remove elements.
405   /* Return the current number of elements in this hash table. */
406   size_t elements () const { return m_n_elements - m_n_deleted; }
408   /* Return the current number of elements in this hash table. */
412   void empty () { if (elements ()) empty_slow (); }
414   /* Return true when there are no elements in this hash table.  */
415   bool is_empty () const { return elements () == 0; }
559   /* Current number of elements including also deleted elements.  */
562   /* Current number of deleted elements in the table.  */
697 /* This function returns an array of empty hash table elements.  */
725     - Does not change the count of elements/searches/collisions in the
759 /* Return true if the current table is excessively big for ELTS elements.  */
770    entries and repeatedly inserts the table elements.  The occupancy
785   size_t elts = elements ();
787   /* Resize only when table after removal of unused elements is either
1018 /* Verify that all existing elements in th hash table which are
1099   if (too_empty_p (elements ()) && (!Lazy || m_entries))
1135 /* Iterate through the elements of hash_table HTAB,