Old Data Structures

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. More...

Classes
class	Adapter
class	Tree< T >
class	DAGNode
class	DLList
class	FragTable
class	Table
class	Vector
class	VectorQueue< 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:

• elm::concept::Adapter – separation between key and value concerns.
• elm::Comparator – comparison of keys for sorted containers.

Array

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

• AllocatedTable – ELM wrapper around C++ table managing its memory
• FixArray – Embeds a fixed size C++ table
• FragTable – extensible array accepting big number of items
• Table – ELM wrapper around C++ table
• Vector – extensible array
• VectorQueue – extensible array manageable as a queue

Map

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

• AssocList – associative single link list
• HashTable – map implemented as a hashing table
• SortedBinMap – map implemented by a binary tree

Stack

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

• DLList – double link list (bidirectionnal traversal)
• SLList – single link list (unidirectionnal traversal)
• Vector – extensible table

Queue

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

• DLList – double link list (bidirectionnal traversal)
• ListQueue – single-link list implementation of queue.
• VectorQueue – extensible array manageable as a queue

List

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

• AllocatedTable – ELM wrapper around C++ table managing its memory
• AVLTree – AVL balanced binary tree
• DLList – double link list (bidirectionnal traversal)
• FragTable – extensible array accepting big number of items
• HashTable – map implemented as a hashing table
• SortedBinMap – map implemented by a binary tree
• SLList – single link list (unidirectionnal traversal)
• SortedList – sorted single-link list
• Table – ELM wrapper around C++ table
• Vector – extensible array
• VectorQueue – extensible array manageable as a queue

Tree

Tree are may be implemented according different data structures.

• SortedBinTree – sorted binary tree
• Tree – children-sibling list tree implementation

Set

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

• AVLTree – AVL balanced tree set
• Vector – extensible table

Graph Structure

• DAGNode – Directed Acyclic Graph implementation

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:

• elm::genstruct::SortedSLList