On May 7, 6:33 pm, Benjamin Peterson wrote:
> latinmail.com> writes:
>
> > Congratulations!
>
> Thanks!
>
>
>
> > Is it just me or was some nice summary output added to the make
> > process? I get a nice list of modules that didn't compile and the ones
> > where the library could not be found.
>
On May 7, 11:57 am, bearophileh...@lycos.com wrote:
> >Equality tests between OrderedDict objects are order-sensitive and are
> >implemented as list(od1.items())==list(od2.items()). Equality tests between
> >OrderedDict objects and other Mapping objects are order-insensitive<
>
> very nice idea.
lycos.com> writes:
>
> collections.Counter and collections.OrderedDict: very nice and useful.
> Is the order inside OrderedDict kept with a double linked list of the
> items?
There's a doubly-linked list containing the values. Another dictionary maps keys
to the list.
--
http://mail.python.
latinmail.com> writes:
> Congratulations!
Thanks!
>
> Is it just me or was some nice summary output added to the make
> process? I get a nice list of modules that didn't compile and the ones
> where the library could not be found.
Are you compiling on a different platform? The nice output has
Terry Reedy:
bearophile:
> > Well, I'd like function call semantics pass-in keyword arguments to
> > use OrderedDicts then... :-)
[...]
> It would require a sufficiently fast C implementation.
Right.
Such dict is usually small, so if people want it ordered, it may be
better to just use an array o
bearophileh...@lycos.com wrote:
Is the order inside OrderedDict kept with a double linked list of the
items?
That is one of the things Raymond tried. Check the code for what he
settled on for the Python version. I believe he thinks the best C
implementation might be different from the best
On May 6, 9:32 pm, Benjamin Peterson wrote:
> On behalf of the Python development team, I'm thrilled to announce the first
> and
> only beta release of Python 3.1.
>
> Python 3.1 focuses on the stabilization and optimization of features and
> changes
> Python 3.0 introduced. For example, the ne
I appreciate the tables "Infinite Iterators" and "Iterators
terminating on the shortest input sequence" at the top of the
itertools module, they are quite handy. I'd like to see similar
summary tables at the top of other docs pages too (such pages are
often quite long), for example the collections
