eddic 1.2.0 – Single inheritance, copy construction

eddic Logo

I’m happy to release the version 1.2.0 of the EDDI Compiler (eddic). This new version introduces several major changes to the language. First of all, structures can now inherits from another structure. When it is done, the structure can use the members of the parent class. Below is an example of single inheritance in EDDI: [...]



C++ Benchmark – std::list VS boost::intrusive::list

Boost Logo

Recently, we saw that the std::list performance was not really good when it comes to searching it or iterating through it.In this post, we will see an alternative to the std::list: the boost::intrusive::list from the Boost C++ libraries. It is not a well known library but it can be useful in some specific cases. I [...]



C++ benchmark – std::vector VS std::list VS std::deque

Charts

Last week, I wrote a benchmark comparing the performance of std::vector and std::list on different workloads. This previous article received a lot of comments and several suggestions to improve it. The present article is an improvement over the previous article. In this article, I will compare the performance of std::vector, std::list and std::deque on several [...]



C++ benchmark – std::vector VS std::list

C++ Logo

A updated version of this article is available: C++ benchmark – std::vector VS std::list VS std::deque In C++, the two most used data structures are the std::vector and the std::list. In this article, we will compare the performance in practice of these two data structures on several different workloads. In this article, when I talk [...]



EDDI Compiler 1.1.4 – Graph Coloring Register Allocation

eddic Logo

I’m proud to announce the release of the version 1.1.4 of the EDDI Compiler (eddic). This version has taken me much more time than I thought but I also added much more features than I thought too. There are few changes of the language itself, the main changes are in the optimization passes or in [...]



Integer Linear Time Sorting Algorithms

C++ Logo

Update: The code is now more C++ Most of the sorting algorithms that are used are generally comparison sort. It means that each element of the collection being sorted will be compared to see which one is the first one. A comparison must have a lower bound of Ω(n log n) comparisons. That is why [...]



EDDI Compiler 1.1.3 – Templates

eddic Logo

I finished the version 1.1.3 of the EDDI Compiler (eddic). The main improvement to the language is the support of templates. The syntax is more or less the same as the syntax of C++ templates, but the features are much more limited. In EDDI, you can declare class templates and function templates. Class templates can [...]



EDDI Compiler 1.1.2 – Read command line

eddic Logo

I finished the eddi compiler (eddic) version 1.1.2. It took me a long time because of a lot of other things I had to do this month. This version includes two major changes. First, this version adds a new type for characters (char). A char can be declared using a char literal (‘b’ for instance) or [...]



Algorithms books Reviews

Book Review

To be sure to be well prepared for an interview, I decided to read several Algorithms book. I also chosen books in order to have information about data structures. I chose these books to read: Data Structures & Algorithm Analysis in C++, Third Edition, by Clifford A. Shaffer Algorithms in a Nutshell, by George T. [...]



EDDI Compiler 1.1.1 – Dynamic Memory Allocation and Constructors/Destructors

eddic Logo

As I’m in holiday, the work is going pretty fast. The version 1.1.1 of the EDDI Compiler (eddic) is available. This version introduces two major changes. The first is the support of dynamic memory allocation. You can allocate a struct or a standard type in help using the new operator. The memory can be released using the delete operator. Another [...]