Create Hashtable by copying the elements from the specified dictionary to the new Hashtable object.

 

using System;
using System.Collections;
using System.Globalization;

class myCultureComparer : IEqualityComparer
{
    public CaseInsensitiveComparer myComparer;

    public myCultureComparer()
    {
        myComparer = CaseInsensitiveComparer.DefaultInvariant;
    }

    public myCultureComparer(CultureInfo myCulture)
    {
        myComparer = new CaseInsensitiveComparer(myCulture);
    }

    public new bool Equals(object x, object y)
    {
        if (myComparer.Compare(x, y) == 0)
        {
            return true;
        }
        else
        {
            return false;
        }
    }

    public int GetHashCode(object obj)
    {
        return obj.ToString().ToLower().GetHashCode();
    }
}

public class SamplesHashtable
{
    public static void Main()
    {
        SortedList mySL = new SortedList();
        mySL.Add("A", "a");
        mySL.Add("B", "b");
        mySL.Add("C", "c");

        Hashtable myHT1 = new Hashtable(mySL);

        Hashtable myHT2 = new Hashtable(mySL, new myCultureComparer());

        CultureInfo myCul = new CultureInfo("tr-TR");
        Hashtable myHT3 = new Hashtable(mySL, new myCultureComparer(myCul));

        Console.WriteLine("first is in myHT1: {0}", myHT1.ContainsKey("first"));
        Console.WriteLine("first is in myHT2: {0}", myHT2.ContainsKey("first"));
        Console.WriteLine("first is in myHT3: {0}", myHT3.ContainsKey("first"));

    }

}

Related examples in the same category

1.	Compares the efficiency of the hash map implementation with the tree map
2.	Implement GetHashCode method and store it in a hashtable
3.	Add value to Hashtable and loop through the value key pairs
4.	Enumerating a hash table collection
5.	illustrates the use of a Hashtable
6.	illustrates the use of the Hashtable methods
7.	Demonstrate Hashtable
8.	Get IDictionaryEnumerator enumerator from Hashtable
9.	Properties based on Hashtable
10.	DictionaryEntry Structure Defines a dictionary key/value pair that can be set or retrieved.
11.	Hashtable.Clear Method removes all elements from the Hashtable.
12.	Hashtable.Contains Method determines whether the Hashtable contains a specific key.
13.	Hashtable.CopyTo Method copies the Hashtable elements to a one-dimensional Array instance at the specified index.
14.	Hashtable.GetEnumerator Method returns an IDictionaryEnumerator that iterates through the Hashtable.
15.	Hashtable.IsSynchronized Property gets a value indicating whether access to the Hashtable is synchronized (thread safe).
16.	Hashtable.Remove Method removes the element with the specified key from the Hashtable.
17.	IComparer Interface exposes a method that compares two objects.

Create Hashtable by copying the elements from the specified dictionary to the new Hashtable object. : Hashtable « Collections Data Structure « C# / C Sharp

Related examples in the same category