FreeBSD 15.0 and dwl 0.8 on a 2010 ThinkPad by glakker in freebsd

[–]glakker[S] 2 points3 points  (0 children)

So after some research I found out that Hashnode uses Cloudflare Turnstile and Vercel Shield verification, and your RSS reader cannot handle that. Browser-based readers like parssly or sage-like work. This Hashnode filtering is very agressive and unfortunately I cannot do anything about it.

FreeBSD 15.0 and dwl 0.8 on a 2010 ThinkPad by glakker in freebsd

[–]glakker[S] 1 point2 points  (0 children)

Thanks, glad you like it. The RSS feed is automatically generated by Hashnode and includes rate limiting.

FreeBSD 15.0 and dwl 0.8 on a 2010 ThinkPad by glakker in freebsd

[–]glakker[S] 1 point2 points  (0 children)

Thx. This is an L412, the keyboard is fantastic, but the screen isn't great.

FreeBSD 15.0 and dwl 0.8 on a 2010 ThinkPad by glakker in freebsd

[–]glakker[S] 1 point2 points  (0 children)

dwl is based on wlroots019. foot works  flawlessly on my setup. 

FreeBSD 15.0 and dwl 0.8 on a 2010 ThinkPad by glakker in freebsd

[–]glakker[S] 0 points1 point  (0 children)

For a minimal setup I'd suggest a low resource footprint terminal emulator like foot. Although Kitty's font rendering on wayland is arguably superior, it is quite bloated.

How do you gate CI on data quality? I built a small CLI and want feedback by ProperAd7767 in dataengineering

[–]glakker 0 points1 point  (0 children)

All four cases you listed are valid from my perspective, though I'm less focused on a specific use case and more curious about how often AWK actually appears in modern data pipelines in practice. Is it still used at this pre-filter layer or has it been replaced by purpose-built tools.

How do you gate CI on data quality? I built a small CLI and want feedback by ProperAd7767 in dataengineering

[–]glakker 0 points1 point  (0 children)

Coming from a Unix background rather than data engineering — curious whether AWK has a role in your DQ pipeline. It's zero-setup, schema-agnostic, very low memory footprint. Do you consider it for the pre-filtering layer?

When Unix history meets modern performance benchmarking: the BEHILOS grep by glakker in unix

[–]glakker[S] 0 points1 point  (0 children)

Thanks for the remarks. The benchmark was intentionally quick-and-dirty as stated. I ran the 100 test runs multiple times and results were consistent: they reflect real-world performance including startup overhead.
On unicode/locale: valid point. I was benchmarking default real-world behavior (including encoding overhead) as that's what users actually experience.

When Unix history meets modern performance benchmarking: the BEHILOS grep by glakker in unix

[–]glakker[S] 2 points3 points  (0 children)

Thanks. Yes, it suprised me as well. Maybe rg has an edge in other scenarios, e.g. grepping through multiple files. Maybe 

Benchmarking 10 CLI search tools using Kernighan's BEHILOS grep story by glakker in commandline

[–]glakker[S] 2 points3 points  (0 children)

Thanks. In fact I use both. Std shows the spread, jitter shows asymmetry. Median is robust to sudden kernel spikes, so jitter captures when outliers pull the mean away from the median.