Jonathan Boccara's blog

A new post every Tuesday and Friday morning

The importance of knowing STL <algorithm>s

Published a few months ago - 5 Comments

  STL algorithms are a fantastic set of tool to improve expressiveness and correctness of your code. As outlined in Sean Parent’s famous talk C++ Seasoning the reality is quite straightforward: one needs to know his algorithms. This post explains you how STL algorithms are to be used, and what they can bring to you. Algorithms versus for […]

Super expressive code by Raising Levels of Abstraction

Published a few months ago - 5 Comments

In this post I would like to propose a technique based on levels of abstraction to transform an obscure piece of code into expressive and elegant one. You’ve been quite a few to take up the Christmas Break Challenge for writing expressive code, by posting a comment on the challenge post or by chipping in on Reddit. […]

Can you write expressive code? – Christmas break challenge

Published a few months ago - 1 Comment

Before you go away on holidays and feast on Christmas and New Year’s eve parties, I want to propose you a challenge about writing expressive code to keep your skills up during the holidays period. I’m going to show you the code for a simple task performed by an application. I’m even going to explain that code to you. […]

It all comes down to respecting levels of abstraction

Published a few months ago - 2 Comments

As software developers, we get to learn many good practices and strive to apply them in our code. For instance we learn the importance of good naming of variables and functions, encapsulation, class cohesion, the usage of polymorphism, concision, readability, code clarity and expressiveness, and many others. What if there was only one principle to […]

Passing strong types by reference

Published a few months ago - 2 Comments

In this post in the series about strong types, we focus on the need for passing strong types by reference. This is a fairly common use case for strong types, since passing arguments by reference is so common, but I haven’t seen this aspect of strong types treated anywhere else yet. This post is part of a series […]

Strong types for strong interfaces

Published a few months ago - 13 Comments

Strong types are a popular topic in the C++ community. In this post I want to focus specifically on how they can be used to make interfaces clearer and more robust. This post in the second one in a series of 4 posts: Named constructors: how to give names to several constructors with the same prototype Strong types for […]

Named constructors

Published a few months ago - 4 Comments

This is the first post of a series on the topic of expressive types, that is, types that express what they represent, rather than how they are implemented. By carrying meaning, these types improve the readability and safety of the code. This series is split in 4 steps: Named constructors: how to give a name to several […]

Partial queries with optional<T>

Published a few months ago - 5 Comments

Clearer interfaces with optional<T> showed what optional<T> was, and how to make interfaces clearer by using it as a return type. If you’re not familiar with optional, I would recommend you to read it first. Here I present a example of using optional as an argument, to leverage on its “not set” semantic. The need we’ll work […]

Return value optimizations

Published a few months ago - 1 Comment

In Make your functions functional, we saw that it was preferable to have functions return objects by value, for code clarity. Now to avoid incurring performance costs by doing this, the compiler can optimize away the copies related to the return by value, if you respect a few simple rules. This post describes these optimizations and shows […]

Clearer interfaces with optional<T>

Published a few months ago - 0 Comments

The need for representing a value that is “empty”, “null”, or “not set” arises regularly in code but often leads to clumsy or brittle solutions. This need may appear with a function that needs to return a value but may not be able to compute it in all cases. In this case, several solutions are […]