forked from bhagat-hrishi/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCompareMethodImplementation.java
More file actions
111 lines (92 loc) · 3.11 KB
/
CompareMethodImplementation.java
File metadata and controls
111 lines (92 loc) · 3.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
import java.util.Comparator;
import java.util.TreeSet;
class MyCompareDescending implements Comparator
{
public int compare (Object obj1,Object obj2)
{
Integer i1=(Integer)obj1;
Integer i2=(Integer)obj2;
if(i1<i2)
return 1;
else if(i1>i2)
return -1;
else
return 0;
}
}
class DescendingString implements Comparator
{
public int compare(Object obj1,Object obj2)
{
String s1=(String)obj1;
String s2=(String)obj2;
return - (s1.compareTo(s2));//by default compareTo do ascending order -ve to this give ans in descending order
}
}
class AscendingStringBuffer implements Comparator
{
public int compare(Object obj1,Object obj2)
{
//convert Stringbuffer Object to String and use String method
String s1=obj1.toString();
String s2=obj2.toString();
return s1.compareTo(s2);
}
}
class IncreasingLengthStringAndStringBuffer implements Comparator
{
//Sorting order is increasing lenght Order
//if length is same then alhpabetical order
public int compare(Object obj1,Object obj2)
{
String s1=obj1.toString();
String s2=obj2.toString();
int ln1=s1.length(),ln2=s2.length();
if(ln1<ln2)
return -1;
else if(ln1>ln2)
return +1;
//if here code execution come means length is same
//length is same now do alphabetical order
return s1.compareTo(s2);
}
}
public class CompareMethodImplementation {
public static void main(String[] args) {
TreeSet t=new TreeSet(new MyCompareDescending());
t.add(90);
t.add(-1);
t.add(0);
t.add(100);
t.add(50);
t.add(-2);
System.out.println("\nData in descending Order:");
System.out.println(t);
TreeSet s=new TreeSet(new DescendingString());
s.add("hrishi");
s.add("omkar");
s.add("abcedsd");
s.add("abzzzz");
s.add("zzzz");
System.out.println("\n________________");
System.out.println(s);
TreeSet sb=new TreeSet(new AscendingStringBuffer());
sb.add(new StringBuffer("M"));
sb.add(new StringBuffer("B"));
sb.add(new StringBuffer("D"));
sb.add(new StringBuffer("Z"));
System.out.println("\n\nAscending:\n"+sb);
//Adding String and StringBuffer Object and Sort by length
//if same lenght then alphabetical order
TreeSet StringStringBuffer =new TreeSet(new IncreasingLengthStringAndStringBuffer());
StringStringBuffer.add("A");
StringStringBuffer.add("A");
StringStringBuffer.add(new StringBuffer("AA"));
StringStringBuffer.add(new StringBuffer("AB"));
StringStringBuffer.add("X");
StringStringBuffer.add("xxxxxxx");
StringStringBuffer.add("ABCD");
StringStringBuffer.add("AACD");
System.out.println("\nString and StringBuffer: \n"+StringStringBuffer);
}
}