-
Notifications
You must be signed in to change notification settings - Fork 111
Expand file tree
/
Copy pathTableNested.java
More file actions
80 lines (64 loc) · 1.82 KB
/
TableNested.java
File metadata and controls
80 lines (64 loc) · 1.82 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
package TableNested;
import Table.Entry;
import java.util.ArrayList;
/**
* All you need to do for this microlab is take the Table and Entry from the last one and make Entry a nested class.
* Think about how nested classes should work with generics.
*/
public class TableNested<K, V> {
private ArrayList<Entry> entries;
public TableNested() {
entries = new ArrayList<Entry>();
}
public V get(K key) {
for (int i = 0; i < entries.size(); i++) {
if (entries.get(i).getKey().equals(key)) {
return (V) entries.get(i).getValue();
}
}
return null;
}
public boolean containsKey(K key) {
for (int i = 0; i < entries.size(); i++) {
if (entries.get(i).getKey().equals(key)) {
return true;
}
}
return false;
}
public void put(K key, V value) {
if (containsKey(key)) {
for (int i = 0; i < entries.size(); i++) {
if (entries.get(i).getKey().equals(key)) {
entries.remove(i);
entries.add(i, new Entry(key, value));
}
}
} else {
entries.add(new Entry(key, value));
}
}
public void remove(K key) {
if (containsKey(key)) {
for (int i = 0; i < entries.size(); i++) {
if (entries.get(i).getKey().equals(key)) {
entries.remove(i);
}
}
}
}
class Entry<K, V> {
private K key;
private V value;
public Entry(K key, V value) {
this.key = key;
this.value = value;
}
public K getKey() {
return key;
}
public V getValue() {
return value;
}
}
}