Fixed event exitpoint computation

Author: merendamattia

src/main/java/it/unipr/analysis/AbstractStack.java

@@ -203,16 +203,24 @@ public boolean equals(Object obj) {
 	}
 
 	/**
-	 * Get a specific element of the stack.
+	 * Retrieves the element from the stack at the specified position. The
+	 * position is calculated from the top of the stack, where the top is at
+	 * position 1. If the stack state is {@code BOTTOM},
+	 * {@code StackElement.BOTTOM} is returned. If the stack state is
+	 * {@code TOP}, {@code StackElement.TOP} is returned.
 	 *
-	 * @param index the index of the element
-	 * 
-	 * @return the StackElement at the given index, or BOTTOM if out of bounds
+	 * @param position the position of the element to retrieve from the stack
+	 *
+	 * @return the element at the specified position in the stack
 	 */
-	public StackElement get(int index) {
-		if (index < 0 || index >= STACK_LIMIT) // not valid index
+	public StackElement getElementAtPosition(int position) {
+		if (position < 1 || position > STACK_LIMIT)
+			throw new IllegalArgumentException("Invalid position: " + position);
+		if (isBottom())
 			return StackElement.BOTTOM;
-		return circularArray[(head + index) % STACK_LIMIT];
+		else if (isTop())
+			return StackElement.TOP;
+		return circularArray[(tail - position + STACK_LIMIT) % STACK_LIMIT];
 	}
 
 	@Override

src/main/java/it/unipr/analysis/Number.java

@@ -6,7 +6,7 @@
 /**
  * Custom class representing a number that can be implemented as an {@code int},
  * {@code long}, or {@code BigInteger}.
- * 
+ *
  * @author <a href="mailto:[email protected]">Vincenzo Arceri</a>
  * @author <a href="mailto:[email protected]">Mattia
  *             Merenda</a>
@@ -30,7 +30,7 @@ public enum Type {
 
 	/**
 	 * Builds a number starting from an integer value.
-	 * 
+	 *
 	 * @param i the integer value
 	 */
 	public Number(int i) {
@@ -50,7 +50,7 @@ public Number(BigInteger other) {
 
 	/**
 	 * Yields the backing implementation of the number.
-	 * 
+	 *
 	 * @return the backing implementation of the number
 	 */
 	public Type getType() {
@@ -62,7 +62,7 @@ public Type getType() {
 
 	/**
 	 * Yields the integer value.
-	 * 
+	 *
 	 * @return the integer value
 	 */
 	public int getInt() {
@@ -71,7 +71,7 @@ public int getInt() {
 
 	/**
 	 * Yields the big integer value.
-	 * 
+	 *
 	 * @return the big integer value
 	 */
 	public BigInteger getBigInteger() {
@@ -90,9 +90,9 @@ public static BigInteger toBigInteger(Number other) {
 
 	/**
 	 * Adds two numbers and returns the result as a {@code Number}.
-	 * 
+	 *
 	 * @param other the number to add
-	 * 
+	 *
 	 * @return the sum as a {@code Number}
 	 */
 	public Number add(Number other) {
@@ -107,9 +107,9 @@ public Number add(Number other) {
 
 	/**
 	 * Subtracts another number from this one and returns the result.
-	 * 
+	 *
 	 * @param other the number to subtract
-	 * 
+	 *
 	 * @return the result as a {@code Number}
 	 */
 	public Number subtract(Number other) {
@@ -124,9 +124,9 @@ public Number subtract(Number other) {
 
 	/**
 	 * Multiplies this number by another.
-	 * 
+	 *
 	 * @param other the number to multiply by
-	 * 
+	 *
 	 * @return the product as a {@code Number}
 	 */
 	public Number multiply(Number other) {
@@ -137,9 +137,9 @@ public Number multiply(Number other) {
 
 	/**
 	 * Multiplies this number by another.
-	 * 
+	 *
 	 * @param other the number to multiply by
-	 * 
+	 *
 	 * @return the product as a {@code Number}
 	 */
 	public Number divide(Number other) {
@@ -153,9 +153,9 @@ public Number divide(Number other) {
 
 	/**
 	 * Performs bitwise AND between two numbers.
-	 * 
+	 *
 	 * @param other the number to AND with
-	 * 
+	 *
 	 * @return the result as a {@code Number}
 	 */
 	public Number and(Number other) {
@@ -166,9 +166,9 @@ public Number and(Number other) {
 
 	/**
 	 * Performs bitwise OR between two numbers.
-	 * 
+	 *
 	 * @param other the number to OR with
-	 * 
+	 *
 	 * @return the result as a {@code Number}
 	 */
 	public Number or(Number other) {
@@ -179,9 +179,9 @@ public Number or(Number other) {
 
 	/**
 	 * Performs bitwise XOR between two numbers.
-	 * 
+	 *
 	 * @param other the number to XOR with
-	 * 
+	 *
 	 * @return the result as a {@code Number}
 	 */
 	public Number xor(Number other) {
@@ -204,7 +204,7 @@ public Number not() {
 	 * Computes the modulo of this number by another number.
 	 *
 	 * @param other the number to divide by
-	 * 
+	 *
 	 * @return the result as a {@code Number}
 	 */
 	public Number modulo(Number other) {
@@ -215,7 +215,7 @@ public Number modulo(Number other) {
 
 	/**
 	 * Converts this number into a byte array.
-	 * 
+	 *
 	 * @return the byte array representation
 	 */
 	public byte[] toByteArray() {
@@ -225,9 +225,9 @@ public byte[] toByteArray() {
 
 	/**
 	 * Shifts this number right by a specified number of bits.
-	 * 
+	 *
 	 * @param other the number of positions to shift
-	 * 
+	 *
 	 * @return the shifted number
 	 */
 	public Number shiftRight(int other) {
@@ -237,9 +237,9 @@ public Number shiftRight(int other) {
 
 	/**
 	 * Shifts this number left by a specified number of bits.
-	 * 
+	 *
 	 * @param other the number of positions to shift
-	 * 
+	 *
 	 * @return the shifted number
 	 */
 	public Number shiftLeft(int other) {
@@ -258,6 +258,15 @@ public String toString() {
 		return i + "";
 	}
 
+	/**
+	 * Converts this number to a hexadecimal string representation.
+	 *
+	 * @return the hexadecimal string representation of this number
+	 */
+	public String toHexString() {
+		return toBigInteger(this).toString(16);
+	}
+
 	@Override
 	public int compareTo(Number other) {
 		if (getType() == other.getType()) {