Working on two types of top kinteger set

lisa-analyzer · Feb 28, 2024 · 5e1a6a8 · 5e1a6a8
1 parent f4ecc25
commit 5e1a6a8
Show file tree

Hide file tree

Showing 6 changed files with 170 additions and 172 deletions.
diff --git a/src/main/java/it/unipr/analysis/AbstractStack.java b/src/main/java/it/unipr/analysis/AbstractStack.java
@@ -140,7 +140,7 @@ public AbstractStack top() {
 		LinkedList<KIntegerSet> result = new LinkedList<>();
 
 		for (int i = 0; i < STACK_LIMIT; i++)
-			result.addLast(KIntegerSet.TOP);
+			result.addLast(KIntegerSet.NUMERIC_TOP);
 
 		return new AbstractStack(result);
 	}
@@ -212,7 +212,7 @@ public AbstractStack clone() {
 	private static LinkedList<KIntegerSet> clone(LinkedList<KIntegerSet> list) {
 		LinkedList<KIntegerSet> result = new LinkedList<>();
 		for (KIntegerSet item : list)
-			result.add(item.copy());
+			result.add(item);
 
 		return result;
 	}
@@ -237,7 +237,7 @@ public KIntegerSet pop() {
 		if (!stack.getFirst().isTop())
 			stack.addFirst(KIntegerSet.BOTTOM);
 		else
-			stack.addFirst(KIntegerSet.TOP);
+			stack.addFirst(KIntegerSet.NUMERIC_TOP);
 		return result;
 
 	}
@@ -294,7 +294,7 @@ public KIntegerSet getSecondElement() {
 		if (isBottom())
 			return KIntegerSet.BOTTOM;
 		else if (isTop())
-			return KIntegerSet.TOP;
+			return KIntegerSet.NUMERIC_TOP;
 		return this.stack.get(STACK_LIMIT - 2);
 	}