On Mon, 29 Sep 2003, Harley Gorrell wrote:

> On Mon, 29 Sep 2003, Fabrizio Morbini wrote:
> > Thanks! intern is much faster then read-from-string. But format is slower
> > then (concatenate 'string (symbol-name...
> 
>    And how many symbols are you making?
> 
> Billions and billions?,
> harley.

The problem is: convert a list into a symbol that is in 1:1 corrispondence
with the list. (because the list will be the key of an hash table, but a
list cannot be a key of an hash table so I need to convert it into a
symbol).

So I have solved the problem usign a support hash table that keep the 
relation between an element of the list (that is a basic symbol, an 
instance of the list can be: (a b c)) and a unique object (created by 
gensym).

A -> G10
B -> G11
C -> G12

So the unique object that corrisponde to (a b c) is G10G11G12.

The program must be scalable respect to high number of lists.

P.S.: I cannot make a simple conversion (a b c) -> a-b-c because can be
the case that in the set of input lists someone insert (a b-c) that is
different from (a b c) but will be converted to the same key of (a b-c).

Thanks and Best Regards!

Fabrizio.