Chess MapReduce Application
Jump to navigation
Jump to search
Contents
Code To Investigate and Implement
ChessMapper
class: | ChessMapper.java | |
methods: | constructor isMoveAtIndexDesired map |
|
package: | mapreduce.apps.chess.exercise | |
source folder: | student/src/main/java |
constructor and instance variable
method: public ChessMapper(IntPredicate isMoveAtIndexDesired)
(sequential implementation only)
Hang onto the value of the isMoveAtIndexDesired parameter as an instance variable for later use.
isMoveAtIndexDesired
This method exists largely as a reminder to use the isMoveAtIndexDesired passed to the constructor.
map
Note: the ChessMapper is constructed with an IntPredicate. This IntPredicate should be passed to each game's positionResponsePairs method to potentially limit how many pairs you will emit.
method: public List<Map.Entry<Position, MoveResultPair>> map(Game game)
(sequential implementation only)
ChessReducer
class: | ChessReducer.java | |
methods: | reduce | |
package: | mapreduce.apps.chess.exercise | |
source folder: | student/src/main/java |
method: public Map<Move, ResultTotalInfo> reduce(List<MoveResultPair> moveResultPairs)
(sequential implementation only)
Warning:This class inherits from ClassicReducer. Be sure to have completed that exercise first. |