std::flat_multiset<Key,Compare,KeyContainer>:: value_comp
From cppreference.net
<
cpp
|
container
|
flat multiset
C++
Containers library
|
(C++17)
|
||||
| Sequence | ||||
|
(C++11)
|
||||
|
(C++26)
|
||||
|
(C++26)
|
||||
|
(C++11)
|
||||
| Associative | ||||
| Unordered associative | ||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
| Adaptors | ||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
| Views | ||||
|
(C++20)
|
||||
|
(C++23)
|
||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::flat_multiset
| Member types | ||||
| Member functions | ||||
| Non-member functions | ||||
| Helper classes | ||||
| Tags | ||||
| Deduction guides | ||||
|
value_compare value_comp
(
)
const
;
|
(C++23부터)
(C++26부터 constexpr) |
|
값을 비교하는 함수 객체를 반환합니다. 이것은 key_comp() 와 동일합니다.
목차 |
반환값
값 비교 함수 객체.
복잡도
상수.
예제
이 코드 실행
#include <iostream> #include <flat_set> #include <utility> // Example module 97 key compare function struct ModCmp { bool operator()(int lhs, int rhs) const { return (lhs % 97) < (rhs % 97); } }; int main() { std::flat_multiset<int, ModCmp> cont{1, 2, 3, 4, 5}; // Same behavior as key_comp() auto comp_func = cont.value_comp(); for (const int val{100}; const int key : cont) { const bool before = comp_func(key, val); const bool after = comp_func(val, key); std::cout << "Key (" << key << ") "; if (!before && !after) std::cout << "equivalent to key (" << val << ")\n"; else if (before) std::cout << "goes before key (" << val << ")\n"; else if (after) std::cout << "goes after key (" << val << ")\n"; else std::unreachable(); } }
출력:
Key (1) goes before key (100) Key (2) goes before key (100) Key (3) equivalent to key (100) Key (4) goes after key (100) Key (5) goes after key (100)
참고 항목
|
키를 비교하는 함수를 반환합니다
(public member function) |