[gforth] / gforth / hash.fs  

gforth: gforth/hash.fs

Diff for /gforth/hash.fs between version 1.1 and 1.2

version 1.1, Thu Jul 21 10:52:43 1994 UTC version 1.2, Thu Aug 25 15:25:27 1994 UTC
Line 1 
Line 1 
 \ Hashed dictionaries                                  15jul94py  \ Hashed dictionaries                                  15jul94py
   
 $80 Value Hashlen  7 value hashbits
   1 hashbits lshift Value Hashlen
   
 Variable insRule        insRule on  Variable insRule        insRule on
   
Line 22 
Line 23 
   
 \ compute hash key                                     15jul94py  \ compute hash key                                     15jul94py
   
 : hash ( addr len -- key )  (hashkey)  : hash ( addr len -- key )
 \  tuck bounds  ?DO  I c@ toupper +  LOOP      hashbits (hashkey1) ;
   Hashlen 1- and ;  \   (hashkey)
   \   Hashlen 1- and ;
   
 : hash-find ( addr len wordlist -- nfa / false ) $C + @ >r  
   : hash-find ( addr len wordlist -- nfa / false )
       $C + @ >r
   2dup hash cells r> + @ (hashfind) ;    2dup hash cells r> + @ (hashfind) ;
 \  BEGIN  dup  WHILE  \  BEGIN  dup  WHILE
 \         2@ >r >r dup r@ cell+ c@ $1F and =  \         2@ >r >r dup r@ cell+ c@ $1F and =
Line 51 
Line 55 
   
 Create hashsearch  ' hash-find A,  ' hash-reveal A,  ' drop A,  Create hashsearch  ' hash-find A,  ' hash-reveal A,  ' drop A,
   
 : (initvoc ( addr -- )  cell+ dup @ 0< IF  drop EXIT  THEN  : (initvoc ( addr -- )
       cell+ dup @ 0< IF  drop EXIT  THEN
   insRule @ >r  insRule off  hash-alloc    insRule @ >r  insRule off  hash-alloc
   3 cells - hashsearch over cell+ ! dup    3 cells - hashsearch over cell+ ! dup
   BEGIN  @ dup  WHILE  2dup swap (reveal  REPEAT    BEGIN  @ dup  WHILE  2dup swap (reveal  REPEAT
Line 59 
Line 64 
   
 ' (initvoc IS 'initvoc  ' (initvoc IS 'initvoc
   
 : addall  ( -- )  voclink  : addall  ( -- )
       voclink
   BEGIN  @ dup @  WHILE  dup (initvoc  REPEAT  drop ;    BEGIN  @ dup @  WHILE  dup (initvoc  REPEAT  drop ;
   
 \ Hash-Find                                            01jan93py  \ Hash-Find                                            01jan93py
Line 74 
Line 80 
              dup cell+ @ .name  REPEAT  drop               dup cell+ @ .name  REPEAT  drop
   LOOP  drop r> base ! ;    LOOP  drop r> base ! ;
   
   \ \ this stuff is for evaluating the hash function
   \ : square dup * ;
   
   \ : countwl  ( -- sum sumsq )
   \     \ gives the number of words in the current wordlist and the sum of
   \     \ squares for the sublist lengths
   \     0 0
   \     context @ 3 cells + @ hashlen cells over + swap DO
   \       0 i BEGIN
   \           @ dup WHILE
   \           swap 1+ swap
   \       REPEAT
   \       drop
   \       swap over square +
   \       >r + r>
   \       1 cells
   \     +LOOP ;
   
   \ : chisq ( -- n )
   \     \ n should have about the same size as hashlen
   \     countwl hashlen 2 pick */ swap - ;

Generate output suitable for use with a patch program
Legend:
Removed from v.1.1  
changed lines
  Added in v.1.2
CVS Admin

Powered by ViewCVS 1.0-dev 		(Powered by ViewCVS)

ViewCVS and CVS Help