Hash Table

[Mason]

Hello,

I need to create a Hash Table for a particular Hash Function in my program. I need to be able to place multiple integers in the same bucket, which will obviously cause collision issues. 

What is the fastest way to go about this? Should I use a dynamic array, associative array, linked list, etc?

I'm going to be using the Tango Library, and have though about using the HashMap, but it seems like overkill for what I want to do? I'm willing to trade memory for speed (quick lookups and iterating through the buckets). 

Any ideas? If you need more info I can always present the particular application I'm trying to create.....

Thanks,
Mason