Hard
Sorter cleans up its strategy
What happens when this program runs?
main.cpp
struct SortStrategy { // no virtual destructor
virtual void sort(std::vector<int>& v) = 0;
};
struct LoggingQuickSort : SortStrategy {
std::vector<std::string> auditLog; // owns heap-allocated storage (via vector)
void sort(std::vector<int>& v) override {
auditLog.push_back("sorted " + std::to_string(v.size()) + " elements");
std::sort(v.begin(), v.end());
}
~LoggingQuickSort() { std::cout << "LoggingQuickSort dtor, log size=" << auditLog.size() << "\n"; }
};
class Sorter {
public:
explicit Sorter(SortStrategy* s) : strategy_(s) {}
~Sorter() { delete strategy_; } // deletes through the base pointer
void run(std::vector<int>& v) { strategy_->sort(v); }
private:
SortStrategy* strategy_;
};
int main() {
std::vector<int> data{3, 1, 2};
{
Sorter s(new LoggingQuickSort());
s.run(data);
} // Sorter destructs -> delete strategy_
}26 of 44 in Design Patterns