Implementato HeapAdaptablePriorityQueue mediante heap. Implementato SortedListAdaptablePriorityQueue estendendo SortedListPriorityQueue utilizzando l'interfacciaAdaptablePriorityQueue . L'implementazione di entrambi una una classe LocationAwareEntry estensione di Entry.

com/xgiovio/SortedListAdaptablePriorityQueueTest.java

@@ -0,0 +1,60 @@
+package com.xgiovio;
+
+import priorityqueue.Entry;
+import priorityqueue.SortedListAdaptablePriorityQueue;
+import priorityqueue.SortedListPriorityQueue;
+
+import java.security.InvalidKeyException;
+
+/**
+ * Created with MONSTER.
+ * User: xgiovio
+ * Date: 02/04/2014
+ * Time: 00:10
+ */
+public class SortedListAdaptablePriorityQueueTest {
+
+    public static void main(String[] args) throws InvalidKeyException{
+
+
+    SortedListAdaptablePriorityQueue<Integer,String> a = new SortedListAdaptablePriorityQueue<Integer, String>();
+    a.insert(5,"hello");
+        System.out.print(a.size());
+    System.out.print(a);
+        a.insert(11,"sdas");
+        System.out.print(a.size());
+
+        a.insert(21,"sdas");
+        a.insert(1,"sdas");
+        a.insert(-10,"slkjldas");
+
+        System.out.print(a);
+        System.out.print(a.size());
+        a.insert(21,"sdas");
+        a.insert(1,"sdas");
+        a.insert(-10,"slkjldas");
+        System.out.print(a);
+        System.out.println(a.size());
+
+        a.insert(3,"ale");
+        System.out.println(a);
+        Entry<Integer,String> t =  a.insert(20, "ale");
+        System.out.println(a);
+
+        a.replaceKey(t,-5);
+        System.out.println(a);
+
+        a.replaceKey(t,-20);
+        System.out.println(a);
+
+        a.replaceKey(t,30);
+        System.out.println(a);
+
+        a.replaceValue(t,"yoo");
+        System.out.println(a);
+
+
+
+    }
+
+}