checks if there is at least buffer.length / 2 contiguous space in range low +1 . . high-1 available concode_field_sep Lock lock concode_elem_sep long high concode_elem_sep long low concode_elem_sep int num_removes concode_elem_sep T[] buffer concode_elem_sep int removes_till_compaction concode_field_sep long add concode_elem_sep RequestTable<T> grow concode_elem_sep boolean compact concode_elem_sep int removesTillCompaction concode_elem_sep RequestTable<T> removesTillCompaction concode_elem_sep RequestTable<T> forEach concode_elem_sep String dumpContents concode_elem_sep int highestContiguousSpaceAvailable concode_elem_sep RequestTable<T> clear concode_elem_sep RequestTable<T> clear concode_elem_sep int index concode_elem_sep int index concode_elem_sep T remove concode_elem_sep int capacity concode_elem_sep long high concode_elem_sep boolean _compact concode_elem_sep RequestTable<T> forEachNonBlocking concode_elem_sep RequestTable<T> removeMany concode_elem_sep int size concode_elem_sep long low concode_elem_sep T get concode_elem_sep void _grow concode_elem_sep String toString concode_elem_sep boolean visit concode_elem_sep void _copy concode_elem_sep boolean _contiguousSpaceAvailable concode_elem_sep void advanceLow
boolean function ( ) { lock . lock ( ) ; try { return _contiguousSpaceAvailable ( buffer . length >> 1 ) ; } finally { lock . unlock ( ) ; } }