List structures

As mentioned, lots of searches and traversals are done on the tables in olsrd. By default the scheduler calls functions that traverses all tables to remove timed out entries, at every poll (defaults to every 0.1 seconds). In addition close to all message parsing and generation is based upon searching these tables. It is pretty obvious that one will benefit from using data-structures that minimizes the search time and eases the process of adding and deleting entries. We will take a look at the most commonly used data structures for such operations.