( -----                                                        )

(                                                              )

( Since altering 'hash-prime' would affect previously written  )

( tables, we shall introduce the following condition: you may  )

( modify 'hash-prime' before creating hash-tables, but once    )

( this has been done, do NOT change its value afterward.       )

(                                                              )

( Of course, we could make 'hash' more flexible and have it    )

( read a prime value [or define a second word that respects a  )

( stack value for modding].  For now, let's just regard our    )

( stipulation as well justified; either tweak the provided     )

( hashing routines _before_ use, or leave them be.             )

  : 'type'   ( $- ) char: ' emit type char: ' emit space ;

  {{

    : bkt-keys ( l- ) repeat 0; dup 1+ @ @ , @ again drop ;

    : (keys)   ( t- ) hash-prime @ for @+ bkt-keys next drop ;

    ---reveal---

    : keys  ( t-a )

      here 0 , swap  (keys)  here over - 1- over ! ;

  }}

  : keys{ ( R: t- ) ` keys  ` dup ` push `  foreach{ ; compile-only

  : }keys ( R:  - ) ` }loop ` pop ` here ` - ` allot ; compile-only

  : .keys ( t-  )

    char: { emit space  keys{ 'type' }keys  char: } emit ;

  ( xyz -> xyzx: like 'rot', but _copies_ rotated item )

  : rover ` push ` over ` pop ` swap ; compile-only

  : .table ( t- )

    dup

    keys{ dup cr 'type' ." => " rover get-entry drop . }keys