04.06.14 04:17, Steven D'Aprano написав(ла): > Would either of these trade-offs be acceptable while still claiming > "Python 3.4 compatibility"? > > My own feeling is that O(1) string indexing operations are a quality of > implementation issue, not a deal breaker to call it a Python. I can't > see any requirement in the docs that str[n] must take O(1) time, but > perhaps I have missed something. I think than breaking O(1) expectation for indexing makes the implementation significant incompatible with Python. Virtually all string operations in Python operates with indices. O(1) indexing operations can be kept with minimal memory requirements if implement Unicode internally as modified UTF-8 plus optional array of offsets for every, say, 32th character (which even can be compressed to an array of 16-bit or 32-bit integers).
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