code: public void addW( int value ) {
  		// see if it needs to grow the queue
  		if( size >= data.length) {
  			data[start] = value;
  			start = (start+1)%data.length;
  		} else {
  			data[(start+size)%data.length] = value;
  			size++;
  		}
  	}
docs: Adds a new element to the queue, but if the queue is full write over the oldest element.
  
  @param value Value which is to be added