$//$ Student ID: $20537016$

$//$ TODO $-$ Replace the number above with your actual student ID

$//$

#ifndef Stacks$\_$h

#define Stacks$\_$h

#include

#include

class Stack$\_$Int $\{$

private:

std::vector $\_$data;

public:

$//$ No explicit constructor or destructor

size$\_$t size$()$ const $\{$

return $\_$data.size $()$;

$\}$

bool is$\_$empty$()$ const $\{$

return $(\_$data.size$()==0)$;

$\}$

void push$($int val$)\{$

$\_$data.push$\_$back $($val$)$;

$\}$

int top$($bool& success$)$ const $\{$

if $($is$\_$empty$())\{$

success $=$ false;

return $0$;

$\}$

else $\{$

success $=$ true;

return $\_$data.back$()$;

$\}$

$\}$

bool pop$()\{$

if $($is$\_$empty$())$ return false;

$\_$data.pop$\_$back$()$;

return true;

$\}$

bool pop$($int& val$)\{$

if $($is$\_$empty$())\{$

val $=0$;

return false;

$\}$

val $=\_$data.back$()$;

$\_$data.pop$\_$back$()$;

return true;

$\}$

std::string to$\_$string$()$ const $\{$

std::stringstream ss;

ss $<<$ "Stack $("<<$ size$()<<"$ elements$)$:$"<<$ std::endl;

size$\_$t count $=$ std::min$($size$(),$ static$\_$cast$(10))$;

for $($size$\_$t i $=0$; i $<$ count; $++$i$)\{$

ss $<<\_$data$[$size$()-1-$ i$]<<$ std::endl;

$\}$

if $($size$()>10)\{$

ss $<<"..."<<$ std::endl;

$\}$ else $\{$

ss $<<$ "Elements, if listed above, are in increasing order of age." $<<$ std::endl;

$\}$

return ss$.$str$()$;

$\}$

$//$ Don't remove the following line

friend class Tests;

$\}$;

class Stack$\_$String $\{$

private:

std::vector $\_$data;

public:

$//$ No explicit constructor or destructor

size$\_$t size$()$ const $\{$

return $\_$data.size $()$;

$\}$

bool is$\_$empty$()$ const $\{$

return $(\_$data.size$()==0)$;

$\}$

void push$($std::string val$)\{$

$\_$data.push$\_$back $($val$)$;

$\}$

std::string top$($bool& success$)$ const $\{$

if $($is$\_$empty$())\{$

success $=$ false;

return $""$;

$\}$

else $\{$

success $=$ true;

return $\_$data.back$()$;

$\}$

$\}$

bool pop$()\{$

if $($is$\_$empty$())$ return false;

$\_$data.pop$\_$back$()$;

return true;

$\}$

bool pop$($std::string& val$)\{$

if $($is$\_$empty$())\{$

val $=""$;

return false;

$\}$

val $=\_$data.back$()$;

$\_$data.pop$\_$back$()$;

return true;

$\}$

std::string to$\_$string$()$ const $\{$

std::stringstream ss;

ss $<<$ "Stack $("<<$ size$()<<"$ elements$)$:$"<<$ std::endl;

size$\_$t count $=$ std::min$($size$(),$ static$\_$cast$(10))$;

for $($size$\_$t i $=0$; i $<$ count; $++$i$)\{$

ss $<<\_$data$[$size$()-1-$ i$]<<$ std::endl;

$\}$

if $($size$()>10)\{$

ss $<<"..."<<$ std::endl;

$\}$ else $\{$

ss $<<$ "Elements, if listed above, are in increasing order of age." $<<$ std::endl;

$\}$

return ss$.$str$()$;

$\}$

$//$ Don't remove the following line

friend class Tests;

$\}$;

#endif $/*$ Stacks$\_$h $*/$ i wrote this code but still get an error it produces $12$ lines of ouput i dont know why this is the error Checkpoint failed. Your to$\_$string said:

Stack $(1153$ elements$)$:

$939097459$

$...$

But mine said:

Stack $(1153$ elements$)$:

$939097459$

$399880531$

$1884690413$

$613786391$

$1689761316$

$1347193144$

$1958521095$

$1128232408$

$795947141$

$1906976398$

$...$

Elements, if listed above, are in increasing order of age.

Here is your stack:

Stack $(1153$ elements$)$:

$939097459$

$399880531$

$1884690413$

$613786391$

$1689761316$

$1347193144$

$1958521095$

$1128232408$

$795947141$

$1906976398$

$1987018806$

$962635635$

$...$

Elements, if listed above, are in increasing order of age.

And here is mine:

Stack $(1153$ elements$)$:

$939097459$

$399880531$

$1884690413$

$613786391$

$1689761316$

$1347193144$

$1958521095$

$1128232408$

$795947141$

$1906976398$

$...$

Elements, if listed above, are in increasing order of age.

You think that's it$?$