Return a weak hash table with size buckets. As with any hash table, choosing a good size for the table requires some caution.
You can modify weak hash tables in exactly the same way you would modify
regular hash tables, with the exception of the routines that act on
handles. Weak tables have a different implementation behind the scenes
that doesn’t have handles. see Hash Tables, for more on
hashq-ref et al.
Note that in a weak-key hash table, the reference to the value is strong. This means that if the value references the key, even indirectly, the key will never be collected, which can lead to a memory leak. The reverse is true for weak value tables.
#t if obj is the specified weak hash
table. Note that a doubly weak hash table is neither a weak key
nor a weak value hash table.