Hi,

I read somewhere that it would be better to use a HashTable or a SortedList
instead of a collection in VB.NET. Is this true and why is this better? Is
it faster or more performant or ...?

Any info would be nice!

Pieter

Hi,

The hashtable and sortedlist store data in a dictonary entry
(key, data) making it easier to look up values. The collection supports the
ilist interface allowing you to databind a collection.

Ken
---------------------------
"DraguVaso" <(E-Mail Removed)> wrote in message
news:(E-Mail Removed)...
Hi,

I read somewhere that it would be better to use a HashTable or a SortedList
instead of a collection in VB.NET. Is this true and why is this better? Is
it faster or more performant or ...?

Any info would be nice!

Pieter

Hm, but is there anyone of them (or maybe another) that has better
perfomance than the others?

"Ken Tucker [MVP]" <(E-Mail Removed)> wrote in message
news:(E-Mail Removed)...
> Hi,
>
> The hashtable and sortedlist store data in a dictonary entry
> (key, data) making it easier to look up values. The collection supports
the
> ilist interface allowing you to databind a collection.
>
> Ken
> ---------------------------
> "DraguVaso" <(E-Mail Removed)> wrote in message
> news:(E-Mail Removed)...
> Hi,
>
> I read somewhere that it would be better to use a HashTable or a
SortedList
> instead of a collection in VB.NET. Is this true and why is this better? Is
> it faster or more performant or ...?
>
> Any info would be nice!
>
> Pieter
>
>
>

"DraguVaso" <(E-Mail Removed)> wrote in message
news:%(E-Mail Removed)...
> Hm, but is there anyone of them (or maybe another) that has better
> perfomance than the others?

I use all three, and have never seen a measurable difference. It is all
fast as blazes.

Best Regards,

Andy