changed prio to prefer newer elements if two have the same prio

Signed-off-by: bartimaeusnek <33183715+bartimaeusnek@users.noreply.github.com>

Former-commit-id: ff122c58d8ad633486463d56b61c506c1200f62a

1 files changed, 1 insertions, 1 deletions

diff --git a/src/main/java/com/github/bartimaeusnek/bartworks/util/accessprioritylist/AccessPriorityList.java b/src/main/java/com/github/bartimaeusnek/bartworks/util/accessprioritylist/AccessPriorityList.java
index 8f0cd8dd41..bd4482741d 100644
--- a/src/main/java/com/github/bartimaeusnek/bartworks/util/accessprioritylist/AccessPriorityList.java
+++ b/src/main/java/com/github/bartimaeusnek/bartworks/util/accessprioritylist/AccessPriorityList.java
@@ -304,7 +304,7 @@ public class AccessPriorityList<E> implements List<E>, Deque<E>, Set<E> {
             return;
         AccessPriorityListNode<E> node = getNode(index);
         node.setPriority(node.getPriority()+prio);
-        while (node.getBefore() != null && node.getPriority() > node.getBefore().getPriority()){
+        while (node.getBefore() != null && node.getPriority() >= node.getBefore().getPriority()){
                 moveNodeUp(node);
         }
     }