-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSET.java
More file actions
103 lines (83 loc) · 2.78 KB
/
Copy pathSET.java
File metadata and controls
103 lines (83 loc) · 2.78 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
/*
* Sample usage: java SET
*/
import java.util.Iterator;
import java.util.TreeSet;
public class SET<Key extends Comparable<Key>> implements Iterable<Key>{
private TreeSet<Key> set;
public SET(){
set = new TreeSet<Key>();
}
public SET(SET<Key> x) {
set = new TreeSet<Key>(x.set);
}
public void add(Key key){
set.add(key);
}
public void delete(Key key){
set.remove(key);
}
public boolean contains(Key key){
return set.contains(key);
}
public int size(){
return set.size();
}
public boolean isEmpty(){
return size()==0;
}
public Key ceiling(Key key) {
Key k = set.ceiling(key);
return k;
}
public Key floor(Key key) {
Key k = set.floor(key);
return k;
}
public Iterator<Key> iterator(){
return set.iterator();
}
public static void main(String[] args) {
SET<String> set = new SET<String>();
StdOut.println("set = " + set);
// insert some keys
set.add("www.cs.princeton.edu");
set.add("www.cs.princeton.edu"); // overwrite old value
set.add("www.princeton.edu");
set.add("www.math.princeton.edu");
set.add("www.yale.edu");
set.add("www.amazon.com");
set.add("www.simpsons.com");
set.add("www.stanford.edu");
set.add("www.google.com");
set.add("www.ibm.com");
set.add("www.apple.com");
set.add("www.slashdot.com");
set.add("www.whitehouse.gov");
set.add("www.espn.com");
set.add("www.snopes.com");
set.add("www.movies.com");
set.add("www.cnn.com");
set.add("www.iitb.ac.in");
StdOut.println(set.contains("www.cs.princeton.edu"));
StdOut.println(!set.contains("www.harvardsucks.com"));
StdOut.println(set.contains("www.simpsons.com"));
StdOut.println();
StdOut.println("ceiling(www.simpsonr.com) = " + set.ceiling("www.simpsonr.com"));
StdOut.println("ceiling(www.simpsons.com) = " + set.ceiling("www.simpsons.com"));
StdOut.println("ceiling(www.simpsont.com) = " + set.ceiling("www.simpsont.com"));
StdOut.println("floor(www.simpsonr.com) = " + set.floor("www.simpsonr.com"));
StdOut.println("floor(www.simpsons.com) = " + set.floor("www.simpsons.com"));
StdOut.println("floor(www.simpsont.com) = " + set.floor("www.simpsont.com"));
StdOut.println();
StdOut.println("set = " + set);
StdOut.println();
// print out all keys in this set in lexicographic order
for (String s : set) {
StdOut.println(s);
}
StdOut.println();
SET<String> set2 = new SET<String>(set);
StdOut.println(set.equals(set2));
}
}