Almost everything about deque (stl cpp)

 

Almost everything about deque (stl cpp)

#include<bits/stdc++.h>

using namespace std;

int main()

{

    deque<int> dq;  //declaration

    dq.push_back(1);

    dq.push_back(3);//value input

    dq.push_back(4);

    dq.push_back(5);

    dq.push_front(10);

    dq.push_front(11);

     dq.push_back(5);

    dq.push_front(10);

    dq.push_front(11);

    cout<<dq.size()<<endl; // size print

    for(int i=0;i<dq.size();i++)  //print value;

    {

        cout<<dq[i]<<" ";

      //  cout<<dq.at(i)<<" ";// another way

    }

   cout<<endl;

   cout<<dq.front()<<endl;  //print front value

  cout<<dq.back()<<endl;

   dq.pop_front();

 cout<<dq.front()<<endl;

 dq.pop_back();

 cout<<dq.back()<<endl;

 auto it1=dq.begin();

 dq.erase(it1);//single erase

 cout<<dq.front()<<endl;

 auto it2=dq.begin()+2;

 dq.erase(it1,it2);

 cout<<dq.front()<<endl;

 if(dq.empty())cout<<"Empty\n";

 else cout<<"Not empty\n";

 dq.clear();

 if(dq.empty())cout<<"Empty\n";

 else cout<<"Not empty\n";

   auto it3=dq.end();

   dq.insert(it3,500);

   cout<<dq.front()<<endl;

    return 0;

}