static int getInitialCapacity(int capacity) {
		if (capacity < 0)
			throw new IllegalArgumentException("Illegal Capacity: " + capacity);
		if (capacity > LinearProbing.MAXIMUM_CAPACITY)
			capacity = LinearProbing.MAXIMUM_CAPACITY;
		// Find a power of 2 >= initialCapacity
		int result = 1;
		while (result < capacity)
			result <<= 1;
		return result;
	}
static int getInitialCapacity(int capacity) {
		if (capacity < 0)
			throw new IllegalArgumentException("Illegal Capacity: " + capacity);
		if (capacity > LinearProbing.MAXIMUM_CAPACITY)
			capacity = LinearProbing.MAXIMUM_CAPACITY;
		
		int result = 1;
		while (result < capacity)
			result <<= 1;
		return result;
	}
static int getInitialCapacity ( int capacity ) { if ( capacity < 0 ) throw new IllegalArgumentException ( "Illegal Capacity: " + capacity ) ; if ( capacity > LinearProbing . MAXIMUM_CAPACITY ) capacity = LinearProbing . MAXIMUM_CAPACITY ; // Find a power of 2 >= initialCapacity int result = 1 ; while ( result < capacity ) result <<= 1 ; return result ; }
Computes the initial capacity of the table for storing elements. The
capacity is the largest power of two that does not exceed the given value
or {@link #MAXIMUM_CAPACITY}.

@param capacity
the input value used as a guideline
@return the largest power of two that does not exceed the given value or
{@link #MAXIMUM_CAPACITY}
Computes the initial capacity of the table for storing elements . The capacity is the largest power of two that does not exceed the given value or { @link #MAXIMUM_CAPACITY } .