Wow! Amazingly fast and useful feedback. Thank you! I had no idea the unidecode
module existed and the _runeCmp()_ example sheds useful light on how things
work.
Really appreciate the help.
I'm trying to create sorted lower case representations of strings and am seeing
some unexpected behavior. Below is an example of the code I'm using.
import unicode
import algorithm
import strutils
import encodings
let word = "Ångström"
var lower =
Answering my own question on this. Using the "-d: release" compile option made
all the difference. With that, I was able to reduce the time to:
real0m0.286s
user0m0.269s
sys 0m0.012s
Run
in the anagram_table
if anagram_table[lookup_signature].len == 1:
echo strformat.fmt("'{lookup_word}' does not have any anagrams")
else:
echo anagram_table[lookup_signature]
main()
Run
The "dict.txt" file with dictionary words i
Oh! strtabs would have saved some time. Still, it was good to understand how to
use the core features.
Thank you for the feedback.
Day 6 of my journey through Nim. I woke up refreshed and eager to understand
the parsecsv module.
Very quickly I got to the point where I wanted to obtain the index position for
a particular value in a sequence. A quick search led me to Stack Overflow
(Smiles) RTFM, fair enough.
The advice on what T and S are in the square brackets was useful though. That's
all I'm really after, to understand how to read that stole of proc signature.
