Higher Order Functions Hall of Fame Assignment
Revision as of 03:24, 12 October 2023 by Dennis.cosgrove (talk | contribs) (→Higher-order Functions)
Contents
Code To Implement
Higher-order Functions
class: | Hof.java | ![]() |
methods: | filter foldLeft foldRight map find |
|
package: | hof.util.exercise | |
source folder: | src/main/java |
filter ![Laurel Wreath](https://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Laurel_Wreath.jpg/50px-Laurel_Wreath.jpg)
public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)
foldLeft ![Laurel Wreath](https://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Laurel_Wreath.jpg/50px-Laurel_Wreath.jpg)
foldLeft(f, initial_value, [x1, x2, ..., xn])
- returns
f(xn,...,f(x2, f(x1, initial_value))...)
orinitial_value
if the list is empty.
public static <E, R> R foldLeft(BiFunction<E, R, R> f, R acc, ImList<E> list)
foldRight ![Laurel Wreath](https://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Laurel_Wreath.jpg/50px-Laurel_Wreath.jpg)
foldRight(f, initial_value, [x1, x2, ..., xn])
- returns
f(x1, f(x2, ..., f(xn, init)...))
orinitial_value
if the list is empty.
public static <E, R> R foldRight(BiFunction<E, R, R> f, R acc, ImList<E> list)
map ![Laurel Wreath](https://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Laurel_Wreath.jpg/50px-Laurel_Wreath.jpg)
public static <E, R> ImList<R> map(Function<E, R> f, ImList<E> list)
find ![Laurel Wreath](https://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Laurel_Wreath.jpg/50px-Laurel_Wreath.jpg)
public static <E> Optional<E> find(Predicate<E> predicate, ImList<E> list)
Clients
public static ImmutableList<String> filterWordsWhichContainAllVowels(ImmutableList<String> words)
public static ImmutableList<Integer> filterEvens(ImmutableList<Integer> xs)
sum
public static int sum(ImmutableList<Integer> xs)
countBetweenMinAndMaxExclusive
public static int countBetweenMinAndMaxExclusive(int min, int maxExclusive, ImmutableList<Integer> xs)
mapToLengths
public static ImmutableList<Integer> mapToLengths(ImmutableList<String> texts)
Use the String class's length() method.
mapToStrictlyLessThan
public static ImmutableList<Boolean> mapToStrictlyLessThan(ImmutableList<Integer> xs, int threshold)
findFirstPalindrome
public static Optional<String> findFirstPalindrome(ImmutableList<String> words)
Test
class: | HigherOrderFunctionTestSuite.java | ![]() |
package: | hof | |
source folder: | src/test/java |
Map
class: | MapTestSuite.java | ![]() |
package: | hof.map | |
source folder: | src/test/java |
Filter
class: | FilterTestSuite.java | ![]() |
package: | hof.filter | |
source folder: | src/test/java |
Fold
class: | FoldTestSuite.java | ![]() |
package: | hof.fold | |
source folder: | src/test/java |
Filter
class: | FindTestSuite.java | ![]() |
package: | hof.find | |
source folder: | src/test/java |