다음을 통해 공유


hash_set Members

Reference

Constructors

hash_set

Constructs a hash_set that is empty or that is a copy of all or part of some other hash_set.

Typedefs

allocator_type

A type that represents the allocator class for the hash_set object.

const_iterator

A type that provides a bidirectional iterator that can read a const element in the hash_set.

const_pointer

A type that provides a pointer to a const element in a hash_set.

const_reference

A type that provides a reference to a const element stored in a hash_set for reading and performing const operations.

const_reverse_iterator

A type that provides a bidirectional iterator that can read any const element in the hash_set.

difference_type

A signed integer type that can be used to represent the number of elements of a hash_set in a range between elements pointed to by iterators.

iterator

A type that provides a bidirectional iterator that can read or modify any element in a hash_set.

key_compare

A type that provides a function object that can compare two sort keys to determine the relative order of two elements in the hash_set.

key_type

A type that describes an object stored as an element of a hash_set in its capacity as sort key.

pointer

A type that provides a pointer to an element in a hash_set.

reference

A type that provides a reference to an element stored in a hash_set.

reverse_iterator

A type that provides a bidirectional iterator that can read or modify an element in a reversed hash_set.

size_type

An unsigned integer type that can represent the number of elements in a hash_set.

value_compare

A type that provides two function objects, a binary predicate of class compare that can compare two element values of a hash_set to determine their relative order and a unary predicate that hashes the elements.

value_type

A type that describes an object stored as an element of a hash_set in its capacity as a value.

Member Functions

begin

Returns an iterator that addresses the first element in the hash_set.

clear

Erases all the elements of a hash_set.

count

Returns the number of elements in a hash_set whose key matches a parameter-specified key.

empty

Tests if a hash_set is empty.

end

Returns an iterator that addresses the location succeeding the last element in a hash_set.

equal_range

Returns a pair of iterators respectively to the first element in a hash_set with a key that is greater than a specified key and to the first element in the hash_set with a key that is equal to or greater than the key.

erase

Removes an element or a range of elements in a hash_set from specified positions or removes elements that match a specified key.

find

Returns an iterator addressing the location of an element in a hash_set that has a key equivalent to a specified key.

get_allocator

Returns a copy of the allocator object used to construct the hash_set.

insert

Inserts an element or a range of elements into a hash_set.

key_comp

Retrieves a copy of the comparison object used to order keys in a hash_set.

lower_bound

Returns an iterator to the first element in a hash_set with a key that is equal to or greater than a specified key.

max_size

Returns the maximum length of the hash_set.

rbegin

Returns an iterator addressing the first element in a reversed hash_set.

rend

Returns an iterator that addresses the location succeeding the last element in a reversed hash_set.

size

Returns the number of elements in the hash_set.

swap

Exchanges the elements of two hash_sets.

upper_bound

Returns an iterator to the first element in a hash_set that with a key that is equal to or greater than a specified key.

value_comp

Retrieves a copy of the hash traits object used to hash and order element key values in a hash_set.

See Also

Concepts

hash_set Class

Thread Safety in the Standard C++ Library

Standard Template Library