Heterogeneous lookup allows you to access elements of different types from a collection like std::vector. In C++, std::vector can store objects of a common base class, allowing for polymorphic behavior. Below is an example demonstrating how to do this.
#include <iostream>
#include <vector>
#include <memory>
class Base {
public:
virtual void show() const {
std::cout << "Base class" << std::endl;
}
virtual ~Base() {}
};
class DerivedA : public Base {
public:
void show() const override {
std::cout << "DerivedA class" << std::endl;
}
};
class DerivedB : public Base {
public:
void show() const override {
std::cout << "DerivedB class" << std::endl;
}
};
int main() {
std::vector<std::unique_ptr<Base>> vec;
vec.push_back(std::make_unique<DerivedA>());
vec.push_back(std::make_unique<DerivedB>());
for (const auto& item : vec) {
item->show(); // Heterogeneous lookup
}
return 0;
}
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?