simple heuristics to try to avoid over-pruning potential suggestions by the topnsearcher . since suggestion entries can be rejected if they belong to a deleted document , the length of the topnsearcher queue has to be increased by some factor , to account for the filtered out suggestions . this heuristic will try to make the searcher admissible , but the search can still lead to over-pruning if a filter is applied , the queue size is increased by half the number of live documents . the maximum queue size is #max_top_n_queue_size concode_field_sep CompletionScorer scorer concode_elem_sep FST<Pair<Long,BytesRef>> fst concode_elem_sep long MAX_TOP_N_QUEUE_SIZE concode_elem_sep int maxAnalyzedPathsPerOutput concode_elem_sep int payloadSep concode_elem_sep int MAX_DOC_ID_LEN_WITH_SEP concode_field_sep long encode concode_elem_sep Collection<Accountable> getChildResources concode_elem_sep void lookup concode_elem_sep int parseSurfaceForm concode_elem_sep int compare concode_elem_sep Comparator<Pair<Long,BytesRef>> getComparator concode_elem_sep NRTSuggester load concode_elem_sep double calculateLiveDocRatio concode_elem_sep long decode concode_elem_sep int parseDocID concode_elem_sep BytesRef make concode_elem_sep long ramBytesUsed
int function ( int arg0 , int arg1 , double arg2 , boolean arg3 ) { long loc0 = arg0 * maxAnalyzedPathsPerOutput ; assert arg2 <= 1.0d ; loc0 = ( long ) ( loc0 / arg2 ) ; if ( arg3 ) { loc0 = loc0 + ( arg1 / 2 ) ; } return ( int ) Math . min ( MAX_TOP_N_QUEUE_SIZE , loc0 ) ; }