清理 STL 列表/指针向量
为了安全地清理std::vector 或std::list 的指针，你能想到的最短的C++ 块是什么?(假设您必须在指针上调用 delete ?)
What is the shortest chunk of C++ you can come up with to safely clean up a std::vector or std::list of pointers? (assuming you have to call delete on the pointers?)
list<Foo*> foo_list;
我宁愿不使用 Boost 或用智能指针包裹我的指针.
I'd rather not use Boost or wrap my pointers with smart pointers.
推荐答案
既然我们要在这里挑战...最短的 C++ 代码块"
Since we are throwing down the gauntlet here... "Shortest chunk of C++"
static bool deleteAll( Foo * theElement ) { delete theElement; return true; }
foo_list . remove_if ( deleteAll );
我认为我们可以相信提出 STL 的人拥有高效的算法.为什么要重新发明轮子?
I think we can trust the folks who came up with STL to have efficient algorithms. Why reinvent the wheel?
相关文章