> The requirement here is to display all these objects sorted by name and show
> different colors for good/bad/unknown
Do you realize that dictionaries or hashtables don't have the concept
of ordering? Therefore, you'll have to parse through the hashtable
once, sorting the keys like a list and then parse it again, looking up
the value for each key in the sorted list.
> What is required here is one data structure basically one more dictionary
> of combined of above three dicts
> like objects {name:objects} which will be sorted by keys and yields object
> when requested.
Simple extrapolation of the above solution. Terrible design to begin
with though.
--
Artagnon (.com)
_______________________________________________
BangPypers mailing list
[email protected]
http://mail.python.org/mailman/listinfo/bangpypers
