Difference between revisions of "Higher Order Functions Hall of Fame Assignment"
Jump to navigation
Jump to search
Line 1: | Line 1: | ||
=Code To Implement= | =Code To Implement= | ||
− | == | + | ==Higher-order Functions== |
+ | {{JavaToImplement|Hof|filter<br/>foldLeft<br/>foldRight<br/>map<br/>find<br/>|hof.util.exercise}} | ||
+ | |||
===filter=== | ===filter=== | ||
− | |||
<nowiki>public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)</nowiki> {{HofHof}} | <nowiki>public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)</nowiki> {{HofHof}} | ||
Line 8: | Line 9: | ||
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.filter:VAL SML List filter] | [https://smlfamily.github.io/Basis/list.html#SIG:LIST.filter:VAL SML List filter] | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
{{JavaToImplement|Hof|foldLeft<br>foldRight|hof.util.exercise}} | {{JavaToImplement|Hof|foldLeft<br>foldRight|hof.util.exercise}} | ||
Line 34: | Line 27: | ||
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.foldr:VAL SML List foldr] | [https://smlfamily.github.io/Basis/list.html#SIG:LIST.foldr:VAL SML List foldr] | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
===map=== | ===map=== | ||
{{JavaToImplement|Hof|map|hof.util.exercise}} | {{JavaToImplement|Hof|map|hof.util.exercise}} | ||
Line 50: | Line 34: | ||
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.map:VAL SML List map] | [https://smlfamily.github.io/Basis/list.html#SIG:LIST.map:VAL SML List map] | ||
− | == | + | ===find=== |
− | {{JavaToImplement| | + | {{JavaToImplement|Hof|find|hof.util.exercise}} |
+ | |||
+ | <nowiki>public static <E> Optional<E> find(Predicate<E> predicate, ImList<E> list)</nowiki> {{HofHof}} | ||
+ | |||
+ | [https://smlfamily.github.io/Basis/list.html#SIG:LIST.find:VAL SML List map] | ||
+ | |||
+ | |||
+ | ==Clients== | ||
+ | {{JavaToImplement|HofClients|filterWordsWhichContainAllVowels<br>filterEvens<br/>sum<br>countBetweenMinAndMaxExclusive<br/>mapToLengths<br>mapToStrictlyLessThan<br/>findFirstPalindrome|hof.clients.exercise}} | ||
+ | |||
+ | <nowiki>public static ImmutableList<String> filterWordsWhichContainAllVowels(ImmutableList<String> words)</nowiki> | ||
+ | |||
+ | <nowiki>public static ImmutableList<Integer> filterEvens(ImmutableList<Integer> xs)</nowiki> | ||
+ | |||
+ | ===sum=== | ||
+ | <nowiki>public static int sum(ImmutableList<Integer> xs)</nowiki> | ||
+ | ===countBetweenMinAndMaxExclusive=== | ||
+ | <nowiki>public static int countBetweenMinAndMaxExclusive(int min, int maxExclusive, ImmutableList<Integer> xs)</nowiki> | ||
===mapToLengths=== | ===mapToLengths=== | ||
Line 60: | Line 61: | ||
===mapToStrictlyLessThan=== | ===mapToStrictlyLessThan=== | ||
<nowiki>public static ImmutableList<Boolean> mapToStrictlyLessThan(ImmutableList<Integer> xs, int threshold)</nowiki> | <nowiki>public static ImmutableList<Boolean> mapToStrictlyLessThan(ImmutableList<Integer> xs, int threshold)</nowiki> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
===findFirstPalindrome=== | ===findFirstPalindrome=== |
Revision as of 03:19, 12 October 2023
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
public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)![]()
class: | Hof.java | ![]() |
methods: | foldLeft foldRight |
|
package: | hof.util.exercise | |
source folder: | src/main/java |
foldLeft
public static <E, R> R foldLeft(BiFunction<E, R, R> f, R acc, ImList<E> list)![]()
foldLeft(f, initial_value, [x1, x2, ..., xn])
- returns
f(xn,...,f(x2, f(x1, initial_value))...)
orinitial_value
if the list is empty.
foldRight
public static <E, R> R foldRight(BiFunction<E, R, R> f, R acc, ImList<E> list)![]()
foldRight(f, initial_value, [x1, x2, ..., xn])
- returns
f(x1, f(x2, ..., f(xn, init)...))
orinitial_value
if the list is empty.
map
class: | Hof.java | ![]() |
methods: | map | |
package: | hof.util.exercise | |
source folder: | src/main/java |
public static <E, R> ImList<R> map(Function<E, R> f, ImList<E> list)![]()
find
class: | Hof.java | ![]() |
methods: | find | |
package: | hof.util.exercise | |
source folder: | src/main/java |
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 |