T function ( ) { return remove ( false ) ; }
removes the next element at hd +1 . note that this method is not concurrent , as ringbuffer can only have 1 remover thread active at any time ! concode_field_sep Lock lock concode_elem_sep AtomicBoolean processing concode_elem_sep AtomicReferenceArray<T> buf concode_elem_sep long offset concode_elem_sep long current concode_elem_sep long low concode_elem_sep Condition buffer_full concode_elem_sep boolean running concode_elem_sep AtomicLong hr concode_elem_sep AtomicReferenceArray<T> buffer concode_elem_sep long hd concode_field_sep T next concode_elem_sep int spaceUsed concode_elem_sep long[] getDigest concode_elem_sep int capacity concode_elem_sep double saturation concode_elem_sep Iterator<T> iterator concode_elem_sep long getLow concode_elem_sep T get concode_elem_sep List<T> get concode_elem_sep int missing concode_elem_sep boolean block concode_elem_sep long getHighestDelivered concode_elem_sep void validate concode_elem_sep boolean add concode_elem_sep boolean add concode_elem_sep AtomicBoolean getProcessing concode_elem_sep void setHighestDelivered concode_elem_sep int count concode_elem_sep void destroy concode_elem_sep int index concode_elem_sep boolean hasNext concode_elem_sep long getHighestReceived concode_elem_sep List<T> removeMany concode_elem_sep List<T> removeMany concode_elem_sep int size concode_elem_sep void stable concode_elem_sep String toString concode_elem_sep T _get concode_elem_sep SeqnoList getMissing