NOTES FOR libwcomp

open cache
	sort cache by count
	splay each (least to most frequent)
	install counts

write cache
	traverse tree, write cache
		cache can get big -- store as trie, or compressed
--

Problems:

	@@@ word counts use ints, so will overflow on 16 bit machines
	with more than 2^16 words in the wordlist (which can happen)

	cache counts are ints, and no check is made for overflow
	ints are OK, but either peg it or normalize all the
	counts during cache readin or some other time.  on a 16
	bit machine, the count will overflow and go negative after
	2^15 uses of the word (which can happen in a long document
	for frequent words such as 'the', especially if the document
	is used to load the cache).

	the tree is sorted with strcmp, but e.g. RedHat's /usr/dict/words
	is sorted using strcasecmp.
