Difference between revisions of "ImmutableList Assignment"
(→nil) |
|||
(46 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | =Motivation= | ||
+ | In this assignment we will build a classic data structure from functional programming languages like [https://smlfamily.github.io/Basis/list.html SML]. It is important to think recursively in a functional programming language and so it will serve you well to approach this assignment with a recursive mind set. Further, the fact that this data structure is immutable leads to a very clean solution. If you find yourself going down an overly complicated road, try to imagine how you would [https://en.wikipedia.org/wiki/Lisp_(programming_language)#Lists build this assignment in the 1950s] when [https://en.wikipedia.org/wiki/IBM_704 hardware companies boasted about supporting floating point numbers]. | ||
+ | |||
+ | =Code To Investigate= | ||
+ | ==interface [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html ImList<E>]== | ||
+ | |||
+ | <nowiki>public interface ImList<E> extends Iterable<E> { | ||
+ | /** | ||
+ | * @return the head value if it is present | ||
+ | * @throws NoSuchElementException if empty | ||
+ | */ | ||
+ | E head(); | ||
+ | |||
+ | /** | ||
+ | * @return the tail if it is present | ||
+ | * @throws NoSuchElementException if empty | ||
+ | */ | ||
+ | ImList<E> tail(); | ||
+ | |||
+ | /** | ||
+ | * @return true if empty, false otherwise | ||
+ | */ | ||
+ | boolean isEmpty(); | ||
+ | }</nowiki> | ||
+ | |||
=Code To Implement= | =Code To Implement= | ||
==Utilities== | ==Utilities== | ||
− | === | + | ===ImLists=== |
− | {{JavaToImplement| | + | {{JavaToImplement|ImLists|nil<br/>cons<br/>brackets<br/>|immutable.list.util.exercise}} |
− | |||
− | |||
− | |||
− | + | This class is the one required class you must support. It creates 3 static methods which are responsible for returning instances of ImList. There is a suggested path below involving a split implementation: one for [[#enum_EmptyImList|empty]] ImLists and one for [[#class_NonEmptyImList.3CE.3E|non-empty]] ImLists. For now, investigate this file to see what is required and decide whether or not you want to go the suggested route. Either way, you will want to build the supporting unshared enum and/or classes as you build these public static methods. | |
− | + | '''ALERT''': You do not yet need to support the iterator() method on any instance you create. That will be the subject of a [[Iterable_Immutable_List_Assignment|future exercise]]. | |
− | |||
====nil==== | ====nil==== | ||
− | <pre>public static <E> | + | <pre>public static <E> ImList<E> nil()</pre> |
− | + | Constructs a new empty list, analogous to the [https://smlfamily.github.io/Basis/list.html#SIG:LIST.nil:TY nil constructor] for SML [https://smlfamily.github.io/Basis/list.html list] datatype. | |
====cons==== | ====cons==== | ||
− | <pre>public static <E> | + | <pre>public static <E> ImList<E> cons(E head, ImList<E> tail)</pre> |
+ | |||
+ | Constructs a new list comprised of head::tail, analogous to the [https://smlfamily.github.io/Basis/list.html#SIG:LIST.:::TY :: constructor] for SML [https://smlfamily.github.io/Basis/list.html list] datatype. | ||
====brackets==== | ====brackets==== | ||
− | <pre>public static <E> | + | <pre>public static <E> ImList<E> brackets(E... elements)</pre> |
+ | |||
+ | Constructs an ImList<E> whose contents are defined by the elements passed in. | ||
+ | |||
+ | The parameter <tt>E... arguments</tt> is an example usage of [https://docs.oracle.com/javase/8/docs/technotes/guides/language/varargs.html varargs] in Java. You can treat parameter elements as if it is an <tt>E[]</tt>. The varargs <tt>...</tt> simply allows for more convenient invocations of the <tt>brackets</tt> method. | ||
+ | |||
+ | In order to build this method, consider added a <tt>private static</tt> helper method to perform the actual work. | ||
+ | |||
+ | It is suggested that you adopt a recursive approach to solving this problem. What is the base case? What is the recursive case? | ||
+ | |||
+ | Note: Be sure to cons your items onto the list from the back to the front. | ||
+ | |||
+ | === Split Implementation Candidate === | ||
+ | One possible approach to supporting the public methods on Lists is a split implementation: an enum with a single enum constant to serve for all empty lists and a class for non-empty lists. | ||
+ | |||
+ | <nowiki>ImList<String> a = ImLists.cons("A", ImLists.nil()); | ||
+ | ImList<String> ba = ImLists.cons("B", a); | ||
+ | ImList<String> cba = ImLists.cons("C", ba); | ||
+ | ImList<String> dcba = ImLists.cons("D", cba); | ||
+ | ImList<String> edcba = ImLists.cons("E", dcba); | ||
+ | System.out.println(edcba);</nowiki> | ||
+ | |||
+ | outputs: | ||
+ | |||
+ | E::D::C::B::A::[] | ||
+ | |||
+ | produces the data structure | ||
+ | |||
+ | [[File:ImList_E_D_C_B_A.svg]] | ||
+ | |||
+ | ====class EmptyImList==== | ||
+ | {{JavaToImplement|EmptyImList|constructor<br/>isEmpty<br/>head<br/>tail<br/>|immutable.list.util.exercise}} | ||
+ | <code>class EmptyImList implements [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html ImList<Object>]</code> | ||
+ | |||
+ | '''ALERT''': you need NOT implement iterator() now. That will be the subject of a future studio. | ||
+ | |||
+ | =====constructor===== | ||
+ | What fields, if any, are required as state for an empty list? | ||
+ | |||
+ | =====isEmpty===== | ||
+ | ''"Hey EmptyImList, are you empty?"'' | ||
+ | |||
+ | =====head===== | ||
+ | Check the behavior of head() dictated by the specification in [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html#head() ImList<E>]. | ||
+ | |||
+ | =====tail===== | ||
+ | Check the behavior of tail() dictated by the specification in [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html#tail() ImList<E>]. | ||
+ | |||
+ | ====class NonEmptyImList<E>==== | ||
+ | {{JavaToImplement|NonEmptyImList|constructor<br/>isEmpty<br/>head<br/>tail<br/>|immutable.list.util.exercise}} | ||
+ | |||
+ | <code>final class NonEmptyImList<E> implements [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html ImList<E>]</code> | ||
+ | |||
+ | '''ALERT''': you need NOT implement iterator() now. That will be the subject of a future studio. | ||
+ | |||
+ | =====constructor===== | ||
+ | What fields, if any, are required as state for a non-empty list? | ||
+ | |||
+ | =====isEmpty===== | ||
+ | ''"Hey NonEmptyImList, are you empty?"'' | ||
+ | |||
+ | =====head===== | ||
+ | Check the behavior of head() dictated by the specification in [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html#head() ImList<E>]. | ||
+ | |||
+ | =====tail===== | ||
+ | Check the behavior of tail() dictated by the specification in [https://www.cse.wustl.edu/~dennis.cosgrove/courses/cse425s/current/apidocs/immutable/list/util/core/ImList.html#tail() ImList<E>]. | ||
+ | |||
+ | ==Clients== | ||
+ | NOTE: Since the constructors on our implementations are package protected, you will need to use [[#nil|nil()]] and [[#cons|cons(head,tail)]]. | ||
− | |||
===Length=== | ===Length=== | ||
− | {{JavaToImplement|Length|length|immutable.list. | + | {{JavaToImplement|Length|length|immutable.list.clients.exercise}} |
− | < | + | <pre>public static <E> int length(ImList<E> list)</pre> |
+ | |||
+ | Compute the length of an arbitrary ImList<E>. | ||
===SumProductCountdownFactorial=== | ===SumProductCountdownFactorial=== | ||
− | {{JavaToImplement|SumProductCountdownFactorial|sum<br/>product<br/>countdown<br/>factorial|immutable.list. | + | {{JavaToImplement|SumProductCountdownFactorial|sum<br/>product<br/>countdown<br/>factorial|immutable.list.clients.exercise}} |
====sum==== | ====sum==== | ||
− | < | + | <pre>public static int sum(ImList<Integer> xs)</pre> |
+ | |||
+ | Compute the sum of all the items in an ImList<Integer>. | ||
====product==== | ====product==== | ||
− | < | + | <pre>public static int product(ImList<Integer> xs)</pre> |
+ | |||
+ | Compute the produce all the items in an ImList<Integer>. | ||
====countdown==== | ====countdown==== | ||
− | < | + | <pre>public static ImList<Integer> countdown(int n)</pre> |
+ | |||
+ | Produce a new list which contains the values from n down to 1. For example, countdown(5) would produce the list [5,4,3,2,1]. | ||
====factorial==== | ====factorial==== | ||
− | < | + | <pre>public static int factorial(int n)</pre> |
+ | |||
+ | Can you implement this method using the methods you have already created? | ||
===Concat=== | ===Concat=== | ||
− | {{JavaToImplement|Concat|concat|immutable.list. | + | {{JavaToImplement|Concat|concat|immutable.list.clients.exercise}} |
+ | |||
+ | <pre>public static <E> ImList<E> concat(ImList<E> xs, ImList<E> ys)</pre> | ||
− | + | Concatenate one list on to another. | |
=Test= | =Test= | ||
− | {{TestSuite| | + | {{TestSuite|ImListUtilAndClientsTestSuite|immutable.list}} |
+ | |||
+ | =Pledge, Acknowledgments, Citations= | ||
+ | {{Pledge|exercise-im-list}} |
Latest revision as of 12:42, 29 August 2023
Contents
Motivation
In this assignment we will build a classic data structure from functional programming languages like SML. It is important to think recursively in a functional programming language and so it will serve you well to approach this assignment with a recursive mind set. Further, the fact that this data structure is immutable leads to a very clean solution. If you find yourself going down an overly complicated road, try to imagine how you would build this assignment in the 1950s when hardware companies boasted about supporting floating point numbers.
Code To Investigate
interface ImList<E>
public interface ImList<E> extends Iterable<E> { /** * @return the head value if it is present * @throws NoSuchElementException if empty */ E head(); /** * @return the tail if it is present * @throws NoSuchElementException if empty */ ImList<E> tail(); /** * @return true if empty, false otherwise */ boolean isEmpty(); }
Code To Implement
Utilities
ImLists
class: | ImLists.java | |
methods: | nil cons brackets |
|
package: | immutable.list.util.exercise | |
source folder: | src/main/java |
This class is the one required class you must support. It creates 3 static methods which are responsible for returning instances of ImList. There is a suggested path below involving a split implementation: one for empty ImLists and one for non-empty ImLists. For now, investigate this file to see what is required and decide whether or not you want to go the suggested route. Either way, you will want to build the supporting unshared enum and/or classes as you build these public static methods.
ALERT: You do not yet need to support the iterator() method on any instance you create. That will be the subject of a future exercise.
nil
public static <E> ImList<E> nil()
Constructs a new empty list, analogous to the nil constructor for SML list datatype.
cons
public static <E> ImList<E> cons(E head, ImList<E> tail)
Constructs a new list comprised of head::tail, analogous to the :: constructor for SML list datatype.
brackets
public static <E> ImList<E> brackets(E... elements)
Constructs an ImList<E> whose contents are defined by the elements passed in.
The parameter E... arguments is an example usage of varargs in Java. You can treat parameter elements as if it is an E[]. The varargs ... simply allows for more convenient invocations of the brackets method.
In order to build this method, consider added a private static helper method to perform the actual work.
It is suggested that you adopt a recursive approach to solving this problem. What is the base case? What is the recursive case?
Note: Be sure to cons your items onto the list from the back to the front.
Split Implementation Candidate
One possible approach to supporting the public methods on Lists is a split implementation: an enum with a single enum constant to serve for all empty lists and a class for non-empty lists.
ImList<String> a = ImLists.cons("A", ImLists.nil()); ImList<String> ba = ImLists.cons("B", a); ImList<String> cba = ImLists.cons("C", ba); ImList<String> dcba = ImLists.cons("D", cba); ImList<String> edcba = ImLists.cons("E", dcba); System.out.println(edcba);
outputs:
E::D::C::B::A::[]
produces the data structure
class EmptyImList
class: | EmptyImList.java | |
methods: | constructor isEmpty head tail |
|
package: | immutable.list.util.exercise | |
source folder: | src/main/java |
class EmptyImList implements ImList<Object>
ALERT: you need NOT implement iterator() now. That will be the subject of a future studio.
constructor
What fields, if any, are required as state for an empty list?
isEmpty
"Hey EmptyImList, are you empty?"
head
Check the behavior of head() dictated by the specification in ImList<E>.
tail
Check the behavior of tail() dictated by the specification in ImList<E>.
class NonEmptyImList<E>
class: | NonEmptyImList.java | |
methods: | constructor isEmpty head tail |
|
package: | immutable.list.util.exercise | |
source folder: | src/main/java |
final class NonEmptyImList<E> implements ImList<E>
ALERT: you need NOT implement iterator() now. That will be the subject of a future studio.
constructor
What fields, if any, are required as state for a non-empty list?
isEmpty
"Hey NonEmptyImList, are you empty?"
head
Check the behavior of head() dictated by the specification in ImList<E>.
tail
Check the behavior of tail() dictated by the specification in ImList<E>.
Clients
NOTE: Since the constructors on our implementations are package protected, you will need to use nil() and cons(head,tail).
Length
class: | Length.java | |
methods: | length | |
package: | immutable.list.clients.exercise | |
source folder: | src/main/java |
public static <E> int length(ImList<E> list)
Compute the length of an arbitrary ImList<E>.
SumProductCountdownFactorial
class: | SumProductCountdownFactorial.java | |
methods: | sum product countdown factorial |
|
package: | immutable.list.clients.exercise | |
source folder: | src/main/java |
sum
public static int sum(ImList<Integer> xs)
Compute the sum of all the items in an ImList<Integer>.
product
public static int product(ImList<Integer> xs)
Compute the produce all the items in an ImList<Integer>.
countdown
public static ImList<Integer> countdown(int n)
Produce a new list which contains the values from n down to 1. For example, countdown(5) would produce the list [5,4,3,2,1].
factorial
public static int factorial(int n)
Can you implement this method using the methods you have already created?
Concat
class: | Concat.java | |
methods: | concat | |
package: | immutable.list.clients.exercise | |
source folder: | src/main/java |
public static <E> ImList<E> concat(ImList<E> xs, ImList<E> ys)
Concatenate one list on to another.
Test
class: | ImListUtilAndClientsTestSuite.java | |
package: | immutable.list | |
source folder: | src/test/java |
Pledge, Acknowledgments, Citations
file: | exercise-im-list-pledge-acknowledgments-citations.txt |
More info about the Honor Pledge