Starting from:
$29.99
Comp301 a05-driver Solution
Introduction
Imagine you are a customer ready to use a ride share service like Uber or Lyft. When you open the app, the system accesses your location and uses that information to retrieve a collection of the nearby, available drivers.
In this assignment, you will create three classes that implement the Iterator<> interface. Your iterator classes will provide access to the available drivers logged into the app, one at a time, in a specific order, through the next() and hasNext() methods. For novice, the iterator that you create will act as a filter, identifying and iterating through only the drivers that are near the customer. For adept, your iterator will search for nearby drivers using an increasing search range; the closest drivers will be iterated through first, and drivers which are farther away will be iterated through later. Finally, for jedi, your iterator will interleave multiple collections of drivers together, providing a single iterator that goes through the drivers in each of the collections.
To get started, read through the code already provided. The interfaces Position, Driver, and Vehicle, and their implementations PositionImpl, DriverImpl, and VehicleImpl, are complete, and you should not have to modify them in any way for this assignment.
Interfaces
Distance calculation
Driver pools
The collection of Driver objects to iterate through represents the pool of drivers currently available on the app. Generally, the pool of available drivers will be passed into the constructor of your iterator class in the form of an Iterable<Driver> object. Your iterator class will use this object to access the available Driver objects.
How can you use an Iterable<Driver> object to access the available drivers? One way is to call the iterator() method, which creates and returns an iterator object. You can then call next() on that iterator object repeatedly to get access to the Driver objects.
In summary, each of your iterator classes for this assignment will implement the Iterator<Driver> interface, but they will also encapsulate another instance of Iterator<Driver>. Your iterator class will use the encapsulated iterator to access the Driver objects. It will rearrange or filter the Driver objects, and finally will return them in next() one at a time, in the new order.
Novice
The first iterator class to create for this assignment will act as a filter on the pool of available Driver objects. It will not modify the order of the drivers; instead, it will only iterate over the drivers which are close enough to the customer's position.
Create a class called ProximityIterator that implements the interface Iterator<Driver>. You'll have to add the next() and hasNext() methods to the class in fulfillment of the interface requirements. The constructor for the class should be declared with the following signature.
java public ProximityIterator(Iterable<Driver> driverPool, Position clientPosition, int proximityRange)
Here is a description of the constructor's parameters: * driverPool - Represents the available pool of Driver objects. Call
driverPool.iterator() to receive an iterator object for the underlying collection of available drivers. * clientPosition - Represents the static position of the customer/client. * proximityRange - Represents the range to use when deciding whether to include a Driver object in the iterator. Only Driver objects located within proximityRange units from clientPosition should be included by your iterator.
Your ProximityIterator class should iterate only through the Driver objects in the collection that have a Manhattan distance to clientPosition that is less than or equal to proximityRange. If next() is called but there are no more eligible drivers, throw a NoSuchElementException.
Tips
In your constructor, use the iterator() method of driverPool to create an iterator for all of the Driver objects in the collection. Store this iterator in an instance field.
Use an instance field to store the next driver that is within the proximity range from the client. Initialize this to null in your constructor. Add a private instance method which loads the next driver that is within the proximity range into the "next driver" field. If the "next driver" field is already set (i.e., if it is already non-null), this method should do nothing. Otherwise, it should retrieve drivers from the driver pool iterator until either an appropriate driver is found, or until no more drivers are in the pool. If an appropriate driver is found, store it in the "next driver" instance field. Otherwise, leave the "next driver" field null, because no next driver exists.
To implement hasNext(), first make sure that a driver has been loaded into the "next driver" field, by calling your private method. Then, if a driver was successfully loaded in, return true; otherwise, return false.
To implement next(), first call hasNext(). If false, throw a NoSuchElementException. If true, then you know that the next eligible driver must be in your "next driver" instance field. Copy this to a local variable. Reset your "next driver" field to be null so that you don't keep returning the same driver. Now return the value of the local variable that is storing the next driver.
Adept
The second iterator class to create for this assignment will scan through the pool of Driver objects multiple times, using a gradually increasing search range each time. The first time through the driver pool, only drivers within 1 unit from the client will be selected. The second time through the driver pool, the search range for finding drivers will increase by a configurable amount. The third time, the search range will increase again. This process continues until all drivers in the pool are visited.
Create a class called ExpandingProximityIterator that implements the interface Iterator<Driver>. You'll have to add the next() and hasNext() methods to the class in fulfillment of the interface requirements. The constructor for the class should be declared with the following signature.
java public ExpandingProximityIterator(Iterable<Driver> driverPool, Position clientPosition, int expansionStep)
Here is a description of the constructor's parameters: * driverPool - Represents the available pool of Driver objects. Call
driverPool.iterator() to receive an iterator object for the underlying collection of available drivers. * clientPosition - Represents the static position of the customer/client. * expansionStep - Represents the amount by which to increase the range when searching for available drivers.
An ExpandingProximityIterator should first iterate through all of the Driver objects in the collection that have a Manhattan distance to clientPosition that is less than or equal to 1. After all such drivers have been exhausted, the iterator should start back at the beginning of the pool and iterate through drivers that have a distance that is greater than 1 but less than or equal to 1 + expansionStep. After all of these drivers have been exhausted, the iterator should start at the beginning of the pool again and iterate through drivers that have a distance that is greater than
1 + expansionStep but less than or equal to 1 + 2 * expansionStep. After these have been exhausted, go through drivers that are greater than 1 + 2 * expansionStep but less than or equal to 1 + 3 * expansionStep. This process should continue until there are no more drivers left to process. At that point, hasNext() should return false.
Tips
You will need to encapsulate driverPool as an instance field, so that you can use it to create a new iterator each time you run out of drivers for a particular "ring" size.
You will need to detect when you have run out of drivers completely so that hasNext() returns false eventually. There are a couple of different ways to do this.
One way is to maintain a boolean flag that is set whenever a driver is encountered that is outside of the current ring while looking for the next driver. Then, when you have run out of drivers at the current ring size, you can check this flag to make sure that at least one driver is still outside of the current ring, and you know if you should keep expanding. Be sure to reset the flag each time you expand.
Another way to do this is to keep track of the total number of drivers in the driver pool. Then, keep track of the number of times next() has been successfully called. When this count is equal to the size of the driver pool, you know that every driver has been found at some ring size already and that expanding the ring won't help (i.e., there are no more drivers).
Jedi (extra credit)
The last iterator class to create for this assignment will interleave the drivers from multiple different driver pools together into one iterator.
Create a class called SnakeOrderAcrossPoolsIterator that implements the interface Iterator<Driver>. The constructor for this class should be declared with the following signature:
java public SnakeOrderAcrossPoolsIterator(List<Iterable<Driver>> driverPools)
Unlike novice and adept, the constructor of this iterator is given a list of driver pools. This version of the iterator should retrieve the next driver from each pool, one at a time, in "snake order". "Snake order" means first going from first-to-last and then reversing and going from last-to-first. For example, let's say there are 4 driver pools in the driverPools list. The first driver retrieved should come from pool 0, followed by the next driver from pool 1, then pool 2, then pool 3, then pool 3 again, then pool 2, then pool 1, then pool 0, then pool 0 again, then pool 1, and so on.
Tips
In your constructor, use the list of driver pools provided to create a corresponding list of driver iterators for each pool; store this list as an instance field.
Encapsulate an integer instance field to store an index representing which pool iterator to pull from the next time next() is called.
Grading
This assignment is worth 15 points.
Novice: 10 points
Adept: 5 points
Jedi: 5 points
Imagine you are a customer ready to use a ride share service like Uber or Lyft. When you open the app, the system accesses your location and uses that information to retrieve a collection of the nearby, available drivers.
In this assignment, you will create three classes that implement the Iterator<> interface. Your iterator classes will provide access to the available drivers logged into the app, one at a time, in a specific order, through the next() and hasNext() methods. For novice, the iterator that you create will act as a filter, identifying and iterating through only the drivers that are near the customer. For adept, your iterator will search for nearby drivers using an increasing search range; the closest drivers will be iterated through first, and drivers which are farther away will be iterated through later. Finally, for jedi, your iterator will interleave multiple collections of drivers together, providing a single iterator that goes through the drivers in each of the collections.
To get started, read through the code already provided. The interfaces Position, Driver, and Vehicle, and their implementations PositionImpl, DriverImpl, and VehicleImpl, are complete, and you should not have to modify them in any way for this assignment.
Interfaces
Distance calculation
Driver pools
The collection of Driver objects to iterate through represents the pool of drivers currently available on the app. Generally, the pool of available drivers will be passed into the constructor of your iterator class in the form of an Iterable<Driver> object. Your iterator class will use this object to access the available Driver objects.
How can you use an Iterable<Driver> object to access the available drivers? One way is to call the iterator() method, which creates and returns an iterator object. You can then call next() on that iterator object repeatedly to get access to the Driver objects.
In summary, each of your iterator classes for this assignment will implement the Iterator<Driver> interface, but they will also encapsulate another instance of Iterator<Driver>. Your iterator class will use the encapsulated iterator to access the Driver objects. It will rearrange or filter the Driver objects, and finally will return them in next() one at a time, in the new order.
Novice
The first iterator class to create for this assignment will act as a filter on the pool of available Driver objects. It will not modify the order of the drivers; instead, it will only iterate over the drivers which are close enough to the customer's position.
Create a class called ProximityIterator that implements the interface Iterator<Driver>. You'll have to add the next() and hasNext() methods to the class in fulfillment of the interface requirements. The constructor for the class should be declared with the following signature.
java public ProximityIterator(Iterable<Driver> driverPool, Position clientPosition, int proximityRange)
Here is a description of the constructor's parameters: * driverPool - Represents the available pool of Driver objects. Call
driverPool.iterator() to receive an iterator object for the underlying collection of available drivers. * clientPosition - Represents the static position of the customer/client. * proximityRange - Represents the range to use when deciding whether to include a Driver object in the iterator. Only Driver objects located within proximityRange units from clientPosition should be included by your iterator.
Your ProximityIterator class should iterate only through the Driver objects in the collection that have a Manhattan distance to clientPosition that is less than or equal to proximityRange. If next() is called but there are no more eligible drivers, throw a NoSuchElementException.
Tips
In your constructor, use the iterator() method of driverPool to create an iterator for all of the Driver objects in the collection. Store this iterator in an instance field.
Use an instance field to store the next driver that is within the proximity range from the client. Initialize this to null in your constructor. Add a private instance method which loads the next driver that is within the proximity range into the "next driver" field. If the "next driver" field is already set (i.e., if it is already non-null), this method should do nothing. Otherwise, it should retrieve drivers from the driver pool iterator until either an appropriate driver is found, or until no more drivers are in the pool. If an appropriate driver is found, store it in the "next driver" instance field. Otherwise, leave the "next driver" field null, because no next driver exists.
To implement hasNext(), first make sure that a driver has been loaded into the "next driver" field, by calling your private method. Then, if a driver was successfully loaded in, return true; otherwise, return false.
To implement next(), first call hasNext(). If false, throw a NoSuchElementException. If true, then you know that the next eligible driver must be in your "next driver" instance field. Copy this to a local variable. Reset your "next driver" field to be null so that you don't keep returning the same driver. Now return the value of the local variable that is storing the next driver.
Adept
The second iterator class to create for this assignment will scan through the pool of Driver objects multiple times, using a gradually increasing search range each time. The first time through the driver pool, only drivers within 1 unit from the client will be selected. The second time through the driver pool, the search range for finding drivers will increase by a configurable amount. The third time, the search range will increase again. This process continues until all drivers in the pool are visited.
Create a class called ExpandingProximityIterator that implements the interface Iterator<Driver>. You'll have to add the next() and hasNext() methods to the class in fulfillment of the interface requirements. The constructor for the class should be declared with the following signature.
java public ExpandingProximityIterator(Iterable<Driver> driverPool, Position clientPosition, int expansionStep)
Here is a description of the constructor's parameters: * driverPool - Represents the available pool of Driver objects. Call
driverPool.iterator() to receive an iterator object for the underlying collection of available drivers. * clientPosition - Represents the static position of the customer/client. * expansionStep - Represents the amount by which to increase the range when searching for available drivers.
An ExpandingProximityIterator should first iterate through all of the Driver objects in the collection that have a Manhattan distance to clientPosition that is less than or equal to 1. After all such drivers have been exhausted, the iterator should start back at the beginning of the pool and iterate through drivers that have a distance that is greater than 1 but less than or equal to 1 + expansionStep. After all of these drivers have been exhausted, the iterator should start at the beginning of the pool again and iterate through drivers that have a distance that is greater than
1 + expansionStep but less than or equal to 1 + 2 * expansionStep. After these have been exhausted, go through drivers that are greater than 1 + 2 * expansionStep but less than or equal to 1 + 3 * expansionStep. This process should continue until there are no more drivers left to process. At that point, hasNext() should return false.
Tips
You will need to encapsulate driverPool as an instance field, so that you can use it to create a new iterator each time you run out of drivers for a particular "ring" size.
You will need to detect when you have run out of drivers completely so that hasNext() returns false eventually. There are a couple of different ways to do this.
One way is to maintain a boolean flag that is set whenever a driver is encountered that is outside of the current ring while looking for the next driver. Then, when you have run out of drivers at the current ring size, you can check this flag to make sure that at least one driver is still outside of the current ring, and you know if you should keep expanding. Be sure to reset the flag each time you expand.
Another way to do this is to keep track of the total number of drivers in the driver pool. Then, keep track of the number of times next() has been successfully called. When this count is equal to the size of the driver pool, you know that every driver has been found at some ring size already and that expanding the ring won't help (i.e., there are no more drivers).
Jedi (extra credit)
The last iterator class to create for this assignment will interleave the drivers from multiple different driver pools together into one iterator.
Create a class called SnakeOrderAcrossPoolsIterator that implements the interface Iterator<Driver>. The constructor for this class should be declared with the following signature:
java public SnakeOrderAcrossPoolsIterator(List<Iterable<Driver>> driverPools)
Unlike novice and adept, the constructor of this iterator is given a list of driver pools. This version of the iterator should retrieve the next driver from each pool, one at a time, in "snake order". "Snake order" means first going from first-to-last and then reversing and going from last-to-first. For example, let's say there are 4 driver pools in the driverPools list. The first driver retrieved should come from pool 0, followed by the next driver from pool 1, then pool 2, then pool 3, then pool 3 again, then pool 2, then pool 1, then pool 0, then pool 0 again, then pool 1, and so on.
Tips
In your constructor, use the list of driver pools provided to create a corresponding list of driver iterators for each pool; store this list as an instance field.
Encapsulate an integer instance field to store an index representing which pool iterator to pull from the next time next() is called.
Grading
This assignment is worth 15 points.
Novice: 10 points
Adept: 5 points
Jedi: 5 points
1 file (67.0KB)
