page = arthur o'dwyer – stuff mostly about c++
url = https://quuxplusone.github.io/blog
My lovely wife and I have just moved house, and while boxing up the contents of my desk I ran across physical paper copies of two weakly themed crosswords I made in 2011. Might as well immortalize them in the digital realm…
Field-testing P2266 “Simpler Implicit Move”
A few months ago, Matheus Izvekov implemented my WG21 proposal P2266 “Simpler Implicit Move” in Clang. As of Clang 13, it’s enabled by default under
We’ve received some feedback from the field already (leading up to the Clang 13 release). Here are the punch lines as far as I can recall. These examples will all appear in P2266R2, whenever I get around to submitting it.
; see “What is the std::swap two-step?” (2020-07-11). But look at all these wrong things you can try! …
In my CppCon 2018 talk “Concepts As She Is Spoke,” I presented some pitfalls in
In Bjarne Stroustrup’s paper P0557R1 “Concepts: The Future of Generic Programming” (January 2017), section 6 is titled “Concept Overloading,” which Stroustrup distinguishes from the traditional approach “using helper functions and tag dispatch.” More subtly, Stroustrup seems to distinguish between true “overloading” (asking the compiler to resolve among multiple viable overloads) and other means of giving-two-things-the-same-name:
A few weeks ago, I read René Daumal’s A Night of Serious Drinking (published as La grande beuverie 1938; translated by David Coward and E.A. Lovatt 1979). I recommend it; it’s a fun and erudite satire — sort of a less political Gulliver’s Travels or a less bitter Jurgen . At times it made me think, “This is clearly an allegory… but of what?” and at other times “Is he satirizing bad scientists, bad writers, bad artists? or all scientists, all writers, all artists?”
C++ On Sea 2021 schedule announced
The schedule for C++ on Sea 2021 has been announced! The “conference day” involves two tracks of five talks each, plus a keynote by Barbara Geller and Ansel Sermersheim. The two “workshop days” offer… well, you should sign up for my own two-day training class, at which point the other offerings are moot. But, just for the record, the two available two-day classes are:
“A metaprogramming puzzle: Overly interoperable libraries” (2021-05-19)
“Overly interoperable libraries, part 2” (2021-05-22)
I continue participating in Zartaj Majeed’s book club on Knuth’s The Art of Computer Programming , previously mentioned in “Bubblesort, rocksort, cocktail-shaker sort” (2020-12-13). The past couple of weeks, we’ve been looking at section 5.2.3, “Sorting by selection,” in which the problem of repeatedly selecting the max element leads Knuth to investigate priority queues.