// Visitor interface
class IVisitor {
public:
virtual void visit(class Player& player) = 0;
virtual void visit(class Enemy& enemy) = 0;
};
// Game objects
class GameObject {
public:
virtual void accept(IVisitor& visitor) = 0;
};
class Player : public GameObject {
public:
void accept(IVisitor& visitor) override {
visitor.visit(*this);
}
};
class Enemy : public GameObject {
public:
void accept(IVisitor& visitor) override {
visitor.visit(*this);
}
};
// Concrete Visitor
class DamageCalculator : public IVisitor {
public:
void visit(Player& player) override {
// Calculate damage for player
std::cout << "Calculating damage for player" << std::endl;
}
void visit(Enemy& enemy) override {
// Calculate damage for enemy
std::cout << "Calculating damage for enemy" << std::endl;
}
};
// Usage
int main() {
Player player;
Enemy enemy;
DamageCalculator damageCalculator;
player.accept(damageCalculator);
enemy.accept(damageCalculator);
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?