Proposed implementation for an Ordered Dictionary

"Colin J. Williams" <> writes:
> # print [mydict[x] for x in sorted(mydict.keys)] Instance object
> is not iterable

It was a typo. Use:

print [mydict[x] for x in sorted(mydict.keys())]

Paul Rubin

On Mar 1, 1:43*am, Paul Rubin <http://phr...@NOSPAM.invalid> wrote:
> "Colin J. Williams" <c...@ncf.ca> writes:
>
> > * * *# print [mydict[x] for x in sorted(mydict.keys)] Instance object
> > is not iterable
>
> It was a typo. *Use:
>
> * * print [mydict[x] for x in sorted(mydict.keys())]

Even better

print [mydict[x] for x in sorted(mydict)]

Michele Simionato

Michele Simionato wrote:
> On Mar 1, 1:43 am, Paul Rubin <http://phr...@NOSPAM.invalid> wrote:
>> "Colin J. Williams" <c...@ncf.ca> writes:
>>
>>> # print [mydict[x] for x in sorted(mydict.keys)] Instance object
>>> is not iterable
>> It was a typo. Use:
>>
>> print [mydict[x] for x in sorted(mydict.keys())]
>
> Even better
>
> print [mydict[x] for x in sorted(mydict)]

Both Paul Rubin and Michele Simionato
produce the same result but neither
produces what was originally suggested:

def seqValues(self):
''' To return the values, with
their keys, sorted by value. '''
v= [(it[1], it[0]) for it in
self.items()]
v.sort()
return v

Colin W.

Colin J. Williams