|
GiNaC
1.6.2
|
Replacement for map<> using hash tables. More...
#include <algorithm>#include <functional>#include <iterator>#include <list>#include <utility>Go to the source code of this file.
Classes | |
| class | GiNaC::exhashmap< T, A > |
| Pair Associative Container with 'ex' objects as keys, that is implemented with a hash table and can be used as a replacement for map<> in many cases. More... | |
| class | GiNaC::exhashmap< T, A >::exhashmap_iterator< Pointer, Reference, TableIterator > |
| class | GiNaC::exhashmap< T, A >::value_compare |
Namespaces | |
| namespace | GiNaC |
CRC32 hash function. | |
| namespace | GiNaC::internal |
| namespace | std |
Enumerations | |
| enum | { GiNaC::internal::num_primes = 29 } |
Functions | |
| unsigned long | GiNaC::internal::next_prime (unsigned long n) |
| template<typename T , template< class > class A> | |
| void | std::swap (GiNaC::exhashmap< T, A > &lhs, GiNaC::exhashmap< T, A > &rhs) |
| Specialization of std::swap() for exhashmap. | |
Variables | |
| static const unsigned long | GiNaC::internal::prime_list [num_primes] |
Replacement for map<> using hash tables.
Definition in file hash_map.h.