boolean function ( int arg0 ) { int loc0 = arg0 / ( w + 1 ) ; int loc1 = arg0 % ( w + 1 ) ; assert loc1 >= 0 ; return w - loc1 + minErrors [ loc0 ] <= n ; }
returns true if the state in any levenshtein dfa is an accept state final state . concode_field_sep int MAXIMUM_SUPPORTED_DISTANCE concode_elem_sep ParametricDescription descriptions[] concode_elem_sep long[] MASKS concode_elem_sep int rangeLower[] concode_elem_sep int w concode_elem_sep int numRanges concode_elem_sep int[] minErrors concode_elem_sep int alphabet[] concode_elem_sep int rangeUpper[] concode_elem_sep int word[] concode_elem_sep int alphaMax concode_elem_sep int n concode_field_sep int getPosition concode_elem_sep int size concode_elem_sep Automaton toAutomaton concode_elem_sep int getVector concode_elem_sep int unpack concode_elem_sep int transition concode_elem_sep int[] codePoints