TreeMap

[Lucky J Verma]

This code gives ArrayIndexBoundExcpetion ,but if in for loop ,i write d.length it works correctly.
I have no of 5,4 elements in key,value pair.
I really couldnt get why it is so .Should work same in both way.


import java.util.Map;
import java.util.TreeMap;
public class TreeMapDemo1 {
Map calendar=new TreeMap();
TreeMapDemo1(String d[],String e[])
{
for(int i=0;i<e.length;i++) //with d.length ,works
{
calendar.put(d[i],e[i]);
}
}
public static void main(String args[])
{
String dates[]={"22/10/1974","19/02/2005","22/1122005","29/11/2006"};
String events[]={"Birthday","Anniversary","Marriage","Thankgiving","Independ"};
TreeMapDemo1 tmd=new TreeMapDemo1(dates,events);
System.out.println(tmd.calendar);
}





}

[Lucky J Verma]

sorry ,i forgot to mention 1 thing .

key=value
if number of keys is more than values ,it gives exception.
But iread , TreeMap is supposed to accept nulls. keys/values can be Nulls & Keys =unique.

[Ernest Friedman-Hill]

If you index off the end of an array, you don't get null, you get an ArrayIndexOutOfBoundsException. If you use e.length as the loop limit, then the loop tries to read dates[4], which does not exist.

Now, if the definition of dates were

String dates[]={"22/10/1974","19/02/2005","22/1122005","29/11/2006", null};

then things would work fine.