From: basi <basi_lio@...>
Date: 2005-08-01T02:21:03+09:00
Subject: QUESTION: Good data structure for list within list with duplicates?

Hello,
I have a dictionary within a dictionary, where the inner dictionary may
have duplicate keys:

"x" =>
  "aa" => 2
  "aa" => 3
  "bb" => "boo"
  ..

"y" =>
  "aa" => 5
  "cc" => "see"
  "cc" => "sea"
  ..
...

The first level has about 750 entries.

First, what is a good structure for this? I've looked at hash within
hash, but I'm not up to adopting some of the ways to handle duplicate
keys in hash -- unless there's one that even a rank newbie like myself
can use.

The key query I'd need from the list is finding if in the embedded
dictionary a value exists for a key, where the key may have duplicates,
for example, Is "see" a value of the key "cc" in "y"?

Thanks.

basi