Definition in file stl_algobase.h.#include <bits/c++config.h>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstddef>
#include <iosfwd>
#include <bits/stl_pair.h>
#include <bits/cpp_type_traits.h>
#include <bits/stl_iterator_base_types.h>
#include <bits/stl_iterator_base_funcs.h>
#include <bits/stl_iterator.h>
#include <bits/concept_check.h>
#include <debug/debug.h>
Include dependency graph for stl_algobase.h:
Go to the source code of this file.
|
Copies the range [first,last) into result.
memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling). Result may not be contained within [first,last); the copy_backward function should be used instead.Note that the end of the output range is permitted to be contained within [first,last). Definition at line 340 of file stl_algobase.h. Referenced by basic_string::assign(), basic_string::copy(), vector::erase(), deque::erase(), basic_string::insert(), std::merge(), vector::operator=(), deque::operator=(), basic_string::replace(), std::rotate_copy(), std::set_difference(), std::set_symmetric_difference(), and std::set_union(). |
|
Copies the range [first,last) into result.
memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling).Result may not be in the range [first,last). Use copy instead. Note that the start of the output range may overlap [first,last). Definition at line 469 of file stl_algobase.h. Referenced by deque::erase(). |
|
Tests a range for element-wise equality.
|
|
Tests a range for element-wise equality.
== and returns true or false depending on whether all of the corresponding elements of the ranges are equal. Definition at line 714 of file stl_algobase.h.
Referenced by std::operator==(). |
|
Fills the range [first,last) with copies of value.
memset . Definition at line 525 of file stl_algobase.h. |
|
Fills the range [first,first+n) with copies of value.
memset . Definition at line 601 of file stl_algobase.h. |
|
Swaps the contents of two iterators.
Referenced by std::next_permutation(), std::prev_permutation(), std::random_shuffle(), and std::swap_ranges(). |
|
Performs "dictionary" comparison on ranges.
lexigraphical_compare , but uses the comp parameter instead of < . Definition at line 817 of file stl_algobase.h. |
|
Performs "dictionary" comparison on ranges.
memcmp . Definition at line 778 of file stl_algobase.h.
Referenced by std::operator<(). |
|
This does what you think it does.
|
|
This does what you think it does.
|
|
This does what you think it does.
|
|
This does what you think it does.
Referenced by basic_string::compare(), basic_string< char >::compare(), and basic_string::rfind(). |
|
Finds the places in ranges which don't match.
|
|
Finds the places in ranges which don't match.
== and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal. Definition at line 648 of file stl_algobase.h. |
|
Swaps two values.
|