On 2022-10-22 15:04:58 +0200, Peter J. Holzer wrote:
> On 2022-10-19 12:10:52 +1100, Chris Angelico wrote:
> > On Wed, 19 Oct 2022 at 12:01, Peter J. Holzer wrote:
> > > On 2022-10-17 09:25:00 +0200, Karsten Hilbert wrote:
> > > > http://literateprogramming.com/
> > >
> > > Right. That's one of th
On 2022-11-05 11:07, Stefan Ram wrote:
Robert Latest writes:
result += ' ' *( length - len( result ))
Nice, I didn't know that one could multiply strings by negative numbers without
error.
Thanks, but today I thought that maybe there might
be a solution for getting a field of a fixed l
r...@zedat.fu-berlin.de (Stefan Ram) writes:
> Julieta Shem writes:
>>r...@zedat.fu-berlin.de (Stefan Ram) writes:
>>>Later, I looked at a book in a bookstore; it was a book
>>>about programming by Barbara Liskov that came out after the
>>>LSP was already mentioned often, and as far as I could se
The two comprehensions:
all((srt(n, m) in c_np) == (srt(a, b) in c_ap) for (m, b) in na)
all( srt(n, m) in c_np == srt(a, b) in c_ap for (m, b) in na)
parse differently but I am unclear what the second one produces since I thought
it would be the same as the first.
Any ideas how the second
On Saturday, 5 November 2022 at 16:06:52 UTC, cactus wrote:
I should have quoted the full comprehensions:
all((srt(m, n) in c_np) == (srt(a, b) in c_ap) for (m, a), (n, b) in
combinations(na8, 2))
all( srt(m, n) in c_np == srt(a, b) in c_ap) for (m, a), (n, b) in
combinations(na8, 2))
--
On 2022-11-05 18:52, cactus wrote:
On Saturday, 5 November 2022 at 16:06:52 UTC, cactus wrote:
I should have quoted the full comprehensions:
all((srt(m, n) in c_np) == (srt(a, b) in c_ap) for (m, a), (n, b) in
combinations(na8, 2))
all( srt(m, n) in c_np == srt(a, b) in c_ap) for (m, a
On 05/11/2022 22:11, MRAB wrote:
On 2022-11-05 18:52, cactus wrote:
On Saturday, 5 November 2022 at 16:06:52 UTC, cactus wrote:
I should have quoted the full comprehensions:
all((srt(m, n) in c_np) == (srt(a, b) in c_ap) for (m, a), (n, b)
in combinations(na8, 2))
all( srt(m, n) in c_np
