On Sun, Aug 28, 2011 at 21:47, "Martin v. Löwis" <martin at v.loewis.de> wrote: > result strings. In PEP 393, a buffer must be scanned for the > highest code point, which means that each byte must be inspected > twice (a second time when the copying occurs). This may be a silly question: are there things in place to optimize this for the case where two strings are combined? E.g. highest character in combined string is max(highest character in either of the strings). Also, this PEP makes me wonder if there should be a way to distinguish between language PEPs and (CPython) implementation PEPs, by adding a tag or using the PEP number ranges somehow. Cheers, Dirkjan
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4