CppCast Episode 84: Memory Algorithm Proposal with Brittany Friedman

by Rob Irving and Jason Turner

Brittany Friedman is a dense collection of matter formed from molecules originating inside the sun. She currently works as a programmer at Gearbox Software, where she weaves ones and zeroes into intricate little patterns. Her proposal for new memory management algorithms was accepted for C++17 and a bug that she filed against the C++ standard was fixed the way that she recommended. So basically you do not want to trifle with her.

C++Now 2017 Call for Submissions

C++Now builds upon the resounding success of previous BoostCon and C++Now conferences, We look forward to considering your proposals, among those from leading speakers from the entire C++ community, to make C++Now 2017 even better.

The C++Now Conference is dedicated to discussion and education about C++, an open and free language and standard.  Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core library and tool developers, and researchers pushing the boundaries of computing. The program fosters interaction and engagement within and across those groups, with an emphasis on discussion.

As a multi-paradigm language, C++ is a melting pot with the most compelling ideas from other programming communities blended in powerful ways. Historically, some of the most popular sessions at C++Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more.  Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure.

Presentations at C++Now 2017 should generally focus on the now established C++11 and C++14 standards, the upcoming C++17 standard, and how those standards shape C++’s future. However, by no means is this intended to restrict the topics of proposals we hope to see. Any other topic related to C++, as described below, is suitable for submission.

This year’s window for submitting is shorter than normal. Submissions must be in by February 3rd, less than four weeks away.

Lazy generators: template deduction on the left-hand side

by Simon Brand

If you are constructing or assigning to a variable from some function template call, the template magic usually occurs on the right-hand side of the expression. But what if we could deduce the type we want from the left-hand side of the construction?

The Salami Method

by Adi Shavit

The Salami Method finely distinguishes between the different aspects and layers required for exposing platform-independent C++ on different “specific” platforms. At its extreme it strives to create a single, thin, transparent layer for each such aspect so that each layer is more easily built, tested, debugged, managed and maintained.

Sorting by indices, part 1

by Raymond Chen

Okay, now we're going to start using the apply_permutation function that we beat to death for first part of this week...

Applying a permutation to a vector, part 3

by Raymond Chen

We spent the last two days looking at the apply_permutation function and arguing pros and cons of various implementation choices. Today's we're going to look at generalization...

Applying a permutation to a vector, part 2

by Raymond Chen

We left off our study of the apply_permutation function by wondering which version is bettern: the moving version of the swapping version. I'm not certain I have the answer, but here's my analysis...

Applying a permutation to a vector, part 1

by Raymond Chen

Suppose you have a vector indices of N integers that is a permutation of the numbers 0 through N − 1. Suppose you also have a vector v of N objects. The mission is to apply the permutation to the vector. If we let v2 represent the contents of the vector at the end of the operation, the requirement is that v2[i] = v[indices[i]] for all i...

Stack Elision?

by Jason Turner

In this episode Jason explores Clang's and GCC's ability to elide stack operations during optimization.

A new way of blogging about C++

by Yehonathan Sharvit

This blog post is about to show a new way of blogging about C++.

Look at a typical blog post about C++: The post usually presents a couple of code snippets. As I see it, there are two pains with code snippets:

1. they contain the input and the output but not the actual evaluation of the input
2. it’s impossible for the reader to modify the output...