Valid queues for Java data structures

/** * @ Describes ordered pairs of columns * Inserting data from any location is ordered * @ Project name Java_datastruct * @ Package Name Com.java.stack * @ class name Queue * @author Chenlin * @date
    June 5, 2011 Afternoon 8:12:47 * * public class Sequequeue {private long[] arr;
        private int maxsize;//maximum space private int len;//valid length public sequequeue (int size) {this.maxsize = size;
        This.arr = new Long[maxsize];
    This.len = 0;
        /** * Insert Data * * @param value */public void Insert (Long value) {int i;
            for (i = 0; i < len; i++) {//Get I if (Value > Arr[i]) {break;
        }///move data, move the previous data back one for (int j = len; j > i; j--) {arr[j] = arr[j-1];
        } Arr[i] = value;
    Len + +;
     /** * Remove data, remove the last one at a time, length--array from 0 to len-1;
        */Public long Remove () {Long value = arr[len-1];
        Len--;
    return value; 
   /** * Determine if it is empty *  * @return/public Boolean isempty () {return (len = = 0);
    /** * Judge whether full * * @return/public boolean isfull () {return (len = = maxSize);
    /** * Gets the valid length of the queue * * @return/public int size () {return len;
        public static void Main (string[] args) {sequequeue queue = new Sequequeue (8);
        Queue.insert (22);
        Queue.insert (33);
        Queue.insert (44);
        Queue.insert (534);
        Queue.insert (21);

        Queue.insert (55);
        while (!queue.isempty ()) {System.out.println (Queue.remove ()); }


    }
}