//GPL is here.  waste of forum space though.
 
/**
*A single element in a linked list specifically designed
*for hash tables
*of strings.
*
*@author    Metsfan147
*@version   1.0
*/
public class HashListNode implements Cloneable
{
 
    private String data;
    private HashListNode nextNode;
 
    /**
    *Constructor taking a string argument, setting the 
    *node data to that string.
    *@param x   The string to set the node to represent.
    */
    public HashListNode(String x)
    {
        this.data = x;
        this.nextNode = null;
    }
 
    /**
    *Sets the pointer nextNode to the next node in the linked list.
    *@param next    The HashListNode that this one should point to.
    */
    public void setNext(HashListNode next)
    {
        synchronized( this )
        {
            this.nextNode = next;
        }
    }
 
    /**
    *Accessor method that returns a pointer to the next node in the
    *linked list.
    *@return    nextElement The next node in the linked list;
    */
    public HashListNode getNext()
    {
        return this.nextNode;
    }
 
    /**
    *Changes the value of the String that this node holds.
    *@param newString   The string that the node should now represent.
    */
    public void setData(String newString)
    {
        synchronized( this )
        {
            this.data = newString;
        }
    }
 
    /**
    *Returns the string that this node represents.
    *@return data   The string contained in this node.
    */
    public String getData()
    {
        return this.data;
    }
 
    /**
    *Indicates wheter another HashListNode is 'equal' to this one.
    *@param object The object to check this one against.
    *@return Whether this node is equal to node by their String data.
    */
    public boolean equals( Object object )
    {
        boolean result = false;
 
        if( this == object )
        {
            result = true;
        }
 
        else if( object == null || this.getClass() != object.getClass() )
        {
            result = false;
        }
 
        else
        {
            final HashListNode other = (HashListNode) object;
            result = ( this.getData().equals(other.getData() ) );
        }
 
        return result;
    }
 
    /**
    * Returns a hash code value for the node.
    *@return The object's hash code value.
    */
    public int hashCode()
    {
        final int prime = 31;
        int result = 7;
        result = prime * result + ( null == data ? 0 : data.hashCode() );
        result = prime * result + ( null == nextNode ? 0 : nextNode.hashCode());
        return result;
    }
 
    /**
    *Creates and returns a copy of this object.
    *@return A clone of this object.
    *@throws CloneNotSupportedException if the clone interface 
    *is not supported.
    */
    public Object clone() throws CloneNotSupportedException
    {
        final HashListNode theClone = (HashListNode) super.clone();
        if( this.nextNode != null)
        {
            theClone.nextNode = (HashListNode) this.data.clone();
        }
 
        return theClone;
    }
 
}