Skip to main content

ACCU 2014 Conference - Bristol, UK

Last week I participated in ACCU 2014 Conference in Bristol (UK). That was great and fruitful time for me where I find out lot of information about C++ and Software development in general, as well as I met few interesting people. I would like to share few information from that conference with you.
During the conference we listen interesting speeches of many C/C++ experts such as:
    • Howard Hinnant - he presened interesting speech about C++11 Move Semantics, presenting interesting short explanation how std::move actually work as well as detail presentation of generation of Special Member Function (class members which are automatically generated by compiler) for different cases with and without move constructor and move assignment operator. At the end he presented detail implementation of basic move constructor and move assignment operator. Detail explanation of move semantics will be presented on this blog soon.
    • Anthony Williams - author of book C++ Concurrency in Action and developer of C++11 multi-threading functionality presented speech about future of C++ concurrency in C++14 and C++17 standards. He talked about new features which will be added (ex. executors, barriers) and about plans of including parallel versions of STL algorithms. 
    • Hubert Matthews - respond question "Where C++ is headed?". He presented some aspects of future of C++ like: performance optimization based on move semantics, template meta-programming, task oriented parallelism, making C++ more dynamic (with lambda functions syntax is similar to JavaScript)
    • Burkhard Kloss - presented interesting introduction to Machine Learning.

Just before conference I became member of ACCU organization. I hope to learn a lot from C++ experts being members of ACCU as well as be active member and give my best for the organization.

Thank you very much to all ACCU 2014 Conference participants for great time spending together. I hope to see you all next year.


Labels:

Comments

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
Post a Comment
Read more

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
Post a Comment
Read more

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
Post a Comment
Read more