Advertisement
Guest User

Untitled

a guest
Jul 25th, 2014
211
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.93 KB | None | 0 0
  1. class A {
  2. public:
  3. void doSomething() {}
  4. }
  5. boost::unordered_map<int, boost::intrusive_ptr<A>> m;
  6. m.insert(0, new A());
  7. m.insert(1, new A());
  8. m.insert(2, new A());
  9.  
  10. // later...
  11. std::vector<boost::intrusive_ptr<A>> f;
  12. boost::unordered_map<int, boost::intrusive_ptr<A>>::iterator i;
  13.  
  14. i = m.find(0);
  15. f.push_back(i->second);
  16. i = m.find(1);
  17. f.push_back(i->second);
  18. i = m.find(2);
  19. f.push_back(i->second);
  20.  
  21. // and then do operations on f:
  22. for(size_t i = 0; i < f.size(); ++i) {
  23. f[i].doSomething();
  24. }
  25.  
  26. class A {
  27. public:
  28. void doSomething() {}
  29. }
  30. boost::ptr_unordered_map<int, A> m;
  31. m.insert(0, new A());
  32. m.insert(1, new A());
  33. m.insert(2, new A());
  34.  
  35. // later...
  36. boost::ptr_vector<A> f;
  37. boost::ptr_unordered_map<int, A>::iterator i;
  38.  
  39. i = m.find(0);
  40. f.push_back(i->second);
  41. i = m.find(1);
  42. f.push_back(i->second);
  43. i = m.find(2);
  44. f.push_back(i->second);
  45.  
  46. // and then do operations on f:
  47. for(size_t i = 0; i < f.size(); ++i) {
  48. f[i].doSomething();
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement