Deque Front Back

A deque can add items at both ends, which makes it useful for small queues and buffers.

deque_front_back.cpp

#include <deque>
#include <iostream>

int main() {
    int firstJob = ;

    std::deque<int> jobs;
    jobs.push_back(30);
    jobs.push_front(firstJob);

    int front = jobs.front();
    int back = jobs.back();

    std::cout << "front=" << front << std::endl;
    std::cout << "back=" << back << std::endl;
    return 0;
}

#include <deque>
#include <iostream>

int main() {
    int firstJob = ;

    std::deque<int> jobs;
    jobs.push_back(30);
    jobs.push_front(firstJob);

    int front = jobs.front();
    int back = jobs.back();

    std::cout << "front=" << front << std::endl;
    std::cout << "back=" << back << std::endl;
    return 0;
}

#include <deque>
#include <iostream>

int main() {
    int firstJob = ;

    std::deque<int> jobs;
    jobs.push_back(30);
    jobs.push_front(firstJob);

    int front = jobs.front();
    int back = jobs.back();

    std::cout << "front=" << front << std::endl;
    std::cout << "back=" << back << std::endl;
    return 0;
}

deque A `std::deque` supports efficient insertion and removal at the front and back.

front `front` reads the value at the beginning without removing it.