aGrUM  0.13.2

Set of pairs of elements with fast search for both elements. More...

+ Collaboration diagram for Bijections:

Detailed Description

Set of pairs of elements with fast search for both elements.

The gum::Bijection class is designed for modeling a gum::Bijection between two sets, the idea is following :

Classes

class  gum::BijectionImplementation< T1, T2, Alloc, Gen >
 A non scalar implementation of a Bijection. More...
 
class  gum::BijectionIteratorStaticEnd
 A class which creates the static iterator used by gim::Bijections. More...
 
class  gum::BijectionIteratorGet< gen >
 Dummy classes for discriminating scalars and non-scalars operators and -> wihtout any overhead. More...
 
class  gum::BijectionIteratorSafe< T1, T2 >
 Safe iterators for bijectionIterator. More...
 
class  gum::BijectionIterator< T1, T2 >
 Unsafe iterators for bijection. More...
 
class  gum::Bijection< T1, T2, Alloc >
 Set of pairs of elements with fast search for both elements. More...