public Locale dequeue() throws Exception {
		Locale retVal = null;
		// Check for underflow.

		if (!this.isEmpty()) {
			retVal = arr[frontPtr];
			// Shift every element towards the front.
			for (int i = 0; i < backPtr; i++) {
				arr[i] = arr[i + 1];
			}
			// Reinitialize the last element
			arr[backPtr] = null;
			// shift the back pointer towards the front.
			backPtr--;
		} else {
			// In case of underflow, throw an underflow exception.
			throw new Exception();

		}
		return retVal;
	}