Migliroato positions e agiunto come metodo alla interfaccia position. Fixato alcuni bug. Aggiunto test della prova intercorso del 10/4/14. Bisogna implementare tree

This commit is contained in:
2014-04-10 00:21:49 +02:00
parent 0956f6b92f
commit cafb12ea9f
13 changed files with 499 additions and 90 deletions

View File

@@ -31,6 +31,15 @@ public class ArraySequenceTest {
System.out.print(it.next());
System.out.print(it.hasNext());
System.out.print("\n");
Iterator<Position<test_object>> itp = a.positions().iterator();
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
}

View File

@@ -63,14 +63,34 @@ 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().);
System.out.print("\n");
Iterator<Position<Integer>> itp = a.positions().iterator();
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
System.out.print(itp.next().element());
System.out.print(itp.hasNext());
}