src/main/java/design/model/course_search/SortByHoles.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

package design.model.course_search;

import java.util.Comparator;
import java.util.List;

/*
 * Concrete strategy by sorting courses by their hole count (9 or 18)
 * Willem Dalton
 */
public class SortByHoles implements CourseSorter {

    @Override
    public void sortCourses(List<ICourse> courses) {
        courses.sort(Comparator.comparing(ICourse::getHoleCount).reversed()); // highest par to lowest par
    }

    @Override
    public boolean isEqual(ICourse a, ICourse b) {
        return a.getHoleCount() == b.getHoleCount();
    }

    @Override
    public String toString() {
        return "Hole Count";
    }

}