package genealogie.client;

import java.util.HashMap;
import java.util.Hashtable;
import java.util.Map;
import java.util.Map.Entry;

import genealogie.to.ActeDomiTO;
import genealogie.to.CleActeDomi;

public class TesteCleActeDomi {

	public static void main (String[] args) {
		CleActeDomi cle1 = new CleActeDomi(12793, 1);
		CleActeDomi cle2 = new CleActeDomi(12793, 2);
		CleActeDomi cle3 = new CleActeDomi(12793, 1);
		System.out.print("clequals cle1 = cle1 "+cle1.equals(cle1)+"\n");
		System.out.print("clequals cle1 = cle2 "+cle1.equals(cle2)+"\n");
		System.out.print("clecompare  cle1 = cle1 "+cle1.compareTo(cle1)+"\n");
		System.out.print("clecompare= cle1 = cle2 "+cle1.compareTo(cle2)+"\n");
		System.out.print("clecompare cle2 = cle1 "+cle2.compareTo(cle1)+"\n");
		System.out.print("clecompare cle1 = cle3 "+cle1.compareTo(cle3)+"\n");
		ActeDomiTO aTO1 = new ActeDomiTO();
		aTO1.setCleActeDomi(cle1);
		ActeDomiTO aTO2 = new ActeDomiTO();
		aTO2.setCleActeDomi(cle2);
		System.out.print("clehashcode cle1 "+ cle1.hashcode()+"\n");
		System.out.print("clehashcode cle3 "+cle3.hashcode()+"\n");
		System.out.print("cleequals cle1 = cle3 "+cle1.equals(cle3)+"\n");
		
		Hashtable<String, ActeDomiTO> table  =new Hashtable<String, ActeDomiTO>() ;
		table.put(cle1.toString(), aTO1);
		table.put(cle2.toString(),aTO2);
		System.out.print("clecontains cle1 "+table.containsKey(cle1.toString())+"\n");
		System.out.print("clecontains cle3 "+table.containsKey(cle3.toString())+"\n");
		Hashtable<CleActeDomi, ActeDomiTO> tablecle  =new Hashtable<CleActeDomi, ActeDomiTO>() ;
		tablecle.put(cle1, aTO1);
		tablecle.put(cle2,aTO2);
		System.out.print("clecontains cle1 "+ tablecle.containsKey(cle1)+"\n");
		System.out.print("clecontains cle3 "+ tablecle.containsKey(cle3)+"\n");
//		boolean b =tablecle.containsKey(cle3); 
//		ActeDomiTO atO3 = table.get(cle3);
//		table[0] = new ActeDomiTO();
//	    int hash = cle1.hashCode();
//        int index = (hash & 0x7FFFFFFF) % table.length;
//        for (int l =0;i<table.length; i++) {
//        for (Entry<?,?> e = table[index] ; e != null ; e = e.next) {
//            if ((table[index].hashCode() == hash) && table[l].equals(cle1)) {
//               CleActeDomi cl3 = table[l];
//               break;
//            }
//        }
//    
    
	}
}