Elm  1.0
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Data Structures

Classes

class  elm::concept::Adapter
 
class  elm::genstruct::AssocList< K, T, C, E, N >
 
class  elm::genstruct::DAGNode< T >
 
class  elm::genstruct::DLList< T, E >
 
class  elm::genstruct::FragTable< T >
 
class  elm::genstruct::HashTable< K, T, H >
 
class  elm::genstruct::SLList< T, E >
 
class  elm::genstruct::Table< T >
 
class  elm::genstruct::Tree< T >
 
class  elm::genstruct::Vector< T >
 

Detailed Description

ELM provides a collection of generic/template based data structures. All data structure implements the elm::concept::Collection concept. The sections below list the different data structures according to the way they are used. A specific data structure may be listed in different sections.

Utility Classes

To make ELM container more flexibility, utility classes allow tuning finely the behavior of the containers. Utility classes (and mainly concepts)includes:

Array

An array (concept ::concept::Array and/or elm::concept::MutableArray) whose items are accessible by their index.

Map

Map provides associative array whose items are retrievable thanks to a specific key (concept Map and/or MutableMap).

Stack

A stack implements the usual Last-In-First-Out usage (Stack).

Queue

A queue implements the usual First-In-First-Out usage (Queue).

List

A list is a specific collection that allows to list the contained arguments (List) using an iterator.

Tree

Tree are may be implemented according different data structures.

Set

Set stores items without any order and provides fast access to contained items (Set).

Graph Structure

Deprecated Data Structure

ELM is currently moving to a more powerful and easier to use data structure model. Whatever, old data structure are maintained for ascending compatibility but are classified as deprecated: