/explore
|
You are here 
|
blog.burntsushi.net | ||
| | | | |
blog.nelhage.com
|
|
| | | | | Back in January of 2012, Russ Cox posted an excellent blog post detailing how Google Code Search had worked, using a trigram index. By that point, I'd already implemented early versions of my own livegrep source-code search engine, using a different indexing approach that I developed independently, with input from a few friends. This post is my long-overdue writeup of how it works. Suffix Arrays A suffix array is a data structure used for full-text search and other applications, primarily these days in the field of bioinformatics. | |
| | | | |
p1k3.com
|
|
| | | | | [AI summary] The text discusses the use of shell scripts for managing and comparing text files, particularly in the context of version control and text analysis. It highlights the importance of tools like `diff` for identifying differences between files, and how these tools are essential for both academic and programming tasks. The text also touches on the broader implications of text comparison, drawing parallels to historical textual analysis methods used in religious studies. Additionally, it reflects on the adaptability of simple utilities and the value of small, adaptable tools in handling complex tasks. | |
| | | | |
cprimozic.net
|
|
| | | | | A detailed summary of the techniques I used to optimize my Advent of Code 2024 solution for Day 9 Part 2. Employs a variety of techniques including algorithmic shortcuts, bespoke data structures, and low-level optimizations + SIMD. | |
| | | | |
madole.xyz
|
|
| | | Javascript Interview Questions | Blog post | ||
