(Solved Homework): CompSci Programming Help!!…

CompSci Programming Help!!

package simulator;

Don't use plagiarized sources. Get Your Custom Essay on
(Solved Homework): CompSci Programming Help!!…
Get an essay WRITTEN FOR YOU, Plagiarism free, and by an EXPERT!
Order Essay

public class Bus {

public final int number;

private final RoadMap roadMap;

private int x;

private int y;

public Bus(int number, RoadMap roadMap, int x, int y) {

this.number = number;

this.roadMap = roadMap;

this.x = x;

this.y = y;

}

public int getX() {

return x;

}

public int getY() {

return y;

}

/**

* Move the bus. Buses only move along the cardinal directions

* (north/south/east/west), not diagonally.

*

* If the bus is stopped (that is, if it was just placed, or if it didn’t

* move last time move() was called), then it should attempt to move north.

* If it cannot (no road, or off the map), then it should attempt south,

* then east, then west. If no move is available, it should stay in its

* current position.

*

* If the bus is moving (that is, if it successfully moved the last time

* move() was called), then it should attempt to continue moving in the same

* direction.

*

* If it cannot (no road, or off the map), then it should attempt to turn

* right. For example, if the bus was moving north, but there is no more

* road to the north, it should move east if possible.

*

* If it cannot turn right, it should turn left. If it cannot turn left, it

* should reverse direction (that is, move backward, if possible).

* If it cannot do any of these things, it should stay in its current position.

* @param x

* @param y

public void move() {

}

}

}

Please implement the move() method

Thank you!

Expert Answer

 

BusVisualizer.java
————————————————–
import processing.core.PApplet;

public class BusVisualizer extends PApplet {
static RoadMap roadMap;
static Bus[] buses;
static int busCount;

public static void main(String[] args) {
PApplet.main(“BusVisualizer”);
}

public void settings() {
roadMap = new RoadMap(10, 10); // you could replace this with a call to
// RoadMap.fromString(); see the tests for an example.
buses = new Bus[5];
busCount = 0;
size(roadMap.xSize * 20, roadMap.ySize * 20);
}

public void setup() {
}

public void draw() {
background(223);

// first draw the road/non-road
stroke(255);
for (int y = 0; y < roadMap.ySize; y++) {
for (int x = 0; x < roadMap.xSize; x++) {
if (roadMap.isRoad(x, y)) {
fill(31);
}
else {
fill(223);
}
rect(x*20,y*20,20,20);
}
}

// now draw the buses (numbers)
fill(255);
stroke(255);
for (int i = 0; i < busCount; i++) {
Bus b = buses[i];
text(Integer.toString(b.number), b.getX()*20, b.getY()*20, 20, 20);
}
}

public void keyPressed() {
if (key == ‘ ‘) {
for (int i = 0; i < busCount; i++) {
buses[i].move();
}
}
else if (key == BACKSPACE || key == DELETE) {
if (busCount > 0) {
busCount–;
buses[busCount] = null;
}
}
}

public void mousePressed() {
int x = mouseX / 20;
int y = mouseY / 20;
if (mouseButton == LEFT) {
boolean isClear = true;
for (int i = 0; i < busCount; i++) {
Bus b = buses[i];
if (b.getX() == x && b.getY() == y) {
isClear = false;
break;
}
}
if (isClear) {
roadMap.setRoad(x, y, !roadMap.isRoad(x, y));
}
}

if (mouseButton == RIGHT) {
// is there space for a new bus and is the cell a road?
if ((busCount < buses.length) && (roadMap.isRoad(x, y))) {
// and, is it clear (no bus)?
boolean isClear = true;
for (int i = 0; i < busCount; i++) {
Bus b = buses[i];
if (b.getX() == x && b.getY() == y) {
isClear = false;
break;
}
}
if (isClear) {
buses[busCount] = new Bus(busCount, roadMap, x, y);
busCount++;
}
}
}
}
}
—————————————————————————
Bus.java
———————————-
import java.awt.Point;

public class Bus {
public final int number;
private final RoadMap roadMap;
private int x;
private int y;
Point movedLastTurn;

public Bus(int number, RoadMap roadMap, int x, int y) {
this.number = number;
this.roadMap = roadMap;
this.x = x;
this.y = y;
movedLastTurn = new Point(0,0);
}

public int getX() {
return x;
}

public int getY() {
return y;
}

//Right, left back, stop
public void move() {
if(movedLastTurn.equals(new Point(0,0))){
if(doesNorthExist()) moveNorth();
else if(doesSouthExist()) moveSouth();
else if(doesEastExist()) moveEast();
else if(doesWestExist()) moveWest();
}else{
if(movedLastTurn.getY() == -1.0){
if(doesNorthExist()) moveNorth();
else if(doesEastExist()) moveEast();
else if(doesWestExist()) moveWest();
else if(doesSouthExist()) moveSouth();
else movedLastTurn = new Point(0,0);
}
else if(movedLastTurn.getY() == 1.0){
if(doesSouthExist()) moveSouth();
else if(doesWestExist()) moveWest();
else if(doesEastExist()) moveEast();
else if(doesNorthExist()) moveNorth();
else movedLastTurn = new Point(0,0);
}
else if(movedLastTurn.getX() == -1.0){
if(doesWestExist()) moveWest();
else if(doesNorthExist()) moveNorth();
else if(doesSouthExist()) moveSouth();
else if(doesEastExist()) moveEast();
else movedLastTurn = new Point(0,0);
}
else if(movedLastTurn.getX() == 1.0){
if(doesEastExist()) moveEast();
else if(doesSouthExist()) moveSouth();
else if(doesNorthExist()) moveNorth();
else if(doesWestExist()) moveWest();
else movedLastTurn = new Point(0,0);
}
}
}

private void moveSouth(){
y++;
movedLastTurn = new Point(0,1);
}

private void moveNorth(){
y–;
movedLastTurn = new Point(0,-1);
}

private void moveEast(){
x++;
movedLastTurn = new Point(1,0);
}

private void moveWest(){
x–;
movedLastTurn = new Point(-1,0);
}

private boolean doesNorthExist(){
return ( y-1>=0 && roadMap.isRoad(x, y-1));
}

private boolean doesSouthExist(){
return (y+ 1 <= roadMap.ySize && roadMap.isRoad(x, y+1));
}

private boolean doesEastExist(){
return (x + 1 <= roadMap.xSize && roadMap.isRoad(x+1,y));
}

private boolean doesWestExist(){
return (x – 1 >= 0 && roadMap.isRoad(x-1, y));
}
}
—————————————————————————
RoadMap.java
—————————————–
public class RoadMap {
public final int xSize;
public final int ySize;
private final boolean[][] isRoad;

public RoadMap(int x, int y) {
isRoad = new boolean[x][y];
xSize = x;
ySize = y;
}

public static RoadMap fromString(String s) {
String[] lines = s.trim().split(“\s+”);
final int xSize = lines[0].length();
final int ySize = lines.length;

RoadMap roadMap = new RoadMap(xSize, ySize);
for (int y = 0; y < ySize; y++) {
for (int x = 0; x < xSize; x++) {
if (lines[y].charAt(x) == ‘.’) {
roadMap.isRoad[x][y] = true;
}
}
}

return roadMap;
}

public String toString() {
StringBuilder sb = new StringBuilder();
for (int y = 0; y < ySize; y++) {
for (int x = 0; x < xSize; x++) {
if (isRoad[x][y]) {
sb.append(‘.’);
} else {
sb.append(‘X’);
}
}
sb.append(‘n’);
}
return sb.substring(0, sb.length() – 1);
}

public boolean isRoad(int x, int y) {
if(x>= xSize || y>=ySize || x<0 || y<0) return false;
else return isRoad[x][y];
}

public void setRoad(int x, int y, boolean isRoad) {
this.isRoad[x][y] = isRoad;
}

}
—————————————————————
BusTest.java
——————————
import static org.junit.Assert.*;

import org.junit.Test;

public class BusTest {

@Test
public void testConstructor() {
Bus b = new Bus(1, new RoadMap(0, 0), 2, 3);
assertEquals(1, b.number);
assertEquals(2, b.getX());
assertEquals(3, b.getY());
}

@Test
public void testMoveNorthFromStop() {
Bus b = new Bus(0, RoadMap.fromString(“X.X X.X X.X”), 1, 2);
assertEquals(1, b.getX());
assertEquals(2, b.getY());
b.move();
assertEquals(1, b.getX());
assertEquals(1, b.getY());
}

@Test
public void testMoveNorthTwice() {
Bus b = new Bus(0, RoadMap.fromString(“X.X X.X X.X”), 1, 2);
assertEquals(1, b.getX());
assertEquals(2, b.getY());
b.move();
assertEquals(1, b.getX());
assertEquals(1, b.getY());
b.move();
assertEquals(1, b.getX());
assertEquals(0, b.getY());
}

@Test
public void testMoveNorthThenEastOneWay() {
Bus b = new Bus(0, RoadMap.fromString(“XXX X.. X.X”), 1, 2);
assertEquals(1, b.getX());
assertEquals(2, b.getY());
b.move();
assertEquals(1, b.getX());
assertEquals(1, b.getY());
b.move();
assertEquals(2, b.getX());
assertEquals(1, b.getY());
}

@Test
public void testMoveSouthThenWestAtTee() {
Bus b = new Bus(0, RoadMap.fromString(“X.X … XXX”), 1, 0);
assertEquals(1, b.getX());
assertEquals(0, b.getY());
b.move();
assertEquals(1, b.getX());
assertEquals(1, b.getY());
b.move();
assertEquals(0, b.getX());
assertEquals(1, b.getY());
}
}
————————————————————————-
RoadMapTest.java
——————————————
import static org.junit.Assert.*;

import org.junit.Test;

public class RoadMapTest {
@Test
public void testConstructor() {
RoadMap r = new RoadMap(1,1);
assertNotNull(r);
}

@Test
public void testFromString() {
RoadMap r = RoadMap.fromString(“… ” +
“.X. ” +
“X.X”);
assertTrue(r.isRoad(0, 0));
assertTrue(r.isRoad(1, 0));
assertTrue(r.isRoad(2, 0));
assertTrue(r.isRoad(0, 1));
assertFalse(r.isRoad(1, 1));
assertTrue(r.isRoad(2, 1));
assertFalse(r.isRoad(0, 2));
assertTrue(r.isRoad(1, 2));
assertFalse(r.isRoad(2, 2));
}

@Test
public void testToString() {
RoadMap r = RoadMap.fromString(“X.X … .X.”);
assertEquals(“X.Xn…n.X.”, r.toString());
}

@Test
public void testSetRoad() {
RoadMap r = new RoadMap(2,2);
assertFalse(r.isRoad(0, 1));
r.setRoad(0, 1, true);
assertTrue(r.isRoad(0, 1));
r.setRoad(0, 1, false);
assertFalse(r.isRoad(0, 1));
}
}

Homework Ocean
Calculate your paper price
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

Essays

Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

Admissions

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Reviews

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Reviews

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.

× Contact Live Agents