55 lines
1.2 KiB
Java
55 lines
1.2 KiB
Java
package modeles;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.List;
|
|
import javafx.util.Pair;
|
|
|
|
public class Salle {
|
|
private Pair<Integer,Integer> coordonnees;
|
|
private boolean sortie;
|
|
private List<Integer> listePorte= new ArrayList<Integer>();
|
|
private List<Integer> listeEnnemie= new ArrayList<Integer>(); //indice de monstre
|
|
|
|
public Salle(int x, int y, boolean out) {
|
|
this.coordonnees=new Pair<Integer,Integer>(x,y);
|
|
this.sortie=out;
|
|
|
|
}
|
|
|
|
public List<Integer> getListeEnnemie() {
|
|
return listeEnnemie;
|
|
}
|
|
|
|
public Salle(int positionX, int positionY, boolean sortie, List<Integer> listeEnnemie) {
|
|
this.coordonnees=new Pair<Integer,Integer>(positionX,positionY);
|
|
this.sortie = sortie;
|
|
this.listeEnnemie = listeEnnemie;
|
|
}
|
|
|
|
public String getType(){
|
|
return "salle";
|
|
}
|
|
|
|
public Pair<Integer,Integer> getCoordonnes() {
|
|
return this.coordonnees;
|
|
}
|
|
|
|
public boolean estSortie() {
|
|
return sortie;
|
|
}
|
|
|
|
public void cle(Labyrinthe lab) {
|
|
if (listeEnnemie.isEmpty()) {
|
|
for (int i : listePorte ) lab.listePorte.get(i).ouverture();
|
|
}
|
|
}
|
|
|
|
public boolean estVide() {
|
|
return listeEnnemie.isEmpty();
|
|
}
|
|
|
|
public List<Integer> getListePorte() {
|
|
return this.listePorte;
|
|
}
|
|
}
|