On 10/24/07, Bruno Desthuilliers
<[EMAIL PROTECTED]> wrote:
> dineshv a écrit :
> > We have a list of N (>2,000) keywords (of datatype string). Each of
> > the N keywords has associated with it a list of names of varying
> > numbers. For example, keyword(1) will have a list of L1 names
> > associ
dineshv a écrit :
> We have a list of N (>2,000) keywords (of datatype string). Each of
> the N keywords has associated with it a list of names of varying
> numbers. For example, keyword(1) will have a list of L1 names
> associated with it, keyword(2) will have a list of L2 names associated
> wit
> I am struggling to work out what is the ideal Python data structure
> for the above. Any help would be greatly appreciated.
The normal way is to use a dictionary of lists. The key would be the
dictionary key, which would contain a list or a list of lists, that is
each name would be an element
We have a list of N (>2,000) keywords (of datatype string). Each of
the N keywords has associated with it a list of names of varying
numbers. For example, keyword(1) will have a list of L1 names
associated with it, keyword(2) will have a list of L2 names associated
with it and so on with L1 not e
