modified sorting algorythm to skip multiple nodes

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

Former-commit-id: f48a59b9257759308ea7406a457d90adc40f4b02

1 files changed, 1 insertions, 1 deletions

diff --git a/src/main/java/com/github/bartimaeusnek/bartworks/util/selfsortinglist/SSList.java b/src/main/java/com/github/bartimaeusnek/bartworks/util/selfsortinglist/SSList.java
index d320cd8316..439f86b3af 100644
--- a/src/main/java/com/github/bartimaeusnek/bartworks/util/selfsortinglist/SSList.java
+++ b/src/main/java/com/github/bartimaeusnek/bartworks/util/selfsortinglist/SSList.java
@@ -294,7 +294,7 @@ public class SSList<E> implements List<E>, Deque<E>, Set<E> {
         SSListNode<E> node = getNode(index);
         node.setPriority(node.getPriority()+prio);
         if (node.getBefore() != null)
-            if (node.getPriority() > node.getBefore().getPriority()){
+            while (node.getPriority() > node.getBefore().getPriority()){
                 moveNodeUp(node);
         }
     }