Renamed LinkedList to SimplifiedLinkList and moved it from org.thdl.tib.scanner to org.thdl.util. This linked list was implemented because the VM running on handhelds does not include java.util.LinkedList.

This commit is contained in:
amontano 2003-04-01 13:08:38 +00:00
parent d836b850e8
commit a7a573020f
12 changed files with 65 additions and 50 deletions

View file

@ -0,0 +1,113 @@
/*
The contents of this file are subject to the AMP Open Community License
Version 1.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License on the AMP web site
(http://www.tibet.iteso.mx/Guatemala/).
Software distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
License for the specific terms governing rights and limitations under the
License.
The Initial Developer of this software is Andres Montano Pellegrini. Portions
created by Andres Montano Pellegrini are Copyright 2001 Andres Montano
Pellegrini. All Rights Reserved.
Contributor(s): ______________________________________.
*/
package org.thdl.util;
import java.io.*;
/** Used by {@link LinkedList} to provide the implementation of a
simple dynamic link list.
@author Andrés Montano Pellegrini
@see LinkedList
@see ListIterator
*/
public class Link
{
private Object obj;
public Link siguiente;
public Link(Object obj)
{
this.obj = obj;
siguiente = null;
}
public String toString()
{
return obj.toString();
}
public Link createNext(Object obj)
{
return siguiente = new Link(obj);
}
public Link createPrevious(Object obj)
{
Link l = new Link(obj);
l.siguiente=this;
return l;
}
public Object get()
{
return obj;
}
public Link next()
{
return this.siguiente;
}
public int size()
{
int n=0;
Link actual = this;
while (actual != null)
{
n++;
actual = actual.next();
}
return n;
}
public Object clone()
{
return new Link(obj);
}
public void insertSorted(Link link)
{
if (siguiente==null)
siguiente = link;
else
if (link.toString().compareTo(siguiente.toString())<=0)
{
link.siguiente = siguiente;
siguiente = link;
}
else siguiente.insertSorted(link);
}
public Link sort()
{
Link newCabeza = (Link) clone(), next = next(), newLink;
while (next!=null)
{
newLink = (Link) next.clone();
if (newLink.toString().compareTo(newCabeza.toString())<=0)
{
newLink.siguiente = newCabeza;
newCabeza = newLink;
}
else newCabeza.insertSorted(newLink);
next = next.next();
}
return newCabeza;
}
}

View file

@ -0,0 +1,125 @@
/*
The contents of this file are subject to the AMP Open Community License
Version 1.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License on the AMP web site
(http://www.tibet.iteso.mx/Guatemala/).
Software distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
License for the specific terms governing rights and limitations under the
License.
The Initial Developer of this software is Andres Montano Pellegrini. Portions
created by Andres Montano Pellegrini are Copyright 2001 Andres Montano
Pellegrini. All Rights Reserved.
Contributor(s): ______________________________________.
*/
package org.thdl.util;
import java.util.*;
/** Implementation of a simple dynamic link list. Be careful with word order!
Why not just use java.util.LinkedList? It is not supported for the
handheld's virtual machine.
@author Andr&eacute;s Montano Pellegrini
@see Link
@see SimplifiedListIterator
*/
public class SimplifiedLinkedList
{
protected Link cabeza;
public SimplifiedLinkedList()
{
cabeza=null;
}
private SimplifiedLinkedList(Link cabeza)
{
this.cabeza = cabeza;
}
public void addLast(Object o)
{
if (cabeza==null)
{
cabeza = new Link(o);
}
else cabeza = cabeza.createPrevious(o);
}
public Object getLast()
{
if (cabeza==null) return null;
else return cabeza.get();
}
public SimplifiedListIterator listIterator()
{
return new SimplifiedListIterator(cabeza);
}
public SimplifiedListIterator listIterator(int n)
{
return new SimplifiedListIterator(cabeza, n);
}
public boolean isEmpty()
{
return cabeza==null;
}
public boolean contains(Object o)
{
Link current=cabeza;
while (current!=null)
{
if (current.get().equals(o)) return true;
current = current.next();
}
return false;
}
public int size()
{
if (cabeza==null) return 0;
return cabeza.size();
}
public SimplifiedLinkedList sort()
{
return new SimplifiedLinkedList(cabeza.sort());
}
public Object[] toArray()
{
int n = size();
if (n==0) return null;
Object array[] = new Object[n];
SimplifiedListIterator li = listIterator();
while (li.hasNext())
{
n--;
array[n] = li.next();
}
return array;
}
public String[] toStringArray()
{
int n = size();
if (n==0) return null;
Object o;
String array[] = new String[n];
SimplifiedListIterator li = listIterator();
while (li.hasNext())
{
n--;
o = li.next();
if (o==null) array[n]=null;
else array[n] = o.toString();
}
return array;
}
}

View file

@ -0,0 +1,57 @@
/*
The contents of this file are subject to the AMP Open Community License
Version 1.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License on the AMP web site
(http://www.tibet.iteso.mx/Guatemala/).
Software distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
License for the specific terms governing rights and limitations under the
License.
The Initial Developer of this software is Andres Montano Pellegrini. Portions
created by Andres Montano Pellegrini are Copyright 2001 Andres Montano
Pellegrini. All Rights Reserved.
Contributor(s): ______________________________________.
*/
package org.thdl.util;
import java.util.*;
/** Used by {@link LinkedList} to provide the implementation of a
simple dynamic link list.
@author Andr&eacute;s Montano Pellegrini
@see LinkedList
@see Link
*/
public class SimplifiedListIterator
{
Link current;
public SimplifiedListIterator(Link current)
{
this.current=current;
}
public SimplifiedListIterator(Link current, int n)
{
this(current);
int i;
for (i=0; i<n; i++) current=current.next();
}
public boolean hasNext()
{
return current!=null;
}
public Object next()
{
Object o = current.get();
current = current.next();
return o;
}
}