/*
 * File: BanishWinter.java
 * -----------------------
 * The BanishWinter subclass gets Karel adorn a series
 * of trees with a cluster of beeper leaves.
 */

import stanford.karel.*;

public class BanishWinter extends SuperKarel {

	/**
	 * Method: Run
	 * -----------
	 * Program start execution here 
	 */
	public void run() {
		// assumes that there are four trees in the world.
		for(int i = 0; i < 4; i++) {
			findTree();
			addLeavesToTree();
		}
	}

	/**
	 * Method: Find Tree
	 * ------------------
	 * Moves Karel up to the next tree.
	 * 
	 * Programming style note: Since a tree is simply a wall,
	 * this method can simply call moveToWall.  You could
	 * therefore replace the findTree call in the main program
	 * with moveToWall, but the program might then be harder to
	 * read because it violates the "tree" metaphor used at the
	 * level of the main program.
	 */
	private void findTree() {
		moveToWall();
	}

	/**
	 * Method: Add Leaves To Tree
	 * -------------------
	 * Adorns a single tree with a cluster of leaves.  The
	 * precondition is that Karel must be immediately
	 * west of the tree, facing east; the postcondition is
	 * that Karel is at the bottom of the other side of the
	 * tree, facing east.
	 */
	private void addLeavesToTree() {
		turnLeft();
		climbTree();
		addLeaves();
		descendToGround();
		turnLeft();
	}

	/**
	 * Method: Climb Tree
	 * ------------------
	 * Climbs to the top of the tree. Assumes Karel is facing
	 * north before the method is called. Karel will still be
	 * facing north in the postcondition.
	 */
	private void climbTree() {
		while (rightIsBlocked()) {
			move();
		}
	}

	/**
	 * Method: Descend To Ground
	 * -------------------------
	 * Moves Karel back to the ground.  Both the pre- and
	 * postconditions have Karel facing south.
	 */
	private void descendToGround() {
		moveToWall();
	}

	/**
	 * Method: Add Leaves
	 * ------------------
	 * Creates the cluster of leaves at the top of a tree.
	 * The precondition is that Karel must be facing north at
	 * the top of the tree; the postcondition is that Karel
	 * is still at the top, but on the other side of the
	 * trunk, facing south.
	 */
	private void addLeaves() {
		turnRight();
		makeBeeperSquare();
		move();
		turnRight();
	}

	/**
	 * Method: Move To Wall
	 * --------------------
	 * Moves Karel forward until it is blocked by a wall.
	 */
	private void moveToWall() {
		while (frontIsClear()) {
			move();
		}
	}

	/**
	 * Method: Make Beeper Square
	 * --------------------
	 * Creates a square of four beepers, leaving Karel in its
	 * original orientation.  The resulting square is positioned
	 * ahead and to the left of Karel's starting position.
	 */
	private void makeBeeperSquare() {
		for (int i = 0; i < 4; i++) {
			putBeeper();
			move();
			turnLeft();
		}
	}

}