Hash tables / hash maps

Hi I am having trouble wrapping my head around on how to empty my buckets.

Code:

struct hashLink {
	KeyT key; /*the key is what you use to look up a hashLink*/
	ValueT value; /*the value stored with the hashLink, an int*/
	struct hashLink * next; /* linked list nodes*/
};
typedef struct hashLink hashLink;

struct hashMap {
    hashLink ** table; /*array of pointers to hashLinks*/
    int tableSize; /* number of buckets in table*/
    int count; /*number of hashLinks in table*/
};


/* Other functions to insert, remove, the initialize the hash, etc. */

int cleanBuckets(struct hashMap *hasht) {
    
     /* what I'm trying to do here is return the amount of empty or clean buckets in the table, where the buckets have no links */
}

Thanks in advance.

Originally Posted by dlwlsdn

Hi I am having trouble wrapping my head around on how to empty my buckets.

What's wrong with just iterating thru the array? What are the buckets -- linked lists?

Nevermind, I got it

Thanks for responding though. Seems like coffee can do the trick sometimes lol.

I'm not surprised that you found the answer - most folk do:

1) Grasp the top rim of the bucket, with one hand.

2) With the other hand supporting the bottom rim, lift and invert the bucket.

Brilliant advice, given away for free - what a forum!