If the question is, is the UltraListView.Items collection implemented with a Hashtable, the answer is no.

Thanks for your reply.

I actually want to know if it is implemented using Hashing algorithm. It means whenever a key value is mentioned it is hashed and stored so that whenever you search for an item using Key it uses the previous hash value to locate the item faster. This is very critical for my project as my list view can have huge number of items.

It would be sad if it is not hashed as the term key gives a kind of intuition that it is hashed.

Awaiting your reply.

Thanks in Advance,

Manikandan.

It uses the same linear search that the standard .NET keyed collections use. If you are doing a lot of searching, you could use a Dictionary<string, UltraListViewItem> with the item keys as the key and a reference to the item as a value.

Oh i seee

I will submit a feature request. But Brian what algorithm is currently implemented for searching an UltraListViewItem using key?. I have lots of items in my list view and i am using key for each of them. So i would like to know what algortihm is in the background for search using key.

Thanks in Advance,

Manikandan