Traversing a Hash Table



Traversing a Hash Table - Untitled















Next: Deriving a New Hash Table Type,
Previous: Looking Up or Entering a String,
Up: Hash Tables



2.18.3 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.




Wyszukiwarka

Podobne podstrony:
Creating a Linker Hash Table
Deriving a New Hash Table Type
Adding Symbols to the Hash Table
Creating and Freeing a Hash Table
lanai dinning table
The Complete Pentium Instruction Set Table (32 Bit Addressing Mode Only)
hash multimap
insert table button
curio table
Hash (2Way)
tiled coffee table

więcej podobnych podstron