C++ print 1d 2d vector and other containers by template and operator<< overload

C++STL-IO.cpp

// all container which support range-for-loop
template <typename T, template <typename> class Container>
ostream &operator<<(ostream &os, const Container<T>& v) {
    for (auto i : v) os << i << " ";
    return os << endl;
}

// ========================== vector ==============================
template <typename T>
ostream &operator<<(ostream &os, const vector<T>& v) {
    for (auto i : v) os << i << " ";
    return os << endl;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>>& v) {
    for (auto i : v) os << i;
    return os << endl;
}

// ======================  list =====================================
template <typename T>
ostream &operator<<(ostream &os, const list<T>& v) {
    for (auto i : v) os << i << " ";
    return os << endl;
}

// ===========================   deque    ===========================
template <typename T>
ostream &operator<<(ostream &os, const deque<T>& v) {
    for (auto it = v.begin(); it != v.end(); ++it) os << *it << " ";
    return os << endl;
}


// ==========================  queue stack ==========================
template <typename T>
ostream &operator<<(ostream &os, queue<T> st) { // pass by value
    for (; !st.empty(); st.pop()) os << st.front() << " ";
    return os << endl;
}
template <typename T>
ostream &operator<<(ostream &os, stack<T> st) { // pass by value
    for (; !st.empty(); st.pop()) os << st.top() << " ";
    return os << endl;
}

// ========================= priority_queue   ======================
template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> st) { // pass by value
    for (; !st.empty(); st.pop()) os << st.top() << " ";
    return os << endl;
}