Container/bijective-mapping.h File Reference

Classes for representing bijective mappings of finite sets. More...

#include "Container/my-hash-map.h"
#include "Container/mapped-value-iterator.h"
#include "Utility/pre-post-conditions.h"

Include dependency graph for bijective-mapping.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	GrAL::fail_if_undefined
	Policy to fail when undefined item is queried. More...
struct	GrAL::identity_if_undefined
	Policy to return identity when undefined item is queried. More...
class	GrAL::printer_of_bij_mapping< T1, T2, Policy >
	helper class for custom output of a bijective map More...
class	GrAL::bijective_mapping< T1, T2, Policy >
	Represents a one-to-one mapping T1 -> T2. More...
class	GrAL::inverse_mapping< T1, T2, Policy >
	Represents a mapping T2 --> T1 which is the inverse of some bijective_mapping<T1,T2>. This class has reference semantics with respect to bijective_mapping. More...
class	GrAL::domain_of_bijective_mapping< T1, T2, Policy >
	Represents the domain of definition of a mapping. This class allows STL-style iteration over the items of type T1. More...
class	GrAL::range_of_bijective_mapping< T1, T2, Policy >
	Represents the range (image) of a bijective mapping . This class allows STL-style iteration over the items of type T2. More...
Functions
template<class T1 , class T2 , class Policy >
void	GrAL::write_bm (bijective_mapping< T1, T2, Policy > const &m,::std::ostream &out)
	write a bijective map to ostream
template<class T1 , class T2 , class Policy >
void	GrAL::read_bm (bijective_mapping< T1, T2, Policy > &m,::std::istream &in)
	read a bijective map from istream
template<class T1 , class T2 , class Policy >
printer_of_bij_mapping< T1, T2, Policy >	GrAL::Printer (bijective_mapping< T1, T2, Policy > const &m)
	helper function for custom output of a bijective map

---

Detailed Description

Classes for representing bijective mappings of finite sets.

Definition in file bijective-mapping.h.