Tổng hợp tất cả hàm trong C++

images

All C++ Functions

Bitset Constructors (C++ Bitsets) create new bitsets
Bitset Operators (C++ Bitsets) compare and assign bitsets
Vector constructors create vectors and initialize them with some data
Container constructors (C++ Double-ended Queues) create containers and initialize them with some data
Container constructors (C++ Lists) create containers and initialize them with some data
Container constructors & destructors (C++ Sets) default methods to allocate, copy, and deallocate containers
Container constructors & destructors (C++ Multisets) default methods to allocate, copy, and deallocate multisets
Map constructors & destructors (C++ Maps) default methods to allocate, copy, and deallocate maps
Multimap constructors & destructors (C++ Multimaps) default methods to allocate, copy, and deallocate containers
Container operators (C++ Lists) assign and compare containers
Container operators (C++ Sets) assign and compare containers
Container operators (C++ Multisets) assign and compare containers
Multimap operators (C++ Multimaps) assign and compare containers
Vector operators compare, assign, and access elements of a vector
Container operators (C++ Double-ended Queues) compare, assign, and access elements of a container
I/O Constructors (C++ I/O) constructors
Map operators (C++ Maps) assign, compare, and access elements of a map
Priority queue constructors (C++ Priority Queues) construct a new priority queue
Queue constructor (C++ Queues) construct a new queue
Stack constructors (C++ Stacks) construct a new stack
String constructors (C++ Strings) create strings from arrays of characters and other strings
String operators (C++ Strings) concatenate strings, assign strings, use strings for I/O, compare strings
accumulate (C++ Algorithms) sum up a range of elements
adjacent_difference (C++ Algorithms) compute the differences between adjacent elements in a range
adjacent_find (C++ Algorithms) finds two items that are adjacent to eachother
any (C++ Bitsets) true if any bits are set
append (C++ Strings) append characters and strings onto a string
assign (C++ Vectors) assign elements to a container
assign (C++ Double-ended Queues) assign elements to a container
assign (C++ Lists) assign elements to a container
assign (C++ Strings) give a string values from strings of characters and other C++ strings
at (C++ Vectors) returns an element at a specific location
at (C++ Double-ended Queues) returns an element at a specific location
at (C++ Strings) returns an element at a specific location
auto_ptr (Miscellaneous C++) create pointers that automatically destroy objects
back (C++ Vectors) returns a reference to last element of a container
back (C++ Double-ended Queues) returns a reference to last element of a container
back (C++ Lists) returns a reference to last element of a container
back (C++ Queues) returns a reference to last element of a container
bad (C++ I/O) true if an error occurred
begin (C++ Strings) returns an iterator to the beginning of the container
begin (C++ Vectors) returns an iterator to the beginning of the container
begin (C++ Double-ended Queues) returns an iterator to the beginning of the container
begin (C++ Lists) returns an iterator to the beginning of the container
begin (C++ Sets) returns an iterator to the beginning of the container
begin (C++ Multisets) returns an iterator to the beginning of the container
begin (C++ Maps) returns an iterator to the beginning of the container
begin (C++ Multimaps) returns an iterator to the beginning of the container
binary_search (C++ Algorithms) determine if an element exists in a certain range
c_str (C++ Strings) returns a standard C character array version of the string
capacity (C++ Vectors) returns the number of elements that the container can hold
capacity (C++ Strings) returns the number of elements that the container can hold
clear (C++ I/O) clear and set status flags
clear (C++ Strings) removes all elements from the container
clear (C++ Vectors) removes all elements from the container
clear (C++ Double-ended Queues) removes all elements from the container
clear (C++ Lists) removes all elements from the container
clear (C++ Sets) removes all elements from the container
clear (C++ Multisets) removes all elements from the container
clear (C++ Maps) removes all elements from the container
clear (C++ Multimaps) removes all elements from the container
close (C++ I/O) close a stream
compare (C++ Strings) compares two strings
copy (C++ Strings) copies characters from a string into an array
copy (C++ Algorithms) copy some range of elements to a new location
copy_backward (C++ Algorithms) copy a range of elements in backwards order
copy_n (C++ Algorithms) copy N elements
count (C++ Sets) returns the number of elements matching a certain key
count (C++ Multisets) returns the number of elements matching a certain key
count (C++ Maps) returns the number of elements matching a certain key
count (C++ Multimaps) returns the number of elements matching a certain key
count (C++ Bitsets) returns the number of set bits
count (C++ Algorithms) return the number of elements matching a given value
count_if (C++ Algorithms) return the number of elements for which a predicate is true
data (C++ Strings) returns a pointer to the first character of a string
empty (C++ Strings) true if the container has no elements
empty (C++ Vectors) true if the container has no elements
empty (C++ Double-ended Queues) true if the container has no elements
empty (C++ Lists) true if the container has no elements
empty (C++ Sets) true if the container has no elements
empty (C++ Multisets) true if the container has no elements
empty (C++ Maps) true if the container has no elements
empty (C++ Multimaps) true if the container has no elements
empty (C++ Stacks) true if the container has no elements
empty (C++ Queues) true if the container has no elements
empty (C++ Priority Queues) true if the container has no elements
end (C++ Strings) returns an iterator just past the last element of a container
end (C++ Vectors) returns an iterator just past the last element of a container
end (C++ Double-ended Queues) returns an iterator just past the last element of a container
end (C++ Lists) returns an iterator just past the last element of a container
end (C++ Sets) returns an iterator just past the last element of a container
end (C++ Multisets) returns an iterator just past the last element of a container
end (C++ Maps) returns an iterator just past the last element of a container
end (C++ Multimaps) returns an iterator just past the last element of a container
eof (C++ I/O) true if at the end-of-file
equal (C++ Algorithms) determine if two sets of elements are the same
equal_range (C++ Sets) returns iterators to the first and just past the last elements matching a specific key
equal_range (C++ Multisets) returns iterators to the first and just past the last elements matching a specific key
equal_range (C++ Maps) returns iterators to the first and just past the last elements matching a specific key
equal_range (C++ Multimaps) returns iterators to the first and just past the last elements matching a specific key
equal_range (C++ Algorithms) search for a range of elements that are all equal to a certain element
erase (C++ Strings) removes elements from a string
erase (C++ Vectors) removes elements from a container
erase (C++ Double-ended Queues) removes elements from a container
erase (C++ Lists) removes elements from a container
erase (C++ Sets) removes elements from a container
erase (C++ Multisets) removes elements from a container
erase (C++ Maps) removes elements from a container
erase (C++ Multimaps) removes elements from a container
fail (C++ I/O) true if an error occurred
fill (C++ I/O) manipulate the default fill character
fill (C++ Algorithms) assign a range of elements a certain value
fill_n (C++ Algorithms) assign a value to some number of elements
find (C++ Algorithms) find a value in a given range
find (C++ Sets) returns an iterator to specific elements
find (C++ Multisets) returns an iterator to specific elements
find (C++ Maps) returns an iterator to specific elements
find (C++ Multimaps) returns an iterator to specific elements
find (C++ Strings) find characters in the string
find_end (C++ Algorithms) find the last sequence of elements in a certain range
find_first_not_of (C++ Strings) find first absence of characters
find_first_of (C++ Strings) find first occurrence of characters
find_first_of (C++ Algorithms) search for any one of a set of elements
find_if (C++ Algorithms) find the first element for which a certain predicate is true
find_last_not_of (C++ Strings) find last absence of characters
find_last_of (C++ Strings) find last occurrence of characters
flags (C++ I/O) access or manipulate io stream format flags
flip (C++ Bitsets) reverses the bitset
flush (C++ I/O) empty the buffer
for_each (C++ Algorithms) apply a function to a range of elements
front (C++ Vectors) returns a reference to the first element of a container
front (C++ Double-ended Queues) returns a reference to the first element of a container
front (C++ Lists) returns a reference to the first element of a container
front (C++ Queues) returns a reference to the first element of a container
gcount (C++ I/O) number of characters read during last input
generate (C++ Algorithms) saves the result of a function in a range
generate_n (C++ Algorithms) saves the result of N applications of a function
get (C++ I/O) read characters
getline (C++ I/O) read a line of characters
getline (C++ Strings) read data from an I/O stream into a string
good (C++ I/O) true if no errors have occurred
ignore (C++ I/O) read and discard characters
includes (C++ Algorithms) returns true if one set is a subset of another
inner_product (C++ Algorithms) compute the inner product of two ranges of elements
inplace_merge (C++ Algorithms) merge two ordered ranges in-place
insert (C++ Strings) insert characters into a string
insert (C++ Vectors) inserts elements into the container
insert (C++ Double-ended Queues) inserts elements into the container
insert (C++ Lists) inserts elements into the container
insert (C++ Sets) insert items into a container
insert (C++ Multisets) inserts items into a container
insert (C++ Multimaps) inserts items into a container
insert (C++ Maps) insert items into a container
is_heap (C++ Algorithms) returns true if a given range is a heap
is_sorted (C++ Algorithms) returns true if a range is sorted in ascending order
iter_swap (C++ Algorithms) swaps the elements pointed to by two iterators
key_comp (C++ Sets) returns the function that compares keys
key_comp (C++ Multisets) returns the function that compares keys
key_comp (C++ Maps) returns the function that compares keys
key_comp (C++ Multimaps) returns the function that compares keys
length (C++ Strings) returns the length of the string
lexicographical_compare (C++ Algorithms) returns true if one range is lexicographically less than another
lexicographical_compare_3way (C++ Algorithms) determines if one range is lexicographically less than or greater than another
lower_bound (C++ Sets) returns an iterator to the first element greater than or equal to a certain value
lower_bound (C++ Multisets) returns an iterator to the first element greater than or equal to a certain value
lower_bound (C++ Maps) returns an iterator to the first element greater than or equal to a certain value
lower_bound (C++ Multimaps) returns an iterator to the first element greater than or equal to a certain value
lower_bound (C++ Algorithms) search for the first place that a value can be inserted while preserving order
make_heap (C++ Algorithms) creates a heap out of a range of elements
max (C++ Algorithms) returns the larger of two elements
max_element (C++ Algorithms) returns the largest element in a range
max_size (C++ Strings) returns the maximum number of elements that the container can hold
max_size (C++ Vectors) returns the maximum number of elements that the container can hold
max_size (C++ Double-ended Queues) returns the maximum number of elements that the container can hold
max_size (C++ Lists) returns the maximum number of elements that the container can hold
max_size (C++ Sets) returns the maximum number of elements that the container can hold
max_size (C++ Multisets) returns the maximum number of elements that the container can hold
max_size (C++ Maps) returns the maximum number of elements that the container can hold
max_size (C++ Multimaps) returns the maximum number of elements that the container can hold
merge (C++ Lists) merge two lists
merge (C++ Algorithms) merge two sorted ranges
min (C++ Algorithms) returns the smaller of two elements
min_element (C++ Algorithms) returns the smallest element in a range
mismatch (C++ Algorithms) finds the first position where two ranges differ
next_permutation (C++ Algorithms) generates the next greater lexicographic permutation of a range of elements
none (C++ Bitsets) true if no bits are set
nth_element (C++ Algorithms) put one element in its sorted location and make sure that no elements to its left are greater than any elements to its right
open (C++ I/O) create an input stream
partial_sort (C++ Algorithms) sort the first N elements of a range
partial_sort_copy (C++ Algorithms) copy and partially sort a range of elements
partial_sum (C++ Algorithms) compute the partial sum of a range of elements
partition (C++ Algorithms) divide a range of elements into two groups
peek (C++ I/O) check the next input character
pop (C++ Stacks) removes the top element of a container
pop (C++ Queues) removes the top element of a container
pop (C++ Priority Queues) removes the top element of a container
pop_back (C++ Vectors) removes the last element of a container
pop_back (C++ Double-ended Queues) removes the last element of a container
pop_back (C++ Lists) removes the last element of a container
pop_front (C++ Double-ended Queues) removes the first element of the container
pop_front (C++ Lists) removes the first element of the container
pop_heap (C++ Algorithms) remove the largest element from a heap
precision (C++ I/O) manipulate the precision of a stream
prev_permutation (C++ Algorithms) generates the next smaller lexicographic permutation of a range of elements
push (C++ Stacks) adds an element to the top of the container
push (C++ Queues) adds an element to the end of the container

Leave a Reply