-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathApp.java
More file actions
95 lines (75 loc) · 2.27 KB
/
App.java
File metadata and controls
95 lines (75 loc) · 2.27 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
package section14;
import java.util.Comparator;
import java.util.LinkedHashSet;
import java.util.Set;
import java.util.TreeSet;
public class App {
class Data<K, V> {
private K key;
private V value;
Data(K key, V value) {
this.key = key;
this.value = value;
}
public K getKey() {
return key;
}
public V getValue() {
return value;
}
@Override
public String toString() {
return "Data [key=" + key + ", value=" + value + "]";
}
}
public static void main(String[] args) {
// using inner class concept
Comparator<Data<Integer, String>> COMPARE_KEY = new Comparator<Data<Integer, String>>() {
@Override
public int compare(Data<Integer, String> obj1, Data<Integer, String> obj2) {
if (obj1.getKey() < obj2.getKey())
return -1;
else if (obj1.getKey() > obj2.getKey())
return 1;
else
return 0;
}
};
Comparator<Data<Integer, String>> COMPARE_NAME_LENGTH = new Comparator<Data<Integer, String>>() {
@Override
public int compare(Data<Integer, String> n1, Data<Integer, String> n2) {
if (n1.getValue().length() < n2.getValue().length())
return -1;
else if (n1.getValue().length() > n2.getValue().length())
return 1;
else
return 0;
}
};
// Set<Data> set = new LinkedHashSet<>();
// Set<Data> set = new TreeSet<>();
// Set<Data<Integer, String>> set = new TreeSet<>(COMPARE_KEY);
//
// set.add(new App().new Data<Integer, String>(1, "One"));
// set.add(new App().new Data<Integer, String>(2, "Two"));
// set.add(new App().new Data<Integer, String>(4, "Four"));
// set.add(new App().new Data<Integer, String>(3, "Three"));
// set.add(new App().new Data<Integer, String>(4, "Four"));
//
// for (Data<Integer, String> items : set) {
// System.out.println(items);
// }
//
// System.out.println("\n----------------\n");
Set<Data<Integer, String>> set2 = new TreeSet<>(COMPARE_NAME_LENGTH);
set2.add(new App().new Data<Integer, String>(1, "Chaand"));
set2.add(new App().new Data<Integer, String>(59, "Ed"));
set2.add(new App().new Data<Integer, String>(9, "John"));
set2.add(new App().new Data<Integer, String>(2, "Arnold J"));
set2.add(new App().new Data<Integer, String>(50, "Mia"
+ ""));
for (Data<Integer, String> data : set2) {
System.out.println(data);
}
}
}