lbvf50mobile

Concurrency is a pattern, not execution.

I just read Jonathan Sande's book about Dart. And found there an explanation of concurrency as a running code on one core, when parallelism execution on multiple cores. It is a "half-true" that may be useful for super-beginners who have Dart their first ever language, and have no CS background at all.

But concurrency is a pattern you separate your pieces of code to be able run them independently.

Here is a quote from Jonathan Bodner's "Learning Go" book:

Concurrency is the computer science term for breaking up a single process into independent components and specifying how these components safely share data.

Should You Learn Perl in 2025?

In 2025, I unexpectedly find myself enjoying Perl again — after years of Ruby and Go.
It sounds strange, but Perl hasn’t aged the way many people think. It’s not trendy, elegant, or fashionable — and yet, for certain kinds of work, it feels perfect.

Don’t Learn Perl. Learn UNIX.

Should you learn Perl in 2025?

	#!/usr/bin/env -S ruby -n


	# Esperanto filter.
	#
	# ^c, ^g, ^h, ^j, ^s, ^u => ĉ, ĝ, ĥ, ĵ, ŝ, ŭ
	#
	# It is a filter to be used in vim `V` selection and `!eo`.
	# Neet to be placed into the $PATH. I.e. parent dir must be in $PATH, and
	# filter must me named `eo`.

	// Leetcode: 2965. Find Missing and Repeated Values
	// https://leetcode.com/problems/find-missing-and-repeated-values/description/
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Runtime: 1 ms Beats 82.81%
	// Memory: 7.07 MB Beats 90.63%
	// 2025.03.06 Daily Challenge.

	// Leetcode: 2683. Neighboring Bitwise XOR
	// https://leetcode.com/problems/neighboring-bitwise-xor/description/
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Runtime: 0 ms Beats 100.00%
	// Memory: 13.31 MB Beats 11.11%
	// 2025.01.17 Daily Challenge.

	// Leetcode: 2425. Bitwise XOR of All Pairings
	// https://leetcode.com/problems/bitwise-xor-of-all-pairings/
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Memory: 38 ms Beats 4.17%
	// Runtime: 14.28 MB Beats 16.67%
	// 2025.01.16 Daily Challenge.
	package main

	// Leetcode: 2429. Minimize XOR
	// https://leetcode.com/problems/minimize-xor/
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Runtime: 0 ms Beats 100.00%
	// Memory: 4.05 MB Beats 37.50%
	// 2025.01.15 Daily Challange.

	// Leetcode: 2657. Find the Prefix Common Array of Two Arrays
	// https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/?envType=daily-question&envId=2025-01-14
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Runtime: 0 ms Beats 100.00%
	// Memory: 7.94 MB Beats 84.81%
	// 2025.01.14 Daily Challege.

	// Leetcode: 3223. Minimum Lenght of String Arter Operations
	// https://leetcode.com/problems/minimum-length-of-string-after-operations/description/?envType=daily-question&envId=2025-01-13
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Runtime: 11 ms Beats 77.78%
	// Memory: 8.70 MB Beats 88.89%
	// 2025.01.13 Daily Challenge.

	// Leetcode: 2116. Check if a Parentheses String Can Be Valid
	// https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description
	// = = = = = = = = = = = = = =
	// Accepted.
	// Thanks God, Jesus Christ!
	// = = = = = = = = = = = = = =
	// Runtime: 5 ms Beats 75.00%
	// Memory: 8.81 MB Beats 75.00%
	// 2025.01.12 Daily Challenge.