Advertisement
Guest User

Untitled

a guest
Jul 24th, 2017
68
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.98 KB | None | 0 0
  1. std::vector<T*> elemArray;
  2.  
  3. for (size_t i = 0; i < elemArray.size(); ++i)
  4. {
  5. elemArray = new T();
  6. }
  7.  
  8. std::vector<T> elemArray;
  9. for (size_t i = 0; i < elemCount; ++i) {
  10. elemArray.push_back(T(i));
  11. }
  12.  
  13. std::vector<T> elemArray(numberOfElements);
  14.  
  15. for (size_t i = 0; i < someSize ; ++i)
  16. {
  17. elemArray.push_back(new T());
  18. }
  19.  
  20. Item items[2000000]; // stack overflow
  21.  
  22. std::vector<Item> items(2000000);
  23.  
  24. elemArray[i] = new (GetNextContinuousAddress()) T();
  25.  
  26. int sz = sizeof(T);
  27. int maxelements = 100000;
  28.  
  29. T *obj = new T [100000];
  30.  
  31. vector<T *> vectorofptr;
  32.  
  33. for (int i = 0; i < maxelements; i++)
  34. {
  35. vectorofptr.push_back(&obj[i]);
  36. }
  37.  
  38. int sz = sizeof(T);
  39. int maxelements = 100000;
  40.  
  41. void *base = calloc(maxelements, sz); //need to save base for free()
  42.  
  43. vector<T *> vectorofptr;
  44. int offset = 0;
  45.  
  46. for (int i = 0; i < maxelements; i++)
  47. {
  48. vectorofptr.push_back((T *) base + offset);
  49. offset += sz;
  50. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement