xgiovio/unisa_strutture_dati_2013_2014
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Ordered List e BinarySearchTree

Browse Source
This commit is contained in:
Giovanni Di Grezia
2014-05-18 16:47:04 +02:00
parent f1e6f18939
commit 0b0e20baf8
4 changed files with 300 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
utility/merge/MergeTemplate.java
View File

@@ -19,8 +19,8 @@ import java.util.Iterator;
*/
public abstract class MergeTemplate<E> {
PositionList<E> s = new NodePositionList<E>();
Comparator<E> c = null;
protected PositionList<E> s = new NodePositionList<E>();
protected Comparator<E> c = null;
public MergeTemplate (PositionList<E> A, PositionList <E> B){
this(A,B,new DefaultComparator<E>());
@@ -29,29 +29,49 @@ public abstract class MergeTemplate<E> {
public MergeTemplate (PositionList<E> A, PositionList <E> B, Comparator<E> in_c){
c = in_c;
E a,b;
E a = null ,b = null;
Iterator<E> Ait, Bit;
Ait = A.iterator();
Bit = B.iterator();
while (!(Ait.hasNext()) && !(Bit.hasNext())) {
if ( Ait.hasNext() && Bit.hasNext() ){
a = Ait.next();
b= Bit.next();
b = Bit.next();
for (; true; ) {
if ( c.compare(a,b) < 0 )
aIsLess(a);
else if (c.compare(a,b) > 0)
bIsLess(b);
else // se b = a
bothAreEqual(a, b);
if (c.compare(a, b) < 0) {
aIsLess(a);
if (Ait.hasNext())
a = Ait.next();
else
break;
} else {
if (c.compare(a, b) > 0) {
bIsLess(b);
if (Bit.hasNext())
b = Bit.next();
else
break;
} else {// se b = a
bothAreEqual(a, b);
if (Ait.hasNext() && Bit.hasNext()) {
a = Ait.next();
b = Bit.next();
} else
break;
}
}
}
}
while (!(Ait.hasNext())) {
while ( Ait.hasNext() ) {
a = Ait.next();
aIsLess(a);
}
while (!(Bit.hasNext())) {
while ( Bit.hasNext()) {
b = Bit.next();
bIsLess(b);
}