src/main/java/design/model/course_search/CourseList.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
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135

package design.model.course_search;

import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;

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);
    }

    public CourseList groupByCurrentSorter() 
    {
        CourseList groupedList = new CourseList();

        if (courses.isEmpty() || sorter == null) 
        {
            return this;
        }

        // Sort by current sorter
        sort();

        // Group consecutive equal elements
        List<ICourse> currentGroup = new ArrayList<>();
        ICourse prev = null;

        for (ICourse c : courses) {
            if (prev == null || !sorter.isEqual(prev, c)) {
                if (!currentGroup.isEmpty()) {
                    CourseList sublist = new CourseList();
                    sublist.setCourses(new ArrayList<>(currentGroup));
                    groupedList.add(sublist);
                    currentGroup.clear();
                }
            }
            currentGroup.add(c);
            prev = c;
        }

        if (!currentGroup.isEmpty()) {
            CourseList sublist = new CourseList();
            sublist.setCourses(currentGroup);
            groupedList.add(sublist);
        }

        return groupedList;
    }
    
    /*
     * 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; }

    @Override 
    public String toString()
    {
        // to do: implement returning courslist children
        return "wip";
    }
}