-
Notifications
You must be signed in to change notification settings - Fork 111
Expand file tree
/
Copy pathTable.java
More file actions
50 lines (46 loc) · 1.48 KB
/
Table.java
File metadata and controls
50 lines (46 loc) · 1.48 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
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<K,V>> entries;
public Table() {
entries = new ArrayList<>();
}
public V get(K key){
Entry<K,V> current = findEntry(key);
if (current == null){
return null;
}
return current.getValue();
}
public void put(K key, V value){
Entry<K,V> current = findEntry(key);
if(current != null) {
this.remove(key);
}
entries.add(new Entry<>(key, value));
}
public boolean remove(K key){
Entry<K, V> currentEntry = findEntry(key);
if (currentEntry == null) {
return false;
}
int index = entries.indexOf(currentEntry);
entries.remove(index);
return true;
}
private Entry<K, V> findEntry(K key){
for (Entry<K,V> entry : entries){
if (entry.getKey().equals(key)){
return entry;
}
}
return null;
}
}