Namely, how can we merge multiple type-erased interfaces into one single interface. A similar question is also asked in the end of the first talk: How to apply type erasure to types with overlapping interfaces?

GCC recently (version 4.9) gained Undefined Behavior Sanitizer (ubsan), a run-time checker for the C and C++ languages. In order to check your program with ubsan, compile and link the program with -fsanitize=undefined option. Such instrumented binaries have to be executed; if ubsan detects any problem, it outputs a “runtime error:” message, and in most cases continues executing the program.

Clôner une VM Virtualbox entraîne la création d'un nouveau "Hardware UUID" qui cause la perte de l'activation de Windows sur la copie.

Pour résoudre le problème, il faut appliquer le même "Hardware UUID" au clône.

Clôner la machine virtuelle depuis l'interface VirtualBox (clic droit / clôner)
Ouvrir une ligne de commande et saisir :

C:\Program Files\Oracle\VirtualBox\vboxmanage showvminfo NomDeLaMachineSource

(il faut respecter la casse dans le nom de la machine source)

Chercher dans le résultat de la commande "Hardware UUID:" et copier l'UUID correspondant.

On va maintenant appliquer cet UUID à la nouvelle machine :

C:\Program Files\Oracle\VirtualBox\vboxmanage modifyvm NomMachineCible --hardwareuuid f9c76ae5-044f-49a3-b493-82d859cfbc64

Windows devrait maintenant considérer la clef de licence comme valide et enregistrée.

Create a backend module for llvm

git-remote-hg
git-remote-bzr

A list of c++'s containers and how to choose a container in c++.

docker run -ti --rm \
-e DISPLAY=$DISPLAY \
-v /tmp/.X11-unix:/tmp/.X11-unix \
firefox

see also: https://blog.bearstech.com/2014/10/isolation-par-docker.html

Merge sort is a wonderful, widely used sorting algorithm, with consistent data-independent performance. When not in-place merge sorting, that is when the source and destination array are not the same, performance is O(nlgn). When in-place, so the source and destination array are the same, performance is slightly slower: O(nlg2n). Because not-in-place sorting algorithms are faster, implementations frequently allocate memory for the destination array, copy the sorted result back into the source array, and proceed to deallocate the destination array. STL uses this type of a strategy to construct a fast in-place sort from a faster not-in-place sort whenever memory is available. Of course, when memory is not available, in-place sort is necessary, and STL also provides such an implementation.

In this post we will learn C++ templates in depth: Class and function templates, template parameters, variadic templates, all with in depth examples.