bfd.info: Traversing a Hash Table
Go forward to Deriving a New Hash Table Type
Go backward to Looking Up or Entering a String
Go up to Hash Tables
Go to the top op bfd
Traversing a hash table
The function `bfd_hash_traverse' may be used to traverse a hash
table, calling a function on each element. The traversal is done in a
random order.
`bfd_hash_traverse' takes as arguments a function and a generic
`void *' pointer. The function is called with a hash table entry (a
`struct bfd_hash_entry *') and the generic pointer passed to
`bfd_hash_traverse'. The function must return a `boolean' value, which
indicates whether to continue traversing the hash table. If the
function returns `false', `bfd_hash_traverse' will stop the traversal
and return immediately.
Created Wed Sep 1 16:41:34 2004 on bee with info_to_html version 0.9.6.