资 源 简 介
Generic Data Structures
Data structures or containers (e.g. HashMap, RedBlackTree, DoublyLinkedList) are used in almost every program. They offer us a particular way of storing and organizing the data so that it can be used efficiently. Typically, efficient data structures are crucial for designing efficient algorithms. There are different types of data structures, each suited for more or less specific application.
Problems arise when we need complex queries on our data. Complex queries require the use of different types of data structures on the same data. Typically, this is hard to achieve since most data structure implementations require complete control over the data they organize (e.g. allocation of memory for entries they contain).
We have found a way that enables us to generically implement data structures in C or C++ which can be easily embedded and achieve high performance and low memory usage. The data structures are implemented as C header file
