Question regarding sizing a very basic stack.

[jjordan33]

Hi, so I have(hopefully), an extremely basic stack implementation. As far as functionality goes, it's useless. I'm just studying the proper creation. My code works, but I'm doing no sizing or resizing. I feel like this should be wrong since I'm using a vector(I think) to implement it.

Is there anything wrong with the following code?

Thank you.

#include <iostream>
#include <stack>
#include <list>

using namespace std;

int main(){

    stack<int> s;
    for (int i = 0; i < 10; i++){
        s.push(i);
    }
    
    while(!s.empty()){
        cout << "size is " << s.size() << endl;
        cout << "removing s. " << s.top() << endl;
        s.pop();
    }
    
}

[Ganado]

My code works, but I'm doing no sizing or resizing.

Yes you are. Elements are added to the top by calls to push, and elements are removed from the top with pop.

The possibility that a stack might internally be implemented by using a vector is inconsequential (ideally). All you should care about is the public interface of the stack, which are functions like push(), pop(), top(), etc.

[jjordan33]

Understood.
So sizing happens automatically with push and pop.

Thanks!