Query returns the strings which contain the query, and their stored values unsorted Input: Word: The substring to search for. ResultsLimit: Limit the

SortedQuery returns the strings which contain the query sorted The function sorter produces a value to sort by (largest first) Input: Word: The substr

Search performs an exact substring search for the query in the word dictionary Returns the boundaries (low/high) of sorted suffixes which have the que

SortedErrorCorrectingQuery returns the strings which contain the query Sorted. The function sorter produces a value to sort by (largest first) Will se

ErrorCorrectingQuery returns the strings which contain the query Unsorted, I think it's partially sorted alphabetically Will search for all substrings

Insert adds a word to the dictionary that IS was built on. This is pretty slow, because of linear-time insertion into an array, so stick to New when y

ToASCII converts a single unicode rune to the ASCII equivalent using the UnicodeToASCII table

ErrorCorrect returns all byte-arrays which are Levenshtein distance of 1 away from Word within an allowed array of byte characters.

Equivalent to: bytes.Compare(S.Words[S.WordIndex[i]][S.SuffixIndex[i]:], S.Words[S.WordIndex[j]][S.SuffixIndex[j]:]) <= 0 but faster

New creates an inverted suffix from a dictionary of byte arrays, mapping data, and a string->[]byte converter

UnicodeToLowerASCII converts a unicode string to ASCII bytes using the UnicodeToASCII table