K 10
svn:author
V 5
gabor
K 8
svn:date
V 27
2011-06-27T22:13:15.298033Z
K 7
svn:log
V 641
- Add a simple hashtable implementation. It will be used for fixed string
  matching algorithms that have good-suffix and bad-character shift
  tables. For single-byte characters, an array indexed with the character
  itself is appropriate but for wide characters, this does not work
  any more because the number of characters are so high. Fortunately,
  most of the values are the same and there are only n distinct values,
  where n is the number of distinct characters in the pattern. Making
  use of this characteristics, it is enough to store the default value
  and the the value of the distinct characters can go into the hashtable.

END