As part of my C course I'm trying to teach myself pointers in depth. I've looked up some abstract data types to implement with structures.
I came across this implementation of a hash table, with seperate chaining as a collision mechanism. I'm confused with the some of the ways data is accessed using pointers. I've also left out the hash function.
Just to clarify:
-Is list_t **table a pointer to a pointer to a linked list structure?
-Looking at the line below, is an array of **table pointers being made, each of which point to a pointer to a linked list?
Code:for(i=0; i<size; i++) new_table->table[i]
-When a lookup hash is performed in lookup, does the line below pull out a pointer to a linked list contained within the table array?
Code:list = hashtable->table[hashval]
Subsequently, does this line deference the pointer above and access the element within the linked list?
Code:list = list->next