October 25, Pavia, Italy
November 6-8, Berlin, Germany
November 3-8, Kona, HI, USA
By Blog Staff | Sep 3, 2013 07:09 AM | Tags: None
Continuing Koenig's series on move semantics:
Addresses and Nodes: Two Ways To Get Around
by Andrew Koenig
From the article:
Programs that avoid address arithmetic can also avoid moving data. The reason is that it is only arithmetic that really cares about where in memory an object is; in other circumstances, having a pointer to that memory is enough.
By Meeting C++ | Sep 1, 2013 12:57 PM | Tags: community basics advanced
I've created a short overview over the C++ Conferences this Fall:
- Going Native (Seattle, 4.th-6.9) SOLD OUT
- International Workshop on OpenMP (Canberra (AU), 16-18.9)
- (not a conference, but...) Fall ISO C++ meeting (Chicago, 23-28.9)
- QtDevDays Europe (Berlin, 7th - 9.10)
- QtDevDays US (San Francisco, 6th-8.11)
- Meeting C++ 2013 (Düsseldorf, 8th-9.11)
- C++ and Beyond (Snoqualmie Falls (WA/US), 9th-12.12) SOLD OUT
by Jens Weller
By Meeting C++ | Aug 29, 2013 11:58 AM | Tags: intermediate experimental boost blackberry basics
I've been looking at the BlackBerry 10 NDK the last weeks, and did write about it to share some thoughts and results.
Revisiting the BlackBerry 10 NDK
by Jens Weller
From the article:
The last few weeks I did look again at the BlackBerry 10 NDK, as a client had asked for help and training. I offered to adapt my Qt Introduction course to the BlackBerry plattform, and offered my advice...
Before I start, a short paragraph about Apps and C++. People coming from Java or .NET often don't understand the need to make Apps in C++...
By Blog Staff | Aug 29, 2013 05:53 AM | Tags: intermediate
Quick A: Using type erasure.
Quick Q2: ... Um, what's that?
Quick A2: Read this post...
How is std::function implemented?
According to the sources I have found, a lambda expression is essentially implemented by the compiler creating a class with overloaded function call operator and the referenced variables as members. This suggests that the size of lambda expressions varies, and given enough references variables that size can be arbitrarily large.
An
std::functionshould have a fixed size, but it must be able to wrap any kind of callables, including any lambdas of the same kind. How is it implemented? Ifstd::functioninternally uses a pointer to its target, then what happens, when thestd::functioninstance is copied or moved? Are there any heap allocations involved?
By Blog Staff | Aug 28, 2013 12:45 PM | Tags: basics
Danny Kalev wrote a nice article yesterday about a new C++ feature -- actually, two related C++14 features -- that were just added to the draft Standard in April and will be coming to real compilers in the near future.
A Glimpse into C++14: Combine Flexibility and Performance with Dynamic Arrays and Runtime-Sized Arrays
by Danny Kalev
From the article:
C99 introduced the notion of variable length arrays: stack allocated built-in arrays whose size is determined at runtime. C++ lacks a similar feature, to the discontent of many a programmer. However, two recent proposals for adding dynamic arrays and runtime-sized arrays to C++14 are closing the gap at last. Learn how to use these new features to imitate C99’s variable length arrays in C++...
By Blog Staff | Aug 28, 2013 12:29 PM | Tags: intermediate
We keep hearing about C++'s "as if" rule, but what does it really do? Fundamentally, it enables optimizations. A modern compiler never produces an executable that's identical to the program you actually wrote; it produces an equivalent program that's probably a lot better.
Hence Jim Hogg's nice new series on what optimizing compilers do, using Visual C++ as an example. The latest instalment:
Optimizing C++ Code : Dead Code Elimination
by Jim Hogg
From the article:
This post examines the optimization called Dead-Code-Elimination, which I’ll abbreviate to DCE. It does what it says: discards any calculations whose results are not actually used by the program.
Now, you will probably assert that your code calculates only results that are used, and never any results that are not used: only an idiot, after all, would gratuitously add useless code -- calculating the first 1000 digits of pi, for example, whilst also doing something useful. So when would the DCE optimization ever have an effect? ...
By Meeting C++ | Aug 26, 2013 08:34 AM | Tags: intermediate c++11 basics
A nice piece of writing on a C++11 feature:
Inherited Constructors in C++11
by Marius Bancila
From the article:
In C++, a function in a derived class with the same name as one (or a set of overloads) in a base class, hides the function (or the overloads) from the base class. Here is an example...
By Blog Staff | Aug 23, 2013 09:26 AM | Tags: intermediate concurrency
Here is a nicely accessible description of synchronization in the C++ memory model:
The Synchronizes-With Relation
by Jeff Preshing
See also Jeff's other recent related posts:
By matt | Aug 23, 2013 06:06 AM | Tags: polymorphism intermediate crtp cloning c++11
On CRTP with multi-level inheritance, cloning, and the constructor forwarding problem.
C++: Polymorphic cloning and the CRTP (Curiously Recurring Template Pattern)
by Katy Coe
From the article:
A common problem in C++ occurs when you have an object of an unknown derived type and want to make a copy of it. ...
The solution is to use the commonly-used polymorphic cloning pattern. In this pattern, we define a virtual function -- which we’ll call
clone()in this article -- which when called via an object pointer returns a new object of the correct derived type.
By Blog Staff | Aug 21, 2013 07:01 PM | Tags: basics
Today on Dr. Dobb's:
Moving Data and Address Arithmetic
by Andrew Koenig
From the article:
Programs that don't care about the addresses of their data rarely need to move those data. After all, we can view the whole point of moving an object as a way of changing the object's address without changing its contents...