Looking for C++ STL-like vector class but using stack storage

by

You don’t have to write a completely new container class. You can stick with your STL containers, but change the second parameter of for example std::vector to give it your custom allocator which allocates from a stack-buffer. The chromium authors wrote an allocator just for this:

https://chromium.googlesource.com/chromium/chromium/+/master/base/stack_container.h

It works by allocating a buffer where you say how big it is. You create the container and call container.reserve(buffer_size);. If you overflow that size, the allocator will automatically get elements from the heap (since it is derived from std::allocator, it will in that case just use the facilities of the standard allocator). I haven’t tried it, but it looks like it’s from google so i think it’s worth a try.

Usage is like this:

StackVector<int, 128> s;
s->push_back(42); // overloaded operator->
s->push_back(43);

// to get the real std::vector. 
StackVector<int, 128>::ContainerType & v = s.container();
std::cout << v[0] << " " << v[1] << std::endl;

More Related Contents:

  1. Thou shalt not inherit from std::vector
  2. What’s the most efficient way to erase duplicates and sort a vector?
  3. std::vector::resize() vs. std::vector::reserve()
  4. Is std::vector so much slower than plain arrays?
  5. vector vs. list in STL
  6. How do I erase an element from std::vector by index?
  7. Alternative to vector
  8. Why does the C++ STL not provide any “tree” containers?
  9. How to avoid memory leaks when using a vector of pointers to dynamically allocated objects in C++?
  10. How to get std::vector pointer to the raw data?
  11. C++ Erase vector element by value rather than by position? [duplicate]
  12. Vectors, structs and std::find
  13. iterate vector, remove certain items as I go
  14. Does vector::erase() on a vector of object pointers destroy the object itself?
  15. How do I print the elements of a C++ vector in GDB?
  16. What’s faster, iterating an STL vector with vector::iterator or with at()?
  17. Is the use of std::vector objects in C++ acceptable, or should I use an alternative?
  18. array vs vector vs list
  19. Cleaning up an STL list/vector of pointers
  20. Efficiency of the STL priority_queue
  21. How to downsize std::vector?
  22. C++ convert vector to vector
  23. What happens if you increment an iterator that is equal to the end iterator of an STL container
  24. std::vector reserve() and push_back() is faster than resize() and array index, why?
  25. Vector Iterators Incompatible
  26. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  27. std::vector capacity after copying
  28. Why does using push_back on a vector declared with size result in a vector of zeros?
  29. C++ template function compiles in header but not implementation
  30. vector and const

Leave a Comment