unordered_set.h File Reference

#include "platform.h"
#include "algorithm.h"
#include "debug_count.h"
#include "error_handler.h"
#include "exception.h"
#include "functional.h"
#include "hash.h"
#include "initializer_list.h"
#include "intrusive_forward_list.h"
#include "iterator.h"
#include "nth_type.h"
#include "parameter_type.h"
#include "placement_new.h"
#include "pool.h"
#include "type_traits.h"
#include "utility.h"
#include "vector.h"
#include "private/comparator_is_transparent.h"
#include <stddef.h>

Go to the source code of this file.

Classes
class	etl::unordered_set_exception
class	etl::unordered_set_full
class	etl::unordered_set_out_of_range
class	etl::unordered_set_iterator
class	etl::iunordered_set< TKey, THash, TKeyEqual >
struct	etl::iunordered_set< TKey, THash, TKeyEqual >::node_t
class	etl::iunordered_set< TKey, THash, TKeyEqual >::iterator
class	etl::iunordered_set< TKey, THash, TKeyEqual >::const_iterator
class	etl::unordered_set< TKey, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >
	A templated unordered_set implementation that uses a fixed size buffer. More...

Namespaces
namespace	etl

Functions
template<typename TKey, typename THash, typename TKeyEqual>
bool	etl::operator== (const etl::iunordered_set< TKey, THash, TKeyEqual > &lhs, const etl::iunordered_set< TKey, THash, TKeyEqual > &rhs)
template<typename TKey, typename THash, typename TKeyEqual>
bool	etl::operator!= (const etl::iunordered_set< TKey, THash, TKeyEqual > &lhs, const etl::iunordered_set< TKey, THash, TKeyEqual > &rhs)