Higher Order Functions Hall of Fame Assignment
Jump to navigation
Jump to search
filter
foldLeft
foldRight
map
find
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
toOnlyWordsWhichContainAllVowels
public static ImList<String> toOnlyWordsWhichContainAllVowels(ImList<String> words)
toOnlyEvens
public static ImList<Integer> toOnlyEvens(ImList<Integer> xs)
toOnlyWordsWhichContainAllVowels
public static ImList<String> toOnlyWordsWhichContainAllVowels(ImList<String> words)
firstPalindrome
public static Optional<String> firstPalindrome(ImList<String> words)
sum
public static int sum(ImList<Integer> xs)
countBetweenMinAndMaxExclusive
public static int countBetweenMinAndMaxExclusive(int min, int maxExclusive, ImList<Integer> xs)
reverse
public static <E> ImList<E> reverse(ImList<E> xs)
toLengths
public static ImList<Integer> toLengths(ImList<String> texts)
toStrictlyLessThan
public static ImList<Boolean> toStrictlyLessThan(ImList<Integer> xs, int threshold)
Test
class: | HigherOrderFunctionTestSuite.java | ![]() |
package: | hof | |
source folder: | src/test/java |