The good old hashtable can do this and is by my knowledge the fastest in
key value pairs ( is verry low level data storage and retrieval , one level
lower and you are at array level )
If you need sorting , querying on value members in the way of structures
that are stored in the value meber then i would advise you to use a
DataTable
HTH
Michel
"cmay" <cm**@walshgroup.comschreef in bericht
news:11**********************@o5g2000hsb.googlegro ups.com...
>I have a situation where I need a collection, where I can find the
VALUE (e.g. customer name) by it's key (ID value), AND also find the
ID value by the customer name.
Is there anything that does this?