CPP-Exercises VS Data_Structures_in_Cpp

I tried to implement a Template Queue Container and looking for some good reviews.

Previously, I had implemented the std::vector all by myself. I had imitated nearly all behaviours of it. You can see it here. I used the placement new widely while implementing it. But, all the resources were allocated in the heap. I don't how good is to use the placement new on the statically allocated area of the stack. Let me think on it :)

Here is the source code!

I just implemented many parts of the STL's Template Vector Container. And, after completing the implementation phase, I tried to determine the noexcept conditions of the member methods. I wonder if the conditions that I determined are applicable. You can find the implementation here.

For a while, I have been trying to implement the STL container from scratch to make some C++ exercises. My most recent work is the Template Vector Container.

Oh no, that's a thing that I've already done in a different exercise. It was also a template array container but for powerful systems with dynamic allocation features. Check it out!

Template Array Container in C++ | Caglayan DOKME

Doubly Linked List in C++ - Caglayan DOKME