package game;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Random;

/**
 * Created by Jannik on 05.05.15.
 */
public class PlayingField {

    private final static int PLAYING_FIELD_LENGTH = 16;
    private final static int CAMEL_AMOUNT = 5;

    private PlayingFieldSlot[] playingField;

    private List<Integer> diceColorsList;

    private final static int RED_CAMEL = 0;
    private final static int BLUE_CAMEL = 1;
    private final static int YELLOW_CAMEL = 2;
    private final static int GREEN_CAMEL = 3;
    private final static int WHITE_CAMEL = 4;

    public PlayingField(){
        resetDice();
        playingField = new PlayingFieldSlot[PLAYING_FIELD_LENGTH];
    }

    /*******************/
    /*Getter und Setter*/
    /*******************/

    public void setPlayingField(PlayingFieldSlot[] playingField){
        this.playingField = playingField;
    }

    public PlayingFieldSlot[] getPlayingField(){
        return playingField;
    }

    /***************/
    /*Init Methoden*/
    /***************/

    public void initiatePlayingField(){
        for (int i = 0; i < PLAYING_FIELD_LENGTH; i++){
            playingField[i] = new PlayingFieldSlot();
        }
        for (int i = 0; i < CAMEL_AMOUNT; i++){
            int position = rollDiceNumber();
            playingField[position].camelOrder.add(new Camel(rollDiceColor(), position));
        }
    }

    /*********/
    /*Helper*/
    /********/

    public int locateCamelIndex(int color){
        int index = 0;
        for (int i = 0; i < getPlayingField().length; i++) {
            for (int j = 0; j < getPlayingField()[i].camelOrder.size(); j++) {
                if (getPlayingField()[i].camelOrder.contains(color)) {
                    index = getPlayingField()[i].camelOrder.indexOf(color);
                    return index;
                }
            }
        }
        return -1; // -1 -> not found
    }

    public int locateCamelSlot(int color) {
        for (int i = 0; i < getPlayingField().length; i++) {
            for (int j = 0; j < getPlayingField()[i].camelOrder.size(); j++) {
                if (getPlayingField()[i].camelOrder.contains(color)) {
                    return i;
                }
            }
        }
        return -1; // -1 -> not found
    }


    /**************/
    /*Würfel-Logik*/
    /**************/

    public Integer rollDiceColor(){
        Random rand = new Random();
        if (diceColorsList.size() > 0) {
            int n = rand.nextInt(diceColorsList.size());
            int color = diceColorsList.get(n);
            diceColorsList.remove(n);
            return color;
        } else {
            return 0;
        }
    }

    public int rollDiceNumber(){
        Random rand = new Random();
        int n = rand.nextInt(3)+1;
        return n;
    }

    public void resetDice(){
        diceColorsList = new ArrayList<Integer>(Arrays.asList(RED_CAMEL, BLUE_CAMEL, YELLOW_CAMEL, GREEN_CAMEL, WHITE_CAMEL));
    }

}