void function ( HeapElement arg0 ) { if ( arg0 . shift ( ) ) { queue . add ( arg0 ) ; } else if ( arg0 . inclusion ) { if ( 0 == -- nInclusionsRemaining ) { queue . clear ( ) ; } } }
if the given element 's iterator has more data , then push back onto the heap . concode_field_sep DateValue head concode_elem_sep boolean inclusion concode_elem_sep int nInclusionsRemaining concode_elem_sep Comparator<HeapElement> CMP concode_elem_sep HeapElement pending concode_elem_sep RecurrenceIterator it concode_elem_sep long comparable concode_elem_sep PriorityQueue<HeapElement> queue concode_field_sep DateValue next concode_elem_sep DateValue head concode_elem_sep int compare concode_elem_sep boolean shift concode_elem_sep void advanceTo concode_elem_sep void advanceTo concode_elem_sep boolean hasNext concode_elem_sep String toString concode_elem_sep long comparable concode_elem_sep void remove concode_elem_sep void requirePending