-
Notifications
You must be signed in to change notification settings - Fork 111
Expand file tree
/
Copy pathTable.java
More file actions
68 lines (53 loc) · 1.67 KB
/
Table.java
File metadata and controls
68 lines (53 loc) · 1.67 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
package Table;
import java.lang.annotation.ElementType;
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() {
entries= new ArrayList<>();
}
// public V get(K key){
//
// for (Entry element: entries){
// if (element.getKey().equals(key)){
// return (V) element.getValue();
// }
// }
//
// return null;
//
// }
public V get(K key){
V ourLocalVariable = null;
for (Entry element: entries){
if (element.getKey().equals(key)){
ourLocalVariable =(V) element.getValue();
}
}
return ourLocalVariable;
}
public void put(K foo, V i){
Entry ourEntry = new Entry(foo, i);
for (Entry element: entries){
if (element.getKey().equals(ourEntry.getKey())){
entries.set(entries.indexOf(element),ourEntry);
}
}
entries.add(ourEntry);
}
public void remove(K foo){
for (Entry element: entries){
if (element.getKey().equals(foo)){
entries.remove(element);
break;
}
}
}
}