


What are the key language features, library additions, and deprecated elements introduced in C 17?
C 17 Features
C 17 introduces a wealth of new features to the language, significantly expanding its capabilities and enhancing its usability. These additions encompass various aspects of the language, from template improvements and lambda enhancements to library additions and deprecated elements.
Language Features
Templates and Generic Code:
- Template Argument Deduction for Class Templates: Constructors can now deduce template arguments, similar to functions.
-
Template Argument: Represents a value of any non-type template argument type. - Revising Non-Type Template Arguments: Several fixes and revisions have been made to non-type template arguments.
Lambda:
- Constexpr Lambdas: Lambdas can now be explicitly marked as constexpr if they satisfy certain requirements.
- Capturing this in Lambdas: Lambdas can now capture the this pointer, allowing access to member variables and methods.
Attributes:
- New Attributes: Attributes such as [[fallthrough]], [[nodiscard]], and [[maybe_unused]] have been introduced to enhance code clarity and readability.
- Attributes on Namespaces and Enumerators: Attributes can now be applied to namespaces and enumerators using [[attributes]].
Syntax Cleanup:
- Inline Variables: Variables can now be declared inline, allowing the compiler to inline their definitions.
- Simplified Namespace Declaration: The namespace A::B syntax has been introduced for concise namespace declarations.
- Simplified static_assert: static_assert statements can now be used without a string argument.
Clean Multi-Return and Flow Control:
- Structured Bindings: Structured bindings enable more convenient unpacking of tuples and other data structures in declarations.
- Conditional Statements with Initialization: if (init; condition) and switch (init; condition) provide more flexibility in conditional statements.
- Generalizing Range-Based For Loops: Range-based for loops now support sentinels (end iterators) that differ from the beginning iterators.
- if constexpr: if constexpr allows conditional compilation based on compile-time constants.
Other:
- Hexadecimal Float Point Literals: Floating-point literals can now be expressed in hexadecimal format.
- Dynamic Memory Allocation for Over-Aligned Data: Improved support for dynamic memory allocation of over-aligned data.
- Guaranteed Copy Elision: Certain scenarios where copy elision was not guaranteed now have explicit guarantees.
- Improved Order-of-Evaluation: The order-of-evaluation rules for certain expressions have been revised for clearer behavior.
Library Additions
Data Types:
- std::variant: A polymorphic type that can hold a value of one of multiple alternative types.
- std::optional: Represents an optional value that may or may not contain a value.
- std::any: A type-erased container that can hold a value of arbitrary type.
- std::string_view: A reference to a character sequence, similar to const char*.
- std::byte: A type for representing raw bytes.
Utilities:
- std::invoke: Invokes a callable with given arguments, supporting various types of callables.
- std::apply: Unpacks a tuple and passes its elements as arguments to a callable.
- std::invoke_result and Related Concepts: Concepts and types for determining the validity and result of invoking a callable with given arguments.
File System Library (TS v1):
- Classes and functions for working with file systems, directories, and files.
New Algorithms:
- for_each_n
- reduce
- transform_reduce
- exclusive_scan
- inclusive_scan
- transform_exclusive_scan
- transform_inclusive_scan
Threading:
- std::shared_mutex: A shared mutex that allows multiple readers but only one writer.
-
atomic
::is_always_lockfree: Indicates whether an atomic type is lock-free in all cases. -
scoped_lock
:: Locks multiple mutexes simultaneously, simplifying locking and unlocking.
(Partial) Library Fundamentals Library (TS v1):
- Functionality for performing searches and working with polymorphic allocators.
Container Improvements:
- try_emplace and insert_or_assign: Improved container insertion methods for handling specific scenarios.
- Splicing for Containers: Efficiently moving nodes between containers.
Smart Pointer Changes:
- Fixes and tweaks to std::unique_ptr and other smart pointers.
Additional Improvements:
- Trivially Copyable std::reference_wrapper: Improves performance in certain cases.
- Updated C11 Library: The C 17 standard library is based on C11, providing compatibility with modern systems.
- Deprecated Elements: Various elements from previous versions of the C standard have been deprecated.
Features in C 1z (Expected for C 17)**
To determine which features from the C 1z working draft will be available in C 17 compilers, it is recommended to consult the documentation and release notes of individual compilers. Not all features from C 1z will necessarily be implemented in every C 17 compiler.
Please note that not all changes or features have been mentioned in this summary. For a comprehensive list, please refer to the C 17 standard document or other reputable sources.
The above is the detailed content of What are the key language features, library additions, and deprecated elements introduced in C 17?. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.

The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.

The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.

C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.

Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.
