Gareth> Sure, but the old and new ways require all that code only so
Gareth> that they can be very fast. Why not switch to a simpler but
Gareth> slower sort (say, a simple implementation of quicksort) instead
Gareth> of giving a MemoryError?
Once a malloc or realloc call fails there's no telling if you can recover.
You might be able to guarantee that if it ran to completion your simple
implementation of quicksort consumes less memory than timsort, but you don't
know that it will succeed. It's better to punt.
Skip
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