Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!wuarchive!mit-eddie!rutgers!rochester!pt.cs.cmu.edu!dsl.pitt.edu!pitt!willett!ForthNet
From: ForthNet@willett.pgh.pa.us (ForthNet articles from GEnie)
Newsgroups: comp.lang.forth
Subject: Conventions and "tricks" used in Forth
Message-ID: <1866.UUL1.3#5129@willett.pgh.pa.us>
Date: 16 Oct 90 03:16:35 GMT
Organization: String, Scotch tape, and Paperclips.  (in Pgh, PA)
Lines: 23


 Date: 10-02-90 (18:55)              Number: 3952 (Echo)
   To: JONAH THOMAS                  Refer#: NONE
 From: IAN WATTERS                     Read: NO
 Subj: HASHING THE DICTIONARY        Status: PUBLIC MESSAGE

 JT->  I wondered about using a binary tree for the dictionary structure.

 Don't forget to have some way to distinguish between words with the same
 name in different vocabularies.  I forgot to mention an XOR with the
 vocabulary number in my orginal post's hashing function...  Blush!

   Ian
 ---
  ~ SLMR 1.0 ~ It's noisy next door.  A Dr Herbert West lives there...

 PCRelay:IBBSNET -> #143 RelayNet (tm)
 4.10a15            <Islington BBS> London UK  +44 71 704 0760

 NET/Mail : DC Information Exchange, MetroLink Int'l Hub.  (202)433-6639
-----
This message came from GEnie via willett through a semi-automated process.
Report problems to: dwp@willett.pgh.pa.us or uunet!willett!dwp