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

From CSE425S Wiki
Jump to navigation Jump to search
(Created page with "=Code To Implement= ==Map== {{JavaToImplement|MapHof|map|hof.map.assignment}} <nowiki>public static <T, R> ImmutableList<R> map(Function<T, R> f, ImmutableList<T> list)</now...")
 
Line 28: Line 28:
 
Next, we will build some applications which use fold: sum (which does not require lexical scope) and countBetweenMinAndMaxExclusive (which does).
 
Next, we will build some applications which use fold: sum (which does not require lexical scope) and countBetweenMinAndMaxExclusive (which does).
  
=Code To Implement=
 
 
==Fold==
 
==Fold==
 
{{JavaToImplement|FoldHof|foldLeft<br>foldRight|hof.fold.assignment}}
 
{{JavaToImplement|FoldHof|foldLeft<br>foldRight|hof.fold.assignment}}

Revision as of 07:09, 14 February 2020

Code To Implement

Map

class: MapHof.java Java.png
methods: map
package: hof.map.assignment
source folder: src/main/java
public static <T, R> ImmutableList<R> map(Function<T, R> f, ImmutableList<T> list) Laurel Wreath
class: MapHofApps.java Java.png
methods: mapToLengths
mapToStrictlyLessThan
package: hof.map.assignment
source folder: src/main/java
public static ImmutableList<Integer> mapToLengths(ImmutableList<String> texts)
public static ImmutableList<Boolean> mapToStrictlyLessThan(ImmutableList<Integer> xs, int threshold)

Filter

class: FilterHof.java Java.png
methods: filter
package: hof.filter.assignment
source folder: src/main/java
public static <E> ImmutableList<E> filter(Predicate<E> predicate, ImmutableList<E> list) Laurel Wreath
class: FilterHofApps.java Java.png
methods: filterWordsWhichContainAllVowels
filterEvens
package: hof.map.assignment
source folder: src/main/java
public static ImmutableList<String> filterWordsWhichContainAllVowels(ImmutableList<String> words)
public static ImmutableList<Integer> filterEvens(ImmutableList<Integer> xs)

Lexical scope is not unique to ML. Nearly all programming languages use lexical scope, including Java.

First, we will build the utility methods: foldLeft (which can be easily built with tail recursion) and foldRight (which cannot).

Next, we will build some applications which use fold: sum (which does not require lexical scope) and countBetweenMinAndMaxExclusive (which does).

Fold

class: FoldHof.java Java.png
methods: foldLeft
foldRight
package: hof.fold.assignment
source folder: src/main/java

SML List Reference

foldLeft

public static <A, B> A foldLeft(BiFunction<A, B, A> f, A acc, ImmutableList<B> list) Laurel Wreath
foldLeft(f, initial_value, [x1, x2, ..., xn])
returns f(xn,...,f(x2, f(x1, initial_value))...) or initial_value if the list is empty.

foldRight

public static <A, B> A foldRight(BiFunction<A, B, A> f, A acc, ImmutableList<B> list) Laurel Wreath
foldRight(f, initial_value, [x1, x2, ..., xn])
returns f(x1, f(x2, ..., f(xn, init)...)) or initial_value if the list is empty.

Fold Apps

class: FoldHofApps.java Java.png
methods: sum
countBetweenMinAndMaxExclusive
package: hof.map.assignment
source folder: src/main/java

sum

public static int sum(ImmutableList<Integer> xs)

countBetweenMinAndMaxExclusive

public static int countBetweenMinAndMaxExclusive(int min, int maxExclusive, ImmutableList<Integer> xs)

Test

class: HigherOrderFunctionTestSuite.java Junit.png
package: hof.assignment
source folder: src/test/java

Map

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

Filter

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

Test

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