Simon B. brunns at my-deja.com
Fri Sep 22 08:48:35 EDT 2000

• Previous message (by thread): Ordered Dictionaries? Trees?
• Next message (by thread): Ordered Dictionaries? Trees?
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

In article <20000904.133113.2838 at Jeremy.cerebralmaelstrom.com>,
  stephen at cerebralmaelstrom.com wrote:
> 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.

This might be worth a look:
<http://www.nmt.edu/tcc/help/lang/python/skiplist.html>.

--
Simon Brunning
I respect the truth too much to drag it out on every occasion. - Jerome
K. Jerome


Sent via Deja.com http://www.deja.com/
Before you buy.

---

• Previous message (by thread): Ordered Dictionaries? Trees?
• Next message (by thread): Ordered Dictionaries? Trees?
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list