Defined in header <algorithm> template< class ForwardIt, class T > ForwardIt lower_bound( ForwardIt first, ForwardIt last, const T& value ); (1) template< class ForwardIt, class T, class Compare > ForwardIt lower_bound( ForwardIt first, ForwardIt last, const T& value, Compare comp ); (2) Returns an iterator pointing to the first element in the range [first, last) that is not less than (i.e. greater or equal to) value. The range [first, last) must b

Usage goto statement: as the declaration of the statement

allocator_type get_allocator() const; Returns the allocator associated with the container. Parameters (none). Return value The associated allocator. Complexity Constant.

Defined in header <new> replaceable allocation functions void* operator new ( std::size_t count ); (1) void* operator new[]( std::size_t count ); (2) void* operator new ( std::size_t count, const std::nothrow_t& tag); (3) void* operator new[]( std::size_t count, const std::nothrow_t& tag); (4) placement allocation functions void* operator new ( std::size_t count, void* ptr ); (5) void* operator new[]( std::size_t count, void* ptr );

Defined in header <unordered_map> template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator< std::pair<const Key, T> > > class unordered_map; (since C++11) Unordered map is an associative container that contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constant-time complexity. Internally, the elements are

Defines the semantics of computer memory storage for the purpose of the C++ abstract machine. The memory available to a C++ program is one or more contiguous sequences of bytes. Each byte in memory has a unique address'. Byte A byte is the smallest addressable unit of memory. It is defined as a contiguous sequence of bits, large enough to hold the value of any UTF-8 code unit (256 distinct values) and of (since C++14)any member of the basic execution character set (the 96 characters that ar

allocator_type get_allocator() const; (since C++11) Returns the allocator associated with the container. Parameters (none). Return value The associated allocator. Complexity Constant.

iterator end(); (since C++11) const_iterator end() const; (since C++11) const_iterator cend() const; (since C++11) Returns an iterator to the element following the last element of the container. This element acts as a placeholder; attempting to access it results in undefined behavior. Parameters (none). Return value Iterator to the element following the last element. Exceptions noexcept specification: noexcept Complexity Constant. See also begin cbegin

constexpr rep count() const; Returns the number of ticks for this duration. Parameters (none). Return value The number of ticks for this duration. Example #include <chrono> #include <iostream> int main() { std::chrono::milliseconds ms{3}; // 3 milliseconds // 6000 microseconds constructed from 3 milliseconds std::chrono::microseconds us = 2*ms; // 30Hz clock using fractional ticks std::chrono::duration<double, std::ratio<1, 30>> hz3

Usage constexpr declaration specifier (since C++11)