Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
tpl_dynSetHash.H File Reference

Dynamic set implementations based on hash tables. More...

#include <algorithm>
#include <typeinfo>
#include <ahDry.H>
#include <ahIterator.H>
#include <primes.H>
#include <htlist.H>
#include <tpl_dynArray.H>
#include <tpl_dynMapOhash.H>
#include <tpl_dynLhash.H>
#include <tpl_linHash.H>
Include dependency graph for tpl_dynSetHash.H:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  Aleph::DynHashTable< Key, HashTable, Cmp >
 Self-adjusting dynamic hash table. More...
 
class  Aleph::DynHashTable< Key, HashTable, Cmp >::Iterator
 
struct  Aleph::DynSetLhash< Key, Cmp >
 
struct  Aleph::DynSetLinHash< Key, Cmp >
 
class  Aleph::DynMapHashTable< Key, Data, HashTable, Cmp >
 

Namespaces

namespace  Aleph
 Main namespace for Aleph-w library functions.
 

Typedefs

template<typename Key , class Cmp = Aleph::equal_to<Key>>
using Aleph::DynSetHash = DynHashTable< Key, LhashTable, Cmp >
 
template<typename Key , typename Data , class Cmp = Aleph::equal_to<Key>>
using Aleph::DynMapLinHash = DynMapHashTable< Key, Data, LinearHashTable, Cmp >
 
template<typename Key , typename Data , class Cmp = Aleph::equal_to<Key>>
using Aleph::DynMapHash = DynMapHashTable< Key, Data, LhashTable, Cmp >
 

Functions

template<typename T , template< typename > class Container>
DynList< TAleph::join (const Container< T > &c1, const Container< T > &c2)
 
template<typename T , template< typename > class Container>
DynList< TAleph::intercept (const Container< T > &c1, const Container< T > &c2)
 
template<typename T , template< typename > class Container>
DynList< TAleph::unique (const Container< T > &c)
 
template<typename T , template< typename > class Container>
DynList< TAleph::repeated (const Container< T > &c)
 
template<typename T , template< typename > class Container>
DynList< std::pair< T, size_t > > Aleph::repeated_with_index (const Container< T > &c)
 

Detailed Description

Dynamic set implementations based on hash tables.

This file provides DynSetHash and related hash-based set implementations offering O(1) average-case insertion, deletion, and search. Multiple hash table variants are supported including linear probing and separate chaining.

Author
Leandro Rabindranath León

Definition in file tpl_dynSetHash.H.