:) ),
can't we think of replacing it somehow by functions in the case
of the Limited API? The API is so often used that it would make sense
to _always_ don't crash deeply nested structures.
Or do you think it makes no sense at all? Then let's turn it
into a no-op. But the current mixed situation is not rea
think to send an official announce when this is available on pip.
This effort marks the completion of my PyPy support, which began
in 2003 and ended involuntarily in 2006 due to a stroke.
All the best -- Chris
--
Christian Tismer-Sperling:^) tis...@stackless.com
Software Consulting
PyPy
might create much interest for both projects.
Cheers - Chris
--
Christian Tismer-Sperling:^) tis...@stackless.com
Software Consulting : http://www.stackless.com/
Strandstraße 37 : https://github.com/PySide
24217 Schönberg : GPG key -> 0xF
Cheers -- Chris
--
Christian Tismer-Sperling:^) tis...@stackless.com
Software Consulting : http://www.stackless.com/
Strandstraße 37 : https://github.com/PySide
24217 Schönberg : GPG key -> 0xFB7BEE0E
phone +49 173 24
h-case sequence patterns won't
match str, bytes or bytearrray objects - regexen are the tool already
optimised for that purpose, so it's quite impressive that you are
managing to approach the same level of performance!
Kind regards,
Steve
On Wed, 2 Aug 2023 at 18:26, Christian Tismer-Sperlin
return 4 * 1000, r
So what is missing seems to be a notion of const-ness, which
could be dynamically deduced. Am I missing something?
--
Christian Tismer-Sperling:^) tis...@stackless.com
Software Consulting : http://www.stackless.com/
Strandstraße 37
On 02.08.23 13:23, Barry wrote:
On 2 Aug 2023, at 12:03, Christian Tismer-Sperling
wrote:
Hi folks,
I just used Structural Pattern Matching quite intensively and I'm
pretty amazed of the new possibilities.
But see this code, trying to implement Mark Pilgrim's regex
algorithm for roman
