all_cpp_functions.html

从www.CppReference.com打包的C++参考手册

      "cppalgorithm/is_sorted.html">is_sorted</a> (C++ Algorithms)</td>

      <td class="category-table-td">returns true if a range is sorted
      in ascending order</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/iter_swap.html">iter_swap</a> (C++ Algorithms)</td>

      <td class="category-table-td">swaps the elements pointed to by
      two iterators</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppset/key_comp.html">key_comp</a> (C++ Sets)</td>

      <td class="category-table-td">returns the function that compares
      keys</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppmultiset/key_comp.html">key_comp</a> (C++ Multisets)</td>

      <td class="category-table-td">returns the function that compares
      keys</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppmap/key_comp.html">key_comp</a> (C++ Maps)</td>

      <td class="category-table-td">returns the function that compares
      keys</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppmultimap/key_comp.html">key_comp</a> (C++ Multimaps)</td>

      <td class="category-table-td">returns the function that compares
      keys</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppstring/length.html">length</a> (C++ Strings)</td>

      <td class="category-table-td">returns the length of the
      string</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/lexicographical_compare.html">lexicographical_compare</a>
      (C++ Algorithms)</td>

      <td class="category-table-td">returns true if one range is
      lexicographically less than another</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/lexicographical_compare_3.html">lexicographical_compare_3way</a>
      (C++ Algorithms)</td>

      <td class="category-table-td">determines if one range is
      lexicographically less than or greater than another</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppset/lower_bound.html">lower_bound</a> (C++ Sets)</td>

      <td class="category-table-td">returns an iterator to the first
      element greater than or equal to a certain value</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppmultiset/lower_bound.html">lower_bound</a> (C++
      Multisets)</td>

      <td class="category-table-td">returns an iterator to the first
      element greater than or equal to a certain value</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppmap/lower_bound.html">lower_bound</a> (C++ Maps)</td>

      <td class="category-table-td">returns an iterator to the first
      element greater than or equal to a certain value</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppmultimap/lower_bound.html">lower_bound</a> (C++
      Multimaps)</td>

      <td class="category-table-td">returns an iterator to the first
      element greater than or equal to a certain value</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/lower_bound.html">lower_bound</a> (C++
      Algorithms)</td>

      <td class="category-table-td">search for the first place that a
      value can be inserted while preserving order</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/make_heap.html">make_heap</a> (C++ Algorithms)</td>

      <td class="category-table-td">creates a heap out of a range of
      elements</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/max.html">max</a> (C++ Algorithms)</td>

      <td class="category-table-td">returns the larger of two
      elements</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/max_element.html">max_element</a> (C++
      Algorithms)</td>

      <td class="category-table-td">returns the largest element in a
      range</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppstring/max_size.html">max_size</a> (C++ Strings)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppvector/max_size.html">max_size</a> (C++ Vectors)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppdeque/max_size.html">max_size</a> (C++ Double-ended
      Queues)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cpplist/max_size.html">max_size</a> (C++ Lists)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppset/max_size.html">max_size</a> (C++ Sets)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppmultiset/max_size.html">max_size</a> (C++ Multisets)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppmap/max_size.html">max_size</a> (C++ Maps)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppmultimap/max_size.html">max_size</a> (C++ Multimaps)</td>

      <td class="category-table-td">returns the maximum number of
      elements that the container can hold</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cpplist/merge.html">merge</a> (C++ Lists)</td>

      <td class="category-table-td">merge two lists</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/merge.html">merge</a> (C++ Algorithms)</td>

      <td class="category-table-td">merge two sorted ranges</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/min.html">min</a> (C++ Algorithms)</td>

      <td class="category-table-td">returns the smaller of two
      elements</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/min_element.html">min_element</a> (C++
      Algorithms)</td>

      <td class="category-table-td">returns the smallest element in a
      range</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/mismatch.html">mismatch</a> (C++ Algorithms)</td>

      <td class="category-table-td">finds the first position where two
      ranges differ</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/next_permutation.html">next_permutation</a> (C++
      Algorithms)</td>

      <td class="category-table-td">generates the next greater
      lexicographic permutation of a range of elements</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppbitset/none.html">none</a> (C++ Bitsets)</td>

      <td class="category-table-td">true if no bits are set</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/nth_element.html">nth_element</a> (C++
      Algorithms)</td>

      <td class="category-table-td">put one element in its sorted
      location and make sure that no elements to its left are greater
      than any elements to its right</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href="cppio/open.html">open</a>
      (C++ I/O)</td>

      <td class="category-table-td">create an input stream</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/partial_sort.html">partial_sort</a> (C++
      Algorithms)</td>

      <td class="category-table-td">sort the first N elements of a
      range</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/partial_sort_copy.html">partial_sort_copy</a> (C++
      Algorithms)</td>

      <td class="category-table-td">copy and partially sort a range of
      elements</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppalgorithm/partial_sum.html">partial_sum</a> (C++
      Algorithms)</td>

      <td class="category-table-td">compute the partial sum of a range
      of elements</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/partition.html">partition</a> (C++ Algorithms)</td>

      <td class="category-table-td">divide a range of elements into two
      groups</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href="cppio/peek.html">peek</a>
      (C++ I/O)</td>

      <td class="category-table-td">check the next input character</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href="cppstack/pop.html">pop</a>
      (C++ Stacks)</td>

      <td class="category-table-td">removes the top element of a
      container</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href="cppqueue/pop.html">pop</a>
      (C++ Queues)</td>

      <td class="category-table-td">removes the top element of a
      container</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cpppriority_queue/pop.html">pop</a> (C++ Priority Queues)</td>

      <td class="category-table-td">removes the top element of a
      container</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppvector/pop_back.html">pop_back</a> (C++ Vectors)</td>

      <td class="category-table-td">removes the last element of a
      container</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppdeque/pop_back.html">pop_back</a> (C++ Double-ended
      Queues)</td>

      <td class="category-table-td">removes the last element of a
      container</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cpplist/pop_back.html">pop_back</a> (C++ Lists)</td>

      <td class="category-table-td">removes the last element of a
      container</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppdeque/pop_front.html">pop_front</a> (C++ Double-ended
      Queues)</td>

      <td class="category-table-td">removes the first element of the
      container</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cpplist/pop_front.html">pop_front</a> (C++ Lists)</td>

      <td class="category-table-td">removes the first element of the
      container</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/pop_heap.html">pop_heap</a> (C++ Algorithms)</td>

      <td class="category-table-td">remove the largest element from a
      heap</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppio/precision.html">precision</a> (C++ I/O)</td>

      <td class="category-table-td">manipulate the precision of a
      stream</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=
      "cppalgorithm/prev_permutation.html">prev_permutation</a> (C++
      Algorithms)</td>

      <td class="category-table-td">generates the next smaller
      lexicographic permutation of a range of elements</td>
    </tr>

    <tr class="category-table-tr-1">
      <td class="category-table-td"><a href=
      "cppstack/push.html">push</a> (C++ Stacks)</td>

      <td class="category-table-td">adds an element to the top of the
      container</td>
    </tr>

    <tr class="category-table-tr-2">
      <td class="category-table-td"><a href=