All Packages This Package Class Hierarchy Class Search Index
java.lang.Object | +----edu.utah.janos.util.LinkedList
Summary |
public class LinkedList extends java.lang.Object { // Fields 2 private LinkedList.Node head; private LinkedList.Node tail; // Constructors 1 public LinkedList(); // Methods 7 public void addHead(LinkedList.Node); public void addTail(LinkedList.Node); public final LinkedList.Node getHead(); public final LinkedList.Node getTail(); public final boolean isEmpty(); public LinkedList.Node remHead(); public LinkedList.Node remTail(); // Inner Classes 1 public static class LinkedList.Node }
A simple doubly linked list implementation, it exports the node object directly so adding and removing is fast
Fields |
· head | Summary | Top |
private LinkedList.Node head
Points to a dummy node which points to the head of the list
· tail | Summary | Top |
private LinkedList.Node tail
Points to a dummy node which points to the tail of the list
Constructors |
· LinkedList | Summary | Top |
public LinkedList()
Create a linked list
Methods |
· isEmpty | Summary | Top |
public final boolean isEmpty()
Returns true if the list is empty
· getHead | Summary | Top |
public final LinkedList.Node getHead()
Get the head of the list
· getTail | Summary | Top |
public final LinkedList.Node getTail()
Get the tail of the list
· addHead | Summary | Top |
public void addHead(LinkedList.Node node)
Add a node to the head of the list
· addTail | Summary | Top |
public void addTail(LinkedList.Node node)
Add a node to the tail of the list
· remHead | Summary | Top |
public LinkedList.Node remHead()
Remove the node at the head of the list, returns null if its empty
· remTail | Summary | Top |
public LinkedList.Node remTail()
Remove the node at the tail of the list, returns null if its empty
All Packages This Package Class Hierarchy Class Search IndexFreshly brewed Java API Documentation automatically generated with polardoc Version 1.0.7