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 Blog Staff | Sep 1, 2013 03:23 PM | Tags: None
The GoingNative 2013 conference starts Wednesday and is just about sold out. A few seats remain, so register now (or get on the waitlist in case there's a last-minute cancellation you can snag).
It's decidedly desirable to be physically in the room to get the full experience, and hundreds of people from over 10 countries are already on their way. But if you can't come in person to Redmond, WA, USA for this week's C++ fest, you'll be glad to know the talks will be livestreamed as well on the Channel 9 homepage. The streaming is compatible with all major platforms. For those of you around the world, please note that the talk times are in North American Pacific Daylight Time.
Talks include the following, including both full-length talks and a number of 20- and 30-minute "nuggets."
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 Blog Staff | Aug 31, 2013 07:47 AM | Tags: None
A new WG21 paper is available. A copy is linked below, and the paper will also appear in the next normal WG21 mailing. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.
Document number: N3710
Date: 2013-08-29
Specifying the absence of "out of thin air" results (LWG2265)
by Hans Boehm, Mark Batty, Brian Demsky, Olivier Giroux, Paul McKenney, Peter Sewell, Francesco Zappa Nardelli, et al.
Excerpt:
The C++11 memory model specified the semantics of shared ordinary and atomic objects. There is one small part of this specification that we always recognized was dubious. The specification in 1.10 of weakly ordered atomics allows an atomic load to essentially see, or not see, the result of any racing store. In the case of explicit very weak memory ordering specifications, this can lead to "causal cycles" and highly counterintuitive results. ...
Essentially this issue has been an open issue in the Java specification for about 10 years. The major advantage that we have in C++ is that the problem is confined to non-synchronizing atomics, i.e.
memory_order_relaxed, and somememory_order_consumeuses (or read-modify-write operations that effectively weaken the ordering on either the read or write to one of those). Many of us expect those to be rarely used. ...This proposal benefitted from a lengthy email discussion involving participants listed at the beginning of this paper, and others. This provided very useful input resulting in improvements to this proposal. It unfortunately resulted in neither a clear consensus in that group, nor an alternate proposal with clearly better consensus behind it. Not all of the listed contributors necessarily support this proposal. Since I don't believe there is support for maintaining the status quo, I nonetheless bring forward this proposal. Mark Batty and Peter Sewell are currently considering submitting additional late papers on this topic, including an alternate proposal. ...
By Blog Staff | Aug 31, 2013 07:44 AM | Tags: None
A new WG21 paper is available. A copy is linked below, and the paper will also appear in the next normal WG21 mailing. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.
Document number: N3709
Date: 2013-08-29
Minutes for July 2013 Santa Clara SG1 Meeting
by Jared Hoberock, Alasdair Mackintosh, Hans Boehm
Excerpt:
This meeting took place July 25-26, in Santa Clara, CA. We thank Nvidia for hosting the meeting.
By Blog Staff | Aug 30, 2013 04:45 PM | Tags: None
A new WG21 paper is available. A copy is linked below, and the paper will also appear in the next normal WG21 mailing. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.
Document number: N3722
Date: 2013-08-30
Resumable Functions
by Niklas Gustafsson, Deon Brewis, Herb Sutter, Sana Mithani
Excerpt:
While presenting a proposal that can be adopted or rejected in isolation, this document is related to N3721. The reader is advised to read both as a unit and to consider how the two build on each other for synergy. Reading them in their assigned numeric order is strongly advised.
New in this version: proposed wording for a TS, including language to generalize its applicability to other types than
future/shared_future; a section on a possible extension to include generator functions; going back to use of the word ‘resumable’ instead of ‘async’ as the syntactic marker of resumable functions.
By Blog Staff | Aug 30, 2013 04:34 PM | Tags: None
A new WG21 paper is available. A copy is linked below, and the paper will also appear in the next normal WG21 mailing. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.
Document number: N3721
Date: 2013-08-30
Improvements to std::future
and Related APIs by Niklas Gustafsson, Artur Laksberg, Herb Sutter, Sana Mithani
Excerpt:
This proposal is an evolution of the functionality of
std::future/std::shared_future. It details additions which can enable wait free compositions of asynchronous operations.This document supersedes N3634: the title has been changed, and the proposed changes have been modified to be expressed as edits to the C++ Draft Standard.
New in this version: implicit unwrapping (one level) of
future<future<R>>tofuture<R>inthen().... C++ suffers an evident deficit of asynchronous operations compared to other languages, thereby hindering programmer productivity. JavaScript on Windows 8 has promises (
then,joinandany), .NET has the Task Parallel Library (ContinueWith,WhenAll,WhenAny), C#/VB has theawaitkeyword (asynchronous continuations), and F# has asynchronous workflows. When compared to these languages, C++ is less productive for writing I/O-intensive applications and system software. In particular writing highly scalable services becomes significantly more difficult. ...
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 11:46 AM | Tags: None
Prof. Stroustrup spoke at A9 last week on "The Future is Here: C++11." The video is now available on YouTube:
The Future Is Here: C++11
Special Guest Lecture by C++ Inventor Bjarne Stroustrup
By Blog Staff | Aug 29, 2013 09:11 AM | Tags: None
A new WG21 paper is available. A copy is linked below, and the paper will also appear in the next normal WG21 mailing. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.
Document number: N3744
Date: 2013-08-30
Proposing [[pure]]
by Walter Brown
Excerpt:
Following significant prior art, this paper proposes a
pureattribute to specify that a function
or statement is free of observable side effects.