I'm not really worry that much over O(n^2) performace (especially having optimized some O(n^3) SQL operations :-o !) The things is this really should be an O(n) operation. Having a yield all statement or expression is useful in its own right and also potentially a way to optimized away the O(n^2) issue.
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