Ordered Dictionaries? Trees?

[Stephen Hansen]

I need a Dictionary who's order is perdictable and/or settable; e.g.
FIFO/LILO... For instance, if I do: dict['A'] = 1, dict['C'] = 2, dict['B'] = 3,
then dict.keys() would return ('A','C','B'), always. :)

Each value would prolly be another one of these dictionaries, so what
i'd be doing is setting up a tree-structure. What's the best way to do this,
that isn't tooooooo terribly slow? Speed isn't urgent, but hey, i'd rather
it not become a negative later on as things expand.

Thanks. :)

--Stephen


-----= Posted via Newsfeeds.Com, Uncensored Usenet News =-----
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
-----==  Over 80,000 Newsgroups - 16 Different Servers! =-----