C++ Reference STL
3
< algorithm> Functions adjacent_find() all_of() any_of() binary_search() copy() copy_backward() copy_if() copy_n() count() count_if() equal() equal_range() fill() fill_n() find() find_end() find_first_of() find_if() find_if_not() for_each() generate() generate_n() includes() inplace_merge() is_heap() is_heap_until() is_partitioned() is_sorted() is_sorted_until() iter_swap() lexicographical_com pare() lower_bound() make_heap() max() max_element() merge() min() min_element() minmax() minmax_element() mismatch() move() move_backward() next_permutation( ) none_of() nth_element() partial_sort() partial_sort_copy <complex> Description The <complex> include file defines the complex class, which is used to represent complex numbers. Classes class complex<X> class complex<double> class complex<float> class complex<long double> Functions abs() arg() conj() cos() cosh() exp() imag() log() log10() norm() operator==() operator!=() operator<<() operator>>() operator+() operator-() operator*() operator/() polar() pow() real() sin() sinh() sqrt() tan() tanh() <deque> Description The <deque> header file defines the deque class, which is a sequence container such that entries can be added or removed from the front or back efficiently. Unlike built-in arrays, deques grow or shrink to approximately the size of the number of elements in the deque. Additionally, the file defines six relational operators and a swap function that are friend functions of the deque class. In comparison to a vector, a deque is favored when entries must frequently be added and removed from both the front and back to the sequence. An array is favored over a deque for frequent random accesses. As the name suggests, a deque is primarily for creating queues. Classes class deque<X, A> Friend Functions operator==() operator!=() operator<() operator>=() <exception> Description The <exception> header file defines the exception class, which is the base class for the exception hierarchy. Classes class bad_exception class exception Typedefs terminate_handle r unexpected_handl er Functions set_terminate() set_unexpected() terminate() uncaught_excepti on() unexpected() <fstream> Description The <fstream> header file defines the file stream classes for file input and output. Classes basic_filebuf basic_fstream basic_ifstream basic_ofstream Typedefs filebuf fstream ifstream ofstream wfilebuf wfstream wifstream wofstream
-
Upload
zawadzahin -
Category
Documents
-
view
24 -
download
2
description
C++ Reference STL
Transcript of C++ Reference STL
<algorithm>
Functionsadjacent_find()all_of()any_of()binary_search()copy()copy_backward()copy_if()copy_n()count()count_if()equal()equal_range()fill()fill_n()find()find_end()find_first_of()find_if()find_if_not()for_each()generate()generate_n()includes()inplace_merge()is_heap()is_heap_until()is_partitioned()is_sorted()is_sorted_until()iter_swap()lexicographical_compare()lower_bound()make_heap()max()max_element()merge()min()min_element()minmax()minmax_element()mismatch()move()move_backward()next_permutation()none_of()nth_element()partial_sort()partial_sort_copy()partition()pop_heap()prev_permutation()push_heap()random_shuffle()remove()remove_copy()remove_copy_if()remove_if()replace()
<complex>
DescriptionThe <complex> include file defines the complex class, which is used to represent complex numbers.
Classesclass complex<X>class complex<double>class complex<float>class complex<long double>
Functionsabs()arg()conj()cos()cosh()exp()imag()log()log10()norm()operator==()operator!=()operator<<()operator>>()operator+()operator-()operator*()operator/()polar()pow()real()sin()sinh()sqrt()tan()tanh()
<deque>
DescriptionThe <deque> header file defines the deque class, which is a sequence container such that entries can be added or removed from the front or back efficiently. Unlike built-in arrays, deques grow or shrink to approximately the size of the number of elements in the deque. Additionally, the file defines six relational operators and a swap function that are friend functions of the deque class. In comparison to a vector, a deque is favored when entries must frequently be added and removed from both the front and back to the sequence. An array is favored over a deque for frequent random accesses. As the name suggests, a deque is primarily for creating queues.
Classesclass deque<X, A>
Friend Functionsoperator==()operator!=()operator<()operator>=()operator>()operator<=()swap()
<exception>
DescriptionThe <exception> header file defines the exception class, which is the base class for the exception hierarchy.
Classesclass bad_exceptionclass exception
Typedefsterminate_handlerunexpected_handler
Functionsset_terminate()set_unexpected()terminate()uncaught_exception()unexpected()
<fstream>
DescriptionThe <fstream> header file defines the file stream classes for file input and output.
Classesbasic_filebufbasic_fstreambasic_ifstreambasic_ofstream
Typedefsfilebuffstreamifstreamofstreamwfilebufwfstreamwifstreamwofstream
replace_copy()replace_copy_if()replace_if()reverse()reverse_copy()rotate()rotate_copy()search()search_n()set_difference()set_intersection()set_symmetric_difference()set_union()sort()sort_heap()stable_partition()stable_sort()swap()swap_ranges()transform()unique()unique_copy()upper_bound()
C++ Reference > STL > bitsetThe <bitset> include file defines the bitset class, which uses a set of bits that can used as flags.Classesclass bitset<N>Functionsoperator|()operator&()operator^()operator<<()operator>>()
![Free words concerning C++ STL - Welcome [Savannah] · Free words concerning C++ STL This document is under GNU FDL. Contents I Presentation of the C++ STL 11 1 What is the C++ STL](https://static.fdocuments.us/doc/165x107/5b1903c37f8b9a3c258c48ab/free-words-concerning-c-stl-welcome-savannah-free-words-concerning-c.jpg)
