package Zavorky;

public class intFrontaPole {
	
	private int[] F;
	private int zacatek,konec,n;
	
	public intFrontaPole(int delka) {
		this.n = delka+1;
		this.F = new int[n];
		this.zacatek = 0;
		this.konec = 0;
	}
	
	public boolean empty() {
		return (konec==zacatek);
	}
	
	public void push(int klic) {
		F[konec] = klic;
		konec++;
		konec %= n;
	}
	
	public int pop() {
		int i = F[zacatek];
		zacatek++;
		zacatek %= n;
		return i;
	}
	
	public void println() {
		String S = "";
		if (empty()) {
			S = "Fronta je prazdna.";
		} else {
			int i = zacatek;
			while ((i%n)!=konec) {
				S += F[i]+" ";
				i++;
			}
		}
		System.out.println(S.trim());
	}
}