


How Does Microsoft Visual C 's Two-Phase Template Lookup Differ from the Standard, and What are the Consequences?
The Misunderstood Two-Phase Template Lookup in Microsoft Visual C
Introduction
Two-phase template instantiation, also known as early and late lookup, is a crucial aspect of C template programming. However, Microsoft's Visual C (MSVC) implementation of this feature has faced scrutiny for reportedly being inadequate.
Two-Phase Lookup in Theory
In a standard C compiler, two-phase lookup applies to template functions and classes. In the first phase, the compiler performs a syntax check, identifying declarations with the appropriate name. The actual lookup and binding of names are deferred until the second phase, which occurs during template instantiation.
MSVC's Limited Implementation
Contrary to expectations, MSVC's template lookup is limited. In the first phase, it only performs basic syntax checking. The problem arises in the second phase, where it fails to:
- Perform early lookup: MSVC doesn't fully adhere to early lookup, as it postpones checking non-dependent names until template instantiation.
- Extend non-ADL lookup: During the second phase, MSVC incorrectly extends non-ADL lookup to include declarations added after the template definition. This behavior deviates from the standard, which only allows ADL-nominated namespaces to be extended.
Consequences of Broken Lookup
The flawed implementation of two-phase lookup in MSVC can lead to errors during template instantiation. For instance, consider the following code:
int foo(void*); template<typename T> struct S { S() { int i = foo(0); } }; void foo(int); int main() { S<int> s; }
In this example, a standard-compliant compiler would perform early lookup and bind 'foo(0)' to 'foo(void*)' in the constructor. However, MSVC would defer lookup until instantiation, causing a compilation error due to the ambiguous overload for 'foo'.
Conclusion
While MSVC offers a basic implementation of two-phase template lookup, it falls short of the standard's expectations. The incomplete early lookup and incorrect extension of non-ADL lookup can introduce errors and limit the usability of templates in MSVC-based projects. Understanding these limitations is crucial for effectively handling template-based code in this environment.
The above is the detailed content of How Does Microsoft Visual C 's Two-Phase Template Lookup Differ from the Standard, and What are the Consequences?. 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.
