std::set
cppreference.com
<set> 에 정의되어 있음. | ||
template< class Key, | ||
std::set
is an associative container that contains a sorted set of unique objects of type Key. Sorting is done using the key comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Sets are usually implemented as red-black trees.
std::set
meets the requirements of Container
, AllocatorAwareContainer
, AssociativeContainer
and ReversibleContainer
.
목차 |
[편집]Member types
Member type | Definition |
key_type | 키 |
value_type | Key |
size_type | 부호 없는 정수(unsigned int) 타입 (일반적으로 std::size_t) |
difference_type | 부호 있는 정수(signed int) 타입 (보통 std::ptrdiff_t) |
key_compare | Compare |
value_compare | Compare |
allocator_type | 할당자 |
reference | Allocator::reference (until C++11)value_type& (since C++11) |
const_reference | Allocator::const_reference (until C++11)const value_type& (since C++11) |
pointer | Allocator::pointer (until C++11)std::allocator_traits<Allocator>::pointer(since C++11) |
const_pointer | Allocator::const_pointer(until C++11) std::allocator_traits<Allocator>::const_pointer(since C++11) |
iterator | BidirectionalIterator (until C++11)Constant bidirectional iterator (since C++11) |
const_iterator | 상수(constant) 양방향 반복자(iterator) |
reverse_iterator | std::reverse_iterator<iterator> |
const_reverse_iterator | std::reverse_iterator<const_iterator> |
[편집]Member functions
set 의 생성자이다. (public member function) | |
set 의 소멸자이다. (public member function) | |
컨테이너에 값을 할당한다. (public member function) | |
연관된 할당자를 반환한다. (public member function) | |
Iterators | |
첫번째 원소로의 반복자(iterator)를 반환한다. (public member function) | |
마지막 원소로의 반복자(iterator)를 반환한다. (public member function) | |
첫번째 원소로의 역방향 반복자(reverse iterator)를 반환한다. (public member function) | |
마지막 원소로의 역방향 반복자(reverse iterator)를 반환한다. (public member function) | |
Capacity | |
현재 컨테이너가 비어있는지 확인한다. (public member function) | |
원소의 개수를 반환한다. (public member function) | |
원소의 최대 개수를 반환한다. (public member function) | |
Modifiers | |
내용물을 모두 지운다. (public member function) | |
원소를 삽입한다. (public member function) | |
(C++11) | 원소를 바로 만들어 삽입한다. (public member function) |
(C++11) | constructs elements in-place using a hint (public member function) |
원소를 삭제한다 (public member function) | |
원소들을 서로 바꾼다 (public member function) | |
Lookup | |
특정한 키와 동일한 요소의 수를 반환합니다. (public member function) | |
특정 키를 가진 요소를 찾는다. (public member function) | |
returns range of elements matching a specific key (public member function) | |
returns an iterator to the first element not less than the given value (public member function) | |
returns an iterator to the first element greater than a certain value (public member function) | |
Observers | |
returns the function that compares keys (public member function) | |
returns the function that compares keys in objects of type value_type (public member function) |
[편집]Non-member functions
lexicographically compares the values in the set (function template) | |
specializes the std::swap algorithm (function template) |
[편집]Notes
The member types iterator
and const_iterator
may be aliases to the same type. Since iterator
is convertible to const_iterator
, const_iterator
should be used in function parameter lists to avoid violations of the One Definition Rule.