Difference between revisions of "Comparator Assignment"
Jump to navigation
Jump to search
m (→closestTo) |
m (→closestTo) |
||
Line 19: | Line 19: | ||
===closestTo=== | ===closestTo=== | ||
− | {{Warning | | + | {{Warning | THIS SHOULD BE A ONE LINE SOLUTION! You should be calling CompareUtils.min()}} |
<nowiki>public static Optional<Integer> closestTo(Integer[] values, int target)</nowiki> | <nowiki>public static Optional<Integer> closestTo(Integer[] values, int target)</nowiki> |
Revision as of 19:53, 7 February 2023
Contents
Group Assignment
This is a group assignment.
Background
Code To Implement
CompareUtils
class: | CompareUtils.java | |
methods: | min | |
package: | compare.group | |
source folder: | student/src/main/java |
min
public static <E> Optional<E> min(E[] array, Comparator<E> comparator)
CompareApps
class: | CompareApps.java | |
methods: | closestTo youngest mostPoints |
|
package: | compare.group | |
source folder: | student/src/main/java |
closestTo
Warning: THIS SHOULD BE A ONE LINE SOLUTION! You should be calling CompareUtils.min() |
public static Optional<Integer> closestTo(Integer[] values, int target)
Return a call to CompareUtils.min() which contains an index within an Optional. Use a lambda to define a comparator as the second parameter to min(). What computation should this comparator return?
youngest
public static Optional<HockeyPlayer> youngest(HockeyPlayer[] players)
mostPoints
public static Optional<HockeyPlayer> mostPoints(HockeyPlayer[] players)
Testing Your Solution
class: | _MinCompareTestSuite.java | |
package: | compare.group | |
source folder: | testing/src/test/java |