Movatterモバイル変換
[0]ホーム
[Python-ideas] OrderedDict.peekitem()
Neil Girdharmistersheik at gmail.com
Tue Jul 7 08:59:10 CEST 2015
What's wrong with "next(iter(o))" and "next(reversed(o))"?On Tue, Jul 7, 2015 at 2:56 AM, Kale Kundert <kale at thekunderts.net> wrote:> I didn't even mean for this thread to be about arbitrarily indexing into an> OrderedDict. I meant for it to be about accessing the first and last> items in> an OrderedDict. Given that a method already exists to access and remove> these> items, I find it hard to understand why there isn't a method to simply> access> them. This should be a constant-time operation if OrderedDict employs a> doubly-linked list under the hood.>> -Kale>> On 07/06/2015 09:23 PM, Neil Girdhar wrote:> > This thread is not about hash tables. This thread is about indexing> into an> > ordered dictionary when you need an ordered dictionary. Someone pointed> out> > that people expect indexing to be constant time. I agree that no one> expects> > indexing to be linear time. My point was that logarithmic-time indexing> is> > reasonable and possible.>-------------- next part --------------An HTML attachment was scrubbed...URL: <http://mail.python.org/pipermail/python-ideas/attachments/20150707/aa893581/attachment.html>
More information about the Python-ideasmailing list
[8]ページ先頭