Lines Matching refs:table
3 /*--- A hash table implementation. pub_tool_hashtable.h ---*/
36 /* Generic type for a separately-chained hash table. Via a kind of dodgy
54 /* Make a new table. Allocates the memory with VG_(calloc)(), so can
55 be freed with VG_(free)(). The table starts small but will
60 /* Count the number of nodes in a table. */
61 extern Int VG_(HT_count_nodes) ( VgHashTable table );
63 /* Add a node to the table. Duplicate keys are permitted. */
66 /* Looks up a VgHashNode in the table. Returns NULL if not found. If entries
69 extern void* VG_(HT_lookup) ( VgHashTable table, UWord key );
71 /* Removes a VgHashNode from the table. Returns NULL if not found. */
72 extern void* VG_(HT_remove) ( VgHashTable table, UWord key );
79 /* Reset the table's iterator to point to the first element. */
80 extern void VG_(HT_ResetIter) ( VgHashTable table );
85 table has been modified (HT_add_node, HT_remove) since
87 modifying the table whilst iterating over it (and is necessary to
89 the table will not get resized whilst iteration is happening.
93 extern void* VG_(HT_Next) ( VgHashTable table );
95 /* Destroy a table and deallocates the memory used by the nodes using
