Custom Dynamic Array Container Library

Project roadmap

1. 01

   Create the basic container

   ~2h

   Set up a CMake project with GoogleTest (with FetchContent). Write a class template Vector<T> that manages raw memory (allocated with ::operator new, not new T[], so objects are only constructed when added), with size and capacity, push_back (constructing in place with placement new), operator[] and a checked at() that throws std::out_of_range, and a destructor that destroys the elements then frees the memory. Done when: a Vector<std::string> can be filled and read, and a simple test passes.

2. 02

   Grow the capacity

   ~1.5h

   When full, allocate double the capacity (starting at 1), move the elements into the new memory (with std::move_if_noexcept, so types whose move may throw are copied instead), destroy the old ones, and free the old memory. Add reserve(), shrink_to_fit(), pop_back(), clear() and emplace_back (with perfect forwarding). Done when: tests show capacity grows by doubling, and elements survive growth.

3. 03

   Add copy and move

   ~2h

   Implement the rule of five: a copy constructor and copy assignment (using copy-and-swap for exception safety), a move constructor and move assignment that steal the other vector's buffer and leave it empty (marked noexcept), and the destructor. Handle self-assignment. Done when: tests show copies are independent, and moved-from vectors are empty but still usable.

4. 04

   Add iterators

   ~2h

   Add begin(), end(), cbegin() and cend() returning random-access iterators (plain pointers are enough, or write an iterator class with the right iterator category), plus insert and erase at a position. Make sure std::sort, std::find and range-based for loops work with your Vector. Done when: STL algorithms work on your Vector in tests.

5. 05

   Test thoroughly

   ~2.5h

   Write a Google Test suite with a helper type that counts constructions, copies, moves and destructions: no leaks or double destructions, moves used when growing, exception safety (a type that throws on the Nth copy must leave the vector unchanged), bounds checking, and iterator correctness. Run the tests with AddressSanitizer. Done when: all tests pass with no sanitizer errors.

6. 06

   Compare with std::vector

   ~1h

   Write a small benchmark comparing push_back, access and iteration speed with std::vector for ints and strings (with std::chrono or Google Benchmark), and explain any differences in README.md. Done when: README.md shows the comparison and explains it.

Resources

• Docsstd::vector (cppreference)
• DocsThe rule of three/five/zero (cppreference)
• DocsPlacement new (cppreference)
• Docsstd::move_if_noexcept (cppreference)
• DocsGoogleTest primer