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 <ah-concepts.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 >
	Hash-based dynamic set (defined in tpl_dynSetHash.H). More...
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< T >	Aleph::join (const Container< T > &c1, const Container< T > &c2)
	Return union of two containers as a DynList (no duplicates).
template<typename T , template< typename > class Container>
DynList< T >	Aleph::intercept (const Container< T > &c1, const Container< T > &c2)
	Return intersection of two containers as a DynList.
template<typename T , template< typename > class Container>
DynList< T >	Aleph::unique (const Container< T > &c)
	Return elements that appear exactly once across the container.
template<typename T , template< typename > class Container>
DynList< T >	Aleph::repeated (const Container< T > &c)
	Return elements that appear more than once in the container.
template<typename T , template< typename > class Container>
DynList< std::pair< T, size_t > >	Aleph::repeated_with_index (const Container< T > &c)
	Return repeated elements paired with their occurrence count.

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.