Finding all regex matches has always been O(n²) (iev.ee) | HN Screenshots

YHacker Newsscreenshots

Screenshot of iev.ee: Finding all regex matches has always been O(n²)

First screen, captured 7 months ago.

Looks similar

Screenshot of iev.ee: RE#: how we built the fastest regex engine in F#

RE#: how we built the fastest regex engine in F#(iev.ee)

176 points by exceptione 7 months ago | 61 comments

Screenshot of alexmolas.com: A search engine in 80 lines of Python

A search engine in 80 lines of Python (alexmolas.com)

564 points by alexmolas 2 years ago | 88 comments

Blog post walking through building a simple search engine from scratch in about 80 lines of Python, motivated by small website discoverability.

python search-engines information-retrieval bm25

Screenshot of openui.com: We rewrote our Rust WASM parser in TypeScript and it got faster

We rewrote our Rust WASM parser in TypeScript and it got faster (openui.com)

271 points by zahlekhan 7 months ago | 176 comments

Screenshot of lemire.me: How many floating-point numbers are in the interval [0,1]? (2017)

How many floating-point numbers are in the interval [0,1]? (2017)(lemire.me)

87 points by burntcaramel 3 years ago | 41 comments

Screenshot of nixiesearch.substack.com: Nixiesearch: Running Lucene over S3, and why we're building a new search engine

Nixiesearch: Running Lucene over S3, and why we're building a new search engine (nixiesearch.substack.com)

102 points by shutty 2 years ago | 65 comments

Screenshot of rushter.com: Oh My Zsh adds bloat

Oh My Zsh adds bloat (rushter.com)

285 points by fla 9 months ago | 255 comments