like
this mailing list). Tell them what you were trying to do, and *why*
you were trying to do it (that way people can tell you if there is a
better solution).
>
> God bless you guys, and thank you for your site and willingness to share
> and help!
>
> jeff
I think you'l
seen
> any documentation on using this type of syntax.
You could put b and c in a tuple or array and check for membership
>>> a, b, c = 1, 0, 1
>>> a in (b, c)
True
Is that lazy enough?
Kind Regards,
Brian Wisti
http://coolnamehere.com/
_
On 8/14/07, Brian Wisti <[EMAIL PROTECTED]> wrote:
>
>
> On 8/14/07, David Handel <[EMAIL PROTECTED]> wrote:
> >
> > If you can afford it, Safari Books online is a wonderful resource.
> > http://www.safaribooksonline.com/
> > I am using the $39.95 mon
#x27;bananas', 'pears']
>>> items[0]
'oranges'
It does result in another list, same as the the approaches listed by
Kent and Jason. If *all* you were interested was the key associated
with the greatest inventory count, you could wrap your favorite
solution in a function and return the key from that.
Kind Regards,
Brian Wisti
http://coolnamehere.com/
___
Tutor maillist - Tutor@python.org
http://mail.python.org/mailman/listinfo/tutor
there is an officially blessed way to go about it, though. Try
one, and if somebody starts shouting at you, switch to the other ;-)
Kind Regards,
Brian Wisti
http://coolnamehere.com/
___
Tutor maillist - Tutor@python.org
http://mail.python.org/mailman/listinfo/tutor
