Lower-case characters in the query are assumed to be case-insensitive, and upper-case characters are assumed to be case-sensitive. Otherwise, it will return the "best" way to line the characters in query up with the characters in string. The core functionality of the library is provided by the bestMatch function: bestMatch :: String -> String -> Maybe AlignmentĬalling bestMatch query string will return Nothing if query is not a subsequence of string. The search is intended to behave similarly to the excellent fzf tool by Junegunn Choi. A package that provides an API for fuzzy text search in Haskell, using a modified version of the Smith-Waterman algorithm.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |