Dê uma olhada...
http://java.sun.com/products//jdk/1.2/docs/api/index.html
java.util
Class LinkedList
java.lang.Object
|
+--java.util.AbstractCollection
|
+--java.util.AbstractList
|
+--java.util.AbstractSequentialList
|
+--java.util.LinkedList
public class LinkedList
extends AbstractSequentialList
implements List, Cloneable, Serializable
Linked list implementation of the List interface. Implements all optional
list operations, and permits all elements (including null). In addition to
implementing the List interface, the LinkedList class provides uniformly
named methods to get, remove and insert an element at the beginning and end
of the list. These operations allow linked lists to be used as a stack,
queue, or double-ended queue (deque).
All of the stack/queue/deque operations could be easily recast in terms of
the standard list operations. They're included here primarily for
convenience, though they may run slightly faster than the equivalent List
operations.
All of the operations perform as could be expected for a doubly-linked list.
Operations that index into the list will traverse the list from the begining
or the end, whichever is closer to the specified index.
Note that this implementation is not synchronized. If multiple threads
access a list concurrently, and at least one of the threads modifies the
list structurally, it must be synchronized externally. (A structural
modification is any operation that adds or deletes one or more elements;
merely setting the value of an element is not a structural modification.)
This is typically accomplished by synchronizing on some object that
naturally encapsulates the list. If no such object exists, the list should
be "wrapped" using the Collections.synchronizedList method. This is best
done at creation time, to prevent accidental unsynchronized access to the
list:
List list = Collections.synchronizedList(new LinkedList(...));
The iterators returned by the this class's iterator and listIterator methods
are fail-fast: if the list is structurally modified at any time after the
iterator is created, in any way except through the Iterator's own remove or
add methods, the iterator will throw a ConcurrentModificationException.
Thus, in the face of concurrent modification, the iterator fails quickly and
cleanly, rather than risking arbitrary, non-deterministic behavior at an
undetermined time in the future.
Karen
----- Original Message -----
From: Diogo Ruviaro Viegas <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Thursday, March 29, 2001 10:06 AM
Subject: [java-list] Lista
>
>
> Alguem sabe como que eu posso implementar uma lista encadeada ou
> uma lista circular em Java? Estou iniciando neste tipo de programação
> estou tendo esta dificuldade, principalmente que não é igual a C++
> Desde ja agradeço!!
>
>
> ------------------------------ LISTA SOUJAVA ----------------------------
> http://www.soujava.org.br - Sociedade de Usuários Java da Sucesu-SP
> dúvidas mais comuns: http://www.soujava.org.br/faq.htm
> regras da lista: http://www.soujava.org.br/regras.htm
> para sair da lista: envie email para [EMAIL PROTECTED]
> -------------------------------------------------------------------------
>
>
------------------------------ LISTA SOUJAVA ----------------------------
http://www.soujava.org.br - Sociedade de Usuários Java da Sucesu-SP
dúvidas mais comuns: http://www.soujava.org.br/faq.htm
regras da lista: http://www.soujava.org.br/regras.htm
para sair da lista: envie email para [EMAIL PROTECTED]
-------------------------------------------------------------------------
