Implement GetHashCode method and store it in a hashtable : Hashtable « Collections Data Structure « C# / C Sharp






Implement GetHashCode method and store it in a hashtable

Implement GetHashCode method and store it in a hashtable
  

using System;
using System.Collections;

public class GoodCompare {
  public static void Main() {
    Name president = new Name ("A", "B");
    Name first = new Name ("C", "D");
    
    Hashtable m = new Hashtable();
    m.Add(president, "first");
    Console.WriteLine(m.Contains(first));
    Console.WriteLine(m[first]); 
  }
}



public class Name {
  protected String first;
  protected char initial;
  protected String last;
          
  public Name(String f, String l) {
    first = f; 
    last = l; 
  }
  public Name(String f, char i, String l) : this(f,l) {
    initial = i;  
  } 
  public override String ToString() {
    if (initial == '\u0000')
       return first + " " + last;
    else  
       return first + " " + initial + " " + last;
  }
  public override bool Equals(Object o) {
    if (!(o is Name))
       return false;
    Name name = (Name)o;
    return first == name.first && initial == name.initial
             && last == name.last;
  }
  public override int GetHashCode() {
    return first.GetHashCode() + (int)initial 
                             + last.GetHashCode();
  }

}


           
         
    
  








Related examples in the same category

1.Compares the efficiency of the hash map implementation with the tree mapCompares the efficiency of the hash map implementation with the tree map
2.Add value to Hashtable and loop through the value key pairsAdd value to Hashtable and loop through the value key pairs
3.Enumerating a hash table collectionEnumerating a hash table collection
4.illustrates the use of a Hashtableillustrates the use of a Hashtable
5.illustrates the use of the Hashtable methodsillustrates the use of the Hashtable methods
6.Demonstrate HashtableDemonstrate Hashtable
7.Get IDictionaryEnumerator enumerator from Hashtable
8.Properties based on Hashtable
9.DictionaryEntry Structure Defines a dictionary key/value pair that can be set or retrieved.
10.Create Hashtable by copying the elements from the specified dictionary to the new Hashtable object.
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.