pkhuong

Both are pretty rare now, but Danielle is the more common spelling. It also matches the way the -elle is used as a suffix in many diminutives (e.g., cervelle, ruelle, passerelle)

> Approach. QueryBrew builds a refined SQL statement by passing an input query through Umbra’s [11] state-of-the-art optimizer and distilling the resulting optimized plan back into SQL

> Any interface with thousands of individual pieces is difficult to use.

Standard libraries considered harmful: 100 interfaces with 10 pieces each are obviously easier to use.

Regardless of the array's size, the expected win from early exit on random keys is a constant number of iterations.

There's only 254 entries to search from. No locality issue in sight.

If you need a compact byte -> bit lookup table on x86, consider using the memory form of the bit test (BT) instruction.

kore-private-key.asc https://github.com/arunkatherashala/Kore/blob/release/v0.1.0... is pretty good too.

At least two "quantum" computing places built on SBCL.

How does the output fare on competitive hills like https://sal.discontinuity.info/hill.php?key=94t ?

AFAIK, the best results so far for fully computer-generated warriors have been on the nano and tiny format (https://sal.discontinuity.info/hill.php?key=nano, https://sal.discontinuity.info/hill.php?key=tiny), with much shorter warriors (at most 5 or 20 instructions).

Fix (creation of the rustfs-credentials crate) smuggled in a fairly large panic fix PR https://github.com/rustfs/rustfs/pull/1291#:~:text=Fixes%20C... , "fix: Prevent panic in GetMetrics gRPC handler on invalid input"

I don't see any explanation of what niche this targets relative to pre-existing tools like Checked C, CMBC, or Frama C...

Yeah, you can use index on expression and views to ensure the expression matches, like https://github.com/fsaintjacques/recordlite . The view + index approach decouples the convenience of having a column for a given expression and the need to materialise the column for performance.

I remember when Litestream not being a VFS was a plus https://news.ycombinator.com/item?id=29461406 ;)

> Just don't use C for sending astronauts in space

But do use C to control nuclear reactors https://list.cea.fr/en/page/frama-c/

It's a lot easier to catch errors of omission in C than it is to catch unintended implicit behavior in C++.

> Won't it introduce risk of invalid memory access

no.

> only helps once you are compute rather than bandwidth bound

Asymptotically, I don't think Strassen performs Theta(n^3) memory operations in sub-n^3 time.

The target audience knows what a waveform is.

SPMC ring buffer or SPMC "disruptor" aren't that bad. Multiple producers in a general ring buffer definitely introduce a lot of issues.

And this naturally extends to data replication.

RM Pro (and this new product) has a backlight. I print everything to pdf when I want to read on the remarkable.

Yeah, just decode. But that's nice because the effect is independent of the backend's state.

NVIDIA-inflicted in this case.

One easy slip-up with discussing p values in the context of a workflow or a decision-making process is that a process with p < 0.05 doesn't give us any bound on the actual ratio of actually good VS lucky changes. If we only consider good changes, the fraction of false positive changes is 0%; if we only consider bad changes, that fraction is 100%. Hypothesis testing is no replacement for insight or taste.

> start reading the coredump from stdin

How does that work with multi-TB mappings, as used by niche functionality like asan?

You can run jemalloc configured with 16KB pages on a 4KB page system.

And since view and indexes don't change the data, you can use tools like https://github.com/fsaintjacques/recordlite to automate schema management.

From context, I thought he was talking about 1 in 31 eight-year olds (https://www.cdc.gov/mmwr/volumes/74/ss/ss7402a1.htm?ACSTrack...)

> Do you have examples for problems that are easier to solve in fixed-width SIMD?

Regular expression matching and encryption come to mind.