void resize(size_type n) Hashed Associative Container Increases the bucket count to at least n. hasher hash_funct() const Hashed Associative Container Returns the hasher object used by the hash_set. key_equal key_eq() const Hashed Associative Container Returns the key_equal object used by the hash_set. hash_set() Container Creates an empty hash_set. hash_set(size_type n) Hashed Associative Container Creates an empty hash_set with at least n buckets. hash_set(size_type n, const hasher& h) Hashed Associative Container Creates an empty hash_set with at least n buckets, using h as the hash function. hash_set(size_type n, const hasher& h, const key_equal& k) Hashed Associative Container Creates an empty hash_set with at least n buckets, using h as the hash function and k as the key equal function. template <class InputIterator> hash_set(InputIterator f, InputIterator l) [1] Unique Hashed Associative Container Creates a hash_set with a copy of a range. template <class InputIterator> hash_set(InputIterator f, InputIterator l, size_type n) [1] Unique Hashed Associative Container Creates a hash_set with a copy of a range and a bucket count of at least n. template <class InputIterator> hash_set(InputIterator f, InputIterator l, size_type n, const hasher& h) [1] Unique Hashed Associative Container Creates a hash_set with a copy of a range and a bucket count of at least n, using h as the hash function. hash_set(InputIterator f, InputIterator l, size_type n, const hasher& h, const key_equal& k) [1] Unique Hashed Associative Container Creates a hash_set with a copy of a range and a bucket count of at least n, using h as the hash function and k as the key equal function. hash_set(const hash_set&) Container The copy constructor. hash_set& operator=(const hash_set&) Container The assignment operator void swap(hash_set&) Container Swaps the contents of two hash_sets. pair<iterator, bool> insert(const value_type& x) Unique Associative Container Inserts x into the hash_set. template <class InputIterator> void insert(InputIterator f, InputIterator l) [1] Unique Associative Container Inserts a range into the hash_set. void erase(iterator pos) Associative Container
Добавить отзыв
ВСЕ ОТЗЫВЫ О КНИГЕ В ИЗБРАННОЕ

0

Вы можете отметить интересные вам фрагменты текста, которые будут доступны по уникальной ссылке в адресной строке браузера.

Отметить Добавить цитату