Variance and invariance are important concepts in programming, particularly in type systems. They determine how type parameters behave in relation to subtyping. However, developers often make some common mistakes while working with them. Here are a few:
// Example in PHP demonstrating covariance and contravariance
class Animal {}
class Dog extends Animal {}
class Cat extends Animal {}
class Box<T> {
private $item;
public function addItem(T $item) {
$this->item = $item;
}
public function getItem(): T {
return $this->item;
}
}
$dogBox = new Box<Dog>();
$dogBox->addItem(new Dog());
// This would be a type error
// $animalBox = new Box<Animal>();
// $animalBox->addItem(new Dog());
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?