-
Notifications
You must be signed in to change notification settings - Fork 111
Expand file tree
/
Copy pathTable.java
More file actions
59 lines (49 loc) · 1.64 KB
/
Table.java
File metadata and controls
59 lines (49 loc) · 1.64 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
package Table;
import java.util.ArrayList;
/**
* This class needs to manage an ArrayList of Entry objects. It needs a get method that takes a key and returns
* its corresponding value, or null of the key is not in the arraylist. It needs a put method that takes a key and value
* and makes an entry with key, value. NOTE: There cannot be two entries with the same key.
* It also needs a remove method which takes a key and, if that key exists in the arraylist, removes that item.
* Void return on `remove`.
*/
public class Table<K, V> {
private ArrayList<Entry> entries;
public Table() {
this.entries = new ArrayList();
}
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 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.get(i).setValue(value);
}
}
} else {
entries.add(new Entry(key, value));
}
}
public void remove(K key) {
for (int i = 0; i < entries.size(); i++) {
if (entries.get(i).getKey().equals(key)){
entries.remove(i);
}
}
}
public boolean containsKey(K key) {
for (int i = 0; i < entries.size(); i++) {
if (entries.get(i).getKey().equals(key)) {
return true;
}
}
return false;
}
}