chen@alsvid.cs.cornell.edu (Wilfred Chen) (04/14/90)
I have the following questions: (1) Does anyone have or know of an efficient hash-table implementation for common lisp in the public domain? (2) What's a good hash function for hash-consing? (3) What's the best and/or easiest way to maintain term/subterm uniqueness? This comes from the need to maintain uniqueness of a very large set of terms -- tens and hundreds of thousands, and potentially more. Any help would be deeply appreciated. ----------------------------------------------------------- Wilfred Chen email: chen@cs.cornell.edu Computer Science Department, Cornell University, Ithaca, NY14853 Phone: (607) 255-5579 ----------------------------------------------------------- Wilfred Chen email: chen@cs.cornell.edu Computer Science Department, Cornell University, Ithaca, NY14853 Phone: (607) 272-1368(h), (607) 255-5579(o)