
- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Set Library - value_comp Function
Description
It returns a copy of the comparison object used by the container.
Declaration
Following are the ways in which std::set::value_comp works in various C++ versions.
C++98
value_compare value_comp() const;
C++11
value_compare value_comp() const;
Return value
It returns a copy of the comparison object used by the container.
Exceptions
If an exception is thrown, there are no changes in the container.
Time complexity
Time complexity depens on logarithmic.
Example
The following example shows the usage of std::set::value_comp.
#include <iostream> #include <set> int main () { std::set<int> myset; std::set<int>::value_compare mycomp = myset.value_comp(); for (int i = 0; i <= 10; i++) myset.insert(i); std::cout << "myset contains:"; int highest=*myset.rbegin(); std::set<int>::iterator it = myset.begin(); do { std::cout << ' ' << *it; } while ( mycomp(*(++it),highest) ); std::cout << '\n'; return 0; }
The above program will compile and execute properly.
myset contains: 0 1 2 3 4 5 6 7 8 9
set.htm
Advertisements