Hello all,
Is it possible to include algorithm complexity information for the various
built-in types (strings, sets, lists, dictionaries...)? This would ease
the decision for choosing the correct type. The information could simply
be added as a new column in the tables found on pages as the fol
> So I added my first buildbot yesterday (for FreeBSD and I hope to add a few
> more different BSD ones to the fray) and I see that it is failing in the
> test_curses part.
>
> I tracked it by hand and somewhere along the test it segfaults. The
> resulting coredump is not really helpful.
>
> (gdb
> The readline completion hook doesn't reraise exceptions. This is
> probably a good thing for actually using readline, less useful for
> debugging a completer. Possibly readline should have a 'debug' mode
> where it doesn't silence?
Errors should never pass silently.
Unless explicitly silenced.
So I added my first buildbot yesterday (for FreeBSD and I hope to add a few
more different BSD ones to the fray) and I see that it is failing in the
test_curses part.
I tracked it by hand and somewhere along the test it segfaults. The
resulting coredump is not really helpful.
(gdb) bt
#0 0x281aa
Hey, I've never posted to this list before but I think it is the right
place for discussions such as this:
The readline completion hook doesn't reraise exceptions. This is
probably a good thing for actually using readline, less useful for
debugging a completer. Possibly readline should have a 'deb
