@srd, You are right, it is a very non-trivial task. I'm suspecting 200+ hours of work to write. The sorting algorithm would be established by a very complex and convoluted comparator.
It has been done in C and Java in a library called ICU here: <https://github.com/unicode-org/icu> Haskell has a native implementation. And python has a ICU wrapper. I think I saw some JS and perl attempts but did not look closely. Just didn't know if something has been done for Nim. @Yardinico , I will look at that nimble library. Perhaps the db import has done half the work. BTW, I did just learn that the basic data that would be used by a comparator is a public text file at <http://www.unicode.org/Public/UCA/latest/allkeys.txt>
