deque-back

////////////////////////////////////////
//      2018/04/23 12:12:04
//      deque-back

#include <iostream>
#include <deque>
#include <string>
#include <iterator>

using namespace std;

template<class T, class D>
class Member
{
private:
    T name;
    D sal;
public:
    Member(T t, D d) :name(t), sal(d){}
    void print();
};

template<class T, class D>
void Member<T,D>::print(){
    cout << name << " " << sal << endl;
}
int main(){
    typedef Member<string, double> M;
    deque<M> d;
    d.push_back(M("Robert",6000));
    d.push_back(M("Linda",7500));

    deque<M>::iterator it = d.begin();
    cout << "Enter deque:" << endl;
    while (it != d.end()){
        (it++)->print();
    }
    cout << endl;
    cout << "Return from back()" << endl;
    d.back().print();
    return 0;
}


/*
OUTPUT:
    Enter deque:
    Robert 6000
    Linda 7500

    Return from back()
    Linda 7500
*/