cppset.html
来自「ssd5 数据结构的课件」· HTML 代码 · 共 95 行
HTML
95 行
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html> <head> <meta name="generator" content="HTML Tidy for Linux/x86 (vers 1st October 2002), see www.w3.org"> <title>C++ Sets</title> </head> <body bgcolor="#ffffff"> <table width="100%" bgcolor="#eeeeff"> <tr> <td><a href="index.html">cppreference.com</a> -> C++ Sets</td> </tr> </table> <h3>C++ Sets</h3> <p>The C++ Set is an associative container that contains an ordered set of objects.</p> <table> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#begin">begin()</a></td> <td>returns an iterator to the first element</td> </tr> <tr> <td><a href="cppset_details.html#clear">clear()</a></td> <td>removes all elements</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#count">count()</a></td> <td>returns the number of elements</td> </tr> <tr> <td><a href="cppset_details.html#empty">empty()</a></td> <td>true if the set is empty</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#end">end()</a></td> <td>returns an iterator to the last element</td> </tr> <tr> <td><a href="cppset_details.html#equal_range">equal_range()</a></td> <td>returns iterators to the first and last elements that match a certain key</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#erase">erase()</a></td> <td>removes elements</td> </tr> <tr> <td><a href="cppset_details.html#find">find()</a></td> <td>finds a given element</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#get_allocator">get_allocator()</a></td> <td>returns the set's allocator</td> </tr> <tr> <td><a href="cppset_details.html#insert">insert()</a></td> <td>inserts elements into the set</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#lower_bound">lower_bound()</a></td> <td>returns an iterator to the first element greater than or equal to a certain value</td> </tr> <tr> <td><a href="cppset_details.html#key_comp">key_comp()</a></td> <td>returns the function that compares keys</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#max_size">max_size()</a></td> <td>the maximum number of elements that the set can hold</td> </tr> <tr> <td><a href="cppset_details.html#rbegin">rbegin()</a></td> <td>returns a reverse iterator to the end of the set</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#rend">rend()</a></td> <td>returns a reverse iterator to the beginning of the set</td> </tr> <tr> <td><a href="cppset_details.html#size">size()</a></td> <td>the number of elements in the set</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#swap">swap()</a></td> <td>exchanges two sets</td> </tr> <tr> <td><a href="cppset_details.html#upper_bound">upper_bound()</a></td> <td>returns an iterator to the first element greater than a certain value</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppset_details.html#value_comp">value_comp()</a></td> <td>returns the function that compares values</td> </tr> </table> </body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?