In C++, class templates allow you to create classes that can handle any data type. This is particularly useful for creating generic classes such as containers and algorithms. Below is an example of how to write a class template in C++.
template <typename T>
class Box {
private:
T item;
public:
Box(T item) : item(item) {}
T getItem() {
return item;
}
};
int main() {
Box<int> intBox(123);
Box<std::string> strBox("Hello, world!");
std::cout << intBox.getItem() << std::endl; // Outputs: 123
std::cout << strBox.getItem() << std::endl; // Outputs: Hello, world!
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?