Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to load a few millions of short (length < 16) strings into a string trie in Haskell from the file and then to perform many very fast look-ups. What is the best way how to do that in Haskell? Would appreciate any strategy (package).
Note: It must be a trie, because I need the search logic of a trie.
bytestring-trie. I think it is fast enough for most of the purposes.