Class LinkedListQ

java.lang.Object
  |
  +--LinkedListQ

public class LinkedListQ
extends java.lang.Object

This is the Linked List Queue that works on the basis of the FIFO principle. New elements are added to the tail and are taken from the head.


Field Summary
 int deep
           
 int len
           
 
Method Summary
 void add(java.lang.Object n)
          Adds a new element to the tail of the list
 LinkedListQ copy()
           
 void DebugLL(java.lang.String Message)
           
 java.lang.Object Find()
           
 ProvisionCell FindProv(java.lang.String LookUp)
           
 java.lang.Object Head()
           
 boolean isEmpty()
          False -- if the list is empty, True -- otherwise
 java.lang.Object nextElement()
          Used to walk through the list Returns the current element's data Sets the pointer to the next element (can be null) If the no more elements -- resets the current pointer
 void PrintList()
           
 void PrintPlist(java.lang.String Message)
           
 void printStrings()
           
 int realSize()
           
 LinkedListQ removeCell(java.lang.String Name)
           
 java.lang.Object removeHead()
          Removes the head element of the list
 LinkedListQ removeString(java.lang.String Name)
           
 void reset()
          Resets the current element pointer to the head of the list
 void resetProvisions()
           
 int size()
          Returns the number of elements in the list
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

len

public int len

deep

public int deep
Method Detail

isEmpty

public boolean isEmpty()
False -- if the list is empty, True -- otherwise


size

public int size()
Returns the number of elements in the list


reset

public void reset()
Resets the current element pointer to the head of the list


add

public void add(java.lang.Object n)
Adds a new element to the tail of the list


removeHead

public java.lang.Object removeHead()
Removes the head element of the list


copy

public LinkedListQ copy()

Head

public java.lang.Object Head()

nextElement

public java.lang.Object nextElement()
Used to walk through the list
  1. Returns the current element's data
  2. Sets the pointer to the next element (can be null)
  3. If the no more elements -- resets the current pointer


PrintList

public void PrintList()

Find

public java.lang.Object Find()

removeCell

public LinkedListQ removeCell(java.lang.String Name)

removeString

public LinkedListQ removeString(java.lang.String Name)

resetProvisions

public void resetProvisions()

printStrings

public void printStrings()

FindProv

public ProvisionCell FindProv(java.lang.String LookUp)

PrintPlist

public void PrintPlist(java.lang.String Message)

DebugLL

public void DebugLL(java.lang.String Message)

realSize

public int realSize()