From: John Cowan (email@example.com)
Date: Fri Nov 14 2003 - 17:26:13 EST
Theodore H. Smith scripsit:
> Can someone give me some advice? If I was to write a dictionary class
> for Unicode, would I be better off writing it using a b-tree, or
> hash-bin system? Or maybe an array of pointers to arrays system?
Google for "ternary search trees". It's a very interesting
technique which provides a combination of trie and binary tree.
-- John Cowan firstname.lastname@example.org www.ccil.org/~cowan www.reutershealth.com I must confess that I have very little notion of what [s. 4 of the British Trade Marks Act, 1938] is intended to convey, and particularly the sentence of 253 words, as I make them, which constitutes sub-section 1. I doubt if the entire statute book could be successfully searched for a sentence of equal length which is of more fuliginous obscurity. --MacKinnon LJ, 1940
This archive was generated by hypermail 2.1.5 : Fri Nov 14 2003 - 18:07:24 EST