In C++, two-phase lookup is a mechanism that involves two distinct phases during name resolution. This is primarily used in the context of template instantiation. The first phase looks up the names in the scope, while the second phase rechecks all the names after the template is instantiated. This allows for more flexible and powerful template programming, giving the compiler the ability to resolve names at different stages.
template
void func() {
T::member; // First phase lookup
}
struct A {
static void member() {}
};
void example() {
func(); // Second phase lookup, where "A::member" is resolved
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?