Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- std::vector<T*> elemArray;
- for (size_t i = 0; i < elemArray.size(); ++i)
- {
- elemArray = new T();
- }
- std::vector<T> elemArray;
- for (size_t i = 0; i < elemCount; ++i) {
- elemArray.push_back(T(i));
- }
- std::vector<T> elemArray(numberOfElements);
- for (size_t i = 0; i < someSize ; ++i)
- {
- elemArray.push_back(new T());
- }
- Item items[2000000]; // stack overflow
- std::vector<Item> items(2000000);
- elemArray[i] = new (GetNextContinuousAddress()) T();
- int sz = sizeof(T);
- int maxelements = 100000;
- T *obj = new T [100000];
- vector<T *> vectorofptr;
- for (int i = 0; i < maxelements; i++)
- {
- vectorofptr.push_back(&obj[i]);
- }
- int sz = sizeof(T);
- int maxelements = 100000;
- void *base = calloc(maxelements, sz); //need to save base for free()
- vector<T *> vectorofptr;
- int offset = 0;
- for (int i = 0; i < maxelements; i++)
- {
- vectorofptr.push_back((T *) base + offset);
- offset += sz;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement