EiffelBase is intended to be a general, high-quality library covering the basic needs of everyday programming. It offers data structures to organize data and algorithms which can be applied to those data structures. The library design dates back to 1985 in its first form; that it has stood the test of time and is still used in so many new applications is testimony to its solidity.

The goal of this project is to extend EiffelBase in a number of areas not yet covered. In particular, the task is to add library classes for graphs, topological sort and B trees. The classes should comply to the overall design of EiffelBase, thus be of high quality and fit well into the existing class hierarchy.

Project plan (PDF)
Final report (PDF)