Introduces implementation-defined attributes for types, objects, code, etc.| en.cppreference.com
C++| en.cppreference.com
The C++ numerics library includes common mathematical functions and types, as well as optimized numeric arrays and support for random number generation.| en.cppreference.com
The algorithms library defines functions for a variety of purposes (e.g. searching, sorting, counting, manipulating) that operate on ranges of elements. Note that a range is defined as [first,last) where last refers to the element past the last element to inspect or modify.| en.cppreference.com
[CWG2615] S. B. Tam. 2022-08-17. Missing __has_cpp_attribute(assume). https://wg21.link/cwg2615| isocpp.org
C++ includes built-in support for threads, atomic operations, mutual exclusion, condition variables, and futures.| en.cppreference.com
Iterators are a generalization of pointers that allow a C++ program to work with different data structures (for example, containers and ranges(since C++20)) in a uniform manner. The iterator library provides definitions for iterators, as well as iterator traits, adaptors, and utility functions.| en.cppreference.com
C++| en.cppreference.com
The ranges library is an extension and generalization of the algorithms and iterator libraries that makes them more powerful by making them composable and less error-prone.| en.cppreference.com
The Containers library is a generic collection of class templates and algorithms that allow programmers to easily implement common data structures like queues, lists and stacks. There are two(until C++11)three(since C++11) classes of containers:| en.cppreference.com