Re: Hash Tables

From: Ken Anderson <kanderso_at_bbn.com>
Date: Thu, 29 Jun 1995 17:17:49 +0100

  X-Mailer: exmh version 1.6 4/21/95
  To: stk_at_kaolin.unice.fr
  Subject: Hash Tables
  Date: Thu, 29 Jun 1995 14:28:51 -0400
  From: Sean Slattery <jslttery_at_gs148.sp.cs.cmu.edu>
  X-Mailing-List: <stk_at_kaolin.unice.fr> archive/latest/730
  X-Loop: stk_at_kaolin.unice.fr
  Precedence: list
  
  
  Are hash tables ever garbage collected? I running a piece of code (which uses
  a hash table) in a loop and it seems to get bigger and bigger and bigger.
  
  A) Are hash tables gc'ed in STk?
  B) If not, should/can they be?
  
If your look doesn't let go of the hash table or any of its elements it
will grow bigger and bigger. The STk hash tables only work with an eq?
test so if it grows bigger than you expect it may be because the keys you
expect to be equivalent aren't.
Received on Thu Jun 29 1995 - 23:19:39 CEST