File	Date	Author	Commit
container	2009-05-02	Eric Bezault	[133b49] Added some void-safety.
dispenser	2008-09-28	Eric Bezault	[552b72] pretty-printed
list	2009-05-02	Eric Bezault	[133b49] Added some void-safety.
set	2009-09-06	Eric Bezault	[2819e9] Relaxed precondition of `put' and `put_last' in...
sort	2009-04-22	Eric Bezault	[92c302] Void-safety: replaced 'has (Void)' and 'has_ite...
support	2009-02-26	Eric Bezault	[9e34ef] Removed classes and features that had been mark...
table	2009-09-06	Eric Bezault	[2819e9] Relaxed precondition of `put' and `put_last' in...
Readme.txt	2002-04-02	Eric Bezault	[bd72ef] Upgraded license from "Eiffel Forum Freeware Li...
build.eant	2008-04-22	Eric Bezault	[cf7c62] Removed remaining references to Visual Eiffel.
library.xace	2007-01-26	Eric Bezault	[a82fea] Use the MIT License

Read Me

Gobo Eiffel Structure Library

When this library has been developed, there was no data structure library
standard, and no portable library was publicly available. Each Eiffel
compiler provides its own data structure library, but none of them is
portable (see portability issues in "$GOBO/doc/portability"). This
library has hence been developed as a foundation for other portable
libraries provided in this package. The Gobo Eiffel Structure Library
contains the classic containers needed in everyday programming, such
as lists, stacks or tables, and provides different implementations such
as linked, bilinked, arrayed or hashed. There is nothing really new
in this library. Most ideas come from other existing data structure
libraries, such as EiffelBase from ISE or the Booch Components from
Tower Technology. It also follows the conventions specified in Dr Meyer's
book: "Reusable Software, the base object-oriented component libraries".

Clusters:

container
    All containers are descendant of class DS_CONTAINER. Classes are
    generic, the generic parameter representing the type of the items
    held in the containers. This cluster contains abstract notions
    such as traversable, resizable or sortable properties.
dispenser
    FIFO (e.g. queues) and LIFO (e.g. stacks) containers.
list
    Traversable lists.
set
    Structures containing at most one occurrence of each item.
sort
    Algorithms to sort containers.
support
    Support classes such as cells, pairs or linkable cells.
table
    Structures whose items are accessible by keys. One possible
    implementation of tables is hash tables.

A more detailed documentation for this library, in HTML format, is
provided in "$GOBO/doc/structure".

--
Copyright (c) 1997-2001, Eric Bezault and others