fixes

com/xgiovio/NodePositionListTest.java

@@ -63,6 +63,11 @@ public class NodePositionListTest {
         System.out.print(it.next());
         System.out.print(it.hasNext());
 
+        System.out.print(a.positions().iterator());
+        System.out.print(it.hasNext());
+        System.out.print(((Position<Integer>)(it.next().);
+
+
 
 
 

position/NodePositionList.java

@@ -198,13 +198,26 @@ public class NodePositionList<E> implements PositionList<E> {
     }
 
 
+     // inception style. a dream in a dream in a dream
 
-    public Iterator<Position<E>> positions() {
+    public Iterable<Position<E>> positions() {
-        return new MyPositionsIterator(this);
+        return new MyPositionsIterable(this);
     }
 
-    class MyPositionsIterator implements Iterator<Position<E>>{
+    class MyPositionsIterable implements Iterable<Position<E>>{
 
+        private NodePositionList<E> base = null;
+
+        public MyPositionsIterable(NodePositionList<E> in){
+              base = in;
+        }
+
+        @Override
+        public Iterator<Position<E>> iterator() {
+            return new MyPositionsIterator(base);
+        }
+
+        class MyPositionsIterator <E> implements Iterator<Position<E>> {
             public MyPositionsIterator (NodePositionList<E> structure){
 
                 new_structure = new NodePositionList<Position<E>>();
@@ -264,7 +277,12 @@ public class NodePositionList<E> implements PositionList<E> {
 
             NodePositionList<Position<E>> new_structure;
             Position<Position<E>> pos = null;
+        }
+
 
 
     }
+
+    // end inception style
+
 }

priorityqueue/SortedListPriorityQueue.java

@@ -55,7 +55,7 @@ public class SortedListPriorityQueue<K,V> implements PriorityQueue<K,V> {
                 data.addFirst(t);
                 return t;
             } else {
-                Iterator<Position<MyEntry<K, V>>> itp = data.positions();
+                Iterator<Position<MyEntry<K, V>>> itp = data.positions().iterator();
                 int status;
                 Position<MyEntry<K, V>> temp_pos = null;
                 for (; itp.hasNext(); ) {

priorityqueue/UnsortedListPriorityQueue.java

@@ -43,7 +43,7 @@ public class UnsortedListPriorityQueue<K,V> implements PriorityQueue<K,V> {
             if (isEmpty()){
                 throw  new EmptyPriorityQueueException();
             } else {
-                Iterator<Position<MyEntry<K, V>>> itp = data.positions();
+                Iterator<Position<MyEntry<K, V>>> itp = data.positions().iterator();
                 int status;
                 Position<MyEntry<K, V>> min = null;
                 Position<MyEntry<K, V>> temp_pos = null;
@@ -83,7 +83,7 @@ public class UnsortedListPriorityQueue<K,V> implements PriorityQueue<K,V> {
         if (isEmpty()){
             throw  new EmptyPriorityQueueException();
         } else {
-            Iterator<Position<MyEntry<K, V>>> itp = data.positions();
+            Iterator<Position<MyEntry<K, V>>> itp = data.positions().iterator();
             int status;
             Position<MyEntry<K, V>> min = null;
             Position<MyEntry<K, V>> temp_pos = null;