public class CList<T>
{
    //header of the list
    private CNode<T> header;
    //number of elements in the list
    private int count;
    private String str;
  
    
    //constructor. initialises instance variables
    public CList()
    {
        header = null;
        count = 0;
    }
    
    //return a string that displays the elements
    //in a comma separated list enclosed in brackets
    
    public<T> String toString(CNode<T> header)
    {
        
        if(header==null)
            return null;
        CNode<T> curr =header;
        //start with the left bracket and
        //value of first node
        String str="[" + header.getNodeValue();
        //append all but last node, separating
        //items with a comma polymorphism calls
        //toString() for hte nodeValue type
        
        while(curr!=null)
        {
            curr =  header.getNext();
            str += ","+ header.getNodeValue();
        }
        str +="]";
        return str;
    }
    
    //return true if the circular list is empty
    //and false otherwise
    
    public  boolean isEmpty()
    {
        if(isEmpty())
        {
          return header.getNext() == null;
        }
        return false;

        
    }
    
    //insert item at the front of the circular list
    public void addFirst(T item)
    {
        //to insert, create new node with item a value
        CNode<T> newNode = new CNode<T>(item);
        CNode<T> curr = header;
        
        
        if(isEmpty())
        {   //set the header and the newNode.setNext
            header=newNode;
            newNode.setNext(header);
        }
        else
            ////check if the curr.getNext is not the header
            while(curr.getNext()!=header)
            { //what happen to the curr, newNode.setNext and header
               curr=curr.getNext();
              //post condition: curr is referencing the last node
            
            }
               curr.setNext(newNode);
               newNode.setNext(header);
               header = newNode;
               count++;
    }
    
    //erase the item at the front of the circular list and
    //return its value. return null if the list is empty
    
    public T removeFirst()
    {
        if(header == null)
            return null;
        
       T item = header.getNodeValue();
       header = header.getNext();
       count --;
        
        return item;
    }
    
    //remove all elements from list
    public void clear()
    {
        
    }

}

public  boolean isEmpty()
    {
        if(isEmpty())
        {
          return header.getNext() == null;
        }
        return false;

        
    }

public  boolean isEmpty() {
		
		if( isEmpty() /* call myself*/ )  {
			// you never get here
			// more specifically, you never get to the if condition
			// it just keeps asking and asking and asking...

public  boolean isEmpty()
    {
        if(header==null)
            return true;
        return false;
          
    }

public void addFirst(T item)
    {
        //to insert, create new node with item a value
        CNode<T> newNode = new CNode<T>(item);
        CNode<T> curr = header;
        
        
        if(isEmpty())
        {   //set the header and the newNode.setNext
            header=newNode;
            newNode.setNext(header);
        }
        else
            ////check if the curr.getNext is not the header
            while(curr.getNext()!=header)
            { //what happen to the curr, newNode.setNext and header
               curr=curr.getNext();
              //post condition: curr is referencing the last node
              curr.setNext(newNode);// curr now at newNode
              newNode.setNext(header);//
              header = newNode;
            }
        
              
        count++;
        
    }

public class Main {
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        
        CList<Integer> aList = new CList<Integer>();
        CList<Integer> headerA = new CList<Integer>();
        int t;
        Integer[] arr = {10, 20, 30, 40, 50, 60, 70, 80, 90};
        for(t=0;t<arr.length;t++)
            headerA.addFirst(arr[t]);
        
        System.out.println("The list: " + aList.toString());
        System.out.println("\n Remove first 3 elements in the list");
        
        //use the for loop to remove the first 3 elements
       /* for(int i=0;i<3;i++)
            System.out.println("Removing " + headerA..removeFirst());
        
        System.out.println("Current list" + headerA..toString());
        
        System.out.println("\n Clear List\n");
        headerA..clear();
        
        System.out.println("Resulting list: "+ headerA..toString());*/
        
    }

}