In article <wkiueb2krx....@mit.edu>,
David Bakhash <ca...@mit.edu> wrote:
> suppose, ideally, I want a hash table whose keys are strings and whoseSo you need a hash table of a kind different from what Common Lisp
> values are objects. However, I have so many keys, and each key (string)
> is, say 50 characters long. With 50,000 keys, this can start to really
> swallow up memory. But if, instead, the objects in the hash buckets
> somehow contain the strings efficiently, then I can create those strings
> when needed, but not store them permanently.
has. You (seem to) need:
* to pass just one object to the hash table when you do the store
* to pass a function to the hash table constructor which will later
Unless someone has already implemented such tables somewhere,
-----------== Posted via Deja News, The Discussion Network ==----------
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.