November 14-16, Berlin, Germany
November 18-23, Wrocław, Poland
November 25, Wrocław, Poland
February 10-15, Hagenberg, Austria
March 19-21, Madrid, Spain
April 1-4, Bristol, UK
June 16-21, Sofia, Bulgaria
By Adrien Hamelin | Jun 10, 2019 12:22 PM | Tags: intermediate community
Quick A: read the SO FAQ.
Recently on SO:
What are the basic rules and idioms for operator overloading?
- The General Syntax of operator overloading in C++
- The Three Basic Rules of Operator Overloading in C++
- The Decision between Member and Non-member
- Common operators to overload
- Overloading new and delete
...
By robwirving | Jun 7, 2019 02:26 PM | Tags: None
Episode 201 of CppCast the first podcast for C++ developers by C++ developers. In this episode Rob and Jason are joined by Michael Park to discuss his Pattern Matching library and standards proposal.
CppCast Episode 201: Pattern Matching with Michael Park
by Rob Irving and Jason Turner
About the interviewee:
Michael Park is a software engineer at Facebook, working on the C++ libraries and standards team. His focus for C++ is to introduce pattern matching to facilitate better code.
By Marco Arena | Jun 5, 2019 06:43 AM | Tags: c++20 c++17 advanced
A new interpretation of a classical problem:
Kadane in next-gen C++
by Marco Arena
From the article:
We, programmers, get better results while thinking in patterns. We decompose complex problems in combinations of simpler patterns. However, many problems cannot be solved with known patterns. Here is where creativity kicks in...
By Adrien Hamelin | Jun 4, 2019 11:04 AM | Tags: intermediate c++14
Quick A: mostly for exception safety.
Recently on SO:
Differences between std::make_unique and std::unique_ptr with new
The motivation behind make_unique is primarily two-fold:
make_unique is safe for creating temporaries, whereas with explicit use of new you have to remember the rule about not using unnamed temporaries.
foo(make_unique<T>(), make_unique<U>()); // exception safe foo(unique_ptr<T>(new T()), unique_ptr<U>(new U())); // unsafe*The addition of make_unique finally means we can tell people to 'never' use new rather than the previous rule to "'never' use new except when you make a unique_ptr".
There's also a third reason:
make_unique does not require redundant type usage. unique_ptr<T>(new T()) -> make_unique<T>()None of the reasons involve improving runtime efficiency the way using make_shared does (due to avoiding a second allocation, at the cost of potentially higher peak memory usage).
By Adrien Hamelin | Jun 4, 2019 11:01 AM | Tags: intermediate
Quick A: See below
Recently on SO:
With arrays, why is it the case that a[5] == 5[a]?
The C standard defines the [] operator as follows:
a[b] == *(a + b)Therefore a[5] will evaluate to:
*(a + 5)and 5[a] will evaluate to:
*(5 + a)a is a pointer to the first element of the array. a[5] is the value that's 5 elements further from a, which is the same as *(a + 5), and from elementary school math we know those are equal (addition is commutative).
By Adrien Hamelin | Jun 3, 2019 11:59 AM | Tags: community
STL Algorithms + LeetCode (feat. Sean Parent's C++ Seasoning Talk).
Leetcode 138 Problem 3 - Previous Permutation With One Swap
From the video:
Site: Leetcode
Contest: 138
Problem Name: Previous Permutation With One Swap
Problem Link: https://leetcode.com/problems/previou...
Problem Type: Greedy
By Adrien Hamelin | Jun 3, 2019 11:55 AM | Tags: performance
Quick A: performance.
Recently on SO:
Why does moving std::optional not reset state?
In a word: Performance.
One of the chief motivating reasons for move semantics to exist in the first place is performance. So the special operations move construction and move assignment should be as fast as possible for all types...
By Adrien Hamelin | Jun 3, 2019 11:47 AM | Tags: stl intermediate
What do you think?
The Difference Between std::copy_backward and std::copy with Reverse Iterators
by Jonathan Boccara
From the article:
A couple of months ago, I made a talk at the ACCU conference about learning every algorithm there is in the STL. Amongst them, we covered std::copy_backward, that makes a copy of a source range to a destination range, starting from its end and working its way back to the beginning.
In the questions session at the end of the talk, attendant Oscar Forner rose an interesting point: is there any difference between performing a std::copy_backward versus performing a simple std::copy on the reverse iterators from the source collection?
By Meeting C++ | Jun 3, 2019 06:35 AM | Tags: None
One more week to submit your talk to this years Meeting C++ conference:
Seven days to submit your talk to Meeting C++ 2019!
by Jens Weller
From the article:
A reminder: you have until next week Monday to submit your talk to this years Meeting C++ conference! Submission deadline is the 10th June at 23:59 Berlin time! Submit your talk to Meeting C++ 2019!