Difference between revisions of "Higher Order Functions Hall of Fame Assignment"

From CSE425S Wiki
Jump to navigation Jump to search
Line 3: Line 3:
 
{{JavaToImplement|Hof|filter<br/>foldLeft<br/>foldRight<br/>map<br/>find<br/>|hof.util.exercise}}
 
{{JavaToImplement|Hof|filter<br/>foldLeft<br/>foldRight<br/>map<br/>find<br/>|hof.util.exercise}}
  
−
===filter===
+
===filter {{HofHof}}===
−
 
 
−
<nowiki>public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)</nowiki> {{HofHof}}
 
−
 
 
 
[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}}
+
<syntaxhighlight lang="java>
 +
public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)
 +
</syntaxhighlight>
  
−
===foldLeft===
+
===foldLeft {{HofHof}}===
−
<nowiki>public static <E, R> R foldLeft(BiFunction<E, R, R> f, R acc, ImList<E> list)</nowiki> {{HofHof}}
+
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.foldl:VAL SML List foldl]
  
 
:<code>foldLeft(f, initial_value, [x1, x2, ..., xn])</code>
 
:<code>foldLeft(f, initial_value, [x1, x2, ..., xn])</code>
 
:returns <code>f(xn,...,f(x2, f(x1, initial_value))...)</code> or <code>initial_value</code> if the list is empty.
 
:returns <code>f(xn,...,f(x2, f(x1, initial_value))...)</code> or <code>initial_value</code> if the list is empty.
  
−
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.foldl:VAL SML List foldl]
+
<syntaxhighlight lang="java>
−
 
+
public static <E, R> R foldLeft(BiFunction<E, R, R> f, R acc, ImList<E> list)
−
===foldRight===
+
</syntaxhighlight>
−
<nowiki>public static <E, R> R foldRight(BiFunction<E, R, R> f, R acc, ImList<E> list)</nowiki> {{HofHof}}
+
===foldRight {{HofHof}}===
 +
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.foldr:VAL SML List foldr]
  
 
:<code>foldRight(f, initial_value, [x1, x2, ..., xn])</code>
 
:<code>foldRight(f, initial_value, [x1, x2, ..., xn])</code>
 
:returns <code>f(x1, f(x2, ..., f(xn, init)...))</code> or <code>initial_value</code> if the list is empty.
 
:returns <code>f(x1, f(x2, ..., f(xn, init)...))</code> or <code>initial_value</code> if the list is empty.
  
−
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.foldr:VAL SML List foldr]
+
<syntaxhighlight lang="java>
−
 
+
public static <E, R> R foldRight(BiFunction<E, R, R> f, R acc, ImList<E> list)
−
===map===
+
</syntaxhighlight>
−
{{JavaToImplement|Hof|map|hof.util.exercise}}
+
===map {{HofHof}}===
−
 
 
−
<nowiki>public static <E, R> ImList<R> map(Function<E, R> f, ImList<E> list)</nowiki> {{HofHof}}
 
−
 
 
 
[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===
+
<syntaxhighlight lang="java>
−
{{JavaToImplement|Hof|find|hof.util.exercise}}
+
public static <E, R> ImList<R> map(Function<E, R> f, ImList<E> list)
−
 
+
</syntaxhighlight>
−
<nowiki>public static <E> Optional<E> find(Predicate<E> predicate, ImList<E> list)</nowiki> {{HofHof}}
+
===find {{HofHof}}===
−
 
 
 
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.find:VAL SML List map]
 
[https://smlfamily.github.io/Basis/list.html#SIG:LIST.find:VAL SML List map]
  
 +
<syntaxhighlight lang="java>
 +
public static <E> Optional<E> find(Predicate<E> predicate, ImList<E> list)
 +
</syntaxhighlight>
  
 
==Clients==
 
==Clients==

Revision as of 03:24, 12 October 2023

Code To Implement

Higher-order Functions

class: Hof.java Java.png
methods: filter
foldLeft
foldRight
map
find
package: hof.util.exercise
source folder: src/main/java

filter Laurel Wreath

SML List filter 

public static <E> ImList<E> filter(Predicate<E> predicate, ImList<E> list)

foldLeft Laurel Wreath

SML List foldl

foldLeft(f, initial_value, [x1, x2, ..., xn])
returns f(xn,...,f(x2, f(x1, initial_value))...) or initial_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

SML List foldr

foldRight(f, initial_value, [x1, x2, ..., xn])
returns f(x1, f(x2, ..., f(xn, init)...)) or initial_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

SML List map 

public static <E, R> ImList<R> map(Function<E, R> f, ImList<E> list)

find Laurel Wreath

SML List map 

public static <E> Optional<E> find(Predicate<E> predicate, ImList<E> list)

Clients

class: HofClients.java Java.png
methods: filterWordsWhichContainAllVowels
filterEvens
sum
countBetweenMinAndMaxExclusive
mapToLengths
mapToStrictlyLessThan
findFirstPalindrome
package: hof.clients.exercise
source folder: src/main/java 
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 Junit.png
package: hof
source folder: src/test/java

Map

class: MapTestSuite.java Junit.png
package: hof.map
source folder: src/test/java

Filter

class: FilterTestSuite.java Junit.png
package: hof.filter
source folder: src/test/java

Fold

class: FoldTestSuite.java Junit.png
package: hof.fold
source folder: src/test/java

Filter

class: FindTestSuite.java Junit.png
package: hof.find
source folder: src/test/java
Retrieved from "http://classes.engineering.wustl.edu/cse425s/index.php?title=Higher_Order_Functions_Hall_of_Fame_Assignment&oldid=2244"