Skip to main content

Boost.DateTime - Selected date operations

Today I would like to present you operations related to date and time using Boost.DateTime library. This library contains set of classes, templates and algorithms prepared for date and time related tasks. This article focuses on date operations. Time operations will be presented in one of the future articles.

Example of usage some basic Boost.DateTime date operations you can see here:
Output of this example is (for day 2 January 2014):
All below operations will be based on boost::gregorian namespace. We created alias dateTime for that namespace for more convenient use.

In point I we are using universal_day() method for getting current day according to UTC time zone. Of course output of this and other date-related functions depends on date of invoking. Therefore you will get other output of your application every day you will invoke it.
universal_day() function returns Boost date class object which has lot of functions for date manipulation and displaying.

In point II we are using months class object to add one month to our current date. Thanks to overloading operator+() you can add date and months class objects and iterate through next and previous months. If you will add one month to the date 1-Jan-2014 you will receive 1-Feb-2014. However if you will add one month to date 31-Jan-2013 you will receive 28-Feb-2013 (because all dates are end days of consecutive months).

In point III we are using date_from_iso_string() method for conversion string formatted as "YYYYMMDD" to date class and display its value to standard output.

Point IV presents data_duration class object which allow you calculate time intervals. We are using two our date objects today and myBirthdayDate to calculate interval of live of person who was birth at 30-Jun-1985. Then we are using days() method of date_duration class to present calculated interval as number of days.

Point V present how to iterate through consecutive days using day_iterator class and overloaded operator++(. As you can see this iteration is adequate to mechanism of iteration between consecutive elements of STL containers. Thanks to that we have intuitive way to iterate throgh dates, too.

Of course DateTime library has more useful functions to operate on dates. Lots of details and examples you can find on the offical Boost.DateTime library documentation site here: http://www.boost.org/doc/libs/1_55_0/doc/html/date_time/examples.html

Example from this article you can find on our GitHub account here: https://github.com/xmementoit/CppAdventureExamples/tree/master/boost/dateTime


Comments

  1. Boost is very big and hard to learn library. I appreciate that you would like to explain it here step by step.

    ReplyDelete

Post a Comment

Popular posts from this blog

GDB Automatic Deadlock Detector

Have you ever had a problem with detection deadlock between threads in your C/C++ application? Would you like to do that automatically? Try this GDB Automatic Deadlock Detector from my github: GDB Automatic Deadlock Detector Picture source: http://csunplugged.org/wp-content/uploads/2015/03/deadlock.jpg1286488735

STL - count and count_if algorithms

One of the basic and most useful STL algorithms is algorithm which can be used to count number of elements within selected container according to specified criteria. In order to do that we can use std::count or std::count_if algorithm. std::count (firstElementIterator, lastElementIterator, elementForSearch) - is function which will go through container using firstElementIterator and lastElementIterator and return number of container elements which value is equal elementForSearch std::count_if (firstElementIterator, lastElementIterator, UnaryPredicateFunction) - is function which examine range from firstElementIterator to lastElementIterator and return number of container elements which fulfill UnaryPredicateFunction criteria. UnaryPredicateFunction is function having following signature: bool functionName(const Type& a) . So, count_if returns number of elements where UnaryPredicateFunction returns true for. For better understanding let's take a

Advanced C++ - Stack unwinding

Stack unwinding is normally a concept of removing function entries from call stack (also known as Execution stack, Control stack, Function stack or Run-time stack). Call Stack is a stack data structure that stores active functions' addresses and helps in supporting function call/return mechanism. Every time when a function is called, an entry is made into Call stack which contains the return address of the calling function where the control needs to return after the execution of called function. This entry is called by various names like stack frame , activation frame or activation record. With respect to exception handling , stack Unwinding is a process of linearly searching function call stack to reach exception handler. When an exception occurs, if it is not handled in current function where it is thrown, the function Call Stack is unwound until the control reaches try block and then passes to catch block at the end of try block to handle exception. Also, in this proc