SortedSet/TreeMap ...

Question

am writing code for Displaying data in ascending order using a TreeMap(). And am in a fix to
resolve it. The scenario is like this i am calling java classes in my application from another
application whic is fetching data for me from their database where i can't intervene. From
thisapplication I am calling a class color.java in which objects are defined as string . And I need
to get the data and display the same using my servlet in its ascending order based on its color
number.Like this
ColorNumber Location Qty Price
100 C422 100 20
150 A1100 0575 15
200 D3760 130 500
Also While making call to color.java i get data of following types
colorlocation - Varchar
colornumber - number.
colorqty - number
colorPrice. - number
The piece of java code in my file details.java is like this
Color[] Range= colorenquiry.getColordata();
SortedSet ColorMap = new TreeMap();
for (int i=0; i<Range.length(); i++){
ColorMap.put(Range.colornumber, Range[i].colorlocation.toString()+""+
Range[i].colorqty.toString()+""+Range[i].colorprice.toString());
System.out.println(ColorMap.keySet());
System.out.println(ColorMap.values());
System.out.println(ColorMap.entrySet());
Now the Problem is for few querries iam getting the sorted output as above but for queries where
data is like 50- 60 rows am finding sorted data in patches like its 100,150, 200, 300, 500, 350,
600 700 425, 800, 900, 1000, 1100, 1200, 1500,250....
Please advise or have any such working examples where i can refer.
Thanks & Regards,
I tried with a Comparator to avoid natural order of sorting pls see the code below but still geting
a Clascast exception. Is there any problem with this code too?
Overall if there is any other approach to resolve sorting of rows in ascening order. Please
suggest or any other working code which i can look into.
int[] s1;
bolean[] s2;
public void CompareAscOrder(int[] s1, boolean[] s2){
if (s1.length != s2.length){
throw new IllegalArgumentException("Wrong length...");
this.s1=s1;
this.s2=s2;
final Comparator C2 = new Comparator() {
public int compare(Object o1, Object o2) {
Object rowa[] = (Object[]) a;
Object rowb[] = (Object[]) b;
for(int i=0; i<s1.length; i++)
int col = s1[i];
int result=((Comparable)rowa[col].compareTo(rowb[col]);
if (result !=0){
if(s2[i]) return result;
else return -result;
return 0;

Answer 1

Well, the code you post still doesn't compile and still isn't in [code ][code ] brackets, but the following does compile and does do something sensible -- specifically, the comparator will sort MyColor object according to the field called "num" (and sort them numerically, so "100" comes after "99"). Whether that's what you want it to do, I don't know. Some hints:
(a) watch your capitalization - use initial caps for classnames only
(b) there's already a class called "Color" in java.awt -- rename your Color if you can.
(c) to re-emphasize something I said earlier, a SortedMap sorts on its keys, so the comparatory is always passed two keys (which in your original example were strings, not colors).import java.util.Comparator;
class MyColor {
    String num;
    String loc;
    String qty;
    String price;
    final static Comparator c1 = new Comparator(){
            public int compare(Object a, Object b){
                MyColor col1 =(MyColor) a;
                MyColor col2 =(MyColor) b;
                int d1 = Integer.parseInt(col1.num);
                int d2 = Integer.parseInt(col2.num);
                return  d1 - d2;
}