ds/queue.hpp

• View this file on GitHub
• Last update: 2022-07-12 17:31:52+03:00
• Include: #include "ds/queue.hpp"

Required by

• graph/bipartite-graph.hpp
• graph/maxflow.hpp
• graph/vertex-cover-small-ans.hpp

Code

#pragma once

template<typename T>
struct simple_queue {
    vector<T> arr;
    int pos = 0;
    void reserve(int n) { arr.reserve(n); }
    int size() const { return sz(arr) - pos; }
    bool empty() { return pos == sz(arr); }
    void push(const T& t) { arr.push_back(t); }
    T& front() {
        return arr[pos];
    }
    void clear() {
        arr.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

#line 2 "ds/queue.hpp"

template<typename T>
struct simple_queue {
    vector<T> arr;
    int pos = 0;
    void reserve(int n) { arr.reserve(n); }
    int size() const { return sz(arr) - pos; }
    bool empty() { return pos == sz(arr); }
    void push(const T& t) { arr.push_back(t); }
    T& front() {
        return arr[pos];
    }
    void clear() {
        arr.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

Back to top page