Advanced Programming - 2020/2021

Benedetta Liberatori - Ciro Antonio Mami - Davide Roznowicz

The repository contains the following:

• include : contains the headers: BST.hpp (declaration of the fundamental members of the class BST, together with the constructors and the copy/move semantics as well as declaration of the member functions); BST.tpp (definition of the templated functions for the class BST); iterators.hpp (implementation of the class iterator); node.hpp (implementation of the class node).

• benchmark: contains the code used to perform the benchmarking together with the .csv with the timings, whose results are presented in the final part of the report.

• main.cpp: main

• Doxygen: contains the Doxygen documentation (html and latex)

• Makefile: is used to compile the main.cpp (command: make main.x) and generate the Doxygen documentation (command: make dox). By typing make, both the main.x and the documentation are generated.

• Report.md: contains a detailed characterization of the classes/structures and most relevant functions. Some final charts illustrate some benchmarking for finding a key, both using our own classes/functions and built-in classes such as maps.

The simple idea to compute the reverse dictionary has been to exploit comprehension, which is a powerful tool to create new list from already existing list, and set which is a container very useful when we want to organize data in unique values. In particular we select the new keys of reverse dictionary from the set of the unique values of the original dictionary, and the values instead are taken from the list of the orginal keys selecting only the one which were keys (in the original dictionary) of the value which is now the key.