"All you need then is a search function, which essentially traverses
the tree, concatenating keys and comparing them with the target word."
Actually, I just realized that that's pretty stupid. The efficient way
is to split the word into its characters and traverse the tree,
testing each successive target character with the current key, rather
than traverse the tree concatenating keys.
_______________________________________________
Cocoa-dev mailing list (Cocoa-dev@lists.apple.com)
Please do not post admin requests or moderator comments to the list.
Contact the moderators at cocoa-dev-admins(at)lists.apple.com
Help/Unsubscribe/Update your Subscription:
http://lists.apple.com/mailman/options/cocoa-dev/archive%40mail-archive.com
This email sent to arch...@mail-archive.com
