SquenceQueue by java

class SQueue<Type> {
    int front;
    int rear;
    int size;
    Type[] data;
    
    public SQueue(Type data[]) {
        // TODO Auto-generated constructor stub
        this.data = data;
        front = 0;
        rear = 0;
        size = data.length + 1;
    }
    
    private boolean IsEmpty() {
        return front == rear;
    }
    
    private boolean IsFull() {
        return (rear + 1) % size == front;
    }
    
    public boolean EnSQueu(Type d) {
        if (IsFull())
            return false;
        
        data[rear] = d;
        rear = (rear + 1) % size;
        
        return true;
    }
    
    public Type DeSQueue() {
        if (IsEmpty())
            return null;
        
        Type tmp = data[front];
        front = (front + 1) % size;
        
        return tmp;
    }
    
    public int GetLength() {
        return (rear - front + size) % size;
    }
}

public class SqueueQueue {
    public static void main(String[] args) {
        String data[] = {"hello", " ", "world"};
        String d;
        SQueue<String> q = new SQueue<String>(data);

        for (String string : data) {
            q.EnSQueu(string);
        }
        
        System.out.println("length = " + q.GetLength());
        
        while ((d = q.DeSQueue()) != null) {
            System.out.print(d + " ");
        }
    }
}