[Openmcl-devel] Hash Table anomaly -- hash-table-size decreases - wondering how this can happen

[Tim Bradshaw]

On 5 Jan 2015, at 16:03, Glenn Iba <giba at alum.mit.edu> wrote:
> 
>    With a large hash-table, it takes my search roughly 1/2 hour to compute a generation
> (the hash-table is basically used as a set to eliminate duplicate positions).
> I do a CLRHASH in order to re-use the hash-table to accumulate the next generation
> (this is a breadth-first search).  

OK, sorry if my message sounded like I was being patronising: wasn't meant that way!

I've now slightly lost the thread, but is there a reason not to simply just drop the old hash-table on the floor, force a full GC, and make a new, big one.  That kind of approach often works well, even though it sounds insane.