/* ************************************************************************** */ /* */ /* ::: :::::::: */ /* main.cpp :+: :+: :+: */ /* +:+ +:+ +:+ */ /* By: apommier +#+ +:+ +#+ */ /* +#+#+#+#+#+ +#+ */ /* Created: 2022/08/07 23:20:40 by apommier #+# #+# */ /* Updated: 2022/08/07 23:37:58 by apommier ### ########.fr */ /* */ /* ************************************************************************** */ #include "MutantStack.hpp" int main_2() { std::list mstack; mstack.push_back(5); mstack.push_back(17); std::cout << mstack.back() << std::endl; mstack.pop_back(); std::cout << mstack.size() << std::endl; mstack.push_back(3); mstack.push_back(5); mstack.push_back(737); //[...] mstack.push_back(0); std::list::iterator it = mstack.begin(); std::list::iterator ite = mstack.end(); ++it; --it; while (it != ite) { std::cout << *it << std::endl; ++it; } std::list s(mstack); return (0); } int main() { MutantStack mstack; mstack.push(5); mstack.push(17); std::cout << mstack.top() << std::endl; mstack.pop(); std::cout << mstack.size() << std::endl; mstack.push(3); mstack.push(5); mstack.push(737); //[...] mstack.push(0); MutantStack::iterator it = mstack.begin(); MutantStack::iterator ite = mstack.end(); ++it; --it; while (it != ite) { std::cout << *it << std::endl; ++it; } std::stack s(mstack); std::cout << "\n====================LIST CONTAINER TURN====================\n"; main_2(); return (0); }