June 16-21, Sofia, Bulgaria
September 13-19, Aurora, CO, USA
October 25, Pavia, Italy
November 6-8, Berlin, Germany
November 16-21, Kona, HI, USA
By Sergey Platonov | Jul 11, 2017 04:53 AM | Tags: None
This year C++ Siberia conference will take place in Tomsk at 25-26 of August. The opening keynote will be given by Ivan Cukic. The conference will be held at Tomsk State University.
The conference information (Russian language):
C++ Siberia
Tomsk, Siberia, 25-26 August
Check out Siberia this summer!
By Meeting C++ | Jul 11, 2017 01:34 AM | Tags: meetingcpp conferences community
A first list on confirmed speakers and their talks for this years Meeting C++ conference!
Confirmed Speakers & Talks at Meeting C++ 2017
by Jens Weller
From the article:
Last week the decisions for who could speak at Meeting C++ 2017 was made, and the selected candidates were contacted. Here is a little overview on talks and speakers for this years conference. There is a few speakers which haven't reacted yet, hope to share these talks soon too.
By bfilipek | Jul 10, 2017 07:36 PM | Tags: None
Another part of the series on C++17 details.
C++17 in details: Attributes
by Bartlomiej Filipek
From the article:
Previously each compiler could specify its own syntax and list of available attributes, but in modern C++ the committee tried to standardize this: there are some extracted, common parts. Plus each compiler is not blocked to add its own extensions. Maybe at some point, we’ll move away from
__attributeor__declspecor#pragma?
By Adrien Hamelin | Jul 10, 2017 12:14 PM | Tags: intermediate c++11
Quick A: Create member functions begin() and end() returning an iterator.
Recently on SO:
How to make my custom type to work with “range-based for loops”?
The standard has been changed since the question (and most answers) were posted in the resolution of this defect report.
The way to make a
for(:)loop work on your type X is now one of two ways:
- Create member
X::begin()andX::end()that return something that acts like an iterator- Create a free function
begin(X&)andend(X&)that return something that acts like an iterator, in the same namespace as your type X.And similar for const variations. This will work both on compilers that implement the defect report changes, and compilers that do not.
By Adrien Hamelin | Jul 10, 2017 12:08 PM | Tags: c++11 basics
Quick A: It calls the initializer_list constructor that has the same effect in this case.
Recnetly on SO:
Initializing a C++11 string with {}
The
{}initialization syntax is known as the uniform initialization syntax, it has a few key differences, but in your code as is they both do the same thing - construct astd::stringobject from the string literal "Test"Initializing an object with an assignment is essentially the same as putting the right hand side in parentheses and constructing the object. For example the below two are the same
T obj = a; T obj(a);So you should be asking yourself, what is the difference between constructing a string object the following two ways
std::string{"Test"}; std::string("Test");And the answer is that both the constructions above are the same and call the same constructor for
std::stringFor more on uniform initialization see https://softwareengineering.stackexchange.com/questions/133688/is-c11-uniform-initialization-a-replacement-for-the-old-style-syntax
By Adrien Hamelin | Jul 10, 2017 12:04 PM | Tags: stl intermediate
Have you registered for CppCon 2017 in September? Don’t delay – Registration is open now.
While we wait for this year’s event, we’re featuring videos of some of the 100+ talks from CppCon 2016 for you to enjoy. Here is today’s feature:
std::accumulate: Exploring an Algorithmic Empire
by Ben Deane
Summary of the talk:
What is the most powerful algorithm in the STL? In the world? There are many cases to be made. But this talk explores what I think is a pretty good candidate, which C++ calls std::accumulate(). Tucked away in ＜numeric＞, perhaps relatively unregarded when compared with workhorses like std::find_if() and std::partition(); nevertheless, std::accumulate() is in some sense the ur-algorithm on sequences.
Let’s explore the result of looking at code through an accumulate-shaped lens, how tweaking the algorithm for better composability can unlock many more uses, and how it can be further genericized with applications to parallelism, tree structures, and heterogeneous sequences.
std::accumulate(): it’s not just for adding things up!
By Meeting C++ | Jul 10, 2017 05:59 AM | Tags: security fuzzing experimental clang c++11 boost advanced
A short blog post about my experience in fuzzing beast during my boost review
Fuzzing beast with libFuzzer
by Jens Weller
From the article:
During the weekend I wanted to take a closer look at beast, a http library proposed for boost. I planned to write an http client class, as thats something I'll need in some project later anyways. I've been looking at beast on and off for a few month now, and started by reviewing the documentation and examples to get a feel for the library it self.
By Adrien Hamelin | Jul 7, 2017 02:03 PM | Tags: community advanced
The series continues.
Making things do stuff
by Glennan Carnie
From the article:
As code designers we tend to eschew specific ‘stove-pipe’ code in favour of reusable code elements. Up until now we’ve been coding some very specific examples so it’s probably worth looking at some more generic solutions...
By Adrien Hamelin | Jul 7, 2017 01:59 PM | Tags: c++11 basics
And how they are used by the std:
Functors in C++
by Mayank Jain
From the article:
Functor or function object is a C++ class which defines the operator ( ). Functor let’s you create objects which “looks like” functions...
By Adrien Hamelin | Jul 7, 2017 01:47 PM | Tags: performance community
Have you registered for CppCon 2017 in September? Don’t delay – Registration is open now.
While we wait for this year’s event, we’re featuring videos of some of the 100+ talks from CppCon 2016 for you to enjoy. Here is today’s feature:
Improving Performance Through Compiler Switches...
by Tim Haines
Summary of the talk:
Much attention has been given to what modern optimizing compilers can do with your code, but little is ever said as to how to make the compiler invoke these optimizations. Of course, the answer is compiler switches! But which ones are needed to generate the best code? How many switches does it take to get the best performance? How do different compilers compare when using the same set of switches? I explore all of these questions and more to shed light on the interplay between C++ compilers and modern hardware drawing on my work in high performance scientific computing.
Enabling modern optimizing compilers to exploit current-generation processor features is critical to success in this field. Yet, modernizing aging codebases to utilize these processor features is a daunting task that often results in non-portable code. Rather than relying on hand-tuned optimizations, I explore the ability of today's compilers to breathe new life into old code. In particular, I examine how industry-standard compilers like those from gcc, clang, and Intel perform when compiling operations common to scientific computing without any modifications to the source code. Specifically, I look at streaming data manipulations, reduction operations, compute-intensive loops, and selective array operations. By comparing the quality of the code generated and time to solution from these compilers with various optimization settings for several different C++ implementations, I am able to quantify the utility of each compiler switch in handling varying degrees of abstractions in C++ code. Finally, I measure the effects of these compiler settings on the up-and-coming industrial benchmark High Performance Conjugate Gradient that focuses more on the effects of the memory subsystem than current benchmarks like the traditional High Performance LinPACK suite.