I tried a Fibonacci heap for my implementation of Dijkstra's algorithm, but it ended up being slower!
Apparently this is a common thing and Fibonacci heaps are very rare in practice:
miniblog.
Related Posts
I've been working on a search tool for a website with 9K items and a dumb implementation works just fine. I'd normally gravitate to a library or tool like elasticsearch (ES).
Adding custom filters etc is trivial on handrolled code. I wonder what scale requires actual search infra like ES.
TIL Tcl has a notion of 'safe interpreters', a mode where you can run untrusted code in a sandbox: https://www.tcl.tk/man/tcl8.4/TclCmd/safe.htm
Not many programming languages have this, but it's way safer to include in the implementation than try to build as a userland library.
An ad hoc, informally-specified, bug-ridden, slow implementation of half of a text adventure game -- or as I like to call it, a compiler.