| Online Eiffel Documentation

EiffelStudio

# EiffelBase Introduction

EiffelBase, covered by the open-source IFFEL License, is one of the principal contributions of Eiffel: a library of fundamental structures and algorithms covering the basics of computing, and resulting from a "Linnaean" effort at a general-purpose taxonomy of computing structures.

## Components

- The Kernel cluster include core classes used in all Eiffel systems. These include a universal class providing facilities potentially useful for all classes: ANY. Every class is a descendant of this classes. The kernel also defines classes needed for exception handling, standard arithmetic operations, hashable elements for use with hash tables and basic arithmetic conversions.
- The Data Structure cluster provides implementations of fundamental data structures and algorithms: Abstract structures, describing broad categories; lists in their various forms; list elements; circular chains; sorted sets and lists; various trees and binary trees; cursor trees; hash tables (dictionaries); various stacks, queues and priority queues; and more.
- The Support cluster provides helper classes for specific needs. These needs include basic math support, random numbers generation, and a few other topics such as the list of ASCII constants.