October 25, Pavia, Italy
November 6-8, Berlin, Germany
November 3-8, Kona, HI, USA
By Adrien Hamelin | Apr 30, 2018 01:15 PM | Tags: intermediate
Heard about it?
How to Use Tag Dispatching In Your Code Effectively
by Jonathan Boccara
From the article:
This is the topic of today: how to use tag dispatching in your code and, just as importantly, when to use it and when to avoid it. In the opinion of yours truly, that is...
By Lucian Radu Teodorescu | Apr 30, 2018 03:04 AM | Tags: intermediate
Are you exceptionally curios?
Exceptional exploration (1)
by Lucian Radu Teodorescu
From the article:
To use or not to use exceptions? That is the question.
And if you have hoped for a simple answer, this is not the right blog to read. On this blog, finding the truth is always a complex endeavor, it involves a complex mix of perspectives and a variety of interpretations. If you are into truthing, read on.
In this post we would only cover the performance aspects of it. A follow up post should discuss aspects like modifiability (how easy is to write error handling) and appropriateness of using exceptions.
By Adrien Hamelin | Apr 27, 2018 02:26 PM | Tags: community
Were you there?
ACCUConf 2018 Trip Report
by Arne Mertz
From the article:
Two weeks ago, I attended the ACCU Conference in Bristol again, and again it was a blast. ACCUConf is by far the most interesting and enjoyable conference I have attended so far...
By Adrien Hamelin | Apr 27, 2018 02:24 PM | Tags: intermediate c++11
Quick A: The default deleter does not store anything.
Recently on SO:
How can unique_ptr have no overhead if it needs to store the deleter?
std::unique_ptr<T> is quite likely to be zero-overhead (with any sane standard-library implementation). std::unique_ptr<T, D>, for an arbitrary D, is not in general zero-overhead.
The reason is simple: Empty-Base Optimisation can be used to eliminate storage of the deleter in case it's an empty (and thus stateless) type (such as std::default_delete instantiations).
By Marco Arena | Apr 25, 2018 11:34 PM | Tags: c++17 basics
An observation on using std::size & co with statically sized char arrays:
Just be aware of std::size and static C-strings
by Marco Arena
From the article:
C++17 added support for non-member std::size, std::empty and std::data. They are little gems for generic programming...
By Adi | Apr 25, 2018 11:30 AM | Tags: None
Well defined semantics for positions and displacements.
Affine Space Types
by Adi Shavit
From the article:
I recently came across a geometric structure that deserves to be better known: The Affine Space. In fact, like many abstract mathematical concepts, it is so fundamental that we are all subconsciously familiar with it though may have never considered its mathematical underpinnings.
This post will introduce the Affine Space structure and focus mainly on its role in the C++ type system, the standard library and for creating new strong types.
By Adrien Hamelin | Apr 23, 2018 01:01 PM | Tags: intermediate c++17
Isn't it better?
Refactoring with C++17 std::optional
by Bartlomiej Filipek
From the article:
There are many situations where you need to express that something is “optional” - an object that might contain a value or not. You have several options to implement such case, but with C++17 there’s probably the most helpful way: std::optional.
For today I’ve prepared one refactoring case where you can learn how to apply this new C++17 feature...
By Adrien Hamelin | Apr 20, 2018 12:31 PM | Tags: stl intermediate
Did you know?
How to Reorder A Collection With the STL
by Jonathan Boccara
From the article:
The STL lets you do plenty of things on collections, and one of them is to reorder the elements inside of the collection. Or, said another way, to perform a permutation on the collection.
Inded, moving elements around a collection typically takes a fair amount of complex code to write, involving for loops and iterators. And it is perhaps the area where the STL generates the most spectacular improvements, by encapsulating those complex operations behing meaningful interfaces.
Let’s see what sorts of permutations the STL offers:
- Lexicographical permutations
- Cyclic permutations
- Random permutation
- Reverse
- Checking for permutations
- Other permutations
By Adrien Hamelin | Apr 20, 2018 12:29 PM | Tags: advanced
Quick A: For convenience.
Recently on SO:
int a[] = {1,2,}; Weird comma allowed. Any particular reason?
It makes it easier to generate source code, and also to write code which can be easily extended at a later date. Consider what's required to add an extra entry to:
int a[] = { 1, 2, 3 };... you have to add the comma to the existing line and add a new line. Compare that with the case where the three already has a comma after it, where you just have to add a line. Likewise if you want to remove a line you can do so without worrying about whether it's the last line or not, and you can reorder lines without fiddling about with commas. Basically it means there's a uniformity in how you treat the lines.
Now think about generating code. Something like (pseudo-code):
output("int a[] = {"); for (int i = 0; i < items.length; i++) { output("%s, ", items[i]); } output("};");No need to worry about whether the current item you're writing out is the first or the last. Much simpler.
By Adrien Hamelin | Apr 20, 2018 12:27 PM | Tags: intermediate c++17
What do you think?
optional<T> in Containers Ⅱ — Not All std::vector Usages Are The Same
by Jonathan Müller
From the article:
Okay, so in the previous post I talked about putting optional<T> in container. I came to conclusions which I though were reasonable at the time, however, people — rightfully — pointed out some flaws in my argumentation...