StringDictionary Class implements a hash table with the key and the value strongly typed to be strings rather than objects.
using System; using System.Collections; using System.Collections.Specialized; public class SamplesStringDictionary { public static void Main() { StringDictionary myCol = new StringDictionary(); myCol.Add("A", "a"); myCol.Add("B", "b"); myCol.Add("C", "c"); DictionaryEntry[] myArr = new DictionaryEntry[myCol.Count]; myCol.CopyTo(myArr, 0); for (int i = 0; i < myArr.Length; i++) Console.WriteLine(" {0,-10} {1}", myArr[i].Key, myArr[i].Value); if (myCol.ContainsValue("a")) Console.WriteLine("The collection contains the value \"amarillo\"."); else Console.WriteLine("The collection does not contain the value \"amarillo\"."); if (myCol.ContainsKey("A")) myCol.Remove("A"); myCol.Clear(); } }
1. | Remove Key | ||
2. | Contains value | ||
3. | Contains key | ||
4. | Loop through StringDictionary with IEnumerator and get DictionaryEntry | ||
5. | Copy key out | ||
6. | Gets a collection of values in the StringDictionary. |