There's also the List/Dictionary hybrid that you can use. You can find it
at:
System.Collections.ObjectModel.KeyedCollection
You can access members either through a Key or an index. You must inherit
this class, however and provide your own implementation.
I do agree with the others, that the simpler the better. The List<T> class
is fast and should suffice for most of your needs.
On 7/3/07, Frans Bouma <[EMAIL PROTECTED]> wrote:
> I am looking for just a bucket to store objects in.
Then a list<T> is what you need :)
FB
>
> -----Original Message-----
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Frans
> Bouma
> Sent: Tuesday, July 03, 2007 11:39 AM
> To: 'Discussion of advanced .NET topics.'
> Subject: RE: [ADVANCED-DOTNET] List<T> vs HashTable
>
> > I am trying to determine if I should use a generic List<T> or a
> > HashTable to hold some data objects. The main thing is that I want to
>
> > know if there is general knowledge that one just performs better than
> > the other. Any feedback would be greatly appreciated.
>
> These aren't really comparable. A hashtable is a key-value
> store, a list a set of values which can contain duplicates.
>
> Are you looking for a set of unique objects or just a bucket to
> store objects in?
>
> FB
>
> ===================================
> This list is hosted by DevelopMentor(r) http://www.develop.com
>
> View archives and manage your subscription(s) at
> http://discuss.develop.com
>
> ===================================
> This list is hosted by DevelopMentor. http://www.develop.com
>
> View archives and manage your subscription(s) at
http://discuss.develop.com
===================================
This list is hosted by DevelopMentor(r) http://www.develop.com
View archives and manage your subscription(s) at
http://discuss.develop.com
===================================
This list is hosted by DevelopMentor® http://www.develop.com
View archives and manage your subscription(s) at http://discuss.develop.com
