Defined in header <cstdlib> int rand(); Returns a pseudo-random integral value between ​0​ and RAND_MAX (0 and RAND_MAX included). std::srand() seeds the pseudo-random number generator used by rand(). If rand() is used before any calls to srand(), rand() behaves as if it was seeded with srand(1). Each time rand() is seeded with srand(), it must produce the same sequence of values on successive calls. Other functions in the standard library may call rand, it is implementatio

Defined in header <csignal> int raise( int sig ); Sends signal sig to the program. The signal handler (specified using the std::signal() function) is invoked. If the user-defined signal handling strategy is not set using std::signal() yet, it is implementation-defined whether the signal will be ignored or default handler will be invoked. Parameters sig - the signal to be sent. It can be an implementation-defined value or one of the following values: SIGABRTSIGFPES

void swap( queue& other ); (since C++11) Exchanges the contents of the container adaptor with those of other. Effectively calls using std::swap; swap(c, other.c); Parameters other - container adaptor to exchange the contents with Return value (none). Exceptions noexcept specification: noexcept(noexcept(std::swap(c, other.c))) Complexity Same as underlying container (typically constant). See also std::swap(std::queue) specializes the std::swap algorithm (

Defined in header <cstdlib> [[noreturn]] void quick_exit( int exit_code ); (since C++11) Causes normal program termination to occur without completely cleaning the resources. Functions passed to std::at_quick_exit are called in reverse order of their registration. If an exception tries to propagate out of any of the functions, std::terminate is called. After calling the registered functions, calls std::_Exit(exit_code). Functions passed to std::atexit are not called. Para

Defined in header <iomanip> template< class CharT > /*unspecified*/ quoted(const CharT* s, CharT delim=CharT('"'), CharT escape=CharT('\\')); (1) (since C++14) template< class CharT, class Traits, class Allocator > /*unspecified*/ quoted(const std::basic_string<CharT, Traits, Allocator>& s, CharT delim=CharT('"'), CharT escape=CharT('\\')); (2) (since C++14) template< class CharT, class Traits, clas

void pop(); Removes an element from the front of the queue. Effectively calls c.pop_front(). Parameters (none). Return value (none). Complexity Equal to the complexity of Container::pop_front. See also emplace (C++11) constructs element in-place at the end (public member function) push inserts element at the end (public member function) front access the first element (public member function)

(1) explicit queue( const Container& cont = Container() ); (until C++11) explicit queue( const Container& cont ); (since C++11) explicit queue( Container&& cont = Container() ); (2) (since C++11) queue( const queue& other ); (3) queue( queue&& other ); (4) (since C++11) template< class Alloc > explicit queue( const Alloc& alloc ); (5) (since C++11) template< class Alloc > queue( const Container& cont, const A

void push( const T& value ); void push( T&& value ); (since C++11) Pushes the given element value to the end of the queue. 1) Effectively calls c.push_back(value) 2) Effectively calls c.push_back(std::move(value)) Parameters value - the value of the element to push Return value (none). Complexity Equal to the complexity of Container::push_back. See also emplace (C++11) constructs element in-place at the end (public member function) pop

reference front(); const_reference front() const; Returns reference to the first element in the queue. This element will be the first element to be removed on a call to pop(). Effectively calls c.front(). Parameters (none). Return value Reference to the first element. Complexity Constant. See also back access the last element (public member function) pop removes the first element (public member function)

size_type size() const; Returns the number of elements in the underlying container, that is, c.size(). Parameters (none). Return value The number of elements in the container. Complexity Constant. See also empty checks whether the underlying container is empty (public member function)