Skip to content
AMDmi3 edited this page Oct 20, 2011 · 1 revision

Library

  • Empty string support?
  • Wrappers for other common string implementations
    • QString
    • u16string, u32string
  • Optimizations
    • Allocating trie nodes from pool
    • Frozen tree (lists are turned into vector for more locality and less memory usage)
  • Other facilities
    • Customizable facility for real spelling correction
      • Plain approximate string search is used to find candidates, which are then compared with dictionary with more flexible rules which take into account e.g.: keyboard layout, common typos (letters changed places, letter doubled) with less weight etc.

Utility

  • Dictionary support
  • Support of reading file list from stdin
  • Tweak memory usage
Clone this wiki locally