-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEfficientRater.java
55 lines (44 loc) · 1.19 KB
/
EfficientRater.java
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
/**
* Write a description of class EfficientRater here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.HashMap;
import java.util.ArrayList;
public class EfficientRater implements Rater
{
private String myID;
private HashMap<String,Rating> myRatings;
public EfficientRater(String id) {
myID = id;
myRatings = new HashMap<String,Rating>();
}
public void addRating(String item, double rating) {
myRatings.put(item, new Rating(item, rating));
}
public boolean hasRating(String item) {
return myRatings.containsKey(item);
}
public String getID() {
return myID;
}
public double getRating(String item) {
if (myRatings.containsKey(item)) {
return myRatings.get(item).getValue();
}
else {
return -1;
}
}
public int numRatings() {
return myRatings.size();
}
public ArrayList<String> getItemsRated() {
ArrayList<String> list = new ArrayList<String>();
for(String key : myRatings.keySet()){
list.add(myRatings.get(key).getItem());
}
return list;
}
}