a given heapelement may be compared to many others as it bubbles towards the heap 's root , so we cache this for each heapelement . 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 void reattach 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 void remove concode_elem_sep void requirePending
long function ( ) { return comparable ; }