-
Notifications
You must be signed in to change notification settings - Fork 0
/
Collections11.java
50 lines (42 loc) · 946 Bytes
/
Collections11.java
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
import java.util.*;
public class Sample
{
public static void main(String[] args)
{
TreeSet<Sample1> customers = new TreeSet<Sample1>();
customers.add(new Sample1("Rajeev"));
customers.add(new Sample1("Sachin"));
customers.add(new Sample1("Chris"));
/*
HashSet will use the `equals()` & `hashCode()` implementations
of the Customer class to check for duplicates and ignore them
*/
customers.add(new Sample1("Rajeev1"));
System.out.println(customers);
}
}
public class Sample1 implements Comparable<Sample1>
{
String name;
Sample1(String name)
{
this.name=name;
}
public String getName()
{
return name;
}
public void setName(String name)
{
this.name=name;
}
@Override
public String toString()
{
return name;
}
public int compareTo(Sample1 b)
{
return this.getName().compareTo(b.getName());
}
}