thdltools/Jskad
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Updated methods to help with the dictionary clean up.

Browse source
This commit is contained in:
amontano 2005-02-06 23:19:44 +00:00
parent 96d0d0d9d0
commit a82afad92c
6 changed files with 128 additions and 54 deletions
Download patch file Download diff file Expand all files Collapse all files

53
source/org/thdl/util/SimplifiedLinkedList.java
View file

@ -30,6 +30,7 @@ import java.util.*;
public class SimplifiedLinkedList
{
protected Link cabeza;
public SimplifiedLinkedList()
{
cabeza=null;
@ -69,6 +70,58 @@ public class SimplifiedLinkedList
temp.siguiente = currentLink;
}
}
/** If the object is already in the list return. It is more efficient since it
assumes that the list is sorted. */
public Object getSorted(Comparable o)
{
Link currentLink = cabeza;
Object currentObject;
int comparison;
while(currentLink != null)
{
currentObject = currentLink.get();
comparison = ((Comparable) currentObject).compareTo(o);
if (comparison==0) return currentObject;
else if(comparison>0) return null;
currentLink = currentLink.next();
}
return null;
}
/** Does not add repetitions. */
public void addSortedUnique (Comparable o)
{
Link previous, currentLink, temp;
int comp;
if (cabeza==null || o.compareTo(cabeza.get())<0)
{
addLast(o);
}
else
{
if (o.compareTo(cabeza.get())==0) return;
currentLink = cabeza;
while (true)
{
previous = currentLink;
currentLink = currentLink.next();
if (currentLink != null)
{
comp = o.compareTo(currentLink.get());
if (comp==0) return;
else if (comp<0) break;
}
else break;
}
temp = new Link (o);
previous.siguiente = temp;
temp.siguiente = currentLink;
}
}
public Object getLast()
{