From ff79aff37e49f154bdb216c05637e6a4ec767388 Mon Sep 17 00:00:00 2001 From: Sadeep Madurange Date: Fri, 6 Mar 2026 17:52:07 +0800 Subject: Change arduino due and site search post titles. --- _log/arduino-due.md | 2 +- _log/arduino-uno.md | 2 +- _log/site-search.md | 16 ++++++++-------- 3 files changed, 10 insertions(+), 10 deletions(-) (limited to '_log') diff --git a/_log/arduino-due.md b/_log/arduino-due.md index 6eed6f3..1881547 100644 --- a/_log/arduino-due.md +++ b/_log/arduino-due.md @@ -1,5 +1,5 @@ --- -title: ATSAM3X8E bare-metal bring-up +title: ATSAM3X8E bare-metal notes date: 2024-09-16 layout: post --- diff --git a/_log/arduino-uno.md b/_log/arduino-uno.md index 4e71f0d..84ecb69 100644 --- a/_log/arduino-uno.md +++ b/_log/arduino-uno.md @@ -1,5 +1,5 @@ --- -title: ATmega328P at 3.3 V and 5 V +title: ATmega328P at 3.3 V and 5 V date: 2025-06-10 layout: post --- diff --git a/_log/site-search.md b/_log/site-search.md index 4c3f376..e9137de 100644 --- a/_log/site-search.md +++ b/_log/site-search.md @@ -1,5 +1,5 @@ --- -title: Site search +title: Suffix-array search for static sites date: 2026-01-03 layout: post --- @@ -13,10 +13,10 @@ text browsers. Architecture: browser ↔ httpd ↔ slowcgi ↔ search engine. Server-side regex is viable for a personal site. But an index has clear -advantages. Not much harder to implement. +advantages. Not that much harder to implement. -Index: suffix array (SA) implemented in Perl. Three files: corpus.bin, sa.bin, -file_map.dat. Built with site: +Index: suffix array (SA) implemented in Perl. Index— corpus.bin, sa.bin, +file_map.dat—built with site: ``` $ JEKYLL_ENV=production bundle exec jekyll build @@ -44,10 +44,10 @@ my @sa = 0 .. (length($corpus) - 1); 32-bit offsets limit index size to 4GB—more than sufficient and, if necessary, easily expanded. -Sort is the real bottleneck. Time complexity: O(L⋅N log N). Fast path caps L at -64 bytes (length of a typical cache line). +Sort (O(L⋅N log N)) is the real bottleneck. Fast path caps L at 64 bytes +(length of a typical cache line). -Search: Textbook range query with twin binary searches. Fixed-width offsets +Search: Textbook range query with two binary searches. Fixed-width offsets enable random access to index: ``` @@ -93,7 +93,7 @@ Security: httpd, slowcgi, Perl in OpenBSD base system. File system permissions govern access. Runs in chroot. Resource exhaustion and XSS attacks are inherent. Lock-file semaphores limit -concurrent searches; query length (64B) and result set (20) are capped. All +concurrent searches. Query length (64B) and result set (20) are capped. All output is HTML-escaped to prevent XSS. Warranty: 10,000 / 12 → 833 years. -- cgit v1.2.3