blob: 82648c2161913a87ac19ba053957767be44d3d90 (
plain) (
blame)
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
81
82
83
84
85
86
87
88
89
|
package design.model.course_search;
import java.util.ArrayList;
import java.util.List;
import design.model.*;
/*
* Defines a list of courses that can be sorted, added to or removed from.
* Willem Dalton
*/
public class CourseList implements ICourse {
private CourseSorter sorter;
private List<ICourse> courses;
public CourseList()
{
courses = new ArrayList<>();
}
/*
* Grab the list of courses
*/
public List<ICourse> getCourses()
{
return courses;
}
/*
* Set the list of courses equal to an existing list
*/
public void setCourses(List<ICourse> courses)
{
this.courses = courses;
}
/*
* set the chosen sorting algorithm for the given list.
*/
public void setSorter(CourseSorter courseSorter)
{
sorter = courseSorter;
}
/*
* Add a new course to the list.
*/
public void add(ICourse course)
{
courses.add(course);
}
/*
* Remove a course from the list.
*/
public void remove(ICourse course)
{
courses.remove(course);
}
/*
* Sort the list.
*/
public void sort()
{
sorter.sortCourses(courses);
}
/*
* All overrides of the ICourse class. This is a drawback of the composite pattern, but it's pretty negligible here. return some dummy values.
*/
@Override
public String getName() { return "Course List"; }
@Override
public float getDifficultyRating() { return 0; }
@Override
public String getLocation() { return ""; }
@Override
public int getTotalPar() { return 0; }
@Override
public int getHoleCount() { return 0; }
@Override
public List<Hole> getHoles() { return null; }
}
|