fin tp piles

DEV3.2/TP04/01_Arithmetique/Main.java

@@ -0,0 +1,38 @@
+import java.awt.*;
+import java.util.ArrayDeque;
+
+public class Main {
+	public static void main(String[] args) {
+		ArrayDeque<String> pile = new ArrayDeque<>(args.length);
+
+		for (int i = 0; i != args.length; i++) {
+			try {
+				Integer.parseInt(args[i]);
+				pile.addFirst(args[i]);
+			} catch (NumberFormatException e) {
+				int n2 = Integer.parseInt(pile.removeFirst());
+				int n1 = Integer.parseInt(pile.removeFirst());
+				System.out.println(n2);
+				System.out.println(n1);
+
+				switch (args[i]) {
+					case "+":
+						pile.addFirst(n1 + n2 + "");
+						break;
+					case "-":
+						pile.addFirst(n1 - n2 + "");
+						break;
+					case "x":
+						pile.addFirst(n1 * n2 + "");
+						break;
+					case "/":
+						pile.addFirst(n1 / n2 + "");
+				}
+			}
+		}
+
+		System.out.println("= " + pile.removeFirst());
+
+
+	}
+}

DEV3.2/TP04/02_Chaine/Main.java

@@ -0,0 +1,37 @@
+import java.awt.*;
+
+public class Main {
+	public static void main(String[] args) {
+		PileChainee<String> pile = new PileChainee<>();
+
+		for (int i = 0; i != args.length; i++) {
+			try {
+				Integer.parseInt(args[i]);
+				pile.addFirst(args[i]);
+			} catch (NumberFormatException e) {
+				int n2 = Integer.parseInt(pile.removeFirst());
+				int n1 = Integer.parseInt(pile.removeFirst());
+				System.out.println(n2);
+				System.out.println(n1);
+
+				switch (args[i]) {
+					case "+":
+						pile.addFirst(n1 + n2 + "");
+						break;
+					case "-":
+						pile.addFirst(n1 - n2 + "");
+						break;
+					case "x":
+						pile.addFirst(n1 * n2 + "");
+						break;
+					case "/":
+						pile.addFirst(n1 / n2 + "");
+				}
+			}
+		}
+
+		System.out.println("= " + pile.removeFirst());
+
+
+	}
+}

DEV3.2/TP04/02_Chaine/Pile.java

@@ -0,0 +1,6 @@
+public interface Pile<E> {
+
+	void addFirst(E element);
+	E removeFirst();
+	boolean isEmpty();
+}

DEV3.2/TP04/02_Chaine/PileChainee.java

@@ -0,0 +1,52 @@
+public class PileChainee<E> implements Pile<E> {
+
+	protected E valeur;
+	protected PileChainee<E> suivant;
+
+	public PileChainee() {
+		this.valeur = null;
+		this.suivant = null;
+	}
+
+	public PileChainee(E element) {
+		this.valeur = element;
+		this.suivant = null;
+	}
+
+	@Override
+	public void addFirst(E element) {
+		if (this.isEmpty()) {
+			this.valeur = element;
+		} else {
+			PileChainee<E> nouveau = new PileChainee<>();
+			nouveau.valeur = this.valeur;
+			nouveau.suivant = this.suivant;
+			this.valeur = element;
+			this.suivant = nouveau;
+		}
+	}
+
+	@Override
+	public E removeFirst() {
+		if (this.isEmpty()) {
+			throw new IllegalStateException("Pile vide");
+		} else {
+			if (this.suivant == null) {
+				E temp = this.valeur;
+				this.valeur = null;
+				return temp;
+			} else {
+				E temp = this.valeur;
+				this.valeur = this.suivant.valeur;
+				this.suivant = this.suivant.suivant;
+				return temp;
+			}
+		}
+	}
+
+	@Override
+	public boolean isEmpty() {
+		return (this.valeur == null);
+	}
+
+}

DEV3.2/TP04/03_Tableau/Main.java

@@ -0,0 +1,37 @@
+import java.awt.*;
+
+public class Main {
+	public static void main(String[] args) {
+		PileTableau<String> pile = new PileTableau<>();
+
+		for (int i = 0; i != args.length; i++) {
+			try {
+				Integer.parseInt(args[i]);
+				pile.addFirst(args[i]);
+			} catch (NumberFormatException e) {
+				int n2 = Integer.parseInt(pile.removeFirst());
+				int n1 = Integer.parseInt(pile.removeFirst());
+				System.out.println(n2);
+				System.out.println(n1);
+
+				switch (args[i]) {
+					case "+":
+						pile.addFirst(n1 + n2 + "");
+						break;
+					case "-":
+						pile.addFirst(n1 - n2 + "");
+						break;
+					case "x":
+						pile.addFirst(n1 * n2 + "");
+						break;
+					case "/":
+						pile.addFirst(n1 / n2 + "");
+				}
+			}
+		}
+
+		System.out.println("= " + pile.removeFirst());
+
+
+	}
+}

DEV3.2/TP04/03_Tableau/Pile.java

@@ -0,0 +1,6 @@
+public interface Pile<E> {
+
+	void addFirst(E element);
+	E removeFirst();
+	boolean isEmpty();
+}

DEV3.2/TP04/03_Tableau/PileTableau.java

@@ -0,0 +1,35 @@
+public class PileTableau<E> implements Pile<E> {
+
+	protected E[] elements;
+
+	public PileTableau() {
+		this.elements = (E[]) new Object[16];
+	}
+
+	@Override
+	public void addFirst(E element) {
+		E[] nouveau = (E[]) new Object[16];
+		nouveau[0] = element;
+		for (int i = 0; i != this.elements.length-1; i++) {
+			nouveau[i+1] = this.elements[i]; 
+		}
+		this.elements = nouveau;
+	}
+
+	@Override
+	public E removeFirst() {
+		E[] nouveau = (E[]) new Object[16];
+		E temp = this.elements[0];
+		for (int i = 1; i != this.elements.length; i++) {
+			nouveau[i-1] = this.elements[i];
+		}
+		this.elements = nouveau;
+		return temp;
+	}
+
+	@Override
+	public boolean isEmpty() {
+		return (this.elements[0] == null);
+	}
+
+}