Hi friend,
import java.io.*;
import java.util.*;
public class CollectionMap{
public static void main(String args[]) throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Please enter the name: ");
String str = in.readLine();
Map m = new HashMap();
Integer integer = new Integer(1);
for (int i=0, n=args.length; i<n; i++){
String key = args[i];
Integer iner = (Integer)m.get(key);
if (iner == null){
iner = integer;
} else {
int value = iner.intValue();
iner = new Integer(value + 1);
}
m.put(key, iner);
}
System.out.println(m);
Map sortedMap = new TreeMap(m);
System.out.println(sortedMap);
System.out.println("welcome to roseindia");
}
}
-------------------------------------------
import java.util.*;
import java.util.concurrent.*;
public class NavigableMAPExam{
public static void main(String args[]){
System.out.println("Navigable Map Example!\n");
NavigableMap <Integer, String>navi = new ConcurrentSkipListMap<Integer, String>();
navi.put(1, "Sanday");
navi.put(2, "Manday");
navi.put(3, "Tuesday");
navi.put(4, "Wednesday");
navi.put(5, "Thuresday");
navi.put(6, "Friday");
navi.put(7, "Sanday");
System.out.println("Data in the navigable map: " + navi.descendingMap()+"\n");
System.out.print("First data: " + navi.firstEntry()+"\n");
System.out.print("Last data: " + navi.lastEntry()+"\n\n");
System.out.print("Nearest less than or equal to the given key: " + navi.floorEntry(5)+"\n");
System.out.println("Retrieving the greatest key strictly less than the given key: " + navi.lowerEntry(3));
System.out.println("Retriving data from navigable map greter than the given key: " + navi.higherEntry(5)+"\n");
System.out.println("Removing First: " + navi.pollFirstEntry());
System.out.println("Removing Last: " + navi.pollLastEntry()+"\n");
System.out.println("Now data: " + navi.descendingMap());
}
}
-----------------------------------------------
Read for more information.
http://www.roseindia.net/java/Thanks.