Guest writer Vincent Zalzal talks to us about lightweight strong types. Vincent is a software developer working in the computer vision industry for the last 12 years. He appreciates all the levels of complexity involved in software development, from how to optimize memory cache accesses to devising algorithms and heuristics to solve complex applications, all […]
Who likes pointers? Those ancient creatures are a barrier to entry to C++, and a burden for those who braved the barrier. In the March 2018 C++ committee meeting in Jacksonville, Florida, the committee had a pretty ambitious agenda to work on. And one of the topics discussed was the deprecation, and later removal, of […]
I’m often asked the question: with C++11 introducing range-based for loops, is std::for_each now useless? And the short answer is: No. Let’s give a quick recap on for_each and range-based for loops, and then a heuristic for choosing between the two. for_each and range-for loops for_each std::for_each is an STL algorithm that takes a collection of elements (in the form of a begin and […]
Dear reader, As I’m writing these words, the city is drawing into the night and all is becoming quieter around me. It’s the end of one of the post nights of the week. It’s been over a year I’ve been publishing two articles every week, and more recently videos (sneak peek into the future, we’re […]
Heaps are implementations of priority queues. But what’s the point of having multiple STL algorithms that manipulate heaps in the form of a range, if you can directly use a priority queue structure? What heaps allow you to do that priority queues don’t? This is the question we tackle in this week’s video. The series […]
Heaps, that we saw how to manipulate with the STL, are in a close relationship with queues and priority queues. Let’s what those structures are, how to manipulate them in C++ and what the link between all this is. This is Part 3 in our series about heaps and priority queues: Part 1: Heaps Basics […]
Now that you’re familiar with what heaps are and how they work, let’s see how the STL lets us manipulate them in C++. This is Part 2 in our series about heaps and priority queues: Part 1: Heaps Basics Part 2: Building, Unbuilding and Sorting Heaps (video) Part 3: Queues, Priority Queues and Heaps Part […]
One of our 7 good resolutions for the new year was to learn our data structures. Indeed, using the right data structure simplifies the code, and knowing them lets you understand the code that uses them. Let’s see two related data structures, heaps and priority queues. This is a deep topic that we are going to […]
If you want a glimpse of what the future of C++ might look like, here is a brief overview of one of the most popular recent proposals: metaclasses. It’s also interesting to know about metaclasses even for the present, because this proposal puts in perspective structuring elements of the language as it is today. Transcript […]
Singleton is one of the 23 design patterns of book of the Gang of Four, but over time it has evolved into an anti-pattern that developers tend to avoid nowadays. Today we have a guest on Fluent C++, Mihai Sebea. Mihai is here today to share with us his experience about rooting out singletons, and […]
