void function ( int arg0 ) { int loc0 = ( p + arg0 - 1 ) - n + 1 ; if ( loc0 > 0 ) { fill ( loc0 ) ; } }
make sure we have ` need ' elements from current position # p p . last valid p index is tokens.length-1 . p + need-1 is the tokens index ` need ' elementsahead . if we need 1 element , p +1 -1 == p must be less than tokens.length . concode_field_sep Token lastToken concode_elem_sep int p concode_elem_sep Token lastTokenBufferStart concode_elem_sep TokenSource tokenSource concode_elem_sep Token[] tokens concode_elem_sep int n concode_elem_sep int numMarkers concode_elem_sep int currentTokenIndex concode_field_sep void add concode_elem_sep String getSourceName concode_elem_sep String getText concode_elem_sep String getText concode_elem_sep String getText concode_elem_sep String getText concode_elem_sep void release concode_elem_sep Token LT concode_elem_sep int index concode_elem_sep void consume concode_elem_sep int getBufferStartIndex concode_elem_sep int fill concode_elem_sep void seek concode_elem_sep int size concode_elem_sep int LA concode_elem_sep Token get concode_elem_sep TokenSource getTokenSource concode_elem_sep int mark