I'm trying to maintain a collection of collections.
The first collection will be a hash table.
Each of it's members will either be a linked list or an arraylist.
I was wondering how each compared in terms of memory consumption and performance in .Net. (Obviously I'd need to create my own linked list class)
Also is there any way to find out the amount of memory consumed by an object via debug?
