...
- Write the
arrangements
(permutations) function from HTDP problem 12.4.2 in HW2 as a Java method for aWord
class provided in the fileWord.dj1
. This file includes definitions of the composite pattern classesWord
andWordList
. Decompose the problem in exactly the same form as this solution to problem 12.4.2. We are providing skeletons for the classesWord
andWordList
in the file WordList.dj1; use them. - Write the
mergesort
function from the last problem in HW4 (using exactly the same top-down approach described in HW4) as a Java method in the composite pattern classComparableList
provided in the file ComparableList.dj1. - Do Exercise 21.2.3 from HTDP using the Java composite pattern class
ObjectList
provided in the file ObjectList.dj1. This file includes the interfacePredicate
, which is the type of Java function arguments passed to thefilter
method, and abstract method stubs forfilter
,eliminateExp
,recall
, andselection
. Exercise 21.2.3 provides Scheme code for thefilter
function which you should directly translate to the corresponding Java method code inObjectList
. Note that yourfilter
method should work for arbitraryObjectLists
. In coding the methodseliminateExp
,recall
, andselection
, use the Java typeNumber
(compared using methoddoubleValue
in place of the Schemenumber
type and the Java typeObject
in place of the Schemesymbol
type. The methoddoubleValue()
inNumber
returns the value of this converted to adouble
. You will need to cast theObject
input of thetest
method to typeNumber
when filtering lists of numbers. - Do Problem 2 from Homework 5 in Java using the composite hierarchy of classes provided in the file ArithExpr.dj1.
Are You The Last Element In A List?
The A difficulty when processing lists is how to tell if one is at the last element of the list. This is useful in a number of situations, such as in the merge sorting process above.
...