Home » Blog » Categories » Articles & Books

Articles & Books

A date and time library for use with C++11 and C++14 -- Howard Hinnant

By Ion Gaztañaga | Jul 22, 2015 08:47 AM | Tags: c++14 c++11

This paper fully documents a date and time library for use with C++11 and C++14.

Library documentation:

by Howard Hinnant

From the article:

Implementation

This entire library is implemented in a single header: date.h and is open source (with generous open source terms — not generous enough? Contact me, I'm flexible).

It uses the algorithms from chrono-Compatible Low-Level Date Algorithms. If you want detailed explanations of the algorithms, go there.

It performs best with C++14, which has vastly improved constexpr rules. However, the library will auto-adopt to C++11, sacrificing several constexpr declarations. In C++11, this will effectively transfer some computations that should be done at compile-time to run-time. Porting to C++98/03 has not been attempted.

Overview

This library builds date and date/time support on top of the <chrono> library. However it does not support timezones nor leap seconds. A separate library is provided, built on top of this one, for timezone and leap second support. Thus you only pay for such support if you need it.

RVO V.S. std::move -- Zhao Wu

By Mantosh Kumar | Jul 19, 2015 11:05 PM | Tags: intermediate c++11

Discussion about the RVO optimization technique & std::move.

RVO V.S. std::move

by Zhao Wu

From the article:

To summarize, RVO is a compiler optimization technique, while std::move is just an rvalue cast, which also instructs the compiler that it's eligible to move the object. The price of moving is lower than copying but higher than RVO, so never apply std::move to local objects if they would otherwise be eligible for the RVO.

Efficient optional values -- Andrzej Krzemieński

By Felix Petriconi | Jul 16, 2015 11:48 PM | Tags: intermediate boost

Andrzej goes into some details of optional values in his recent blog post.

Efficient optional values

by Andrzej Krzemieński

From the article:

What do you use Boost.Optional for? In my experience, the answer was typically one of the following:

  1. Because my type T has no null state (like -1) that would indicate that I have no proper value.
  2. Because, I need to perform a two-phase initialization (I cannot initialize my T yet, but I already need it alive).
  3. Because I need an interface that would indicate to the type system that my value may not be there and that its potential absence should be checked by the users.

In this post we will focus exclusively on the third motivation.

Bitesize Modern C++: using aliases--Glennan Carnie

By Adrien Hamelin | Jul 16, 2015 11:25 AM | Tags: c++11 basics

Do you know how to use type aliasing?

Bitesize Modern C++: using aliases

by Glennan Carnie

From the article:

In a C++ program it is common to create type aliases using typedef. A type alias is not a new type, simply a new name for an existing declaration. Used carefully, typedef can improve the readability and maintainability of code – particularly when dealing with complex declarations...

Programmatic access to the call stack in C++--Eli Bendersky

By Adrien Hamelin | Jul 15, 2015 07:46 AM | Tags: advanced

The call stack can be accessed without debugger too:

Programmatic access to the call stack in C++

by Eli Bendersky

From the article:

Sometimes when working on a large project, I find it useful to figure out all the places from which some function or method is called. Moreover, more often than not I don't just want the immediate caller, but the whole call stack. This is most useful in two scenarios - when debugging and when trying to figure out how some code works...

PeriodicFunction--Tony “Bulldozer00” (BD00) DaSilva

By Adrien Hamelin | Jul 15, 2015 12:05 AM | Tags: intermediate c++11

An interesting article showing how to call a function periodically:

PeriodicFunction

by Tony “Bulldozer00” (BD00) DaSilva

From the article:

In the embedded systems application domain, there is often the need to execute one or more background functions at a periodic rate. Before C++11 rolled onto the scene, a programmer had to use a third party library like ACE/Boost/Poco/Qt to incorporate that functionality into the product. However, with the inclusion of std::thread, std::bind, and std::chrono in C++11, there is no longer the need to include those well-crafted libraries into the code base to achieve that specific functionality...

Three years of Meeting C++

By Meeting C++ | Jul 10, 2015 10:41 AM | Tags: None

A little more then 3 years ago, Meeting C++ launched:

Three years of Meeting C++

by Jens Weller

From the article:

Its now a little more then 3 years that I went public with the plans for a new C++ Conference. Today, Meeting C++ is much more, it has become a platform for C++ User Groups, but also a great source of C++ related news. I had no idea, how much my life would change, when I started to make serious plans for the very first Meeting C++ conference...

New Concurrency Features in C++14 -- Anthony Williams

By Felix Petriconi | Jul 8, 2015 03:17 AM | Tags: c++14

Anthony Williams describes shared locking in his recent blog post.

New Concurrency Features in C++14

by Anthony Williams

From the article:

It might have been out for 7 months already, but the C++14 standard is still pretty fresh. The changes include a couple of enhancements to the thread library, so I thought it was about time I wrote about them here.

The biggest of the changes is the addition of std::shared_timed_mutex. This is a multiple-reader, single-writer mutex. This means that in addition to the single-ownership mode supported by the other standard mutexes, you can also lock it in shared ownership mode, in which case multiple threads may hold a shared ownership lock at the same time.

This is commonly used for data structures that are read frequently but modified only rarely. When the data structure is stable, all threads that want to read the data structure are free to do so concurrently, but when the data structure is being modified then only the thread doing the modification is permitted to access the data structure.

 

Cache-friendly binary search--Joaquín M López Muñoz

By Adrien Hamelin | Jul 6, 2015 07:59 AM | Tags: performance intermediate

An interesting approach to sorted search:

Cache-friendly binary search

by Joaquín M López Muñoz

From the article:

High-speed memory caches present in modern computer architectures favor data structures with good locality of reference, i.e. the property by which elements accessed in sequence are located in memory addresses close to each other. This is the rationale behind classes such as Boost.Container flat associative containers, that emulate the functionality of standard C++ node-based associative containers while storing the elements contiguously (and in order)...