Table of Contents
Type Deduction in Functions with Initializer Lists
Home Backend Development C++ Why is `printme({\'a\', \'b\', \'c\'});` Illegal in C Template Type Deduction?

Why is `printme({\'a\', \'b\', \'c\'});` Illegal in C Template Type Deduction?

Dec 02, 2024 pm 08:24 PM

Why is `printme({'a', 'b', 'c'});` Illegal in C   Template Type Deduction?

Type Deduction in Functions with Initializer Lists

Consider the function template:

template<typename T>
void printme(T&& t) {
  for (auto i : t)
    std::cout << i;
}
Copy after login

This function expects one parameter of a type with a begin() and end() function.

Question:

Why is the following call illegal?

printme({'a', 'b', 'c'});
Copy after login

Answer:

The call printme({'a', 'b', 'c'}) is illegal because the template argument T cannot be inferred. Without specifying the template argument explicitly, the compiler cannot determine the type of the parameter, as it could be any type with a begin() and end() function. This issue does not arise in the following cases:

  • Explicit template argument specification: printme>({'a', 'b', 'c'})
  • Parameter types with type deduction: printme(std::vector({'a', 'b', 'c'}))
  • Using auto to deduce the type: const auto il = {'a', 'b', 'c'}; printme(il);
  • Explicitly specifying the template argument: printme>({'a', 'b', 'c'})
  • The exception to this is the deduction of auto as std::initializer_list, which differs from the template argument deduction. This behavior is explicitly specified in the C 11 standard (§ 14.8.2.5/5), which states that the template argument for a function parameter that is an initializer list but not of type std::initializer_list is not deduced. However, § 7.1.6.4/6 of the standard provides explicit support for auto to deduce std::initializer_list<>.

    The above is the detailed content of Why is `printme({\'a\', \'b\', \'c\'});` Illegal in C Template Type Deduction?. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

AI Hentai Generator

AI Hentai Generator

Generate AI Hentai for free.

Hot Article

R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. Best Graphic Settings
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. How to Fix Audio if You Can't Hear Anyone
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

How does the C   Standard Template Library (STL) work? How does the C Standard Template Library (STL) work? Mar 12, 2025 pm 04:50 PM

This article explains the C Standard Template Library (STL), focusing on its core components: containers, iterators, algorithms, and functors. It details how these interact to enable generic programming, improving code efficiency and readability t

How do I use algorithms from the STL (sort, find, transform, etc.) efficiently? How do I use algorithms from the STL (sort, find, transform, etc.) efficiently? Mar 12, 2025 pm 04:52 PM

This article details efficient STL algorithm usage in C . It emphasizes data structure choice (vectors vs. lists), algorithm complexity analysis (e.g., std::sort vs. std::partial_sort), iterator usage, and parallel execution. Common pitfalls like

How do I handle exceptions effectively in C  ? How do I handle exceptions effectively in C ? Mar 12, 2025 pm 04:56 PM

This article details effective exception handling in C , covering try, catch, and throw mechanics. It emphasizes best practices like RAII, avoiding unnecessary catch blocks, and logging exceptions for robust code. The article also addresses perf

How do I use rvalue references effectively in C  ? How do I use rvalue references effectively in C ? Mar 18, 2025 pm 03:29 PM

Article discusses effective use of rvalue references in C for move semantics, perfect forwarding, and resource management, highlighting best practices and performance improvements.(159 characters)

How do I use move semantics in C   to improve performance? How do I use move semantics in C to improve performance? Mar 18, 2025 pm 03:27 PM

The article discusses using move semantics in C to enhance performance by avoiding unnecessary copying. It covers implementing move constructors and assignment operators, using std::move, and identifies key scenarios and pitfalls for effective appl

How do I use ranges in C  20 for more expressive data manipulation? How do I use ranges in C 20 for more expressive data manipulation? Mar 17, 2025 pm 12:58 PM

C 20 ranges enhance data manipulation with expressiveness, composability, and efficiency. They simplify complex transformations and integrate into existing codebases for better performance and maintainability.

How does dynamic dispatch work in C   and how does it affect performance? How does dynamic dispatch work in C and how does it affect performance? Mar 17, 2025 pm 01:08 PM

The article discusses dynamic dispatch in C , its performance costs, and optimization strategies. It highlights scenarios where dynamic dispatch impacts performance and compares it with static dispatch, emphasizing trade-offs between performance and

C language data structure: data representation and operation of trees and graphs C language data structure: data representation and operation of trees and graphs Apr 04, 2025 am 11:18 AM

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.

See all articles