Method insertLast

Java/design-circular-deque.java:47–69

Adds an item at the rear of Deque. Return true if the operation is successful.

(int value)

      /** Adds an item at the rear of Deque. Return true if the operation is successful. */
      public boolean insertLast(int value) {

        if(this.size == this.capacity) 			//			means queue is full
          return false;

          if(rear == -1) {						//		means queue is empty
            arr[0] = value;						//		add the first element and return true
            front = 0;
            rear = 0;
            this.size ++;
            return true;
          }

          if(rear == this.capacity - 1) {			//		if rear is at last, means we will have to add this element at first
            arr[0] = value;						//		position and make rear as first
            rear = 0;
          }else {
            arr[rear + 1] = value;				//		if rear is not at last, add to rear  + 1 and 
            rear ++;							// 		increment rear
          }
        this.size ++;								//		increase the size and return true
        return true; 
      }

      /** Deletes an item from the front of Deque. Return true if the operation is successful. */
      public boolean deleteFront() {