Implements IDictionary using a singly linked list.
Recommended for collections that typically contain 10 items or less.
It is smaller and faster than a Hashtable
This should not be used if performance is important for large numbers of elements.
Members, such as Item, Add, Remove, and Contains are O(n) operations, where n is Count.
Syntax:
Recommended for collections that typically contain 10 items or less.
It is smaller and faster than a Hashtable
This should not be used if performance is important for large numbers of elements.
Members, such as Item, Add, Remove, and Contains are O(n) operations, where n is Count.
Syntax:
For Each direntry As DictionaryEntry In myListDictionary
...
Next direntry
...
Next direntry
No comments:
Post a Comment